Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged unsolved
3
votes
0
answers
1
HAL CS Exam
rsansiya111
316
views
rsansiya111
asked
Dec 19, 2021
CO and Architecture
unsolved
+
–
0
votes
1
answer
2
Geeks Quiz
rsansiya111
363
views
rsansiya111
asked
Dec 18, 2021
Mathematical Logic
unsolved
+
–
0
votes
1
answer
3
Geeks Quiz
S1 : Loss of ACK from client doesn’t effect on termination of connection. S2 : The client moves FIN-Wait-1 → FIN-Wait-2 → closed in the state machine on no packet loss. S3 : Loss of ACK from server restrict termination of connection. Options Are: S1 and S2 S2 and S3 S1 and S3 S2 only
S1 : Loss of ACK from client doesn’t effect on termination of connection. S2 : The client moves FIN-Wait-1 → FIN-Wait-2 → closed in the state machine on no packet l...
rsansiya111
381
views
rsansiya111
asked
Dec 18, 2021
Computer Networks
unsolved
+
–
0
votes
1
answer
4
Geeks Quiz
rsansiya111
417
views
rsansiya111
asked
Dec 18, 2021
Theory of Computation
unsolved
+
–
1
votes
2
answers
5
Geeks quiz
Options are: 100 200 50 400
Options are: 10020050400
rsansiya111
716
views
rsansiya111
asked
Dec 18, 2021
Spatial Aptitude
unsolved
+
–
1
votes
0
answers
6
GATE CSE 1988 | Question: 9ii
The code for the implementation of a sub-routine to convert positive numeric data from binary to appropriate character string in a $PDP-11$ like machine has been given below Note-that $SP$ is the stack pointer and $R_i$ represents $i^{th}$ ...
The code for the implementation of a sub-routine to convert positive numeric data from binary to appropriate character string in a $PDP-11$ like machine has been given be...
go_editor
519
views
go_editor
asked
Dec 19, 2016
CO and Architecture
gate1988
normal
descriptive
co-and-architecture
unsolved
+
–
1
votes
0
answers
7
GATE CSE 1988 | Question: 5i
A ROM has the following time parameters: Maximum Address to valid Data Output delay $= 30$ n sec. Maximum Chip Select to valid Data Output delay $= 20$ n sec. Maximum Data Hold time (after address change or after chip deselect) $= 10$ n ... negligible What is the maximum rate at which a CPU can continuously read data from this ROM? (Show your calculations step-by-step)
A ROM has the following time parameters:Maximum Address to valid Data Output delay $= 30$ n sec.Maximum Chip Select to valid Data Output delay $= 20$ n sec.Maximum Data H...
go_editor
527
views
go_editor
asked
Dec 19, 2016
CO and Architecture
gate1988
normal
descriptive
co-and-architecture
unsolved
+
–
1
votes
0
answers
8
GATE CSE 1988 | Question: 4i
An $8$-bit data path is to be set up using two $4$-bit ALU's and suitable multiplexers. The ALU's accept two operands $A$ and $B$ on which a total of $16$ operations can be performed. The operand $A$ is from one of two ... a bus. List the data path control signals, and estimate the minimum width of a signal microcode word needed for the generation of these signals.
An $8$-bit data path is to be set up using two $4$-bit ALU’s and suitable multiplexers. The ALU’s accept two operands $A$ and $B$ on which a total of $16$ operations ...
go_editor
542
views
go_editor
asked
Dec 19, 2016
CO and Architecture
gate1988
descriptive
co-and-architecture
data-path
unsolved
+
–
2
votes
0
answers
9
GATE CSE 1988 | Question: 2xi
A modern day machine typically has an atomic TEST AND SET instruction. Why?
A modern day machine typically has an atomic TEST AND SET instruction. Why?
go_editor
680
views
go_editor
asked
Dec 18, 2016
Operating System
gate1988
descriptive
operating-system
process-synchronization
unsolved
+
–
1
votes
1
answer
10
GATE CSE 1989 | Question: 10b
Consider the following grammar for variable declarations: <vardecl> $\rightarrow$ <vardecl><idlist> : <type>; <vardecl> $\rightarrow \in$ <idlist> $\rightarrow$ <idlist>, id <idlist> ... necessary. Make suitable assumptions regarding procedures operating on the symbol table; you need not elaborate upon these procedures.
Consider the following grammar for variable declarations:<vardecl $\rightarrow$ <vardecl><idlist : <type>;<vardecl $\rightarrow \in$<idlist $\rightarrow$ <idlist>, id<idl...
makhdoom ghaya
747
views
makhdoom ghaya
asked
Dec 5, 2016
Compiler Design
descriptive
gate1989
compiler-design
syntax-directed-translation
unsolved
+
–
1
votes
0
answers
11
GATE CSE 1989 | Question: 6b
In a certain computer system, there is special instruction implemented to call subroutines. The instruction is JSR Reg.Sub Microsequence: Temp ← Sub SP ← (SP)+2 (SP) ← (Reg) Reg ← (PC) PC ← (Temp) Where Temp is an internal CPU ... would implement co-routine using the JSR instruction. Show the control flow diagram and the contents of the stack before and after the call.
In a certain computer system, there is special instruction implemented to call subroutines. The instruction isJSR Reg.Sub Microsequence: Temp ← Sub SP ← (SP)+2 (SP) �...
makhdoom ghaya
471
views
makhdoom ghaya
asked
Dec 1, 2016
CO and Architecture
gate1989
descriptive
co-and-architecture
assembly
unsolved
+
–
6
votes
0
answers
12
GATE CSE 1989 | Question: 5b
It is required to implement a stack using bidirectional shift registers providing stack underflow and overflow detection capability. How many shift registers are needed for a stack capacity of $nk$-bit words? Show the schematic diagram of the implementation, clearly indicating all the data and control lines.
It is required to implement a stack using bidirectional shift registers providing stack underflow and overflow detection capability.How many shift registers are needed fo...
makhdoom ghaya
623
views
makhdoom ghaya
asked
Nov 30, 2016
Digital Logic
descriptive
gate1989
digital-logic
sequential-circuit
shift-registers
unsolved
+
–
3
votes
1
answer
13
GATE CSE 1989 | Question: 4-xi
Express the following list in terms of a linked list structure suitable for internal representation. $(((ab)c)d((e)))$
Express the following list in terms of a linked list structure suitable for internal representation.$(((ab)c)d((e)))$
makhdoom ghaya
809
views
makhdoom ghaya
asked
Nov 30, 2016
DS
gate1989
descriptive
data-structures
linked-list
unsolved
+
–
1
votes
1
answer
14
GATE CSE 1989 | Question: 4-vi
Consider the definition of macro $B,$ nested within the definition of a macro $A.$ Can a call to macro $B$ also appear within macro $A?$ If not, why not? If yes, explain if there are any restrictions.
Consider the definition of macro $B,$ nested within the definition of a macro $A.$ Can a call to macro $B$ also appear within macro $A?$ If not, why not? If yes, explain ...
makhdoom ghaya
748
views
makhdoom ghaya
asked
Nov 30, 2016
Compiler Design
gate1989
descriptive
compiler-design
macros
unsolved
+
–
1
votes
1
answer
15
GATE CSE 1990 | Question: 16b
Consider the grammar: $G_{2}$: Para $\rightarrow$ Sentence RP | Sentence RP $\rightarrow$ b Sentence RP | b Sentence Sentence $\rightarrow$ Word b Sentence | Word Word $\rightarrow$ letter * word | letter letter $\rightarrow$ ... to use a stack algorithm to parse the following string$id*id\;b\; id * id$ The parse should generate a rightmost derivation.
Consider the grammar:$G_{2}$:Para $\rightarrow$ Sentence RP | SentenceRP $\rightarrow$ b Sentence RP | b SentenceSentence $\rightarrow$ Word b Sentence | WordWord $\right...
makhdoom ghaya
682
views
makhdoom ghaya
asked
Nov 26, 2016
Compiler Design
gate1990
descriptive
compiler-design
grammar
unsolved
+
–
1
votes
0
answers
16
GATE CSE 1990 | Question: 14
The following algorithm (written in pseudo-pascal) work on an undirected graph $G$ program Explore (G) procedure Visit (u) begin if Adj (u) is not empty {comment:Adj (u) is the list of edges incident to u} then begin Select an edge from ... that each vertex can be accessed and removed from LIST in constant time. Also, show that all edges of the graph are traversed.
The following algorithm (written in pseudo-pascal) work on an undirected graph $G$program Explore (G) procedure Visit (u) begin if Adj (u) is not empty {comment:Adj (u) i...
makhdoom ghaya
649
views
makhdoom ghaya
asked
Nov 25, 2016
Algorithms
gate1990
descriptive
graph-algorithms
unsolved
+
–
1
votes
0
answers
17
GATE CSE 1990 | Question: 12a
Consider the following instance of the $0 -1$ Knapsack problem: $\max\; 6X_{1} + 11X_{2} + 16X_{3} + 21X_{4} + 26X_{5}$ Subject to $4X_{1} + 8X_{2} + 12X_{3} + 16X_{4} + 20 X_{5} < 32$ and $X_{i}=0$ ... nodes in the tree in the order in which they are expanded and for each node show the bound on the partial solutions and the decision which leads to that node.
Consider the following instance of the $0 -1$ Knapsack problem:$\max\; 6X_{1} + 11X_{2} + 16X_{3} + 21X_{4} + 26X_{5}$Subject to $4X_{1} + 8X_{2} + 12X_{3} + 16X_{4} + 20...
makhdoom ghaya
1.0k
views
makhdoom ghaya
asked
Nov 25, 2016
Algorithms
gate1990
descriptive
algorithms
branch-and-bound
unsolved
+
–
2
votes
0
answers
18
GATE CSE 1990 | Question: 9a
Assume that an instruction test-and-set (TS) has been provided in a machine whose function is as follows: 'the left most bit of the one byte operand is checked and accordingly the condition code (CC) is set to $1$ or $0$. After checking and setting the condition code, implement a critical region using this instruction.
Assume that an instruction test-and-set (TS) has been provided in a machine whose function is as follows: 'the left most bit of the one byte operand is checked and accord...
makhdoom ghaya
903
views
makhdoom ghaya
asked
Nov 24, 2016
Operating System
descriptive
gate1990
operating-system
process-synchronization
critical-section
unsolved
+
–
1
votes
0
answers
19
GATE CSE 1987 | Question: 3a
Design an $8 \times 8$ multiplier using five $4$-bits adders and $4$ ROM's each programmed to realise $4 \times 4$ multiplier.
Design an $8 \times 8$ multiplier using five $4$-bits adders and $4$ ROM's each programmed to realise $4 \times 4$ multiplier.
makhdoom ghaya
680
views
makhdoom ghaya
asked
Nov 11, 2016
Digital Logic
gate1987
digital-logic
adder
descriptive
unsolved
+
–
0
votes
0
answers
20
GATE CSE 1991 | Question: 07b
It is required to design a hardwired controller to handle the fetch cycle of a single address CPU with a $16$ bit instruction-length. The effective address of an indexed instruction should be derived in the fetch cycle itself. Assume ... bits of an instruction constitute the operand field. Draw the logic schematic of the hardwired controller including the data path.
It is required to design a hardwired controller to handle the fetch cycle of a single address CPU with a $16$ bit instruction-length. The effective address of an indexed ...
go_editor
818
views
go_editor
asked
Apr 24, 2016
CO and Architecture
gate1991
co-and-architecture
control-unit
hardwired-controller
normal
unsolved
descriptive
+
–
2
votes
0
answers
21
GATE CSE 1992 | Question: 05,b
Three devices $A, B$ and $C$ are connected to the bus of a computer, input/output transfers for all three devices use interrupt control. Three interrupt request lines INTR$1,$ INTR$2$ and INTR$3$ are available with priority of INTR$1 >$ priority ... priority logic, using an interrupt mask register, in which Priority of $A$ > Priority of $B$ > Priority of $C.$
Three devices $A, B$ and $C$ are connected to the bus of a computer, input/output transfers for all three devices use interrupt control. Three interrupt request lines INT...
Arjun
839
views
Arjun
asked
Dec 19, 2015
CO and Architecture
gate1992
co-and-architecture
interrupts
normal
descriptive
unsolved
+
–
5
votes
0
answers
22
GATE CSE 1994 | Question: 23
Suppose we have a computer with single register and only three instructions given below: ... $T \rightarrow (E)\mid id$ Write a syntax directed translation to generate code using this grammar for the computer described above.
Suppose we have a computer with single register and only three instructions given below:$$\begin{array}{ll} \text{LOAD addren} & \text{; load register} \\ \text{} & \te...
Kathleen
1.0k
views
Kathleen
asked
Oct 5, 2014
Compiler Design
gate1994
compiler-design
grammar
syntax-directed-translation
descriptive
unsolved
+
–
4
votes
1
answer
23
GATE CSE 1997 | Question: 23
The language $L,$ defined by the following grammar, allows use of real or integer data in expressions and assignment statements. <assign-stmt> :: <LHS> := <E> <E> ::= <E> + <T>|<T> <T> :: ... that the name and type of variable can be obtained by making the function calls' give_name $(id)$ and give_type $(id)$ respectively.
The language $L,$ defined by the following grammar, allows use of real or integer data in expressions and assignment statements.<assign-stmt :: <LHS := <E <E ::...
Kathleen
1.4k
views
Kathleen
asked
Sep 29, 2014
Compiler Design
gate1997
compiler-design
syntax-directed-translation
normal
descriptive
unsolved
+
–
2
votes
0
answers
24
GATE CSE 1991 | Question: 07a
It is required to design a hardwired controller to handle the fetch cycle of a single address CPU with a $16$ bit instruction-length. The effective address of an indexed instruction should be derived in the fetch cycle itself. ... bits of an instruction constitute the operand field. Give the register transfer sequence for realizing the above instruction fetch cycle.
It is required to design a hardwired controller to handle the fetch cycle of a single address CPU with a $16$ bit instruction-length. The effective address of an indexed ...
Kathleen
699
views
Kathleen
asked
Sep 12, 2014
CO and Architecture
gate1991
co-and-architecture
control-unit
hardwired-controller
normal
unsolved
descriptive
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register