QuizSagar
4 years ago Like 232906
Questions 823
Contests 7
A priority queue Q is used to implement a stack S that stores characters. PUSH(C) is implemented as INSERT(Q, C, K) where K is an appropriate integer key chosen by the implementation. POP is implemented as DELETEMIN(Q). For a sequence of operations, the k
- Non-increasing order
- Non-decreasing order
- Strictly increasing order
- Strictly decreasing order
- option4
Clear All
Given,implementing a STACK using Priority Queue.Stack follow LIFO order.
As given “POP is implemented as DELETEMIN(Q)” that means Stack returns minimum element always.
So, we need to implement PUSH(C) using INSERT(Q, C, K) where K is key chosen from stri
Loading...
The following sequence of operations is performed on stack: PUSH(10),PUSH(20),POP,PUSH(10), PUSH(20),POP,POP,POP,PUSH (20),POP The sequence of the value popped out is:
- 20 10 20 10 20
- 20 20 10 10 20
- 10 20 20 10 20
- 20 20 10 20 10
- option2
Clear All
1. Push 10,20 then pop() means 20 will be pop. After it 10 is only in the stack.
Loading...
In an undirected connected planar graph G, there are eight vertices and five faces. The number of edges in G is
- 10
- 11
- 12
- 6
- option2
Clear All
By using Euler’s theorem, the number of regions(R) = edges(e) – vertices(v) + 2
R = e – v + 2
5 = e – 8 + 2 = e-6
e = 5+6 = 11
Loading...
Let p, q, r denote the statement "it is raining". "It is cold", and "It is pleasant", respectively. Then the statement "It is not raining and it is pleasant, and it is not pleasant only if it is raining and it is cold" is represented by:
- (¬p ^ r) ^ (¬r → (p ^ q))
- (¬p ^ r) ^ ((p ^ q) →¬r)
- (¬p ^ r) ∨ ((p ^ q) →¬r )
- (¬p ^ r) ∨ (¬r → (p ^ q))
- option1
Clear All
Loading...
Which of the following is not a bipartite graph?
- A simple graph with 10 vertices and 24 edges
- A simple graph with 9 vertices and 19 edges
- A simple graph with 12 vertices and 37 edges
- A simple graph with 12 vertices and 36 edges
- option3
Clear All
Maximum number of edges possible in a bipartite graph.= |n²÷4| with n vertices
:. A simple graph with 12 vertices can have atmost 36 edges
Hence, option (C) is correct
Loading...
Which of the following is not a bipartite graph ?
- A simple graph with 10 vertices and 26 edges
- A simple graph with 9 vertices and 19 edges
- A simple graph with 13 vertices and 37 edges
- A simple graph with 12 vertices and 36 edges
- option1
Clear All
Maximum number of edges possible in a bipartite graph.= |n²÷4| with n vertices
:. A simple graph with 10 vertices can have atmost 25 edges
Hence, option (C) is correct
Loading...
Which of the following statement is correct? S1: In simple connected undirected graph no two vertices are of same degree. S₂: In 3 regular graph with n vertices, the maximum vertex connectivity of a graph is 3
- Only S1
- Only S2
- Both S₁ and S₂
- None of the above
- option2
Clear All
According to Handshaking lemma, in simple connected undirected graph atleast two vertices are of same degree. So, statement S1 is false.
In 3 regular graph with n vertices, minimum degree is 3 and we know that
Vertex connectivity should be ≤ minimum deg
Loading...
Which of the following statement is correct? S1: Cycle graph with n vertices has n - 1 spanning tree with n > 2. S₂: k-regular graph with total n vertices contain nk/2 edges
- Only S1
- Only S2
- Both S₁ and S₂
- None of the above
- option2
Clear All
S1: Cycle graph with n vertices contain n spanning tree.
S₂: k-regular graph with n vertices contain nk/2 edges.
i.e., 2e = nk
e = nk/2
So, true.
Loading...
The number of sub-graphs are possible for graph K4(4-Complete graph) is
- 111
- 112
- 113
- 114
- option2
Clear All
Loading...
The number of sub-graphs are possible for graph K3(3-Complete graph) is
- 17
- 28
- 18
- 27
- option1
Clear All
Sub_graph possible with 3 vertices=3C3 * 2^((3*2)/2) =8
Sub_graph possible with 3 vertices=3C2 * 2^((2*1)/2) =6
Sub_graph possible with 3 vertices=3C1 * 2^((1*0)/2) =3
Total sub-graph=8+6+3=17
Loading...