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
Recent activity by Spider1896
1
answer
1
GATE CSE 1996 | Question: 12
Given below are the transition diagrams for two finite state machines $M_1$ and $M_2$ recognizing languages $L_1$ and $L_2$ respectively. Display the transition diagram for a machine that recognizes $L_1.L_2$, obtained from transition diagrams for $M_1$ ... $\varepsilon$ transitions and no new states. (Final states are enclosed in double circles).
Given below are the transition diagrams for two finite state machines $M_1$ and $M_2$ recognizing languages $L_1$ and $L_2$ respectively.Display the transition diagram fo...
8.5k
views
commented
Dec 2, 2018
Theory of Computation
gate1996
theory-of-computation
finite-automata
normal
descriptive
+
–
4
answers
2
GATE IT 2005 | Question: 37
Consider the non-deterministic finite automaton (NFA) shown in the figure. State $X$ is the starting state of the automaton. Let the language accepted by the NFA with $Y$ as the only accepting state be $L1$. Similarly, let the language accepted by the NFA with $Z$ as ... statements about $L1$ and $L2$ is TRUE? $L1 = L2$ $L1 \subset L2$ $L2 \subset L1$ None of the above
Consider the non-deterministic finite automaton (NFA) shown in the figure.State $X$ is the starting state of the automaton. Let the language accepted by the NFA with $Y$ ...
16.3k
views
commented
Nov 6, 2018
Theory of Computation
gateit-2005
theory-of-computation
finite-automata
normal
+
–
11
answers
3
GATE CSE 2002 | Question: 2.10
Consider the following algorithm for searching for a given number $x$ in an unsorted array $A[1..n]$ having $n$ distinct values: Choose an $i$ at random from $1..n$ If $A[i] = x$, then Stop else Goto 1; Assuming that $x$ is present in $A$, what is the expected number of comparisons made by the algorithm before it terminates? $n$ $n-1$ $2n$ $\frac{n}{2}$
Consider the following algorithm for searching for a given number $x$ in an unsorted array $A[1..n]$ having $n$ distinct values:Choose an $i$ at random from $1..n$If $A[i...
22.3k
views
answered
Oct 16, 2018
Algorithms
gatecse-2002
searching
normal
+
–
1
answer
4
MadeEasy Test Series: Computer Networks - Congestion Control
Consider an instance of TCP's Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of slow start phase is 1 MSS and the threshold at the start is 1st transmission is 16 MSS. Assume TCP use over a lossy link i.e. ... is the congestion window size at the end of 14 RTT (in MSS)? A) 9 B) 11 C) 12 D) 14
Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD)algorithm where the window size at the start of slow start phase is 1 MSS and thethreshold...
835
views
commented
Oct 7, 2018
Computer Networks
computer-networks
congestion-control
made-easy-test-series
+
–
6
answers
5
GATE IT 2004 | Question: 63
In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same timestamp if killed. Let $P_h$ ... but starvation-free The scheme is neither deadlock-free nor starvation-free The scheme is both deadlock-free and starvation-free
In a certain operating system, deadlock prevention is attempted using the following scheme. Each process is assigned a unique timestamp, and is restarted with the same ti...
13.5k
views
answered
Oct 2, 2018
Operating System
gateit-2004
operating-system
normal
deadlock-prevention-avoidance-detection
+
–
6
answers
6
GATE IT 2005 | Question: 76
A company has a class $C$ network address of $204.204.204.0$. It wishes to have three subnets, one with $100$ hosts and two with $50$ ... $204.204.204.128/255.255.255.128$ $204.204.204.64/255.255.255.192$ $204.204.204.0/255.255.255.192$
A company has a class $C$ network address of $204.204.204.0$. It wishes to have three subnets, one with $100$ hosts and two with $50$ hosts each. Which one of the followi...
15.4k
views
commented
Sep 17, 2018
Computer Networks
gateit-2005
computer-networks
subnetting
normal
+
–
7
answers
7
GATE CSE 2014 Set 3 | Question: 41
Consider the pseudocode given below. The function $DoSomething()$ takes as argument a pointer to the root of an arbitrary tree represented by the $leftMostChild-rightSibling$ representation. Each node of the tree is of type $treeNode$. typedef struct ... height of the tree. number of nodes without a right sibling in the tree. number of leaf nodes in the tree
Consider the pseudocode given below. The function $DoSomething()$ takes as argument a pointer to the root of an arbitrary tree represented by the $leftMostChild-rightSibl...
19.9k
views
commented
Sep 12, 2018
DS
gatecse-2014-set3
data-structures
tree
normal
+
–
1
answer
8
self doubt
Consider a system where the page fault service time is 200 ms and the main memory access time is 10 ms. The TLB is added to improve the performance. 80% references are found in the TLB and that of remaining 10 % cause page faults. The TLB access time is 20ms and page table access time is 30mS. What is Effective Memory Access Time? i m getting 40 ms ....is it correct?? or 38.8??
Consider a system where the page fault service time is 200 ms and the main memory access time is 10 ms. The TLB is added to improve the performance. 80% references are fo...
431
views
answered
Aug 29, 2018
1
answer
9
self doubt
why spinlock requires context switch ?
why spinlock requires context switch ?
283
views
commented
Aug 28, 2018
Operating System
operating-system
deadlock-prevention-avoidance-detection
+
–
1
answer
10
recursive and recursively enumerable
What will the intersection of a recursive and recursive enumerable language. Will it be recursive???
What will the intersection of a recursive and recursive enumerable language.Will it be recursive???
3.3k
views
commented
Aug 28, 2018
2
answers
11
C programming
#include<stdio.h> int main() { int arr[3] = {2, 3, 4}; char * p; p = arr; p =(char *)(int*)(p); printf("%d, ", *p); p = (int*)(p+2); printf("%d", *p); return 0; } Pls explain the output and also the code
#include<stdio.h>int main(){ int arr[3] = {2, 3, 4}; char * p; p = arr; p =(char *)(int*)(p); printf("%d, ", *p); p = (int*)(p+2); printf("%d", *p); ...
2.0k
views
asked
Aug 24, 2018
1
answer
12
DIGITAL CIRCUIT
The product term to be included to remove possible static hazard for the function WX + W’Y’ is a. WY’ b. XY’ c. W’X’ d. XY
The product term to be included to remove possible static hazard for the function WX + W’Y’ is a. WY’ b. XY’ c. W’X’ d. XY
1.2k
views
answered
Aug 24, 2018
2
answers
13
C Programming
#include <stdio.h> int main() { int a=9; printf("%d %d %d",++a,a++,++a); return 0; } what is the output? According to me it should be 12 10 10
#include <stdio.h>int main(){ int a=9; printf("%d %d %d",++a,a++,++a); return 0;}what is the output?According to me it should be 12 10 10
640
views
asked
Aug 22, 2018
0
answers
14
C programming
include <stdio.h> int main() { char *c[]={"abhi","abhishek","abhisheksing"}; printf("%s",(*(*(c+2)+7))); return 0; } What is the output?
include <stdio.h>int main(){ char *c[]={"abhi","abhishek","abhisheksing"}; printf("%s",(*(*(c+2)+7))); return 0;} What is the output?
419
views
commented
Aug 22, 2018
1
answer
15
C programming
#include <stdio.h> int main() { char *c[]={"abhi","abhishek","abhisheksing"}; printf("%s",c[2][7]); return 0; } What is the output?
#include <stdio.h>int main(){ char *c[]={"abhi","abhishek","abhisheksing"}; printf("%s",c [7]); return 0;}What is the output?
334
views
asked
Aug 22, 2018
1
answer
16
kurose
difference between point to point and peer to peer ???
difference between point to point and peer to peer ???
368
views
answered
Aug 22, 2018
Computer Networks
computer-networks
reference-book
+
–
0
answers
17
C programming
#include<stdio.h> void main() { char c[]="abhishek"; for(int i=0;i<8;i++) { c[i]="a"; printf("%c",c[i]); } } What is the error in it?
#include<stdio.h>void main(){ char c[]="abhishek"; for(int i=0;i<8;i++) {c[i]="a"; printf("%c",c[i]); } }What is the error in it?
324
views
commented
Aug 22, 2018
1
answer
18
Do we need to study call by name, call by need parameter passing techniques for Gate Cs 2019??
628
views
commented
Aug 21, 2018
0
answers
19
Networking
PLs tell what are all the topics that i hve to study at physical layer in networking
PLs tell what are all the topics that i hve to study at physical layer in networking
148
views
asked
Aug 21, 2018
1
answer
20
TOC - Doubt
Choose the correct statement. A class of languages that is closed under A. Intersection and complementation has not to be closed under union B. Union and complementation has to be closed uneer intersection C. Union and intersection has to be closed under complementation. D. Both B and C
Choose the correct statement. A class of languages that is closed underA. Intersection and complementation has not to be closed under unionB. Union and complementation ha...
384
views
commented
Aug 21, 2018
Theory of Computation
theory-of-computation
decidability
+
–
1
answer
21
Madeeasy_SubjectTest_OperatingSystem
765
views
commented
Aug 21, 2018
2
answers
22
SELF DOUBT TOC MOORE TO MEALY CONVERSION
GIVEN A MOOORE MACHINE WITH N STATES THE CORRESPONDING EQUIVALENT MEALY MACHINE HAS MAXIMUM OF N STATES ............ I THINK IT SHOULD BE FALSE BECZ SAYING MAXIMUM N STATES IS WRONG BECZ THERE IS NO CHANGE IN STATES WHILE CONVERTING MOORE TO MEALY.?? BUT IS GIVEN AS TRUE ...PLEASE CHECK??
GIVEN A MOOORE MACHINE WITH N STATES THE CORRESPONDING EQUIVALENT MEALY MACHINE HAS MAXIMUM OF N STATES ............I THINK IT SHOULD BE FALSE BECZ SAYING MAXIMUM N STAT...
1.7k
views
commented
Aug 21, 2018
0
answers
23
ambiguity test
S -> SS|AB A -> Aa|a B -> Bb|b Is this grammar is ambigious or Not?
S - SS|AB A - Aa|a B - Bb|b Is this grammar is ambigious or Not?
1.8k
views
commented
Aug 21, 2018
Compiler Design
compiler-design
+
–
1
answer
24
SELF DOUBT REDUCTION
IF P1 IS REDUCIBLE TO P2 AND P1 IS RECURSIVE ENUMERABLE THEN P2 NEED NOT BE RECURSIVE ENUMERABLE ???IS IS TRUE ??WHAT I AM THINKING IS THAT P1 IS UNDECIABLE SO P2 WILL ALSO BE UNDECIABLE HENCE SHOULD BE RECURSIVE ENUMERABLE...
IF P1 IS REDUCIBLE TO P2 AND P1 IS RECURSIVE ENUMERABLE THEN P2 NEED NOT BE RECURSIVE ENUMERABLE ???IS IS TRUE ??WHAT I AM THINKING IS THAT P1 IS UNDECIABLE SO P2 WILL AL...
1.0k
views
commented
Aug 17, 2018
1
answer
25
Context Free language
0^i1^j0^k|j=max(i,k) is CFL or not pls explain?
0^i1^j0^k|j=max(i,k) is CFL or not pls explain?
310
views
commented
Aug 17, 2018
1
answer
26
Doubt in networking
What is the difference between host to host network connection and end to end network connection? Why host to host connection for network layer and end to end connection for transport layer?
What is the difference between host to host network connection and end to end network connection? Why host to host connection for network layer and end to end connect...
1.0k
views
answered
Aug 12, 2018
Computer Networks
computer-networks
osi-model
+
–
1
answer
27
Doubt in networking
Except reliability and connection oriented what are the other functionalities which are produced by TCP but not by UDP?
Except reliability and connection oriented what are the other functionalities which are produced by TCP but not by UDP?
401
views
answered
Aug 11, 2018
Computer Networks
computer-networks
osi-model
+
–
0
answers
28
Process Scheduling
My doubt is that when a process makes a transition from Run to terminate step immediately a process is invoked from new to ready state
My doubt is that when a process makes a transition from Run to terminate step immediately a process is invoked from new to ready state
366
views
commented
Aug 11, 2018
1
answer
29
NFA DFA
My doubt is it always true that the number of state in NFA is always less than number of state required in DFA for all language which are regular?
My doubt is it always true that the number of state in NFA is always less than number of state required in DFA for all language which are regular?
1.0k
views
commented
Aug 10, 2018
1
answer
30
An ISP is granted a block of addresses starting with 195.200.0.0/16 (65,536 addresses).
An ISP is granted a block of addresses starting with 195.200.0.0/16 (65,536 addresses). The ISP needs to distribute these addresses to three groups of customers as follows: a. The first group has 64 ... has 128 customers; each needs 64 addresses. c. The third group has 128 customers; each needs 32 addresses.
An ISP is granted a block of addresses starting with 195.200.0.0/16 (65,536 addresses). The ISP needs to distribute these addresses to three groups of customers as follow...
10.9k
views
commented
Aug 5, 2018
Computer Networks
computer-networks
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register