BPSC Tre 4.0 DSA Practice Set
Que: (1). What data structure would you mostly likely see in non-recursive implementation of a recursive algorithm?
Que: (2). What are the disadvantages of arrays?
Que: (3). Which of the following tree data structures is not a balanced binary tree?
Que: (4). Merge Sort is an example of which algorithm design paradigm?
Que: (5). Which of the following statement(s) about stack data structure is/are NOT correct?
Que: (6). The data structure required to check whether an expression contains a balanced parenthesis is?
Que: (7). The prefix form of A-B/ (C*D^E) is?
Que: (8). The height of n elements 2-3 tree is ______
Que: (9). Which data structure is based on the Last In First Out (LIFO) principle?
Que: (10). Which data structure is used for implementing recursion
Que: (11). What is a bit array?
Que: (12). In a balanced binary tree, the height of two sub-trees of every node can not differ by more than
Que: (13). What is an AVL tree?
Que: (14). The order of the binary search algorithm is _______.
Que: (15). How many distinct binary search trees can be created out of 4 distinct keys?
Que: (16). What is the need for a circular queue?
Que: (17). The data structure required for Breadth First Traversal on a graph is?
Que: (18). A queue has configuration a, b, c, d. If you want to get the configuration d, c, b, a, you need a minimum of _______.
Que: (19). Which of the following data structures stores elements in a non-linear relationship?
Que: (20). Which of the following is not the application of stack?
Que: (21). Which algorithm is used in the top tree data structure?
Que: (22). Which data structure is needed to convert infix notation to postfix notation?
Que: (23). Which of the following is also known as Rope data structure?
Que: (24). Which of the following is not the type of queue?
Que: (25). Which of the following application makes use of a circular linked list?
Que: (26). Write the output of the following program: int a[ ] = {1,2,3,} *p;
Que: (27). Which of the following is the most widely used external memory data structure?
Que: (28). The preorder traversal of a binary search tree is 15, 10, 12, 11,20, 18, 16, 19. Which one of the following is the postorder traversal of the tree?
Que: (29). Which of the following points is/are not true about Linked List data structure when it is compared with an array?
Que: (30). The result evaluating the postfix expression 10 5 + 60 6/ * 8-
Que: (31). Which of the following data structure can provide efficient searching of the elements?
Which of the following data structure can provide efficient searching of the elements?
(d) treap
(b) 2-3 tree
(c) unordered lists
(a) binary search tree
Que: (32). Which of the following data structures can be used for parentheses matching?
Que: (33). What is a data structure?
Que: (34). In a binary search tree, which subtree of a node contains elements that are greater than the node’s value?
Que: (35). Which data structure is used for efficient searching, insertion, and deletion of elements?
Que: (36). What will be the output of the following program?
#include <stdio.h>
#include <string.h>
int main()
{
char str[] = "san foundry";
int len = strlen(str);
int i;
for(i = 0; i < len; i++)
push(str[i]); // pushes each character into stack
for(i = 0; i < len; i++)
printf("%c", pop()); // pops and prints from stack
}