What happens if we apply the below operations on an input sequence? i. construct a cartesian tree for input sequence ii. put the root element of above tree in a priority queue iii. if( priority queue is not empty) then iv. search and delete minimum value in priority queue v. add that to output vi. add cartesian tree children of above node to priority queue

The following lines talks about deleting a node in a binary tree.(the tree property must not be violated after deletion) i) from root search for the node to be deleted ii) iii) delete the node at what must be statement ii) and fill up statement iii)

A

ii)-find random node,replace with node to be deleted. iii)- delete the node

B

ii)-find node to be deleted. iii)- delete the node at found location

C

ii)-find deepest node,replace with node to be deleted. iii)- delete a node

D

ii)-find deepest node,replace with node to be deleted. iii)- delete the deepest node

A double-ended queue supports operations like adding and removing items from both the sides of the queue. They support four operations like addFront(adding item to top of the queue), addRear(adding item to the bottom of the queue), removeFront(removing item from the top of the queue) and removeRear(removing item from the bottom of the queue). You are given only stacks to implement this data structure. You can implement only push and pop operations. What’s the time complexity of performing addFront and addRear? (Assume ‘m’ to be the size of the stack and ‘n’ to be the number of elements)

A

O(m) and O(n)

B

O(1) and O(n)

C

O(n) and O(1)

D

O(n) and O(m)

A Double-ended queue supports operations such as adding and removing items from both the sides of the queue. They support four operations like addFront(adding item to top of the queue), addRear(adding item to the bottom of the queue), removeFront(removing item from the top of the queue) and removeRear(removing item from the bottom of the queue). You are given only stacks to implement this data structure. You can implement only push and pop operations. What are the total number of stacks required for this operation?(you can reuse the stack)

A

1

B

2

C

3

D

4

Which of the following statements are true/false?
1. A minimum rate of wages for the time spent by employees for the production of output is minimum time rate.
2. Minimum piece rate is the rate based on the quantity of the output employees have produced.
3. The guaranteed time rate is a minimum rate of remuneration to apply in the case of employees employed on piece work for the purpose of securing to such employees a minimum rate of wages on a time work basis.
4. A minimum rate of remuneration to apply in the case of employees employed on piece work for the purpose of securing to such employees a minimum rate of wages on a time work basis is overtime rate.

A

1, 2, 3 and 4 are true

B

1, 3 are true and 2, 4 are false

C

2, 4 are true and 1, 3 are false

D

3, 4 are true and 2, 1 are false

If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.

A

2

B

100

C

17

D

3

Directions : Following question consists of a statement followed by four arguments I, II, III and IV. You have to decide which of the arguments is a STRONG arguments and which is a WEAK Argument.

Statement : Should class IV children have Board examination?

Arguments :
I. Yes. This will motivate the children to study and get higher marks, and thus more knowledge can be imbibed at a younger age.
II. No. The children will be forced to study and won't enjoy the process.
III. Yes. In today's competitive world the children need to be prepared right from the beginning to face such difficult examinations.
IV. No. This will add pressure on tender aged children and leave very little time for them to play.

A

All are strong

B

Only I, II and IV are strong

C

Only II, III and IV are strong

D

Only I and III are strong

E

Only I and IV are strong

Which of the below statements are true? i. Cartesian tree is not a height balanced tree ii. Cartesian tree of a sequence of unique numbers can be unique generated

A

both statements are true

B

only i. is true

C

only ii. is true

D

both are false

A group of 2^m - 1 routers are interconnected in a centralized binary tree, with router at each tree node. Router I communicate with router J by sending a message to the root of the tree. The root then sends the message back down to J. Then find the mean router-router path length.

A

2 (m - 2)

B

2 (2<sup>m</sup> - 1)

C

m - 1

D

(2m - l)/mJ

Given that capacitance w.r.t the input node is 2pF and output node is 4pF, find capacitance between input and output node.

A

0.67 pF

B

1.34pF

C

0.44pF

D

2.2pF

Seven people A, B, C, D, E, F and G live on separate floors of a 7-floor building. Ground floor is numbered 1, first floor is numbered. 2 and so on until the topmost floor is numbered 7. Each one of these having a different cars-Cadillac, Ambassador, Fiat, Maruti, Mercedes, Bedford and Fargo but not necessarily in the same order. Only three people live above the floor on which A lives. Only one person lives between A and the one having a car Cadillac. F lives immediately below the one having a car Bedford. The one having a car Bedford lives on an even-numbered floor. Only three people live between the ones having a car Cadillac and Maruti. E lives immediately above C. E is not having a car Maruti. Only two people live between B and the one having a car Fargo. The one having a car Fargo lives below the floor on which B lives. The one having a car Fiat does not live immediately above D or immediately below B. D does not live immediately above or immediately below A. G does not have a car Ambassador. Question : How many people live between the floors on which D and the one having a car Bedford ?

A

One

B

Two

C

Three

D

Four