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 Ahwan
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Ahwan
3
answers
1
Time complexity of quick sort when we take pivot as the middle element
Time complexity of quick sort when we take pivot from the middle element
answer edited
in
Algorithms
Jul 17, 2022
7.6k
views
algorithms
time-complexity
quick-sort
5
answers
2
GATE CSE 2017 Set 1 | Question: 26
Let $G=\left ( V,E \right )$ be $any$ connected, undirected, edge-weighted graph. The weights of the edges in $E$ are positive and distinct. Consider the following statements: Minimum Spanning Tree of $G$ is always unique. Shortest path between ... always unique. Which of the above statements is/are necessarily true? I only II only both I and II neither I nor II
commented
in
Algorithms
May 9, 2020
12.3k
views
gatecse-2017-set1
algorithms
graph-algorithms
normal
3
answers
3
Self doubt
You are asked to sort 15 randomly generated numbers. One should prefer— (a) Bubble sort (b) Quick sort (c) Merge sort (d) Heap sort I think the answer should be c or d crct me???
answer edited
in
Algorithms
May 3, 2020
1.6k
views
algorithms
sorting
merge-sort
heap-sort
3
answers
4
CMI2011-B-06a
Consider a plate stacked with several disks, each of a different diameter (they could all be, for instance, $\text{dosas}$ or $\text{chapatis}$ of different sizes). We want to sort these disks in decreasing order according to their diameter so that the ... or $\text{chapatis}$ between two big spoons and flipping the stack.) Give an algorithm for sorting the disks using this operation.
commented
in
Algorithms
Feb 15, 2020
1.8k
views
cmi2011
descriptive
algorithms
sorting
7
answers
5
GATE CSE 2018 | Question: 30
Let $G$ be a simple undirected graph. Let $T_D$ be a depth first search tree of $G$. Let $T_B$ be a breadth first search tree of $G$. Consider the following statements. No edge of $G$ is a cross edge with respect to $T_D$. (A cross edge in $G$ ... $\mid i-j \mid =1$. Which of the statements above must necessarily be true? I only II only Both I and II Neither I nor II
commented
in
Algorithms
Nov 5, 2019
27.2k
views
gatecse-2018
algorithms
graph-algorithm
graph-search
normal
2-marks
6
answers
6
GATE IT 2006 | Question: 21
Consider the following first order logic formula in which $R$ is a binary relation symbol. $∀x∀y (R(x, y) \implies R(y, x))$ The formula is satisfiable and valid satisfiable and so is its negation unsatisfiable but its negation is valid satisfiable but its negation is unsatisfiable
answer edited
in
Mathematical Logic
Oct 3, 2019
13.3k
views
gateit-2006
mathematical-logic
normal
first-order-logic
9
answers
7
GATE CSE 2018 | Question: 47
Consider the following undirected graph $G$: Choose a value for $x$ that will maximize the number of minimum weight spanning trees (MWSTs) of $G$. The number of MWSTs of $G$ for this value of $x$ is ____.
commented
in
Algorithms
Jul 26, 2019
17.4k
views
gatecse-2018
algorithms
graph-algorithm
minimum-spanning-tree
numerical-answers
2-marks
3
answers
8
GATE CSE 2008 | Question: 18
Which combination of the integer variables $x, y,$ and $z$ makes the variable $a$ get the value $4$ in the following expression? $a=(x > y)?((x > z) ?x:z): ((y > z) ?y:z)$ $x=3, y=4, z=2$ $x=6, y=5, z=3$ $x=6, y=3, z=5$ $x=5, y=4, z=5$
comment edited
in
Programming in C
Feb 7, 2019
12.5k
views
gatecse-2008
programming
programming-in-c
easy
10
answers
9
GATE CSE 2016 Set 2 | Question: 29
The value of the expression $13^{99}\pmod{17}$ in the range $0$ to $16$, is ________.
answer edited
in
Combinatory
Nov 20, 2018
17.7k
views
gatecse-2016-set2
modular-arithmetic
normal
numerical-answers
7
answers
10
GATE CSE 2017 Set 1 | Question: 02
Consider the first-order logic sentence $F:\forall x(\exists yR(x,y))$. Assuming non-empty logical domains, which of the sentences below are implied by $F$? $\exists y(\exists xR(x,y))$ $\exists y(\forall xR(x,y))$ $\forall y(\exists xR(x,y))$ $¬\exists x(\forall y¬R(x,y))$ IV only I and IV only II only II and III only
answer edited
in
Mathematical Logic
Oct 25, 2018
17.2k
views
gatecse-2017-set1
mathematical-logic
first-order-logic
5
answers
11
GATE CSE 2002 | Question: 15
A university placement center maintains a relational database of companies that interview students on campus and make job offers to those successful in the interview. The schema of the database is given below: ... students were offered jobs, the name of the degree and the average offered salary of students in this degree program.
commented
in
Databases
Oct 6, 2018
5.5k
views
gatecse-2002
databases
normal
descriptive
relational-algebra
sql
8
answers
12
GATE CSE 2013 | Question: 27
What is the logical translation of the following statement? "None of my friends are perfect." $∃x(F (x)∧ ¬P(x))$ $∃ x(¬ F (x)∧ P(x))$ $ ∃x(¬F (x)∧¬P(x))$ $ ¬∃ x(F (x)∧ P(x))$
commented
in
Mathematical Logic
Oct 2, 2018
14.0k
views
gatecse-2013
mathematical-logic
easy
first-order-logic
8
answers
13
GATE CSE 2015 Set 3 | Question: 7
Consider the following C program segment. # include <stdio.h> int main() { char s1[7] = "1234", *p; p = s1 + 2; *p = '0'; printf("%s", s1); } What will be printed by the program? $12$ $120400$ $1204$ $1034$
commented
in
Programming in C
Aug 23, 2018
16.0k
views
gatecse-2015-set3
programming
programming-in-c
normal
array
6
answers
14
GATE CSE 2014 Set 3 | Question: 26
An IP router implementing Classless Inter-domain Routing (CIDR) receives a packet with address $131.23.151.76$ ... The identifier of the output interface on which this packet will be forwarded is ______.
commented
in
Computer Networks
Apr 12, 2018
17.1k
views
gatecse-2014-set3
computer-networks
routing
normal
numerical-answers
6
answers
15
GATE CSE 2018 | Question: 25
Consider a long-lived $\text{TCP}$ session with an end-to-end bandwidth of $1\; \text{Gbps}\; (=10^9$ bits-per-second$).$ The session starts with a sequence number of $1234$. The minimum time (in seconds, rounded to the closet integer) before this sequence number can be used again is _________.
commented
in
Computer Networks
Mar 14, 2018
21.3k
views
gatecse-2018
computer-networks
tcp
normal
numerical-answers
1-mark
1
answer
16
self doubt
what is the difference between estimated rank and current rank in GO RANK PREDICTOR?? I have a lot of difference between those both what should be considered ? some one please clarify
commented
in
Others
Feb 15, 2018
1.4k
views
others
0
answers
17
Year-2018,set-1
What rank can I expect if my gate marks are 53 for mechanical set 1 ,2018?
closed
in
GATE
Feb 14, 2018
1.4k
views
1
answer
18
own mind
when come official key of gate 2018 by iit??
answered
in
Others
Feb 14, 2018
634
views
6
answers
19
GATE CSE 2018 | Question: GA-8
In a party, $60\%$ of the invited guests are male and $40\%$ are female.If $80\%$ of the invited guests attended the party and if all the invited female guests attended, what would be the ratio of males to females among the attendees in the party? $2\colon 3$ $1\colon 1$ $3\colon 2$ $2\colon 1$
answered
in
Quantitative Aptitude
Feb 14, 2018
6.2k
views
gatecse-2018
quantitative-aptitude
ratio-proportions
2-marks
10
answers
20
GATE CSE 2018 | Question: GA-5
$\text{ What is the missing number in the following sequence?}$ $2,\,12,\,60,\,240,\,720,\,1440,\,\underline{\;\;\;\;\;\;\;\;},0$ $2880$ $1440$ $720$ $0$
answered
in
Quantitative Aptitude
Feb 14, 2018
5.6k
views
gatecse-2018
quantitative-aptitude
sequence-series
easy
1-mark
8
answers
21
GATE CSE 2016 Set 1 | Question: 32
The stage delays in a $4$-stage pipeline are $800, 500, 400$ and $300$ picoseconds. The first stage (with delay $800$ picoseconds) is replaced with a functionality equivalent design involving two stages with respective delays $600$ and $350$ picoseconds. The throughput increase of the pipeline is ___________ percent.
answered
in
CO and Architecture
Jan 29, 2018
25.6k
views
gatecse-2016-set1
co-and-architecture
pipelining
normal
numerical-answers
10
answers
22
GATE CSE 2007 | Question: 80
Consider a machine with a byte addressable main memory of $2^{16}$ bytes. Assume that a direct mapped data cache consisting of $32$ lines of $64$ bytes each is used in the system. A $50 \times 50$ two-dimensional array of bytes is stored in the main ... data cache do not change in between the two accesses. How many data misses will occur in total? $48$ $50$ $56$ $59$
answer edited
in
CO and Architecture
Jan 25, 2018
32.3k
views
gatecse-2007
co-and-architecture
cache-memory
normal
7
answers
23
GATE CSE 2017 Set 1 | Question: 13
Consider the following C code: #include<stdio.h> int *assignval (int *x, int val) { *x = val; return x; } void main () { int *x = malloc(sizeof(int)); if (NULL == x) return; x = assignval (x,0); ... and not as shown. compiles successfully but execution may result in dangling pointer. compiles successfully but execution may result in memory leak.
commented
in
Programming in C
Jan 24, 2018
35.2k
views
gatecse-2017-set1
programming-in-c
programming
pointers
4
answers
24
GATE CSE 2008 | Question: 68
Let R and S be two relations with the following schema $R(\underline{P,Q}, R1, R2, R3)$ $S(\underline{P,Q}, S1, S2)$ where $\left\{P, Q\right\}$ is the key for both schemas. Which of the following queries are equivalent? $\Pi_P \left(R \bowtie S\right)$ ... Only I and II Only I and III Only I, II and III Only I, III and IV
commented
in
Databases
Jan 18, 2018
17.9k
views
gatecse-2008
databases
relational-algebra
normal
4
answers
25
GATE IT 2006 | Question: 37
For a state machine with the following state diagram the expression for the next state $S^+$ in terms of the current state $S$ and the input variables $x$ and $y$ is $S^+ = S' . y' + S . x$ $S^+ = S. x . y' + S' . y . x'$ $S^+ = x . y'$ $S^+ = S' . y + S . x'$
commented
in
Theory of Computation
Jan 16, 2018
8.3k
views
gateit-2006
theory-of-computation
finite-automata
normal
5
answers
26
GATE CSE 2015 Set 2 | Question: 55
Which one of the following well-formed formulae is a tautology? $\forall x \, \exists y \, R(x,y) \, \leftrightarrow \, \exists y \, \forall x \, R(x, y)$ ... $\forall x \, \forall y \, P(x,y) \, \rightarrow \, \forall x \, \forall y \, P(y, x)$
comment edited
in
Mathematical Logic
Jan 4, 2018
20.9k
views
gatecse-2015-set2
mathematical-logic
normal
first-order-logic
8
answers
27
GATE IT 2008 | Question: 84
Host $X$ has IP address $192.168.1.97$ and is connected through two routers $R1$ and $R2$ to another host $Y$ with IP address $192.168.1.80$. Router $R1$ has IP addresses $192.168.1.135$ and $192.168.1.110$. $R2$ ... $1$ $2$ $3$ $6$
commented
in
Computer Networks
Jan 3, 2018
11.9k
views
gateit-2008
computer-networks
subnetting
normal
4
answers
28
GATE CSE 2007 | Question: 29
A minimum state deterministic finite automaton accepting the language $L=\{w\mid w \in \{0, 1\}^*,$ number of $0$s and $1$s in $w$ are divisible by $3$ and $5$, respectively $\}$ has $15$ states $11$ states $10$ states $9$ states
commented
in
Theory of Computation
Dec 31, 2017
11.5k
views
gatecse-2007
theory-of-computation
finite-automata
normal
minimal-state-automata
2
answers
29
draw polygraph of this , check for view serializability
T1 T2 W(x) R(x) W(x) ABORT COMMIT
answered
in
Databases
Dec 26, 2017
3.7k
views
view-serializable
serializability
databases
normal
2
answers
30
Sheldon Ross Example 3.7f
A plane is missing and it is presumed that it was equally likely to have gone down in any of three possible regions. Let 1 − αi denote the probability the plane will be found upon a search of the ith region when the plane is, in fact, in that ... conditional probability that the plane is in the ith region, given that a search of region 1 is unsuccessful, i = 1, 2, 3?
commented
in
Probability
Dec 5, 2017
1.8k
views
probability
discrete-mathematics
sheldon-ross
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:...