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
Answers by Kai
5
votes
1
Admission Interviews
People who attended IISc CDS MTech admission interviews on 18th April 2017, can you please share your experience?
answered
in
Interview Questions
May 8, 2017
1.2k
views
iisc-interview
cds
14
votes
2
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.5k
views
graph-theory
discrete-mathematics
isi2015
graph-connectivity
18
votes
3
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
2
votes
4
Programming Doubt
How the output of the given code is- How are the binary bits flipping?
answered
in
Programming in C
Mar 8, 2017
446
views
2
votes
5
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
306
views
engineering-mathematics
isro-mech
linear-algebra
0
votes
6
Discrete math
Prove the following: $3 \; | \;\left ( a^2+b^2 \right )$ if and only if $3 \; | \;a$ and $3 \; | \;b$.
answered
in
Set Theory & Algebra
Mar 6, 2017
451
views
discrete-mathematics
iitg-math
descriptive
non-gate
–1
vote
7
Stable sorting algorithms
Show that any comparison based sorting algorithm can be made stable without increasing its complexity beyond a constant factor.
answered
in
Algorithms
Feb 21, 2017
2.1k
views
algorithms
descriptive
time-complexity
non-gate
–1
vote
8
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
2
votes
9
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.9k
views
gatecse-2017-set2
programming
algorithms
numerical-answers
identify-function
5
votes
10
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
16.0k
views
gatecse-2017-set2
probability
random-variable
difficult
3
votes
11
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$
answered
in
Numerical Methods
Dec 30, 2016
5.0k
views
gateit-2006
numerical-methods
normal
non-gate
0
votes
12
GATE CSE 2005 | Question: 20
Normally user programs are prevented from handling I/O directly by I/O instructions in them. For CPUs having explicit I/O instructions, such I/O protection is ensured by having the I/O instruction privileged. In a CPU with memory mapped I/ ... /O protection is ensured by a hardware trap I/O protection is ensured during system configuration I/O protection is not possible
answered
in
Operating System
Dec 29, 2016
11.4k
views
gatecse-2005
operating-system
io-handling
normal
0
votes
13
Ace Test Series: Computer Networks - Tcp
Doesn't TCP use both?
answered
in
Computer Networks
Dec 17, 2016
618
views
ace-test-series
computer-networks
tcp
4
votes
14
GATE IT 2004 | Question: 35
In how many ways can we distribute $5$ distinct balls, $B_1, B_2, \ldots, B_5$ in $5$ distinct cells, $C_1, C_2, \ldots, C_5$ such that Ball $B_i$ is not in cell $C_i$, $\forall i= 1,2,\ldots 5$ and each cell contains exactly one ball? $44$ $96$ $120$ $3125$
answered
in
Combinatory
Dec 16, 2016
11.4k
views
gateit-2004
combinatory
normal
balls-in-bins
0
votes
15
equivalence relaton
How many different equivalence relations with exactly three equivalence classes are there on a set with 5 elements 10 15 25 30
answered
in
Set Theory & Algebra
Dec 13, 2016
10.1k
views
relations
4
votes
16
TIFR CSE 2013 | Part B | Question: 18
Let $S$ be a set of numbers. For $x \in S$, the rank of $x$ is the number of elements in $S$ that are less than or equal to $x$. The procedure $\textsf{Select}(S, r)$ takes a set $S$ of numbers and a rank $r\left(1 \leq r \leq |S|\right)$ and returns the ... $|S|$ constant · $|S||R|$ constant · $|R| \log |S|$ constant · $|S|(1 + \log |R|)$
answered
in
Algorithms
Dec 10, 2016
2.5k
views
tifr2013
algorithms
quick-sort
time-complexity
6
votes
17
GATE IT 2006 | Question: 9
In a binary tree, the number of internal nodes of degree $1$ is $5$, and the number of internal nodes of degree $2$ is $10$. The number of leaf nodes in the binary tree is $10$ $11$ $12$ $15$
answered
in
DS
Nov 23, 2016
26.0k
views
gateit-2006
data-structures
binary-tree
normal
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:...