Register
Filter

Answers by One

23 votes
1
GATE CSE 1991 | Question: 13
Give an optimal algorithm in pseudo-code for sorting a sequence of $n$ numbers which has only $k$ distinct numbers ($k$ is not known a Priori). Give a brief analysis for the time-complexity of your algorithm.
Give an optimal algorithm in pseudo-code for sorting a sequence of $n$ numbers which has only $k$ distinct numbers ($k$ is not known a Priori). Give a brief analysis for ...
1 votes
2
graph
Assume undirected graph G is connected . G has 6 vertices and 10 edges. Find the minimum number of edges whose deletion from graph G is always guaranteee that it will become disconnected
Assume undirected graph G is connected . G has 6 vertices and 10 edges. Find the minimum number of edges whose deletion from graph G is always guaranteee that it will bec...
2 votes
3
Gate Discrete Maths
Consider the lattice D30 a)Draw the Hasse Diagram of D30. b) Is D30 complemented? c) Is D30 distributive?
Consider the lattice D30a)Draw the Hasse Diagram of D30.b) Is D30 complemented?c) Is D30 distributive?
0 votes
4
B+tree
0 votes
6
B+ tree
0 votes
7
If the order of a B-Tree is 20 , then the number of levels needed to store 15 , 998 keys are?
If the order of a B-Tree is $20$, then the number of levels needed to store $15,998$ keys are ______.
6 votes
8
GATE CSE 1998 | Question: 2.11
A complete $n$-ary tree is one in which every node has $0$ or $n$ sons. If $x$ is the number of internal nodes of a complete $n$-ary tree, the number of leaves in it is given by $x(n-1) +1$ $xn-1$ $xn +1$ $x(n+1)$
A complete $n$-ary tree is one in which every node has $0$ or $n$ sons. If $x$ is the number of internal nodes of a complete $n$-ary tree, the number of leaves in it is g...
2 votes
9
Ace Test Series: Algorithms - Graph Algorithms
Answer is given as (B). But, shouldn't it relax point 'c' via 'a' .. So, i guess answer should be D. Is it?
Answer is given as (B). But, shouldn't it relax point 'c' via 'a' .. So, i guess answer should be D. Is it?
0 votes
10
Question on bipartite graph
The two distinct sets of vertices, which make the graph bipartite are: (A) (v1, v4, v6); (v2, v3, v5, v7, v8) (B) (v1, v7, v8); (v2, v3, v5, v6) (C) (v1, v4, v6, v7); (v2, v3, v5, v8) (D) (v1, v4, v6, v7, v8); (v2, v3, v5)
The two distinct sets of vertices, which make the graph bipartite are:(A) (v1, v4, v6); (v2, v3, v5, v7, v8) (B) (v1, v7, v8); (v2, v3, v5, v6)(C) (v1, v4, v6, v7);...
17 votes
11
GATE CSE 2013 | Question: 19
What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices? $\theta(n^2)$ $\theta(n^2\log n)$ $\theta(n^3)$ $\theta(n^3\log n)$
What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices?$\theta(n^2)$ $\theta(n^2\log n)$ $\theta(n^3)...
0 votes
14
NIELIT 2016 MAR Scientist C - Section C: 13
Context-free grammar can be recognized by finite state automation $2$- way linear bounded automata push down automata both (B) and (C)
Context-free grammar can be recognized by finite state automation$2$- way linear bounded automatapush down automataboth (B) and (C)
0 votes
16
#Set Associative Memory #computer architecture
Q. A set-associative cache consist of 60 lines,or blocks,divided into four-line sets. Main memory consist of 2K blocks of 512 works each. In the format of main memory addresses, what is the size of tag , set and word is?
Q. A set-associative cache consist of 60 lines,or blocks,divided into four-line sets. Main memory consist of 2K blocks of 512 works each. In the format of main memory add...
0 votes
17
Binary Tree
What is the difference between Binary Tree and Almost complete Binary tree and complete Binary Tree and full Binary Tree and Binary search Tree and Balanaced Binary Search Tree. Diagram would be appriciated otherwaise write 2-3 basic difference .
What is the difference betweenBinary Tree and Almost complete Binary tree and complete Binary Tree and full Binary Tree and Binary search Tree and Balanaced Binary Search...
1 votes
19
time complexity of for loops
For(I=1 ; I<=n ; I++) { For(J=1 ; J<=I ; J++) { For(K=1 ; K<=n^5 ; K=15 × K) { x=y+z; } } } What is the time complexity of above code ?
For(I=1 ; I<=n ; I++) { For(J=1 ; J<=I ; J++) { For(K=1 ; K<=n^5 ; K=15 × K) { x=y+z; } } }What is the time complexity of above code ?
1 votes
20
DFA
How many number of DFA's are possible with 2 states X and Y for input alphabet {0,1}?
How many number of DFA's are possible with 2 states X and Y for input alphabet {0,1}?
0 votes
23
Logic
Which of the following are true? ∃x(P(x)->Q(x)) ->(∀xP(x)->∀xQ(x)) ∃xP(x)->∀x Q(x) ->∀x(P(x)->Q(x))
Which of the following are true?∃x(P(x)->Q(x)) ->(∀xP(x)->∀xQ(x))∃xP(x)->∀x Q(x) ->∀x(P(x)->Q(x))
1 votes
24
L1 intersection L2
How to calculate L1 intersection L2 where $\left \{ a^{m}b^{m}c^{n} | where. m,n>=1 \right \}$ and $\left \{ a^{n}b^{m}c^{m} | where\ m,n>=1 \right \}$ explain ?
How to calculate L1 intersection L2 where $\left \{ a^{m}b^{m}c^{n} | where. m,n>=1 \right \}$ and $\left \{ a^{n}b^{m}c^{m} | where\ m,n>=1 \right \}$explain ?
1 votes
25
To make a DFA
make a DFA having alphabet set {0,1} means that accept binary strings that start with ' 10 ' and congruent to ' 2 mod 3 '.
make a DFA having alphabet set {0,1} means that accept binary strings that start with ' 10 ' and congruent to ' 2 mod 3 '.
0 votes
27
Which of the following is a valid word of the language?
Which of the following is a valid word of the language (1*(01*01*)*) U (0*(10*10*)*) ? 10110010101 1010101010 000101010000 001010001010
Which of the following is a valid word of the language (1*(01*01*)*) U (0*(10*10*)*) ?101100101011010101010000101010000001010001010
0 votes
30
How many different truth table of compound propositions
How many different truth tables of compound propositions are there that involve the propositional variables p and q ?
How many different truth tables of compound propositions are there that involve the propositional variables p and q ?