Questions by Prasanna / GATE Overflow for GATE CSE

1 votes

1 answer

1

What to do after GATE EXAM
Please suggest some ideas what to do after gate exam.

Please suggest some ideas what to do after gate exam.

626 views

asked Feb 8, 2016

0 votes

2 answers

2

Maths: LA Non Homogeneous Equation
Given the following set of equations: X - y - z = 0 x + y + z = 46 x - 2y +z = 16 -x - y + 2z = -7 which of the following is true ? a) no solution b) infinite many solution c) exactly one solution d) exactly one solution and atleast one of the x,y,z is negative

Given the following set of equations:X - y - z = 0x + y + z = 46x - 2y +z = 16-x - y + 2z = -7which of the following is true ?a) no solutionb) infinite many solutionc) ex...

537 views

asked Jan 31, 2016

2 votes

2 answers

3

MadeEasy Test Series: Algorithms - Greedy Algorithm
There are n white dots and n black dots. Equally spaced in a line. You want to connect each white dot with some block dot in one to one fashion with a minimum total length of wire. Consider 2 examples: Greedy algorithm gives optimal solution for Only (i) Only (ii) Both (i) and (ii) None of these

There are n white dots and n black dots. Equally spaced in a line. You want to connect each white dot with some block dot in one to one fashion with a minimum total lengt...

2.2k views

asked Jan 29, 2016

0 votes

1 answer

4

TOC: DFA Minimization
Clear Image URL: http://postimg.org/image/ljcst3k0t/

Clear Image URL: http://postimg.org/image/ljcst3k0t/

760 views

asked Jan 24, 2016

0 votes

0 answers

5

OS:paging Testbook Live Test Q 55
In a two level paging environment a page table is divided in to 2^12 pages each of size 4KW. The memory is word addressable. The physical address space is 128MW. Memory is divided into 2^14 frames.Length of the logical address is _________ My approach: ... ^12 pagesize = 4KW. PAS = 128MW #frames = 2^14 using the #pages and pagesize we can get VAS? how to approach.

In a two level paging environment a page table is divided in to 2^12 pages each of size 4KW. The memory is word addressable. The physical address space is 128MW. Memory ...

330 views

asked Jan 18, 2016

0 votes

1 answer

6

Algorithms: Master Method Testbook

464 views

asked Jan 18, 2016

1 votes

1 answer

7

DBMS: Indexing Question
A file is organized so that the odering of data record is same as or close to the odering of data block in some index. Then that index is called Dense Sparse Clustered Unclustered Solution given: (b) • In sparse index number of ... In dense index number of entries depends on number of data record in previous level. Link: https://gateoverflow.in/8222/gate2015-1_24

A file is organized so that the odering of data record is same as or close to the odering of data block in some index. Then that index is calledDenseSparseClusteredUnclus...

2.0k views

asked Jan 15, 2016

0 votes

0 answers

8

PDS: Two Dimensional Arrays
Consider the following program: main (){ int i, j; int A[p][q] = { {1, 3, 5}, {2, 4, 6} }; for (i = 0; i < m; i++) for (j = 0; j < n; j++) printf("%d", * (A[j] + i)); } Assume $m$ is number of rows and $n$ is number of columns. Find the OUTPUT printed by the above program. $123456$ $135246$ $456456$ $456789$

Consider the following program:main (){ int i, j; int A[p][q] = { {1, 3, 5}, {2, 4, 6} }; for (i = 0; i < m; i++) for (j = 0; j < n; j++) printf("%d", * (A[j] + i)); }Ass...

716 views

asked Jan 10, 2016

2 votes

0 answers

9

Algorithm: Array Fill the Blank
Consider a square matrix of N × N in which the values are located from A[1, 1] to A[N, N]. For all i and j, A[i, j] = A[i – 1, j – 1] where i > 1 and j > 1. In order to reduce the space complexity we avoid redundant ... i – 1] B [N + j – i – 1] B [N + i – j – 1] How to solve this ?

Consider a square matrix of N × N in which the values are located from A[1, 1] to A[N, N]. For all i and j, A[i, j] = A[i – 1, j – 1] where i 1 and j ...

786 views

asked Jan 9, 2016

2 votes

1 answer

10

CO: Addressing Modes
Consider 1GHz clock frequency processor, uses different operand access modes shown below: Assume that 8 cycle consumed for memory reference, 4 cycles consumed for arithmetic computation and 0 cycles consumed when the operand is in register instruction itself. What is the average ... the processor? 117.45 M words/sec 113.63 M words/sec 217.45 M words/sec 316.45 M words/sec

Consider 1GHz clock frequency processor, uses different operand access modes shown below: Assume that 8 cycle consumed for memory reference, 4 cycles consumed for a...

1.1k views

asked Jan 6, 2016

0 votes

3 answers

11

CO: SpeedUp in Pipeline
A non-pipeline processor has a clock rate 3 GHz and an average CPI of 4. An upgrade to the processor introduce 5 stage pipeline. How ever due to internal delay the clock rate of the new processor has to be reduces to 2 GHz. What is the speed-up of pipeline over non-pipeline? 3.1 3.3 3.5 3.8 I got 2.66 But the Given is 3.3

A non-pipeline processor has a clock rate 3 GHz and an average CPI of 4. An upgrade to the processor introduce 5 stage pipeline. How ever due to internal delay the clock ...

1.1k views

asked Jan 6, 2016

5 votes

1 answer

12

CO: Cache set Associative
A two way set associative cache has lines of 16 byte and a total cache size of 8 K bytes. The 256 M byte main memory is byte addressable. Which one of the following main memory block is mapped on to the set ‘0’ of the cache memory? A) (CFED09B)16 B) (FCED90C)16 C) (CFED00B)16 D) (FECD10C)16

A two way set associative cache has lines of 16 byte and a total cache size of 8 K bytes. The 256 M byte main memory is byte addressable. Which one of the following main ...

3.5k views

asked Jan 5, 2016

3 votes

1 answer

13

CO: Main Memory Hit Ratio
Consider an array of 4 elements and each element occupies 4-words. A 16 word cache is used and divided into a block of 8 words. If the following code is executed what is the hit ratio? for (i = 0; i < 2; i++) for (j = 0; j < 2; j++) x = A[i, j] + A[j, i] (a) 0.5 (b) 0.66 (c) 0.75 (d) 0.87

Consider an array of 4 elements and each element occupies 4-words. A 16 word cache is used and divided into a block of 8 words. If the following code is executed what is ...

1.4k views

asked Jan 5, 2016

5 votes

3 answers

14

CN: Subnetting
Two computers A and B are configured as follows. A has IP address 203.197.17.157 and netmask 255.255.128.0. B has IP address 203.192.192.201 and netmask 255.255.192.0. Which one of the following statements is true? A. A and B both assume they are on same ... . A assumes B is on same network, B assumes A is on a different network. D. A and B both assume they are on different networks.

Two computers A and B are configured as follows. A has IP address 203.197.17.157 and netmask 255.255.128.0. B has IP address 203.192.192.201 and netmask 255.255.192.0. Wh...

1.8k views

asked Jan 4, 2016

1 votes

3 answers

15

CN: Go Back N
Station A needs to send a message consisting of 15 packets to station B' using a sling window (window size 4) and go-back-N error control strategy. All packets are ready and immediately available for transmission. If every 6th packet that A' transmits gets lost (but no Acks from ... of packets that A' will transmit for sending the message to B' ? (a) 29 (b) 33 (c) 27 (d) 25

Station A needs to send a message consisting of 15 packets to station ‘B’ using a sling window (window size 4) and go-back-N error control strategy. All packets are r...

2.1k views

asked Jan 4, 2016

5 votes

2 answers

16

CN: TCP Congestion Control
A TCP machine is sending windows of 65,535 bytes over a 1-Gbps channel that has a 10-msec one-way delay. What is the maximum throughput achievable? What is the line efficiency? Answer: One window can be sent every 20 msec. This gives 50 windows/sec, ... question they have given 10 msec one-way delay. Why they have taken RTT? why we can't use one-way delay itself ?

A TCP machine is sending windows of 65,535 bytes over a 1-Gbps channel that has a 10-msec one-way delay. What is the maximum throughput achievable? What is the line eff...

11.5k views

asked Jan 4, 2016

1 votes

1 answer

17

TOC: Regular Expression How to apprach
Consider the regular expression $R=(a+b)^*(aa+bb)(a+b)^*$. Which one of the following regular expressions describes the same language as described by $R$? $R_1 = (a(ba)^*(a+bb)+b(ab)^*(b+aa))(a+b)^+$ $R_2= (a(ba)^*(a+bb)+b(ab)^*(b+aa))(a+b)^*$ $R_3= (a(ba)^*+b(ab)^*)+(a+b)^*$ $R_4= (a(ba)^*+b(ab)^*)(a+b)^+$ How to approach this ?

Consider the regular expression $R=(a+b)^*(aa+bb)(a+b)^*$. Which one of the following regular expressions describes the same language as described by $R$?$R_1 = (a(ba)^*(...

658 views

asked Jan 2, 2016

1 votes

1 answer

18

TOC : Complement of RE
Let $L$ be the language over the alphabet $\Sigma$={0,1} defined by the regular expression $(0+1)^*00(0+1)^*$. Which one of the following regular expressions defines the complement of $L$? a) $1^*01^*01^*$ b) $(10)^*11(10)^*$ c) $(0+10)^*(1+ \epsilon)$ d) $(1+01)^*(0+ \epsilon)$ Why Option 2 is wrong ?

Let $L$ be the language over the alphabet $\Sigma$={0,1} defined by the regular expression $(0+1)^*00(0+1)^*$. Which one of the following regular expressions defines the ...

1.5k views

asked Jan 2, 2016

1 votes

2 answers

19

TOC: No of states in Equvalent NFA
Consider the following language. L = {wxwy | x,y,w∈(a+b)+} How many states are there in equivalent NFA for above L?

Consider the following language. L = {wxwy | x,y,w∈(a+b)+}How many states are there in equivalent NFA for ab...

1.5k views

asked Jan 2, 2016

1 votes

1 answer

20

TOC: FA to RE

1.2k views

asked Jan 1, 2016

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