Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User Kai
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Kai
1
answer
1
madeeasy
Whether the given language is context free or context sensitive?
answer selected
in
Theory of Computation
Aug 8, 2018
286
views
theory-of-computation
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*}$
commented
in
Combinatory
Jul 2, 2017
444
views
non-gate
combinatory
1
answer
3
Admission Interviews
People who attended IISc CDS MTech admission interviews on 18th April 2017, can you please share your experience?
commented
in
Interview Questions
May 8, 2017
1.2k
views
iisc-interview
cds
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.
commented
in
IISc/IITs
Mar 24, 2017
460
views
1
answer
5
Programming Doubt
How the output of the given code is- How are the binary bits flipping?
commented
in
Programming in C
Mar 9, 2017
435
views
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
answered
in
Graph Theory
Mar 8, 2017
1.4k
views
graph-theory
discrete-mathematics
isi2015
graph-connectivity
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$.
answered
in
DS
Mar 8, 2017
1.4k
views
data-structures
array
isi2015
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}$
answered
in
Linear Algebra
Mar 7, 2017
297
views
engineering-mathematics
isro-mech
linear-algebra
1
answer
9
Discrete math
Prove the following: $3 \; | \;\left ( a^2+b^2 \right )$ if and only if $3 \; | \;a$ and $3 \; | \;b$.
answer edited
in
Set Theory & Algebra
Mar 6, 2017
437
views
discrete-mathematics
iitg-math
descriptive
non-gate
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.
answer reshown
in
Algorithms
Feb 23, 2017
2.1k
views
algorithms
descriptive
time-complexity
non-gate
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$
answered
in
DS
Feb 14, 2017
8.6k
views
gatecse-2017-set2
data-structures
binary-search-tree
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 _______
answered
in
Programming in C
Feb 14, 2017
16.8k
views
gatecse-2017-set2
programming
algorithms
numerical-answers
identify-function
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
answered
in
Probability
Feb 14, 2017
15.9k
views
gatecse-2017-set2
probability
random-variable
difficult
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$
commented
in
Digital Logic
Feb 14, 2017
21.6k
views
gatecse-2017-set2
digital-logic
number-representation
floating-point-representation
ieee-representation
1
answer
15
MadeEasy Subject Test: CO & Architecture - Pipelining
answer selected
in
CO and Architecture
Jan 31, 2017
427
views
made-easy-test-series
co-and-architecture
pipelining
1
answer
16
Ace Test Series: Theory Of Computation - Closure Property
Match the following
asked
in
Theory of Computation
Jan 31, 2017
364
views
ace-test-series
test-series
theory-of-computation
closure-property
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?
asked
in
Theory of Computation
Jan 29, 2017
715
views
ace-test-series
test-series
theory-of-computation
turing-machine
2
answers
18
Ace Test Series: Databases - Transactions
Whether the given schedule is conflict serializable or view serializable or none.
commented
in
Databases
Jan 29, 2017
872
views
databases
transaction-and-concurrency
ace-test-series
0
answers
19
Ace Test Series: Algorithms - Time Complexity
Time complexity of the given program is?
asked
in
Algorithms
Jan 29, 2017
421
views
ace-test-series
algorithms
time-complexity
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 ______.
comment edited
in
Databases
Jan 26, 2017
21.2k
views
gatecse-2015-set3
databases
b-tree
normal
numerical-answers
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 ________.
commented
in
GATE
Jan 25, 2017
1.2k
views
tbb-mockgate-2
numerical-answers
operating-system
disk
2
answers
22
MadeEasy Subject Test: Operating System - Process Synchronization
Reader Writer's problem How is deadlock possible in this?
asked
in
Operating System
Jan 24, 2017
819
views
made-easy-test-series
operating-system
process-synchronization
0
answers
23
MadeEasy Subject Test: Theory of Computation - Identify Class Language
asked
in
Theory of Computation
Jan 24, 2017
419
views
made-easy-test-series
theory-of-computation
identify-class-language
0
answers
24
MadeEasy Subject Test: Databases - Joins
Maximum no. of possible records in the result of the following expression is?
asked
in
Databases
Jan 24, 2017
224
views
made-easy-test-series
databases
joins
3
answers
25
Ace test Series
Which of the following is CSL?
asked
in
Theory of Computation
Jan 23, 2017
1.0k
views
ace-test-series
theory-of-computation
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
commented
in
Computer Networks
Jan 18, 2017
38.0k
views
gatecse-2012
computer-networks
congestion-control
normal
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 ______.
commented
in
Computer Networks
Jan 16, 2017
32.5k
views
gatecse-2015-set3
computer-networks
normal
numerical-answers
network-switching
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}$
commented
in
Databases
Jan 12, 2017
17.4k
views
gateit-2004
databases
database-normalization
normal
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
commented
in
Algorithms
Jan 10, 2017
28.3k
views
gatecse-2006
algorithms
normal
algorithm-design
time-complexity
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.
commented
in
Theory of Computation
Jan 6, 2017
3.7k
views
gatecse-2014-set3
theory-of-computation
p-np-npc-nph
easy
out-of-syllabus-now
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
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
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...