1.15

2.10

3.25

4.35

1.6

2.4

3.5

4.3

1.Non-increasing order

2.Non-decreasing order

3.strictly increasing order

4.strictly decreasing order

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

1.array

2.Primitive data type

3.Different data type

4.Non primitive data type

1.abc × + def ^ ^ -

2.abc × - def ^ ^ +

3.abc × + de ^ f ^ -

4.abc + × def ^ ^ -

1.1

2.-1

3.0

4.All of above

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)

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

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

1.ABD^ + EF * / G+

2.ABD+ ^ EF * / G+

3.ABD^ + EF / - G+

4.ABD + EF * / G+ ^

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

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

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)

1.O(n)

2.O(1)

3.O(logn)

4.None of the above

1.Postorder of BST

2.Inorder of BST

3.Preorder of BST

4.None of the above

1.Postorder of BST

2.Inorder of BST

3.Preorder of BST

4.None of the above

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

1.Array

2.Link list

3.Both of the above

4.None of the above

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

1.O(n)

2.O(nlogn)

3.O(log(logn))

4.None of the above

1.A

2.B

3.C

4.D

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

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

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

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

1.Stack are the LIFO

2.Queue is FIFO

3.Queue is LILO

4.All of the above

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

1.Implementation of recursion

2.Evaluation of a postfix expression

3.Job scheduling

4.Reverse a string

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

1.Insertion Sort

2.Selection Sort

3.Bubble Sort

4.All of the above

1.AVL tree

2.B tree

3.B+ tree

4.Complete Binary tree

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)

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!