Answers by resilientknight / GATE Overflow for GATE CSE

2 votes

1

MAdeEasy Doubt
Maximum number of records that can be indexed in B+ tree of level 4 ,order 10..root at level 1 My answer is 9999 ,answer given 9000, ignoring the 9 keys in Root.... Why so?

Maximum number of records that can be indexed in B+ tree of level 4 ,order 10..root at level 1 My answer is 9999 ,answer given 9000, ignoring the 9 keys in Root.... Why s...

605 views

answered Sep 20, 2016

1 votes

2

DBMS test
Consider a relation R(A, B) that contain r tupples, and a relation S(B, C) that contains s tupples; assume r > 0 and s > 0. Make no assumption about keys. For the relational algebra expression what can be the minimum and the maximum number of tupples that could be in the result of expression in ... and s. A) Min:0,Max:r+s B) Min:r+s,Max:r*s C) Min:max(r,s),Max:r+s D) Min:0,Max:r*s

Consider a relation R(A, B) that contain r tupples, and a relation S(B, C) that contains s tupples; assume r 0 and s 0. Make no assumption about keys. For the relationa...

1.4k views

answered Sep 18, 2016

1 votes

3

DBMS
Consider the following transactions: T1: r1(x), r1(z), r1(y), w1(z) T2: r1(z), r1(x), r1(y), w1(x) Which of the statement is true about transactions T1 and T2? S1: Every non-serial schedule between T1 and T2 are conflict serializable schedule. S2: Some non-serial ... . S4: Some non-serial schedule between T1 and T2 is allowed using 2PL protocol. a)S1 and S4 b)S2 and S4 3)S2 and S3 4)Only S3

Consider the following transactions:T1: r1(x), r1(z), r1(y), w1(z)T2: r1(z), r1(x), r1(y), w1(x)Which of the statement is true about transactions T1 and T2?S1: Every non-...

1.6k views

answered Sep 18, 2016

13 votes

4

GATE CSE 2009 | Question: 49
Which of the following statements are TRUE? The context diagram should depict the system as a single bubble. External entities should be identified clearly at all levels of DFDs. Control information should not be represented in a DFD. A data store can be connected wither to another data store or to an external entity. II and III II and III I and III I, II and III

Which of the following statements are TRUE?The context diagram should depict the system as a single bubble.External entities should be identified clearly at all levels of...

8.0k views

answered Sep 15, 2016

12 votes

5

GATE IT 2004 | Question: 78
Consider two tables in a relational database with columns and rows as follows: ... 1 Both i and ii will fail i will fail but ii will succeed i will succeed but ii will fail Both i and ii will succeed

Consider two tables in a relational database with columns and rows as follows:$$\overset{\text{Table: Student}}{\begin{array}{|c|c|c|} \hline \textbf {Roll_no} & \textbf{...

11.0k views

answered Sep 15, 2016

2 votes

6

GATE CSE 1997 | Question: 6.8
Each Process $P_i, i = 1\ldots 9$ is coded as follows repeat P(mutex) {Critical section} V(mutex) forever The code for $P_{10}$ is identical except it uses V(mutex) in place of P(mutex). What is the largest number of processes that can be inside the critical section at any moment? $1$ $2$ $3$ None

Each Process $P_i, i = 1\ldots 9$ is coded as followsrepeat P(mutex) {Critical section} V(mutex) foreverThe code for $P_{10}$ is identical except it uses V(mutex) in plac...

25.2k views

answered Sep 14, 2016

1 votes

7

Order of a leaf node in B+ tree
This question was asked in GATE 2007 : https://gateoverflow.in/1261/gate2007-63-isro2016-59 Here, they have mentioned that the order of a leaf node is the max. number of keys it can hold. Usually order and key concept are different. If nothing is mentioned, then what should we do? Assume this or follow the formula of : max. keys + 1

This question was asked in GATE 2007 :https://gateoverflow.in/1261/gate2007-63-isro2016-59Here, they have mentioned that the order of a leaf node is the max. number of ke...

956 views

answered Sep 14, 2016

0 votes

8

TestBook Test Series: Databases - Transactions

522 views

answered Sep 12, 2016

0 votes

9

Hard disk
If a disk system has an average seek time of 30 ns and rotational rate of 360 rpm. Each track of the disk has 512 sectors each of size 512 bytes. a) What is the time required to read 4 successive sectors? b) What is the data transfer rate?

If a disk system has an average seek time of 30 ns and rotational rate of 360 rpm. Each track of the disk has 512 sectors each of size 512 bytes.a) What is the time requ...

1.5k views

answered Sep 2, 2016

0 votes

10

GATE CSE 1997 | Question: 75
An operating system handles requests to resources as follows. A process (which asks for some resources, uses them for some time and then exits the system) is assigned a unique timestamp are when it starts. The timestamps are monotonically increasing with time. Let us denote ... , show how. If not prove it. Can a process P ever starve? If yes, show how. If not prove it.

An operating system handles requests to resources as follows.A process (which asks for some resources, uses them for some time and then exits the system) is assigned a un...

7.6k views

answered Sep 2, 2016

9 votes

11

GATE IT 2005 | Question: 19, UGCNET-June2012-III: 57
A user level process in Unix traps the signal sent on a Ctrl-C input, and has a signal handling routine that saves appropriate files before terminating the process. When a Ctrl-C input is given to this process, what is the mode in which the signal handling routine executes? User mode Kernel mode Superuser mode Privileged mode

A user level process in Unix traps the signal sent on a Ctrl-C input, and has a signal handling routine that saves appropriate files before terminating the process. When ...

11.3k views

answered Sep 1, 2016

40 votes

12

GATE CSE 2003 | Question: 78
A processor uses $2-level$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical addresses are both $32$ bits wide. The memory is byte addressable. For virtual to physical address translation, the ... virtual address is approximately (to the nearest $0.5$ ns) $1.5$ ns $2$ ns $3$ ns $4$ ns

A processor uses $2-level$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical addres...

50.1k views

answered Aug 27, 2016

4 votes

13

UGC NET CSE | June 2016 | Part 2 | Question: 31
The number of strings of length 4 that are generated by the regular expression $(0 \mid \epsilon ) 1^+ 2^{*}(3 \mid \epsilon)$, where $\mid$ is an alternation character, $\{+, *\}$ are quantification characters, and $\epsilon$ is the null string, is: 08 10 11 12

The number of strings of length 4 that are generated by the regular expression $$(0 \mid \epsilon ) 1^+ 2^{*}(3 \mid \epsilon)$$, where $\mid$ is an alternation character...

5.8k views

answered Aug 16, 2016

0 votes

14

overhead of maintaining page-table
consider a system using 3-level page-table where it uses first 2 bit to index into first level page-table, 9 bit to index into second level page table , 9 bit to index into third level page-table. processor uses 36 bit physical address and 32 bit virtual address . each page-table entry is of size 4 bytes. calculate total overhead for the page-table ?

consider a system using 3-level page-table where it uses first 2 bit to index into first level page-table, 9 bit to index into second level page table , 9 bit to index in...

2.6k views

answered Aug 1, 2016

45 votes

15

GATE CSE 2014 Set 2 | Question: 16
Let $A\:\leq_m\:B$ denotes that language $A$ is mapping reducible (also known as many-to-one reducible) to language $B$. Which one of the following is FALSE? If $A\: \leq_m B$ and $B$ is recursive then $A$ ... then $A$ is recursively enumerable. If $A\: \leq_m B$ and $B$ is not recursively enumerable then $A$ is not recursively enumerable.

Let $A\:\leq_m\:B$ denotes that language $A$ is mapping reducible (also known as many-to-one reducible) to language $B$. Which one of the following is FALSE?If $A\: \leq_...

17.6k views

answered Jul 20, 2016

21 votes

16

GATE CSE 2016 Set 2 | Question: 23
Anarkali digitally signs a message and sends it to Salim. Verification of the signature by Salim requires. Anarkali's public key. Salim's public key. Salim's private key. Anarkali's private key.

Anarkali digitally signs a message and sends it to Salim. Verification of the signature by Salim requires.Anarkali's public key.Salim's public key.Salim's private key.Ana...

9.5k views

answered Jun 24, 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