Total Questions-> 30Full Time-> 10 minutesNegative marking->0. 15 for each question if answered wrongTotal Marks-> 30 (1 for each question)Before starting the test please fill out the form below as it will be needed to generate the Certificate. <=50% -> Certificate will be provided
Linked list
Node list
Primitive list
None of these
Recursive
Abstract data type
Storage structure
file structure
Nodes
Edges
Direction of edges
Parallel edges
Merge sort
Heap sort
Bubble sort
None of these
Trees
Graphs
Arrays
None of above
Quick Sort
Merge Sort
Insertion Sort
Heap Sort
FIFO (First In First Out) list.
LIFO (Last In First Out) list.
Ordered array.
Linear tree.
Branch
Queue
Tree
Stack
AB+ CD*E − FG /**
AB + CD* E − F **G /
AB + CD* E − *F *G /
AB + CDE * − * F *G /
N nodes.
Log n 2 nodes.
2n –1 nodes.
n 2 nodes.
Collection of node
Collection of information
Set of value
Set of node
ADT Error
Stack implementation Error
Indifinite Error
Syntax Error
LILO
FIFO
FILO
LIFO
Front=-1
Front=(rear+1)%maxsize
Front=(front+1)%maxsize
Rear=(rear+1)%maxsize
Reversal of string
Evaluation of arithimatic operation
Real operating system
Recursion
Binary tree
Binary search tree
Bst with Height balance
Multi way search tree with Height balance
0(n)
0(1)
O(log n)
0(n log n)
*
-
+
^
True
False
Malloc
Calloc
Free
Realloc
0
1
2
4
True
False
Link list
Circular queue
Stack
Double ended queue
True
False
Strlen
Strcnt
Strcat
Strcmp
Wait!
Here's an interesting quiz for you.