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?
Questions: 41  Attempts: 228

Sample QuestionLinked lists are best suited
Questions: 13  Attempts: 201

Sample QuestionSearching and sorting algorithms are best implemented with which data structure?
Following are the multiple choice questions (MCQs) or objective questions from Data Structures and Algorithms. The questions are set from the topics such as arrays, records, pointers, linked lists, stacks, queues, recursion,...
Questions: 20  Attempts: 156

Sample QuestionTwo main measures for the efficiency of an algorithm are
Questions: 20  Attempts: 124

Sample QuestionData is nothing but
Questions: 10  Attempts: 108

Sample QuestionA linear collection of data elements where the linear node is given by means of pointer is
Questions: 20  Attempts: 89

Sample QuestionThe _____________ algorithm works by repeatedly scanning through the list, comparing adjacent elements, and swapping them if they are in the wrong order.
Lets Check Yourself......
Questions: 15  Attempts: 65

Sample QuestionThe situation when in a linked list START=NULL is
Questions: 26  Attempts: 40

Sample QuestionWhich of the following data structure is not linear data structure?
In the computing world, there is a wide load of data from which we get what we want. Shell sorting in data structure as a result becomes essential and in the quiz below we look at its uses.
Questions: 5  Attempts: 40

Sample QuestionWhat are the correct intermediate steps of the following data set when it is being sorted with the Shell sort? 15,20,10,18
Questions: 100  Attempts: 38

Sample QuestionAs a result of the reorganization of the War Department in 1943, which office was established?
Advance Data Structure Quiz1
Questions: 15  Attempts: 33

Sample QuestionWhich of the following trees have height as O(lgn) where number of nodes is n.
Advance Data Structure Quiz1
Questions: 15  Attempts: 28

Sample QuestionWhich of the following trees have height as O(lgn) where number of nodes is n.
Advance Data Structure Quiz1
Questions: 15  Attempts: 27

Sample QuestionWhich of the following trees have height as O(lgn) where number of nodes is n.
Advance Data Structure Quiz1
Questions: 15  Attempts: 26

Sample QuestionWhich of the following trees have height as O(lgn) where number of nodes is n.
Advance Data Structure Quiz1
Questions: 15  Attempts: 26

Sample QuestionWhich of the following trees have height as O(lgn) where number of nodes is n.
Advance Data Structure Quiz1
Questions: 15  Attempts: 24

Sample QuestionWhich of the following trees have height as O(lgn) where number of nodes is n.
Questions: 81  Attempts: 22

Sample QuestionStack is an Abstract Class
Simple quiz about data recovery
Questions: 3  Attempts: 18

Sample QuestionWhat happens when you delete a file on your PC?
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...
Questions: 164  Attempts: 16

Sample QuestionFor a binary search algorithm to work, it is necessary that the array (list) must be
Oops,String & Collection
Questions: 20  Attempts: 6

Sample QuestionSelect Correct options in given below