# General knowledge(GK)/Date of death(������������������ ������������) Sample Test,Sample questions

1.15

2.10

3.25

4.35

1.6

2.4

3.5

4.3

## Question: `A priority queue Q is used to implement a stack S that stores characters. PUSH(C) is implemented as INSERT(Q, C, K) where K is an appropriate integer key chosen by the implementation. POP is implement`

1.Non-increasing order

2.Non-decreasing order

3.strictly increasing order

4.strictly decreasing order

## Question: `A single array A[1..MAXSIZE] is used to implement two stacks. The two stacks grow from opposite ends of the array. Variables top1 and top2 (topl< top 2) point to the location of the topmost element in`

1.(top1 = MAXSIZE/2) and (top2 = MAXSIZE/2+1)

2.top1= top2 -1

3.top1 + top2 = MAXSIZE

4.(top1= MAXSIZE/2) or (top2 = MAXSIZE)

1.10

2.20

3.15

4.30

## Question: `Array is collection of similar data type while structure is collection of:-`

1.array

2.Primitive data type

3.Different data type

4.Non primitive data type

## Question: `Assume that the operators +, -, × are left associative and ^ is right associative. The order of precedence (from highest to lowest) is ^, x , +, -. The postfix expression corresponding to the infix ex`

1.abc × + def ^ ^ -

2.abc × - def ^ ^ +

3.abc × + de ^ f ^ -

4.abc + × def ^ ^ -

1.1

2.-1

3.0

4.All of above

## Question: `Balancing Factor of each node in B and B+ tree is`

1.1

2.0

3.-1

4.All of the above

1.Heap

2.Binary Tree

3.Array

4.Hashing

1.O(n logk)

2.O(nk)

3.O(k)

4.O(n)

## Question: `Consider the following operations performed on a stack of size 5 : Push (a); Pop() ; Push(b); Push(c); Pop(); Push(d); Pop();Pop(); Push (e) Which of the following statements is correct?`

1.Underflow occurs

2.Stack operations are performed smoothly

3.Overflow occurs

4.None of the above

1.Question

2.iontQues

3.QuesQues

4.noitseuQ

## Question: ```Consider the following statements: i. First-in-first out types of computations are efficiently supported by STACKS. ii. Implementing LISTS on linked lists is more efficient than implementing LIST```

1.(ii) and (iii) are true

2.(i) and (iii) are true

3.(i) and (ii) are true

4.(ii) and (iv) are true

1.2

2.1

3.12

4.34

## Question: `Convert the following infix expression into its equivalent post fix expression (A + B^ D) / (E * F) + G`

1.ABD^ + EF * / G+

2.ABD+ ^ EF * / G+

3.ABD^ + EF / - G+

4.ABD + EF * / G+ ^

## Question: ```Following is C like pseudo code of a function that takes a number as an argument, and uses a stack S to do processing. void fun(int n) { Stack S; // Say it creates an empty stack S while ```

1.Prints binary representation of n in reverse order

2.Prints binary representation of n

3.Prints the value of Logn

4.Prints the value of Logn in reverse order

## Question: `Hashing is a powerful data structure for the:-`

1.Sorting

2.Searching

3.Insertion & deletion

4.Storing data in Data base

1.2,2,1,1,2

2.2,2,1,2,2

3.2,1,2,1,2

4.2,1,1,2,2

## Question: `In circular link list, the last node contain the address of the:-`

1.It contain NULL

2.first node

3.Both of the above

4.None of the above

1.O(n)

2.O(logn)

3.O(nlogn)

4.O(1)

1.O(logn)

2.O(n)

3.O(nlogn)

4.O(1)

## Question: `In min Heap, the cost of finding smallest elements is:-`

1.O(n)

2.O(1)

3.O(logn)

4.None of the above

## Question: ```int func(struct node *ptr) { if(ptr==NULL) return; func(ptr->left); func(ptr->right); printf("%d",ptr->data); } The above function computes the :-```

1.Postorder of BST

2.Inorder of BST

3.Preorder of BST

4.None of the above

## Question: ```int func(struct node *ptr) { if(ptr==NULL) return; func(ptr->left); printf("%d",ptr->data); func(ptr->right); } The above function computes the :-```

1.Postorder of BST

2.Inorder of BST

3.Preorder of BST

4.None of the above

## Question: ```int func(struct node *ptr) { if(ptr==NULL) return; printf("%d",ptr->data); func(ptr->left); func(ptr->right); } The above function computes the :-```

1.Postorder of BST

2.Inorder of BST

3.Preorder of BST

4.All of the above

1.n(X+ Y)

2.3Y + 2X

3.n(X + Y)-X

4.Y + 2X

1.b a c

2.a b c

3.c a b

4.b a c

## Question: `Stack is implemented by:-`

1.Array

3.Both of the above

4.None of the above

## Question: `Suppose a stack is to be implemented with a linked list instead of an array. What would be the effect on the time complexity of the push and pop operations of the stack implemented using linked list (`

1.O(1) for insertion and O(n) for deletion

2.O(1) for insertion and O(1) for deletion

3.O(n) for insertion and O(1) for deletion

4.O(n) for insertion and O(n) for deletion

1.Queue

2.Tree

3.Heap

4.Stack

## Question: `The cost of construct the Heap is :-`

1.O(n)

2.O(nlogn)

3.O(log(logn))

4.None of the above

1.A

2.B

3.C

4.D

## Question: ```The following node are inserted sequentially in Binary search tree:- 30,3,50,10,5,70,80,75,60,45 what will be the Inorder of above BST?```

1.3,5,10,30,45,50,60,70,75,80

2.80,5,10,30,45,50,60,70,75,3

3.30,3,50,10,45,70,5,60,75,80

4.3,5,10,30,45,50,70,60,80,75

## Question: ```The following node are inserted sequentially in Binary search tree:- 30,3,50,10,5,70,80,75,60,45 what will be the preorder of above BST?```

1.30,3,10,5,50,45,60,70,75,80

2.No preorder exist

3.Preorder of every BST is in increasing order of numbers

4.30,3,10,5,50,45,70,60,80,75

1.7,2

2.1,1

3.6,1

4.Empty

1.1

2.3

3.2

4.4

1.123

2.142

3.34

4.289

1.A

2.B

3.F

4.G

## Question: `To evaluate an expression without any embedded function calls:`

1.One stack is enough

2.Two stacks are needed

3.As many stacks as the height of the expression tree are needed

4.A Turing machine is needed in the general case

## Question: `Which of the following are true:`

1.Insertion in stack is done at the bottom of the stack

2.Searching an element in link list is performed in O(1)

3.Every binary search tree is binary tree

4.Every binary tree is binary search tree

## Question: `Which of the following are true:`

1.Stack are the LIFO

2.Queue is FIFO

3.Queue is LILO

4.All of the above

## Question: `Which of the following are True?`

1.Every Binary Tree is binary search tree

2.Binary search tree is AVL tree

3.Every AVL tree is binary tree

4.No relation between the binary tree and the AVL tree

## Question: `Which of the following is not an inherent application of stack?`

1.Implementation of recursion

2.Evaluation of a postfix expression

3.Job scheduling

4.Reverse a string

## Question: `Which of the following is true about linked list implementation of stack?`

1.In push operation, if new nodes are inserted at the beginning of linked lis

2.In push operation, if new nodes are inserted at the end, then in pop operat

3.Both of the above

4.None of the above

1.7, 8, 9, 5, 6

2.5, 9, 6, 7, 8

3.7, 8, 9, 6, 5

4.9, 8, 7, 5, 6

## Question: `Which of the following sorting are the stable sorting:-`

1.Insertion Sort

2.Selection Sort

3.Bubble Sort

4.All of the above

## Question: `Which of the following tree support the sequential search?`

1.AVL tree

2.B tree

3.B+ tree

4.Complete Binary tree

## Question: `Which one of the following is an application of Stack Data Structure?`

1.Arithmetic expression evaluation

2.Managing function calls

3.The stock span problem

4.All of the above

1.O(logn)

2.O(n)

3.O(1)

4.O(nlogn)

## More MCQS

##### R4R Team
R4Rin Top Tutorials are Core Java,Hibernate ,Spring,Sturts.The content on R4R.in website is done by expert team not only with the help of books but along with the strong professional knowledge in all context like coding,designing, marketing,etc!