10/5/22, 8:33 PM Prelim Exam: Attempt review

Home / My courses / UGRD-ITE6201-2212S / Preliminary Examination / Prelim Exam

Started on Wednesday, 5 October 2022, 8:27 PM

Question 1
Correct

Mark 1.00 out of 1.00

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

Select one:
True

False 

Question 2
Correct

Mark 1.00 out of 1.00

Heap is called a ___________.

Select one:
a. MAX HEAP

b. TORIAL HEAP

c. MIN HEAP

Your answer is correct.

[Link]/2212/mod/quiz/[Link]?attempt=13794&cmid=4752 1/17
10/5/22, 8:33 PM Prelim Exam: Attempt review

Question 3

Correct

Mark 1.00 out of 1.00

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

Select one:
a. HASH ALGORITHM

b. HASH TABLE

c. HASH LOOP

Your answer is correct.

Question 4
Correct

Mark 1.00 out of 1.00

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

Select one:
True 

False

Question 5

Correct

Mark 1.00 out of 1.00

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

Select one:
True 

False

[Link]/2212/mod/quiz/[Link]?attempt=13794&cmid=4752 2/17
10/5/22, 8:33 PM Prelim Exam: Attempt review

Question 6

Correct

Mark 1.00 out of 1.00

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

Select one:
a. FALSE

b. TRUE

c. POINTS

Your answer is correct.

Question 7
Correct

Mark 1.00 out of 1.00

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. POSITIVE

b. ZERO

c. NEGATIVE

Your answer is correct.

Question 8
Correct

Mark 1.00 out of 1.00

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

Select one:
a. NO,it must be HEAP

b. TRUE

c. FALSE

Your answer is correct.

[Link]/2212/mod/quiz/[Link]?attempt=13794&cmid=4752 3/17
10/5/22, 8:33 PM Prelim Exam: Attempt review

Question 9

Correct

Mark 1.00 out of 1.00

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. HEAP SORT

b. SELECTION SORT

c. BUBBLE SORT

Your answer is correct.

Question 10
Correct

Mark 1.00 out of 1.00

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. ZERO

b. NEGATIVE

c. POSITIVE 

Your answer is correct.

Question 11
Correct

Mark 1.00 out of 1.00

Hashing provides a more reliable and_ method of data retrieval than any other data structure.

Select one:
a. FLEXIBLE

b. CONCISE

c. STRECTHABLE

Your answer is correct.

[Link]/2212/mod/quiz/[Link]?attempt=13794&cmid=4752 4/17
10/5/22, 8:33 PM Prelim Exam: Attempt review

Question 12

Correct

Mark 1.00 out of 1.00

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

Select one:
a. POP

b. LEAF

c. CARTESIAN

Your answer is correct.

Question 13
Correct

Mark 1.00 out of 1.00

______ 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. LOOP

b. TREE

c. SET

Your answer is correct.

Question 14
Correct

Mark 1.00 out of 1.00

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

[Link]/2212/mod/quiz/[Link]?attempt=13794&cmid=4752 5/17
10/5/22, 8:33 PM Prelim Exam: Attempt review

Question 15

Correct

Mark 1.00 out of 1.00

___________ 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. HEAP SORT

b. BUBBLE SORT

c. MERGE SORT

Your answer is correct.

Question 16
Correct

Mark 1.00 out of 1.00

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

Select one:
True 

False

Question 17
Correct

Mark 1.00 out of 1.00

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

[Link]/2212/mod/quiz/[Link]?attempt=13794&cmid=4752 6/17
10/5/22, 8:33 PM Prelim Exam: Attempt review

Question 18

Correct

Mark 1.00 out of 1.00

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
Correct

Mark 1.00 out of 1.00

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. NO

c. TRUE

Your answer is correct.

Question 20
Correct

Mark 1.00 out of 1.00

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

Select one:
a. CROSS

b. HEAP

c. LEAF

Your answer is correct.

[Link]/2212/mod/quiz/[Link]?attempt=13794&cmid=4752 7/17
10/5/22, 8:33 PM Prelim Exam: Attempt review

Question 21

Correct

Mark 1.00 out of 1.00

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

Select one:
a. TRUE

b. FALSE

c. NONE OF THE ABOVE

Your answer is correct.

Question 22
Correct

Mark 1.00 out of 1.00

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

Select one:
a. EDGES

b. POINTS

c. ANGLES

Your answer is correct.

Question 23
Correct

Mark 1.00 out of 1.00

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. BELLMAN-FORD

c. FORD

Your answer is correct.

[Link]/2212/mod/quiz/[Link]?attempt=13794&cmid=4752 8/17
10/5/22, 8:33 PM Prelim Exam: Attempt review

Question 24

Correct

Mark 1.00 out of 1.00

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 25
Correct

Mark 1.00 out of 1.00

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

Select one:
a. SASH

b. GREEDY

c. BEARD

Your answer is correct.

Question 26
Correct

Mark 1.00 out of 1.00

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

Select one:
a. HASH

b. ALGORITHM

c. GRAPH

Your answer is correct.

[Link]/2212/mod/quiz/[Link]?attempt=13794&cmid=4752 9/17
10/5/22, 8:33 PM Prelim Exam: Attempt review

Question 27

Correct

Mark 1.00 out of 1.00

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

Select one:
a. POINTS

b. SET

c. PATH

Your answer is correct.

Question 28
Correct

Mark 1.00 out of 1.00

Count controlled loops is a type of an iterations.

Select one:
True 

False

Question 29

Correct

Mark 1.00 out of 1.00

The acronym FIFO stands for ?

Select one:
a. FIRST IN FIRST OUT

b. FIRST IN AND FIRST OUT

c. FIRST AND FIRST OUT

Your answer is correct.

[Link]/2212/mod/quiz/[Link]?attempt=13794&cmid=4752 10/17
10/5/22, 8:33 PM Prelim Exam: Attempt review

Question 30

Correct

Mark 1.00 out of 1.00

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.3

b. 1.5

c. 1.2

Your answer is correct.

Question 31
Correct

Mark 1.00 out of 1.00

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 32
Correct

Mark 1.00 out of 1.00

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

Select one:
a. BINARY 

b. BINARY TREE

c. DATA TREE

Your answer is correct.

[Link]/2212/mod/quiz/[Link]?attempt=13794&cmid=4752 11/17
10/5/22, 8:33 PM Prelim Exam: Attempt review

Question 33

Correct

Mark 1.00 out of 1.00

___________ 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. LONG QUEUE

c. CIRCULAR QUEUE

Your answer is correct.

Question 34
Correct

Mark 1.00 out of 1.00

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

Select one:
True 

False

Question 35
Correct

Mark 1.00 out of 1.00

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

Select one:
a. DEFINED

b. DYNAMIC

c. SYSTEMATIC

Your answer is correct.

[Link]/2212/mod/quiz/[Link]?attempt=13794&cmid=4752 12/17
10/5/22, 8:33 PM Prelim Exam: Attempt review

Question 36

Correct

Mark 1.00 out of 1.00

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 LOOP

c. MAX SORT

Your answer is correct.

Question 37
Correct

Mark 1.00 out of 1.00

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 38
Correct

Mark 1.00 out of 1.00

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 

[Link]/2212/mod/quiz/[Link]?attempt=13794&cmid=4752 13/17
10/5/22, 8:33 PM Prelim Exam: Attempt review

Question 39

Correct

Mark 1.00 out of 1.00

_________A sorting algorithm used for numbers.

Select one:
a. RADIX

b. MERGE

c. HEAP

Your answer is correct.

Question 40
Correct

Mark 1.00 out of 1.00

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 41
Correct

Mark 1.00 out of 1.00

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

[Link]/2212/mod/quiz/[Link]?attempt=13794&cmid=4752 14/17
10/5/22, 8:33 PM Prelim Exam: Attempt review

Question 42

Correct

Mark 1.00 out of 1.00

_______ 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

Your answer is correct.

Question 43
Correct

Mark 1.00 out of 1.00

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. NO

b. YES

c. NONE OF THE ABOVE

Your answer is correct.

Question 44
Correct

Mark 1.00 out of 1.00

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

[Link]/2212/mod/quiz/[Link]?attempt=13794&cmid=4752 15/17
10/5/22, 8:33 PM Prelim Exam: Attempt review

Question 45

Correct

Mark 1.00 out of 1.00

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. FALSE

b. TRUE

c. NULL

Your answer is correct.

Question 46
Correct

Mark 1.00 out of 1.00

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

Select one:
a. SYSTEMATIC

b. UNIVERSAL

c. STABLE

Your answer is correct.

Question 47
Correct

Mark 1.00 out of 1.00

_________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

Your answer is correct.

[Link]/2212/mod/quiz/[Link]?attempt=13794&cmid=4752 16/17
10/5/22, 8:33 PM Prelim Exam: Attempt review

Question 48

Correct

Mark 1.00 out of 1.00

Greedy algorithm is  efficient whereas Dynamic programming is more efficient.

Select one:
True

False 

Question 49
Correct

Mark 1.00 out of 1.00

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. POINTS

b. VERTEX

c. VERTICES

Your answer is correct.

Question 50

Correct

Mark 1.00 out of 1.00

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

Select one:
a. INTERNAL

b. PRIORITY

c. DIRECT

Your answer is correct.

◄ Announcements

Jump to...

Prelim Lab Exam ►

[Link]/2212/mod/quiz/[Link]?attempt=13794&cmid=4752 17/17