Recent activity by adarsh_1997 / GATE Overflow for GATE CSE

2 answers

1

Test by Bikram | Databases | Test 1 | Question: 14
Let there is a Table named Stud_records with $3000$ records of fixed length, each record size is $50$ Bytes and records are stored in a block of size $512$ Bytes, If secondary index is built on the key field of size $10$ Bytes and a block pointer of size $5$ Bytes , then the number of first level index blocks are ______

Let there is a Table named Stud_records with $3000$ records of fixed length, each record size is $50$ Bytes and records are stored in a block of size $512$ Bytes, If sec...

930 views

commented Jan 1, 2020

5 answers

2

GATE CSE 2015 Set 2 | Question: 46
Consider a simple checkpointing protocol and the following set of operations in the log. (start, T4); (write, T4, y, 2, 3); (start, T1); (commit, T4); (write, T1, z, 5, 7); (checkpoint); (start, T2); (write, T2, x, 1, 9); (commit, T2); (start, T3); ( ... Undo: T3, T1; Redo: T2 Undo: T3, T1; Redo: T2, T4 Undo: none; Redo: T2, T4, T3, T1 Undo: T3, T1, T4; Redo: T2

Consider a simple checkpointing protocol and the following set of operations in the log.(start, T4); (write, T4, y, 2, 3); (start, T1); (commit, T4); (write, T1, z, 5, 7)...

24.8k views

commented Dec 21, 2019

1 answer

3

Transaction self doubt
Is it recoverable and why?

Is it recoverable and why?

418 views

commented Dec 21, 2019

8 answers

4

GATE IT 2005 | Question: 42
Two concurrent processes $P1$ and $P2$ use four shared resources $R1, R2, R3$ and $R4$ ... binary semaphores are used to enforce the above scheduling constraints, what is the minimum number of binary semaphores needed? $1$ $2$ $3$ $4$

Two concurrent processes $P1$ and $P2$ use four shared resources $R1, R2, R3$ and $R4$, as shown below.$$\begin{array}{|l|l|}\hline \textbf{P1} & \textbf{P2} \\ \text...

12.9k views

commented Oct 1, 2019

2 answers

5

GATE CSE 1990 | Question: 13a
Consider the height-balanced tree $T_{t}$ with values stored at only the leaf nodes, shown in Fig$.4.$ (i) Show how to merge to the tree, $T_{1}$ elements from tree $T_{2}$ shown in Fig$.5$ using node D of tree $T_{1}$. (ii) What is the ... where $T_{1}$ and $T_{2}$ are of height $h_{1}$ and $h_{2}$ respectively, assuming that rotation schemes are given. Give reasons.

Consider the height-balanced tree $T_{t}$ with values stored at only the leaf nodes, shown in Fig$.4.$(i) Show how to merge to the tree, $T_{1}$ elements from tree $T_{2}...

3.9k views

commented Sep 4, 2019

3 answers

6

QUICK SORT- SELF DOUBT
In quick sort for sorting of n Numbers, the 75th greatest Element is selected as pivot using $O(n^2)$ time complexity algorithm than what is the worst case time complexity of quick sort. O($n^2$) O($n^3$) O(nlogn) O(n)

In quick sort for sorting of n Numbers, the 75th greatest Element is selected as pivot using $O(n^2)$ time complexity algorithm than what is the worst case time complexit...

3.6k views

commented Sep 3, 2019

4 answers

7

GATE CSE 2013 | Question: 33
Consider the DFA $A$ given below. Which of the following are FALSE? Complement of $L(A)$ is context-free. $L(A) = L((11^*0+0)(0 + 1)^*0^*1^*) $ For the language accepted by $A, A$ is the minimal DFA. $A$ accepts all strings over $\{0, 1\}$ of length at least $2$. 1 and 3 only 2 and 4 only 2 and 3 only 3 and 4 only

Consider the DFA $A$ given below. Which of the following are FALSE?Complement of $L(A)$ is context-free.$L(A) = L((11^*0+0)(0 + 1)^*0^*1^*) $For the language accepted by ...

16.4k views

answered Aug 16, 2019

8 answers

8

GATE CSE 1996 | Question: 2.13, ISRO2016-28
The average number of key comparisons required for a successful search for sequential search on $n$ items is $\frac{n}{2}$ $\frac{n-1}{2}$ $\frac{n+1}{2}$ None of the above

The average number of key comparisons required for a successful search for sequential search on $n$ items is$\frac{n}{2}$$\frac{n-1}{2}$$\frac{n+1}{2}$None of the above

31.7k views

answered Jul 31, 2019

16 answers

9

GATE CSE 2014 Set 1 | Question: 39
The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________

The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________

54.2k views

commented Jul 31, 2019

13 answers

10

GATE IT 2007 | Question: 29
When searching for the key value $60$ in a binary search tree, nodes containing the key values $10, 20, 40, 50, 70, 80, 90$ are traversed, not necessarily in the order given. How many different orders are possible in which these key values can occur on the search path from the root to the node containing the value $60$? $35$ $64$ $128$ $5040$

When searching for the key value $60$ in a binary search tree, nodes containing the key values $10, 20, 40, 50, 70, 80, 90$ are traversed, not necessarily in the order gi...

39.4k views

commented Jul 30, 2019

4 answers

11

GATE CSE 2006 | Question: 13
A scheme for storing binary trees in an array $X$ is as follows. Indexing of $X$ starts at $1$ instead of $0$. the root is stored at $X[1]$. For a node stored at $X[i]$, the left child, if any, is stored in $X[2i]$ and the right child, if any, in $X[2i+1]$. To be able to store any binary tree on n vertices the minimum size of $X$ should be $\log_2 n$ $n$ $2n+1$ $2^n-1$

A scheme for storing binary trees in an array $X$ is as follows. Indexing of $X$ starts at $1$ instead of $0$. the root is stored at $X $. For a node stored at $X[i]$, th...

17.3k views

commented Jul 28, 2019

4 answers

12

GATE CSE 2015 Set 3 | Question: 19
Consider the following array of elements. $\langle 89, 19, 50, 17, 12, 15, 2, 5, 7, 11, 6, 9, 100 \rangle$ The minimum number of interchanges needed to convert it into a max-heap is $4$ $5$ $2$ $3$

Consider the following array of elements.$\langle 89, 19, 50, 17, 12, 15, 2, 5, 7, 11, 6, 9, 100 \rangle$The minimum number of interchanges needed to convert it into a ma...

9.1k views

commented Jul 27, 2019

5 answers

13

GATE CSE 2006 | Question: 10
In a binary max heap containing $n$ numbers, the smallest element can be found in time $O(n)$ $O(\log n)$ $O(\log \log n)$ $O(1)$

In a binary max heap containing $n$ numbers, the smallest element can be found in time $O(n)$ $O(\log n)$ $O(\log \log n)$ $O(1)$

20.8k views

commented Jul 27, 2019

6 answers

14

GATE CSE 2016 Set 2 | Question: 37
Consider the following program: int f (int * p, int n) { if (n <= 1) return 0; else return max (f (p+1, n-1), p[0] - p[1]); } int main () { int a[] = {3, 5, 2, 6, 4}; printf(" %d", f(a, 5)); } Note: $\max (x, y)$ returns the maximum of $x$ and $y$. The value printed by this program is ________.

Consider the following program:int f (int * p, int n) { if (n <= 1) return 0; else return max (f (p+1, n-1), p[0] - p ); } int main () { int a[] = {3, 5, 2, 6, 4}; ...

13.6k views

commented Jul 22, 2019

6 answers

15

GATE CSE 2015 Set 1 | Question: 35
What is the output of the following C code? Assume that the address of $x$ is $2000$ (in decimal) and an integer requires four bytes of memory. int main () { unsigned int x [4] [3] = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}, {10, 11, 12}}; printf ("%u, %u, %u", x + 3, *(x + 3), *(x + 2) + 3); } $2036, 2036, 2036$ $2012, 4, 2204$ $2036, 10, 10$ $2012, 4, 6$

What is the output of the following C code? Assume that the address of $x$ is $2000$ (in decimal) and an integer requires four bytes of memory.int main () { unsigned int ...

28.3k views

commented Jul 19, 2019

4 answers

16

GATE CSE 2014 Set 2 | Question: 42
Consider the C function given below. int f(int j) { static int i = 50; int k; if (i == j) { printf("something"); k = f(i); return 0; } else return 0; } Which one of the following is TRUE? The function returns $0$ for all ... . The function returns $0$ when $j = 50$. The function will exhaust the runtime stack or run into an infinite loop when $j = 50$.

Consider the C function given below.int f(int j) { static int i = 50; int k; if (i == j) { printf("something"); k = f(i); return 0; } else return 0; }Which one of the fol...

9.0k views

commented Jul 19, 2019

5 answers

17

GATE CSE 2014 Set 1 | Question: 10
Consider the following program in C language: #include <stdio.h> main() { int i; int*pi = &i; scanf("%d",pi); printf("%d\n", i+5); } Which one of the following statements is TRUE? Compilation fails. Execution ... $5$ more than the address of variable $i$. On execution, the value printed is $5$ more than the integer value entered.

Consider the following program in C language:#include <stdio.h main() { int i; int*pi = &i; scanf("%d",pi); printf("%d\n", i+5); }Which one of the following statements is...

17.5k views

commented Jul 19, 2019

6 answers

18

GATE IT 2006 | Question: 49
Which one of the choices given below would be printed when the following program is executed ? #include <stdio.h> struct test { int i; char *c; }st[] = {5, "become", 4, "better", 6, "jungle", 8, "ancestor", 7, " ... $\text{etter, u, 6, ungle}$ $\text{cetter, k, 6, jungle}$ $\text{etter, u, 8, ncestor}$

Which one of the choices given below would be printed when the following program is executed ?#include <stdio.h struct test { int i; char *c; }st[] = {5, "become", 4, "be...

27.2k views

commented Jul 19, 2019

3 answers

19

GATE IT 2004 | Question: 58
Consider the following C program which is supposed to compute the transpose of a given $4 \times 4$ matrix $M$. Note that, there is an $X$ in the program which indicates some missing statements. Choose the correct option to replace $X$ in the program. #include<stdio.h> #define ROW 4 #define COL 4 ... j < 4; ++j){ M[i][j] = t; t = M[j][i]; M[j][i] = M[i][j]; }

Consider the following C program which is supposed to compute the transpose of a given $4 \times 4$ matrix $M$. Note that, there is an $X$ in the program which indicates ...

12.3k views

commented Jul 19, 2019

14 answers

20

GATE CSE 2012 | Question: 12
What is the complement of the language accepted by the NFA shown below? Assume $\Sigma = \{a\}$ and $\epsilon$ is the empty string. $\phi$ $\{\epsilon\}$ $a^*$ $\{a , \epsilon\}$

What is the complement of the language accepted by the NFA shown below?Assume $\Sigma = \{a\}$ and $\epsilon$ is the empty string.$\phi$$\{\epsilon\}$$a^*$$\{a , \epsilon...

19.4k views

answered Jul 2, 2019

1 answer

21

Made Easy
A hypothetical 5 stage processor is designed in which branch is predicted at 3 stage and each stage takes 1 cycle to compute its task. If f is the probability of an instruction being a branch instruction then what is the value of F such that speed up is atleast 3?

A hypothetical 5 stage processor is designed in which branch is predicted at 3 stage and each stage takes 1 cycle to compute its task. If f is the probability of an instr...

445 views

commented Jan 23, 2019

0 answers

22

Made Easy CBT 19
What is optimal and Estimated Cost here, and why eliminate option A and C, why option B is correct.

What is optimal and Estimated Cost here, and why eliminate option A and C, why option B is correct.

419 views

commented Jan 15, 2019

0 answers

23

ME_test_series
Assume in TCP client is sending segment to server. After successfully receiving segments from client, server is waiting for next segments and clients is also waiting for acknowledgment from the server and this lead to deadlock situation. Which timer is used and who ... timer, client Keep alive timer, client I am not understand how persistent timer is used and what is it used for?

Assume in TCP client is sending segment to server. After successfully receiving segments from client, server is waiting for next segments and clients is also waiting for ...

1.2k views

commented Jan 13, 2019

0 answers

24

Gate-2019
ER- no of tables?

ER- no of tables?

643 views

commented Jan 10, 2019

1 answer

25

MadeEasy Test Series: CO & Architecture - Cache Memory
A : LRU replacement policy is not applicable to direct mapped caches B : A unique memory page is associated with every cache page in direct mapped caches Options: 1) Both True 2) Both False 3) A is True and B is false 4) B is True and A is false

A : LRU replacement policy is not applicable to direct mapped cachesB : A unique memory page is associated with every cache page in direct mapped cachesOptions:1) Both Tr...

2.3k views

commented Jan 9, 2019

0 answers

26

made easy test
How many concurrent schedules are conflict serializable of given transactions T1 and T2:

How many concurrent schedules are conflict serializable of given transactions T1 and T2:

236 views

commented Jan 9, 2019

0 answers

27

MadeEasy Test Series: Databases - Sql
I got why query 2 is wrong. How do I approach to understand Query 1, is there a generic approach for solving questions like these which have no tables given?

I got why query 2 is wrong. How do I approach to understand Query 1, is there a generic approach for solving questions like these which have no tables given?

500 views

commented Jan 8, 2019

1 answer

28

Natural Join
Suppose we have 2 tables R1(ABCD), R2(DE) . R1 has 500 entries whereas R2 has 1500 entries. Here D is a candidate key. If we join them using natural join. How many entires would be there in the resultant table and why ? Examples would be appreciated..

Suppose we have 2 tables R1(ABCD), R2(DE) . R1 has 500 entries whereas R2 has 1500 entries. Here D is a candidate key. If we join them using natural join. How many entire...

766 views

comment edited Jan 8, 2019

0 answers

29

Number of conflict serial orderings (with commit) Applied Course FT-1
Consider the following order of transactions: T2: R(y); T3:W(y); T3: commit; T1: W(y); T1: commit; T2: R(x); T2: W(z); T2: commit; T4: R(y);T4: R(x); T4: commit. Let the above schedule be S, if S is serializable, then how many conflict serial orderings of S is possible?___________

Consider the following order of transactions:T2: R(y); T3:W(y); T3: commit; T1: W(y); T1: commit; T2: R(x); T2: W(z); T2: commit; T4: R(y);T4: R(x); T4: commit.Let the ab...

2.0k views

commented Jan 8, 2019

0 answers

30

Merge Sort
Can anyone help me to understand this problem….??

Can anyone help me to understand this problem….??

1.0k views

commented Jan 8, 2019

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