Recent activity by gshivam63 / GATE Overflow for GATE CSE

1 answer

1

File Indexing
Choose the false statement. a) Internal hashing is implemented through the use of an array of records. b) Multiple hsahing uses two or more hash functions. c) Static hashing provides slow searching of records. d) Extendible hashing provides good performance as file grows

Choose the false statement.a) Internal hashing is implemented through the use of an array of records.b) Multiple hsahing uses two or more hash functions.c) Static hashing...

525 views

answered Nov 5, 2016

1 answer

2

File Structure and Indexing
A data dictionary doesn't provide iformation about a)where data is located b)the siz of disk storage c)who owns the data d) how data is used

A data dictionary doesn't provide iformation abouta)where data is locatedb)the siz of disk storagec)who owns the datad) how data is used

261 views

answered Nov 5, 2016

0 answers

3

GATE 2016-2-30
Can anyone draw the pipeline diagram for this question? https://gateoverflow.in/39627/gate-2016-2-30

Can anyone draw the pipeline diagram for this question?https://gateoverflow.in/39627/gate-2016-2-30

508 views

asked Jul 31, 2016

1 answer

4

DFS
Consider the following graph G modified DFS on G is as folows: starting vertex is 'a' vertex is visited on alphabetic order vertices are visited in order a,c,d,..... it works same as DFS except the visiting order restriction Which of the following is not a back edge during above DFA traversal on G? (a) {f,b} (b) {e,a} (c){d,a} (d){c,a}

Consider the following graph G modified DFS on G is as folows:starting vertex is 'a'vertex is visited on alphabetic ordervertices are visited in order a,c,d,.....it works...

1.8k views

commented Jul 27, 2016

5 answers

5

GATE CSE 2010 | Question: 51
Consider a complete undirected graph with vertex set $\{0, 1, 2, 3, 4\}$. Entry $W_{ij}$ in the matrix $W$ below is the weight of the edge $\{i, j\}$ ... weight of a path $P$ from vertex $1$ to vertex $2$ in this graph such that $P$ contains at most $3$ edges? $7$ $8$ $9$ $10$

Consider a complete undirected graph with vertex set $\{0, 1, 2, 3, 4\}$. Entry $W_{ij}$ in the matrix $W$ below is the weight of the edge $\{i, j\}$$$W=\begin{pmatrix} 0...

14.9k views

commented Jul 27, 2016

2 answers

6

BFS
Consider two vertices a and b that are simultaneously on the FIFO queue at same point during the execution of breadth first search from s in an undirected graph. Which of the following is true? 1. The number of edges on the shortest path between s and a is atmost one more than the number of edges on ... and b. 3. There is a path between a and b. a.1 only b.1 and 2 only c. 2 only d. 1, 2 and 3

Consider two vertices a and b that are simultaneously on the FIFO queue at same point during the execution of breadth first search from s in an undirected graph.Which of ...

18.2k views

asked Jul 25, 2016

4 answers

7

Tanenbaum NAK and Retransmission
Compute the fraction of the bandwidth that is wasted on overheads(headers and retransmission ) for protocol 6 on a heavily loaded 50 kbps satellite channel with data frames consisting of 40 headers and 3960 data bits.Assume that the signal propagation time ... for data frames is 1%, and the error rate for NAK frames is negligible.The sequence numbers are 8 bits.

Compute the fraction of the bandwidth that is wasted on overheads(headers and retransmission ) for protocol 6 on a heavily loaded 50 kbps satellite channel with data fram...

3.4k views

commented Jul 21, 2016

1 answer

8

Madeeasy workbook
A researcher wishes to digitally record analog sounds for testing animal hearing with frequencies of upto 100 kHz. Use Shannon's formula to find minimum signal to noise ratio (in dB) required to sustain the given data rate over a 500 KHz radio channel. a. 19.2 b. 18 c. 14 d. 19.5

A researcher wishes to digitally record analog sounds for testing animal hearing with frequencies of upto 100 kHz. Use Shannon's formula to find minimum signal to noise r...

1.4k views

commented Jul 12, 2016

2 answers

9

Madeeasy workbook
An upper layer packet is split into 10 frames, each of which has an 80% chance of arriving undamaged. If no error is done by the data link protocol, how many times must the message be sent on average to get the entire thing through?

An upper layer packet is split into 10 frames, each of which has an 80% chance of arriving undamaged. If no error is done by the data link protocol, how many times must t...

7.8k views

asked Jul 12, 2016

3 answers

10

predict the output

608 views

answered Jul 8, 2016

1 answer

11

KERALA_PSC Predict content of PC and SP
At present the contents of SP and PC of a 8085 microprocessor are F000h and 2400h respectively. What will be the content after CALL E000h?

At present the contents of SP and PC of a 8085 microprocessor are F000h and 2400h respectively.What will be the content after CALL E000h?

1.7k views

answered Jul 8, 2016

1 answer

12

KERALA_PSC Predict the accumulator content
Predict the accumulator content after following instructions: XRA A MVI B, F0H SUB B a. F0 H b. 0FH c.01 H d. 10H

Predict the accumulator content after following instructions:XRA AMVI B, F0HSUB B a. F0 Hb. 0FHc.01 Hd. 10H

2.6k views

answered Jul 8, 2016

1 answer

13

cache memory
Consider a machine with a 2-way set associative data cache of size 64Kbytes and block size 16bytes. The cache is managed using 32 bit virtual addresses and the page size is 4Kbyts. A program to be run on this machine begins as follows: double ARR[1024] ... -fetching is done. The only data memory references made by the program are those to array ARR. find the number of cache misses____

Consider a machine with a 2-way set associative data cache of size 64Kbytes and block size 16bytes. The cache is managed using 32 bit virtual addresses and the page size ...

1.1k views

commented Jul 8, 2016

2 answers

14

Asymptotic Notation
If f(n) = big_omega(n), g(n) = O(n) and h(n) = ⊙(n) then what is f(n).g(n) + h(n) ?

If f(n) = big_omega(n), g(n) = O(n) and h(n) = ⊙(n) then what is f(n).g(n) + h(n) ?

732 views

answered Jul 6, 2016

1 answer

15

Imp doubt
Can any one tell ? How should i prepare programs for Linked list addind nodes their deletion. I used to learn the programs its not that i dint understand but still i had to learn. But now there are so many subjects so it is not possible to learn each ... Structure program like of trees graph DFS BFS etc and many other . How to overcome this Difficulty . Somebody please help and guide me ?

Can any one tell ? How should i prepare programs for Linked list addind nodes their deletion.I used to learn the programs its not that i dint understand but still i had t...

402 views

answered Jul 6, 2016

2 answers

16

UGC NET CSE | June 2012 | Part 3 | Question: 16
Given the following statements: The power of deterministic finite state machine and non- deterministic finite state machine are same. The power of deterministic pushdown automaton and non- deterministic pushdown automaton are same. Which of the above is the correct statement(s)? Both I and II Only I Only II Neither I nor II

Given the following statements:The power of deterministic finite state machine and non- deterministic finite state machine are same.The power of deterministic pushdown au...

3.3k views

answered Jul 6, 2016

1 answer

17

Regarding Regular Expression
Please somebody tell from where to study Regular Expression in detail with full-length explanation of it.

Please somebody tell from where to study Regular Expression in detail with full-length explanation of it.

586 views

commented Jul 6, 2016

1 answer

18

UGC NET CSE | June 2012 | Part 3 | Question: 1
Consider the following Pseudo-code segment: k:=0 for $i_1$:=1 to n for $i_2$ := 1 to $i_1$ : : : for $i_m$:=1 to $i_{m-1}$ k:=k+1 The value of k after the execution of this code shall be $C(n+m-1, m)$ $C(n-m+1, m)$ $C(n+m-1, n)$ $C(n-m+1, n)$

Consider the following Pseudo-code segment:k:=0for $i_1$:=1 to nfor $i_2$ := 1 to $i_1$:::for $i_m$:=1 to $i_{m-1}$k:=k+1The value of k after the execution of this code s...

2.3k views

answered Jul 6, 2016

1 answer

19

UGC NET CSE | June 2012 | Part 3 | Question: 3
The concept of pipelining is a most effective in improving performance in the tasks being performed in different stages: require different amount of time require about the same amount of time require different amount of time ... between any two tasks being same require different amount with time difference between any two tasks being different

The concept of pipelining is a most effective in improving performance in the tasks being performed in different stages:require different amount of timerequire about the ...

9.2k views

answered Jul 6, 2016

5 answers

20

Sliding Window Protocol Question 1
Consider 1 Mbps error-free line , The maximum frame size is 1000 bits .New packets are generated about 1 second apart . Timeout interval is 10m/sec if the special acknowledgement timer were eliminated unnecessary timout would occur . How any times average msg would have been transimitted ? a) Only once b) Twice C) thrice d) None

Consider 1 Mbps error-free line , The maximum frame size is 1000 bits .New packets are generated about 1 second apart . Timeout interval is 10m/sec if the special acknow...

4.5k views

commented Jul 6, 2016

1 answer

21

sliding window protocol
pleas help me in this problem

pleas help me in this problem

1.2k views

answered Jul 6, 2016

1 answer

22

If the packet size is 1200 byte and speed is 70% of speed of light find throughput in stop and wat protocol for a. 12km

2.7k views

answered Jul 5, 2016

1 answer

23

Time complexity
What is time complexity for given recurrence relation T(n) = √nT(√n) + √n T(2)= 1

What is time complexity for given recurrence relationT(n) = √nT(√n) + √nT(2)= 1

848 views

answered Jul 5, 2016

1 answer

24

can some1 plz tell about sender utilization,efficiency,link utilization,throughput, BW utilization..in network

1.5k views

answered Jul 5, 2016

1 answer

25

some1 plz explain why the time complexity of Prims algorithm using arrays is O(v^2+2E)...thanks in advance

682 views

commented Jul 5, 2016

6 answers

26

ISRO2016-19
Consider a non-pipelined processor with a clock rate of $2.5$ gigahertz and average cycles per instruction of four. The same processor is upgraded to a pipelined processor with five stages; but due to the internal pipeline delay, the clock speed is reduced to $2$ gigahertz. Assume ... no stalls in the pipeline. The speedup achieved in this pipelined processor is $3.2$ $3.0$ $2.2$ $2.0$

Consider a non-pipelined processor with a clock rate of $2.5$ gigahertz and average cycles per instruction of four. The same processor is upgraded to a pipelined processo...

6.1k views

commented Jul 5, 2016

2 answers

27

Average access time, Made Easy- Psus Book
Two level memory contains cache and main memory. Cache access time is 20ns and main memory access time is 120ns/word.The size of block is 4 words. Main memory is referred 20% of times.What is the average access time: a) 120ns. b) 20ns c) 116ns d) 150ns

Two level memory contains cache and main memory. Cache access time is 20ns and main memory access time is 120ns/word.The size of block is 4 words. Main memory is referred...

4.3k views

commented Jul 5, 2016

1 answer

28

General doubt
What is the difference between CPU frequency and Clock Cycle? What is the relation between them?

What is the difference between CPU frequency and Clock Cycle? What is the relation between them?

321 views

answered Jul 4, 2016

3 answers

29

GATE CSE 1998 | Question: 2-9
Formatting for a floppy disk refers to arranging the data on the disk in contiguous fashion writing the directory erasing the system data writing identification information on all tracks and sectors

Formatting for a floppy disk refers toarranging the data on the disk in contiguous fashionwriting the directoryerasing the system datawriting identification information o...

7.4k views

commented Jul 2, 2016

2 answers

30

if list is almost sorted and largest element is wrongly placed
A list of integers is almost sorted with only the largest number being out of place. If this information is not known to the algorithm, then which of the following algorithms can sort the list the fastest? Bubble sort Selection sort Insertion sort Shell sort

A list of integers is almost sorted with only the largest number being out of place. If this information is not known to the algorithm, then which of the following algori...

1.3k views

answered Jul 2, 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