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 HeadShot
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by HeadShot
1
vote
1
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
Jan 4, 2019
1.5k
views
graph-theory
discrete-mathematics
isi2015
graph-connectivity
0
votes
2
GATE CSE 2009 | Question: 2
What is the chromatic number of an $n$ vertex simple connected graph which does not contain any odd length cycle? Assume $n > 2$. $2$ $3$ $n-1$ $n$
answered
in
Graph Theory
Jan 3, 2019
13.1k
views
gatecse-2009
graph-theory
graph-coloring
normal
0
votes
3
MadeEasy Test Series 2019: Combinatory- Generating Functions
Let $M(x) = \frac{x^{2018}}{(1-x)^{2019}}$ we define $M(x) = \sum_{r=0}^{\infty}a_{r}x^{r}$ ,then $a_{r}$ is equal to- $A)\binom{r}{2019}$ $B)\binom{r}{r+2018}$ $C)\binom{r}{2019-r}$ $D)\binom{r}{r-2018}$
answered
in
Combinatory
Jan 2, 2019
966
views
discrete-mathematics
generating-functions
made-easy-test-series
42
votes
4
GATE IT 2005 | Question: 81-b
A disk has $8$ equidistant tracks. The diameters of the innermost and outermost tracks are $1$ cm and $8$ cm respectively. The innermost track has a storage capacity of $10$ MB. If the disk has $20$ sectors per track and is currently at the end of the $5^{th}$ sector ... starting from the sector $4$ of the outer-most track? $13.5 \ ms$ $10 \ ms$ $9.5 \ ms$ $20 \ ms$
answered
in
Operating System
Jan 2, 2019
13.8k
views
gateit-2005
operating-system
disk
normal
24
votes
5
GATE CSE 2012 | Question: 27
Consider the following transactions with data items $P$ and $Q$ initialized to zero: ${\begin{array}{|c|l|r|c|}\hline \textbf{$ ... leads to a serializable schedule a schedule that is not conflict serializable a conflict serializable schedule a schedule for which a precedence graph cannot be drawn
answered
in
Databases
Dec 29, 2018
22.6k
views
gatecse-2012
databases
transaction-and-concurrency
normal
0
votes
6
Data structure
How to find clique in a graph?
answered
in
Programming in C
Dec 16, 2018
383
views
0
votes
7
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 5, 2018
2.5k
views
tifr2013
algorithms
quick-sort
time-complexity
3
votes
8
TIFR CSE 2011 | Part A | Question: 4
Consider the problem of maximizing $x^{2}-2x+5$ such that $0< x< 2$. The value of $x$ at which the maximum is achieved is: $0.5$ $1$ $1.5$ $1.75$ None of the above
answered
in
Calculus
Dec 4, 2018
1.7k
views
tifr2011
calculus
maxima-minima
9
votes
9
GATE IT 2006 | Question: 68
On a wireless link, the probability of packet error is $0.2$. A stop-and-wait protocol is used to transfer data across the link. The channel condition is assumed to be independent of transmission to transmission. What is the average number of transmission attempts required to transfer $100$ packets? $100$ $125$ $150$ $200$
answered
in
Computer Networks
Nov 21, 2018
13.2k
views
gateit-2006
computer-networks
sliding-window
stop-and-wait
normal
1
vote
10
GATE IT 2008 | Question: 77
A binary tree with $n > 1$ nodes has $n_1$, $n_2$ and $n_3$ nodes of degree one, two and three respectively. The degree of a node is defined as the number of its neighbours. Starting with the above tree, while there remains a node $v$ of degree two in the tree, add ... will remain at the end of the process? $2 * n_1- 3$ $n_2 + 2 * n_1 - 2$ $n_3 - n_2$ $n_2+ n_1- 2$
answered
in
DS
Nov 11, 2018
14.7k
views
gateit-2008
data-structures
binary-tree
normal
40
votes
11
GATE CSE 2008 | Question: 67
A processor uses $36$ bit physical address and $32$ bit virtual addresses, with a page frame size of $4$ Kbytes. Each page table entry is of size $4$ bytes. A three level page table is used for virtual to physical address translation, where the virtual address is used as ... tables are respectively $\text{20,20,20}$ $\text{24,24,24}$ $\text{24,24,20}$ $\text{25,25,24}$
answered
in
Operating System
Nov 4, 2018
76.0k
views
gatecse-2008
operating-system
virtual-memory
normal
4
votes
12
GATE CSE 2000 | Question: 1.21
Let $m[0]\ldots m[4]$ be mutexes (binary semaphores) and $P[0]\ldots P[4]$ be processes. Suppose each process $P[i]$ executes the following: wait (m[i]); wait (m(i+1) mod 4]); ........... release (m[i]); release (m(i+1) mod 4]); This could cause Thrashing Deadlock Starvation, but not deadlock None of the above
answered
in
Operating System
Nov 1, 2018
21.8k
views
gatecse-2000
operating-system
process-synchronization
normal
0
votes
13
Databases Multiple granularity
answered
in
Databases
Oct 21, 2018
1.1k
views
databases
multiple-granularity
0
votes
14
minimal DFA
Let L be the set of all binary strings whose last two symbols are the same. The number states of the minimal DFA for L has a)2 b)5 c)8 d)3 explain!!
answered
in
Theory of Computation
Sep 24, 2018
514
views
theory-of-computation
11
votes
15
GATE CSE 2000 | Question: 2.11
Which functions does NOT implement the Karnaugh map given below? $(w + x) y$ $xy + yw$ $(w + x) (\bar{w} + y) (\bar{x} + y)$ None of the above
answered
in
Digital Logic
Sep 19, 2018
7.1k
views
gatecse-2000
digital-logic
k-map
normal
25
votes
16
GATE CSE 1999 | Question: 2.16
The number of full and half-adders required to add $16$-bit numbers is $8$ half-adders, $8$ full-adders $1$ half-adder, $15$ full-adders $16$ half-adders, $0$ full-adders $4$ half-adders, $12$ full-adders
answered
in
Digital Logic
Sep 16, 2018
22.2k
views
gate1999
digital-logic
normal
adder
11
votes
17
ISRO2015-7
If half adders and full adders are implements using gates, then for the addition of two $17$ bit numbers (using minimum gates) the number of half adders and full adders required will be $0,17$ $16,1$ $1,16$ $8,8$
answered
in
Digital Logic
Sep 16, 2018
9.6k
views
isro2015
digital-logic
adder
3
votes
18
GATE CSE 1997 | Question: 2-1
Let $*$ be defined as $x * y = \bar{x} + y$. Let $z = x * y$. Value of $z * x$ is $\bar{x} + y$ $x$ $0$ $1$
answered
in
Digital Logic
Sep 15, 2018
5.3k
views
gate1997
digital-logic
normal
boolean-algebra
6
votes
19
TIFR CSE 2010 | Part B | Question: 34
Let $r, s, t$ be regular expressions. Which of the following identities is correct? $(r + s)^* = r^*s^*$ $r(s + t) = rs + t$ $(r + s)^* = r^* + s^*$ $(rs + r)^* r = r (sr + r)^*$ $(r^*s)^* = (rs)^*$
answered
in
Theory of Computation
Sep 4, 2018
2.6k
views
tifr2010
theory-of-computation
regular-expression
0
votes
20
Rosen Discrete Maths book. Recurrence Relations. Example #3
Find a recurrence relation for the number of bit strings of length n that contain a pair of consecutive 0s.
answered
in
Combinatory
Sep 3, 2018
586
views
7
votes
21
GATE CSE 2015 Set 2 | Question: 34
Assume that the bandwidth for a $\text{TCP}$ connection is $1048560$ bits/sec. Let $\alpha$ be the value of RTT in milliseconds (rounded off to the nearest integer) after which the $\text{TCP}$ window scale option is needed. Let $\beta$ be the maximum possible ... $^{16}$ $500$ milliseconds, $65535$ $\times $2$^{14}$ $500$ milliseconds, $65535$ $\times $2$^{16}$
answered
in
Computer Networks
Jul 31, 2018
27.7k
views
gatecse-2015-set2
computer-networks
difficult
tcp
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:...