The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent activity by nilamd
User nilamd
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User nilamd
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
1
answer
1
f(n)=log n! ,g(n)=n logn what is the relationship between them?
answer selected
Feb 2, 2016
in
DS

479
views
asymptoticnotations
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
commented
Jan 28, 2016
in
Combinatory

172
views
permutationandcombination
7
answers
3
GATE2015148
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 the disk. The ... each sector is half of the time for one complete rotation. The total time (in milliseconds) needed to read the entire file is__________________
commented
Jan 23, 2016
in
Operating System

6.9k
views
gate20151
operatingsystem
disks
normal
numericalanswers
3
answers
4
GATE2015217
Consider a complete binary tree where the left and right subtrees of the root are maxheaps. 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)$
commented
Jan 21, 2016
in
DS

4.3k
views
gate20152
datastructures
heap
normal
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 .
commented
Jan 20, 2016
in
Programming

165
views
programminginc
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
commented
Jan 20, 2016
in
Databases

698
views
btree
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.
answered
Jan 20, 2016
in
DS

3.3k
views
datastructures
binarytree
binaryheap
6
answers
8
What is the time complexity to construct binary search tree when inorder and postorder traversal of tree is given?
commented
Jan 19, 2016
in
DS

1.6k
views
datastructures
bst
3
answers
9
GATE200771
Consider the following program segment. Here $\text{R1, R2}$ and $\text{R3}$ ... is word addressable. The number of memory references for accessing the data in executing the program completely is $10$ $11$ $20$ $21$
commented
Jan 16, 2016
in
CO and Architecture

6.5k
views
gate2007
coandarchitecture
machineinstructions
interrupts
normal
3
answers
10
GATE200871
Consider a machine with a $2$way set associative data cache of size $64$ $Kbytes$ and block size $16$ $bytes$. The cache is managed using $32$ $bi$t virtual addresses and the page size is $4$ $Kbytes$. A program to be run on this machine begins as follows: double ARR[ ... $ARR$. The total size of the tags in the cache directory is: $32$ $Kbits$ $34$ $Kbits$ $64$ $Kbits$ $68$ $Kbits$
comment edited
Jan 16, 2016
in
CO and Architecture

7k
views
gate2008
coandarchitecture
cachememory
normal
4
answers
11
GATE20011.7, ISRO200818
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
commented
Jan 16, 2016
in
CO and Architecture

4.9k
views
gate2001
coandarchitecture
easy
cachememory
isro2008
6
answers
12
GATE200519
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 but ... interrupts and multiple interrupting devices are both possible Vectored interrupts are possible but multiple interrupting devices are not possible
answered
Jan 15, 2016
in
Operating System

5.6k
views
gate2005
operatingsystem
iohandling
normal
1
answer
13
Verify whether 4311 code is self complementing or nt?
Please provide codes for 09 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..
answer selected
Jan 13, 2016
in
Digital Logic

470
views
numberrepresentation
2
answers
14
Limits
Please give the answer with full solution.
answer selected
Jan 7, 2016
in
Calculus

252
views
calculus
limits
3
answers
15
GATE200331
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$ ... False 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
comment edited
Dec 30, 2015
in
Set Theory & Algebra

3.3k
views
gate2003
settheory&algebra
partialorder
normal
propositionallogic
3
answers
16
How to represent the below proposition using a welldefined formula ?
The only even prime is 2.
commented
Dec 29, 2015
in
Mathematical Logic

201
views
0
answers
17
For a length of string n,how many transactions will be there for acceptance of the string?
commented
Dec 24, 2015
in
Theory of Computation

124
views
theoryofcomputation
finiteautomata
4
answers
18
GATE20012.5
Consider a DFA over $\Sigma=\{a,b\}$ accepting all strings which have number of a's divisible by $6$ and number of $b$'s divisible by $8$. What is the minimum number of states that the DFA will have? $8$ $14$ $15$ $48$
commented
Dec 24, 2015
in
Theory of Computation

5.8k
views
gate2001
theoryofcomputation
finiteautomata
minimalstateautomata
1
answer
19
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$
commented
Dec 22, 2015
in
Databases

1.6k
views
transactions
databases
1
answer
20
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 _________.
commented
Dec 22, 2015
in
Databases

643
views
databases
btree
indexing
15
answers
21
GATE2017244
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 $\textit{write}$ operation 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 ______
commented
Dec 22, 2015
in
Databases

20.8k
views
gate20172
databases
transactions
numericalanswers
conflictserializable
1
answer
22
superkeys possible
commented
Dec 21, 2015
in
Databases

328
views
4
answers
23
GATE200955
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})$ ... names of all suppliers who have supplied only nonblue part. Find the names of all suppliers who have not supplied only blue parts.
commented
Dec 16, 2015
in
Databases

7.7k
views
gate2009
databases
sql
normal
50,741
questions
57,245
answers
198,021
comments
104,615
users