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
Questions by umang_16
0
votes
0
answers
1
General Query regarding Interview
I have been shortlisted for CDS interview at IISc. They have suggested some paper reading but when I google those papers all I get is abstract and introduction. Is this what I am supposed to prepare for interview ? Or there is some other ... research papers ? What should be kept in mind and anything regarding it. Because I don't have any experience in it.
I have been shortlisted for CDS interview at IISc.They have suggested some paper reading but when I google those papers all I get is abstract and introduction.Is this wha...
1.1k
views
asked
May 9, 2017
IISc/IITs
general
iisc-interview
+
–
0
votes
0
answers
2
Made Easy CO
Suppose that in 1000 memory references there are 40 misses in L1 and 20 misses in L2 cache. Assume miss penalty from L2 to memory is 100 cycles. The hit time of L2 is 10 clock cycles. The hit time of L1 is 1 clock cycle. What is the average memory access time ?
Suppose that in 1000 memory references there are 40 misses in L1 and 20 misses in L2 cache. Assume miss penalty from L2 to memory is 100 cycles. The hit time of L2 is 10 ...
367
views
asked
Dec 26, 2016
1
votes
2
answers
3
Compiler
Consider the grammar given below. It is E -> T+E | T T -> a a. SLR(1) but not LL(1) b. Not an operator grammar c. Ambiguous d. None of these
Consider the grammar given below. It isE - T+E | TT - aa. SLR(1) but not LL(1)b. Not an operator grammarc. Ambiguousd. None of these
644
views
asked
Dec 16, 2016
Compiler Design
compiler-design
parsing
ambiguous-grammar
+
–
2
votes
3
answers
4
TOC Turing Machine
Consider the following languages L1 = {< M, q > |M is a turing machine that visits state q on some input within 10 steps} L2 = {< M > |M is a turing machine, |M | < 100 where |M | is number of states in machine} Which of ... L1 nor L2 is decidable In L2, if the states are unreachable, then will it be possible to detect whether machine has less than 100 states ???
Consider the following languagesL1 = {< M, q |M is a turing machine that visits state q on some input within 10 steps}L2 = {< M |M is a turing machine, |M | < 100 where...
1.9k
views
asked
Nov 15, 2016
Theory of Computation
theory-of-computation
turing-machine
decidability
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register