Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
hungrysoul554
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by hungrysoul554
0
answers
1
[Graphs]IIT-k Written test
Graph Matching was explained. Let $S$ and $R$ be the matching graph, then a new graph $G=(S-R) \cup (R-S)$, will be union of vertex disjoint path and cycle. Also prove that the cycle obtained will be of even length.
Graph Matching was explained. Let $S$ and $R$ be the matching graph, then a new graph $G=(S-R) \cup (R-S)$, will be union of vertex disjoint path and cycle. Also prove th...
348
views
commented
Apr 13, 2018
Graph Theory
iit-kanpur
written-test
mtech
gate2017
+
–
2
answers
2
Regarding GATEOverflow books
Do the GATEOverflow pdf books contain ALL the pervious year questions? Some questions are missing. I need to know whether or not to buy a question bank.
Do the GATEOverflow pdf books contain ALL the pervious year questions? Some questions are missing. I need to know whether or not to buy a question bank.
1.3k
views
commented
Feb 24, 2018
Study Resources
gateoverflow
study-resources
preparation
+
–
1
answer
3
2018 Gate exam of MT
can you provide the link of checking mark of MT gate 2018
can you provide the link of checking mark of MT gate 2018
445
views
answered
Feb 24, 2018
GATE Application
gate2018-analysis
+
–
1
answer
4
CMI MSc Data Science
How good is MSc CS data science at CMI. http://www.cmi.ac.in/teaching/courses.php?prog=mscdatascience
How good is MSc CS data science at CMI.http://www.cmi.ac.in/teaching/courses.php?prog=mscdatascience
2.9k
views
commented
Feb 22, 2018
6
answers
5
GATE CSE 2018 | Question: 25
Consider a long-lived $\text{TCP}$ session with an end-to-end bandwidth of $1\; \text{Gbps}\; (=10^9$ bits-per-second$).$ The session starts with a sequence number of $1234$. The minimum time (in seconds, rounded to the closet integer) before this sequence number can be used again is _________.
Consider a long-lived $\text{TCP}$ session with an end-to-end bandwidth of $1\; \text{Gbps}\; (=10^9$ bits-per-second$).$ The session starts with a sequence number of $12...
21.2k
views
commented
Feb 14, 2018
Computer Networks
gatecse-2018
computer-networks
tcp
normal
numerical-answers
1-mark
+
–
7
answers
6
GATE CSE 2018 | Question: 5
Consider the following processor design characteristics: Register-to-register arithmetic operations only Fixed-length instruction format Hardwired control unit Which of the characteristics above are used in the design of a RISC processor? I and II only II and III only I and III only I, II and III
Consider the following processor design characteristics:Register-to-register arithmetic operations onlyFixed-length instruction formatHardwired control unitWhich of the c...
11.9k
views
commented
Feb 9, 2018
CO and Architecture
gatecse-2018
co-and-architecture
cisc-risc-architecture
easy
1-mark
+
–
3
answers
7
Test by Bikram | Computer Organization and Architecture | Test 1 | Question: 11
A system has $3$ levels of cache i.e., $L_1, L_2$ and $L_3.$ The access times of $L_1,L_2$ and $L_3$ cache memories are $100$ ns/word, $150$ ns/word and $250$ ns/word, respectively. $L_1, L_2$ ... until a complete memory block gets transferred, what is the average access time? $103$ ns $220$ ns $150$ ns $135$ ns
A system has $3$ levels of cache i.e., $L_1, L_2$ and $L_3.$ The access times of $L_1,L_2$ and $L_3$ cache memories are $100$ ns/word, $150$ ns/word and $250$ ns/word, re...
989
views
commented
Jan 22, 2018
CO and Architecture
tbb-coa-1
co-and-architecture
cache-memory
multilevel-cache
+
–
10
answers
8
GATE CSE 2003 | Question: 18
In a bottom-up evaluation of a syntax directed definition, inherited attributes can always be evaluated be evaluated only if the definition is L-attributed be evaluated only if the definition has synthesized attributes never be evaluated
In a bottom-up evaluation of a syntax directed definition, inherited attributes canalways be evaluatedbe evaluated only if the definition is L-attributedbe evaluated only...
36.5k
views
commented
Jan 18, 2018
Compiler Design
gatecse-2003
compiler-design
syntax-directed-translation
normal
+
–
7
answers
9
GATE CSE 2009 | Question: 47
While opening a $TCP$ connection, the initial sequence number is to be derived using a time-of-day (ToD) clock that keeps running even when the host is down. The low order $32$ bits of the counter of the ToD clock is to be used for the initial sequence numbers ... sequence numbers used for packets of a connection can increase? $0.015$/s $0.064$/s $0.135$/s $0.327$/s
While opening a $TCP$ connection, the initial sequence number is to be derived using a time-of-day (ToD) clock that keeps running even when the host is down. The low orde...
25.2k
views
commented
Jan 18, 2018
Computer Networks
gatecse-2009
computer-networks
tcp
difficult
ambiguous
+
–
3
answers
10
Test by Bikram | Computer Networks | Test 1 | Question: 28
Which among the following services is provided by the transport layer? Recovery from message loss. End to end delivery of individual messages. Correct order message delivery. All of the above.
Which among the following services is provided by the transport layer?Recovery from message loss.End to end delivery of individual messages.Correct order message delivery...
710
views
commented
Jan 18, 2018
Computer Networks
tbb-cn-1
transport-layer
+
–
2
answers
11
Test by Bikram | Computer Networks | Test 1 | Question: 16
In a token bucket network transmission spreed is $20^*(10^6)$ bps and maximum rate can only be sent for at most $10$ sec at a time, and at most $150$ Mb can be sent over any $15$ sec window, then the value for token input rate is _________ mbps
In a token bucket network transmission spreed is $20^*(10^6)$ bps and maximum rate can only be sent for at most $10$ sec at a time, and at most $150$ Mb can be sent over...
1.2k
views
commented
Jan 18, 2018
Computer Networks
tbb-cn-1
numerical-answers
+
–
0
answers
12
Test by Bikram | Computer Networks | Test 1 | Question: 9
Internet address always have at least: A country name or organization type Internet service provider's name Name of organization Name of individual Type of organization ii, iii,iv i, iii i,ii,iii ii,iii,iv,v
Internet address always have at least:A country name or organization typeInternet service provider's nameName of organizationName of individualType of organization ii, ii...
557
views
commented
Jan 18, 2018
Computer Networks
tbb-cn-1
+
–
1
answer
13
Test by Bikram | Compiler Design | Test 1 | Question: 28
Consider the following syntax directed definition of any desk calculator: $L \rightarrow En \{ \text{print}(E.val) \}$ $E \rightarrow E1 + 1 \{ E.val = E1.val + Z.val \}$ $E \rightarrow Z E \cdot val = Z \cdot val$ ... $7 ^* 4 + 2n$? $9$ $6$ $10$ $11$
Consider the following syntax directed definition of any desk calculator:$L \rightarrow En \{ \text{print}(E.val) \}$$E \rightarrow E1 + 1 \{ E.val = E1.val + Z.val \}$$E...
756
views
commented
Jan 17, 2018
Compiler Design
tbb-cd-1
compiler-design
syntax-directed-translation
+
–
8
answers
14
GATE CSE 2006 | Question: 29
If $s$ is a string over $(0+1)^*$ then let $n_0(s)$ denote the number of $0$'s in $s$ and $n_1(s)$ the number of $1$'s in $s$. Which one of the following languages is not regular? $L=\left \{ s\in (0+1)^* \mid n_{0}(s) \text{ is a 3-digit prime } \right \}$ ... $L=\left \{ s\in (0+1)^*\mid n_{0}(s) \mod 7=n_{1}(s) \mod 5=0 \right \}$
If $s$ is a string over $(0+1)^*$ then let $n_0(s)$ denote the number of $0$’s in $s$ and $n_1(s)$ the number of $1$’s in $s$. Which one of the following languages i...
19.4k
views
commented
Jan 15, 2018
Theory of Computation
gatecse-2006
theory-of-computation
normal
regular-language
+
–
4
answers
15
GATE CSE 1998 | Question: 2.5
Let $L$ be the set of all binary strings whose last two symbols are the same. The number of states in the minimal state deterministic finite state automaton accepting $L$ is $2$ $5$ $8$ $3$
Let $L$ be the set of all binary strings whose last two symbols are the same. The number of states in the minimal state deterministic finite state automaton accepting $L$...
17.2k
views
commented
Jan 15, 2018
Theory of Computation
gate1998
theory-of-computation
finite-automata
normal
minimal-state-automata
+
–
6
answers
16
GATE IT 2004 | Question: 87
A TCP message consisting of $2100$ $bytes$ is passed to IP for delivery across two networks. The first network can carry a maximum payload of $1200$ $bytes$ per frame and the second network can carry a maximum payload of $400$ $bytes$ per frame, excluding ... second network for this transmission? $\text{40 bytes}$ $\text{80 bytes}$ $\text{120 bytes}$ $\text{160 bytes}$
A TCP message consisting of $2100$ $bytes$ is passed to IP for delivery across two networks. The first network can carry a maximum payload of $1200$ $bytes$ per frame an...
19.1k
views
comment edited
Jan 15, 2018
Computer Networks
gateit-2004
computer-networks
network-flow
normal
+
–
1
answer
17
MOCK TEST compiler design
Consider the given below grammar S→ cAd A→ bA | aA | b If a recursive descent parser is used for string “cbababd” then number of back trackin worst case is:
Consider the given below grammarS→ cAdA→ bA | aA | bIf a recursive descent parser is used for string “cbababd” then number of back trackin worst case is:
1.6k
views
commented
Jan 15, 2018
Compiler Design
compiler-design
grammar
parsing
numerical-answers
test-series
+
–
0
answers
18
Compiler : LL(k) and LR(k) grammer
Can LL(k) and LR(k) gammer has null and unit productions?
Can LL(k) and LR(k) gammer has null and unit productions?
1.1k
views
commented
Jan 15, 2018
Compiler Design
compiler-design
grammar
ll-parser
lr-parser
+
–
0
answers
19
Self Doubt IMP
Can Anyone please post the diagram which describes the relation between P, NP, NPSPACE, NP-Hard, EXPONENTIAL TIME etc.
Can Anyone please post the diagram which describes the relation between P, NP, NPSPACE, NP-Hard, EXPONENTIAL TIME etc.
255
views
commented
Jan 15, 2018
Algorithms
p-np-npc-nph
+
–
1
answer
20
Continuity
If the function f(x) defined by $\left\{\begin{matrix} \frac{log(1+ ax) - log(1-bx)}{x} &, if x \neq 0\\ k & ,if x = 0 \end{matrix}\right.$ is continuous at x = 0, then value of k is A) b - a B) a - b C) a + b D) -a - b
If the function f(x) defined by $\left\{\begin{matrix} \frac{log(1+ ax) - log(1-bx)}{x} &, if x \neq 0\\ k & ,if x = 0 \end{matrix}\right.$ is continuous at x = 0, then v...
957
views
commented
Jan 15, 2018
Calculus
calculus
continuity
+
–
1
answer
21
madeeasy
The value of the expression 1388 (mod 19), in the range 0 to 18, is Please explain Ans is given 9
The value of the expression 1388 (mod 19), in the range 0 to 18, is Please explain Ans is given 9
467
views
commented
Jan 15, 2018
1
answer
22
MINIMAL DFA
645
views
commented
Jan 14, 2018
Theory of Computation
theory-of-computation
minimal-state-automata
finite-automata
number-of-states
+
–
0
answers
23
Minimized DFA
What is the number of states in a minimal DFA accepting the language which contains all strings that either begin or end (or both) with 01 ? Assume alphabet set as {0,1} I got the answer but it was time consuming. Any hack on drawing its intuitive NFA ? as then conversion would be easier from NFA to DFA.
What is the number of states in a minimal DFA accepting the language which contains all strings that either begin or end (or both) with 01 ? Assume alphabet set as {0,1}...
487
views
commented
Jan 14, 2018
Theory of Computation
theory-of-computation
minimal-state-automata
+
–
1
answer
24
Number of States in minimal DFA
How many states will have the minimal DFA accepting the language L={w|wϵ{0,1}* and contains atleast one 0 and two 1's} a) 6 b)7 c)8 d)12
How many states will have the minimal DFA accepting the language L={w|wϵ{0,1}* and contains atleast one 0 and two 1's}a) 6b)7c)8d)12
656
views
commented
Jan 14, 2018
2
answers
25
DFA no of states
What is the min no. of states required in DFA which accepts all strings starting with 1 and whose decimal value is divisible by 7?
What is the min no. of states required in DFA which accepts all strings starting with 1 and whose decimal value is divisible by 7?
1.0k
views
commented
Jan 14, 2018
Theory of Computation
theory-of-computation
minimal-state-automata
finite-automata
+
–
1
answer
26
Counting No of States in the DFA
Minimum number of states required to construct DFA accepting language L={ w | w has even no of 0's and 1's and odd no of 3's } over alphabet { 0,1,2,3 } The answer given is 8. Should not the ans be 16? Using the ... 2 can take either one. Is it possible to get 8 states after minimization for the above DFA? Any simpler way of finding that logically?
Minimum number of states required to construct DFA accepting language L={ w | w has even no of 0's and 1's and odd no of 3's }over alphabet { 0,1,2,3 }The answer given is...
4.8k
views
commented
Jan 14, 2018
Theory of Computation
minimal-state-automata
finite-automata
theory-of-computation-
theory-of-computation
+
–
0
answers
27
gate forum test series
Answer given is : 5119 Please tell how to solve this question
Answer given is : 5119Please tell how to solve this question
236
views
commented
Jan 9, 2018
CO and Architecture
co-and-architecture
+
–
1
answer
28
IES 2018- Computer Networks
The technique for using one set of addresses inside a network and remapping those addresses to a different set of addresses that are seen outside the local network on the internet is called (a) network address translation (b) address resolution (c) network address mapping (d) virtual LAN
The technique for using one set of addresses inside a network and remapping those addresses to a different set of addresses that are seen outside the local network on the...
541
views
commented
Jan 9, 2018
Computer Networks
ies-2018
ies
+
–
2
answers
29
Database question : Transactions
1.4k
views
answered
Jan 9, 2018
Databases
databases
transaction-and-concurrency
conflict-serializable
serializability
+
–
2
answers
30
$\{\langle M \rangle \mid M$ is a TM and there exist an input whose length is less than 100, on which $M$ halts$\}$
My Question $\{\langle M \rangle \mid M$ is a TM and there exist an input whose length is less than 100, on which $M$ halts$\}$I have to check that it is Turing Recogniza...
4.4k
views
commented
Jan 8, 2018
Theory of Computation
theory-of-computation
turing-machine
decidability
rice-theorem
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register