
What is the tradeoff using a linked list
What is the tradeoff using a linked list!!


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

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

Stack Overflow
How will you identify Stack Overflow?

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


Container Data Structures
What are the container data structures other than Arrays, Lists and Queues?

Concatenate two circularly single linked list into one circularly linked list
typedef struct listnode*list pointer;
typedef struct list node{
int data;
list pointer link;
};
list pointer concatenate(list pointer list1,list pointer list2){
} 

Which of the following abstract data types are NOT used by Integer Abstract Data type group?
Skill/Topic: Memory, Abstract Data Types, and AddressesA) ShortB) IntC) floatD) longExplanation: The integer abstract data type group consists of four abstract data types used to reserve memory to store whole numbers: byte, short, int , and long


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

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 size of a tree is the number of nodes on the tree?
Skill/Topic: TreeA) TrueB) False


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) 
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

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

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
Data Structures Interview Questions
Ans