Dark Mode

Recent activity by sandygate

1 answer

1

boolean expressions
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

commented in Digital Logic Jan 28, 2019

1.7k views

2 answers

2

Find the language
Regural CFL CSL Recursive

commented in Theory of Computation Jan 28, 2019

299 views

1 answer

3

GATE Overflow | Mock GATE | Test 1 | Question: 40
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 ... and bring the pen drive, before the transfer on the LAN completes. Assume continuous data transmission on the LAN(no packetization required)).

commented in Computer Networks Jan 1, 2019

1.7k views

2 answers

4

GATE Overflow | Mock GATE | Test 1 | Question: 59
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 in Digital Logic Jan 1, 2019

1.0k views

1 answer

5

ACE Test Series

commented in Theory of Computation Dec 18, 2018

558 views

1 answer

6

operating system
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 ... be accomplished without executing OS code in kernel mode. 4.A TLB miss could occur even though the requested page was in memory.

commented in Operating System Dec 13, 2018

1.6k views

0 answers

7

Self Doubt Disk Scheduling
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 in Operating System Dec 13, 2018

1.2k views

1 answer

8

Zeal Test Series 2019: Operating System - Context Switch

commented in Operating System Dec 12, 2018

697 views

0 answers

9

Can someone find error in this code. It is printing 0 as the output.
#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( ... ] = "jitendra"; int number = atoi(s); printf("%d\n", number); //printf("%d\n", atoi(s)); return 0; }

commented in Programming in C Dec 9, 2018

285 views

2 answers

10

compiler design, Syntax directed tree
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 in Compiler Design Nov 30, 2018

549 views

0 answers

11

commented in Compiler Design Nov 29, 2018

397 views

0 answers

12

MadeEasy Workbook: Compiler Design - Parsing

commented in Compiler Design Nov 28, 2018

443 views

1 answer

13

commented in Compiler Design Nov 28, 2018

376 views

1 answer

14

Cache Memory
consider two-level cache hierarchies with L1 and L2 cache. Programs refer to memory 1000 times out of which 40 misses are in the L1 cache and 10 misses are in the 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 in CO and Architecture Nov 27, 2018

1.2k views

1 answer

15

cache memory
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% ... instructions being read-only instructions. What is the average access time for the system (in ns) if it uses the WRITETHROUGH technique?

commented in CO and Architecture Nov 27, 2018

1.3k views

1 answer

16

Karumanchi
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 in Algorithms Nov 27, 2018

1.2k views

0 answers

17

dynamic programming

commented in Algorithms Nov 26, 2018

257 views

0 answers

18

DYNAMIC PROGRAMMING

commented in Algorithms Nov 26, 2018

441 views

1 answer

19

Ace bits and bytes
Is $(aa)^*$ +a$(aa)^*$ = a*?

commented in Theory of Computation Nov 25, 2018

462 views

0 answers

20

Testbook Test Series: Probability - Random Variable

commented in Probability Nov 23, 2018

514 views

0 answers

21

CLR1 , LALR1
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 in Compiler Design Nov 21, 2018

603 views

1 answer

22

Lalr1 parsing
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 in Compiler Design Nov 21, 2018

874 views

1 answer

23

Token
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 in Compiler Design Nov 21, 2018

514 views

0 answers

24

Gateforum Test Series

commented in Compiler Design Nov 21, 2018

359 views

1 answer

25

Gateforum Test Series: Compiler Design - Syntax Directed Translation

commented in Compiler Design Nov 21, 2018

667 views

0 answers

26

tokens
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 in Compiler Design Nov 21, 2018

414 views

2 answers

27

Graph Connectivity
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 in Graph Theory Nov 21, 2018

2.3k views

1 answer

28

Test_CD1_Q51
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 in Compiler Design Nov 21, 2018

1.7k views

1 answer

29

Graph
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 in Others Nov 17, 2018

282 views

2 answers

30

Test by Bikram | Theory of Computation | Test 2 | Question: 5
Given two regular expressions: $p = (0^* 1^* )^*$ and $q = 0^* + 1^* + 0^*1 + 10^*$ The length of the smallest string that is present in the language corresponding to regular expression ‘$p$’ and not present in the language corresponding to regular expression ‘$q$’ is ________.

commented in Theory of Computation Nov 15, 2018

668 views