-
Letter sequence
The following letter sequence was generated by using a postorder traversal of a complete binary tree T. d e b f g c h What is the root of this tree?
Select one:
h
d
None of the above
f
-
What is the best case running time for insertion sort?
Select one:
O(n)
O(log n)
O(n²)
O(n log n) -
Express the formula (logn + 2)*(n - 1) using big-O notation:
Select one:
O(n)
O(n²)
O(nlog n)
None of the above
-
Value of the first linked list index is _______.
Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) OneB) ZeroC) -1D) None of the above
-
Marbles and Floors
You have a 100-story building and a couple of marbles. You must identify thelowest floor for which a marble will break if you drop it from this floor. How fastcan you find this floor if you are given an infinite supply of marbles? What if youhave only two marbles?
-
Linear Type Data Structure
Which of the following data structure is linear type?a. Stringsb. Listsc. Queuesd. All of above
-
-
If C =2, what would be the appropriate value of n0 to show that n² +9n is O( n²)?
Select one:
4
None of the above
5
10
-
Data Structure to Maintain Photographs Database
Your job is to build a data structure to maintain a set of photographs. Your photograph database should allow you to insert and search for photographs, as well as to designate some of the photographs as favourites by marking them. In more detail, your data structure should support the following operations:
Insert(x, t, m): inserts photograph x that was taken at time t. If m = 1, then the... -
Why do we Use a Multidimensional Array?
Skill/Topic: ArrayA) A multidimensional array can be useful to organize subgroups of data within an array. In addition to organizing data stored in elements of an array, a multidimensional array can store memory addresses of data in a pointer array and an array of pointers
-
Let A be an adjacency matrix of a directed graph in G
Let A be an adjacency matrix of a directed graph in G. Then sum of all entries in the matrix is equal to
Select one:
a) twice the number of vertices in G
b) the number of edges in G
c) the number of vertices in G
d) twice the number of edges in G
-
If C =1, what would be the appropriate value of n0 to show that n² +9n is O( n²)?
Select one:
None of the above
5
4
10
-
N be the number of nodes and m be number of edges in a graph
n be the number of nodes and m be number of edges in a graph.
The number of edges in any undirected connected graph is at least
Select one:
a) n
b) n-1
c) None of the above
d) n(n-1)/2
-
A multi-way search tree
A multi-way search tree has n items. The number of external nodes is Select one:
a) n2
b) logn
c) n
d) n+1
-
What is the running time to find the depth (dv) of a node v in a binary tree?
Select one:
O(1+dv)
O(n)
O(1)
O(dv) -
-
The size of a tree is the number of nodes on the tree?
Skill/Topic: TreeA) TrueB) False
-
A linked list index is ____ that represents the position of a node in a linked list.
Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) An IntegerB) a variableC) a characterD) a boolean
-
The front of the stack in a stack-linked list ______________.
Skill/Topic: Stacks using Linked ListA) Back of the linked listB) Front of the linked listC) Middle of the Linked listD) None of the above
-
Data Structures Interview Questions
Ans