Which if the following operation is the easiest in terms of time as a resource

An array is not full, The time complexity of Insertion in an array at a specific position is

Bill has an algorithm, find2D, to find an element x in an nXn array A. The algorithm find2D iterates over the rows of A & calls the algorithm arrayFind on each row, until x is found or it has reached all rows of A. What is the worst case running time of find2D in terms of n?

The sum of the smallest sqrt(n) elements in an unsorted array of n distinct numbers can be found in O(n) time

Which of the following is true about arrays

While inserting a new array, if the array is full, then we need to extend the array by some size, what is the best policy to be exercised in such a case

We have two arrays of size m and n. What will be the time complexity to merge two arrays

To find an element x in an nXn array A, until x is found or it has reached all rows of A. What is the worst case running time in terms of n

An array of size 100 is given and the memory addressing is byte by byte. If The base address of the array is 1000 and every record consists of 40 bytes then address of array[10] will be

We interchange values of variables m and n, using replacement notation by t= m, m= n, n= t. So we use three assignments. If we want to rearrange (a,b,c,d) to (b,c,d,a) by a sequence of replacements. The new value of a is to be the original value of b & so on. How many assignments are required

In a circular linked list organization, insertion of a record involves modification of

Match the following in the given sequence

The basic operation which takes most of the time in link list operations is

Backward movement is not possible in

Which of the following is false?

Time complexity to access an element in a link list is

The Time Complexity for Intersection of two arrays, Union of two arrays, Intersection of two link lists, Union of two link lists in respectively

Stack does not have one of the following methods

Which of the following permutation can be obtained in the output (in the same order) using a stack assuming that the input is the sequence 1, 2, 3, 4, 5 in that order

What will be the result of the LAST operation in the given sequence of operations: PUSH($); PUSH($); PUSH(@);TOP(); POP(); PUSH(#); POP();POP(); PUSH(%); POP();

1,2,3,4,5 is pushed in an empty stack in the given order, then four times pop operation is done. After each pop operation element is enqued in an empty queue. Then two deque operations are done and after each dequeue elements are pushed in the stack. Topofstack() will return

Train numbers X12, Y23, Z34, A45, B56 enter in the given sequence in a rail yard Q which is closed at one end, two of the trains are serviced and go for their trip to another city M and stay in the yard S over there. Two more trains from yard Q leave to city N and stay in the yard T. One train C67 comes from the city F and enters the yard Q. At this stage which is the first train which will come out first from the yard Q

A stack S is initially empty. Find out which of the given axioms is equal to the axiom TOP(POP(PUSH(PUSH(S,12),15)))

Which of the following are application of stacks

For the following axioms
a) pop(push(S,v))=S
b)Top(push(S,v))=v

Time complexity of Push() and pop() operations is

Deque(Enque(Enque(Q,w),v))=Enque(Deque(Enque(Q,w)),v)

Replace ? with a proper option
Front(Enqueue(New(),v))=?

Which of the following permutation can be obtained in the output (in the same order) using a queue assuming that the input is the sequence 1, 2, 3, 4, 5 in that order?

Queue has one of the following methods

What will be the result of last result of given priority queue if number 1 is the highest priority Enqueue(3), enqueue(6), enqueue(2),dequeue, dequeue, enqueue(5),enqueue(1),dequeue, dequeue

Which of the following is true about the following axioms
a) Front(Enqueue(Enqueue(Q,w),v))=front(Enqueue(Q,w))
b) Deque(Enque(Enque(Q,w),v))=Enque(Deque(Enque(Q,w)),v)

Which of the following is not the application of queues

If we use the selection sort for the priority queue then the priority queue property is maintained at

In case of heap sort Priority Queue addition and removal will take the following complexity

Convert (A-B)*(D/E) into a postfix expression

What is true about the above tree

What is not true about the above tree

What is true about the given tree

In relation to the given figure what is true

What is the successor of 7 in the given binary tree

What is the successor of 10 in the given binary tree

What is the predecesor of 8 in the given binary tree

If we have to insert 12 then it will be inserted at

If we have to delete 6

Insertion in a binary search tree is commutative. That is, inserting x and then y into a binary search tree leaves the same tree as inserting y and then x.

Suppose that we have numbers between 1 and 1000 in a binary search tree, and we want to search for the number 363. Which of the following sequences could not be the sequences of nodes examined.

Internal Node is best described by

A binary search tree is generated by inserting in order the following integers:
50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60, 24
The number of nodes in the left sub-tree and right sub-tree of the root is respectively is

Which of the following statements is false?

In Preorder traversal

The maximum number of nodes in a binary tree of level k, k ≥ 1 is

A binary tree T has n leaf nodes. The number of nodes of degree 2 in T is

If we are given two out of the a)preorder traversal
b) postorder traversal
c) inorder traversal
then the binary search tree cannot be constructed when

If n is the total number of nodes in a complete binary tree, e and i are number of external nodes and internal nodes respectively then which of the following expressions are true

If an in-place sorting algorithm is given a sorted array, it will always output an unchanged array in the same sequence