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 sushmita
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by sushmita
3
votes
1
GATE CSE 2015 Set 3 | Question: 5
The number of $4$ digit numbers having their digits in non-decreasing order (from left to right) constructed by using the digits belonging to the set $\{1, 2, 3\}$ is ________.
answered
in
Combinatory
Jan 11, 2019
15.6k
views
gatecse-2015-set3
combinatory
normal
numerical-answers
0
votes
2
GATE CSE 2006 | Question: 48
Let $T$ be a depth first search tree in an undirected graph $G$. Vertices $u$ and $ν$ are leaves of this tree $T$. The degrees of both $u$ and $ν$ in $G$ are at least $2$ ... exist a cycle in $G$ containing $u$ and $ν$ There must exist a cycle in $G$ containing $u$ and all its neighbours in $G$
answered
in
Algorithms
Jan 10, 2019
21.0k
views
gatecse-2006
algorithms
graph-algorithms
normal
13
votes
3
GATE CSE 2004 | Question: 75
Mala has the colouring book in which each English letter is drawn two times. She wants to paint each of these $52$ prints with one of $k$ colours, such that the colour pairs used to colour any two letters are different. Both prints of a letter can also be coloured with the same colour. What is the minimum value of $k$ that satisfies this requirement? $9$ $8$ $7$ $6$
answered
in
Combinatory
Jan 8, 2019
16.7k
views
gatecse-2004
combinatory
1
vote
4
GATE CSE 1998 | Question: 14
Let $G_1 = (N, T, P, S_1)$ be a CFG where, $N=\{S_1, A, B\},T=\{a, b\}$ and $P$ ... $5$ production rules. Is $L_2$ inherently ambiguous?
answered
in
Compiler Design
Jan 6, 2019
4.4k
views
gate1998
compiler-design
grammar
descriptive
1
vote
5
Hamacher-DMA
The average seek time and rotational delay in a disk system are 6ms and 3ms, respectively. The rate of data transfer to or from the disk is 30 Mbytes/sec and all disk accesses are for 8 Kbytes of data. Disk DMA controller, the processor and the main ... stolen by a disk unit, on average over a long period of time during which a sequence of independent 8K-byte transfers takes place?
answered
in
CO and Architecture
Dec 28, 2018
5.3k
views
co-and-architecture
dma
4
votes
6
GATE CSE 2003 | Question: 78
A processor uses $2-level$ page tables for virtual to physical address translation. Page tables for both levels are stored in the main memory. Virtual and physical addresses are both $32$ bits wide. The memory is byte addressable. For virtual to physical address translation, the ... virtual address is approximately (to the nearest $0.5$ ns) $1.5$ ns $2$ ns $3$ ns $4$ ns
answered
in
Operating System
Dec 22, 2018
46.1k
views
gatecse-2003
operating-system
normal
virtual-memory
10
votes
7
GATE CSE 2009 | Question: 48
Let $G(x)$ be the generator polynomial used for CRC checking. What is the condition that should be satisfied by $G(x)$ to detect odd number of bits in error? $G(x)$ contains more than two terms $G(x)$ does not divide $1+x^k$, for any $k$ not exceeding the frame length $1+x$ is a factor of $G(x)$ $G(x)$ has an odd number of terms.
answered
in
Computer Networks
Oct 11, 2018
29.0k
views
gatecse-2009
computer-networks
error-detection
normal
7
votes
8
GATE IT 2008 | Question: 66
Data transmitted on a link uses the following $2D$ parity scheme for error detection: Each sequence of $28$ bits is arranged in a $4\times 7$ matrix (rows $r_0$ through $r_3$, and columns $d_7$ through $d_1$) and is padded with a column $d_0$ and row $r_4$ ... received by a receiver and has $n$ corrupted bits. What is the minimum possible value of $n$? $1$ $2$ $3$ $4$
answered
in
Computer Networks
Oct 11, 2018
15.4k
views
gateit-2008
computer-networks
normal
error-detection
10
votes
9
GATE CSE 2011 | Question: 53
Consider a network with five nodes, $N1$ to $N5$, as shown as below. The network uses a Distance Vector Routing protocol. Once the routes have been stabilized, the distance vectors at different nodes are as follows. N1: $(0, 1, 7, 8, 4)$ ... the NEXT ROUND of update, what will be the cost to $N1$ in the distance vector of $N3$ ? $3$ $9$ $10$ $\infty$
answered
in
Computer Networks
Oct 11, 2018
23.5k
views
gatecse-2011
computer-networks
routing
distance-vector-routing
normal
71
votes
10
GATE CSE 2018 | Question: 55
Consider a simple communication system where multiple nodes are connected by a shared broadcast medium (like Ethernet or wireless). The nodes in the system use the following carrier-sense based medium access protocol. A node that receives a ... allows $Q$ to successfully avoid a collision between its proposed transmission and $P$'s ongoing transmission is _______.
answered
in
Computer Networks
Oct 11, 2018
19.2k
views
gatecse-2018
computer-networks
congestion-control
numerical-answers
2-marks
0
votes
11
Kenneth Rosen Edition 6th Exercise 5.5 Example 10 (Page No. 377)
How many ways are there to put four different employees into three indistinguishable offices when each office can contain any number of employees?
answered
in
Combinatory
Oct 5, 2018
4.3k
views
kenneth-rosen
discrete-mathematics
counting
combinatory
13
votes
12
GATE CSE 2004 | Question: 81
Let $G_1=(V,E_1)$ and $G_2 =(V,E_2)$ be connected graphs on the same vertex set $V$ with more than two vertices. If $G_1 \cap G_2= (V,E_1\cap E_2)$ is not a connected graph, then the graph $G_1\cup G_2=(V,E_1\cup E_2)$ cannot have a cut vertex must have a cycle must have a cut-edge (bridge) has chromatic number strictly greater than those of $G_1$ and $G_2$
answered
in
Algorithms
Dec 13, 2017
11.7k
views
gatecse-2004
algorithms
graph-algorithms
normal
1
vote
13
UGC NET CSE | December 2013 | Part 3 | Question: 39
A ____ complete subgraph and a _____ subset of vertices of a graph G=(V,E) are a clique and a vertex cover respectively minimal, maximal minimal, minimal maximal, minimal maximal, maximal
answered
in
Graph Theory
Dec 8, 2017
2.4k
views
ugcnetcse-dec2013-paper3
engineering-mathematics
discrete-mathematics
graph-theory
20
votes
14
GATE CSE 2005 | Question: 25
The maximum window size for data transmission using the selective reject protocol with $n\text{-bit}$ frame sequence numbers is: $2^n$ $2^{n-1}$ $2^n-1$ $2^{n-2}$
answered
in
Computer Networks
Dec 4, 2017
38.5k
views
gatecse-2005
computer-networks
sliding-window
easy
30
votes
15
GATE CSE 2016 Set 1 | Question: 24
Which one of the following protocols is NOT used to resolve one form of address to another one? $\textsf{DNS}$ $\textsf{ARP}$ $\textsf{DHCP}$ $\textsf{RARP}$
answered
in
Computer Networks
Dec 1, 2017
18.2k
views
gatecse-2016-set1
computer-networks
network-protocols
normal
7
votes
16
GATE IT 2007 | Question: 43
An error correcting code has the following code words: $00000000, 00001111, 01010101, 10101010, 11110000$. What is the maximum number of bit errors that can be corrected? $0$ $1$ $2$ $3$
answered
in
Computer Networks
Nov 30, 2017
25.6k
views
gateit-2007
computer-networks
error-detection
normal
13
votes
17
GATE IT 2008 | Question: 9
What Boolean function does the circuit below realize? $xz + \bar{x}\bar{z}$ $x\bar{z} + \bar{x}{z}$ $\bar{x}\bar{y} + {y}{z}$ $xy + \bar{y}\bar{z}$
answered
in
Digital Logic
Oct 20, 2017
9.2k
views
gateit-2008
digital-logic
circuit-output
decoder
normal
3
votes
18
UGC NET CSE | December 2008 | Part 2 | Question: 44
Which level is called as “defined” in capability maturity model? level $0$ level $3$ level $4$ level $1$
answered
in
IS&Software Engineering
Oct 5, 2017
2.0k
views
ugcnetcse-dec2008-paper2
is&software-engineering
software-development-life-cycle-models
3
votes
19
NIELIT 2017 July Scientist B (CS) - Section B: 58
Bug means A logical error in a program A difficult syntax error in a program Documenting programs using an efficient documentation tool All of the above
answered
in
Programming in C
Oct 5, 2017
1.6k
views
nielit2017july-scientistb-cs
programming
2
votes
20
Answer to this question is unsafe state.Why unsafe state in this question not leading to dedlock?
answered
in
Operating System
Sep 18, 2017
2.6k
views
35
votes
21
GATE CSE 1991 | Question: 01,x
Consider the following recursive definition of $fib$: fib(n) := if n = 0 then 1 else if n = 1 then 1 else fib(n-1) + fib(n-2) The number of times $fib$ is called (including the first call) for evaluation of $fib(7)$ is___________.
answered
in
Programming in C
Sep 6, 2017
10.1k
views
gate1991
programming
recursion
normal
numerical-answers
9
votes
22
CMI2015-A-08
How many times is the comparison $i \geq n$ performed in the following program? int i=85, n=5; main() { while (i >= n) { i=i-1; n=n+1; } } $40$ $41$ $42$ $43$
answered
in
Algorithms
Sep 6, 2017
5.6k
views
cmi2015
algorithms
time-complexity
56
votes
23
GATE IT 2008 | Question: 43
If we use Radix Sort to sort $n$ integers in the range $\left (n^{k/2}, n^k \right ]$, for some $k > 0$ which is independent of $n$, the time taken would be? $\Theta(n)$ $\Theta(kn)$ $\Theta(n \log n)$ $\Theta(n^2)$
answered
in
Algorithms
Sep 2, 2017
20.7k
views
gateit-2008
algorithms
sorting
normal
1
vote
24
GATE CSE 2014 Set 1 | Question: 37
There are $5$ bags labeled $1$ to $5$. All the coins in a given bag have the same weight. Some bags have coins of weight $10$ gm, others have coins of weight $11$ gm. I pick $1, 2, 4, 8, 16$ coins respectively from bags $1$ to $5$ Their total weight comes out to $323$ gm. Then the product of the labels of the bags having $11$ gm coins is ___.
answered
in
Algorithms
Sep 1, 2017
9.5k
views
gatecse-2014-set1
algorithms
numerical-answers
normal
algorithm-design
9
votes
25
GATE CSE 2017 Set 1 | Question: 04
Consider the following functions from positive integers to real numbers: $10$, $\sqrt{n}$, $n$, $\log_{2}n$, $\frac{100}{n}$. The CORRECT arrangement of the above functions in increasing order of asymptotic complexity is: $\log_{2}n$, $\frac{100}{n}$, $10$, $\sqrt{n}$, $n$ ... $\sqrt{n}$, $\log_{2}n$, $n$ $\frac{100}{n}$, $\log_{2}n$, $10$, $\sqrt{n}$, $n$
answered
in
Algorithms
Aug 28, 2017
17.7k
views
gatecse-2017-set1
algorithms
asymptotic-notation
normal
3
votes
26
TIFR CSE 2015 | Part A | Question: 7
A $1 \times 1$ chessboard has one square, a $2 \times 2$ chessboard has five squares. Continuing along this fashion, what is the number of squares on the regular $8 \times 8$ chessboard? $64$ $65$ $204$ $144$ $256$
answered
in
Combinatory
Apr 20, 2017
3.1k
views
tifr2015
combinatory
counting
27
votes
27
GATE IT 2004 | Question: 55
Let $f(n)$, $g(n)$ and $h(n)$ be functions defined for positive integers such that $f(n) = O(g(n))$, $g(n) \neq O(f(n))$, $g(n) = O(h(n))$, and $h(n) = O(g(n))$. Which one of the following statements is FALSE? $f(n) + g(n) = O(h(n) + h(n))$ $f(n) = O(h(n))$ $h(n) \neq O(f(n))$ $f(n)h(n) \neq O(g(n)h(n))$
answered
in
Algorithms
Apr 13, 2017
13.2k
views
gateit-2004
algorithms
asymptotic-notation
normal
0
votes
28
combinatorics
THERE ARE 10 PRIZES AND 4 STUDENTS. WE WANT ONLY TWO STUDENTS TO GET THE PRIZES. HOW MANY WAYS ARE THERE??
answered
in
Mathematical Logic
Apr 5, 2017
771
views
discrete-mathematics
combinatory
0
votes
29
Semaphore bounded wait
Does semaphore solution fulfill the condition of bounded wait for more than 2 processes I know we can implement the waiting list in such a way that makes it satisfy bounded wait but what is the standard?
answered
in
Operating System
Mar 29, 2017
1.5k
views
operating-system
semaphore
process-synchronization
0
votes
30
gate
Suppose you are given an implementation of a queue of integers. The operations that can be performed on the queue are: 1. is_empty (Q): return true if the queue is empty, false otherwise. 2. delete (Q): deletes the elements at the front of the queue and return its value. 3. insert (Q, i): ... f(Q) b.insert(Q,i) i=delete(Q) insert(Q,i) f(Q) c.f(Q) i=delete(Q) insert(Q,i) d.none of these.
answered
in
Programming in C
Mar 25, 2017
876
views
Page:
1
2
next »
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:...