Recent activity by sandygate / GATE Overflow for GATE CSE

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

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

1.7k views

commented Jan 28, 2019

2 answers

2

Find the language
Regural CFL CSL Recursive

ReguralCFLCSLRecursive

309 views

commented Jan 28, 2019

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)).

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...

1.7k views

commented Jan 1, 2019

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}$ ...

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...

1.0k views

commented Jan 1, 2019

1 answer

5

ACE Test Series

557 views

commented Dec 18, 2018

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.

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...

1.6k views

commented Dec 13, 2018

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

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...

1.2k views

commented Dec 13, 2018

1 answer

8

Zeal Test Series 2019: Operating System - Context Switch

697 views

commented Dec 12, 2018

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; }

#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...

287 views

commented Dec 9, 2018

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

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. Pa...

566 views

commented Nov 30, 2018

0 answers

11

compiler

418 views

commented Nov 29, 2018

0 answers

12

MadeEasy Workbook: Compiler Design - Parsing

442 views

commented Nov 28, 2018

1 answer

13

compiler1

387 views

commented Nov 28, 2018

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.

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 cach...

1.3k views

commented Nov 27, 2018

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?

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...

1.3k views

commented Nov 27, 2018

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)$

what is the time complexity offunction(int n){ if(n<=1) return; for(int i=1; i<n; i++) { printf("*"); } ...

1.2k views

commented Nov 27, 2018

0 answers

17

dynamic programming

255 views

commented Nov 26, 2018

0 answers

18

DYNAMIC PROGRAMMING

439 views

commented Nov 26, 2018

1 answer

19

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

Is $(aa)^*$ +a$(aa)^*$ = a*?

476 views

commented Nov 25, 2018

0 answers

20

Testbook Test Series: Probability - Random Variable

525 views

commented Nov 23, 2018

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.

Consider the below given grammar:A→AA+A→aThe number of states in CLR(1) canonical item set are _______ and number of inadequate states in LALR(1) canonical item set i...

611 views

comment edited Nov 21, 2018

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.

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 inade...

893 views

commented Nov 21, 2018

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?

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?

515 views

commented Nov 21, 2018

0 answers

24

Gateforum Test Series

362 views

commented Nov 21, 2018

1 answer

25

Gateforum Test Series: Compiler Design - Syntax Directed Translation

679 views

commented Nov 21, 2018

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?

Which of the following is not a token of c -program?A. 1.02e + 2B. # defineC. 123.33D. MAXplease explain why?

418 views

commented Nov 21, 2018

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?

Consider the given statementsS1: 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 e...

2.4k views

commented Nov 21, 2018

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., $\$]

Construct the LALR(1) sets of items for the grammar:S’ - SS - *SS | aThen, identify, in the list below, one of the LALR(1) sets of items for(A) [S - a., $\$$](B) [S - a...

1.7k views

commented Nov 21, 2018

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

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

294 views

answered Nov 17, 2018

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 ________.

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 reg...

669 views

commented Nov 15, 2018

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true