


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

A multiway search tree
A multiway search tree has n items. The number of external nodes is Select one:
a) n2
b) logn
c) n
d) n+1

The front of the stack in a stacklinked 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

What is the minimum number of nodes in a complete binary tree with height 4?
Select one:
8
11
3
4

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) n1
c) None of the above
d) n(n1)/2

Linear Type Data Structure
Which of the following data structure is linear type?a. Stringsb. Listsc. Queuesd. All of above

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

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... 
Marbles and Floors
You have a 100story 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?

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

Consider the following statements about (2,4) trees
Consider the following statements about (2,4) trees
I) height of (2,4) tree storing n items is O(log n)
ii) Fusion operation takes constant time
iii)Deletion operation takes O(n) time
Select one:
> All of them are true
> All of them are false
> i, ii are true and iii is false
> i is true and ii, iii are false

If the depth of a tree is 3 levels, then what is the Size of the Tree?
Skill/Topic: TreeA) 8Explanation: You calculate the size of a tree by using the following formula: size = 2 ^ depth If the depth is 3 levels, then the size is 8, as shown here: 8 = 2 ^ 3

Asynchronous counter and synchronous counter
What are the areas in which asynchronous counter and synchronous counter are used.... give atleast one example of each or more

Value of the first linked list index is _______.
Skill/Topic: Stacks and Queues: Insert, Delete, Peek, FindA) OneB) ZeroC) 1D) None of the above

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) 
Express the formula (logn + 2)*(n  1) using bigO notation:
Select one:
O(n)
O(n²)
O(nlog n)
None of the above

We toss a coin until a head appears. What is the expected number of coin tosses?
Select one:
4
1
0.5
2

What is the best case running time for insertion sort?
Select one:
O(n)
O(log n)
O(n²)
O(n log n)
Data Structures Interview Questions
Ans