Recent activity by ♥_Less / GATE Overflow for GATE CSE

12 answers

1

GATE CSE 2009 | Question: 44
The following key values are inserted into a $B+$ - tree in which order of the internal nodes is $3$, and that of the leaf nodes is $2$, in the sequence given below. The order of internal nodes is the maximum number of tree pointers in each node, and the ... $1$ The maximum number of times leaf nodes would get split up as a result of these insertions is $2$ $3$ $4$ $5$

The following key values are inserted into a $B+$ - tree in which order of the internal nodes is $3$, and that of the leaf nodes is $2$, in the sequence given below. The ...

37.2k views

commented Feb 1, 2018

2 answers

2

MadeEasy Test Series: Theory Of Computation
(a^n)^m b^n where n>=0 and m>1 is a) regular b) cfl c) csl d) none

(a^n)^m b^n where n>=0 and m>1 isa) regularb) cflc) csld) none

610 views

asked Jan 29, 2018

4 answers

3

MadeEasy Test Series: Combinatory - Permutations And Combinations
MY SOLUTION : Fix the root then next level 2 elements ( 2! possibilities) next level 4 elements( 4! possibilities) last level 2 elements ( 2! possibilities) total possibility = 2! * 4! * 2! = 2 * 24 * 2 = 96 what ... that if node of above graph is filled with these elements it satisfies max heap property a)96 b)896 c)2688 d) none

MY SOLUTION :Fix the rootthen next level 2 elements ( 2! possibilities)next level 4 elements( 4! possibilities)last level 2 elements ( 2! possibilities)total possibility ...

3.8k views

answered Jan 25, 2018

2 answers

4

TEST SERIES
PLZ EXPLAIN?

PLZ EXPLAIN?

509 views

answered Jan 25, 2018

5 answers

5

GATE CSE 2013 | Question: 48
The following code segment is executed on a processor which allows only register operands in its instructions. Each instruction can have atmost two source operands and one destination operand. Assume that all variables are dead after this code segment. c = ... while preserving correctness. What is the minimum number of spills to memory in the compiled code? 0 1 2 3

The following code segment is executed on a processor which allows only register operands in its instructions. Each instruction can have atmost two source operands and on...

28.6k views

commented Jan 15, 2018

0 answers

6

Relational algebra
I have two doubts: 1) A natural join B What will be the result when B don't have any tuple in it. Like in B their is relational algebra expression which is selecting Cars of green color but their is no green color car in table. What will be the ... B In above divison if B is a relational algebra expression returning nothing ( like the B in case 1). What will be the result ?

I have two doubts:1) A natural join B What will be the result when B don't have any tuple in it. Like in B their is relational algebra expression which is selecting Cars ...

435 views

commented Jan 14, 2018

2 answers

7

Ace Test series: Operating System - Fork
What is the number of child process created ? Answer given was 63, BUT i am getting 9 !

What is the number of child process created ?Answer given was 63, BUT i am getting 9 !

1.8k views

commented Jan 14, 2018

1 answer

8

MadeEasy Test Series: Combinatory - Pigeonhole Principle
A community of 5 members is to be formed out of 10 people. The names are written in chits of paper and put into 6 boxes. So how many chits will go into the same box? Anyone, please make me understand this question.

A community of 5 members is to be formed out of 10 people. The names are written in chits of paper and put into 6 boxes. So how many chits will go into the same box? Anyo...

2.9k views

commented Jan 11, 2018

1 answer

9

Time complexity
Worst case time complexity of following code? Please explain in detail. void function(int n) { int count = 0; for (int i=0; i<n; i++) for (int j=i; j< i*i; j++) if (j%i == 0) { for (int k=0; k<j; k++) printf("*"); } }

Worst case time complexity of following code? Please explain in detail.void function(int n) { int count = 0; for (int i=0; i<n; i++) for (int j=i; j< i*i; j++) if (j%i ==...

4.5k views

commented Jan 10, 2018

6 answers

10

Consider a hash table with ‘m’ slots that uses chaining for collision resolution.
Consider a hash table with $m$ slots that uses chaining for collision resolution. The table is initially empty. What is the probability that after 4 keys are inserted that at least a chain of size 3 is created? (Assume simple uniform ... $m^{–3} (m – 1)$ $3m^{–1}$

Consider a hash table with $m$ slots that uses chaining for collision resolution. The table is initially empty. What is the probability that after 4 keys are inserted tha...

7.9k views

commented Jan 10, 2018

5 answers

11

GATE CSE 2006 | Question: 23
$F$ is an $n\times n$ real matrix. $b$ is an $n\times 1$ real vector. Suppose there are two $n\times 1$ vectors, $u$ and $v$ such that, $u ≠ v$ and $Fu = b, Fv = b$. Which one of the following statements is false? Determinant of $F$ is zero. There are an infinite number of solutions to $Fx = b$ There is an $x≠0$ such that $Fx = 0$ $F$ must have two identical rows

$F$ is an $n\times n$ real matrix. $b$ is an $n\times 1$ real vector. Suppose there are two $n\times 1$ vectors, $u$ and $v$ such that, $u ≠ v$ and $Fu = b, Fv = b$. Wh...

10.1k views

commented Jan 2, 2018

7 answers

12

GATE IT 2008 | Question: 29
If $M$ is a square matrix with a zero determinant, which of the following assertion (s) is (are) correct? S1: Each row of $M$ can be represented as a linear combination of the other rows S2: Each column of $M$ can be represented as a linear combination of the other columns S3 ... solution S4: $M$ has an inverse $S3$ and $S2$ $S1$ and $S4$ $S1$ and $S3$ $S1, S2$ and $S3$

If $M$ is a square matrix with a zero determinant, which of the following assertion (s) is (are) correct?S1: Each row of $M$ can be represented as a linear combination of...

9.7k views

commented Jan 1, 2018

4 answers

13

GATE CSE 2014 Set 1 | Question: 5
The value of the dot product of the eigenvectors corresponding to any pair of different eigenvalues of a $4-by-4$ symmetric positive definite matrix is ___________

The value of the dot product of the eigenvectors corresponding to any pair of different eigenvalues of a $4-by-4$ symmetric positive definite matrix is ___________

14.6k views

commented Jan 1, 2018

9 answers

14

GATE IT 2005 | Question: 36
Let $P(x)$ and $Q(x)$ ...

Let $P(x)$ and $Q(x)$ be arbitrary predicates. Which of the following statements is always TRUE?$\left(\left(\forall x \left(P\left(x\right) \vee Q\left(x\right)\right)\r...

14.9k views

commented Dec 31, 2017

1 answer

15

implication VS conjunction
When should we use implication and when conjunction? For example in this question: https://gateoverflow.in/989/gate2006-26?show=188041#c188041 What is the difference in options B and D?

When should we use implication and when conjunction? For example in this question:https://gateoverflow.in/989/gate2006-26?show=188041#c188041What is the difference in opt...

1.0k views

commented Dec 31, 2017

6 answers

16

GATE CSE 2006 | Question: 26
Which one of the first order predicate calculus statements given below correctly expresses the following English statement? Tigers and lions attack if they are hungry or threatened. ...

Which one of the first order predicate calculus statements given below correctly expresses the following English statement? Tigers and lions attack if they are hungry or ...

9.3k views

commented Dec 31, 2017

3 answers

17

GATE IT 2006 | Question: 28
The following definite integral evaluates to $\int_{-\infty}^{0} e^ {-\left(\frac{x^2}{20} \right )}dx$ $\frac{1}{2}$ $\pi \sqrt{10}$ $\sqrt{10}$ $\pi$

The following definite integral evaluates to$$\int_{-\infty}^{0} e^ {-\left(\frac{x^2}{20} \right )}dx$$$\frac{1}{2}$$\pi \sqrt{10}$$\sqrt{10}$$\pi$

5.1k views

commented Dec 30, 2017

4 answers

18

GATE IT 2007 | Question: 58
A demand paging system takes $100$ time units to service a page fault and $300$ time units to replace a dirty page. Memory access time is $1$ time unit. The probability of a page fault is $p$ ... that the average access time is $3$ time units. Then the value of $p$ is $0.194$ $0.233$ $0.514$ $0.981$

A demand paging system takes $100$ time units to service a page fault and $300$ time units to replace a dirty page. Memory access time is $1$ time unit. The probability o...

22.9k views

commented Dec 28, 2017

4 answers

19

GATE CSE 2013 | Question: 53
A computer uses $46\text{-bit}$ virtual address, $32\text{-bit}$ physical address, and a three-level paged page table organization. The page table base register stores the base address of the first-level table $\text{(T1)},$ which occupies exactly one ... to guarantee that no two synonyms map to different sets in the processor cache of this computer? $2$ $4$ $8$ $16$

A computer uses $46\text{-bit}$ virtual address, $32\text{-bit}$ physical address, and a three–level paged page table organization. The page table base register stores ...

30.3k views

commented Dec 28, 2017

6 answers

20

GATE CSE 2014 Set 2 | Question: 20
A FAT (file allocation table) based file system is being used and the total overhead of each entry in the FAT is $4$ bytes in size. Given a $100 \times 10^6$ bytes disk on which the file system is stored and data block size is $10^3$ bytes, the maximum size of a file that can be stored on this disk in units of $10^6$ bytes is _________.

A FAT (file allocation table) based file system is being used and the total overhead of each entry in the FAT is $4$ bytes in size. Given a $100 \times 10^6$ bytes disk o...

20.9k views

commented Dec 26, 2017

10 answers

21

GATE CSE 2014 Set 1 | Question: 44
An access sequence of cache block addresses is of length $N$ and contains n unique block addresses. The number of unique block addresses between two consecutive accesses to the same block address is bounded above by $k$. What is the miss ratio if the access sequence is passed ... $\left(\dfrac{1}{N}\right)$ $\left(\dfrac{1}{A}\right)$ $\left(\dfrac{k}{n}\right)$

An access sequence of cache block addresses is of length $N$ and contains n unique block addresses. The number of unique block addresses between two consecutive accesses ...

22.8k views

commented Dec 23, 2017

3 answers

22

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

commented Dec 18, 2017

5 answers

23

GATE IT 2007 | Question: 84
Consider the $B^+$ tree in the adjoining figure, where each node has at most two keys and three links. Keys $K15$ and then $K25$ are inserted into this tree in that order. Exactly how many of the following nodes (disregarding the links) will be present in the tree after the two insertions? $1$ $2$ $3$ $4$

Consider the $B^+$ tree in the adjoining figure, where each node has at most two keys and three links.Keys $K15$ and then $K25$ are inserted into this tree in that order....

16.2k views

commented Dec 16, 2017

4 answers

24

MADE EASY TEST SERIES
Consider a clocked sequential circuit as shown in the figure below. Assuming initial state to be Q1 Q0 = 00 For an input sequence X = 1010, the respective output sequence will be _______.

Consider a clocked sequential circuit as shown in the figure below. Assuming initial state to be Q1 Q0 = 00For an input sequence X = 1010, the respective output sequence ...

2.3k views

commented Dec 15, 2017

1 answer

25

MadeEasy Subject Test: Theory of Computation - Decidability
1) L is undecidable 2) L is decidable 3) L is regular 4) none Answer given: 1) undecidable My solution: Since L(M) is reducible to a CFL language and since all CFL are recursive that means language accepted by M is ... halts on all inputs so this language will too and answer should be decidable. How to approach this type of question ?

1) L is undecidable2) L is decidable3) L is regular4) none Answer given: 1) undecidableMy solution: Since L(M) is reducible to a CFL language and since all CFL are recurs...

735 views

commented Nov 30, 2017

1 answer

26

Grammars
HI Mates, Is it true or false..? If yes or no please explain..? Every Regular set has a LR(1) Grammar....?

HI Mates, Is it true or false..? If yes or no please explain..?Every Regular set has a LR(1) Grammar....?

321 views

answered Nov 30, 2017

2 answers

27

Self doubt in TOC
Suppose in question we are given the language is Turing Recognizable , can I consider it a CFL or Regular?

Suppose in question we are given the language is Turing Recognizable , can I consider it a CFL or Regular?

863 views

answered Nov 30, 2017

1 answer

28

Self doubt in terminologies and turing machine
1) I know that turing decidable means recursive language. But does is also means its decidable? So basically i want to know if REC imples decidability and RE implies undecidability or not. I got confused with word decidable in " ... same expressive power why can't we use DTM in NP decision problems? Thanks for being patient and reading doubt.

1) I know that turing decidable means recursive language. But does is also means its decidable? So basically i want to know if REC imples decidability and RE implies unde...

1.1k views

answer selected Nov 30, 2017

3 answers

29

Self doubt in decidability in TOC
Suppose in question we are given the language is Turing Decidable , can I consider it a CFL or Regular?

Suppose in question we are given the language is Turing Decidable , can I consider it a CFL or Regular?

652 views

answered Nov 29, 2017

1 answer

30

TOC closure property doubt
If a language L1 is given as anbn and L2 is given as {a,b}* , then the language L1 - L2 will be : regular or CFL and why ? My doubt is that since L2 is a regular language and L1 is CFL and L2 will contain all strings in L1, so ... ). Complement of regular is regular and intersection of CFL with regular is closed and the language will be CFL. Which one is right and why ?

If a language L1 is given as anbn and L2 is given as {a,b}* , then the language L1 - L2 will be : regular or CFL and why ?My doubt is that since L2 is a regular language...

557 views

answered Nov 29, 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