Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by Kapil
1
votes
2
answers
1
GATE 2017 EC Aptitude
$900$ men and $500$ woman complete a task in $2$ weeks. $1200$ men and $250$ woman took $3$ weeks to complete the same task. Then, how many men are required to complete the same task in $1$ week ?
$900$ men and $500$ woman complete a task in $2$ weeks. $1200$ men and $250$ woman took $3$ weeks to complete the same task. Then, how many men are required to complete t...
3.8k
views
asked
Feb 7, 2017
Quantitative Aptitude
numerical-answers
+
–
0
votes
4
answers
2
What is the output || Single linked list ?
struct node{ int num; struct node *next; } void print(struct node *ptr) { if(ptr) { printf("%d",ptr->data); do{ printf("%d",ptr->data); } while(ptr->next); } } What is the output, if a $SLL : 1\rightarrow 2\rightarrow 3\rightarrow 4\rightarrow 5$ is passed in the above $C$ code ? Assume Head pointer at Node $1$
struct node{ int num; struct node *next; } void print(struct node *ptr) { if(ptr) { printf("%d",ptr->data); do{ printf("%d",ptr->data); } while(ptr->next); } }What is the...
1.5k
views
asked
Feb 3, 2017
DS
linked-list
data-structures
programming-in-c
output
+
–
3
votes
1
answer
3
Time Complexity of the given code ?
#include <stdio.h> int main(void) { for(i=1;i<=n;i*=2) { for(j=0;j<=i;j++) { for(k=0;k<=n;k++) { ..... O(1)....; } } } return 0; } What is the time complexity of given code ?
#include <stdio.h int main(void) { for(i=1;i<=n;i*=2) { for(j=0;j<=i;j++) { for(k=0;k<=n;k++) { ..... O(1)....; } } } return 0; }What is the time complexity of given code...
1.1k
views
asked
Jan 29, 2017
Algorithms
time-complexity
algorithms
programming-in-c
+
–
5
votes
3
answers
4
Difference between Kruskal's and Prim's algorithm ?
It may be the case that "Kruskal's Algorithm may not maintain connectivity while Prim's algorithm always does that" ? Any example which favours this ?
It may be the case that "Kruskal's Algorithm may not maintain connectivity while Prim's algorithm always does that" ?Any example which favours this ?
3.4k
views
asked
Jan 24, 2017
Algorithms
algorithms
graph-algorithms
kruskals-algorithm
prims-algorithm
+
–
16
votes
0
answers
5
Discussion regarding Cache Memory
What is the size of $MUX$ needed in direct mapped cache ? For ex :- | Tag = $17$ | line = $10$ | word = $5$ | Diagram Reference :- Direct mapped cache with multi word block In set associative cache, Do MUX and OR ... MUX and OR gate work parallely, then Hit latency includes both delays ? Diagram Reference :- - Also, any reason/explaination regarding below image ?
What is the size of $MUX$ needed in direct mapped cache ?For ex :- | Tag = $17$ | line = $10$ | word = $5$ |Diagram Reference :- Direct mapped cache with multi word bloc...
2.4k
views
asked
Jan 21, 2017
CO and Architecture
cache-memory
co-and-architecture
direct-mapping
+
–
4
votes
1
answer
6
Draw the LL(1) parsing table of the given grammar ?
Consider a Grammar G as follows : $S\rightarrow W$ $W \rightarrow ZXY / XY$ $Y\rightarrow c/\epsilon$ $Z\rightarrow a/d$ $X\rightarrow Xb/\epsilon$ Draw the LL(1) parsing table for the given grammar ? NOTE :- The above grammar is NOT LL(1) .
Consider a Grammar G as follows :$S\rightarrow W$$W \rightarrow ZXY / XY$$Y\rightarrow c/\epsilon$$Z\rightarrow a/d$$X\rightarrow Xb/\epsilon$Draw the LL(1) parsing table...
19.9k
views
asked
Dec 27, 2016
Compiler Design
parsing
compiler-design
ll-parser
grammar
+
–
2
votes
0
answers
7
DBMS Decomposition into 3NF and BCNF
Suppose a relation is given $R\left ( ABCDEF \right )$ with the given set of FD's $\left \{ A \rightarrow BCD, BC\rightarrow DE, B\rightarrow D,D\rightarrow A \right \}$ A). Compute the Canonical Cover ? B). Give 3NF decomposition of R based on canonical cover ? C). Give BCNF decomposition of R based on original set of FD ?
Suppose a relation is given $R\left ( ABCDEF \right )$ with the given set of FD's$\left \{ A \rightarrow BCD, BC\rightarrow DE, B\rightarrow D,D\rightarrow A \right \}$A)...
1.4k
views
asked
Nov 20, 2016
Databases
database-normalization
databases
canonical-cover
+
–
3
votes
1
answer
8
TOC Grand Test 1 Question 27 - Gatebook
Consider languages L1 and L2 over {0,1} alphabet . L2= { w | w contains some x as a substring and x belongs to L1 } Which of the following must be true? I. If L1 is regular, L2 is also regular. II. If L1 is CFL, L2 is also CFL. III. If L1 is recursive, L2 is also recursive I and II only I, II and III I and III only II and III only
Consider languages L1 and L2 over {0,1} alphabet . L2= { w | w contains some x as a substring and x belongs to L1 }Which of the following m...
820
views
asked
Nov 9, 2016
Theory of Computation
gatebook-toc
regular-language
theory-of-computation
+
–
8
votes
1
answer
9
How to draw register allocation interference graph ?
How to draw register allocation interference graph ? Can anyone explain this along with " What is a live variable "? Explain with the example given below ? a = 1 b = 10 c = 20 d = a + b e = c + d f = c + e b = c + e e = b + f d = 5 + e return d + f
How to draw register allocation interference graph ?Can anyone explain this along with " What is a live variable "?Explain with the example given below ?a = 1 b = 10 c = ...
3.1k
views
asked
Nov 2, 2016
Compiler Design
compiler-design
register-allocation
+
–
6
votes
0
answers
10
Gateway vs. routers vs. bridges
Explain the followīng sentences with an example ? A). "Bridge is used to connect different LAN's in the same network" B). "Router is used to connect different similar networks" C). "Gateway is used to connect different dissimilar networks"
Explain the followīng sentences with an example ?A). "Bridge is used to connect different LAN's in the same network"B). "Router is used to connect different similar netw...
741
views
asked
Oct 19, 2016
Computer Networks
computer-networks
routers-bridge-hubs-switches
+
–
3
votes
1
answer
11
Computer Networking
Is there any way / Approach or any idea to how to learn port addresses for different protocols. I have seen many questions in test series regarding ports. I have never seen GATE asking such questions. But what if it comes. If anyone of you, has any technique to by heart them, then please share here . It will be beneficial to all . Thanks !!!
Is there any way / Approach or any idea to how to learn port addresses for different protocols.I have seen many questions in test series regarding ports.I have never seen...
773
views
asked
Oct 18, 2016
Computer Networks
computer-networks
+
–
2
votes
1
answer
12
Check whether the given schedule is conflict serializable or not ?
Check whether the given schedule is conflict serializable or not ? R2(A); R3(C); W3(A); W2(A); W2(B); W3(C); R1(A); R1(B); W1(A); W1(B)
Check whether the given schedule is conflict serializable or not ? R2(A); R3(C); W3(A); W2(A); W2(B); W3(C); R1(A); R1(B); W1(A); W1(B)
971
views
asked
Sep 29, 2016
Databases
databases
conflict-serializable
+
–
5
votes
2
answers
13
Halting Problem of Turing Machines
Can anyone provide the proof of halting problem of turing machines by contradiction ? If possible, give example, how is it reduced to other turing problems ?
Can anyone provide the proof of halting problem of turing machines by contradiction ? If possible, give example, how is it reduced to other turing problems ?
2.1k
views
asked
Sep 27, 2016
Theory of Computation
theory-of-computation
turing-machine
decidability
+
–
0
votes
0
answers
14
C programming - (Initialization)
Consider 2 Program initializations P and Q . Are both the initializations equivalent ? P:: x:=1; y:=1; z:=1; u:=0 Q:: x, y, z, u := 1, 1, 1, 0;
Consider 2 Program initializations P and Q .Are both the initializations equivalent ?P:: x:=1; y:=1; z:=1; u:=0Q:: x, y, z, u := 1, 1, 1, 0;
1.0k
views
asked
Sep 16, 2016
Programming in C
programming-in-c
output
+
–
0
votes
2
answers
15
Theory of Computation - Decidability
Is this language Decidable ? L = { < M1,M2 > | M1,M2 are TM's and Ɛ ∈ L(M1) ∪ L(M2) } Where Ɛ = Epsilon EDIT => I think it is the non-trivial property of TM making it undecidable. By applying rice theorem 1, Take Tyes = Σ* and Tno = (0) , making it REL.
Is this language Decidable ?L = { < M1,M2 | M1,M2 are TM's and Ɛ ∈ L(M1) ∪ L(M2) } Where Ɛ = EpsilonEDIT = I think it is the non-trivial property of TM making it u...
903
views
asked
Sep 7, 2016
Theory of Computation
theory-of-computation
decidability
turing-machine
+
–
8
votes
3
answers
16
7th smallest element in a Min-Heap
In a min-heap with n elements 1). The 7th smallest element can be found in time, if duplicates are allowed ? 2). The 7th distinct smallest element can be found in time, If duplicates are allowed ?
In a min-heap with n elements1). The 7th smallest element can be found in time, if duplicates are allowed ?2). The 7th distinct smallest element can be found in time, I...
4.0k
views
asked
Sep 4, 2016
DS
data-structures
binary-heap
time-complexity
+
–
8
votes
2
answers
17
Computer Architecture --> Interrupt Driven I/O
Consider a system, that uses Interrupt Driven I/O for a particular device which has a data transfer rate of 10 KBPS . The processing of the interrupt ( Jump, Execute and Return to the main program ) takes 250 us . What percentage of CPU time is consumed by I/O device , if I/O device interrupts for every 2 bytes ?
Consider a system, that uses Interrupt Driven I/O for a particular device which has a data transfer rate of 10 KBPS . The processing of the interrupt ( Jump, Execute and ...
3.5k
views
asked
Aug 30, 2016
CO and Architecture
co-and-architecture
interrupts
+
–
8
votes
2
answers
18
Minimization of DFA
5.8k
views
asked
Aug 11, 2016
Theory of Computation
theory-of-computation
minimal-state-automata
finite-automata
+
–
1
votes
1
answer
19
Cormen
2n is the order of 3n . Is it True or False ? State with reason.
2n is the order of 3n . Is it True or False ? State with reason.
643
views
asked
Aug 5, 2016
Algorithms
algorithms
asymptotic-notation
true-false
+
–
2
votes
2
answers
20
Regular Expression time complexity
The equality of two regular expression is computed in? Give reasons also.. Constant Time polynomial time logarithmic Polynomial time Exponential time
The equality of two regular expression is computed in? Give reasons also..Constant Timepolynomial timelogarithmic Polynomial timeExponential time
1.4k
views
asked
Jul 8, 2016
Theory of Computation
regular-expression
finite-automata
regular
expression
theory-of-computation
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register