Related Topics

In linked lists there are no NULL links in 
In a stack the command to access nth element from the top of the stack S will be 
If yyy, xxx and zzz are the elements of a lexically ordered binary tree, then in preorder traversal which node will be traverse first 
What are the correct intermediate steps of the following data set when it is being sorted with the Insertion sort? 15,20,10,18 
Consider the following lists of partially sorted numbers. The double bars represent the sort marker. How many comparisons and swaps are needed to sort the next number. [1 3 4 8 9  5 2] 
Consider the following lists of partially sorted numbers. The double bars represent the sort marker. How many comparisons and swaps are needed to sort the next number. [1 3 4 5 8 9  2] 
An Array is what kind of data structure 
While inserting an item in an array of integers which loop is right, where pos is the pos at which insertion is to be made(assume array starts from 1 and N is the max no. of items in the array.) 
To delete an item from an array which loop is correct, where p is the position of deletion( assume array starts from 1 and N is the max no. of items in the array.) 
Linked lists are best suited 
The complexity of merge sort algorithm is 
Which of the following data structure is not linear data structure?
13 Questions
Following are the multiple choice questions (...
10 Questions
20 Questions
Lets Check Yourself......
60 Questions
75 Questions
100 Questions
20 Questions
81 Questions
Simple quiz about data recovery
Oops,String & Collection
SHARES