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 nishant_magarde
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by nishant_magarde
3
answers
1
ALOHA
Is ALOHA a part of gate syllabus ?
answered
in
Computer Networks
May 17, 2021
1.5k
views
10
answers
2
GATE CSE 2017 Set 1 | Question: 48
Let $A$ be an array of $31$ numbers consisting of a sequence of $0$'s followed by a sequence of $1$'s. The problem is to find the smallest index $i$ such that $A\left [i \right ]$ is $1$ by probing the minimum number of locations in $A$. The worst case number of probes performed by an optimal algorithm is ____________.
commented
in
Algorithms
Jul 22, 2020
21.7k
views
gatecse-2017-set1
algorithms
normal
numerical-answers
searching
4
answers
3
GATE CSE 2018 | Question: 19
Let $G$ be a finite group on $84$ elements. The size of a largest possible proper subgroup of $G$ is _____
commented
in
Set Theory & Algebra
Jul 15, 2020
12.2k
views
gatecse-2018
group-theory
numerical-answers
set-theory&algebra
1-mark
3
answers
4
GATE CSE 2018 | Question: 39
In a system, there are three types of resources: $E, F$ and $G$. Four processes $P_0$, $P_1$, $P_2$ and $P_3$ execute concurrently. At the outset, the processes have declared their maximum resource requirements using a matrix named Max as given below. ... $safe$ state, but would be $safe$ if one more instance of $G$ were available
commented
in
Operating System
Mar 25, 2020
11.6k
views
gatecse-2018
operating-system
deadlock-prevention-avoidance-detection
normal
2-marks
15
answers
5
GATE CSE 2017 Set 1 | Question: 22
Consider the language $L$ given by the regular expression $(a+b)^{*} b (a+b)$ over the alphabet $\{a,b\}$. The smallest number of states needed in a deterministic finite-state automaton (DFA) accepting $L$ is ___________ .
commented
in
Theory of Computation
Jan 23, 2020
29.1k
views
gatecse-2017-set1
theory-of-computation
finite-automata
numerical-answers
minimal-state-automata
2
answers
6
GATE CSE 2018 | Question: 6
Let $N$ be an NFA with $n$ states. Let $k$ be the number of states of a minimal DFA which is equivalent to $N$. Which one of the following is necessarily true? $k \geq 2^n$ $k \geq n$ $k \leq n^2$ $k \leq 2^n$
commented
in
Theory of Computation
Jan 23, 2020
10.3k
views
gatecse-2018
theory-of-computation
minimal-state-automata
normal
1-mark
2
answers
7
WHAT AN INTERESTING DBMS QUESTION!!
Let $E1$ and $E2$ be two entities and $R$ is a relation between $E1$ and $E2$, then what is the minimum no of tables required to represent $E1, E2$ and $R$ if - 1. $E1$ and $E2$ have $1:m$ cardinality($E1$ on $1$ side ... $E1$ and $E2$ have total participation. Assume that there is no multi-valued attribute is present in any of the $10$ cases.
commented
in
Databases
Jan 11, 2020
11.4k
views
databases
er-diagram
1
answer
8
TIFR CSE 2018 | Part B | Question: 5
Which of the following functions, given by there recurrence, grows the fastest asymptotically? $T(n) = 4T\left ( \frac{n}{2} \right ) + 10n$ $T(n) = 8T\left ( \frac{n}{3} \right ) + 24n^{2}$ $T(n) = 16T\left ( \frac{n}{4} \right ) + 10n^{2}$ $T(n) = 25T\left ( \frac{n}{5} \right ) + 20\left ( n \log n \right )^{1.99}$ They all are asymptotically the same
commented
in
Algorithms
Dec 16, 2019
3.6k
views
tifr2018
asymptotic-notation
recurrence-relation
6
answers
9
GATE CSE 2000 | Question: 2.6
Let $P(S)$ denotes the power set of set $S.$ Which of the following is always true? $P(P(S)) = P(S)$ $P(S) ∩ P(P(S)) = \{ Ø \}$ $P(S) ∩ S = P(S)$ $S ∉ P(S)$
commented
in
Set Theory & Algebra
Dec 7, 2019
13.5k
views
gatecse-2000
set-theory&algebra
easy
set-theory
2
answers
10
How to remember decidability?
I want to know how to remember which language is decidable for which property. Should I go through the proofs or should I remember everything?
commented
in
Theory of Computation
Sep 14, 2019
2.2k
views
theory-of-computation
decidability
8
answers
11
GATE CSE 2018 | Question: 54
Consider an IP packet with a length of $4,500\;\text{bytes}$ that includes a $20\text{-byte}\;\textsf{IPv4}$ header ans $40\text{-byte}$ TCP header. The packet is forwarded to an $\textsf{IPv4}$ router that supports a ... that the fragmentation offset value stored in the first fragment is $0$. The fragmentation offset value stored in the third fragment is ________.
commented
in
Computer Networks
May 18, 2019
19.0k
views
gatecse-2018
computer-networks
ip-addressing
numerical-answers
2-marks
1
answer
12
#General #Not_in_syllabus
@arjun Sir, I was solving Go pdf, and I found that in computer networks, no questions are from Token ring and Aloha was there. Does it mean they are not in syllabus now? Can you please highlight the topics which are not the part of gate syllabus now.
asked
in
GATE
May 16, 2019
486
views
1
answer
13
home work
A broadcast channel has 10 nodes and total capacity of 16Mbps. It uses polling for medium access. Once a node finishes transmission, there is a polling delay of 100 µseconds to poll the next node. Whenever a node is polled, it is allowed to transmit a maximum of 1500 Bytes. The maximum throughput of broadcast channel is: 8 Mbps 14 Mbps 100/11Mbps 750/85 Mbps
commented
in
Computer Networks
May 14, 2019
625
views
computer-networks
csma-cd
token-ring
0
answers
14
Token ring
commented
in
Computer Networks
May 14, 2019
1.3k
views
computer-networks
token-ring
1
answer
15
home work
In a token ring, if the propagation delay in a ring is equal to the transmission delay, then what is the maximum efficiency? Assuming that only one station is in token ring.
commented
in
Computer Networks
May 14, 2019
1.0k
views
computer-networks
token-ring
0
answers
16
#Self-Doubt #Asymptotic-Notation
Is it true? $an^{2} = O(n^{2})$ for a>0 Also, what is the difference between Small-oh and Big-oh? Also, why we consider theta, omega as Big-oh sometimes, in the above problem, the answer is Big-theta but it is equal to big-oh. Why is it so?
commented
in
Algorithms
Mar 22, 2019
464
views
asymptotic-notation
2
answers
17
#OS #FCFS
Is FCFS always non-preemptive? If an I/O bound process comes, then? It will be preempted or not?
answer selected
in
Operating System
Mar 22, 2019
1.5k
views
1
answer
18
Algorithm-asymptotic analysis
=====>f(n)=3n^2+4n+2. What will be the exact value for f(n) a) theta(n^2) b)o(n^2) c)O(n^2) d)omega(n^2) Please provide the reason too. ======>f(n)=o(g(n)) if and only if a)g(n)=omega(f(n)) b)g(n)=small omega(f(n)) c) g(n)=omega(f(n)) and g(n)=small omega(f(n)) d) None of these. Please provide reason.
commented
in
Algorithms
Mar 21, 2019
2.2k
views
asymptotic-notation
algorithms
3
answers
19
Made Easy Computer Networks
A supernet has first address of 205.16.32.0 and a supernet mask of 255.255.248.0. How many blocks are in this supernet and what is the range of addresses?
commented
in
Computer Networks
Mar 18, 2019
3.4k
views
computer-networks
supernetting
2
answers
20
MadeEasy Subject Test 2019: Computer Networks - Subnetting
In the network 143.128.67.235 / 20, it x represent the decimal value of 3rd octet and y represent the decimal value of 4th octet of last IP address assigned to any host, then the value of x*y is
answered
in
Computer Networks
Mar 16, 2019
1.1k
views
made-easy-test-series
computer-networks
subnetting
5
answers
21
GATE IT 2007 | Question: 65
Consider a selection of the form $\sigma_{A\leq 100} (r)$, where $r$ is a relation with $1000$ tuples. Assume that the attribute values for $A$ among the tuples are uniformly distributed in the interval $[0, 500].$ Which one of the following options is the best estimate of the number of tuples returned by the given selection query ? $50$ $100$ $150$ $200$
commented
in
Databases
Jan 1, 2019
12.6k
views
gateit-2007
databases
relational-calculus
probability
normal
9
answers
22
GATE CSE 2006 | Question: 20, ISRO2015-17
Consider the following log sequence of two transactions on a bank account, with initial balance $12000,$ that transfer $2000$ to a mortgage payment and then apply a $5\%$ interest. T1 start T1 B old $=12000$ new $=10000$ ... $3$ because transaction T1 has committed We can apply redo and undo operations in arbitrary order because they are idempotent
commented
in
Databases
Dec 25, 2018
27.8k
views
gatecse-2006
databases
transaction-and-concurrency
normal
isro2015
1
answer
23
ME test series
Consider relation R(A,B,C,D,E,F,G) with the following functional dependencies AB$\rightarrow$CD , D$\rightarrow$B, AF$\rightarrow$D, DE$\rightarrow$F, C$\rightarrow$G, F$\rightarrow$E, G$\rightarrow$A. What is the highest normal form.
commented
in
Databases
Dec 21, 2018
3.3k
views
database-normalization
1
answer
24
#OS #General
Prior knowledge to start with OS.
answer selected
in
Operating System
Dec 21, 2018
230
views
3
answers
25
ME Test Series
Minimum relations required which satisfies the 2nd normal from is _____
commented
in
Databases
Dec 17, 2018
607
views
0
answers
26
Can someone provide me answers to made easy workbook 2018?
can someone please provide me answer keys to gate cse workbooks by made easy 2018?
commented
in
GATE
Dec 16, 2018
1.9k
views
2
answers
27
Data structure
How to find clique in a graph?
commented
in
Programming in C
Dec 16, 2018
383
views
3
answers
28
GATE CSE 1992 | Question: 13b
Suppose we have a database consisting of the following three relations: ... are liked by each customer. Express the following query in relational algebra: Print the hotels the serve the snack that customer Rama likes.
commented
in
Databases
Dec 13, 2018
3.6k
views
gate1992
databases
relational-algebra
normal
descriptive
0
answers
29
#DBMS #Realtional_Algebra
When no condition is applied on a join, then it is a natural join?????
commented
in
Databases
Dec 12, 2018
261
views
6
answers
30
GATE CSE 1998 | Question: 2.19
Which of the following query transformations (i.e., replacing the l.h.s. expression by the r.h.s expression) is incorrect? R1 and R2 are relations, C1 and C2 are selection conditions and A1 and A2 are attributes of R1. ... $\pi_{A_1} \left(\sigma_{C_1}\left(R_1\right)\right) \to \sigma_{C_1} \left(\pi_{A_1}\left(R_1\right)\right)$
commented
in
Databases
Dec 11, 2018
17.2k
views
gate1998
databases
relational-calculus
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:...