Recent activity by nilamd / GATE Overflow for GATE CSE

1 answer

1

f(n)=log n! ,g(n)=n logn what is the relationship between them?

2.8k views

answer selected Feb 1, 2016

1 answer

2

total possible 4 digit numbers from given 6 digits
total possible 4 digit numbers from 2,3,5,6,7,9 without repetition? total numbers possible less than 500? 360, 130 360, 100 240, 120 none

total possible 4 digit numbers from 2,3,5,6,7,9 without repetition? total numbers possible less than 500?360, 130 360, 100 240, 120 ...

1.6k views

commented Jan 28, 2016

7 answers

3

GATE CSE 2015 Set 1 | Question: 48
Consider a disk pack with a seek time of $4$ milliseconds and rotational speed of $10000$ rotations per minute (RPM). It has $600$ sectors per track and each sector can store $512$ bytes of data. Consider a file stored in ... sector is half of the time for one complete rotation. The total time (in milliseconds) needed to read the entire file is__________________

Consider a disk pack with a seek time of $4$ milliseconds and rotational speed of $10000$ rotations per minute (RPM). It has $600$ sectors per track and each sector can s...

20.4k views

commented Jan 23, 2016

4 answers

4

GATE CSE 2015 Set 2 | Question: 17
Consider a complete binary tree where the left and right subtrees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is $\Omega(\log n)$ $\Omega(n)$ $\Omega(n \log n)$ $\Omega(n^2)$

Consider a complete binary tree where the left and right subtrees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is...

16.2k views

commented Jan 21, 2016

1 answer

5

why does the ternary operator evaluates to a garbage value in the below code ?
#include<stdio.h> int main(){ int test=0; float a = 3424.34; printf("hello \n %d",(test? a: 3)); return 0; } It is giving output as hello 0 ,I am unable to understand the logic for this so plz clarify this .

#include<stdio.h int main(){ int test=0; float a = 3424.34; printf("hello \n %d",(test? a: 3)); return 0; }It is giving output as hello 0 ,I am unable to understand the l...

666 views

commented Jan 20, 2016

1 answer

6

B+Tree
1.Following key values are inserted into B+ tree where each node have 2 key values .The sum of keys present at height 1 (height is at 0) is 8,5,1,7,3,12,9,6 . 2.In a database field the search key field is 9 bytes long the block size is 512 bytes ... is 7 bytes .The largest possible order of a non leaf node in B+ Tree implementing this file structure{order defines max no. of keys present} is

1.Following key values are inserted into B+ tree where each node have 2 key values .The sum of keys present at height 1 (height is at 0) is 8,5,1,7,3,12,9,6 .2.In a da...

1.4k views

commented Jan 20, 2016

5 answers

7

Number of nodes in heap of height 'h'
The number of nodes of height $h$ in any $n$-element heap is ________. $h$ $2^{h}$ ceil $\left[\frac{n}{2^{h}}\right]$ ceil $\left[\frac{n}{2^{h+1}}\right]$ Answer is given as D, But I think it should be C. Because, even if you take height=1 then possible nodes are 3 and 2.

The number of nodes of height $h$ in any $n$-element heap is ________.$h$$2^{h}$ceil $\left[\frac{n}{2^{h}}\right]$ceil $\left[\frac{n}{2^{h+1}}\right]$Answer is given as...

14.1k views

answered Jan 19, 2016

5 answers

8

What is the time complexity to construct binary search tree when inorder and postorder traversal of tree is given?

6.7k views

commented Jan 19, 2016

5 answers

9

GATE CSE 2007 | Question: 71
Consider the following program segment. Here $\text{R1, R2}$ and $\text{R3}$ ... word addressable. The number of memory references for accessing the data in executing the program completely is $10$ $11$ $20$ $21$

Consider the following program segment. Here $\text{R1, R2}$ and $\text{R3}$ are the general purpose registers.$$\begin{array}{|l|l|l|c|} \hline & \text {Instruction} & \...

22.1k views

commented Jan 16, 2016

4 answers

10

GATE CSE 2008 | Question: 71
Consider a machine with a $2$-way set associative data cache of size $64\text{Kbytes}$ and block size $16\text{bytes}$. The cache is managed using $32\;\text{bit}$ virtual addresses and the page size is $4\text{Kbytes}$. A program to be run on this ... total size of the tags in the cache directory is: $32\text{Kbits}$ $34\text{Kbits}$ $64\text{Kbits}$ $68\text{Kbits}$

Consider a machine with a $2$-way set associative data cache of size $64\text{Kbytes}$ and block size $16\text{bytes}$. The cache is managed using $32\;\text{bit}$ virtua...

18.7k views

comment edited Jan 16, 2016

5 answers

11

GATE CSE 2001 | Question: 1.7, ISRO2008-18
More than one word are put in one cache block to: exploit the temporal locality of reference in a program exploit the spatial locality of reference in a program reduce the miss penalty none of the above

More than one word are put in one cache block to:exploit the temporal locality of reference in a programexploit the spatial locality of reference in a programreduce the m...

17.0k views

commented Jan 16, 2016

7 answers

12

GATE CSE 2005 | Question: 19
Which one of the following is true for a CPU having a single interrupt request line and a single interrupt grant line? Neither vectored interrupt nor multiple interrupting devices are possible Vectored interrupts are not possible ... and multiple interrupting devices are both possible Vectored interrupts are possible but multiple interrupting devices are not possible

Which one of the following is true for a CPU having a single interrupt request line and a single interrupt grant line?Neither vectored interrupt nor multiple interrupting...

21.0k views

answered Jan 14, 2016

1 answer

13

Verify whether 4-3-1-1 code is self complementing or nt?
Please provide codes for 0-9 decimal using 4311 code..i am little bit confused in it..I know the property that addition 9 makes it self complemetory..but how m nt understanding..plz help..

Please provide codes for 0-9 decimal using 4311 code..i am little bit confused in it..I know the property that addition 9 makes it self complemetory..but how m nt underst...

1.5k views

answer selected Jan 13, 2016

2 answers

14

Limits
Please give the answer with full solution.

Please give the answer with full solution.

755 views

answer selected Jan 6, 2016

6 answers

15

GATE CSE 2003 | Question: 31
Let $(S, \leq)$ be a partial order with two minimal elements a and b, and a maximum element c. Let P: S $\to$ {True, False} be a predicate defined on S. Suppose that P(a) = True, P(b) = False and P(x) $\implies$ P(y) for all $x, y \in S$ satisfying $x \leq y$ ... for all x $\in$ S such that b ≤ x and x ≠ c P(x) = False for all x $\in$ S such that a ≤ x and b ≤ x

Let $(S, \leq)$ be a partial order with two minimal elements a and b, and a maximum element c. Let P: S $\to$ {True, False} be a predicate defined on S. Suppose that P(...

11.7k views

comment edited Dec 29, 2015

3 answers

16

How to represent the below proposition using a well-defined formula ?
The only even prime is 2.

The only even prime is 2.

829 views

commented Dec 29, 2015

0 answers

17

For a length of string n,how many transactions will be there for acceptance of the string?
For a length of string n,how many transactions will be there for acceptance of the string? O(n) O(n^2) O(nlogn) O(n^3)

For a length of string n,how many transactions will be there for acceptance of the string?O(n)O(n^2)O(nlogn)O(n^3)

395 views

commented Dec 24, 2015

1 answer

18

How many recoverable schedules are possible from T1 and T2?
Consider the following Two Transactions. A) How many recoverable schedules can be formed over $T_{1}$ & $T_{2}$ ? $51$ $52$ $55$ $56$ B) How many cascadeless recoverable schedules can be formed over $T_{1}$ & $T_{2}$ ? $41$ $42$ $45$ $50$

Consider the following Two Transactions.A) How many recoverable schedules can be formed over $T_{1}$ & $T_{2}$ ?$51$$52$$55$$56$ B) How many cascadeless recoverable s...

4.6k views

commented Dec 22, 2015

1 answer

19

Find best choice for degree for B+ tree,
Consider a relation R(A B C) with attribute size of A as 8 bytes. Disk block size is 512 bytes and block pointer is 8 bytes. The best choice for degree (maximum value) for B+ tree, if B+ tree was used for creating indexing on R(A B C) is _________.

Consider a relation R(A B C) with attribute size of A as 8 bytes. Disk block size is 512 bytes and block pointer is 8 bytes. The best choice for degree (maximum value) fo...

2.4k views

commented Dec 21, 2015

18 answers

20

GATE CSE 2017 Set 2 | Question: 44
Two transactions $T_1$ and $T_2$ are given as $T_1:r_1(X)w_1(X)r_1(Y)w_1(Y)$ $T_2:r_2(Y)w_2(Y)r_2(Z)w_2(Z)$ where $r_i(V)$ denotes a $\textit{read}$ operation by transaction $T_i$ on a variable $V$ and $w_i(V)$ denotes a ... by transaction $T_i$ on a variable $V$. The total number of conflict serializable schedules that can be formed by $T_1$ and $T_2$ is ______

Two transactions $T_1$ and $T_2$ are given as$T_1:r_1(X)w_1(X)r_1(Y)w_1(Y)$$T_2:r_2(Y)w_2(Y)r_2(Z)w_2(Z)$where $r_i(V)$ denotes a $\textit{read}$ operation by transaction...

72.6k views

commented Dec 21, 2015

1 answer

21

superkeys possible

631 views

commented Dec 21, 2015

8 answers

22

GATE CSE 2009 | Question: 55
Consider the following relational schema: $\text{Suppliers}(\underline{\text{sid:integer}},\text{ sname:string, city:string, street:string})$ $\text{Parts}(\underline{\text{pid:integer}}, \text{ pname:string, color:string})$ ... of all suppliers who have supplied only non-blue part. Find the names of all suppliers who have not supplied only blue parts.

Consider the following relational schema:$\text{Suppliers}(\underline{\text{sid:integer}},\text{ sname:string, city:string, street:string})$ $\text{Parts}(\underline{\tex...

38.5k views

commented Dec 16, 2015

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