search
Log In

Recent activity by sandygate

2 answers
2
Regural CFL CSL Recursive
commented Jan 28, 2019 in Theory of Computation 84 views
0 answers
3
You are working on a laptop connected to a $100 \text{Mbps}$ Ethernet LAN. You need a $2 \text{GB}$ file that is on the server in the same LAN. The entire file is also on your pen drive but you have left the pen drive in another room. You ... be able to go and bring the pen drive, before the transfer on the LAN completes. Assume continuous data transmission on the LAN(no packetization required)).
commented Jan 1, 2019 in Computer Networks 488 views
1 answer
4
Assume the initial values of $K0$, $Q_0$ and $Q_1$ to be $1$. Which of the following state transition tables correctly correspond to the circuit given above? (Note: $Q_{kN}$ and $Q_{kN+1}$ ...
commented Jan 1, 2019 in Digital Logic 187 views
1 answer
5
commented Dec 18, 2018 in Theory of Computation 146 views
1 answer
6
State TRUE or FALSE and give reasons please? DMA is a mechanism for allowing an I/O device to transfer data to and from memory without involving the CPU in the transfer. An advantage of implementing threads in user space is that they don't incur the overhead of ... can be accomplished without executing OS code in kernel mode. 4.A TLB miss could occur even though the requested page was in memory.
commented Dec 13, 2018 in Operating System 545 views
0 answers
7
Suppose a disk has 100 cylinders, numbered from 0 to 99. At some time the disk arm is at cylinder 20, and there is a queue of disk access requests for cylinders 10, 22, 6, 38, 2, 40, 20. No of seeks in FCFS SSTF
commented Dec 13, 2018 in Operating System 366 views
0 answers
9
#include <stdio.h> int atoi(char s[]) { int i, n; n = 0; for(i = 0; s[i] >= '0' && s[i] <= '9'; ++i) n = 10*n + (s[i] - '0'); return n; } int main() { char s[] = "jitendra"; int number = atoi(s); printf("%d\n", number); //printf("%d\n", atoi(s)); return 0; }
commented Dec 9, 2018 in Programming 71 views
2 answers
10
Select the correct one from the below given options. 1. The parser’s output is abstract syntax tree, which represents the grammatical structure of the parse input. 2. Parse tree is condensed form of Abstract Syntax tree. 3. In abstract syntax tree the operators can appear as leaves while keywords cannot appear as leaves. 4.All of the above are true
commented Nov 30, 2018 in Compiler Design 185 views
0 answers
11
commented Nov 29, 2018 in Compiler Design 75 views
0 answers
14
consider two level cache hierarchies with L1 and L2 cache.Programs refer memory 1000 times out of which 40 misses are in L1 cache and 10 misses are in L2 cache.If the miss penalty of L2 is 200 clock cycles,hit time of L1 is 1 clock cycle,and hit time of L2 is 15 clock cycles,the average memory access time is__________clock cycles.
commented Nov 27, 2018 in CO and Architecture 451 views
1 answer
15
Consider a two level memory hierarchy, L1 (cache) has an accessing time of 5 ns and main memory has an accessing time of 100 ns. Writing or updating contents takes 20 ns and 200 ns for L1 and main memory respectively. Assume L1 gives misses 20% of the time with 60% of the instructions are read only instructions. What is the average access time for system (in ns) if it uses WRITETHROUGH technique?
commented Nov 27, 2018 in CO and Architecture 372 views
1 answer
16
what is the time complexity of function(int n) { if(n<=1) return; for(int i=1; i<n; i++) { printf("*"); } function(0.8n); } i'm getting O(nlogn base 5/4) using the recurrence relation method but in the book it's given O(n) $T(n)=T(\frac{4n}{5})+O(n)$
commented Nov 27, 2018 in Algorithms 261 views
0 answers
17
1 answer
19
0 answers
21
Consider the below given grammar: A→AA+ A→a The number of states in CLR(1) canonical item set are _______ and number of inadequate states in LALR(1) canonical item set is/are _______ respectively.
comment edited Nov 21, 2018 in Compiler Design 280 views
0 answers
22
Consider the below given grammar: S→(A S→B] S→C) A→B) A→C] B→D C→D D→ϵ The number of states in LALR(1) canonical item set are _______ and number of inadequate states (if any) in LALR(1) canonical item set is/are ____________respectively.
commented Nov 21, 2018 in Compiler Design 270 views
1 answer
23
No of token? $a b c d + y{^3}+(2-5+x$ $6/2$--;$ Please suggest how to count token in this type of questions?
commented Nov 21, 2018 in Compiler Design 117 views
0 answers
24
0 answers
26
Which of the following is not a token of c -program? A. 1.02e + 2 B. # define C. 123.33 D. MAX please explain why?
commented Nov 21, 2018 in Compiler Design 74 views
2 answers
27
Consider the given statements S1: In a simple graph G with 6 vertices, if degree of each vertex is 2, then Euler circuit exists in G. S2:In a simple graph G, if degree of each vertex is 3 then the graph G is connected. Which of the following is/are true?
commented Nov 21, 2018 in Graph Theory 519 views
1 answer
28
Construct the LALR(1) sets of items for the grammar: S’ -> S S -> *SS | a Then, identify, in the list below, one of the LALR(1) sets of items for (A) [S -> a., $\$] (B) [S -> a., +a] (C) [S -> *SS., $\$ + a] (D) [S -> *SS., $\$]
commented Nov 21, 2018 in Compiler Design 317 views
1 answer
29
If a graph requires k different colors for its proper coloring, then chromatic number of the graph is (a) 1 (b) k (c) k-1 (d) k/2
answered Nov 17, 2018 in Others 81 views
2 answers
30
Consider a binary channel code in which each codeword has a fixed length of 5 bits. The Hamming distance between any pair of distinct codewords in this code is at least 2. The maximum number of codewords such a code can contain is _________.
commented Nov 15, 2018 in Digital Logic 1.1k views
...