Dark Mode

Answers by akash.dinkar12

5 votes

151

The intersection of a context free language and a regular language
The intersection of a context free language and a regular language a)need not be regular b)need not be context free c) is always regular d) is always context free

answered in Theory of Computation Apr 16, 2017

12.2k views

0 votes

152

Is this decidable or undecidable
A = { (M, w) | M is a TM that on input w, tries to move its head past the left end of the input } B = { (M, w) | M is a TM that on input w, moves its head left at least once, at some point} how to decide that a problem is decidable or undecidable , recognisable or unrecognisable ??

answered in Theory of Computation Apr 16, 2017

1.9k views

1 vote

153

related to input output of c programming
4. Which of the following is not a valid variable name declaration and why? a) float PI = 3.14; b) double PI = 3.14; c) int PI = 3.14; d) #define PI 3.14

answered in Programming in C Apr 16, 2017

5.9k views

1 vote

154

answered in Theory of Computation Apr 16, 2017

289 views

4 votes

155

Let P,Q,R be 3 languages
Let P,Q,R be 3 languages. If P and R are regular and if PQ=R, then a)Q has to be regular b)Q can not be regular c)Q need not be regular d)Q has to be CFL

answered in Theory of Computation Apr 15, 2017

4.1k views

0 votes

156

A list of elements are given A - <3,1,4,1,5,9,2,6,5,3,5,8,9 >
A list of elements are given A - <3,1,4,1,5,9,2,6,5,3,5,8,9 > Show Howw the "Pivot" and quick sort algorithm work. finally show the Best Case analysis for quick sort .

answered in Algorithms Apr 15, 2017

1.7k views

3 votes

157

Fractional Knapsack(Greedy Method)
Consider the following instance of the knapsack problem: n=3 , W=50 , (v1,v2,v3) = (60,100,120) and weight (w1,w2,w3) = (10,20,30) . solve the given knapsack problem applying greedy algorithm.

answered in Algorithms Apr 15, 2017

3.9k views

1 vote

158

GATE CSE 2017 Set 2 | Question: 6
Which of the following statements about parser is/are CORRECT? $\text{Canonical LR}$ is more powerful than $\text{SLR}$ $\text{SLR}$ is more powerful than $\text{LALR}$ $\text{SLR}$ is more powerful than $\text{Canonical LR}$ I only II only III only II and III only

answered in Compiler Design Apr 14, 2017

7.7k views

0 votes

159

http://www.geeksforgeeks.org/database-management-systems-set-11/
1) Information about a collection of students is given by the relation studinfo(studId, name, sex). The relation enroll(studId, courseId) gives which student has enrolled for (or taken) that course(s). Assume that every course ... female students are enrolled. (C) Courses in which only male students are enrolled. (D) None of the above

answered in Databases Apr 14, 2017

1.1k views

0 votes

160

Geometry_aptitude
I tried solving it by enumerating all the paths and got ans 12.Can anyone provide some formula for this ?

answered in Quantitative Aptitude Apr 14, 2017

539 views

1 vote

161

What is hidden terminal problem?How is the problem of hidden terminal solved in wireless LAns ?
What is hidden terminal problem?How is the problem of hidden terminal solved in wireless LAns ?

answered in Computer Networks Apr 14, 2017

1.9k views

1 vote

162

ISRO2015-41
The number of spanning trees for a complete graph with seven vertices is $2^5$ $7^5$ $3^5$ $2^{2 \times 5}$

answered in Algorithms Apr 14, 2017

6.9k views

1 vote

163

ISRO2015-20
Let $\text{R = (A, B, C, D, E, F)}$ be a relation scheme with the following dependencies $\text{C} \rightarrow \text{F, E} \rightarrow \text{A}, \text{EC} \rightarrow \text{D, A} \rightarrow \text{B}$. Which of the following is a key of $\text{R}?$ $\text{CD}$ $\text{EC}$ $\text{AE}$ $\text{AC}$

answered in Databases Apr 14, 2017

3.9k views

0 votes

164

ISRO2015-27
Which one of the following is a top-down parser? Recursive descent parser Shift left associative parser $\text{SLR}(k)$ parser $\text{LR}(k)$ parser

answered in Compiler Design Apr 14, 2017

3.6k views

3 votes

165

ISRO2015-31
If there are 32 segments, each size 1 k bytes, then the logical address should have 13 bits 14 bits 15 bits 16 bits

answered in Operating System Apr 14, 2017

10.8k views

1 vote

166

ISRO2015-37
Consider the following program. main() { fork(); fork(); fork(); } How many new processes will be created? 8 6 7 5

answered in Operating System Apr 14, 2017

3.8k views

0 votes

167

ISRO2015-39
If a node has $K$ children in $B$ tree, then the node contains exactly _____ keys. $K^2$ $K-1$ $K+1$ $\sqrt{K}$

answered in Databases Apr 14, 2017

3.8k views

1 vote

168

ISRO2015-43
Let $R_1$ and $R_2$ be regular sets defined over the alphabet, then $ R_1 \cap R_2$ is not regular $R_1 \cup R_2$ is not regular $\Sigma^* - R_1$ is regular $R_1^*$ is not regular

answered in Theory of Computation Apr 14, 2017

3.1k views

1 vote

169

ISRO2015-50
How many bits internet address is assigned to each host on a TCP/IP internet which is used in all communication with the host? $16$ bits $32$ bits $48$ bits $64$ bits

answered in Computer Networks Apr 14, 2017

4.7k views

6 votes

170

Cyclic Group
How to find no. of generators of cyclic group of orden n ?

answered in Set Theory & Algebra Apr 14, 2017

5.4k views

8 votes

171

GATE CSE 2017 Set 2 | Question: 23
$G$ is an undirected graph with $n$ vertices and $25$ edges such that each vertex of $G$ has degree at least $3$. Then the maximum possible value of $n$ is _________ .

answered in Graph Theory Apr 13, 2017

17.3k views

0 votes

172

c programming
explain the output #include <stdio.h> int main() { int a=1; printf("%d %d %d",a,a++,--a); return 0; }

answered in Programming in C Apr 13, 2017

658 views

4 votes

173

GATE CSE 2017 Set 1 | Question: 50
Instruction execution in a processor is divided into $5$ stages, Instruction Fetch (IF), Instruction Decode (ID), Operand fetch (OF), Execute (EX), and Write Back (WB). These stages take 5, 4, 20, 10 and 3 nanoseconds (ns) ... speedup (correct to two decimal places) achieved by EP over NP in executing $20$ independent instructions with no hazards is _________ .

answered in CO and Architecture Apr 13, 2017

19.0k views

0 votes

174

How Bounded waiting is satisfied
https://gateoverflow.in/109195/made-easy-mock-test https://gateoverflow.in/108500/made-easy-test-series https://gateoverflow.in/112717/synchronisation https://gateoverflow.in/107206/made-easy-mock-test-1 https://gateoverflow.in/102011/made-easy All ... then P3 (acquires S2 before P1 acquires) Then bounded wait may not satisfied please explain will this happen or not

answered in Operating System Apr 13, 2017

1.3k views

6 votes

175

GATE CSE 2017 Set 1 | Question: GA-8
The expression $\large \frac{(x+y) - |x-y|}{2}$ is equal to : The maximum of $x$ and $y$ The minimum of $x$ and $y$ $1$ None of the above

answered in Quantitative Aptitude Apr 12, 2017

8.9k views

1 vote

176

theory of computation
Let C be a context-free language and R be a regular language. Prove that the language C $\cap$ R is context free.

answered in Theory of Computation Apr 12, 2017

671 views

1 vote

177

theory of computation
The transition function of Non-deterministic push down automata is A) Q * $\sum$ * $\Gamma$ ----> ( 2Q ) * $\Gamma$* B) Q * $\sum$ * $\Gamma$ ----> 2 ( Q * $\Gamma$* ) Answer is A) or B) ...please explain your answer ...

answered in Theory of Computation Apr 12, 2017

867 views

1 vote

178

Propositions
"I'm hungry" is it a proposition? Bob is Hungry, is it a proposition? How to tell whether an idea is proposition or not when speaker speak's about himself.

answered in Mathematical Logic Apr 12, 2017

533 views

0 votes

179

theory of computation
A context-free grammar G is known to be free from epsilon productions and unit productions.The maximum number of steps needed to derive a string of length "n"(where n>1) is given by A) n B) 2n C) 2n-1 D) n^2 ANSWER is option B) or C) ...please verify ...

answered in Theory of Computation Apr 12, 2017

215 views

2 votes

180

Peter line 2.1
Construct the DFA for all string with at least one a and exactly two b

answered in Theory of Computation Apr 11, 2017

228 views

Page:

« prev
1
2
3
4
5
6
7
8
9
10
next »