Register
Filter

Questions by Shubhanshu

3 votes
1 answer
101
Identify Tokens
Calculate total no of Tokens and also determine there types:- a) a9997.7b884.cddf2.77 b) 74>><<2gfh0012 c) a>=ab.785!lklk d) a9997.b884.100intcddfloat2.77 Q2) Differentiate between Tokens, Lexeme and Pattern with the help of example Eg. int a;
Calculate total no of Tokens and also determine there types:-a) a9997.7b884.cddf2.77b) 74>><<2gfh0012c) a>=ab.785!lklkd) a9997.b884.100intcddfloat2.77Q2) Differentia...
2 votes
0 answers
102
Prefix property and DPDA
Construct the DPDA with empty stack and final state method for the language L = ${ a^n b^n / n>= 0}$.
Construct the DPDA with empty stack and final state method for the language L = ${ a^n b^n / n>= 0}$.
2 votes
2 answers
110
Block Nested Loop Join
Consider a relation R with 2000 records and relation S with 500 records. Size of each record is 5 Byte and block size is 100 Byte, then minimum number of block access that are needed block nested loop join. I think its answer should be 2525.
Consider a relation R with 2000 records and relation S with 500 records. Size of each record is 5 Byte and block size is 100 Byte, then minimum number of block access tha...
0 votes
2 answers
111
TCP 3 Way Handshaking
In TCP 3 way handshaking mechanism why the data is not started being transmitting from the 3rd step itself I.e. 1. A-> B / SYN FROM A 2. A<-B / SYN AND ACK FROM B 3. A-> B / ACK FROM A.
In TCP 3 way handshaking mechanism why the data is not started being transmitting from the 3rd step itself I.e.1. A- B / SYN FROM A2. A<-B / SYN AND ACK FROM B3. A- B / A...
8 votes
1 answer
113
Deadlock and Unsafe state
Why unsafe state not leads to deadlock? Please don't redirect to any other link. Explain it by taking an example.
Why unsafe state not leads to deadlock?Please don't redirect to any other link. Explain it by taking an example.
1 votes
0 answers
114
OS: Function of Dispatcher
Q1) Is it true that dispatcher always have one process to dispatch on to the cpu. Q2) Dispatcher function - "Jumping to the proper location in the user program to reatart that program". What does it mean?
Q1) Is it true that dispatcher always have one process to dispatch on to the cpu.Q2) Dispatcher function - "Jumping to the proper location in the user program to reatart ...
2 votes
1 answer
116
Deadlock Conditions
Q1> What are necessary and what are sufficient conditions for Deadlock? Q2> What is the difference between deadlock preventions, deadlock avoidance, and deadlock detection?
Q1 What are necessary and what are sufficient conditions for Deadlock?Q2 What is the difference between deadlock preventions, deadlock avoidance, and deadlock detection?
5 votes
1 answer
118
SPU Scheduling
What is the correct sequence of the functions -Scheduling, dispatching, and context switching.
What is the correct sequence of the functions -Scheduling, dispatching, and context switching.
2 votes
0 answers
119
CO: William Stalling: Write Through and Write Back, which is more efficient.
According to my calculation, the time required in write back is 240ns and for write through it should be 1920ns. Is it correct or not?
According to my calculation, the time required in write back is 240ns and for write through it should be 1920ns. Is it correct or not?
3 votes
1 answer
120
CO: Working of multiplexer, comparator and encoder in 2-way set associative mapping
Draw the diagram which shows the mechanism of fetching the data in 2-way set associative mapping using multiplexer, comparator, and encoder?
Draw the diagram which shows the mechanism of fetching the data in 2-way set associative mapping using multiplexer, comparator, and encoder?
Page: