Dark Mode

Recent questions without answers

0 votes

0 answers

15901

What are the important topics of TOC?
I have started GATE preparation today, I am not comfortable with Theory of computation, Compiler design and COA, please provide me list of topics which have highest mark distribution and should be concentrated

PieChuckerr asked in Theory of Computation Nov 22, 2016

1.4k views

0 votes

0 answers

15902

Operating System: Deadlock

Samujjal Das asked in Operating System Nov 22, 2016

by Samujjal Das

202 views

1 vote

0 answers

15903

Write_TS(X) in basic timestamp ordering
Say, when write_item(x) is executed; at that time, then write_TS(X) is not set to TS(T); and after write_item(x) is executed the process gets pre-empted. In that scenario won't the two values be different?(as write_TS(X) still contains the previoius TS(T))

prasitamukherjee asked in Databases Nov 22, 2016

by prasitamukherjee

557 views

3 votes

0 answers

15904

Kenneth Rosen Edition 6th Exercise 8.2 Question 26 (Page No. 553)
For which values of n are these graphs bipartite ? 1. $K_n$ 2. $C_n$ 3. $W_n$ 4. $Q_n$

dd asked in Graph Theory Nov 22, 2016

by dd

5.3k views

–2 votes

0 answers

15905

monty asked in Probability Nov 22, 2016

by monty

306 views

1 vote

0 answers

15906

graph theory
Which of the following statements is/are TRUE? [P] Every disconnected graph has an isolated vertex [Q] A graph is connected if and only if some vertex is connected to all other vertices [R] The edge set of every closed trail can be partitioned into edge sets of cycles [S] If a maximal trail in a graph is not closed, then its endpoints have odd degree

Akriti sood asked in Graph Theory Nov 22, 2016

450 views

1 vote

0 answers

15907

memory accessing
https://gateoverflow.in/8119/gate2015-2_24 https://gateoverflow.in/2078/gate2014-3_44 in both these question how we confirmed that we are accessing the memory simultaneously not one after other and these type of questions are fill in the blank type then which one to take

Rahul Singhal asked in CO and Architecture Nov 22, 2016

by Rahul Singhal

191 views

0 votes

0 answers

15908

vaishali jhalani asked in Compiler Design Nov 22, 2016

by vaishali jhalani

406 views

0 votes

0 answers

15909

What do you interpret from question?
It took me hell a lot of time. Still cann't figure out question??

thor asked in Programming in C Nov 22, 2016

by thor

254 views

0 votes

0 answers

15910

Programming Doubt

thor asked in Programming in C Nov 21, 2016

by thor

215 views

–4 votes

0 answers

15911

er modal
[email protected]

rajkishor kamal asked in Databases Nov 21, 2016

by rajkishor kamal

202 views

–2 votes

0 answers

15912

Instruction Format
Is The Answer correct? why the instruction format doesn't have memory address field?

viv696 asked in CO and Architecture Nov 21, 2016

by viv696

321 views

0 votes

0 answers

15913

recursive calling
What is the difference between access link and control link in any recursive function.. A suitable diagram will be very helpful..

vaishali jhalani asked in Compiler Design Nov 21, 2016

by vaishali jhalani

291 views

0 votes

0 answers

15914

#Gatebook Qno.26
There is a CFG with only 2 variables, and a single terminal, and 2 only productions (No unit, epsilon, useless products, left recursion,). What would be the max number of productions if that gets converted into GNF (A). 2 (B). <=4 (C). <=8 (D). None

Hradesh patel asked in Theory of Computation Nov 20, 2016

by Hradesh patel

394 views

1 vote

0 answers

15915

#Gatebook qno.-23
Let M be a single-tape deterministic TM with tape alphabet { blank, 0, 1 }, and let C denote the ( possibly infinite ) computation of M starting with a blank tape. The input to each problem is M, together with a positive integer n. Which of the following problems is(are) ... tape cells during the company C (A). III only (B). I and II only (C).I and III only (D).I,II and III

Hradesh patel asked in Theory of Computation Nov 20, 2016

by Hradesh patel

275 views

0 votes

0 answers

15916

GateBook Qno 8
Let M0, M1, M2,..., be an effective enumeration of all Turing machines. Which of the following problems is (are) decidable ? I. Given a natural number n, does Mn starting with an empty tape halt in fewer than n steps? II.Given a natural number n, does Mn starting with an empty tape halt after at least n steps? (A). I only (B). II only (C). Both I and II (D). Neither I nor II

Hradesh patel asked in Theory of Computation Nov 20, 2016

by Hradesh patel

345 views

0 votes

0 answers

15917

Design and analysis of algorithm, Algorithm
What are dummies in Optimal binary Search Tree algorithm..? And is Cost calculated on the basis of Probability of Search keys only or On the basis of value on Search Element (At last it has to build a binary tree so it need to check on Values of Search Elements Also then why do we only consider probability whiile calculating Cost )..?? At last

Dhawal Gajwe asked in Algorithms Nov 20, 2016

by Dhawal Gajwe

402 views

1 vote

0 answers

15918

COMPILER DESIGN
For an object oriented programming consider the following example: (1) There is a class C with a method named m( ) (2) D is a sub class of C, and D has its own method named m( ) (3) There is a use of m of the form x.m( ), where x is an object ... (3) whether x will be a class of C or of the subclass of D when will it be resolved? None of these Compile time Edit time Run time

RISHI GUPTA 1 asked in Compiler Design Nov 20, 2016

by RISHI GUPTA 1

282 views

1 vote

0 answers

15919

MadeEasy Test Series: Computer Networks - Routers Bridge Hubs Switches
minimum number of interfaces reqired for a router? and give reasoning too.

Anusha Motamarri asked in Computer Networks Nov 19, 2016

by Anusha Motamarri

943 views

1 vote

0 answers

15920

Doubt on decidability
I have a doubt regarding the dilemma of semidecidable and undecidable.. We have 8 standard properties and considering each class of language: a) Membership b) Finiteness c) Emptiness d) Ambiguity e) Regularity f) Equivalence g) Kleene's Closureness h ... particular operation?? @Arjun sir,plz help me resolving this doubt..It would be helpful of other aspirants as well..

Habibkhan asked in Theory of Computation Nov 19, 2016

450 views

0 votes

0 answers

15921

Which elements will be JOin Irreducible in D60 ?Compilements of 2 and 10 exists?
Which elements will be JOin Irreducible in D60 ? Whether complements of 2 and 10 exists or not? Express each number x as join of a minimum number of irredundant join irreducible elements.

LavTheRawkstar asked in Graph Theory Nov 19, 2016

by LavTheRawkstar

2.8k views

1 vote

0 answers

15922

Tanenbaum
In selective repeat SR protocol, MAX_SEQ = 2^n - 1. While this condition is obviously desirable to make efficient use of header bits, we have not demonstrated that it is essential. Does the protocol work correctly for MAX_SEQ = 4, for example?

sushmita asked in Computer Networks Nov 19, 2016

1.1k views

0 votes

0 answers

15923

closure properties
I think the question is wrong , it is related to closure properties of NP problems and NP problems are recursive so closed under concatenation, intersection, union, set difference. Correct me if i am wrong..

vaishali jhalani asked in Theory of Computation Nov 19, 2016

by vaishali jhalani

742 views

0 votes

0 answers

15924

MadeEasy Test Series: Numerical Ability - Numerical Computation
odd-even= odd odd*odd= odd then why b cant be true?

Anusha Motamarri asked in Quantitative Aptitude Nov 19, 2016

by Anusha Motamarri

520 views

0 votes

0 answers

15925

universal turing machine

vaishali jhalani asked in Theory of Computation Nov 18, 2016

by vaishali jhalani

2.0k views

1 vote

0 answers

15926

Theory of Computation
Which of the following statements is Decidable? S1: The set of all TM's that given an input eventually write a non blank symbol on their tapes S2: The set of all TM's that given an input visits an arbitrary state q (A). S1 only (B). S2 only (C). Both (D). None

Shreya Roy asked in Theory of Computation Nov 18, 2016

767 views

3 votes

0 answers

15927

Theory of Computation
There is a CFG with only 2 variables, and a single terminal, and 2 only productions (No unit, epsilon, useless products, left recursion,). What would be the max number of productions if that gets converted into GNF (A). 2 (B). <=4 (C). <=8 (D). None

Shreya Roy asked in Theory of Computation Nov 18, 2016

373 views

1 vote

0 answers

15928

GATE CSE 1990 | Question: 1-ix
The solution to the following linear program $\max$ $X_{1}$ such that $X_{1}+2X_{2} \leq 10$ $X_{1} \leq 8$ $X_{1} \leq 1$ is ____________.

makhdoom ghaya asked in Others Nov 18, 2016

by makhdoom ghaya

422 views

3 votes

0 answers

15929

context free language
Consider the languages L1 = {babaabaaab…ba(n-1) ban b | n ≥ 1} L2=Complement(L1) L1 is not a CFL but L2 is, How?

vaishali jhalani asked in Theory of Computation Nov 18, 2016

by vaishali jhalani

772 views

0 votes

0 answers

15930

functional dependency
can anyone help counting the total FDs |F+| or FD set closure as given 43 FD's in below example

Neal Caffery asked in Databases Nov 18, 2016

by Neal Caffery

392 views

Page:

« prev
1
...
526
527
528
529
530
531
532
533
534
535
536
...
591
next »

Recent questions without answers