Font size
S
M
L
XL
WorksheetsDe thi Common 17.5.2023
Total questions: 66
Worksheet time: 1hrs 6mins
Name
Class
Date
1.
All problems can be expressed according to a general scheme as follows: A =>B
Then which of following is correct with above general scheme?
a)
A is input
b)
B is output
c)
=> is a computer program that gives output B with input A
d)
All of them
2.
Which of the following is not computer language?
a)
Assembly language
b)
Machine language
c)
High level language
d)
Medium level langugae
3.
A programming language which is close to close to human language is?
a)
Assembly language
b)
Machine language
c)
High level language
d)
Medium level langugae
4.
Machine language is?
a)
The language that is directly understood by the computer without translation program
b)
error prone
c)
difficult to program
d)
All of them
5.
Which of following is correct?
a)
Assembly language is considered a high level language
b)
Assembly language is considered a low level language
c)
Assembly language is considered a machine language
d)
Assembly languages consists of binaries, which are zeros and ones
6.
Which of following is correct?
a)
Machine language is considered a high level language
b)
Machine language is considered a Assembly language
c)
Machine language consists of binaries, which are zeros and ones
d)
None of these
7.
Which of following is correct?
a)
Flowcharting is the process of illustrating workflows and data flows in a system through symbols and diagrams
b)
Flowcharting is an important tool to assist the system analyst in identifying a solution to the problem
c)
Flowcharting is depicts the components of the system visually
d)
All of them
8.
Which of following is correct?
a)
Object Oriented Programming is a trend of High level language
b)
Structured Programming is a trend of High level language
c)
Logical Programming is a trend of High level language
d)
All of them
9.
Which of following is correct?
a)
Imperative programming is a programming paradigm that describes computation in terms of statements that change a program state
b)
Declarative programming is a programming paradigm that describes computation in terms of statements that change a program state
c)
Declarative programming is a type of programming that used statements to give commands to the computer for actions that are to be followed
d)
None of these
10.
A computer program that converts an entire program into machine language is called a/an?
a)
Interpreter
b)
Compiler
c)
Simulator
d)
Commander
11.
A computer program that translates program one statement at a time is called a/an?
a)
Interpreter
b)
Compiler
c)
Simulator
d)
Commander
12.
C language is a ..?
a)
High level language
b)
Low level language
c)
Medium level langugae
d)
None of these
13.
JavaScript uses ..?
a)
Interpreter
b)
Compiler
c)
Simulator
d)
Commander
14.
What is the method to get the top element of the Stack and remove it from the stack?
a)
push()
b)
pop()
c)
top()
d)
size()
15.
Which method to get the element into the queue first, but not remove it from the queue
a)
enqueue()
b)
dequeue()
c)
front()
d)
size()
16.
Is it possible to change the number of elements of a 1D array while the program is running?
a)
Yes
b)
No
17.
Node in a linked list contain two things?
a)
Direction and pointer
b)
A pointer and reference
c)
Data and pointer
d)
A pointer and a node
18.
In a doubly linked list structure, where does the last element's next pointer point to?
a)
First
b)
NULL
c)
Next
d)
Previous
19.
What does the next pointer of the last element in a singly linked list point to?
a)
Next
b)
First
c)
Last
d)
NULL
20.
What type linked list is represented in the above image?
a)
circular singly linked list
b)
singly linked list
c)
doubly linked list
d)
circular doubly linked list
21.
A collection of a fixed number of components arranged in rows and columns, wherein all components are of the same type is called as?
a)
1D
b)
2D
c)
3D
d)
None above
22.
Merge Sort algorithm is based on which algorithm?
a)
Greedy
b)
Divide and conquer
c)
Branch & Bound
d)
Dynamic Programing
23.
Works by selecting a 'pivot' element from the array and partitioning the other elements into two sub-arrays
a)
Bubble Sort
b)
Merge Sort
c)
Insertion Sort
d)
Quick Sort
24.
What advantage does a linked list have over an array?
a)
Size of the list doesn't need to be specified at the beginning of the program
b)
The linked list doesn't have a size limit
c)
You can add or remove elements in the middle of the list no need to shift every element after.
d)
All of these are true
25.
Which of the following statements is true about Map?(multi-choice)
a)
A map models a searchable collection of key-value entries
b)
Multiple entries with the same key are allowed
c)
Multiple entries with the same key are not allowed
d)
Multiple entries with the same value are not allowed
26.
What method do we use to find an element in the Map with the key?
a)
begin()
b)
end()
c)
find(k)
d)
put(k, v)
27.
What is the main component of a hash table?(multi-choice)
a)
Map
b)
Linked list
c)
Hash function
d)
Bucket array
28.
How does the Stack work?
a)
Last In - First Out
b)
Last In- Last Out
c)
First In - First Out
29.
Consider an initially empty stack.
After the following operations are performed,
what is the value of Z?
a)
-2
b)
0
c)
1
d)
3
30.
How does the Queue work?
a)
Last In - First Out
b)
Last In - Last Out
c)
First In - First Out
31.
Which of the following statements is true about Priority Queue?(multi-choice)
a)
Storing a collection of prioritized elements
b)
Supporting arbitrary element insertion
c)
Supporting removal of elements in order of priority
d)
Non supporting removal of elements in order of priority
32.
What is the computational complexity when insert an element to the Heap?
a)
O(n)
b)
O(n/2)
c)
O(log(n))
d)
O(nlog(n))
33.
Starting from vertex A,
find the result of traversing the graph
according to the BFS algorithm
a)
A, B, E, C, F, D
b)
A, B, C, E, F, D
c)
A, B, C, F, D, E
d)
A, B, C, D, E, F
34.
what is output of following Pseudocode?
x = 15
if x > 15
print "go"
if x < 20
print "stop"
a)
stop
b)
go
c)
gostop
d)
stopgo
35.
what is output of following Pseudocode?
Integer a, b, c
Set b = 4, c = 5
for(each a from 2 to 4)
print c
b = b - 1
c = c + b
end for
a)
1 3 6
b)
5 8 10
c)
3 6 9
d)
5 6 7
36.
what is output of following Pseudocode?
a = 1
loop while a < 10
print a
a = a + 2
a)
2468
b)
13579
c)
123456789
d)
3579
37.
what is output of following Pseudocode?
x = 10
sum = 0
loop while x > 3
sum = sum + x
x = x - 2
print sum
a)
32
b)
10
c)
28
d)
30
38.
Data flow diagramming is?
a)
The only process modeling currently used
b)
A detailed description of data
c)
Focused on the processes or activities that are performed
d)
Almost the same as a flow chart
39.
In data flow diagramming, a process is?
a)
A single piece of data
b)
A collection of data
c)
A trigger to a use case
d)
An activity or a function that is performed for some specific business reason
40.
In data flow diagramming. What is the "Customer" an example of in the following scenario?
a)
A data flow
b)
An external entity
c)
A data store
d)
A process
41.
In data flow diagramming. What does this symbol represent?
a)
A data flow
b)
An external entity
c)
A data store
d)
A process
42.
In data flow diagramming. What does this symbol represent?
a)
A data flow
b)
An external entity
c)
A data store
d)
A process
43.
In FlowChart. What does this symbol represent?
a)
Intput of Output
b)
Document
c)
Delay or wait
d)
start or end points
44.
In FlowChart. What does this symbol represent?
a)
Intput of Output
b)
Document
c)
Delay or wait
d)
start or end points
45.
TriPD: Where is the meeting room today?
QuanDH4: Take the elevator to go to the 11th floor, then turn right, then go to the end of the corridor, the meeting room is on the left
Which of the following statements is true about above conversation?
a)
Above conversation is a sample of Imperative Programming
b)
Above conversation is a sample of Declarative programming
c)
Above conversation is a sample of both Imperative Programming and Declarative programming
d)
None of these
46.
TriPD: Where is the meeting room today?
QuanDH4: "Singapore Port" Room (11th floor), Phạm Văn Bạch, Hà Nội
Which of the following statements is true about above conversation?
a)
Above conversation is a sample of Imperative Programming
b)
Above conversation is a sample of Declarative programming
c)
Above conversation is a sample of both Imperative Programming and Declarative programming
d)
None of these
47.
... is a collection of elements used to store the same type of data.
a)
Array
b)
Switch
c)
Case
d)
Loop
48.
int nums[] = {2, 3, 5, 8, 9, 10}
How would you access the fourth element in nums
a)
nums[4]
b)
nums[3]
c)
nums(8)
d)
nums(3)
49.
Which of the following is NOT a type of Data structures?
a)
Array
b)
Stack
c)
Table
d)
Queue
50.
Act of adding values into a stack is called?
a)
Popping
b)
Polling
c)
Pushing
d)
Top
51.
How many fields does the node of a singly linked list has?
a)
1
b)
2
c)
3
d)
4
52.
How many null pointer exists in a circular linked list?
a)
0
b)
1
c)
2
d)
3
53.
Which type of sort algorithm is this?
a)
Bubble sort
b)
Merge sort
c)
Insertion sort
54.
Which type of sort algorithm is this?
a)
Bubble sort
b)
Merge sort
c)
Insertion sort
d)
Quick sort
55.
Which sorting algorithm is described by: split a list into individual list, then combine these, two list at a time
a)
Bubble sort
b)
Insertion sort
c)
Merge sort
d)
Quick sort
56.
It's used to implement an associative array, a structure that can map keys to values
a)
Linked list
b)
Hashing
c)
Array
d)
Sorting
57.
When an algorithm generates the same address for different identifiers it's know as
a)
Knock
b)
Bang
c)
DoubleHash
d)
Collisions
58.
What is the worst case search time of hashing using separate chainging algorithm?
a)
O(N log N)
b)
O(N^2)
c)
O(N)
d)
O(N^3)
59.
The data structure used for Depth First Search (DFS) algorithm is?
a)
Stack
b)
Queue
c)
Both Stack & Queue
d)
None of these
60.
The data structure used for Breadth First Search (BFS) algorithm is?
a)
Stack
b)
Queue
c)
Both Stack & Queue
d)
None of these
61.
Which of the following are TRUE about Queue?
a)
Queue in data structure which follow FIFO concept
b)
Primary queue operations are enqueue and dequeue
c)
Queue allows node to be added or removed from the front (head)
d)
The similarity between queue and stack is on process for adding and removing data
62.
If letter 'D', 'C', 'B', 'A', are sequentially inserted into a queue, and the deleted one by one, in which sequence will the letter be deleted from the queue?
a)
A, B, C, D
b)
A, B, D, C
c)
D, C, A, B
d)
D, C, B, A
63.
Nodes in a single linked list contain two things?
a)
Direction and a pointer
b)
Data and a pointer
c)
Pointer and a link
d)
A pointer and a node
64.
Which of the following data structure is linear type?
a)
Stack
b)
Array
c)
Queue
d)
All of the above
65.
In stack insertion and deletion can take place only at one end call the ... of the stack
a)
Path
b)
Function
c)
Top
d)
Bottom
66.
In the ... traversal we process all of a vertex's descendents before we move to an adjacent vertex
a)
DFS
b)
BFS
Reset
