# Recent activity by sandygate

0 answers
1
The maximum number of Boolean expressions that can be formed for the function f(x,y,z) satisfying the relation f(x’,y,z’) = f(x,y,z) is.
2 answers
2
Regural CFL CSL Recursive
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)).
2 answers
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}$ ...
1 answer
5
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.
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
0 answers
8
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; }
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
0 answers
11
0 answers
12
1 answer
13
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.
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?
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)$
0 answers
17
0 answers
18
1 answer
19
Is $(aa)^*$ +a$(aa)^*$ = a*?
0 answers
20
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.
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.
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? 0 answers 24 1 answer 25 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? 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? 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.,$\\$]
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
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 _________.