Recent questions tagged go-ds-1

4 votes
1 answer
1
2 votes
2 answers
3
What would be an appropraite data structure to represent family hierarchy where each node is an individual and there in no requirement to keep "married to" relationship?B...
0 votes
3 answers
4
Consider a complete graph of 10 vertices. The minimum no. of edge removals required to make the graph disconnected is ______
0 votes
2 answers
8
0 votes
2 answers
10
A vertex having no incident edge is called -pendent vertex end vertexisolated vertex none of these
2 votes
3 answers
11
Consider a complete graph on 10 vertices. Minimum no. of edge removals required to make a tree out of it will be ____
3 votes
1 answer
13
0 votes
1 answer
16
0 votes
1 answer
17
Consider the array given below:20 10 9 8 7 6 5It isa full binary tree in array representationa complete binary tree in array representationa max-heap in array representat...
1 votes
1 answer
19
What is the content of the array after two delete operations on the binary heap 10 5 8 4 3?5 4 35 3 410 5 88 4 3
1 votes
1 answer
20
Which one of the following array represents a binary max-heap?20 13 4 11 3 12 220 13 4 12 11 3 220 13 4 3 2 12 1120 13 4 12 3 11 2
1 votes
2 answers
21
0 votes
2 answers
23
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$ in that order?3, 4...
3 votes
4 answers
24
What is the number of binary trees with $4$ nodes which when traversed in pre-order gives the sequence A, B, C, D?
2 votes
3 answers
25
A $2-3$ tree is a tree such thatall internal nodes have either 2 or 3 childrenall paths from root to the leaves have the same length.The maximum number of nodes of a 2-3 ...
0 votes
1 answer
28
The postfix expression for the infix expression$$A + B*C/D +E$$isAB+*CD/E+ABC*D/+E+AB+C*D/E+A+*BCD/E+
4 votes
2 answers
29
To see more, click for the full list of questions or popular tags.