Register

Recent questions tagged data-structures

9 votes
1 answer
1381
DS+Permutation
An item that is read as input can either be pushed to the stack and later popped and printed or printed directly. Number of print permutations that can be obtained using stack, if the input sequence is $1, 2, 3, 4, 5$ in that order is __________.
An item that is read as input can either be pushed to the stack and later popped and printed or printed directly. Number of print permutations that can be obtained using ...
User Avatar
2 votes
3 answers
1382
Data Strucutre Test
User Avatar
1 votes
1 answer
1383
#ds / data structure
Deletion at ending 1. Linked list =O(n) 2. Array = O(1) 3. Dynamic array =O(1) Correct? But given is O(n) for dynamic array
Deletion at ending1. Linked list =O(n)2. Array = O(1)3. Dynamic array =O(1)Correct?But given is O(n) for dynamic array
User Avatar
2 votes
1 answer
1384
GATE Overflow | Algorithms | Test 1 | Question: 14
The result of performing an inorder search on the given tree is s y x z v u t y s x z v u t s y v u t z x v u t z x y s
The result of performing an inorder search on the given tree iss y x z v u ty s x z v u ts y v u t z xv u t z x y s
User Avatar
1 votes
1 answer
1385
avl tree
what is the time complexity of creating an avl tree??????
what is the time complexity of creating an avl tree??????
User Avatar
1 votes
1 answer
1389
UGC NET CSE | August 2016 | Part 3 | Question: 32
Consider a hash table of size $m = 10000$, and the hash function $h(K) = floor (m(KA \bmod 1))$ for $A = ( \sqrt{5} – 1)/2$. The key $123456$ is mapped to location ______. $46$ $41$ $43$ $48$
Consider a hash table of size $m = 10000$, and the hash function $h(K) = floor (m(KA \bmod 1))$ for $A = ( \sqrt{5} – 1)/2$. The key $123456$ is mapped to location ____...
User Avatar
2 votes
2 answers
1390
Infix to postfix
Convert the infix to postfix and prefix expression 1) log3! ^log4 *log log 6/7*4! 2)log3!^sin 2*cos 3
Convert the infix to postfix and prefix expression1) log3! ^log4 *log log 6/7*4!2)log3!^sin 2*cos 3
User Avatar
1 votes
1 answer
1391
Hashing
using Method : Fold shift , we can find key then what use of Fold shift in Hashing
using Method : Fold shift , we can find keythen what use of Fold shift in Hashing
User Avatar
3 votes
2 answers
1392
linked list
Two linked lists having n and m elements are stored in sorted order. What is the worst case complexity of program to print common elements of two lists ? $\begin{align*} &A. \ \ O(n) \\ &B. \ \ \text{max}(m,n) \\ &C. \ \ \text{min}(m,n) \\ &D. \ \ m+n \end{align*}$
Two linked lists having n and m elements are stored in sorted order. What is the worst case complexity of program to print common elements of two lists ?$\begin{align*} &...
User Avatar
0 votes
2 answers
1393
UGC NET CSE | August 2016 | Part 2 | Question: 25
Given the following prefix expression : $^{*} + 3 + 3 ↑ 3 + 3 3 3$ What is the value of the prefix expression ? $2178$ $2199$ $2205$ $2232$
Given the following prefix expression :$^{*} + 3 + 3 ↑ 3 + 3 3 3$What is the value of the prefix expression ?$2178$ $2199$$2205$ $2232$
User Avatar
0 votes
1 answer
1395
UGC NET CSE | August 2016 | Part 2 | Question: 23
The runtime for traversing all the nodes of a binary search tree with $n$ nodes and printing them in an order is $O(\lg n)$ $O(n \lg n)$ $O(n)$ $O(n^{2})$
The runtime for traversing all the nodes of a binary search tree with $n$ nodes and printing them in an order is$O(\lg n)$$O(n \lg n)$ $O(n)$$O(n^{2})$
User Avatar
0 votes
1 answer
1398
Linked Lists
Q)The below code returns decimal value of binary linked list int val(struct Node *head) { struct Node *p = head; int val2= 0; while (p!= NULL) { XYZ;//fill the contents of XYZ p = p→next; } return val2; } What is XYZ in above code ? Please provide a sound explaination too.
Q)The below code returns decimal value of binary linked list int val(struct Node *head) { struct Node *p = head; int val2= 0; while (p!= NULL) { XYZ;//fill the contents o...
User Avatar
1 votes
0 answers
1399
no of balanced paraenthesis
The no of different balanced parenthesizes possible with n pairs of parenthesis? A. B. C. (2n)! D. n! please explain the answer.
The no of different balanced parenthesizes possible with n pairs of parenthesis?A. B. C. (2n)!D. n!please explain the answer.
User Avatar
1 votes
2 answers
1400
UGC NET CSE | June 2010 | Part 2 | Question: 32
Which of the following expression is represented by the parse tree ? $(A + B) ^{*} C$ $A + ^{*} BC$ $A + B * C$ $A * C + B$
Which of the following expression is represented by the parse tree ?$(A + B) ^{*} C$$A + ^{*} BC$$A + B * C$$A * C + B$
User Avatar
1 votes
2 answers
1401
UGC NET CSE | June 2010 | Part 2 | Question: 25
In a $B$ tree of order $5$, the following keys are inserted as follows : $7, 8, 1, 4, 13, 20, 2, 6$ and $5$ How many elements are present in the root of the tree ? $1$ $2$ $3$ $4$
In a $B$ tree of order $5$, the following keys are inserted as follows : $7, 8, 1, 4, 13, 20, 2, 6$ and $5$ How many elements are present in the root of the tree ?$1$ $2$...
User Avatar
0 votes
3 answers
1402
UGC NET CSE | June 2010 | Part 2 | Question: 24
A chained hash table has an array size of $100$. What is the maximum number of entries that can be placed in the table ? $100$ $200$ $10000$ There is no upper limit
A chained hash table has an array size of $100$. What is the maximum number of entries that can be placed in the table ?$100$$200$$10000$There is no upper limit
User Avatar
2 votes
1 answer
1403
UGC NET CSE | June 2010 | Part 2 | Question: 23
In a complete binary tree of n nodes, how far are the two most distant nodes ? Assume each edge in the path counts as ! About $\log_{2} n$ About $2 \log_{2} n$ About $n \log_{2} n$ About $2n$
In a complete binary tree of n nodes, how far are the two most distant nodes ? Assume each edge in the path counts as !About $\log_{2} n$About $2 \log_{2} n$About $n \log...
User Avatar
0 votes
2 answers
1404
UGC NET CSE | June 2010 | Part 2 | Question: 22
What is the most appropriate data structure to implement a priority queue ? Heap Circular array Linked list Binary tree
What is the most appropriate data structure to implement a priority queue ?HeapCircular arrayLinked listBinary tree
User Avatar
1 votes
2 answers
1406
Algorithm_heap
The number of ways in which the numbers 1, 2, 3, 4, 5 can be inserted into a Binary Heap such that resulted binary heap is Max Heap. Please give the ans and what is the formula for n distinct elements?
The number of ways in which the numbers 1, 2, 3, 4, 5 can be inserted intoa Binary Heap such that resulted binary heap is Max Heap.Please give the ans and what is the fo...
User Avatar
0 votes
4 answers
1407
UGC NET CSE | December 2010 | Part 2 | Question: 24
Linear probing suffers from a problem known as Secondary clustering Primary clustering Both (A) and (B) None of these
Linear probing suffers from a problem known asSecondary clusteringPrimary clusteringBoth (A) and (B)None of these
User Avatar
0 votes
1 answer
1408
This question is from CLRS (12.1-3).
What is the difference between the binary-search-tree property and the min-heap property? Can the min-heap property be used to print out the keys of an n-node tree in sorted order in O(n) time?
What is the difference between the binary-search-tree property and the min-heap property? Can the min-heap property be used to print out the keys of an n-node tree in sor...
User Avatar
8 votes
3 answers
1409
7th smallest element in a Min-Heap
In a min-heap with n elements 1). The 7th smallest element can be found in time, if duplicates are allowed ? 2). The 7th distinct smallest element can be found in time, If duplicates are allowed ?
In a min-heap with n elements1). The 7th smallest element can be found in time, if duplicates are allowed ?2). The 7th distinct smallest element can be found in time, I...
User Avatar
0 votes
2 answers
1410
build heap
how to merge two binary max heaps ? size of first heap is m+n and size of second heap is n and also find the complexity.
how to merge two binary max heaps ?size of first heap is m+n and size of second heap is nand also find the complexity.
User Avatar
Page: