Recent activity by shivangi5 / GATE Overflow for GATE CSE

1 answer

1

MadeEasy Test Series: Programming & DS - Stack
Options are TI==(P/Q*i-1) Ti==(P/Q*i+1) Ti==(P/Q*(i-1)-1) Ti==(P/Q*(i+1)-1)

Options areTI==(P/Q*i-1)Ti==(P/Q*i+1)Ti==(P/Q*(i-1)-1)Ti==(P/Q*(i+1)-1)

669 views

asked Dec 12, 2017

7 answers

2

Find First and Follow
How to find FIrst and Follow in following case? S -> aAbB | bAaB | epsilon A -> S B -> S I am little confused because of the production A->S, does it say that Follow(A) is subset of Follow(S) or Follow(S) is subset of Follow(A) or both are equal?

How to find FIrst and Follow in following case?S - aAbB | bAaB | epsilonA - SB - SI am little confused because of the production A->S, does it say that Follow(A) is subse...

5.4k views

commented Dec 12, 2017

0 answers

3

Normalization
Which of the following statement false is relation R is in 3NF but not BCNF? A) Relation R must consist atleast two over-lapped candidate keys. B) Relation R must consist proper subset of candidate key determines proper subset of some other candidate key ... atleast two compound candidate keys. Someone please explain what does Option A refers here.......i.e overlapped candidate keys

Which of the following statement false is relation R is in 3NF but not BCNF?A) Relation R must consist atleast two over-lapped candidate keys.B) Relation R must consist p...

844 views

commented Dec 6, 2017

3 answers

4

VIEW SERIALIZABILITY
Consider the 2 transactions T1: R(A) W(A) W(B) T2: R(A) W(A) R(B) W(B) How many view serializable schedules are possible which are not conflict serializable? (A) 0 (B) 1 (C) 2 (D) 3

Consider the 2 transactionsT1: R(A) W(A) W(B)T2: R(A) W(A) R(B) W(B)How many view serializable schedules are possible which are not conflict serializable?(A) 0(B) 1(C) 2(...

3.0k views

commented Dec 6, 2017

1 answer

5

2 Phase Locking
Consider the following schedule: S:R2(A) W1(B) W1(C) R3(B) R2(B) R1(A) C1 R2(C) C2 W3(A)C3 Please explain how it is allowed in 2 PL

Consider the following schedule:S:R2(A) W1(B) W1(C) R3(B) R2(B) R1(A) C1 R2(C) C2 W3(A)C3Please explain how it is allowed in 2 PL

1.2k views

asked Dec 6, 2017

1 answer

6

MadeEasy Test Series: Databases - Transactions
Consider the following schedule: S:r1(a) r3(d) w1(B) r2(B) r4(B) w2(C) r5(C) w4(E) r5(E) w5(B) How many serial schedules conflict equal to schedules (S)?

Consider the following schedule:S:r1(a) r3(d) w1(B) r2(B) r4(B) w2(C) r5(C) w4(E) r5(E) w5(B)How many serial schedules conflict equal to schedules (S)?

1.9k views

answer selected Dec 5, 2017

0 answers

7

MadeEasy Test Series: Databases - Indexing
Which of the following statement is/are true? For any data file it is possible to construct two separate sparse first level indexes on different keys. For any data file, it is possible to construct two separate dense first level indexes ... possible to construct a sparse first level index and a dense second level index,both should be useful. All the above

Which of the following statement is/are true?For any data file it is possible to construct two separate sparse first level indexes on different keys.For any data file, it...

624 views

commented Dec 4, 2017

3 answers

8

MadeEasy Test Series: Databases - B Tree
Which of the following statement true about B tree and B+ tree index? Assume order of B tree node same as order of B+ tree node. B tree index has more levels than B+ tree index for large number of keys. B+ tree index has more levels than B ... records. B+ tree index nodes more than B tree for large number of keys I think a is correct but the given ans is b

Which of the following statement true about B tree and B+ tree index? Assume order of B tree node same as order of B+ tree node.B tree index has more levels than B+ tree ...

1.9k views

commented Dec 4, 2017

3 answers

9

MadeEasy Test Series: Digital Logic - Adder
A 1-bit full adder circuit takes 5 ns to generate the carry-out bit and 10 ns for the sum-bit. When 4, 1-bit full adders are cascaded, the maximum rate of additions per second will be _______ × 107.

A 1-bit full adder circuit takes 5 ns to generate the carry-out bit and 10 ns for the sum-bit. When 4, 1-bit full adders are cascaded, the maximum rate of additions per s...

1.4k views

commented Dec 4, 2017

2 answers

10

MadeEasy Test Series: Digital Logic - Digital Counter
What is the best architecture of the ‘Logic gate’? a 3-bit input AND gate a 2-input AND gate a NOT gate a wire connection (no logic gate needed)

What is the best architecture of the ‘Logic gate’?a 3-bit input AND gatea 2-input AND gatea NOT gatea wire connection (no logic gate needed)

409 views

commented Dec 3, 2017

4 answers

11

MadeEasy Advance Level Test: Theory of Computation - Finite Automata
Answer given is 2,but shouldn't it be 3? State itself will be there in e-closure?

Answer given is 2,but shouldn't it be 3? State itself will be there in e-closure?

1.2k views

commented Dec 2, 2017

1 answer

12

DCFL or not
Consider the following languages: L1={abna2n|n>=0} L2={aabna3n|n>=0} Why L1UL2 is DCFL please explain?

Consider the following languages:L1={abna2n|n>=0}L2={aabna3n|n>=0}Why L1UL2 is DCFL please explain?

885 views

asked Dec 2, 2017

0 answers

13

Push Down Automata
Consider the following statement: S: Set of languages accepted by DPDA by empty stack contain only those DCFL’s with prefix property. Please explain as why this sentence is wrong....

Consider the following statement:S: Set of languages accepted by DPDA by empty stack contain only those DCFL’s with prefix property.Please explain as why this sentence ...

460 views

closed Dec 1, 2017

0 answers

14

MADE EASY TEST SERIES
Consider a CPU that executes at a clock rate of 200 MHz (5 ns per cycle) with a single level of cache. CPIexecution i.e. CPI with ideal memory is 1.1. Instruction mix are 50% arithmetic / logical, 30% load / store, 20% control instruction. Assume the ... rate is 15% and a miss penalty of 5 cycles. The number of times cpu with ideal memory is faster when no miss-occurs _______.

Consider a CPU that executes at a clock rate of 200 MHz (5 ns per cycle) with a single level of cache. CPIexecution i.e. CPI with ideal memory is 1.1. Instruction mix are...

275 views

closed Nov 28, 2017

1 answer

15

MadeEasy Subject Test: Databases - Transactions
The number of concurrent schedules can be formed with 3 transactions having 3, 2 and 1 operations respectively _________ I am getting 54 but the given ans is 60. My doubt is are serial schedules counted or not in the concurrent schedules.

The number of concurrent schedules can be formed with 3 transactions having 3, 2 and 1 operations respectively _________I am getting 54 but the given ans is 60.My doubt i...

679 views

asked Nov 24, 2017

0 answers

16

Made Easy Test Series
The number of ways possible to form injective function from set A set B where |A| = 3 and |B| = 5 such that pth element of set A cannot match with pth element of set B are _________.

The number of ways possible to form injective function from set A set B where |A| = 3 and |B| = 5 such that pth element of set A cannot match with pth element of set B ar...

449 views

commented Nov 18, 2017

3 answers

17

Max Heap
The number of ways in which the numbers 1, 2, 3, 4, 5 can be inserted into binary heap. Such that resulted binary heap is max heap ________.

The number of ways in which the numbers 1, 2, 3, 4, 5 can be inserted into binary heap. Such that resulted binary heap is max heap ________.

3.2k views

commented Nov 7, 2017

2 answers

18

Stack
Let S be a stack of size 4 ≥ 1 and it is initially empty. Suppose we push the numbers 1, 2, 3, 4 in sequence and then perform 4 pop operations. Let one push operation takes 5 ns; one pop operation takes 5 ns; the time between the end of one such stack ... to the start of the pop operation that removes p from the stack. The average stack-life of an element of this stack is ___________ (in ns).

Let S be a stack of size 4 ≥ 1 and it is initially empty. Suppose we push the numbers 1, 2, 3, 4 in sequence and then perform 4 pop operations. Let one push operation t...

821 views

commented Nov 7, 2017

3 answers

19

Stack
Consider an efficient implementation of a data structure STACK-MAX that support an operation max( ) that reports the current maximum among all elements in the stack. Normal stack operations i.e., push, pop are also to be supported. The size of above data structure after performing ... (8), pop, pop, max, push (5) is ________ (in bytes). Assume that an integer can be stored in 4 bytes.

Consider an efficient implementation of a data structure STACK-MAX that support an operation “max( )” that reports the current maximum among all elements in the stack...

3.2k views

comment edited Nov 7, 2017

1 answer

20

Depth first search
Consider the following graph G. Modified DFS on G applied as follows: • Starting vertex is ‘p’. • Vertex is visited based on alphabetic order. • Vertices are visited in order p, q, r, s, t, v. • It works same as DFS except the visiting order restriction What is the number of back edges during the above DFS traversal on G ______________

Consider the following graph G.Modified DFS on G applied as follows:• Starting vertex is ‘p’.• Vertex is visited based on alphabetic order.• Vertices are visite...

1.5k views

commented Nov 6, 2017

1 answer

21

Integration

430 views

answer selected Nov 3, 2017

5 answers

22

MadeEasy Test Series: Programming & DS - Binary Tree
The number of ways we can insert elements { 1, 2, 3, .... 7 } to make an AVL tree, so that it does not have any rotation are _______ ?

The number of ways we can insert elements { 1, 2, 3, .... 7 } to make an AVL tree, so that it does not have any rotation are _______ ?

4.2k views

commented Nov 3, 2017

0 answers

23

#Hashing
Consider a hashing function that resolves collision by quadratic probing .Assume the address space is indexed from 1 to 6. Which of the following locations will never be probed if a collision occurs at position 5? A). 4 B). 5 C). 8 D). 6

Consider a hashing function that resolves collision by quadratic probing .Assume the address space is indexed from 1 to 6. Which of the following locations will never be ...

349 views

comment edited Oct 31, 2017

1 answer

24

Compiler
Which of the following statements are correct and why.....? Every regular set has LR(1) grammar Every regular grammar is LR(1).

Which of the following statements are correct and why.....?Every regular set has LR(1) grammarEvery regular grammar is LR(1).

507 views

commented Oct 30, 2017

2 answers

25

Made easy test series
A demand paging system has page fault service time as 125 time units if page is not dirty and 400 times units of page fault service time if it is a dirty page. Memory access time is 10 time units. The probability of a page fault is 0.3. In case of ... is P. It is observed that average access time is 50 time units. Then, the value of P is ______? [upto four decimal places]

A demand paging system has page fault service time as 125 time units if page is not dirty and 400 times units of page fault service time if it is a dirty page. Memory acc...

1.7k views

commented Oct 28, 2017

1 answer

26

Longest remaining time first
Consider four process all are arriving at time zero, with total execution time of 20, 10, 10 and 20 unit respectively. Each process spends the first 20% of execution time doing CPU, the next 60% of doing I/O computation and the last 20% ... ______ unit. [Note: When same burst occurs for multiple process high priority given to lowest process id] (upto one decimal place)

Consider four process all are arriving at time zero, with total execution time of 20, 10, 10 and 20 unit respectively. Each process spends the first 20% of execution time...

1.1k views

answer selected Oct 28, 2017

1 answer

27

Hard disk
A certain hard disk rotates at 6000 rpm. It has 1 KB per sector and average 64 sectors/track and has a seek time of 5 msec. Consider the following statements : S1:The data transfer rate of the drive is 6400KBPs S2:The time required to read 800 random sectors is 4.13 sec S3:The time required to read 800 successive sectors is 0.0052 sec The number of statements is/are true _______.

A certain hard disk rotates at 6000 rpm. It has 1 KB per sector and average 64 sectors/track and has a seek time of 5 msec. Consider the following statements :S1:The data...

2.4k views

answer selected Oct 27, 2017

1 answer

28

CRC checking
Let G(x) be the generator polynomial used for CRC checking. What is the condition that should be satisfied by G(x) to detect all isolated double errors? G(x) should have at least two terms. G(x) should have the factor x+1 G(X) shouldn’t divide xt+1 (for t less than frame length The coefficient of the term x0 should be 1.

Let G(x) be the generator polynomial used for CRC checking. What is the condition that should be satisfied by G(x) to detect all isolated double errors?G(x) should have a...

2.4k views

asked Oct 25, 2017

2 answers

29

Indexing

1.0k views

commented Oct 20, 2017

0 answers

30

Transactions

403 views

closed Oct 17, 2017

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