Register

Recent questions tagged data-structures

9 votes
3 answers
1141
ISRO2017-69
Choose the equivalent prefix form of the following expression (a+(b-c))*((d-e)/(f+g-h)) *+a-bc/-de-+fgh *+a-bc-/de-+fgh *+a-bc/-ed-+fgh *+ab-c/-de-+fgh
Choose the equivalent prefix form of the following expression(a+(b-c))*((d-e)/(f+g-h))*+a-bc/-de-+fgh*+a-bc-/de-+fgh*+a-bc/-ed-+fgh*+ab-c/-de-+fgh
User Avatar
6 votes
1 answer
1142
ISRO2017-59
The best data structure to check whether an arithmetic expression has balanced parenthesis is a: Queue Stack Tree List
The best data structure to check whether an arithmetic expression has balanced parenthesis is a:QueueStackTreeList
User Avatar
8 votes
3 answers
1143
ISRO2017-50
If the post order traversal gives ab -cd * + then the label of the nodes 1,2,3.. will be + , -, *, a,b,c,d a, -,b,+,c,*,d a,b,c,d,-,*,+ -,a,b,+,*,c,d
If the post order traversal gives ab -cd * + then the label of the nodes 1,2,3.. will be+ , -, *, a,b,c,da, -,b,+,c,*,da,b,c,d,-,*,+-,a,b,+,*,c,d
User Avatar
6 votes
2 answers
1144
ISRO2017-16
Given two statements Insertion of an element should be done at the last node of the circular list Deletion of an element should be done at the last node of the circular list Both are true Both are false First is false and second is true None of the above
Given two statementsInsertion of an element should be done at the last node of the circular listDeletion of an element should be done at the last node of the circular lis...
User Avatar
4 votes
4 answers
1145
ISRO2017-53
In a doubly linked list the number of pointers affected for an insertion operation will be 4 0 1 Depends on the nodes of doubly linked list
In a doubly linked list the number of pointers affected for an insertion operation will be401Depends on the nodes of doubly linked list
User Avatar
0 votes
2 answers
1146
strcpy() code question
strcpy() char* strcpy(char*s,char*t) { *s=malloc(strlen(source)+1); while((*s=*t)!='\o') { s++; t++; } return s; } Please someone tell, that line *s=malloc(strlen(source)+1); will return s;
strcpy() char* strcpy(char*s,char*t) { *s=malloc(strlen(source)+1); while((*s=*t)!='\o') { s++; t++; } return s; }Please someone tell, that line *s=malloc(strlen(source)+...
User Avatar
0 votes
1 answer
1148
Please explain already answered Question
Link to the question - https://gateoverflow.in/20611/tifr2011-b-30 Someone please simplify that question and explain.
Link to the question - https://gateoverflow.in/20611/tifr2011-b-30Someone please simplify that question and explain.
User Avatar
0 votes
1 answer
1151
i want to read Tanenbaum Datastructure book. Can anyone tell me the source of pdf Tanenbaum Datastructure book ?
i want to read Tanenbaum Datastructure book. Can anyone tell me the source of pdf Tanenbaum Datastructure book ?
User Avatar
0 votes
1 answer
1154
coremen
what is difference between avl tree and red black tree?
what is difference between avl tree and red black tree?
User Avatar
0 votes
1 answer
1155
coremen
why do we need preorder, postorder and inorder sequence/graph traversal?
why do we need preorder, postorder and inorder sequence/graph traversal?
User Avatar
3 votes
3 answers
1157
Trees
What is the difference between height and levels for a tree. What will be the value of height and level for root node and why?
What is the difference between height and levels for a tree. What will be the value of height and level for root node and why?
User Avatar
0 votes
2 answers
1158
coal india
which is correct option? does answer depends on the definition of levels?
which is correct option? does answer depends on the definition of levels?
User Avatar
2 votes
0 answers
1160
MadeEasy Subject Test: Programming & DS - Hashing
what is the expected number of probs required when inserting an element into an open address hash table with load factor alpha(a), assume uniform hashing??
what is the expected number of probs required when inserting an element into an open address hash table with load factor alpha(a), assume uniform hashing??
User Avatar
1 votes
0 answers
1162
internal path length of complete binary tree
can someone pls explain how is the internal path length of complete binary tree is O(n logn)? (if it is correct)
can someone pls explain how is the internal path length of complete binary tree is O(n logn)? (if it is correct)
User Avatar
0 votes
0 answers
1163
Stack gate 2005 IT
User Avatar
0 votes
2 answers
1165
ISRO 2011-ECE Stack
In what order the elements of a pushdown stack are accessed? a. First In-First Out (FIFO) b. Last In Last Out (LILO) c. Last In First Out (LIFO) d. None of the above
In what order the elements of a pushdown stack are accessed?a. First In-First Out (FIFO)b. Last In Last Out (LILO)c. Last In First Out (LIFO)d. None of the above
User Avatar
38 votes
7 answers
1168
GATE CSE 2017 Set 1 | Question: 20
Let $T$ be a tree with $10$ vertices. The sum of the degrees of all the vertices in $T$ is ________
Let $T$ be a tree with $10$ vertices. The sum of the degrees of all the vertices in $T$ is ________
User Avatar
33 votes
10 answers
1169
GATE CSE 2017 Set 1 | Question: 6
Let $T$ be a binary search tree with $15$ nodes. The minimum and maximum possible heights of $T$ are: Note: The height of a tree with a single node is $0$. $4$ and $15$ respectively. $3$ and $14$ respectively. $4$ and $14$ respectively. $3$ and $15$ respectively.
Let $T$ be a binary search tree with $15$ nodes. The minimum and maximum possible heights of $T$ are:Note: The height of a tree with a single node is $0$.$4$ and $15$ res...
User Avatar
Page: