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 vipin.gautam1906
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by vipin.gautam1906
0
votes
1
GATE CSE 2021 Set 1 | GA Question: 9
Given below are two statements $1$ and $2$, and two conclusions $\text{I}$ and $\text{II}$ $\text{Statement 1:}$ All bacteria are microorganisms. $\text{Statement 2:}$ All pathogens are microorganisms. $\text{Conclusion I:}$ Some pathogens are ... Either conclusion $\text{I}$ or $\text{II}$ is correct Neither conclusion $\text{I}$ nor $\text{II}$ is correct
answered
in
Analytical Aptitude
Mar 1, 2021
14.3k
views
gatecse-2021-set1
analytical-aptitude
logical-reasoning
statements-follow
2-marks
0
votes
2
UGC NET CSE | November 2017 | Part 3 | Question: 5
Which of the following is correct statement? In memory - mapped I/O, the CPU can manipulate I/O data residing in interface registers that are not used to manipulate memory words. The isolated I/O method isolates memory and I ... data the two units share a common clock. In synchronous serial transmission of data the two units have different clocks.
answered
in
CO and Architecture
Dec 6, 2020
3.2k
views
ugcnetcse-nov2017-paper3
microprocessors
co-and-architecture
0
votes
3
GATE2016 EC-1: GA-10
P, Q, R and S are working on a project. Q can finish the task in $25$ days, working alone for $12$ hours a day. R can finish the task in $50$ days, working alone for $12$ hours per day. Q worked $12$ hours a day but took sick leave in the beginning for two days ... is the ratio of work done by Q and R after $7$ days from the start of the project? $10:11$ $11:10$ $20:21$ $21:20$
answered
in
Quantitative Aptitude
Dec 2, 2020
5.1k
views
gate2016-ec-1
quantitative-aptitude
work-time
2
votes
4
Digital Logic
The total number of comparisons performed in a 8-bit magnitude comparator consist of inputs A[A4, A3, A2, A1] and B[B4, B3, B2, B1] then condition for A>B is : A 255 x 26 B 255 x 27 C 255 x 28 D 255 x 29
answered
in
Digital Logic
Dec 2, 2020
1.3k
views
digital-logic
0
votes
5
GATE CSE 2000 | Question: 1.15
Let $S$ be a sorted array of $n$ integers. Let $T(n)$ denote the time taken for the most efficient algorithm to determined if there are two elements with sum less than $1000$ in $S$. Which of the following statement is true? $T (n)$ is $O(1)$ $n \leq T(n) \leq n \log_2 n$ $n \log_2 n ≤ T(n) < \frac{n}{2}$ $T(n) = \left (\frac{n}{2} \right)$
answered
in
Algorithms
Dec 1, 2020
15.6k
views
gatecse-2000
easy
algorithms
time-complexity
0
votes
6
GATE CSE 2016 Set 1 | Question: 39
Let $G$ be a complete undirected graph on $4$ vertices, having $6$ edges with weights being $1, 2, 3, 4, 5,$ and $6$. The maximum possible weight that a minimum weight spanning tree of $G$ can have is __________
answered
in
Algorithms
Nov 24, 2020
35.3k
views
gatecse-2016-set1
algorithms
spanning-tree
normal
numerical-answers
0
votes
7
GATE CSE 2010 | Question: 51
Consider a complete undirected graph with vertex set $\{0, 1, 2, 3, 4\}$. Entry $W_{ij}$ in the matrix $W$ below is the weight of the edge $\{i, j\}$ ... weight of a path $P$ from vertex $1$ to vertex $2$ in this graph such that $P$ contains at most $3$ edges? $7$ $8$ $9$ $10$
answered
in
Algorithms
Nov 23, 2020
14.8k
views
gatecse-2010
normal
algorithms
spanning-tree
0
votes
8
TIFR CSE 2019 | Part B | Question: 11
Consider the following non-deterministic automaton,where $s_1$ is the start state and $s_4$ is the final (accepting) state. The alphabet is $\{a,b\}$. A transition with label $\epsilon$ can be taken without consuming any symbol from the input. Which of the following regular expressions correspond ... $(a+b)^*ba^*$ $(a+b)^*ba(aa)^*$ $(a+b)^*$ $(a+b)^*baa^*$
answered
in
Theory of Computation
Nov 10, 2020
2.1k
views
tifr2019
theory-of-computation
regular-expression
4
votes
9
GATE CSE 2006 | Question: 30
For $s\in (0+1)^{*}$ let $d(s)$ denote the decimal value of $s ($e.g. $d (101) = 5 ).$ Let $L=\left \{ s\in (0+1)^*\mid d(s) \text{ mod } 5=2 \text{ and }d(s) \text{ mod } 7\neq 4 \right \}$Which ... following statements is true? $L$ is recursively enumerable, but not recursive $L$ is recursive, but not context-free $L$ is context-free, but not regular $L$ is regular
answered
in
Theory of Computation
Nov 2, 2020
7.6k
views
gatecse-2006
theory-of-computation
normal
identify-class-language
0
votes
10
GATE CSE 2017 Set 1 | Question: 10
Consider the following context-free grammar over the alphabet $\Sigma = \{a,b,c\}$ with $S$ as the start symbol:$S \rightarrow abScT \mid abcT$$T \rightarrow bT \mid b$ ... $\{\left ( ab \right )^{n}\left ( cb^{n} \right )^{m} \mid m,n \geq 1 \}$
answered
in
Theory of Computation
Oct 30, 2020
21.6k
views
gatecse-2017-set1
theory-of-computation
context-free-language
normal
1
vote
11
GATE IT 2006 | Question: 34
In the context-free grammar below, $S$ is the start symbol, $a$ and $b$ are terminals, and $\epsilon$ denotes the empty string. $S \to aSAb \mid \epsilon$ $A \to bA \mid \epsilon$ The grammar generates the language $((a + b)^* b)$ $\{a^mb^n \mid m \leq n\}$ $\{a^mb^n \mid m = n)$ $a^* b^*$
answered
in
Theory of Computation
Oct 29, 2020
7.9k
views
gateit-2006
theory-of-computation
context-free-language
normal
1
vote
12
GATE CSE 2003 | Question: 51
Let $G=\left(\left\{S\right\}, \left\{a,b\right\},R,S\right)$ be a context free grammar where the rule set R is $S \to a S b \mid S S \mid \epsilon$ Which of the following statements is true? $G$ is not ambiguous There ... $L(G)$ We can find a deterministic finite state automaton that accepts $L(G)$
answered
in
Theory of Computation
Oct 29, 2020
17.5k
views
gatecse-2003
theory-of-computation
context-free-language
normal
0
votes
13
GATE CSE 2012 | Question: 46
Consider the set of strings on $\{0,1\}$ in which, every substring of $3$ symbols has at most two zeros. For example, $001110$ and $011001$ are in the language, but $100010$ is not. All strings of length less than $3$ are also in the language. A partially ...
answered
in
Theory of Computation
Oct 21, 2020
14.2k
views
gatecse-2012
theory-of-computation
finite-automata
normal
1
vote
14
GATE CSE 1992 | Question: 02-xi
A computer system has $6$ tape devices, with n processes competing for them. Each process may need $3$ tape drives. The maximum value of n for which the system is guaranteed to be deadlock-free is: $2$ $3$ $4$ $1$
answered
in
Operating System
Oct 14, 2020
5.4k
views
gate1992
operating-system
resource-allocation
normal
multiple-selects
0
votes
15
GATE CSE 1997 | Question: 6.8
Each Process $P_i, i = 1\ldots 9$ is coded as follows repeat P(mutex) {Critical section} V(mutex) forever The code for $P_{10}$ is identical except it uses V(mutex) in place of P(mutex). What is the largest number of processes that can be inside the critical section at any moment? $1$ $2$ $3$ None
answered
in
Operating System
Oct 7, 2020
24.7k
views
gate1997
operating-system
process-synchronization
normal
0
votes
16
GATE CSE 2008 | Question: 73
Consider a machine with a $2$-way set associative data cache of size $64$ Kbytes and block size $16$ bytes. The cache is managed using $32$ bit virtual addresses and the page size is $4$ Kbytes. A program to be run on this machine begins as follows: double ARR[ ... to array $\text{ARR}$. The cache hit ratio for this initialization loop is: $0\%$ $25\%$ $50\%$ $75\%$
answered
in
CO and Architecture
Oct 4, 2020
8.4k
views
gatecse-2008
co-and-architecture
cache-memory
normal
0
votes
17
GATE IT 2005 | Question: 61
Consider a $2$-way set associative cache memory with $4$ sets and total $8$ cache blocks $(0-7)$ and a main memory with $128$ blocks $(0-127)$. What memory blocks will be present in the cache after the following sequence of memory block references if LRU policy is used for cache block replacement. ... $9$ $16$ $55$ $0$ $5$ $7$ $9$ $16$ $55$ $3$ $5$ $7$ $9$ $16$ $55$
answered
in
CO and Architecture
Oct 4, 2020
8.9k
views
gateit-2005
co-and-architecture
cache-memory
normal
0
votes
18
GATE IT 2004 | Question: 12, ISRO2016-77
Consider a system with $2$ level cache. Access times of Level $1$ cache, Level $2$ cache and main memory are $1$ $ns$, $10$ $ns$, and $500$ $ns$ respectively. The hit rates of Level $1$ and Level $2$ caches are $0.8$ and $0.9$, respectively. What is the average access time of the system ignoring the search time within the cache? $13.0$ $12.8$ $12.6$ $12.4$
answered
in
CO and Architecture
Oct 4, 2020
29.4k
views
gateit-2004
co-and-architecture
cache-memory
normal
isro2016
0
votes
19
GATE CSE 2014 Set 2 | Question: 33
A computer has twenty physical page frames which contain pages numbered $101$ through $120$. Now a program accesses the pages numbered $\text{1, 2, ..., 100}$ in that order, and repeats the access sequence THRICE. Which one of ... as the optimal page replacement policy for this program? Least-recently-used First-in-first-out Last-in-first-out Most-recently-used
answered
in
Operating System
Sep 27, 2020
28.6k
views
gatecse-2014-set2
operating-system
page-replacement
ambiguous
0
votes
20
GATE IT 2005 | Question: 73
On a TCP connection, current congestion window size is Congestion Window = $4$ KB. The window size advertised by the receiver is Advertise Window = $6$ KB. The last byte sent by the sender is LastByteSent = $10240$ and the last byte acknowledged by ... LastByteAcked = $8192$. The current window size at the sender is: $2048$ bytes $4096$ bytes $6144$ bytes $8192$ bytes
answered
in
Computer Networks
Sep 23, 2020
26.0k
views
gateit-2005
computer-networks
congestion-control
normal
0
votes
21
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
Aug 27, 2020
16.6k
views
gatecse-2004
combinatory
0
votes
22
GATE CSE 2003 | Question: 84
Host $A$ is sending data to host $B$ over a full duplex link. $A$ and $B$ are using the sliding window protocol for flow control. The send and receive window sizes are $5$ packets each. Data packets (sent only from $A$ to $B$) are all $1000$ bytes long and the ... ? $7.69 \times 10^6$ Bps $11.11 \times 10^6$ Bps $12.33 \times 10^6$ Bps $15.00 \times 10^6$ Bps
answered
in
Computer Networks
Jul 31, 2020
27.7k
views
gatecse-2003
computer-networks
sliding-window
normal
0
votes
23
GATE IT 2004 | Question: 25
A sender is employing public key cryptography to send a secret message to a receiver. Which one of the following statements is TRUE? Sender encrypts using receiver's public key Sender encrypts using his own public key Receiver decrypts using sender's public key Receiver decrypts using his own public key
answered
in
Computer Networks
Jul 30, 2020
13.4k
views
gateit-2004
computer-networks
network-security
normal
out-of-gate-syllabus
0
votes
24
GATE CSE 2019 | Question: 29
Suppose that in an IP-over-Ethernet network, a machine X wishes to find the MAC address of another machine Y in its subnet. Which one of the following techniques can be used for this? X sends an ARP request packet to the local gateway' ... packet with broadcast MAC address in its local subnet X sends an ARP request packet with broadcast IP address in its local subnet
answered
in
Computer Networks
Jul 30, 2020
19.4k
views
gatecse-2019
computer-networks
network-protocols
2-marks
0
votes
25
GATE CSE 2004 | Question: 57
Consider three IP networks $A, B$ and $C$. Host $H_A$ in network $A$ sends messages each containing $180$ $bytes$ of application data to a host $H_C$ in network $C$. The TCP layer prefixes $20$ byte header to the message. This passes through an intermediate network $B$ ... overheads. $325.5$ $\text{Kbps}$ $354.5$ $\text{Kbps}$ $409.6$ $\text{Kbps}$ $512.0$ $\text{Kbps}$
answered
in
Computer Networks
Jul 29, 2020
19.0k
views
gatecse-2004
computer-networks
ip-addressing
tcp
normal
0
votes
26
GATE IT 2006 | Question: 65
In the $\text{4B/5B}$ encoding scheme, every $4$ bits of data are encoded in a $5$-bit codeword. It is required that the codewords have at most $1$ leading and at most $1$ trailing zero. How many are such codewords possible? $14$ $16$ $18$ $20$
answered
in
Computer Networks
Jul 28, 2020
10.0k
views
gateit-2006
computer-networks
encoding
combinatory
normal
out-of-gate-syllabus
0
votes
27
GATE IT 2007 | Question: 64
A broadcast channel has $10$ nodes and total capacity of $10$ Mbps. It uses polling for medium access. Once a node finishes transmission, there is a polling delay of $80$ μs to poll the next node. Whenever a node is polled, it is allowed to transmit a maximum of $1000$ bytes. The maximum throughput of the broadcast channel is: $1$ Mbps $100/11$ Mbps $10$ Mbps $100$ Mbps
answered
in
Computer Networks
Jul 24, 2020
10.6k
views
gateit-2007
computer-networks
communication
normal
0
votes
28
GATE CSE 2003 | Question: 38
Consider the set \(\{a, b, c\}\) with binary operators \(+\) and \(*\) defined as follows: ... $(x, y)$ that satisfy the equations) is $0$ $1$ $2$ $3$
answered
in
Set Theory & Algebra
Jun 23, 2020
7.0k
views
gatecse-2003
set-theory&algebra
normal
binary-operation
0
votes
29
GATE CSE 2017 Set 1 | Question: 7
The n-bit fixed-point representation of an unsigned real number $X$ uses $f$ bits for the fraction part. Let $i = n-f$. The range of decimal values for $X$ in this representation is $2^{-f}$ to $2^{i}$ $2^{-f}$ to $\left ( 2^{i} - 2^{-f} \right )$ 0 to $2^{i}$ 0 to $\left ( 2^{i} - 2^{-f} \right )$
answered
in
Digital Logic
Jun 3, 2020
16.5k
views
gatecse-2017-set1
digital-logic
number-representation
fixed-point-representation
3
votes
30
TIFR CSE 2010 | Part A | Question: 10
A drawer contains $2$ Blue, $4$ Red and $2$ Yellow balls. No two balls have the same radius. If two balls are randomly selected from the drawer, what is the probability that they will be of the same colour? $\left(\dfrac{2}{7}\right)$ $\left(\dfrac{2}{5}\right)$ $\left(\dfrac{3}{7}\right)$ $\left(\dfrac{1}{2}\right)$ $\left(\dfrac{3}{5}\right)$
answered
in
Probability
May 31, 2020
2.0k
views
tifr2010
probability
conditional-probability
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:...