github

Made bySaurav Hathi

CSE - Practice Test -11

Q1:

"Performance based on the criteria of algorithm, which has to do with its storage requirement is _______.
"
 

Tags:
Kalsee_CSE
Section:
CSE Miscellaneous
Options:
Q2:

"How many types of data types are there?
"
 

Tags:
Kalsee_CSE
Section:
CSE Miscellaneous
Options:
Q3:

"Collection of field values of a given entity is called:
"
 

Tags:
Kalsee_CSE
Section:
CSE Miscellaneous
Options:
Q4:

"The operation performed on data structure:
"
 

Tags:
Kalsee_CSE
Section:
CSE Miscellaneous
Options:
Q5:

"f(n) ≤ c(g(n)) function represents which notation?
"
 

Tags:
Kalsee_CSE
Section:
CSE Miscellaneous
Options:
Q6:

"Which type of linked lists comprises a node containing a pointer to predecessor as well as successor?
"
 

Tags:
Kalsee_CSE
Section:
CSE Miscellaneous
Options:
Q7:

"How many operations are there in 1D array?
"
 

Tags:
Kalsee_CSE
Section:
CSE Miscellaneous
Options:
Q8:

"Linear arrays are also called _____.
"
 

Tags:
Kalsee_CSE
Section:
CSE Miscellaneous
Options:
Q9:

"The smallest element of an array’s index is called:
"
 

Tags:
Kalsee_CSE
Section:
CSE Miscellaneous
Options:
Q10:

"The use of pointers to refer elements of a data structure in which elements are logically adjacent is:
"
 

Tags:
Kalsee_CSE
Section:
CSE Miscellaneous
Options:
Q11:

"The complexity of linear search is:
"
 

Tags:
Kalsee_CSE
Section:
CSE Miscellaneous
Options:
Q12:

"Partition procedure belongs to which sort?
"
 

Tags:
Kalsee_CSE
Section:
CSE Miscellaneous
Options:
Q13:

"Heapify() procedure belongs to which sort?
"
 

Tags:
Kalsee_CSE
Section:
CSE Miscellaneous
Options:
Q14:

"Which sort is a divide-conquer technique?
"
 

Tags:
Kalsee_CSE
Section:
CSE Miscellaneous
Options:
Q15:

"Which method uses to search element in sorted list?
"
 

Tags:
Kalsee_CSE
Section:
CSE Miscellaneous
Options:
Q16:

"A binary tree whose every node has either zero or two children in called:
"
 

Tags:
Kalsee_CSE
Section:
CSE Miscellaneous
Options:
Q17:

"Which algorithm specifies the addition of edges to the Spanning Tree in an increasing order of cost?
"
 

Tags:
Kalsee_CSE
Section:
CSE Miscellaneous
Options:
Q18:

"A Vertex comprising only incoming edges without any outgoing edges, specifically known as _________.
"
 

Tags:
Kalsee_CSE
Section:
CSE Miscellaneous
Options:
Q19:

"Which amongst the following cannot be a balance factor of any node of an AVL tree?
"
 

Tags:
Kalsee_CSE
Section:
CSE Miscellaneous
Options:
Q20:

"How many rotation operation are there in AVL tree?
"
 

Tags:
Kalsee_CSE
Section:
CSE Miscellaneous
Options:
Q21:

"Deleting an item from the stack when stack is not empty is called _____ operation.
"
 

Tags:
Kalsee_CSE
Section:
CSE Miscellaneous
Options:
Q22:

"Insertion takes place at _____ in queue.
"
 

Tags:
Kalsee_CSE
Section:
CSE Miscellaneous
Options:
Q23:

"Condition of overflow in stack is:
"
 

Tags:
Kalsee_CSE
Section:
CSE Miscellaneous
Options:
Q24:

"The concept where insertion and deletion takes place in one end is:
"
 

Tags:
Kalsee_CSE
Section:
CSE Miscellaneous
Options:
Q25:

"How many types of queue are there?
"
 

Tags:
Kalsee_CSE
Section:
CSE Miscellaneous
Options: