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 Yogesh88
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Yogesh88
1
answer
1
Feeling lost affecting PGEE prep
GATE 2021: 1700 rank GATE 2022: 3500 rank this has broken me. a year full of preparation and results not at all as expected. I am preparing for PGEE but I feel lost. I want to get into IIIT H but I am not currently confident enough. ... and IIIts like Allahabad. My expectations are much higher and PGEE can solve all my problems for now. how should I deal with this?
commented
in
IIITH-PGEE
May 17, 2022
1.9k
views
exam-stress
iiith-pgee
11
answers
2
GATE CSE 2008 | Question: 45
Dijkstra's single source shortest path algorithm when run from vertex $a$ in the above graph, computes the correct shortest path distance to only vertex $a$ only vertices $a, e, f, g, h$ only vertices $a, b, c, d$ all the vertices
commented
in
Algorithms
Aug 2, 2021
27.5k
views
gatecse-2008
algorithms
graph-algorithms
normal
2
answers
3
GATE2018 CE-2: GA-7
A faulty wall clock is known to gain $15$ minutes every $24$ hours. It is synchronized to the correct time at $9$ AM on $11$th July. What will be the correct time to the nearest minute when the clock shows $2$ PM on $15$th July of the same year? $12:45$ PM $12:58$ PM $1:00$ PM $2:00$ PM
commented
in
Quantitative Aptitude
Feb 5, 2021
3.6k
views
gate2018-ce-2
general-aptitude
quantitative-aptitude
clock-time
normal
5
answers
4
GATE CSE 2006 | Question: 10
In a binary max heap containing $n$ numbers, the smallest element can be found in time $O(n)$ $O(\log n)$ $O(\log \log n)$ $O(1)$
commented
in
DS
Jan 27, 2021
20.7k
views
gatecse-2006
data-structures
binary-heap
easy
4
answers
5
no of subnets
If we have 3 bits in the subnetid then how many subnets we have..?? 6 or 8?
commented
in
Computer Networks
Jan 6, 2021
2.2k
views
subnetting
computer-networks
6
answers
6
GATE CSE 2014 Set 2 | Question: 54
SQL allows duplicate tuples in relations, and correspondingly defines the multiplicity of tuples in the result of joins. Which one of the following queries always gives the same answer as the nested query shown below: select * from R where a in (select S.a from S) select R. ... a from S) as S1 where R.a=S1.a select R.* from R,S where R.a=S.a and is unique R
commented
in
Databases
Nov 15, 2020
19.4k
views
gatecse-2014-set2
databases
sql
normal
9
answers
7
GATE CSE 2018 | Question: 14
Consider the following statements regarding the slow start phase of the TCP congestion control algorithm. Note that cwnd stands for the TCP congestion window and MSS window denotes the Maximum Segments Size: The cwnd increases by $2$ MSS on every successful acknowledgment The cwnd ... true Only $\text{(iv)}$ is true Only $\text{(i)}$ and $\text{(iv)}$ are true
answer edited
in
Computer Networks
Sep 30, 2020
23.0k
views
gatecse-2018
computer-networks
tcp
congestion-control
normal
1-mark
2
answers
8
MadeEasy Test Series: Compiler Design - Intermediate Code
a x b x c + d - a + e x f - g + h order of precedence : x>+>- ; with x is left associative and +, - as right. Min number of variables required in TAC? Should'nt the expression be expressed as : ((a x b) x c) + d - a + (e x f) - g + h (((a x b) x c) + (d - (a + (e x f)) - (g + h)))
commented
in
Compiler Design
Sep 12, 2020
1.1k
views
made-easy-test-series
compiler-design
intermediate-code
6
answers
9
GATE CSE 2016 Set 2 | Question: 27
Which one of the following well-formed formulae in predicate calculus is NOT valid ? $(\forall _{x} p(x) \implies \forall _{x} q(x)) \implies (\exists _{x} \neg p(x) \vee \forall _{x} q(x))$ ... $\forall x (p(x) \vee q(x)) \implies (\forall x p(x) \vee \forall x q(x))$
answered
in
Mathematical Logic
Aug 3, 2020
16.8k
views
gatecse-2016-set2
mathematical-logic
first-order-logic
normal
9
answers
10
GATE CSE 2016 Set 1 | Question: 33
Consider a carry look ahead adder for adding two $n$-bit integers, built using gates of fan-in at most two. The time to perform addition using this adder is $\Theta (1)$ $\Theta (\log(n))$ $\Theta (\sqrt{n})$ $\Theta (n)$)
commented
in
Digital Logic
Oct 31, 2019
31.0k
views
gatecse-2016-set1
digital-logic
adder
normal
3
answers
11
MadeEasy Test Series 2019: Databases - Transaction And Concurrency
Consider the following schedule $\text{S : r2(A), w1(B), w1(C), R3(B), r2(B), r1(A), commit_1, r2(C), commit_2, w3(A), commit_3 }$ Consider the following statements : S1 : Schedule(S) is conflict ... ) is strict recoverable schedule. S4 : Schedule(S) is allowed by strict 2PL. How many above statements true about schedule(S) ?
answered
in
Databases
Oct 21, 2019
3.5k
views
transaction-and-concurrency
made-easy-test-series
4
answers
12
GATE CSE 2014 Set 1 | Question: 36
Which of the regular expressions given below represent the following DFA? $0^*1(1+00^*1)^* $ $0^*1^*1+11^*0^*1 $ $(0+1)^*1$ I and II only I and III only II and III only I, II and III
answered
in
Theory of Computation
Oct 3, 2019
18.8k
views
gatecse-2014-set1
theory-of-computation
regular-expression
finite-automata
easy
4
answers
13
GATE CSE 2016 Set 1 | Question: 18
Which one of the following regular expressions represents the language: the set of all binary strings having two consecutive $0$'s and two consecutive $1$'s? $(0+1 )^ *0011 (0+1)^* +(0+1)^*1100(0+1)^*$ $(0+1)^* (00(0+1)^*11+11(0+1)^*00)(0+1)^*$ $(0+1)^*00(0+1)^* + (0+1)^*11 (0+1)^*$ $00(0+1)^*11 +11(0+1)^*00$
commented
in
Theory of Computation
Oct 2, 2019
20.7k
views
gatecse-2016-set1
theory-of-computation
regular-expression
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:...