Register
Filter

Answers by _nirbha_

2 votes
1
Exam queries
Is it necessary to solve question which is in standard book :- ie(exercise question) Or only pyqs solving is sufficient??
Is it necessary to solve question which is in standard book :- ie(exercise question) Or only pyqs solving is sufficient??
2 votes
4
Gate-Applied-test
Which of the following arrays do not represent a min heap. A. 1, 2, 4, 8, 12, 6, 7, 10, 11 7, 10, 12, 11, 17, 19, 2 25, 27, 28, 30, 32, 34, 27 90, 95, 100, 110, 120, 130, 99
Which of the following arrays do not represent a min heap. A. 1, 2, 4, 8, 12, 6, 7, 10, 11 7, 10, 12, 11, 17, 19, 2 25, 27, 28, 30, 32, 34, 27 90, 95, 100, 11...
1 votes
11
NPTEL Assignment Question
An undirected graph G has 300 edges. The degree of a vertex v, deg(v), is the number of edges connected to v. Suppose V = {v1,v2,...,v30}. What is the value of deg(v1)+ deg(v2) + · · · + deg(v30)? 300 600 900 None of these
An undirected graph G has 300 edges. The degree of a vertex v, deg(v), is the number of edges connected to v. Suppose V = {v1,v2,...,v30}.What is the value of deg(v1)+ de...
2 votes
12
NPTEL Assignment Question
A regular expression for accepting strings with exactly one $1$ more than $0$’s is $0^{\ast}1$ $(0|1)^{\ast}1(0|1)^{\ast}$ $(0|1)^{\ast}1(0|1)^{\ast}|1(0|1)^{\ast}$ Not possible
A regular expression for accepting strings with exactly one $1$ more than $0$’s is$0^{\ast}1$$(0|1)^{\ast}1(0|1)^{\ast}$$(0|1)^{\ast}1(0|1)^{\ast}|1(0|1)^{\ast}$Not pos...
0 votes
13
#made easy workbook questions
Q.which of the following data structure cannot be used for efficient implementation of Huffman encoding? a. Binary min heap b. Binary max heap c. AVL tree (height balanced bst)
Q.which of the following data structure cannot be used for efficient implementation of Huffman encoding? a. Binary min heapb. Binary max heapc. AVL tree (height balanced ...