12/6/22, 12:24 AM Pre Final Lab Exam: Attempt review

Home / My courses / UGRD-ITE6201-2212S / Pre Final Examination / Pre Final Lab Exam

Started on Sunday, 4 December 2022, 11:26 PM

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

b. FORD

c. DIJKSTRA

Your answer is correct.

Question 2
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

b. 1.56

c. 1.3

Your answer is correct.

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=98391&cmid=4762 1/18
12/6/22, 12:24 AM Pre Final Lab Exam: Attempt review

Question 3

Correct

Mark 1.00 out of 1.00

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

Select one:
a. TRUE

b. BOTH A AND B

c. FALSE

Your answer is correct.

Question 4
Correct

Mark 1.00 out of 1.00

A simple graph may be either ____________.

Select one:
a. BOTH A AND B

b. CONNECTED

c. DISCONNECTED

Your answer is correct.

Question 5
Correct

Mark 1.00 out of 1.00

Eulerian refers to the Swiss mathematician _____Euler, who invented graph theory in the 18th century.

Select one:
a. DAMSCUS

b. LEONHARD

c. FLLOYD

Your answer is correct.

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=98391&cmid=4762 2/18
12/6/22, 12:24 AM Pre Final Lab Exam: Attempt review

Question 6

Correct

Mark 1.00 out of 1.00

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

Select one:
a. NO

b. BOTH A AND B

c. YES

Your answer is correct.

Question 7
Correct

Mark 1.00 out of 1.00

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. BOTH A AND B
c. TRUE

Your answer is correct.

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

b. ANGLES

c. EDGES

Your answer is correct.

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=98391&cmid=4762 3/18
12/6/22, 12:24 AM Pre Final Lab Exam: Attempt review

Question 9

Correct

Mark 1.00 out of 1.00

 Hashing is also used in encryption.

Select one:
a. NO, IT IS USE FOR TAPPING

b. NO

c. YES

Your answer is correct.

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

b. FALSE

c. TRUE

Your answer is correct.

Question 11
Correct

Mark 1.00 out of 1.00

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

Select one:
a. GENERAL

b. SLOW

c. BUG

Your answer is correct.

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=98391&cmid=4762 4/18
12/6/22, 12:24 AM Pre Final Lab Exam: Attempt review

Question 12

Correct

Mark 1.00 out of 1.00

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

Select one:
a. NO

b. YES

c. USUALLY 

Your answer is correct.

Question 13
Correct

Mark 1.00 out of 1.00

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

Select one:
a. DOUBLE

b. MULTI

c. SINGLE

Your answer is correct.

Question 14
Correct

Mark 1.00 out of 1.00

An MD5 hash function encodes a string of information and encodes it into a___bit fingerprint.

Select one:
a. 128

b. 64

c. 256

Your answer is correct.

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=98391&cmid=4762 5/18
12/6/22, 12:24 AM Pre Final Lab Exam: Attempt review

Question 15

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

b. TREE

c. LOOP

Your answer is correct.

Question 16
Correct

Mark 1.00 out of 1.00

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

Select one:
a. FIRST

b. THIRD

c. SECOND

Your answer is correct.

Question 17
Correct

Mark 1.00 out of 1.00

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

Select one:
a. FALSE

b. NO, IT MUST BE ONE QUANTITY ONLY

c. TRUE

Your answer is correct.

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=98391&cmid=4762 6/18
12/6/22, 12:24 AM Pre Final Lab Exam: Attempt review

Question 18

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

b. POINTS

c. FALSE

Your answer is correct.

Question 19
Correct

Mark 1.00 out of 1.00

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

Select one:
a. TABLE

b. SET

c. PATH

Your answer is correct.

Question 20
Correct

Mark 1.00 out of 1.00

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

Select one:
a. YES

b. NULL

c. NONE

Your answer is correct.

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=98391&cmid=4762 7/18
12/6/22, 12:24 AM Pre Final Lab Exam: Attempt review

Question 21

Correct

Mark 1.00 out of 1.00

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

Select one:
a. HASHING

b. ANALYTICS

c. GRAPH

Your answer is correct.

Question 22
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. BEARD

b. SASH

c. GREEDY

Your answer is correct.

Question 23
Correct

Mark 1.00 out of 1.00

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

Select one:
a. NULL

b. EXPONENTIAL

c. DYNAMIC

Your answer is correct.

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=98391&cmid=4762 8/18
12/6/22, 12:24 AM Pre Final Lab Exam: Attempt review

Question 24

Correct

Mark 1.00 out of 1.00

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

Select one:
a. n*2

b. n*1

c. n*n

Your answer is correct.

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

b. ZERO

c. NEGATIVE

Your answer is correct.

Question 26
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.2

b. 1.3

c. 1.5

Your answer is correct.

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=98391&cmid=4762 9/18
12/6/22, 12:24 AM Pre Final Lab Exam: Attempt review

Question 27

Correct

Mark 1.00 out of 1.00

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

Select one:
a. HASHABLE

b. GRAPHS

c. HASH

Your answer is correct.

Question 28
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 LOOP

c. HASH TABLE

Your answer is correct.

Question 29
Correct

Mark 1.00 out of 1.00

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

Select one:
a. KRUSKAL'S

b. FLLOYD

c. PRIM'S

Your answer is correct.

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=98391&cmid=4762 10/18
12/6/22, 12:24 AM Pre Final Lab Exam: Attempt review

Question 30

Correct

Mark 1.00 out of 1.00

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

b. AT REST

c. SLOWER

Your answer is correct.

Question 31
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. ALGORITHM

b. HASH

c. GRAPH

Your answer is correct.

Question 32
Correct

Mark 1.00 out of 1.00

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

Select one:
a. MD1

b. MD3

c. MD5

Your answer is correct.

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=98391&cmid=4762 11/18
12/6/22, 12:24 AM Pre Final Lab Exam: Attempt review

Question 33

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

b. POP

c. LEAF

Your answer is correct.

Question 34
Correct

Mark 1.00 out of 1.00

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

Select one:
a. YES

b. NO

c. NULL

Your answer is correct.

Question 35
Correct

Mark 1.00 out of 1.00

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

Select one:
a. NONE OF THE ABOVE

b. FALSE

c. TRUE

Your answer is correct.

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=98391&cmid=4762 12/18
12/6/22, 12:24 AM Pre Final Lab Exam: Attempt review

Question 36

Correct

Mark 1.00 out of 1.00

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

c. NEUTRAL

Your answer is correct.

Question 37

Correct

Mark 1.00 out of 1.00

A graph is a____structure that has two types of elements, vertices and edges.

Select one:
a. PATH

b. ALGORITHM

c. DATA

Your answer is correct.

Question 38
Correct

Mark 1.00 out of 1.00

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

Select one:
a. KRUSKAL'S

b. PRIM'S

c. FLLOYD

Your answer is correct.

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=98391&cmid=4762 13/18
12/6/22, 12:24 AM Pre Final Lab Exam: Attempt review

Question 39

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

b. VERTICES

c. POINTS

Your answer is correct.

Question 40
Correct

Mark 1.00 out of 1.00

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

c. FALSE

Your answer is correct.

Question 41
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. NEGATIVE

b. POSITIVE

c. ZERO

Your answer is correct.

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=98391&cmid=4762 14/18
12/6/22, 12:24 AM Pre Final Lab Exam: Attempt review

Question 42

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

b. DYNAMIC

c. DEFINED

Your answer is correct.

Question 43
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. STABLE

b. UNIVERSAL

c. SYSTEMATIC

Your answer is correct.

Question 44
Correct

Mark 1.00 out of 1.00

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

b. SINGLE

c. PAIR

Your answer is correct.

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=98391&cmid=4762 15/18
12/6/22, 12:24 AM Pre Final Lab Exam: Attempt review

Question 45

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

b. FLEXIBLE

c. CONCISE

Your answer is correct.

Question 46
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. SET

b. POINTS

c. PATH

Your answer is correct.

Question 47
Correct

Mark 1.00 out of 1.00

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

c. SELDOM

Your answer is correct.

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=98391&cmid=4762 16/18
12/6/22, 12:24 AM Pre Final Lab Exam: Attempt review

Question 48

Correct

Mark 1.00 out of 1.00

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

Select one:
a. HASH

b. HASHING

c. HASTABLE

Your answer is correct.

Question 49
Correct

Mark 1.00 out of 1.00

A simple graph, also called a ______graph.

Select one:
a. STRICT

b. DIJKSTRA

c. SHORTEST

Your answer is correct.

Question 50
Correct

Mark 1.00 out of 1.00

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

Select one:
a. FULL

b. WEIGHTED

c. UNWEIGHTED

Your answer is correct.

◄ Pre Final Exam

Jump to...

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=98391&cmid=4762 17/18
12/6/22, 12:24 AM Pre Final Lab Exam: Attempt review

semestralexam.amaes.com/2212/mod/quiz/review.php?attempt=98391&cmid=4762 18/18