What is a data structure?
What are the disadvantages of arrays?
Which data structure is used for implementing recursion?
The data structure required to check whether an expression contains a balanced parenthesis is?
Which of the following is not the application of stack?
Which data structure is needed to convert infix notation to postfix notation?
What is the value of the postfix expression 6 3 2 4 + – *?
What data structure would you mostly likely see in non recursive implementation of a recursive algorithm?
Which of the following statement(s) about stack data structure is/are NOT correct?
The data structure required for Breadth First Traversal on a graph is?
The prefix form of A-B/ (C * D ^ E) is?
Which of the following points is/are not true about Linked List data structure when it is compared with an array?
Which data structure is based on the Last In First Out (LIFO) principle?
Which of the following application makes use of a circular linked list?
What is a bit array?
Which of the following tree data structures is not a balanced binary tree?
Which of the following is not the type of queue?
Which of the following data structures can be used for parentheses matching?
Which algorithm is used in the top tree data structure?
What is the need for a circular queue?
Which of the following is the most widely used external memory data structure?
Which of the following is also known as Rope data structure?
What will be the output of the following program? main() { char str[]="san foundry"; int len = strlen(str); int i; for(i=0;i<len;i++) push(str[i]); // pushes an element into stack for(i=0;i<len;i++) pop(); //pops an element from the stack }
Which of the following data structure can provide efficient searching of the elements?
What is an AVL tree?
The optimal data structure used to solve Tower of Hanoi is _________
What is the use of the bin data structure?
Which is the most appropriate data structure for reversing a word?
What is the functionality of the following piece of code? public void display() { if(size == 0) System.out.println("underflow"); else { Node current = first; while(current != null) { System.out.println(current.getEle()); current = current.getNext(); } } }
Which of the following is the simplest data structure that supports range searching?