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 madhes23
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by madhes23
4
answers
1
TIFR CSE 2016 | Part B | Question: 4
In the following, $A$ stands for a set of apples, and $S(x, y)$ stands for "$x$ is sweeter than $y$. Let $\Psi \equiv \exists x : x \in A$ $\Phi \equiv \forall x \in A : \exists y \in A : S(x, y).$ Which of the following statements implies that there are ...
commented
in
Mathematical Logic
Jan 21, 2022
3.2k
views
tifr2016
mathematical-logic
first-order-logic
4
answers
2
MadeEasy Subject Test: CO & Architecture - Dma
Consider $1 \text{ MBPS}$ hard disk is interfaced to the processor in a cycle stealing mode of $\text{DMA}$ whenever $64$ bytes of the data is available in the buffer then it is transferred to the main memory. Processor word length is $64$ bits ... $\text{CPU}$ time is consumed for the $\text{DMA}$ operation is ________ (in $\%$).
commented
in
CO and Architecture
Jan 17, 2022
4.1k
views
co-and-architecture
made-easy-test-series
dma
2
answers
3
Gate_2007 ME
The number of linearly independent Eigen vectors of is a) 0 b) 1 C) 2 d) infinite
commented
in
Linear Algebra
Jan 15, 2022
11.0k
views
engineering-mathematics
linear-algebra
eigen-value
4
answers
4
GATE CSE 2020 | Question: 55
Consider a $\textsf{TCP}$ connection between a client and a server with the following specifications; the round trip time is $6$ ms, the size of the receiver advertised window is $50$ KB, slow-start threshold at the client is $32$ KB, and the ... the size of the congestion window (in $\text{KB}$) at time $t+60$ ms after all acknowledgements are processed is _______
commented
in
Computer Networks
Jan 14, 2022
14.2k
views
gatecse-2020
numerical-answers
computer-networks
tcp
2-marks
3
answers
5
GATE CSE 2021 Set 1 | Question: 44
A $\text{TCP}$ server application is programmed to listen on port number $P$ on host $S$. A $\text{TCP}$ client is connected to the $\text{TCP}$ server over the network. Consider that while the $\text{TCP}$ connection was active, the ... receive a $\text{RST}$ segment If the client sends a packet after the server reboot, it will receive a $\text{FIN}$ segment
commented
in
Computer Networks
Jan 13, 2022
12.9k
views
gatecse-2021-set1
multiple-selects
computer-networks
tcp
2-marks
3
answers
6
GATE CSE 2021 Set 1 | Question: 19
There are $6$ jobs with distinct difficulty levels, and $3$ computers with distinct processing speeds. Each job is assigned to a computer such that: The fastest computer gets the toughest job and the slowest computer gets the easiest job. Every computer gets at least one job. The number of ways in which this can be done is ___________.
commented
in
Combinatory
Jan 13, 2022
11.7k
views
gatecse-2021-set1
combinatory
counting
numerical-answers
1-mark
1
answer
7
GATE CSE 2021 Set 1 | GA Question: 3
Consider the following sentences: Everybody in the class is prepared for the exam. Babu invited Danish to his home because he enjoys playing chess. Which of the following is the $\text{CORRECT}$ observation about the above two sentences? $\text{(i)}$ is ... and $\text{(ii)}$ is ambiguous $\text{(i)}$ is grammatically incorrect and $\text{(ii)}$ is ambiguous
commented
in
Verbal Aptitude
Jan 13, 2022
6.5k
views
gatecse-2021-set1
verbal-aptitude
english-grammar
1-mark
1
answer
8
System Call and Shared Memory
Is SYSTEM CALLS needed to setup the shared memory between two processes ? and what are these system calls and does this system calls have any security concern?
answered
in
Operating System
Jan 11, 2022
1.3k
views
operating-system
6
answers
9
GATE IT 2007 | Question: 81
Let $P_1, P_2,\dots , P_n $be $n$ points in the $xy$-plane such that no three of them are collinear. For every pair of points $P_i$ and $P_j$, let $L_{ij}$ be the line passing through them. Let $L_{ab}$ ... $\Theta\left(n\right)$ $\Theta\left(n\log n\right)$ $\Theta\left(n\log^2 n\right)$ $\Theta\left(n^2\right)$
commented
in
Algorithms
Jan 7, 2022
6.3k
views
gateit-2007
algorithms
time-complexity
normal
7
answers
10
GATE CSE 2016 Set 2 | Question: 44
Consider the following languages. $L_{1} = \left\{\left\langle M \right\rangle \mid M \text{ takes at least 2016 steps on some input} \right\}$ ... not recursive $L_{1}, L_{2}$ are recursive and $L_{3}$ is not recursive $L_{1}, L_{2}, L_{3}$ are recursive
commented
in
Theory of Computation
Jan 5, 2022
33.5k
views
gatecse-2016-set2
theory-of-computation
recursive-and-recursively-enumerable-languages
5
answers
11
GATE IT 2008 | Question: 75
Consider the following relational schema: $\text{Student} (\underline{\text{school-id}, \text{sch-roll-no}}, \text{sname}, \text{saddress})$ ... schools with a pass percentage above $35\%$ over all exams taken together schools with a pass percentage above $35\%$ over each exam
commented
in
Databases
Dec 31, 2021
15.2k
views
gateit-2008
databases
relational-calculus
normal
8
answers
12
GATE CSE 2006 | Question: 69
Consider the relation enrolled (student, course) in which (student, course) is the primary key, and the relation paid (student, amount) where student is the primary key. Assume no null values and no foreign keys or integrity constraints. Assume that amounts ... faster than Plan 2 for all databases For $x = 9000,$ Plan I executes slower than Plan 2 for all databases
commented
in
Databases
Dec 30, 2021
15.2k
views
gatecse-2006
databases
sql
normal
8
answers
13
GATE IT 2007 | Question: 63
A group of $15$ routers is interconnected in a centralized complete binary tree with a router at each tree node. Router $i$ communicates with router $j$ by sending a message to the root of the tree. The root then sends the message back down to router $j$ ... mean number of hops per message, assuming all possible router pairs are equally likely is $3$ $4.26$ $4.53$ $5.26$
commented
in
Computer Networks
Dec 29, 2021
18.9k
views
gateit-2007
computer-networks
routing
binary-tree
normal
2
answers
14
Data communication and networking by forouzan 12.7 Exercise
11. We have a pure ALOHA network with 100 stations. If $T_{fr} = 1 \mu s$, what is the number of frames each station can send to achieve the maximum efficiency. 12. Repeat Exercise 11 for slotted ALOHA.
answered
in
Computer Networks
Dec 27, 2021
7.4k
views
computer-networks
slotted-aloha
pure-aloha
1
answer
15
Tanenbaum
A large population of ALOHA users manages to generate 50 requests/sec, including both originals and retransmissions. Time is slotted in units of 40 msec. a. (a) What is the chance of success on the first attempt? b. (b) What is the probability of exactly k collisions and then a success? c. (c) What is the expected number of transmission attempts needed?
commented
in
Computer Networks
Dec 26, 2021
11.1k
views
pure-aloha
computer-networks
1
answer
16
Andrew S. Tanenbaum Edition 5 Exercise 4 Question 4 (Page No. 351)
A large population of ALOHA users manages to generate 50 requests/sec, including both originals and retransmissions. Time is slotted in units of 40 msec. (a) What is the chance of success on the first attempt? (b) ... of exactly k collisions and then a success? (c) What is the expected number of transmission attempts needed?
commented
in
Computer Networks
Dec 26, 2021
1.7k
views
computer-networks
tanenbaum
mac-protocol
slotted-aloha
lan-technologies
1
answer
17
Data communication and networking by forouzan 12.7 Exercise Qn 16
16. In a CDMA/CD network with a data rate of 10 Mbps, the maximum distance between any station pair is found to be 2500 m for the correct operation of the collision detection process. What should be the maximum distance if we increase the data rate to 100 Mbps? To 1 Gbps? To 10 Gbps?
commented
in
Computer Networks
Dec 26, 2021
7.5k
views
computer-networks
pure-aloha
slotted-aloha
1
answer
18
MadeEasy Subject Test: CO & Architecture - Dma
commented
in
CO and Architecture
Dec 14, 2021
345
views
made-easy-test-series
co-and-architecture
dma
10
answers
19
GATE CSE 2014 Set 1 | Question: 44
An access sequence of cache block addresses is of length $N$ and contains n unique block addresses. The number of unique block addresses between two consecutive accesses to the same block address is bounded above by $k$. What is the miss ratio if the access sequence is passed ... $\left(\dfrac{1}{N}\right)$ $\left(\dfrac{1}{A}\right)$ $\left(\dfrac{k}{n}\right)$
commented
in
CO and Architecture
Dec 12, 2021
22.7k
views
gatecse-2014-set1
co-and-architecture
cache-memory
normal
2
answers
20
GATE CSE 1997 | Question: 17
An array $A$ contains $n \geq 1$ positive integers in the locations $A[1], A[2], \dots A[n]$. The following program fragment prints the length of a shortest sequence of consecutive elements of $A$, $A[i], A[i+1], \dots,A[j]$ ... ◻ end else begin if(j-i) < min then min:=j-i; sum:=sum -A[i]; i:=i+1; end writeln (min +1); end.
commented
in
DS
Nov 28, 2021
5.0k
views
gate1997
data-structures
array
normal
descriptive
7
answers
21
GATE CSE 2002 | Question: 2.12
A weight-balanced tree is a binary tree in which for each node, the number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on the path from the root to the furthest ... which of the following? $\log_2 n$ $\log_{\frac{4}{3}} n$ $\log_3 n$ $\log_{\frac{3}{2}} n$
commented
in
DS
Nov 27, 2021
23.3k
views
gatecse-2002
data-structures
binary-tree
normal
3
answers
22
TIFR CSE 2013 | Part B | Question: 3
How many $4 \times 4$ matrices with entries from ${0, 1}$ have odd determinant? Hint: Use modulo $2$ arithmetic. $20160$ $32767$ $49152$ $57343$ $65520$
commented
in
Linear Algebra
Nov 23, 2021
4.6k
views
tifr2013
linear-algebra
matrix
1
answer
23
GATE CSE 2014 Set 1 | Question: 17
Which one of the following is FALSE? A basic block is a sequence of instructions where control enters the sequence at the beginning and exits at the end. Available expression analysis can be used for common subexpression elimination. Live variable ... be used for dead code elimination. $x=4*5 \Rightarrow x=20$ is an example of common subexpression elimination.
commented
in
Compiler Design
Nov 16, 2021
11.7k
views
gatecse-2014-set1
compiler-design
code-optimization
normal
4
answers
24
DCFL not closed under
DCFLs are not closed under ________ a. Complement operation b. Inverse homomorphism operation c. Reversal operation d. Prefix operation
commented
in
Theory of Computation
Nov 3, 2021
9.0k
views
theory-of-computation
dcfl
3
answers
25
GATE CSE 1995 | Question: 2.3
Assume that $X$ and $Y$ are non-zero positive integers. What does the following Pascal program segment do? while X <> Y do if X > Y then X := X - Y else Y := Y - X; write(X); Computes the LCM of two numbers Divides the larger number by the smaller number Computes the GCD of two numbers None of the above
commented
in
Algorithms
Oct 25, 2021
3.6k
views
gate1995
algorithms
identify-function
normal
11
answers
26
GATE IT 2007 | Question: 24
A depth-first search is performed on a directed acyclic graph. Let $d[u]$ denote the time at which vertex $u$ is visited for the first time and $f[u]$ the time at which the DFS call to the vertex $u$ terminates. Which of the following statements is always TRUE for all edges $(u, v)$ in the graph ? $d[u] < d[v]$ $d[u] < f[v]$ $f[u] < f[v]$ $f[u] > f[v]$
commented
in
Algorithms
Oct 23, 2021
13.6k
views
gateit-2007
algorithms
graph-algorithm
normal
graph-search
depth-first-search
15
answers
27
GATE CSE 2005 | Question: 39
Suppose there are $\lceil \log n \rceil$ sorted lists of $\lfloor n /\log n \rfloor$ elements each. The time complexity of producing a sorted list of all these elements is: (Hint:Use a heap data structure) $O(n \log \log n)$ $\Theta(n \log n)$ $\Omega(n \log n)$ $\Omega\left(n^{3/2}\right)$
commented
in
Algorithms
Oct 22, 2021
26.3k
views
gatecse-2005
algorithms
sorting
normal
4
answers
28
GATE CSE 2015 Set 1 | Question: 49
Let a$_{n}$ represent the number of bit strings of length n containing two consecutive $1$s. What is the recurrence relation for $a_{n}$? $a_{n - 2} + a_{n - 1} + 2^{n - 2}$ $a_{n - 2} + 2a_{n - 1} + 2^{n - 2}$ $2a_{n - 2} + a_{n - 1} + 2^{n - 2}$ $2a_{n - 2} + 2a_{n - 1} + 2^{n - 2}$
commented
in
Algorithms
Oct 20, 2021
10.3k
views
gatecse-2015-set1
algorithms
recurrence-relation
normal
3
answers
29
GATE CSE 2014 Set 1 | Question: 3
Let $G=(V,E)$ be a directed graph where $V$ is the set of vertices and $E$ the set of edges. Then which one of the following graphs has the same strongly connected components as $G$ ? $G_1$ = $(V,E_1)$ ... $u$ to $v$ in $E\}$ $G_4$ = $(V_4,E)$ where $V_4$ is the set of vertices in $G$ which are not isolated
commented
in
DS
Oct 11, 2021
16.9k
views
gatecse-2014-set1
data-structures
graph-theory
ambiguous
2
answers
30
Self Doubt
How many min heap possible with 6 distinct node?
answered
in
DS
Oct 11, 2021
435
views
data-structures
binary-heap
counting
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:...