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 manikantsharma
6
answers
1
GATE CSE 2005 | Question: 79
Consider the following data path of a $\text{CPU}.$ The $\text{ALU},$ the bus and all the registers in the data path are of identical size. All operations including incrementation of the $\text{PC}$ and the $\text{GPRs}$ are to be carried out in the ... $2$ $3$ $4$ $5$
Consider the following data path of a $\text{CPU}.$The $\text{ALU},$ the bus and all the registers in the data path are of identical size. All operations including increm...
24.5k
views
commented
Dec 16, 2022
CO and Architecture
gatecse-2005
co-and-architecture
machine-instruction
data-path
normal
+
–
2
answers
2
GO Classes Test Series 2023 | Operating Systems | Test 4 | Question: 8
Given the following piece of code main(int argc, char ** argv) { forkthem(5) } void forkthem(int n) { if(n > 0) { fork(); forkthem(n-1); } } How many processes are created if the above piece of code is run? (Hint: It may be easier to solve this problem by induction/recursion.)
Given the following piece of codemain(int argc, char argv) { forkthem(5) } void forkthem(int n) { if(n 0) { fork(); forkthem(n-1); } }How many processes are created if...
413
views
commented
Dec 12, 2022
Operating System
goclasses2024-os-4-weekly-quiz
numerical-answers
goclasses
operating-system
fork-system-call
2-marks
+
–
3
answers
3
GATE CSE 2022 | Question: 31
Consider three floating point numbers $\textit{A, B}$ and $\textit{C}$ stored in registers $\text{R}_{\text{A}}, \text{R}_{\text{B}}$ and $\text{R}_{\text{C}},$ respectively as per $\textsf{IEEE-754}$ single precision floating point format. The $\text{32-bit}$ content stored in ... $\textit{A + C} = 0$ $\textit{C = A + B}$ $\textit{B =3C}$ $\textit{(B - C)} > 0$
Consider three floating point numbers $\textit{A, B}$ and $\textit{C}$ stored in registers $\text{R}_{\text{A}}, \text{R}_{\text{B}}$ and $\text{R}_{\text{C}},$ respectiv...
8.6k
views
answered
Dec 6, 2022
Digital Logic
gatecse-2022
digital-logic
number-system
number-representation
2-marks
+
–
2
answers
4
selfdoubt
if concatenation of two languages $L_1\ and\ L_2(L_1.L_2)$ is regular then what can we say about $L_1\ and\ L_2 $ ?? is there any possibility of $L_1=nonregular\ ,\ L_2=nonregular \ $ ??
if concatenation of two languages $L_1\ and\ L_2(L_1.L_2)$ is regular then what can we say about $L_1\ and\ L_2 $ ??is there any possibility of $L_1=nonregular\ ,\ L_2=...
1.5k
views
answered
Sep 23, 2022
Theory of Computation
regular-language
+
–
1
answer
5
Turing Machine Rice's Theorem
L = {M|M is a TM that accepts all even numbers} For the above language i can have Tyes machine which has all even numbers.And Tno as machine whose language is empty.So i can say it is undecidable. But to show it is Not RE. What ... am assuming here that the property of the language as "Only all even numbers",i guess the same has been given in the question.
L = {M|M is a TM that accepts all even numbers}For the above language i can have Tyes machine which has all even numbers.And Tno as machine whose language is empty.So i c...
1.3k
views
answered
Sep 16, 2022
Theory of Computation
decidability
rice-theorem
theory-of-computation
turing-machine
self-doubt
+
–
1
answer
6
Rice's Theorem
Example# 3 from Part-1 Rice's Theorem from https://gatecse.in/rices-theorem/ states as follows (3) L(M) is recognized by a TM having even number of states Sol: This is a trivial property. This set equals the set of recursively enumerable languages. ... then? Can someone give me an example for which TYES and TNO cannot be found and let me know if my approach is correct ?
Example# 3 from Part-1 Rice's Theorem from https://gatecse.in/rices-theorem/ states as follows (3) L(M) is recognized by a TM having even number of statesSol: This is a t...
763
views
answered
Sep 16, 2022
Theory of Computation
decidability
rice-theorem
theory-of-computation
self-doubt
+
–
4
answers
7
GATE CSE 1989 | Question: 4-vii
In the graph shown above, the depth-first spanning tree edges are marked with a $’ T’$. Identify the forward, backward, and cross edges.
In the graph shown above, the depth-first spanning tree edges are marked with a $’ T’$. Identify the forward, backward, and cross edges.
2.8k
views
comment edited
Sep 11, 2022
Algorithms
gate1989
descriptive
algorithms
graph-algorithms
spanning-tree
depth-first-search
+
–
1
answer
8
Kruskal Algorithm
Complexity of Kruskal's algorithm for finding the minimum spanning tree of an undirected graph containing n vertices and m edges if the edges are unsorted is _______ ______________________________________________________________________________ If elements are sorted we do with Union Find algo with ... is $log^{*}V$ Now from here can we derive it for unsorted edges? for ref: here
Complexity of Kruskal’s algorithm for finding the minimum spanning tree of an undirected graph containing n vertices and m edges if the edges are unsorted is __________...
1.6k
views
commented
Sep 4, 2022
Algorithms
algorithms
minimum-spanning-tree
kruskals-algorithm
+
–
7
answers
9
GATE IT 2006 | Question: 46
Which of the following is the correct decomposition of the directed graph given below into its strongly connected components? $\left \{ P, Q, R, S \right \}, \left \{ T \right \},\left \{ U \right \}, \left \{ V \right \}$ ... $\left \{ P, Q, R, S, T, U, V \right \}$
Which of the following is the correct decomposition of the directed graph given below into its strongly connected components?$\left \{ P, Q, R, S \right \}, \left \{ T \...
11.9k
views
commented
Sep 3, 2022
Algorithms
gateit-2006
algorithms
graph-algorithms
normal
+
–
6
answers
10
GATE CSE 1996 | Question: 2.8
If $L_1$ and $L_2$ are context free languages and $R$ a regular set, one of the languages below is not necessarily a context free language. Which one? $L_1.L_2$ $L_1 \cap L_2$ $L_1 \cap R$ $L_1 \cup L_2$
If $L_1$ and $L_2$ are context free languages and $R$ a regular set, one of the languages below is not necessarily a context free language. Which one?$L_1.L_2$$L_1 \cap L...
6.4k
views
answered
Aug 27, 2022
Theory of Computation
gate1996
theory-of-computation
context-free-language
easy
+
–
8
answers
11
GATE CSE 1995 | Question: 2.20
Which of the following definitions below generate the same language as $L$, where $L=\{x^ny^n \text{ such that } n\geq 1 \}$? $E \rightarrow xEy\mid xy$ $x y \mid (x^+xyy^+$) $x^+y^+$ I only I and II II and III II only
Which of the following definitions below generate the same language as $L$, where $L=\{x^ny^n \text{ such that } n\geq 1 \}$?$E \rightarrow xEy\mid xy$$x y \mid (x^+xyy^+...
10.7k
views
answered
Aug 27, 2022
Theory of Computation
gate1995
theory-of-computation
easy
context-free-language
+
–
4
answers
12
GATE CSE 1992 | Question: 02,xix
Context-free languages are: closed under union closed under complementation closed under intersection closed under Kleene closure
Context-free languages are:closed under unionclosed under complementationclosed under intersectionclosed under Kleene closure
4.9k
views
answered
Aug 27, 2022
Theory of Computation
gate1992
context-free-language
theory-of-computation
normal
multiple-selects
+
–
4
answers
13
GATE CSE 1987 | Question: 2k
State whether the following statements are TRUE or FALSE: The intersection of two CFL's is also a CFL.
State whether the following statements are TRUE or FALSE:The intersection of two CFL's is also a CFL.
3.4k
views
answered
Aug 27, 2022
Theory of Computation
gate1987
theory-of-computation
context-free-language
true-false
+
–
5
answers
14
GATE CSE 1996 | Question: 2.23
Consider the following state table for a sequential machine. The number of states in the minimized machine will be ... $4$ $3$ $2$ $1$
Consider the following state table for a sequential machine. The number of states in the minimized machine will be$$\begin{array}{|l|l|ll|}\hline \text{} & \text{} & \tex...
13.0k
views
answered
Aug 26, 2022
Digital Logic
gate1996
normal
finite-automata
+
–
12
answers
15
GATE CSE 2003 | Question: 14
The regular expression $0^*(10^*)^*$ denotes the same set as $(1^*0)^*1^*$ $0+(0+10)^*$ $(0+1)^*10(0+1)^*$ None of the above
The regular expression $0^*(10^*)^*$ denotes the same set as$(1^*0)^*1^*$$0+(0+10)^*$$(0+1)^*10(0+1)^*$None of the above
19.3k
views
answered
Aug 20, 2022
Theory of Computation
gatecse-2003
theory-of-computation
regular-expression
easy
+
–
5
answers
16
GATE CSE 2000 | Question: 1.4
Let $S$ and $T$ be languages over $\Sigma=\{a,b\}$ represented by the regular expressions $(a+b^*)^*$ and $(a+b)^*$, respectively. Which of the following is true? $S \subset T$ $T \subset S$ $S = T$ $S \cap T = \phi$
Let $S$ and $T$ be languages over $\Sigma=\{a,b\}$ represented by the regular expressions $(a+b^*)^*$ and $(a+b)^*$, respectively. Which of the following is true?$S \subs...
11.5k
views
answered
Aug 20, 2022
Theory of Computation
gatecse-2000
theory-of-computation
regular-expression
easy
+
–
4
answers
17
GATE CSE 1998 | Question: 1.9
If the regular set $A$ is represented by $A = (01 + 1)^*$ and the regular set $B$ is represented by $B = \left(\left(01\right)^*1^*\right)^*$, which of the following is true? $A \subset B$ $B \subset A$ $A$ and $B$ are incomparable $A = B$
If the regular set $A$ is represented by $A = (01 + 1)^*$ and the regular set $B$ is represented by $B = \left(\left(01\right)^*1^*\right)^*$, which of the following is t...
11.3k
views
answered
Aug 20, 2022
Theory of Computation
gate1998
theory-of-computation
regular-expression
normal
+
–
9
answers
18
GATE CSE 1991 | Question: 17,b
Let $L$ be the language of all binary strings in which the third symbol from the right is a $1$. Give a non-deterministic finite automaton that recognizes $L$. How many states does the minimized equivalent deterministic finite automaton have? Justify your answer briefly?
Let $L$ be the language of all binary strings in which the third symbol from the right is a $1$. Give a non-deterministic finite automaton that recognizes $L$. How many s...
13.6k
views
commented
Aug 3, 2022
Theory of Computation
gate1991
theory-of-computation
finite-automata
normal
descriptive
+
–
1
answer
19
Zeal Test Series 2019: Theory of Computation - Grammar
Consider the following statements. S1: An unambiguous left recursive grammar must be CLR(1). S2: A DCFG may or may not be LL(1). Select the correct option: 1.Both S1 and S2 are true. 2.Both S1 and S2 are false. 3. S1 is false and S2 is true. 4.S1 is true and S2 is false. According to me S1 false and S2 true but answer given 1
Consider the following statements.S1: An unambiguous left recursive grammar must be CLR(1).S2: A DCFG may or may not be LL(1).Select the correct option:1.Both S1 and S2 a...
664
views
answered
Jul 31, 2022
Theory of Computation
zeal
theory-of-computation
grammar
zeal2019
+
–
2
answers
20
Grammar
Can set of terminal be empty in a grammar? Is epsilon (null string) counted as a terminal symbol?
Can set of terminal be empty in a grammar? Is epsilon (null string) counted as a terminal symbol?
1.7k
views
answered
Jul 31, 2022
Theory of Computation
theory-of-computation
grammar
+
–
6
answers
21
GATE CSE 2016 Set 1 | Question: 24
Which one of the following protocols is NOT used to resolve one form of address to another one? $\textsf{DNS}$ $\textsf{ARP}$ $\textsf{DHCP}$ $\textsf{RARP}$
Which one of the following protocols is NOT used to resolve one form of address to another one?$\textsf{DNS}$$\textsf{ARP}$$\textsf{DHCP}$$\textsf{RARP}$
18.3k
views
answered
Jul 24, 2022
Computer Networks
gatecse-2016-set1
computer-networks
network-protocols
normal
+
–
4
answers
22
Fragmentation
Fragmentation is done by Network layer or Transport Layer ?
Fragmentation is done by Network layer or Transport Layer ?
1.6k
views
answered
Jul 23, 2022
Computer Networks
fragmentation
+
–
5
answers
23
#TCP/IP
What is the maximum size of data that the Network layer can forward to the Data link layer including header data? Should it be 65535B or 1500B?
What is the maximum size of data that the Network layer can forward to the Data link layer including header data? Should it be 65535B or 1500B?
2.7k
views
answered
Jul 23, 2022
2
answers
24
GATE CSE 2022 | Question: 47
Consider a network with three routers $\text{P, Q, R}$ shown in the figure below. All the links have cost of unity. The routers exchange distance vector routing information and have converged on the routing tables, after which the link $\text{Q-R}$ ... off to one decimal place) between $\text{P}$ and $\text{Q},$ leading to count-to-infinity problem, is _______________.
Consider a network with three routers $\text{P, Q, R}$ shown in the figure below. All the links have cost of unity.The routers exchange distance vector routing informatio...
9.8k
views
commented
Jul 20, 2022
Computer Networks
gatecse-2022
numerical-answers
computer-networks
routing
distance-vector-routing
2-marks
+
–
8
answers
25
GATE CSE 2016 Set 1 | Question: 1
Let $p, q, r, s$ represents the following propositions. $p:x\in\left\{8, 9, 10, 11, 12\right\}$ $q:$ $x$ is a composite number. $r:$ $x$ is a perfect square. $s:$ $x$ is a prime number. The integer $x\geq2$ which satisfies $\neg\left(\left(p\Rightarrow q\right) \wedge \left(\neg r \vee \neg s\right)\right)$ is ____________.
Let $p, q, r, s$ represents the following propositions.$p:x\in\left\{8, 9, 10, 11, 12\right\}$$q:$ $x$ is a composite number.$r:$ $x$ is a perfect square.$s:$ $x$ is a pr...
13.1k
views
commented
Jul 17, 2022
Mathematical Logic
gatecse-2016-set1
mathematical-logic
normal
numerical-answers
propositional-logic
+
–
5
answers
26
GATE CSE 2016 Set 2 | Question: 53
A network has a data transmission bandwidth of $20 \times 10^{6}$ bits per second. It uses CSMA/CD in the MAC layer. The maximum signal propagation time from one node to another node is $40$ microseconds. The minimum size of a frame in the network is __________ bytes.
A network has a data transmission bandwidth of $20 \times 10^{6}$ bits per second. It uses CSMA/CD in the MAC layer. The maximum signal propagation time from one node to ...
9.3k
views
answered
Jul 14, 2022
Computer Networks
gatecse-2016-set2
computer-networks
csma-cd
numerical-answers
normal
+
–
9
answers
27
GATE CSE 2000 | Question: 1.16
Aliasing in the context of programming languages refers to multiple variables having the same memory location multiple variables having the same value multiple variables having the same identifier multiple uses of the same variable
Aliasing in the context of programming languages refers tomultiple variables having the same memory locationmultiple variables having the same valuemultiple variables hav...
24.8k
views
answered
Jul 8, 2022
Programming in C
gatecse-2000
programming
easy
aliasing
+
–
2
answers
28
GATE CSE 1989 | Question: 4-v
Is the following code template for the if-then-else statement correct? if not, correct it. $\text{if} \text{ expression then statement } 1$ $\text{else statement }2$ Template: Code for expression (*result in $E, E > O$ indicates true *) Branch on $E > O$ to $L1$ Code for statement $1$ $L1$: Code for statement $2$
Is the following code template for the if-then-else statement correct? if not, correct it.$\text{if} \text{ expression then statement } 1$$\text{else statement }2$Templat...
1.9k
views
answered
Jul 4, 2022
Compiler Design
descriptive
gate1989
compiler-design
intermediate-code
+
–
7
answers
29
GATE CSE 2014 Set 1 | Question: 55
Consider two processors $P_1$ and $P_2$ executing the same instruction set. Assume that under identical conditions, for the same input, a program running on $P_2$ takes $\text{25%}$ less time but incurs $\text{20%}$ more CPI (clock cycles per instruction) ... If the clock frequency of $P_1$ is $\text{1GHZ}$, then the clock frequency of $P_2$ (in GHz) is ______.
Consider two processors $P_1$ and $P_2$ executing the same instruction set. Assume that under identical conditions, for the same input, a program running on $P_2$ takes $...
18.1k
views
commented
May 9, 2022
CO and Architecture
gatecse-2014-set1
co-and-architecture
numerical-answers
normal
speedup
+
–
6
answers
30
GATE CSE 2014 Set 1 | Question: 9
A machine has a $32\text{-bit}$ architecture, with $1\text{-word}$ long instructions. It has $64$ registers, each of which is $32$ bits long. It needs to support $45$ instructions, which have an immediate operand in ... to two register operands. Assuming that the immediate operand is an unsigned integer, the maximum value of the immediate operand is ____________
A machine has a $32\text{-bit}$ architecture, with $1\text{-word}$ long instructions. It has $64$ registers, each of which is $32$ bits long. It needs to support $45$ ins...
18.4k
views
answered
May 4, 2022
CO and Architecture
gatecse-2014-set1
co-and-architecture
machine-instruction
instruction-format
numerical-answers
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register