BPSC Tre 4.0 DSA Practice Set
Que: (1). In a binary search tree, which subtree of a node contains elements that are greater than the node’s value?
Que: (2). Which data structure is used for implementing recursion
Que: (3). How many distinct binary search trees can be created out of 4 distinct keys?
Que: (4). The prefix form of A-B/ (C*D^E) is?
Que: (5). What is an AVL tree?
Que: (6). The data structure required to check whether an expression contains a balanced parenthesis is?
Que: (7). 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: (8). What is a bit array?
Que: (9). What data structure would you mostly likely see in non-recursive implementation of a recursive algorithm?
Que: (10). Which of the following is not the type of queue?
Que: (11). Which of the following data structures can be used for parentheses matching?
Que: (12). Which data structure is based on the Last In First Out (LIFO) principle?
Que: (13). Which of the following is the most widely used external memory data structure?
Que: (14). Which of the following statement(s) about stack data structure is/are NOT correct?
Que: (15). In a balanced binary tree, the height of two sub-trees of every node can not differ by more than
Que: (16). 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: (17). The result evaluating the postfix expression 10 5 + 60 6/ * 8-
Que: (18). Which data structure is needed to convert infix notation to postfix notation?
Que: (19). 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
}
Que: (20). 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