Question 1

Answer saved
Marked out of 1.00

Flag question

Question text

In a linked list, the ____________ contains the address of next element in the list.

Select one:
a. Info field
b. Start field
c. Next element field
d. Link field
Clear my choice

Question 2
Answer saved
Marked out of 1.00

Flag question

Question text

The situation when in a linked list START=NULL is ____________________.

Select one:
a. Saturated
b. Underflow
c. Overflow
d. Houseful
Clear my choice

Question 3
Answer saved
Marked out of 1.00
 Flag question

Question text

The dummy header in linked list contains ____________________.

Select one:
a. last record of the actual data
b. middle record of the actual data
c. first record of the actual data
d. pointer to the last record of the actual data
Clear my choice

Question 4
Answer saved
Marked out of 1.00

Flag question

Question text

Which of the following is two way lists?

Select one:
a. List traversed in two directions
b. Linked list with header and trailer nodes
c. Grounded header list
d. Circular header list
Clear my choice

Question 5
Answer saved
Marked out of 1.00
 Flag question

Question text

Linked lists are best suited _____________________.

Select one:
a. for the size of the structure and the data in the structure are constantly changing
b. for relatively permanent collections of data
c. data structure
d. for none of these situations
Clear my choice

Question 6
Answer saved
Marked out of 1.00

Flag question

Question text

Each node in singly linked list has _______ fields.

Select one:
a. 4
b. 2
c. 3
d. 1
Clear my choice

Question 7
Answer saved
Marked out of 1.00
 Flag question

Question text

The operation of processing each element in the list is known as ________________.

Select one:
a. traversal
b. merging
c. inserting
d. sorting
Clear my choice

Question 8
Answer saved
Marked out of 1.00

Flag question

Question text

Indexing the ________________ element in the list is not possible in linked lists.

Select one:
a. middle
b. first
c. anywhere in between
d. last
Clear my choice

Question 9
Answer saved
Marked out of 1.00
 Flag question

Question text

Each node in a linked list must contain at least ___________________.

Select one:
a. Five fields
b. Four fields
c. Two fields
d. Three fields
Clear my choice

Question 10
Answer saved
Marked out of 1.00

Flag question

Question text

A linear list in which the pointer points only to the successive node.

Select one:
a. circular linked list
b. none of these
c. doubly linked list
d. singly linked list

Question 1
Answer saved
Marked out of 1.00
 Flag question

Question text

This is the term used to delete an element from the stack.

Select one:
a. Push
b. Pull
c. Pump
d. Pop
Clear my choice

Question 2
Answer saved
Marked out of 1.00

Flag question

Question text

Which of the following is an application of stack?

Select one:
a. all of these
b. finding factorial
c. tower of Hanoi
d. infix to postfix
Clear my choice

Question 3
Answer saved
Marked out of 1.00
 Flag question

Question text

This is the insertion operation in the stack.

Select one:
a. push
b. top
c. pop
d. insert
Clear my choice

Question 4
Answer saved
Marked out of 1.00

Flag question

Question text

Stack follows the strategy of ________________.

Select one:
a. LIFO
b. RANDOM
c. LRU
d. FIFO
Clear my choice

Question 5
Answer saved
Marked out of 1.00
 Flag question

Question text

What is a queue?

Select one:
a. FILO
b. LOFI
c. LIFO
d. FIFO
Clear my choice

Question 6
Answer saved
Marked out of 1.00

Flag question

Question text

Which is the pointer associated with the stack?

Select one:
a. FRONT
b. TOP
c. REAR
d. FIRST
Clear my choice

Question 7
Answer saved
Marked out of 1.00
 Flag question

Question text

A pointer variable which contains the location at the top element of the stack.

Select one:
a. Last
b. End
c. Top
d. Final
Clear my choice

Question 8
Answer saved
Marked out of 1.00

Flag question

Question text

The term push and pop is related to _____________.

Select one:
a. trees
b. stacks
c. lists
d. array
Clear my choice

Question 9
Answer saved
Marked out of 1.00
 Flag question

Question text

What happens when you push a new node onto a stack?

Select one:
a. The new node is placed at the front of the linked list
b. The new node is placed at the back of the linked list
c. The new node is placed at the middle of the linked list
d. No changes happen
Clear my choice

Question 10
Answer saved
Marked out of 1.00

Flag question

Question text

In the linked representation of the stack, __________ pointer behaves as the top pointer
variable of stack.

Select one:
a. Stop
b. Start
c. Avail
d. Begin

Question 1
Answer saved
Marked out of 1.00
 Flag question

Question text

The worst case occurs in linear search algorithm when ________________.

Select one:
a. Item is the last element in the array or item is not there at all
b. Item is somewhere in the middle of the array
c. Item is the last element in the array
d. Item is not in the array at all
Clear my choice

Question 2
Answer saved
Marked out of 1.00

Flag question

Question text

The complexity of sorting algorithm measures the __________ as a function of the number n
of items to be shorter.

Select one:
a. case-complexity
b. average time
c. running time
d. average-case complexity
Clear my choice

Question 3
Answer saved
Marked out of 1.00
 Flag question

Question text

___________ sorting algorithm is frequently used when n is small, where n is the total number
of elements.

Select one:
a. Insertion
b. Heap
c. Bubble
d. Quick
Clear my choice

Question 4
Answer saved
Marked out of 1.00

Flag question

Question text

Which of the following is not the required condition for binary search algorithm?

Select one:
a. Number values should only be present
b. The list must be sorted
c. There should be the direct access to the middle element in any sub list.
d. There must be mechanism to delete and/or insert elements in list
Clear my choice

Question 5
Answer saved
Marked out of 1.00
 Flag question

Question text

The complexity of merge sort algorithm.

Select one:
a. O(n2)
b. O(n)
c. O(n logn)
d. O(logn)
Clear my choice

Question 6
Answer saved
Marked out of 1.00

Flag question

Question text

The complexity of linear search algorithm.

Select one:
a. O(n2)
b. O(logn)

c. O(n) Or
d. O(n logn)
Clear my choice

Question 7
Answer saved
Marked out of 1.00
 Flag question

Question text

_____________ order is the best possible for array sorting algorithm which sorts n item.

Select one:
a. O(logn)
b. O(n2)
c. O(n+logn)
d. O(n logn)
Clear my choice

Question 8
Answer saved
Marked out of 1.00

Flag question

Question text

The method used by card sorter.

Select one:
a. Insertion
b. Heap
c. Radix sort
d. Quick
Clear my choice

Question 9
Answer saved
Marked out of 1.00
 Flag question

Question text

The average case occurs in linear search algorithm _______________.

Select one:
a. item is the last element in the array or item is not there at all
b. when item is the last element in the array
c. when item is somewhere in the middle of the array
d. when item is not the array at all
Clear my choice

Another name for directed graph.

Digraph

Question 10
Answer saved
Marked out of 1.00

Flag question

Question text

State True or False for internal sorting algorithms.

i. Internal sorting are applied when the entire collection if data to be sorted is small enough
that the sorting can take place within main memory.
ii. The time required to read or write is considered significant in evaluating the performance
of internal sorting.

Select one:
a. True, True
b. False, True
c. True, False
d. False, False

Question 1
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text

Indexed array are arrays that with name keys.

Select one:

True

False

Question 2
Correct

Mark 1.00 out of 1.00

Flag question

Question text

Count controlled loops is a type of an iterations.

Select one:

True

False

Question 3
Correct
Mark 1.00 out of 1.00

Flag question

Question text

An invariant is a statement about program variables that is true every time the execution of
the program reaches the invariant.
Select one:

True

False

Question 4
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text

Enqueue means to insert an item into the back of the queue, dequeue means inserting the
front item.
Select one:

True

False

Question 5
Correct

Mark 1.00 out of 1.00

 Flag question

Question text

An array is used to store a collection of data , but it is often more useful to think of an array
as a collection of variables of the same type.
Select one:

True

False

Question 6
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text

Loop is also called variant and does not invariant.

Select one:

True

False

Question 7
Incorrect

Mark 0.00 out of 1.00

Flag question
Question text

The acronym LIFO stands for Long in First Out.

Select one:

True

False

Question 8
Correct

Mark 1.00 out of 1.00

Flag question

Question text

A loop invariant is a property of a program loop that is true before each iteration.

Select one:

True

False

Question 9
Correct

Mark 1.00 out of 1.00

Flag question

Question text

A recursive function calls itself, the memory for a called function is allocated on top of a
memory allocated to calling function and different copy of local variables is created for each
function call.
Select one:

True

False

Question 10
Correct

Mark 1.00 out of 1.00

Flag question

Question text

Lists is a way to group together related piece of information, so that they are easy to read
and understand.
Select one:

True

False

Question 11
Correct

Mark 1.00 out of 1.00

Flag question

Question text

The recursion is the repeated application of a recursive procedure or definition.

Select one:

True

False
Question 12
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text

Stacks is also called a algorithm Queue.

Select one:

True

False

Question 13
Correct

Mark 1.00 out of 1.00

Flag question

Question text

The acronym FIFO stands for First in First Out.

Select one:

True

False

Question 14
Correct

Mark 1.00 out of 1.00

 Flag question

Question text

Array holds multiple values, whereas an ordinary value hold a single value.

Select one:

True

False

Question 15
Correct

Mark 1.00 out of 1.00

Flag question

Question text

A queue is a collection of entities that are maintained in a sequence and can be modified by
the addition of entities at one end of the sequence and removal from the other end of the
sequence.
Select one:

True

False

Question 16
Incorrect

Mark 0.00 out of 1.00

 Flag question

Question text

Multidimensional arrays is not a type of array.

Select one:

True

False

Question 17
Correct

Mark 1.00 out of 1.00

Flag question

Question text

A simple data type can store only one value at a time.

Select one:

True

False

Question 18
Incorrect

Mark 0.00 out of 1.00

Flag question
Question text

An iteration is a data structure, which can store a fixed size collection of elements of the
same data type.
Select one:

True

False

Question 19
Correct

Mark 1.00 out of 1.00

Flag question

Question text

Iterative control statements are used when we want to repeat the execution of one or more
statements for specified number of times.

Select one:

True

False

Question 20
Correct

Mark 1.00 out of 1.00

Flag question

Question text
In an entry controlled loop, a condition is checked before executing the body of a loop, it is
called pre-checking loop.
Select one:

True

False

Question 1
Correct

Mark 1.00 out of 1.00

Flag question

Question text

_______programming is a method of solving complex problems by breaking them down into

simpler steps.
Select one:

a. SYSTEMATIC

b. DYNAMIC

c. DEFINED

Feedback

Your answer is correct.

Question 2
Incorrect

Mark 0.00 out of 1.00

Flag question
Question text

A ________ is a data structure that is used to store keys/value pairs.

Select one:

a. HASH ALGORITHM (wrong)

b. HASH LOOP

c. HASH TABLE (ns)

Feedback

Your answer is incorrect.

Question 3
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text

______ is one of the most powerful and advanced data structures. It is a non-linear data
structure compared to arrays, linked lists, stack and queue. It represents the nodes
connected by edges.
Select one:

a. SET

b. LOOP

c. TREE

Feedback

Your answer is incorrect.

Question 4
Correct
Mark 1.00 out of 1.00

Flag question

Question text

The four most common are probably line graphs, bar graphs and histograms, pie charts,
and ?
Select one:

a. CARTESIAN

b. LEAF

c. POP

Feedback

Your answer is correct.

Question 5
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text

A graph consists of a set of nodes or vertices together with a set of edges or arcs where
each edge joins two ______.
Select one:

a. VERTICES

b. POINTS
c. VERTEX

Feedback

Your answer is incorrect.

Question 6
Correct

Mark 1.00 out of 1.00

Flag question

Question text

The Floyd-Warshall algorithm outputs the correct result as long as no negative cycles exist
in the input graph.
Select one:

a. TRUE

b. POINTS

c. FALSE

Feedback

Your answer is correct.

Question 7
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Sorting is the process of arranging objects in a certain sequence or order according to
specific rules.
Select one:

a. NONE OF THE ABOVE

b. TRUE

c. FALSE

Feedback

Your answer is correct.

Question 8
Correct

Mark 1.00 out of 1.00

Flag question

Question text

This is the Best Sorting Algorithm That the time complexity of Quicksort is O(n log n) in
the best case, O(n log n) in the average case, and O(n^2) in the worst case.
Select one:

a. HEAP

b. RADIX

c. QUICKSORT

Feedback

Your answer is correct.

Question 9
Correct

Mark 1.00 out of 1.00

 Flag question

Question text

In computer science, a problem is said to have optimal substructure if an optimal solution

can be constructed from optimal solutions of its subproblems.
Select one:

a. FALSE

b. TRUE

c. NO

Feedback

Your answer is correct.

Question 10
Correct

Mark 1.00 out of 1.00

Flag question

Question text

Heap is called a ___________.

Select one:

a. MIN HEAP

b. MAX HEAP

c. TORIAL HEAP

Feedback
Your answer is correct.

Question 11
Correct

Mark 1.00 out of 1.00

Flag question

Question text

A graph is a collection of points, called vertices, and line segments connecting those points,
called _______.
Select one:

a. EDGES

b. POINTS

c. ANGLES

Feedback

Your answer is correct.

Question 12
Correct

Mark 1.00 out of 1.00

Flag question

Question text

Dijkstra's algorithm works correctly, because all edge weights are non-________, and the
vertex with the least shortest-path estimate is always chosen.
Select one:
a. ZERO

b. POSITIVE

c. NEGATIVE

Feedback

Your answer is correct.

Question 13
Correct

Mark 1.00 out of 1.00

Flag question

Question text

A binary tree where the left child contains only nodes with values less than the parent
node, and where the right child only contains nodes with values greater than or equal to the
parent.
Select one:

a. NONE OF THE ABOVE

b. YES

c. NO

Feedback

Your answer is correct.

Question 14
Correct

Mark 1.00 out of 1.00

 Flag question

Question text

_____matrix in graph theory is a matrix sized n*n , where n is the number of vertices of the
graph.
Select one:

a. SET

b. POINTS

c. PATH

Feedback

Your answer is correct.

Question 15
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text

_________A sorting algorithm used for numbers.

Select one:

a. HEAP

b. RADIX

c. MERGE

Feedback
Your answer is incorrect.

Question 16
Correct

Mark 1.00 out of 1.00

Flag question

Question text

________is any process of arranging items systematically, and has two common, yet distinct
meanings: ordering: arranging items in a sequence ordered by some criterion; categorizing:
grouping items with similar properties.
Select one:

a. EXTRACTING

b. LOOPING

c. SORTING

Feedback

Your answer is correct.

Question 17
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text

A _______ queue acts like a queue in that you dequeue an item by removing it from the front.
Select one:
a. DIRECT

b. PRIORITY

c. INTERNAL

Feedback

Your answer is incorrect.

Question 18
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text

A ________ is a complete binary tree in which the value in each internal node is greater than
or equal to the values in the children of that node.
Select one:

a. MAX SORT

b. MAX HEAP

c. MAX LOOP

Feedback

Your answer is incorrect.

Question 19
Incorrect

Mark 0.00 out of 1.00

 Flag question

Question text

The _______ algorithm is a graph search algorithm that finds the shortest path between a
given source vertex and all other vertices in the graph.
Select one:

a. DIJKSTRA

b. FORD

c. BELLMAN-FORD

Feedback

Your answer is incorrect.

Question 20
Correct

Mark 1.00 out of 1.00

Flag question

Question text

_________ algorithms work by recursively constructing a set of objects from the smallest
possible constituent parts.
Select one:

a. BEARD

b. SASH

c. GREEDY
Feedback

Your answer is correct.

Question 1
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Greedy algorithm is efficient whereas Dynamic programming is more efficient.

Select one:

True

False

Question 2
Complete

Mark 1.00 out of 1.00

Flag question

Question text

The hash table should be an array with length about __times the maximum number of keys
that will actually be in the table, and. Size of hash table array should be a prime number.
Select one:

a. 1.2

b. 1.5

c. 1.3
Feedback

Your answer is correct.

Question 3
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Bubble Sort Algorithm is used to arrange N elements in ascending order, and for that, you
have to begin with 0th element and compare it with the first element. If the 0th element is
found greater than the 1st element, then the swapping operation will be performed, i.e., the
two values will get interchanged. In this way, all the elements of the array get compared.
Select one:

True

False

Question 4
Complete

Mark 1.00 out of 1.00

Flag question

Question text

_________Algorithm is used to arrange N elements in ascending order, and for that, you have
to begin with 0th element and compare it with the first element.
Select one:

a. BUBBLE SORT
b. RADIX SORT

c. HEAP SORT

Feedback

Your answer is correct.

Question 5
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Dijkstra's algorithm can be used to determine the shortest path from one node in a graph to
every other node within the same graph data structure, provided that the nodes are
reachable from the starting node.
Select one:

True

False

Question 6
Complete

Mark 1.00 out of 1.00

Flag question

Question text

_________ algorithms work by recursively constructing a set of objects from the smallest
possible constituent parts.
Select one:
a. BEARD

b. GREEDY

c. SASH

Feedback

Your answer is correct.

Question 7
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Sorting is the process of arranging objects in a certain sequence or order according to

specific rules.
Select one:

a. NONE OF THE ABOVE

b. TRUE

c. FALSE

Feedback

Your answer is correct.

Question 8
Complete

Mark 0.00 out of 1.00

 Flag question

Question text

A RADIX is a specific tree based data structure in which all the nodes of tree are in a specific
order.
Select one:

a. TRUE

b. NO,it must be HEAP

c. FALSE

Feedback

Your answer is incorrect.

Question 9
Complete

Mark 1.00 out of 1.00

Flag question

Question text

_______programming is a method of solving complex problems by breaking them down into

simpler steps.
Select one:

a. DEFINED

b. DYNAMIC

c. SYSTEMATIC
Feedback

Your answer is correct.

Question 10
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A hash function that returns a unique hash number is called a _______hash function.
Select one:

a. STABLE

b. SYSTEMATIC

c. UNIVERSAL

Feedback

Your answer is correct.

Question 11
Complete

Mark 1.00 out of 1.00

Flag question

Question text

In C++, hashing is a technique to directly search the location of desired data on the disk
without using index structure.
Select one:
 True

False

Question 12
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Dijkstra's algorithm works correctly, because all edge weights are non-________, and the
vertex with the least shortest-path estimate is always chosen.
Select one:

a. NEGATIVE

b. ZERO

c. POSITIVE

Feedback

Your answer is correct.

Question 13
Complete

Mark 1.00 out of 1.00

Flag question

Question text

In computer science, a problem is said to have optimal substructure if an optimal solution

can be constructed from optimal solutions of its subproblems.
Select one:

a. TRUE

b. NO

c. FALSE

Feedback

Your answer is correct.

Question 14
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Heap is called a ___________.

Select one:

a. MAX HEAP

b. TORIAL HEAP

c. MIN HEAP

Feedback

Your answer is correct.

Question 15
Complete

Mark 1.00 out of 1.00

 Flag question

Question text

Count controlled loops is a type of an iterations.

Select one:

True

False

Question 16
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A binary _______ is a complete binary tree which satisfies the heap ordering property.
Select one:

a. LEAF

b. HEAP

c. CROSS

Feedback

Your answer is correct.

Question 17
Complete

Mark 1.00 out of 1.00

 Flag question

Question text

A binary tree where the left child contains only nodes with values less than the parent
node, and where the right child only contains nodes with values greater than or equal to the
parent.
Select one:

a. YES

b. NONE OF THE ABOVE

c. NO

Feedback

Your answer is correct.

Question 18
Complete

Mark 1.00 out of 1.00

Flag question

Question text

The Bellman-Ford algorithm is a graph search algorithm that finds the shortest path
between a given source vertex and all other vertices in the graph.
Select one:

True

False

Question 19
Complete

Mark 1.00 out of 1.00

Flag question

Question text

_________A sorting algorithm used for numbers.

Select one:

a. RADIX

b. MERGE

c. HEAP

Feedback

Your answer is correct.

Question 20
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A ________ is a data structure that is used to store keys/value pairs.

Select one:

a. HASH ALGORITHM

b. HASH TABLE

c. HASH LOOP
Feedback

Your answer is correct.

Question 21
Complete

Mark 1.00 out of 1.00

Flag question

Question text

The selection is a straightforward process of sorting values. In this method, to sort the data
in ascending order, the 0thelement is compared with all other elements. If the 0th element is
found to be greater than the compared element, the two values get interchanged.
Select one:

True

False

Question 22
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Bellman Ford algorithm is useful in finding shortest path from a given source vertex to all
the other vertices even if the graph contains a _______ weight edge.
Select one:

a. NEGATIVE

b. POSITIVE
c. ZERO

Feedback

Your answer is correct.

Question 23
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A graph consists of a set of nodes or vertices together with a set of edges or arcs where
each edge joins two ______.
Select one:

a. VERTICES

b. POINTS

c. VERTEX

Feedback

Your answer is correct.

Question 24
Complete

Mark 1.00 out of 1.00

Flag question

Question text
A hash function takes a group of characters (called a key) and maps it to a value of a certain
length (called a hash value or hash)
Select one:

True

False

Question 25
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Iterative control statements are used when we want to repeat the execution of one or more
statements for specified number of times.

Select one:

True

False

Question 26
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A graph is a collection of points, called vertices, and line segments connecting those points,
called _______.
Select one:
a. POINTS

b. ANGLES

c. EDGES

Feedback

Your answer is correct.

Question 27
Complete

Mark 1.00 out of 1.00

Flag question

Question text

The _______ algorithm is a graph search algorithm that finds the shortest path between a
given source vertex and all other vertices in the graph.
Select one:

a. BELLMAN-FORD

b. DIJKSTRA

c. FORD

Feedback

Your answer is correct.

Question 28
Complete

Mark 1.00 out of 1.00

 Flag question

Question text

_____matrix in graph theory is a matrix sized n*n , where n is the number of vertices of the
graph.
Select one:

a. SET

b. PATH

c. POINTS

Feedback

Your answer is correct.

Question 29
Complete

Mark 1.00 out of 1.00

Flag question

Question text

An MD5 hash function encodes a string of information and encodes it into a 128-bit
fingerprint.
Select one:

True

False

Question 30
Complete
Mark 1.00 out of 1.00

Flag question

Question text

______ is one of the most powerful and advanced data structures. It is a non-linear data
structure compared to arrays, linked lists, stack and queue. It represents the nodes
connected by edges.
Select one:

a. SET

b. LOOP

c. TREE

Feedback

Your answer is correct.

Question 31
Complete

Mark 1.00 out of 1.00

Flag question

Question text

___________ is another sorting technique and has an algorithm that has a reasonably
proficient space-time complexity - O(n log n) and is quite trivial to apply.
Select one:

a. MERGE SORT

b. HEAP SORT
c. BUBBLE SORT

Feedback

Your answer is correct.

Question 32
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Binary Search Tree, is a node-based binary tree data structure which has the
following properties: The left subtree of a node contains only nodes with keys lesser than
the node's key. The right subtree of a node contains only nodes with keys greater than the
node's key.
Select one:

a. NULL

b. TRUE

c. FALSE

Feedback

Your answer is correct.

Question 33
Complete

Mark 1.00 out of 1.00

Flag question
Question text

Sorting is any process of arranging items systematically, and has two common, yet distinct
meanings: ordering: arranging items in a sequence ordered by some criterion; categorizing:
grouping items with similar properties.
Select one:

True

False

Question 34
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A _______ queue acts like a queue in that you dequeue an item by removing it from the front.
Select one:

a. DIRECT

b. INTERNAL

c. PRIORITY

Feedback

Your answer is correct.

Question 35
Complete

Mark 1.00 out of 1.00

 Flag question

Question text

A queue is a collection of entities that are maintained in a sequence and can be modified by
the addition of entities at one end of the sequence and removal from the other end of the
sequence.
Select one:

True

False

Question 36
Complete

Mark 1.00 out of 1.00

Flag question

Question text

The Floyd-Warshall algorithm outputs the correct result as long as no negative cycles exist
in the input graph.
Select one:

a. POINTS

b. TRUE

c. FALSE

Feedback

Your answer is correct.

Question 37
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A ________ is a data structure that has two types of elements, vertices and edges.
Select one:

a. HASH

b. GRAPH

c. ALGORITHM

Feedback

Your answer is correct.

Question 38
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A graph is a collection of points, called vertices, and line segments connecting those points,
called edges.
Select one:

True

False
Question 39
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A simple data type can store only one value at a time.

Select one:

True

False

Question 40
Complete

Mark 1.00 out of 1.00

Flag question

Question text

___________ is a linear data structure in which the operations are performed based on FIFO
(First In First Out) principle and the last position is connected back to the first position to
make a circle.
Select one:

a. SPIRAL QUEUE

b. CIRCULAR QUEUE

c. LONG QUEUE

Feedback
Your answer is correct.

Question 41
Complete

Mark 1.00 out of 1.00

Flag question

Question text

The ______ is a straightforward process of sorting values. In this method, to sort the data in
ascending order, the 0thelement is compared with all other elements.
Select one:

a. BUBBLE SORT

b. SELECTION SORT

c. HEAP SORT

Feedback

Your answer is correct.

Question 42
Complete

Mark 0.00 out of 1.00

Flag question

Question text

A priority dequeue acts like a queue in that you dequeue an item by removing it from the
front.
Select one:
 True

False

Question 43
Complete

Mark 1.00 out of 1.00

Flag question

Question text

The weighted longest path problem is the same as the Travelling salesman path problem,
because the longest path always includes all vertices.
Select one:

True

False

Question 44
Complete

Mark 1.00 out of 1.00

Flag question

Question text

The recursion is the repeated application of a recursive procedure or definition.

Select one:

True

False

Question 45
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A ________ is a complete binary tree in which the value in each internal node is greater than
or equal to the values in the children of that node.
Select one:

a. MAX HEAP

b. MAX SORT

c. MAX LOOP

Feedback

Your answer is correct.

Question 46
Complete

Mark 1.00 out of 1.00

Flag question

Question text

The acronym FIFO stands for ?

Select one:

a. FIRST IN AND FIRST OUT

b. FIRST AND FIRST OUT

c. FIRST IN FIRST OUT

Feedback

Your answer is correct.

Question 47
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A binary search tree (BST), also known as an ordered ________.

Select one:

a. DATA TREE

b. BINARY TREE

c. BINARY

Feedback

Your answer is correct.

Question 48
Complete

Mark 1.00 out of 1.00

Flag question

Question text
Hashing provides a more reliable and_ method of data retrieval than any other data
structure.
Select one:

a. STRECTHABLE

b. CONCISE

c. FLEXIBLE

Feedback

Your answer is correct.

Question 49
Complete

Mark 1.00 out of 1.00

Flag question

Question text

The four most common are probably line graphs, bar graphs and histograms, pie charts,
and ?
Select one:

a. POP

b. LEAF

c. CARTESIAN

Feedback

Your answer is correct.

Question 50
Complete

Mark 1.00 out of 1.00

 Flag question

Question text

_______ memory is used to store local variables and function call while heap memory is used
to store objects in Java.
Select one:

a. RADIX

b. STACK

c. SORT

Feedback

Your answer is correct.

Midterm Part:
Sa agham pangkompyuter, ang grap ay isang uri ng datos na abstrakt na binubuo ng
set ng mga node at isang set ng mga edge o gilid na nagtatakda ng relasyon sa
pagitan ng mga node. Ang grap na ADT ay nagmumula sa konsepto ng grap sa
matematika.Wikipedia True

A pseudo _____-graph is a general-graph allowing edges to connect a vertex to itself.

General

Question 7
Complete

Mark 1.00 out of 1.00

Flag question
Question text

A ____________ is a tree in which every node other than the leaves has two children.
Select one:

a. COMPLETE BINARY TREE

b. BINARY SEARCH TREE

c. FULL BINARY TREE

Feedback

Your answer is correct.

Question 8
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A binary tree is a finite set of nodes that is either empty or consist a root node and two
disjoint binary trees called the left subtree and the right subtree.
Select one:

a. FALSE

b. TRUE

c. NEITHER TRUE OR FALSE

Feedback

Your answer is correct.

Question 9
Complete

Mark 1.00 out of 1.00

 Flag question

Question text

Breadth-____-search is the algorithm that will find shortest paths in an unweighted graph.
Select one:

a. FIRST

b. THIRD

c. SECOND

Feedback

Your answer is correct.

Question 10
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Hash Table is a data structure which stores data in an associative manner.

Select one:

True

False

Question 11
Complete

Mark 1.00 out of 1.00

 Flag question

Question text

A Priority Queue in Java does not have any restriction with regard to duplicate elements.
Select one:

True

False

Question 14
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A sorting algorithm is said to be _________ if two objects with equal keys appear in the same
order in sorted output as they appear in the input unsorted array.
Select one:

a. AT REST

b. STABLE

c. UNSTABLE

Feedback

Your answer is correct.

Question 15
Complete

Mark 1.00 out of 1.00

 Flag question

Question text

A graph is a data structure that has two types of elements, vertices and angles.
Select one:

True

False

Question 16
Complete

Mark 0.00 out of 1.00

Flag question

Question text

The following are other terms of Binary search tree. EXCEPT ONE.
Select one:

a. binary chop

b. search loop

c. half interval search (wrong)

Feedback

Your answer is incorrect.

Question 17
Complete

Mark 1.00 out of 1.00

 Flag question

Question text

A _____________is a binary tree in which every level, except possibly the last, is completely
filled, and all nodes are as far left as possible.
Select one:

a. COMPLETE BINARY TREE

b. FULL BINARY TREE

c. BINARY SEARCH TREE

Feedback

Your answer is correct.

Question 18
Complete

Mark 0.00 out of 1.00

Flag question

Question text

The maximum value in a Binary Search Tree can be found by ?

Select one:

a. START AT THE RIGHT SUB TREE (wrong)

b. START AT THE ROOT NODE

c. START AT THE LEFT SUB TREE

Radix Sort - A sorting algorithm used for numbers.

True

Question 4
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Internal Sorting is when the data that is to be sorted cannot be accommodated in the
memory at the same time and some has to be kept in auxiliary memory such as hard disk,
floppy disk, magnetic tapes etc, then external sorting methods are performed.
Select one:

True

False

Question 5
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A heap is a specific tree based data structure in which all the nodes of tree are in a specific
order.
Select one:

True

False

Question 6
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Priority queue. Priority queues are a type of container adaptors, specifically designed such
that its first element is always the greatest of the elements it contains, according to some
strict weak ordering criterion.
Select one:

True

False

Question 8
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Sorting is an important issue in Data Structure which creates the sequence of the list of
items.
Select one:

True

False

Question 9
Complete

Mark 1.00 out of 1.00

 Flag question

Question text

Loop sorting is any process that involves arranging the data into some meaningful order to
make it easier to understand, analyze or visualize.
Select one:

True

False

Question 10
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Internal Sorting: If all the data that is to be sorted can be adjusted at a time in the main
memory, the internal sorting method is being performed.
Select one:

True

False

Question 11
Complete

Mark 1.00 out of 1.00

 Flag question

Question text

Merge sort is another sorting technique and has an algorithm that has a reasonably
proficient space-time complexity - O(n log n) and is quite trivial to apply.
Select one:

True

False

Question 13
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A priority queue allows permit null elements.

Select one:

True

False

Question 14
Complete

Mark 1.00 out of 1.00

Flag question
Question text

Merge sort - A sorting algorithm which divides the elements to subgroups and then merges
back to make a sorted.
Select one:

True

False

Question 15
Complete

Mark 1.00 out of 1.00

Flag question

Question text

QUICK Sort - A sorting algorithm which is a comparison based sorting technique based on
Binary Heap data structure.
Select one:

True

False

Question 16
Complete

Mark 1.00 out of 1.00

Flag question

Question text
A priority queue in Java is a special type of queue wherein all the elements are ordered as
per their natural ordering or based on a custom TEMPERATURE supplied at the time of
creation.
Select one:

True

False

Question 17
Complete

Mark 1.00 out of 1.00

Flag question

Question text

External Sorting If all the data that is to be sorted can be adjusted at a time in the main
memory, the internal sorting method is being performed.
Select one:

True

False

Question 18
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Quicksort — is the WORST Sorting Algorithm The time complexity of Quicksort is O(n log n)
in the best case, O(n log n) in the average case, and O(n^2) in the worst case.
Select one:

True

False

Question 19
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A max-heap is a complete binary tree in which the value in each internal node is greater
than or equal to the values in the children of that node.
Select one:

True

False

Question 1
Complete

Mark 1.00 out of 1.00

Flag question

Question text

_________ is a linear data structure which follows a particular order in which the operations
are performed.
Select one:

a. STACK
b. FUNCTION

c. SEARCH

Question 2
Complete

Mark 1.00 out of 1.00

Flag question

Question text

The _________ is slightly faster than the heap sort for larger sets, but it requires twice the
memory of the heap sort because of the second array.
Select one:

a. BUBBLESORT

b. MERGE SORT

c. QUICKSORT

Question 5
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A General tree can't be empty but a Binary tree can be empty.

Select one:

a. YES
b. NONE OF THE ABOVE

c. NO

Question 7
Complete

Mark 1.00 out of 1.00

Flag question

Question text

DEQUEUE IS ALSO CALLED ?

Select one:

a. DOUBLY ENDED QUEUE

b. DEQUENT QUEUE

c. CIRCULAR QUEUE

Question 10
Complete

Mark 1.00 out of 1.00

Flag question

Question text

__________ is a common operation in many applications, and efficient algorithms to perform

it have been developed.
Select one:

a. FUNCTION
b. STACK

c. SORTING

Question 13
Complete

Mark 1.00 out of 1.00

Flag question

Question text

The ________ sort is a combination of searching and sorting.

Select one:

a. SELECTION

b. HANDLE

c. BUBBLE

Feedback

Your answer is correct.

Question 14
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A binary tree is either empty or consists of a node called the root together with two binary
trees called the left subtree and the right subtree.
Select one:
a. BOTH A AND B

b. FALSE

c. TRUE

Question 15
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Means to insert an item into the back of the queue.

Select one:

a. DEQUEUE

b. ENQUEUE

c. QUEUE

Question 16
Complete

Mark 0.00 out of 1.00

Flag question

Question text

Which is the slowest sorting algorithm?

Select one:

a. HEAP SORT
b. QUICKSORT

c. SLOWSORT (wrong)

Question 17
Complete

Mark 0.00 out of 1.00

Flag question

Question text

A binary tree is considered full if every node has exactly 0 or 2 children. A binary tree is
considered incomplete if every level is full except the last, and all nodes are pushed as far
left as possible.
Select one:

a. NULL

b. YES (wrong)

c. NO

Question 20
Complete

Mark 1.00 out of 1.00

Flag question

Question text

How many leaves are there in a full binary tree?

Select one:

a. CONTAINS N-1
b. CONTAINS 3N-1

c. CONTAINS 2N-1

Question 22
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Bubble Sort is based on the idea of repeatedly comparing pairs of ________ELEMENTS

swapping their positions if they exist in the wrong order.
Select one:

a. ADJACENT

b. CONNECTED

c. FORMAL

Question 24
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A Binary Tree is labeled if every node is assigned a label and a Binary Tree is __________ if
nodes are not assigned any label.
Select one:

a. STATIONARY
b. UNLABELED

c. LABELED

Feedback

Your answer is correct.

Question 25
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Merge sort is more efficient and works faster than quick sort in case of larger array size or
datasets.
Select one:

a. NO,BECAUSE MERGE SORT IS SLOWER THAN QUICKSORT

b. TRUE

c. FALSE

Question 26
Complete

Mark 0.00 out of 1.00

Flag question

Question text

A ___________ is a tree with some extra leaf nodes at depth n+1, all toward the left.
Select one:
a. FULL BINARY TREE (wrong)

b. COMPLETE BINARY TREE

c. PERFECT BINARY TREE

Question 28
Complete

Mark 1.00 out of 1.00

Flag question

Question text

QuickSort is an___________ algorithm because we do swapping of elements according to

pivot's position (without considering their original positions).
Select one:

a. UNSTABLE

b. STABLE

c. NULL

Question 30
Complete

Mark 1.00 out of 1.00

Flag question

Question text

This is the Best Sorting Algorithm That the time complexity of Quicksort is O(n log n) in
the best case, O(n log n) in the average case, and O(n^2) in the worst case.
Select one:
a. QUICKSORT

b. RADIX

c. HEAP

Question 31
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A ____________is an example of a linear data structure, or more abstractly a sequential

collection.
Select one:

a. QUEUE

b. ALGORITHM

c. SORT

Question 32
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A ___________ is a specific tree based data structure in which all the nodes of tree are in a
specific order.
Select one:
a. QUICKSORT

b. RADIX

c. HEAP

Question 34
Complete

Mark 1.00 out of 1.00

Flag question

Question text

In a _____ skewed, most of the nodes have the leftchild without corresponding right child.
Select one:

a. RIGHT

b. ZERO

c. LEFT

Question 35
Complete

Mark 1.00 out of 1.00

Flag question

Question text

In _________sorting data is stored outside memory (like on disk) and only loaded into
memory in small chunks.
Select one:
a. EXTERNAL

b. INTERNAL

c. ZERO

Question 36
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A ___________ queue is typically implemented using Heap data structure.

Select one:

a. PRIORITY

b. NULL

c. DIRECT.

Question 37
Complete

Mark 1.00 out of 1.00

Flag question

Question text

The following are synonym of QUEUE.EXCEPT ONE.

Select one:

a. string
b. range

c. massive

Question 41
Complete

Mark 1.00 out of 1.00

Flag question

Question text

_________sorting means sorting without any extra space requirement.

Select one:

a. OUTPLACE

b. PLACE

c. IN PLACE

Question 45
Complete

Mark 1.00 out of 1.00

Flag question

Question text

This transformation consists of replacing every null subtree of the original tree with “special
nodes.” The nodes from the original tree are then internal nodes , while the “special nodes”
are external nodes.
Select one:

a. STABLE BINARY TREE

b. EXTENDED BINARY TREE

c. FULL BINARY TREE

Question 47
Complete

Mark 1.00 out of 1.00

Flag question

Question text

AVL tree is also a BST but it can rebalance itself.

Select one:

a. NONE OF THE ABOVE

b. TRUE

c. FALSE

Question 50
Complete

Mark 1.00 out of 1.00

Flag question

Question text

_____________ have less memory consumption as compared to linear queue because while
doing insertion after deletion operation it allocate an extra space the first remaining vacant
but in circular queue the first is used as it comes immediate after the last.
Select one:

a. BUBBLE QUEUE
b. NULL QUEUE

c. CIRCULAR QUEUE

Question 2
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Path Matrix in graph theory is a matrix sized n*n , where n is the number of vertices of the
graph.
Select one:

True

False

Question 3
Complete

Mark 1.00 out of 1.00

Flag question

Question text

The hash table should be an array with length about 1.5times the maximum number of keys
that will actually be in the table, and. Size of hash table array should be a prime number.
Select one:

True

False
Question 4
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A graph function that returns a unique hash number is called a universal hash function.
Select one:

True

False

Question 5
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A graph is undirected each edge is an unordered pair {u,v} of vertices, and we don't regard
either of the two vertices as having a distinct role from the other.
Select one:

True

False

Question 7
Complete

Mark 1.00 out of 1.00

 Flag question

Question text

Cryptographic hash functions add security features to typical hash functions, thereby
making it difficult to detect the contents of a message or information about recipients and
senders.
Select one:

True

False

Question 8
Complete

Mark 1.00 out of 1.00

Flag question

Question text

The four most common are probably line graphs, bar graphs and histograms, pie charts, and
Cartesian graphs.
Select one:

True

False

Question 9
Complete

Mark 1.00 out of 1.00

 Flag question

Question text

“One-way” means that it is practically possible to go the other way - to turn the hashed.
Select one:

True

False

Question 10
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Graphs are a powerful and versatile data structure that easily allow you to represent real life
relationships between different types of data.
Select one:

True

False

Question 11
Complete

Mark 1.00 out of 1.00

Flag question
Question text

BLAKE2 is a cryptographic hash function faster than MD5, SHA-1, SHA-2, and SHA-3, yet is
at least as secure as the latest standard SHA-3. BLAKE2 has been adopted by many projects
due to its high speed, security, and simplicity.
Select one:

True

False

Question 13
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A hash table is a data structure that is used to store keys/value pairs.

Select one:

True

False

Question 14
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A hash function is any function that can be used to map data of arbitrary size to fixed-size
values.
Select one:

True

False

Question 15
Complete

Mark 1.00 out of 1.00

Flag question

Question text

In DBMS,hashing is a technique to directly search the location of desired data on the disk
without using index structure.
Select one:

True

False

Question 19
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Advantages of Hash Search,Hashing provides a more reliable and flexible method of data
retrieval than any other data structure. It is faster than searching arrays and lists. In the same
space it can retrieve in 1.3probes anything stored in a tree that will otherwise take log n
probes.

Select one:
 True

False

Question 1
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Dijkstra doesn't work for Graphs with negative weight edges, Bellman-Ford works for such
graphs.Bellman-Ford is also simpler than Dijkstra and suites well for distributed systems.
Select one:

True

False

Question 2
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Dijkstra's algorithm is an algorithm creates a tree of shortest paths from the starting vertex,
the source, to all other points in the graph.
Select one:

True

False
Question 5
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A* is the most popular choice for pathfinding, because it's fairly flexible and can be used in a
wide range of contexts. A* is like Dijkstra's Algorithm in that it can be used to find a shortest
path.
Select one:

True

False

Question 6
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Dynamic programming is heavily used in computer networks, routing, graph problems,

computer vision, artificial intelligence, machine learning etc.
Select one:

True

False

Question 7
Complete
Mark 1.00 out of 1.00

Flag question

Question text

There is a simple tweak to get from DFS to an algorithm that will find the shortest paths on
an unweighted graph. Essentially, you replace the stack used by DFS with a queue.
Select one:

True

False

Question 8
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Johnson's algorithm works best with sparse graphs,This algorithm varies from the rest as it
relies on two other algorithms to determine the shortest path.
Select one:

True

False

Question 9
Complete

Mark 1.00 out of 1.00

 Flag question

Question text

Dijkstra was the one that discovered the algorithm for trees in the year of 1970.
Select one:

True

False

Question 10
Complete

Mark 1.00 out of 1.00

Flag question

Question text

In terms of implementation, BFS is usually implemented with Queue , while DFS uses a
LOOP.
Select one:

True

False

Question 11
Complete

Mark 1.00 out of 1.00

Flag question
Question text

a directed acyclic graph (DAG) is a graphthat is directed and without cycles connecting the
other edges.
Select one:

True

False

Question 12
Complete

Mark 1.00 out of 1.00

Flag question

Question text

The Shortest Path Faster Algorithm (SPFA) is an improvement of the Bellman–Ford

algorithm which computes single-source shortest paths in a weighted directed graph.
Select one:

True

False

Question 13
Complete

Mark 1.00 out of 1.00

Flag question

Question text
Dijkstra's algorithm can be used to determine the longest path from one node in a graph to
every other node within the same graph data structure, provided that the nodes are
reachable from the starting node.
Select one:

True

False

Question 14
Complete

Mark 1.00 out of 1.00

Flag question

Question text

BFS doesn't use a priority queue (or array, should you consider using that) storing the
distances, and. BFS doesn't perform edge relaxations.
Select one:

True

False

Question 15
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Dynamic programming is a method of solving complex problems by breaking them down

into simpler steps.
Select one:

True

False

Question 16
Complete

Mark 1.00 out of 1.00

Flag question

Question text

BFS doesn't use a priority queue (or array, should you consider using that) storing the
distances, and. BFS doesn't perform edge relaxations.
Select one:

True

False

Question 17
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Dijkstra's algorithm works correctly, because all edge weights are non-negative, and the
vertex with the least shortest-path estimate is always chosen.
Select one:

True
 False

Question 19
Complete

Mark 1.00 out of 1.00

Flag question

Question text

BFS uses always queue, Dfs uses Stack data structure.

Select one:

True

False

Question 2
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Kruskal's Algorithm : performs better in typical situations (sparse graphs) because it uses
simpler data structures. Prim's Algorithm : is significantly ___the limit when you've got a
really dense graph with many more edges than vertices.
Select one:

a. AT REST

b. FASTER

c. SLOWER
Feedback

Your answer is correct.

Question 3
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A simple graph, also called a ______graph.

Select one:

a. DIJKSTRA

b. STRICT

c. SHORTEST

Feedback

Your answer is correct.

Question 4
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A graph is a____structure that has two types of elements, vertices and edges.
Select one:
a. ALGORITHM

b. DATA

c. PATH

Feedback

Your answer is correct.

Question 5
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Breadth-first-search is the algorithm that will find shortest paths in an _____ graph.
Select one:

a. FULL

b. WEIGHTED

c. UNWEIGHTED

Question 7
Complete

Mark 1.00 out of 1.00

Flag question

Question text
_____Algorithm : is significantly faster in the limit when you've got a really dense graph with
many more edges than vertices.
Select one:

a. PRIM'S

b. FLLOYD

c. KRUSKAL'S

Question 9
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Comparing BFS and DFS, the big advantage of DFS is that it has much _____memory
requirements than BFS, because it's not necessary to store all of the child pointers at each
level.
Select one:

a. HIGHER

b. NEUTRAL

c. LOWER

Feedback

Your answer is correct.

Question 10
Complete

Mark 1.00 out of 1.00

 Flag question

Question text

In ___________ we specify an object that is used as a key, and the value we want to associate
to that key.
Select one:

a. HASTABLE

b. HASHING

c. HASH

Question 12
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A hash function is a function which when given a key, generates an address in the table.
Select one:

a. BOTH A AND B

b. TRUE

c. FALSE

Question 14
Complete

Mark 1.00 out of 1.00

 Flag question

Question text

______ are a common method to visually illustrate relationships in the data.

Select one:

a. HASHABLE

b. GRAPHS

c. HASH

Feedback

Your answer is correct.

Question 15
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Graph Algorithms or Graph ______ are analytic tools used to determine strength and
direction of relationships between objects in a graph.
Select one:

a. GRAPH

b. HASHING

c. ANALYTICS

Question 18
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Shortest path algorithms are a family of algorithms designed to solve the shortest
path problem.
Select one:

a. USUALLY

b. NO

c. YES

Question 20
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A complete digraph is a directed graph in which every pair of distinct vertices is connected
by a ___of unique edges (one in each direction).
Select one:

a. SINGLE

b. PAIR

c. MULTIPLE

Feedback
Your answer is correct.

Question 21
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A simple graph may be either ____________.

Select one:

a. DISCONNECTED

b. BOTH A AND B

c. CONNECTED

Question 24
Complete

Mark 1.00 out of 1.00

Flag question

Question text

The eight most commonly used graphs are linear, power, quadratic, polynomial, rational,
______, logarithmic, and sinusoidal.
Select one:

a. EXPONENTIAL

b. DYNAMIC

c. NULL
Feedback

Your answer is correct.

Question 25
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Path Matrix in graph theory is a matrix sized ___ , where n is the number of vertices of the
graph.
Select one:

a. n*1

b. n*n

c. n*2

Feedback

Your answer is correct.

Question 26
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A hash table is an array containing all of the keys to search on.

Select one:
a. NULL

b. YES

c. NONE

Feedback

Your answer is correct.

Question 27
Complete

Mark 1.00 out of 1.00

Flag question

Question text

The hash table should be an array with length about _ times the maximum number of keys
that will actually be in the table, and. Size of hash table array should be a prime number.
Select one:

a. 1.56

b. 1

c. 1.3

Question 29
Complete

Mark 1.00 out of 1.00

Flag question

Question text
An MD5 hash function encodes a string of information and encodes it into a___bit
fingerprint.
Select one:

a. 64

b. 128

c. 256

Feedback

Your answer is correct.

Question 30
Complete

Mark 1.00 out of 1.00

Flag question

Question text

_______ Algorithm : performs better in typical situations (sparse graphs) because it uses
simpler data structures.
Select one:

a. KRUSKAL'S

b. FLLOYD

c. PRIM'S

Feedback

Your answer is correct.

Question 31
Complete

Mark 1.00 out of 1.00

 Flag question

Question text

A graph is a picture designed to express words, particularly the connection between two or
more quantities.
Select one:

a. TRUE

b. NO, IT MUST BE ONE QUANTITY ONLY

c. FALSE

Question 35
Complete

Mark 1.00 out of 1.00

Flag question

Question text

The Three methods in HASHING in open addressing are linear probing, quadratic probing,
and _____hashing.
Select one:

a. DOUBLE

b. MULTI

c. SINGLE

Question 37
Complete

Mark 1.00 out of 1.00

 Flag question

Question text

A hash function is a function which when given a key, generates an address in the table.
Select one:

a. NO

b. NULL

c. YES

Feedback

Your answer is correct.

Question 38
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Dijkstra's algorithm is Dijkstra's algorithm, it is neither algorithm

because BFS and DFS themselves are not Dijkstra's algorithm.
Select one:

a. FALSE

b. TRUE

c. BOTH A AND B

Question 40
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A hash______ is a data structure that is used to store keys/value pairs.

Select one:

a. TABLE

b. SET

c. PATH

Question 43
Complete

Mark 1.00 out of 1.00

Flag question

Question text

An ______hash function encodes a string of information and encodes it into a 128-bit

fingerprint.
Select one:

a. MD5

b. MD1

c. MD3

Feedback
Your answer is correct.

Question 44
Complete

Mark 1.00 out of 1.00

Flag question

Question text

A directed general-graph is a general-graph in which the set E is the set of ordered pairs of
vertices.
Select one:

a. FALSE

b. NONE OF THE ABOVE

c. TRUE

Feedback

Your answer is correct.

Question 45
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Eulerian refers to the Swiss mathematician _____Euler, who invented graph theory in the 18th
century.
Select one:
a. LEONHARD

b. DAMSCUS

c. FLLOYD

Feedback

Your answer is correct.

Question 46
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Hashing is also used in encryption.

Select one:

a. NO

b. NO, IT IS USE FOR TAPPING

c. YES

Feedback

Your answer is correct.

Question 47
Complete

Mark 1.00 out of 1.00

Flag question
Question text

Graphs are a powerful and versatile data structure that easily allow you to represent real life
relationships between different types of data (nodes).
Select one:

a. YES

b. SELDOM

c. NO

Question 50
Complete

Mark 1.00 out of 1.00

Flag question

Question text

Tree is a hierarchical data structure which stores the information naturally in the form of
hierarchy style.
Select one:

a. NONE OF THE ABOVE

b. FALSE

c. TRUE

This refers to a linear collection of data items.

List
A linear list in which the last node points to the first node.

Circular Linked List

In linked lists, there are no NULL links in ______________
Circular Linked List
What is a run list?

Small batches of records from a file

Which of the following names does not relate to stacks?

FIFO Lists
In linked representation of stack, ___________ fields hold the elements of the stack.

INFO
New nodes are added to the ________ of the queue.

Back
The elements are removal from a stack in _________ order.

Reverse
This form of access is used to add and remove nodes from a queue.

FIFO, First In First Out

The retrieval of items in a stack is ___________ operation.

Pop
This may take place only when there is some minimum amount or no space left in free storage
list.

Garbage Collection
The term used to insert an element into stack.

Push
This indicates the end of the list.

Sentinel
In linked representation of stack, the null pointer of the last node in the list signals
_____________________.

Bottom of the stack

Deletion operation is done using __________ in a queue.

Front
Value of first linked list index is _______________.

0
This form of access is used to add/remove nodes from a stack.

LIFO
LINK is the pointer pointing to the ____________________.

Predecessor node
Which is the pointer associated with the availability list?

AVAIL

The depth of complete binary tree is given by ________________.

Dn = log2n+1

A connected graph T without any cycles is called ________________.

Free graph

This is a terminal node in a binary tree.

Leaf

Which indicates pre-order traversal?

Root, Left sub-tree, Right sub-tree

This is a binary tree whose every node has either zero or two children.

Extended binary tree

In a graph, if e=[u,v], then u and v are called _______________

All of the choices

In a graph, if E=(u,v), it means _____________.

u is adjacent to v but v is not adjacent to u

Graph G is _____________ if for any pair u, v of nodes in G, there is a path from u to v or path
from v to u.
Unliterally connected

A connected graph T without any cycles is called a ____________.

all of these

In binary trees, nodes with no successor are called _______________.

Terminal Nodes

In an extended binary tree, nodes with 2 children are called _________________.

Internal node

Linked representation of binary tree needs ______ parallel arrays.

This is the operation of processing each element in the list.

Traversal

Trees are ________ if they are similar and have the same contents at corresponding nodes.
copies
These are binary trees with threads.

Threaded trees

If the number of records to be sorted is small, then __________ sorting can be efficient.

Selection

The rearranging of pairs of elements which are out of order, until no such pairs remain.

Exchange

The complexity of bubble sort algorithm.

O(n2)

If the number of records to be sorted is small, then __________ sorting can be efficient.

Selection

Which of the following is not a limitation of binary search algorithm?

Binary search algorithm is not efficient when the data elements more than 1500

__________________ is putting an element in the appropriate place in a sorted list yields a

larger sorted order list.

insertion

Which of the following sorting algorithm is of priority queue sorting type?

Selection sort

Partition and exchange sort is ____________.

Quick Sort

What does the sequential representation of binary trees use?

Array with pointers

Every node N in a binary tree T except the root has a unique parent called the ________ of N.

Predecessor

In a 2-tree, nodes with 0 children are called ___________.

External Node

TREE[1]=NULL indicates tree is _________

Empty

Which of the following sorting algorithm is of the divide and conquer type?

Merge Sort

A leaf in a tree is a node with no children.

True

A program to maintain the routes in an airline.

Graph

Which of the following is/are the levels of implementation of data structure?

All of these

A stack displays FIFO behavior.

False

A _______________ is a data structure that organizes data similar to a line in the supermarket,
where the first one in line is the first one out.
Queue linked list

In a graph, the vertices represent the items being modeled.

True

A list may be linear or nonlinear, depending on its implementation.

False

A word processor to have a PF key that causes the preceding command to be redisplayed.
Every time the PF key is pressed, the program is to show the command that preceded the
one currently displayed

Stack

A program to receive data that is to be saved and processed in the reverse order.
Stack

Herder node is used as sentinel in __________________.

Binary tree

Which data structure is suitable to represent the hierarchal relationship between elements?
Tree

A dictionary of words used by a spelling checker to be built and maintained.

Binary search tree

The following algorithm is a count-controlled loop going from 1 through 5. At each

iteration, the loop counter is either printed or put on a queue depending on the result of
Boolean function RanFun(). (The behavior of RanFun() is immaterial.) At the end of the
loop, the items on the queue are dequeued and printed. Because of the logical properties
of a queue, this algorithm cannot print certain sequences of the values of the loop
counter. You are given an output and asked if the algorithm could generate the output.
Set count to 0
WHILE (count < 5)
Set count to count + 1
IF (RanFun())
Write count, ' '
ELSE
Enqueue(myQueue, count)
WHILE (NOT IsEmpty(myQueue))
Dequeue(myQueue, number)
Write number, ' '
The following output is possible using a queue: 1 3 5 2 4
True

A binary tree is a tree in which each node can have zero, one, or two children.
True

A program keeping track of where canned goods are located on a shelf.

Stack

What is written by the following algorithm?

Enqueue(myQueue, 5)
Enqueue(myQueue, 4)
Enqueue(myQueue, 4)
Dequeue(myQueue, item)
Dequeue(myQueue, item)
Enqueue(myQueue, item)
WHILE (NOT IsEmpty(myQueue))
Dequeue(myQueue, item)
Write item, ' '
4,4

A binary search tree is another name for a binary tree.

False

____________________ level is where the model becomes compatible executable code.

Implementation level

The value in the left child of a node (if it exists) in a binary search tree will be greater than
the value in the node itself.
False

Which data structure is used in breadth first search of a graph to hold nodes?

Queue

Which of the following data structure can't store the non-homogeneous data elements?

Arrays

Identify the data structure which allows deletions at both ends of the list but insertion at
only one end.

Input restricted dequeue

Stack is also called the ________________.

Last In, Last Out

On average, searching in a binary search tree is faster than searching in a list.

False

A queue displays LIFO behavior.

False

The value in the right child of a node (if it exists) in a binary search tree will be greater than
the value in the node itself.

True

A binary search cannot be applied to a tree.

False

Which data structure allows deleting data elements from and inserting at rear?

queues

A bank simulation of its teller operation to see how waiting times would be affected by
adding another teller.

Queue

____________________ is not the component of data structure.

None of these

A stack and a queue are different names for the same ADT.

False

Indicate which structure would be a more suitable choice for each of the following
applications.
A program to keep track of the soccer teams in a city tournament
Tree

Binary search trees are ordered.

True

Which of the following is not the part of ADT description?

None of these

Which of the following is non-linear data structure?

Trees
Indicate which structure would be a more suitable choice for each of the following
applications.
A program to keep track of patients as they check into a medical clinic, assigning patients to
doctors on a first-come, first-served basis.
= Queue

Which of the following data structures is linear type?

=Stack

Which of the following is true about the characteristics of abstract data types?
i. It exports a type.
ii. It exports a set of operations.
True, True

Inserting an item into the stack when stack is not full is called ____________ while operation
and deletion of item from the stack, when stack is not empty is called ________________
operation.
push, pop

The root of a tree is the node that has no ancestors.

True

Which of the following is true about the characteristics of abstract data types?
i. It exports a type.
ii. It exports a set of operations.
True, True
0
Value of first linked list index is _______________.
2
Each node in singly linked list has _______ fields.
all of these
Which of the following is an application of stack?
AVAIL
Which is the pointer associated with the availability list?
Back
New nodes are added to the ________ of the queue.
Bottom of the stack
In linked representation of stack, the null pointer of the last
node in the list signals ____________
circular linked list
A linear list in which the last node points to the first node.
circular linked list
In linked lists, there are no NULL links in ______________
Dequeue
This is a linear list in which insertions and deletions are made
to form either end of the structure.
FIFO lists
Which of the following names does not relate to stacks?
FIFO
What is a queue?
FIFO, First In First Out
This form of access is used to add and remove nodes from a
queue.
first record of the actual
data
The dummy header in linked list contains
____________________.
for the size of the structure
and the data in the structure
are constantly changing
Linked lists are best suited _____________________.
front
Deletion operation is done using __________ in a queue.
Garbage collection
This may take place only when there is some minimum
amount or no space left in free storage list.
INFO
In linked representation of stack, ___________ fields hold the
elements of the stack.
LIFO
This form of access is used to add/remove nodes from a
stack.
LIFO
Stack follows the strategy of ________________.
Link field
In a linked list, the ____________ contains the address of
next element in the list.
List
This refers to a linear collection of data items.
List traversed in two
directions
Which of the following is a two-way list?
middle
Indexing the ________________ element in the list is not
possible in linked lists.
Pop
This is the term used to delete an element from the stack.
pop
The retrieval of items in a stack is ___________ operation.
predecessor node
LINK is the pointer pointing to the ____________________.
push
The term used to insert an element into stack.
push
This is the insertion operation in the stack.
Reverse
The elements are removal from a stack in _________ order.
Sentinel
This indicates the end of the list.
singly linked list
A linear list in which the pointer points only to the successive
node.
small batches of records
from a file
What is a run list?
stacks
The term
push
and
pop
is related to _____________
Start
In the linked representation of the stack, __________ pointer
behaves as the top pointer variable of stack.
The new node is placed at
the front of the linked list
What happens when you push a new node onto a stack?
Top
A pointer variable which contains the location at the top
element of the stack.
TOP
Which is the pointer associated with the stack?
traversal
The operation of processing each element in the list is known
as ________________.
Two fields
Each node in a linked list must contain at least
___________________.
Underflow
The situation when in a linked list START=NULL is
____________________.
Bottom of the stack
In linked representation of stack, the null pointer of the last
node in the list signals _____________________.
Reverse
"The elements are removal from a stack in _________ order. "
stacks
The term
push
and
pop
is related to _____________.
Dequeue
"This form of access is used to add/remove nodes from a
stack. "
push, pop
Inserting an item into the stack when stack is not full is called
____________ while operation and deletion of item from the
stack, when stack is not empty is called ________________
operation.
queue
It is a pile in which items are added at one end and removed
from the other.
Stack
A word processor to have a PF key that causes the preceding
command to be redisplayed. Every time the PF key is
pressed, the program is to show the command that preceded
the one currently displayed
FALSE
A binary search tree is another name for a binary tree.
TRUE
Binary search trees are ordered.
FALSE
Algorithms that use a list must know whether the list is array
based or linked.
FALSE
The value in the left child of a node (if it exists) in a binary
search tree will be greater than the value in the node itself.
Queue
Which data structure is used in breadth first search of a graph
to hold nodes?
TRUE
The value in the right child of a node (if it exists) in a binary
search tree will be greater than the value in the node itself.
FALSE
A stack displays FIFO behavior.
Stack
A program keeping track of where canned goods are located
on a shelf.
AVL tree
A binary search tree whose left subtree and right subtree differ
in height by at most 1 unit is called ____________________.
FALSE
A stack and a queue are different names for the same ADT.
Queue
A bank simulation of its teller operation to see how waiting
times would be affected by adding another teller.
Graph
Which of the following data structure is non-linear type?
TRUE
In a graph, the vertices represent the items being modeled.
All of these
Which of the following is/are the levels of implementation of
data structure?
Queue
A program to keep track of patients as they check into a
medical clinic, assigning patients to doctors on a first-come,
first-served basis.
FALSE
A list may be linear or nonlinear, depending on its
implementation.
FALSE
A binary search cannot be applied to a tree.
TRUE
A leaf in a tree is a node with no children.
Stack
A program to receive data that is to be saved and processed
in the reverse order.
Implementation level
____________________ level is where the model becomes
compatible executable code.
Binary search tree
An electronic address book ordered by name
stack
This is very useful in situation when data have to be stored
and then retrieved in reverse order.
TRUE
The root of a tree is the node that has no ancestors.
Last in, first out
Stack is also called the ________________.
Stack
Which of the following data structures is linear type?
None of these
____________________ is not the component of data
structure.
Tree, Binary search tree
Indicate which structure would be a more suitable choice for
each of the following applications.
Input restricted dequeue
Identify the data structure which allows deletions at both ends
of the list but insertion at only one end.
Graph
A program to maintain the routes in an airline.
TRUE
A binary tree is a tree in which each node can have zero, one,
or two children.
None of these
Which of the following is not the part of ADT description?
Tree
Which data structure is suitable to represent the hierarchal
relationship between elements?
Binary tree
Herder node is used as sentinel in __________________.
queues
Which data structure allows deleting data elements from and
inserting at rear?
Queue linked list
A _______________ is a data structure that organizes data
similar to a line in the supermarket, where the first one in line
is the first one out.
Binary search tree
A dictionary of words used by a spelling checker to be built
and maintained.
FALSE
On average, searching in a binary search tree is faster than
searching in a list.
Arrays
Which of the following data structure can't store the non-
homogeneous data elements?
Trees
Which of the following is non-linear data structure?
FALSE
A queue displays LIFO behavior.
Tree
A program to keep track of the soccer teams in a city
tournament
Fill in the following table, using Big-O notation to give the worst and average-case times for each of
the stack methods for a stack of size N.
OPERATION WORST-CASE TIME AVERAGE-CASE TIME
Constructor O(1) O(1)
Empty O(1) O(1)
Size O(1) O(1)
Push O(N) O(1)
Pop O(1) O(1)
Peek O(1) O(1)
In a graph, if e=[u,v], then u and v are called
= End points of e
This is a binary tree whose every node has either zero or two children.
= binary search tree
The average case occurs in linear search algorithm
= when item is somewhere in the middle of the array
___________ sorting algorithm is frequently used when n is small, where n is the total number of
elements.
= Insertion
Which of the following is not the required condition for binary search algorithm?
= There must be mechanism to delete and/or insert elements in list
The complexity of linear search algorithm.
= O(n)
Graph G is _____________ if for any pair u, v of nodes in G, there is a path from u to v or path from v to
u.
= Unliterally connected
The complexity of sorting algorithm measures the __________ as a function of the number n of items to
be shorter.
= running time
The worst case occurs in linear search algorithm when
= Item is the last element in the array or item is not there at all
Another name for directed graph.
= Digraph
The rearranging of pairs of elements which are out of order, until no such pairs remain.
= Exchange
If the number of records to be sorted is small, then __________ sorting can be efficient.
= Selection
TREE[1]=NULL indicates tree is
= Empty
Which of the following sorting algorithm is of priority queue sorting type?
= Selection sort
Every node N in a binary tree T except the root has a unique parent called the ________ of N.
= Predecessor
Trees are ________ if they are similar and have the same contents at corresponding nodes.
= copies
What does the sequential representation of binary trees use?
= Array with pointers
In an extended binary tree, nodes with 2 children are called
= Internal node
Partition and exchange sort is ____________.
= quick sort
Which of the following is not a limitation of binary search algorithm?
= binary search algorithm is not efficient when the data elements more than 1500
These are binary trees with threads.
= Threaded trees
Sorting algorithm can be characterized as
= Both of the choices
__________________ is putting an element in the appropriate place in a sorted list yields a larger sorted
order list.
= insertion
The rearranging of pairs of elements which are out of order, until no such pairs remain.
= Exchange
TREE[1]=NULL indicates tree is _________
= Empty
Linked representation of binary tree needs ______ parallel arrays.
=3
Which of the following sorting algorithm is of the divide and conquer type?
= Merge sort
A connected graph T without any cycles is called a
= A tree graph
In a graph, if E=(u,v), it means
= u is adjacent to v but v is not adjacent to u
State True or False for internal sorting algorithms.
i. Internal sorting are applied when the entire collection if data to be sorted is small enough that the
sorting can take place within main memory.
ii. The time required to read or write is considered significant in evaluating the performance of internal
sorting.
= True, False
A connected graph T without any cycles is called
= no cycle graph