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
Answers by Jevi
1
votes
1
GATE CSE 2017 Set 2 | Question: 1
The representation of the value of a $16\text{-bit}$ unsigned integer $X$ in hexadecimal number system is $\textsf{BCA9}$. The representation of the value of $X$ in octal number system is $571244$ $736251$ $571247$ $136251$
The representation of the value of a $16\text{-bit}$ unsigned integer $X$ in hexadecimal number system is $\textsf{BCA9}$. The representation of the value of $X$ in octal...
6.9k
views
answered
Feb 14, 2017
Digital Logic
gatecse-2017-set2
digital-logic
number-representation
+
–
4
votes
2
GATE CSE 2017 Set 2 | Question: 05
Match the following according to input (from the left column) to the compiler phase (in the right column) that processes it: ... $\text{P-iii; Q-iv; R-i; S-ii}$ $\text{P-i; Q-iv; R-ii; S-iii}$
Match the following according to input (from the left column) to the compiler phase (in the right column) that processes it:$$\begin{array}{|l|l|}\hline \text{P. Syntax t...
9.7k
views
answered
Feb 14, 2017
Compiler Design
gatecse-2017-set2
compiler-design
match-the-following
compilation-phases
easy
+
–
1
votes
3
MadeEasy Test Series: Operating System - Process Schedule
Consider a uni-processor system executing four tasks T1, T2, T3, T4 each of which is composed of 10 sequence of jobs which arrive periodically at interval of 2, 4, 8, 16 ms resp. The priority of each task is directly ... Given all tasks initially arrive at t=0, the 2nd instance of T3 completes its execution at the end of ______ ms.
Consider a uni-processor system executing four tasks T1, T2, T3, T4 each of which is composed of 10 sequence of jobs which arrive periodically at interval of 2, 4, 8, 16 ...
1.0k
views
answered
Dec 19, 2016
Operating System
made-easy-test-series
operating-system
process-scheduling
+
–
1
votes
4
Test by Bikram | Compiler Design | Test 1 | Question: 30
Consider the following grammar: $S \rightarrow L = P \mid P$ $L \rightarrow ^*P \mid id$ $P \rightarrow L$ The above grammar is: Ambiguous SLR(1) LALR(1) None of the above
Consider the following grammar:$S \rightarrow L = P \mid P$$L \rightarrow ^*P \mid id$$P \rightarrow L$The above grammar is:AmbiguousSLR(1)LALR(1)None of the above
702
views
answered
Dec 14, 2016
Compiler Design
tbb-cd-1
compiler-design
grammar
+
–
1
votes
5
How to Calculate the Lead and Last ? A very big doubt please clear
I have only heard about FIRST and FOLLOW . How to Calculate LEAD and LAST and TRAILING ..?
I have only heard about FIRST and FOLLOW .How to Calculate LEAD and LAST and TRAILING ..?
768
views
answered
Dec 9, 2016
Compiler Design
compiler-design
parsing
first-and-follow
+
–
0
votes
6
ME - CD
976
views
answered
Dec 5, 2016
Compiler Design
gate2017
compiler-design
parsing
made-easy-test-series
numerical-answers
+
–
2
votes
7
ISRO2011-38
A fast wide SCSI-II disk drive spins at 7200 RPM, has a sector size of 512 bytes, and holds 160 sectors per track. Estimate the sustained transfer rate of this drive 576000 Kilobytes / sec 9600 Kilobytes / sec 4800 Kilobytes / sec 19200 Kilobytes / sec
A fast wide SCSI-II disk drive spins at 7200 RPM, has a sector size of 512 bytes, and holds 160 sectors per track. Estimate the sustained transfer rate of this drive57600...
4.8k
views
answered
Jun 19, 2016
Operating System
isro2011
operating-system
disk
+
–
0
votes
8
English Terminology
Do we reduce PCP problem to our problem X to show that X is undecidable OR we reduce the problem X to PCP to show X's undecidability ?. A question has confused me in the terminology.
Do we reduce PCP problem to our problem X to show that X is undecidable OR we reduce the problem X to PCP to show X's undecidability ?. A question has confused me in the...
646
views
answered
Jan 4, 2016
Theory of Computation
theory-of-computation
decidability
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register