Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
rude
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by rude
5
votes
41
theory of automata
do we need to study chomsky and griebach normal forms in detail for the gate exam? are they useful for solving anything in an easier way?
do we need to study chomsky and griebach normal forms in detail for the gate exam? are they useful for solving anything in an easier way?
492
views
answered
Mar 12, 2017
7
votes
42
graph theory
A graph with n vertices and 0 edges.can this graph be called as Bipartite ? i mean can we simply partition the n vertices into two sets of vertices such that there is no edge within the set as well there is no edge between the two sets and say it as a Bipartite graph ?
A graph with n vertices and 0 edges.can this graph be called as Bipartite ? i mean can we simply partition the n vertices into two sets of vertices such that there is no ...
1.1k
views
answered
Mar 12, 2017
Graph Theory
graph-theory
discrete-mathematics
graph-connectivity
engineering-mathematics
+
–
6
votes
43
graph theory
chromatic number of a graph <= ( maxdegree of the graph ) + 1 can somebody explain how ?
chromatic number of a graph <= ( maxdegree of the graph ) + 1 can somebody explain how ?
3.4k
views
answered
Mar 12, 2017
Graph Theory
graph-theory
discrete-mathematics
graph-connectivity
engineering-mathematics
+
–
5
votes
44
memory management
In paging no. of entries in page table is same as no. of pages in LAS what does this mean? Does this mean the pages present at particular time in LAS only those pages should be present in page table?
In paging no. of entries in page table is same as no. of pages in LAS what does this mean? Does this mean the pages present at particular time in LAS only those pages sho...
283
views
answered
Mar 12, 2017
Operating System
operating-system
+
–
6
votes
45
graph theory
The cardinality of the vertex-cut ( seperating set ) of a complete graph with n vertices is ___
The cardinality of the vertex-cut ( seperating set ) of a complete graph with n vertices is ___
632
views
answered
Mar 12, 2017
Graph Theory
graph-theory
discrete-mathematics
graph-connectivity
engineering-mathematics
+
–
5
votes
46
process management
when a process move from ready to suspend ready state i.e. form main memory to backing store. is it possible that process move to another processor for execution?
when a process move from ready to suspend ready state i.e. form main memory to backing store. is it possible that process move to another processor for execution?
308
views
answered
Mar 12, 2017
Operating System
operating-system
+
–
7
votes
47
C language
Consider the following C program. What's the Output and does it depends on the compiler used to run this code? #include<stdio.h> int main() { int i = 1; printf("%d %d %d\n", i++, i++, i); return 0; }
Consider the following C program. What's the Output and does it depends on the compiler used to run this code?#include<stdio.h int main() { int i = 1; printf("%d %d %d\n"...
357
views
answered
Mar 10, 2017
4
votes
48
integer promotion RULE in C gate 2017
https://gateoverflow.in/118473/gate2017-1-53 https://gateoverflow.in/120912/techtud-c-programming http://www.iitk.ac.in/esc101/2011Jan/Lectures/lect6.pdf in case of usigned int and long unsigned mix operation unsigned int promoted to ... promoted to unsigned int plz provide detailed solution, according to rule given iitk pdf code block give different output.
https://gateoverflow.in/118473/gate2017-1-53https://gateoverflow.in/120912/techtud-c-programminghttp://www.iitk.ac.in/esc101/2011Jan/Lectures/lect6.pdfin case of usigned ...
789
views
answered
Mar 9, 2017
5
votes
49
graph theory
353
views
answered
Mar 9, 2017
Graph Theory
graph-theory
discrete-mathematics
graph-connectivity
engineering-mathematics
+
–
20
votes
50
ISI 2015 PCB C4 A
Design a context free grammar for the language consisting of all strings over $\mathbf{\{a,b\}}$ that are not the form $\mathbf{ww}$ for any string $\mathbf{w}$
Design a context free grammar for the language consisting of all strings over $\mathbf{\{a,b\}}$ that are not the form $\mathbf{ww}$ for any string $\mathbf{w}$
1.3k
views
answered
Mar 9, 2017
Theory of Computation
pushdown-automata
theory-of-computation
isi2015
+
–
7
votes
51
algorithm
finf the tc T(n)=nlogn +T(n-1)
finf the tcT(n)=nlogn +T(n-1)
387
views
answered
Mar 9, 2017
Algorithms
algorithms
time-complexity
recurrence-relation
+
–
16
votes
52
binary search
I/p - array of n element in which untill some postion all are integer and afterward all are star (*) O/p- find the postion of 1st star (*) Hint - if lenear search is possible the go to BS Find time complexity ..?
I/p - array of n element in which untill some postion all are integer and afterward all are star (*) O/p- find the postion of 1st star (*)Hint - if lenear search is possi...
1.6k
views
answered
Mar 9, 2017
Algorithms
algorithms
binary-search
binary-search-tree
+
–
10
votes
53
graph theory
Find 1) Vertex connectivity 2) Edge connectivity 3) Is it a seperable graph ? If so then find the cut-vertex
Find 1) Vertex connectivity 2) Edge connectivity 3) Is it a seperable graph ? If so then find the cut-vertex
1.7k
views
answered
Mar 9, 2017
Graph Theory
graph-theory
discrete-mathematics
graph-connectivity
engineering-mathematics
+
–
6
votes
54
How many bit strings of length n contains at least ,at most , exactly r 1's
How many bit strings of length n contains 1)at least 2) at most 3) exactly r 1's
How many bit strings of length n contains 1)at least 2) at most 3) exactly r 1's
1.6k
views
answered
Mar 9, 2017
8
votes
55
how many solutions are there to equation x1+x2+x3 =11
how many solutions are there to equation x1+x2+x3 =11 with conditions x1<= 1 ,x2<=2 ,x3<=3
how many solutions are there to equationx1+x2+x3 =11with conditions x1<= 1 ,x2<=2 ,x3<=3
7.3k
views
answered
Mar 9, 2017
Combinatory
combinatory
+
–
4
votes
56
Scheduling
Which of the following event doesn't effect a process in the running time ? a) Interupt b) exit c) I/O event d)schedular dispatch
Which of the following event doesn't effect a process in the running time ?a) Interupt b) exit c) I/O event d)schedular dispatch
474
views
answered
Aug 22, 2016
10
votes
57
permutation and combination
A dice is rolled 6 times ,one ,two,three,four,five,and six appears on consecutive throws of dice ,how many ways are possible of having one before six?? plz explain clearly
A dice is rolled 6 times ,one ,two,three,four,five,and six appears on consecutive throws of dice ,how many ways are possible of having one before six?? plz explain clearl...
1.0k
views
answered
Jul 24, 2016
4
votes
58
Sorting
What is the Worst Case Space Complexity of Quick Sort?
What is the Worst Case Space Complexity of Quick Sort?
577
views
answered
Jul 24, 2016
Algorithms
algorithms
quick-sort
time-complexity
descriptive
+
–
8
votes
59
UGC NET CSE | December 2012 | Part 3 | Question: 45
Which of the following regular expression identifies are true? (r+s)*=r*s* (r+s)*=r*+s* (r+s)*=(r*s*)* r*s*=r*+s*
Which of the following regular expression identifies are true?(r+s)*=r*s*(r+s)*=r*+s*(r+s)*=(r*s*)*r*s*=r*+s*
824
views
answered
Jun 18, 2016
Theory of Computation
theory-of-computation
ugcnetcse-dec2012-paper3
+
–
10
votes
60
ISRO2007-57
Which of the following programming language(s) provides garbage collection automatically Lisp C++ Fortan C
Which of the following programming language(s) provides garbage collection automaticallyLispC++FortanC
3.9k
views
answered
Jun 17, 2016
Programming in C
isro2007
programming
runtime-environment
+
–
6
votes
61
primary key for an entity
A primary key for an entity is a candidate key any attribute a unique attribute a superkey
A primary key for an entity isa candidate keyany attributea unique attributea superkey
2.7k
views
answered
Jun 17, 2016
10
votes
62
Minimum number of states in DFA
What is the minimum number of states in string ${(ab)}^{*}$? How to approach this kind of problem?
What is the minimum number of states in string ${(ab)}^{*}$?How to approach this kind of problem?
5.1k
views
answered
Jun 17, 2016
5
votes
63
UGC NET CSE | December 2014 | Part 2 | Question: 35
The following Context-Free Grammar (CFG) : $S \rightarrow aB | bA$ $A \rightarrow a | as | bAA$ $B \rightarrow b | bs | aBB$ will generate Odd numbers of $a's$ and odd numbers of $b's$ Even numbers of $a's$ and even numbers of $b's$ Equal numbers of $a's$ and $b's$ Different numbers of $a's$ and $b's$
The following Context-Free Grammar (CFG) :$S \rightarrow aB | bA$$A \rightarrow a | as | bAA$$B \rightarrow b | bs | aBB$ will generateOdd numbers of $a's$ and odd number...
8.6k
views
answered
Jun 17, 2016
Theory of Computation
ugcnetcse-dec2014-paper2
theory-of-computation
context-free-grammar
+
–
4
votes
64
how many no of times the instruction sequence below will loop before coming out of loop?
how many no of times the instruction sequence below will loop before coming out of loop? A1; MOV AL,00H INC AL JNZ A1
how many no of times the instruction sequence below will loop before coming out of loop?A1; MOV AL,00H INC AL JNZ A1
1.3k
views
answered
Jun 16, 2016
12
votes
65
Write regular expression to denote a language L which accepts all the strings which begin or end with either 00 or 11
A. [(00(0+1)* 11] + [11( 0 + 1)* 00]B. [(00+11) (0+1)+] + [( 0 + 1)+ (00+11)].C. [(00+11) (0+1)*] + [( 0 + 1)* (00+11)]D. (00+11) (0+1)* (00+11).
20.6k
views
answered
Jun 16, 2016
Theory of Computation
theory-of-computation
regular-expression
peter-linz
+
–
5
votes
66
Grammar that produce more than one Parse tree for same sentence is:
A. Ambiguous B. Unambiguous C. Complementation D. Concatenation Intersection
A. AmbiguousB. UnambiguousC. ComplementationD. Concatenation Intersection
14.4k
views
answered
Jun 16, 2016
Theory of Computation
compiler-design
parsing
+
–
6
votes
67
Regular expression for the language L = { w ∈ {0, 1}* | w has no pair of consecutive zeros} is
A. (1 + 010)* B. (01 + 10)* C. (1 + 010)* (0 + λ) D. (1 + 01)* (0 + λ)
A. (1 + 010)*B. (01 + 10)*C. (1 + 010)* (0 + λ)D. (1 + 01)* (0 + λ)
34.3k
views
answered
Jun 16, 2016
Theory of Computation
theory-of-computation
+
–
11
votes
68
Which of the following conversion is not possible (algorithmically)?
A. regular grammar to context-free grammar B. nondeterministic FSA to deterministic FSA C. nondeterministic PDA to deterministic PDA D. nondeterministic TM to deterministic TM
A. regular grammar to context-free grammarB. nondeterministic FSA to deterministic FSAC. nondeterministic PDA to deterministic PDAD. nondeterministic TM to de...
14.0k
views
answered
Jun 16, 2016
Theory of Computation
theory-of-computation
+
–
8
votes
69
UGC NET CSE | September 2013 | Part 2 | Question: 18
The number of 8-bit strings beginning with either 111 or 101 is 64 128 265 None of the above
The number of 8-bit strings beginning with either 111 or 101 is64128265None of the above
5.3k
views
answered
Jun 16, 2016
Theory of Computation
theory-of-computation
ugcnetsep2013ii
+
–
6
votes
70
Let T(n) be the function defined by T(n) = 1 and T(n) = 2T (n/2) + n, which of the following is TRUE ?
A. T(n) = $O( n Log n)$B. T(n) = $O({(logn)}^2)$C. T(n) = $O(n)$D. T(n) = $O(n^2)$
2.9k
views
answered
Jun 16, 2016
Algorithms
recurrence-relation
algorithms
+
–
Page:
« prev
1
2
3
4
5
6
7
...
9
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register