Register

Recent questions tagged data-structures

2 votes
1 answer
1501
ISRO2008-71
The time required to search an element in a linked list of length n is $O(\log_2 n)$ $O(n)$ $O(1)$ $O(n^2)$
The time required to search an element in a linked list of length n is$O(\log_2 n)$$O(n)$$O(1)$$O(n^2)$
User Avatar
1 votes
1 answer
1503
UGC NET CSE | September 2013 | Part 2 | Question: 11
The min. number of nodes in a binary tree of depth d (root at level 0) is $(2^d + 1)$ $(2^{(d+1)} - 1)$ $d$ $d + 1$
The min. number of nodes in a binary tree of depth d (root at level 0) is$(2^d + 1)$$(2^{(d+1)} - 1)$$d$$d + 1$
User Avatar
0 votes
2 answers
1507
Post order traversal
Post order traversal of a BST is 35,50,55,60,50,100.then what can you say about the tree? (A) Min heap (B) Max heap (C) Strict binary tree (D) None of these
Post order traversal of a BST is 35,50,55,60,50,100.then what can you say about the tree?(A) Min heap(B) Max heap(C) Strict binary tree(D) None of these
User Avatar
1 votes
1 answer
1510
Difference between Abstract data type and Data structure ?
are stack and queue abstract datatype ? then why are they mentioned as linear "data structures".
are stack and queue abstract datatype ? then why are they mentioned as linear "data structures".
User Avatar
1 votes
2 answers
1513
tree data-structure
Which of the following data structures will be the most efficient for inserting a number into a sorted list of numbers? Queue Stack Linked list Array
Which of the following data structures will be the most efficient for inserting a number into a sorted list of numbers?QueueStackLinked listArray
User Avatar
0 votes
1 answer
1514
Algo
Consider an array size of 10 and insertion of 10 element in it.If first five element are inserted at loc =0 and rest five element are at loc=2 then the total number of shifting of elements is: 35 20 45 0
Consider an array size of 10 and insertion of 10 element in it.If first five element are inserted at loc =0 and rest five element are at loc=2then the total number of shi...
User Avatar
0 votes
1 answer
1515
Algo
Which of the following data structure will be most efficient for inserting a number into a sorted list of numbers ? Stack Queue Linked List Array
Which of the following data structure will be most efficient for inserting a number into a sorted list of numbers ?StackQueueLinked ListArray
User Avatar
0 votes
1 answer
1517
introduction to algorithm 6.2.3 exercise question
$6.2-3$ What is the effect of calling MAX-HEAPIFY(A,i) when the element A[i] is larger that its children?
$6.2-3$What is the effect of calling MAX-HEAPIFY(A,i) when the element A[i] is larger that its children?
User Avatar
0 votes
1 answer
1518
data structure
User Avatar
1 votes
1 answer
1519
Facts about AVL tree
Which of the following is false? A. Maximum height of an AVL tree of n nodes is 1.44 log2n ​B. Insertion of an element into an AVL tree requires at most a double rotation C. Deletion of an element may require O(log n) rotation D. None of these
Which of the following is false?A. Maximum height of an AVL tree of n nodes is 1.44 log2n​B. Insertion of an element into an AVL tree requires at most a double rot...
User Avatar
10 votes
2 answers
1520
ISRO-2013-2
The number of rotations required to insert a sequence of elements $9, 6, 5, 8, 7, 10$ into an empty $AVL$ tree is? $0$ $1$ $2$ $3$
The number of rotations required to insert a sequence of elements $9, 6, 5, 8, 7, 10$ into an empty $AVL$ tree is?$0$$1$$2$$3$
User Avatar
1 votes
4 answers
1523
AVL Tree insertion
The tree given is as follows: 40 / \ 35 53 / \ 20 60 How many rotations are required for insertion of elements 30,55,45,65,42 in above tree. (A) 2 (B) 3 (C) 4 (D) None of these
The tree given is as follows: 40 / \ 35 53 / \ 20 60 How many rotations are required for insertion of elements 30,55,45,6...
User Avatar
73 votes
10 answers
1524
GATE CSE 2010 | Question: 53
A hash table of length $10$ uses open addressing with hash function $h(k) = k \: \mod \: 10$, and linear probing. After inserting $6$ ... of the key values using the same hash function and linear probing will result in the hash table shown above? $10$ $20$ $30$ $40$
A hash table of length $10$ uses open addressing with hash function $h(k) = k \: \mod \: 10$, and linear probing. After inserting $6$ values into an empty hash table, the...
User Avatar
31 votes
2 answers
1526
GATE CSE 1991 | Question: 14,c
Consider the binary tree in the figure below: Outline a procedure in Pseudo-code to delete an arbitrary node from such a binary tree with $n$ nodes that preserves the structures. What is the worst-case time complexity of your procedure?
Consider the binary tree in the figure below:Outline a procedure in Pseudo-code to delete an arbitrary node from such a binary tree with $n$ nodes that preserves the stru...
User Avatar
20 votes
3 answers
1527
GATE CSE 1991 | Question: 14,b
Consider the binary tree in the figure below: Give different steps for deleting the node with key $5$ so that the structure is preserved.
Consider the binary tree in the figure below:Give different steps for deleting the node with key $5$ so that the structure is preserved.
User Avatar
0 votes
3 answers
1528
#DS Which Data structure is more suitable
Consider a situation where a client receives packets from a server. There may be differences in speed of the client and the server. Which data structure is best suited for synchronization? (A) Circular Linked List (B) Queue (C) Stack (D) Priority Queue
Consider a situation where a client receives packets from a server. There may be differences in speed of the client and the server. Which data structure is best suited fo...
User Avatar
0 votes
1 answer
1530
sparse matrix
How many real links are required to store a sparse matrix of 10 rows , 10 columns ,and 15 non zeros entries.(pick up the closest answer)
How many real links are required to store a sparse matrix of 10 rows , 10 columns ,and 15 non zeros entries.(pick up the closest answer)
User Avatar
Page: