Recent activity by kai / GATE Overflow for GATE CSE

1 answer

1

madeeasy
Whether the given language is context free or context sensitive?

Whether the given language is context free or context sensitive?

298 views

answer selected Aug 8, 2018

1 answer

2

combinatorial argument
$\begin{align*} &\text{Prove using combinatorial argument } \\ &1) \qquad \text{For } n \geq k \geq 0 \qquad \left ( n-k \right )\cdot \binom{n}{k} = n \cdot \binom{n-1}{k} \\ &2) \qquad \text{For } n \geq 2 \qquad \quad k \cdot (k-1) \cdot \binom{n}{k} = n \cdot (n-1) \cdot \binom{n-2}{k-2} \\ \end{align*}$

$\begin{align*} &\text{Prove using combinatorial argument } \\ &1) \qquad \text{For } n \geq k \geq 0 \qquad \left ( n-k \right )\cdot \binom{n}{k} = n \cdot \binom{n-1}{...

461 views

commented Jul 2, 2017

1 answer

3

Admission Interviews
People who attended IISc CDS MTech admission interviews on 18th April 2017, can you please share your experience?

People who attended IISc CDS MTech admission interviews on 18th April 2017, can you please share your experience?

1.2k views

commented May 8, 2017

1 answer

4

self-doubt
Are ECE graduates eligible for admissions in IITs/IISc? I gave gate exam in CS and am expecting around 100 rank, Would I be eligible for admissions in IISC/ all IITs? Edit: IISC specifically. I got most of the other info.

Are ECE graduates eligible for admissions in IITs/IISc?I gave gate exam in CS and am expecting around 100 rank, Would I be eligible for admissions in IISC/ all IITs?Edit:...

483 views

commented Mar 24, 2017

1 answer

5

Programming Doubt
How the output of the given code is- How are the binary bits flipping?

How the output of the given code is-How are the binary bits flipping?

460 views

commented Mar 9, 2017

2 answers

6

ISI2015-PCB-C3
For a positive integer $n$, let $G = (V, E)$ be a graph, where $V = \text{{0,1}}^n$, i.e., $V$ is the set of vertices has one to one correspondence with the set of all $n$-bit binary strings and $E = \{(u,v) \mid u, v$ belongs to $V, u$ and $v$ differ in exactly one bit position$\}$. Determine size of $E$ Show that $G$ is connected

For a positive integer $n$, let $G = (V, E)$ be a graph, where $V = \text{{0,1}}^n$, i.e., $V$ is the set of vertices has one to one correspondence with the set of all $n...

1.5k views

answered Mar 8, 2017

2 answers

7

ISI 2015 PCB C2 B
You are given a array $A$ of size $n$. Your are told that $A$ comprises three consecutive runs - first a run of $a$'s, then a run of $b$'s and finally a run of $c$'s. Moreover, you are provided an index of $i$ such that $A[i] = b$. Design an $O(\log n)$ time algorithm to determine the number of $b$'s (i.e., length of the second run) in $A$.

You are given a array $A$ of size $n$. Your are told that $A$ comprises three consecutive runs - first a run of $a$'s, then a run of $b$'s and finally a run of $c$'s. Mor...

1.4k views

answered Mar 8, 2017

1 answer

8

ISRO 2012: [Mech] Complex Numbers
1+ i Is equivalent to (a) √ 2 $e ^{- i π /4 }$ (b) √ 2 $e^ {i π /4}$ (c) 2 $e^ {- i π /4}$ (d) 2 $e^ {i π /4}$

1+ i Is equivalent to(a) √ 2 $e ^{- i π /4 }$(b) √ 2 $e^ {i π /4}$(c) 2 $e^ {- i π /4}$(d) 2 $e^ {i π /4}$

308 views

answered Mar 7, 2017

1 answer

9

Discrete math
Prove the following: $3 \; | \;\left ( a^2+b^2 \right )$ if and only if $3 \; | \;a$ and $3 \; | \;b$.

Prove the following: $3 \; | \;\left ( a^2+b^2 \right )$ if and only if $3 \; | \;a$ and $3 \; | \;b$.

467 views

answer edited Mar 6, 2017

2 answers

10

Stable sorting algorithms
Show that any comparison based sorting algorithm can be made stable without increasing its complexity beyond a constant factor.

Show that any comparison based sorting algorithm can be made stable without increasing its complexity beyond a constant factor.

2.2k views

answer reshown Feb 23, 2017

5 answers

11

GATE CSE 2017 Set 2 | Question: 36
The pre-order traversal of a binary search tree is given by $12, 8, 6, 2, 7, 9, 10, 16, 15, 19, 17, 20$. Then the post-order traversal of this tree is $2, 6, 7, 8, 9, 10, 12, 15, 16, 17, 19, 20$ $2, 7, 6, 10, 9, 8, 15, 17, 20, 19, 16, 12$ $7, 2, 6, 8, 9, 10, 20, 17, 19, 15, 16, 12$ $7, 6, 2, 10, 9, 8, 15, 16, 17, 20, 19, 12$

The pre-order traversal of a binary search tree is given by $12, 8, 6, 2, 7, 9, 10, 16, 15, 19, 17, 20$. Then the post-order traversal of this tree is$2, 6, 7, 8, 9, 10, ...

8.7k views

answered Feb 14, 2017

7 answers

12

GATE CSE 2017 Set 2 | Question: 43
Consider the following snippet of a C program. Assume that swap $(\&x, \&y)$ exchanges the content of $x$ and $y$: int main () { int array[] = {3, 5, 1, 4, 6, 2}; int done =0; int i; while (done==0) { done =1; for (i=0; i<=4; i ... i-1]) { swap(&array[i], &array[i-1]); done =0; } } } printf( %d , array[3]); } The output of the program is _______

Consider the following snippet of a C program. Assume that swap $(\&x, \&y)$ exchanges the content of $x$ and $y$:int main () { int array[] = {3, 5, 1, 4, 6, 2}; int done...

17.0k views

answered Feb 14, 2017

7 answers

13

GATE CSE 2017 Set 2 | Question: 31
For any discrete random variable $X$, with probability mass function $P(X=j)=p_j, p_j \geq 0, j \in \{0, \dots , N \}$, and $\Sigma_{j=0}^N \: p_j =1$, define the polynomial function $g_x(z) = \Sigma_{j=0}^N \: p_j \: z^j$. For a certain ... . The expectation of $Y$ is $N \beta(1-\beta)$ $N \beta$ $N (1-\beta)$ Not expressible in terms of $N$ and $\beta$ alone

For any discrete random variable $X$, with probability mass function$P(X=j)=p_j, p_j \geq 0, j \in \{0, \dots , N \}$, and $\Sigma_{j=0}^N \: p_j =1$, define the polynomi...

16.1k views

answered Feb 14, 2017

4 answers

14

GATE CSE 2017 Set 2 | Question: 12
Given the following binary number in $32$-bit (single precision) $\text{IEEE-754}$ format : $\large 00111110011011010000000000000000$ The decimal value closest to this floating-point number is : $1.45*10^1$ $1.45*10^{-1}$ $2.27*10^{-1}$ $2.27*10^1$

Given the following binary number in $32$-bit (single precision) $\text{IEEE-754}$ format : $\large 00111110011011010000000000000000$Th...

21.8k views

commented Feb 14, 2017

1 answer

15

MadeEasy Subject Test: CO & Architecture - Pipelining

445 views

answer selected Jan 31, 2017

1 answer

16

Ace Test Series: Theory Of Computation - Closure Property
Match the following

Match the following

381 views

asked Jan 31, 2017

2 answers

17

Ace Test Series: Theory Of Computation - Turing Machine
When a Multi-tape TM of time complexity T(N) is reduced to a single tape turing machine, the complexity can go upto?

When a Multi-tape TM of time complexity T(N) is reduced to a single tape turing machine, the complexity can go upto?

747 views

asked Jan 29, 2017

2 answers

18

Ace Test Series: Databases - Transactions
Whether the given schedule is conflict serializable or view serializable or none.

Whether the given schedule is conflict serializable or view serializable or none.

913 views

commented Jan 29, 2017

0 answers

19

Ace Test Series: Algorithms - Time Complexity
Time complexity of the given program is?

Time complexity of the given program is?

438 views

asked Jan 29, 2017

4 answers

20

GATE CSE 2015 Set 3 | Question: 46
Consider a B+ tree in which the search key is $12$ $\text{bytes}$ long, block size is $1024$ $\text{bytes}$, record pointer is $10$ $\text{bytes}$ long and the block pointer is $8$ $\text{bytes}$ long. The maximum number of keys that can be accommodated in each non-leaf node of the tree is ______.

Consider a B+ tree in which the search key is $12$ $\text{bytes}$ long, block size is $1024$ $\text{bytes}$, record pointer is $10$ $\text{bytes}$ long and the block poin...

21.4k views

comment edited Jan 26, 2017

2 answers

21

Test by Bikram | Mock GATE | Test 2 | Question: 31
Consider the disk drive with the following specification: $16$ surfaces, $1024$ tracks/surface, $1024$ sectors/track, $1KB/sector$, rotation speed is $3000 rpm$ and the disk is operated in burst Mode. The processor runs at ... the size of transferred data is $20KB$. The percentage of processor time consumed for the transfer operation is ________.

Consider the disk drive with the following specification:$16$ surfaces, $1024$ tracks/surface, $1024$ sectors/track, $1KB/sector$, rotation speed is $3000 rpm$ and the di...

1.2k views

commented Jan 25, 2017

2 answers

22

MadeEasy Subject Test: Operating System - Process Synchronization
Reader Writer's problem How is deadlock possible in this?

Reader Writer's problemHow is deadlock possible in this?

853 views

asked Jan 24, 2017

0 answers

23

MadeEasy Subject Test: Theory of Computation - Identify Class Language

428 views

asked Jan 24, 2017

0 answers

24

MadeEasy Subject Test: Databases - Joins
Maximum no. of possible records in the result of the following expression is?

Maximum no. of possible records in the result of the following expression is?

232 views

asked Jan 24, 2017

3 answers

25

Ace test Series
Which of the following is CSL?

Which of the following is CSL?

1.1k views

asked Jan 23, 2017

7 answers

26

GATE CSE 2012 | Question: 45
Consider an instance of TCP's Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is $2$ MSS and the threshold at the start of the first transmission is $8$ MSS. Assume that a timeout occurs during ... Find the congestion window size at the end of the tenth transmission. $8$ MSS $14$ MSS $7$ MSS $12$ MSS

Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is $2$ MSS and the t...

38.5k views

commented Jan 18, 2017

11 answers

27

GATE CSE 2015 Set 3 | Question: 36
Two hosts are connected via a packet switch with $10^7$ bits per second links. Each link has a propagation delay of $20$ microseconds. The switch begins forwarding a packet $35$ microseconds after it receives the same. If $10000$ bits of ... between the transmission of the first bit of data and the reception of the last bit of the data in microseconds is ______.

Two hosts are connected via a packet switch with $10^7$ bits per second links. Each link has a propagation delay of $20$ microseconds. The switch begins forwarding a pack...

33.0k views

commented Jan 16, 2017

6 answers

28

GATE IT 2004 | Question: 75
A relation $\text{Empdtl}$ ... and $\textsf{1NF}$ $\textsf{BCNF}$ and hence also in $\textsf{3NF}$, $\textsf{2NF}$ and $\textsf{1NF}$

A relation $\text{Empdtl}$ is defined with attributes empcode (unique), name, street, city, state and pincode. For any pincode, there is only one city and state. Also, fo...

17.8k views

commented Jan 12, 2017

10 answers

29

GATE CSE 2006 | Question: 54
Given two arrays of numbers $a_{1},...,a_{n}$ and $b_{1},...,b_{n}$ where each number is $0$ or $1$, the fastest algorithm to find the largest span $(i, j)$ such that $ a_{i}+a_{i+1}+\dots+a_{j}=b_{i}+b_{i+1}+\dots+b_{j}$ ... time in the key comparison mode Takes $\Theta (n)$ time and space Takes $O(\sqrt n)$ time only if the sum of the $2n$ elements is an even number

Given two arrays of numbers $a_{1},...,a_{n}$ and $b_{1},...,b_{n}$ where each number is $0$ or $1$, the fastest algorithm to find the largest span $(i, j)$ such that $ a...

29.4k views

commented Jan 10, 2017

3 answers

30

GATE CSE 2014 Set 3 | Question: 38
Consider the decision problem $2CNFSAT$ defined as follows: $\left\{ \phi \mid \phi \text{ is a satisfiable propositional formula in CNF with at most two literals per clause}\right\}$ ... by reduction to directed graph reachability. solvable in constant time since any input instance is satisfiable. NP-hard but not NP-complete.

Consider the decision problem $2CNFSAT$ defined as follows:$$\left\{ \phi \mid \phi \text{ is a satisfiable propositional formula in CNF with at most two literals per cla...

3.8k views

commented Jan 6, 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