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 saykatamkeen
1
answer
1
GATE CSE 2020 | Question: 35
Consider the following five disk five disk access requests of the form (request id, cylinder number) that are present in the disk scheduler queue at a given time. $(P, 155), (Q,85), (R,110),(S, 30), (T,115)$ Assume the head is positioned at ... ,but before $T$. The head reverses its direction of movement between servicing of $Q$ and $P$. $R$ is serviced before $P$.
Consider the following five disk five disk access requests of the form (request id, cylinder number) that are present in the disk scheduler queue at a given time.$(P, 155...
5.3k
views
commented
Nov 11, 2021
Operating System
gatecse-2020
operating-system
disk-scheduling
2-marks
+
–
3
answers
2
GATE ACADEMY WORKBOOK QUESTION PROBABILITY CHAPTER
How many numbers between 0 and 1 million can be formed using 0,7,8
How many numbers between 0 and 1 million can be formed using 0,7,8
956
views
commented
Sep 17, 2021
1
answer
3
all tests and quiz are paid or not
all test is paid or not
all test is paid or not
353
views
commented
Sep 12, 2021
3
answers
4
Is CLR(1) grammar and LR(1) grammar are same?
Whether LR(1) grammar is same as that of CLR(1) grammar. If yes then please explain and if not then what is the difference between them?
Whether LR(1) grammar is same as that of CLR(1) grammar. If yes then please explain and if not then what is the difference between them?
12.6k
views
commented
Sep 8, 2021
Compiler Design
compiler-design
parsing
+
–
1
answer
5
GATE CSE 1994 | Question: 17b
State whether the following statements are True or False with reasons for your answer: A two pass assembler uses its machine opcode table in the first pass of assembly.
State whether the following statements are True or False with reasons for your answer:A two pass assembler uses its machine opcode table in the first pass of assembly.
2.4k
views
commented
Sep 8, 2021
Compiler Design
gate1994
compiler-design
normal
assembler
true-false
descriptive
+
–
3
answers
6
GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 3
Which of the following statements is FALSE? Any DCFL has an equivalent grammar that can be parsed by a SLR(1) parser with end string delimiter Languages of grammars parsed by LR(2) parsers is a strict super set of the languages of ... LL(1) parsers There is no DCFL which is not having a grammar that can be parsed by a LR(1) parser
Which of the following statements is FALSE?Any DCFL has an equivalent grammar that can be parsed by a SLR(1) parser with end string delimiterLanguages of grammars parsed ...
3.2k
views
commented
Sep 8, 2021
Compiler Design
go-cd-1
parsing
+
–
1
answer
7
this question asked in gate 2017 :iit roorkee (EC,BT,PI IN SET -1)
there are 3 Indians and 3 Chinese in a group of 6 people .how many subgroups of this group can we choose so that every subgroup has at least one Indian? please help me out in this question also explain how to handle atleast case
there are 3 Indians and 3 Chinese in a group of 6 people .how many subgroups of this group can we choose so that every subgroup has at least one Indian?please help me out...
461
views
commented
Sep 8, 2021
2
answers
8
UGC NET CSE | December 2019 | Part 2 | Question: 4
What are the greatest lower bound $\text{(GLB)}$ and the least upper bound $\text{(LUB)}$ of the sets $A= \{ 3, 9, 12 \}$ and $B=\{1,2,4,5,10 \}$ if they exist in poset $(z^+, / )$? $\text{A(GLB - 3, LUB - 36); B(GLB - 1, LUB - 20)}$ ... $\text{A(GLB - 1, LUB - 36); B(GLB - 2, LUB - 20)}$ $\text{A(GLB - 1, LUB - 12); B(GLB - 2, LUB - 10)}$
What are the greatest lower bound $\text{(GLB)}$ and the least upper bound $\text{(LUB)}$ of the sets $A= \{ 3, 9, 12 \}$ and $B=\{1,2,4,5,10 \}$ if they exist in poset $...
5.1k
views
answered
Sep 8, 2021
Others
ugcnetcse-dec2019-paper2
+
–
1
answer
9
Structure of control word in control memory
What is the structure of control word for Horizantal microprogrammed control unit? <Conditional branch bit, flag bits, contol field, next address> OR <log(Conditional branch bits), log(flag bits), contol field, next address>
What is the structure of control word for Horizantal microprogrammed control unit?<Conditional branch bit, flag bits, contol field, next address ...
643
views
commented
Sep 8, 2021
CO and Architecture
control-unit
horizontal-microprogramming
co-and-architecture
+
–
6
answers
10
GATE IT 2006 | Question: 20
Which of the following statement(s) is TRUE? A hash function takes a message of arbitrary length and generates a fixed length code. A hash function takes a message of fixed length and generates a code of variable length. A hash function may give the same hash value for distinct messages. I only II and III only I and III only II only
Which of the following statement(s) is TRUE?A hash function takes a message of arbitrary length and generates a fixed length code.A hash function takes a message of fixed...
12.1k
views
answered
Sep 7, 2021
DS
gateit-2006
data-structures
hashing
normal
+
–
1
answer
11
UGC NET CSE | December 2019 | Part 2 | Question: 6
The weight of minimum spanning tree in graph $G$, calculated using Kruskal’s algorithm is: $14$ $15$ $17$ $18$
The weight of minimum spanning tree in graph $G$, calculated using Kruskal’s algorithm is:$14$$15$$17$$18$
2.0k
views
commented
Jul 11, 2021
Others
ugcnetcse-dec2019-paper2
algorithms
minimum-spanning-tree
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register