Register
Filter

Answers by Kapil

3 votes
84
Decidability and reducibility
Consider the language given below $L=\left \{ \left \langle M \right \rangle |M\ is\ TM \ and \ |L(M)|\ is\ prime\right \}$ is it deciable or not ? Explain with fact ?
Consider the language given below$L=\left \{ \left \langle M \right \rangle |M\ is\ TM \ and \ |L(M)|\ is\ prime\right \}$ is it deciable or not ? Explain with fact ?
6 votes
85
SlowStart
I am getting 25..but ans given 20...please chk once
I am getting 25..but ans given 20...please chk once
2 votes
87
GATE Overflow | Programming | Test 1 | Question: 15
Which of the following statements produce a compile time error in C? int a = sizeof 3; *(1000) = 5; int a = 5; ((int)a)++; int b = 5, *a = &b; ((int*)a)++; 1, 2 and 3 2 only 2, 3 and 4 All 4
Which of the following statements produce a compile time error in C?int a = sizeof 3;*(1000) = 5;int a = 5; ((int)a)++;int b = 5, *a = &b; ((int*)a)++;1, 2 and 32 only2, ...
3 votes
89
self_doubt
when we do double "signal(S)" operation on a Binary semaphore'S' provided initial value of S=0, will the value of 'S' be 2 or it remains 1?
when we do double "signal(S)" operation on a Binary semaphore'S' provided initial value of S=0, will the value of 'S' be 2 or it remains 1?
6 votes
90
Context free language
Is the language $L=\left \{ (0^{n}1^{n})^{*} |n\geq 0 \right \}$ is DCFL ?
Is the language $L=\left \{ (0^{n}1^{n})^{*} |n\geq 0 \right \}$ is DCFL ?
6 votes
92
TCP-Congestion Control
9 votes
93
Pipeline Efficiency
Will it be 6 or 7?
Will it be 6 or 7?
6 votes
94
Basic doubt in B+ Tree Indexing
Q : One basic doubt that is coming to my mind is whether number of splits in the process of insertion in B+ Tree indexing going to change if we consider left biasing and right biasing approach.Plz present any example to show if possible..
Q : One basic doubt that is coming to my mind is whether number of splits in the process of insertion in B+ Tree indexing going to change if we consider left biasing and ...
9 votes
96
Operating System
Difference between with clear example Hadrware Interrupt, External Interrupt Software Interrupt, Internal Interrupt
Difference between with clear exampleHadrware Interrupt, External InterruptSoftware Interrupt, Internal Interrupt
3 votes
101
GATE Overflow | Data Structures | Test 1 | Question: 10
With 5 distinct nodes, the maximum no. of binary trees that can be formed is _____
With 5 distinct nodes, the maximum no. of binary trees that can be formed is _____
2 votes
103
GATE Overflow | Data Structures | Test 1 | Question: 21
A vertex having no incident edge is called --------- pendent vertex end vertex isolated vertex none of these
A vertex having no incident edge is called -pendent vertex end vertexisolated vertex none of these
5 votes
105
GATE Overflow | Data Structures | Test 1 | Question: 20
Consider a complete graph on 10 vertices. Minimum no. of edge removals required to make a tree out of it will be ____
Consider a complete graph on 10 vertices. Minimum no. of edge removals required to make a tree out of it will be ____
7 votes
107
GATE Overflow | Data Structures | Test 1 | Question: 27
Consider a complete graph of 10 vertices. The minimum no. of edge removals required to make the graph disconnected is ______
Consider a complete graph of 10 vertices. The minimum no. of edge removals required to make the graph disconnected is ______
6 votes
109
GATE Overflow | Algorithms | Test 1 | Question: 19
Is an array that is sorted in decreasing order a max-heap? always yes always no sometimes only yes but not in presence of duplicates
Is an array that is sorted in decreasing order a max-heap?always yesalways nosometimes onlyyes but not in presence of duplicates
Page: