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 Shukla_
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Shukla_
1
answer
1
GATE CSE 2014 Set 2 | Question: GA-1
Choose the most appropriate phrase from the options given below to complete the following sentence. India is a post-colonial country because it was a former British colony Indian Information Technology professionals have colonized the world India does not follow any colonial practices India has helped other countries gain freedom
comment edited
in
Verbal Aptitude
Feb 1
2.2k
views
gatecse-2014-set2
verbal-aptitude
most-appropriate-word
easy
6
answers
2
GATE CSE 2019 | Question: GA-6
The police arrested four criminals - $P, Q, R$ and $S.$ The criminals knew each other. They made the following statements: $P$ says Q committed the crime. $Q$ says S committed the crime. $R$ says I did not do it. $S$ says What Q ... the arrested four committed the crime and only one of the statements made above is true. Who committed the crime? $P$ $R$ $S$ $Q$
commented
in
Verbal Aptitude
Jan 29
12.4k
views
gatecse-2019
verbal-aptitude
verbal-reasoning
2-marks
1
answer
3
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 36
Let $A, B, C$ be events such that $P(A)=P(B)=P(C)=0.5, P(A \cap B)=0.3, P(A \cap C)=0$. Which of the following is/are true? $P(A \cup B)=0.75$ $P(A \cup C)=1$ $P(B \cap C)=0.23$ $P(B \cup C)=0.9$
commented
in
Probability
Jan 21
852
views
goclasses2024-mockgate-12
goclasses
probability
multiple-selects
2-marks
2
answers
4
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 38
Consider the following jobs along with their arrival and execution time. ... What is the average turnaround time for these processes with the preemptive shortest remaining processing time first (SRPT) algorithm?
commented
in
Operating System
Jan 21
706
views
goclasses2024-mockgate-12
goclasses
numerical-answers
operating-system
process-scheduling
2-marks
1
answer
5
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 38
A binary relation $\mathrm{R}$ over a set $\mathrm{A}$ is called a "GO Relation" if for all $\mathrm{x}, \mathrm{y}, \mathrm{z}$ $\in A$, if $x R y$ and $x R z$, then $y R z$. Which of the following ... is transitive. If $R$ is a GO relation then $R$ is reflexive. If $R$ is an equivalence relation then $R$ is a GO relation.
commented
in
Set Theory & Algebra
Jan 15
573
views
goclasses2024-mockgate-11
goclasses
set-theory&algebra
relations
multiple-selects
2-marks
2
answers
6
GATE CSE 1997 | Question: 3.5
Locality of reference implies that the page reference being made by a process will always be to the page used in the previous page reference is likely to be to one of the pages used in the last few page references will always be to one of the pages existing in memory will always lead to a page fault
commented
in
Operating System
Jan 12
9.4k
views
gate1997
operating-system
page-replacement
easy
5
answers
7
GATE IT 2006 | Question: 55
Consider the solution to the bounded buffer producer/consumer problem by using general semaphores $S, F,$ and $E$. The semaphore $S$ is the mutual exclusion semaphore initialized to $1$. The semaphore $F$ corresponds to the number of free slots in the buffer and is ... Signal $(F)$ in the Consumer process (I) only (II) only Neither (I) nor (II) Both (I) and (II)
comment edited
in
Operating System
Jan 2
13.4k
views
gateit-2006
operating-system
process-synchronization
normal
5
answers
8
GATE CSE 2002 | Question: 1.22
Which of the following scheduling algorithms is non-preemptive? Round Robin First-In First-Out Multilevel Queue Scheduling Multilevel Queue Scheduling with Feedback
commented
in
Operating System
Dec 28, 2023
18.1k
views
gatecse-2002
operating-system
process-scheduling
easy
8
answers
9
GATE CSE 2010 | Question: 43
The following functional dependencies hold for relations $R(A, B, C)$ and $S(B, D, E).$ $ B \to A$ $A \to C$ The relation $R$ contains $200$ tuples and the relation $S$ contains $100$ tuples. What is the maximum number of tuples possible in the natural join $R \bowtie S$? $100$ $200$ $300$ $2000$
commented
in
Databases
Dec 15, 2023
13.1k
views
gatecse-2010
databases
normal
natural-join
database-normalization
6
answers
10
GATE CSE 2014 Set 2 | Question: 30
Consider a join (relation algebra) between relations $r(R)$ and $s(S)$ using the nested loop method. There are $3$ ... $s(S)$ is more than $0.5$. join selection factor between $r(R)$ and $s(S)$ is less than $0.5$.
comment edited
in
Databases
Dec 13, 2023
20.8k
views
gatecse-2014-set2
databases
normal
joins
7
answers
11
GATE CSE 2004 | Question: 14
Consider the following relation schema pertaining to a students database: Students (rollno, name, address) Enroll (rollno, courseno, coursename) where the primary keys are shown underlined. The number of tuples in the student and Enroll tables are $120$ and $8$ respectively. What ... Student * Enroll), where *' denotes natural join? $8, 8$ $120, 8$ $960, 8$ $960, 120$
commented
in
Databases
Dec 12, 2023
28.6k
views
gatecse-2004
databases
easy
joins
natural-join
3
answers
12
GATE CSE 2003 | Question: 86
Consider the set of relations shown below and the SQL query that follows. Students: (Roll_number, Name, Date_of_birth) Courses: (Course_number, Course_name, Instructor) Grades: (Roll_number, Course_number, Grade) Select distinct Name from Students, Courses, Grades where ... students who have got an A grade in at least one of the courses taught by Korth None of the above
commented
in
Databases
Dec 6, 2023
15.2k
views
gatecse-2003
databases
sql
easy
6
answers
13
GATE CSE 2020 | Question: 40
Let $G = (V,E)$ be a directed, weighted graph with weight function $w: E \rightarrow \mathbb{R}$. For some function $f: V \rightarrow \mathbb{R}$, for each edge$(u,v)\in E$, define ${w}'(u,v)$ as $w(u,v)+f(u)-f(v)$. Which one of the ... from $s$ to $u$ in the graph obtained by adding a new vertex $s$ to $G$ and edges of zero weight from $s$ to every vertex of $G$
commented
in
Algorithms
Nov 30, 2023
18.0k
views
gatecse-2020
algorithms
graph-algorithm
2-marks
6
answers
14
GATE CSE 2007 | Question: 60
Consider the relation employee(name, sex, supervisorName) with name as the key, supervisorName gives the name of the supervisor of the employee under consideration. What does the following Tuple Relational Calculus query produce? ... immediate male subordinates. Names of employees with no immediate female subordinates. Names of employees with a female supervisor.
comment edited
in
Databases
Nov 27, 2023
23.5k
views
gatecse-2007
databases
relational-calculus
normal
3
answers
15
GATE CSE 2000 | Question: 1.23, ISRO2016-57
Given the relations employee (name, salary, dept-no), and department (dept-no, dept-name,address), Which of the following queries cannot be expressed using the basic relational algebra operations ... whose name is the same as their department name The sum of all employees' salaries All employees of a given department
commented
in
Databases
Nov 25, 2023
14.8k
views
gatecse-2000
databases
relational-algebra
easy
isro2016
5
answers
16
GATE CSE 1990 | Question: 3-ii
Indicate which of the following statements are true: A relational database which is in $3$NF may still have undesirable data redundancy because there may exist: Transitive functional dependencies Non-trivial functional dependencies ... dependencies involving prime attributes only on the left-side. Non-trivial functional dependencies involving only prime attributes.
comment edited
in
Databases
Nov 17, 2023
14.4k
views
gate1990
normal
databases
database-normalization
multiple-selects
2
answers
17
GATE IT 2006 | Question: 80
Let $L$ be a regular language. Consider the constructions on $L$ below: repeat $(L) = \{ww \mid w \in L\}$ prefix $(L) = \{u \mid ∃v : uv \in L\}$ suffix $(L) = \{v \mid ∃u : uv \in L\}$ half $(L) = \{u \mid ∃v : | v | = | u | \text{ and } uv \in L\}$ Which of the constructions could lead to a non-regular language? Both I and IV Only I Only IV Both II and III
commented
in
Theory of Computation
Oct 21, 2023
9.3k
views
gateit-2006
theory-of-computation
normal
regular-language
2
answers
18
GATE CSE 2007 | Question: 31
Which of the following languages is regular? $\left\{ww^R \mid w \in \{0, 1\}^+\right\}$ $\left\{ww^Rx \mid x,w \in \{0, 1\}^+\right\}$ $\left\{wxw^R \mid x, w \in \{0, 1\}^+\right\}$ $\left\{xww^R \mid x, w \in \{0, 1\}^+\right\}$
commented
in
Theory of Computation
Oct 18, 2023
14.1k
views
gatecse-2007
theory-of-computation
normal
regular-language
5
answers
19
GATE CSE 2021 Set 2 | Question: 47
Which of the following regular expressions represent(s) the set of all binary numbers that are divisible by three? Assume that the string $\epsilon$ is divisible by three. $(0+1(01^*0)^*1)^*$ $(0+11+10(1+00)^*01)^*$ $(0^*(1(01^*0)^*1)^*)^*$ $(0+11+11(1+00)^*00)^*$
commented
in
Theory of Computation
Oct 13, 2023
12.3k
views
gatecse-2021-set2
multiple-selects
theory-of-computation
regular-expression
2-marks
7
answers
20
GATE CSE 2009 | Question: 15
Which one of the following languages over the alphabet $\{0,1\}$ is described by the regular expression: $(0+1)^*0(0+1)^*0(0+1)^*$? The set of all strings containing the substring $\text{00}$ ... containing at least two $\text{0}$'s The set of all strings that begin and end with either $\text{0}$ or $\text{1}$
commented
in
Theory of Computation
Oct 12, 2023
14.8k
views
gatecse-2009
theory-of-computation
regular-expression
easy
12
answers
21
GATE CSE 2003 | Question: 14
The regular expression $0^*(10^*)^*$ denotes the same set as $(1^*0)^*1^*$ $0+(0+10)^*$ $(0+1)^*10(0+1)^*$ None of the above
commented
in
Theory of Computation
Oct 12, 2023
19.2k
views
gatecse-2003
theory-of-computation
regular-expression
easy
3
answers
22
GATE CSE 2018 | Question: 36
Consider the following problems. $L(G)$ denotes the language generated by a grammar $G$. L(M) denotes the language accepted by a machine $M$. For an unrestricted grammar $G$ and a string $w$, whether $w \in L(G)$ Given a Turing machine ... is correct? Only I and II are undecidable Only II is undecidable Only II and IV are undecidable Only I, II and III are undecidable
commented
in
Theory of Computation
Oct 9, 2023
16.8k
views
gatecse-2018
theory-of-computation
decidability
easy
2-marks
1
answer
23
GATE CSE 1996 | Question: 12
Given below are the transition diagrams for two finite state machines $M_1$ and $M_2$ recognizing languages $L_1$ and $L_2$ respectively. Display the transition diagram for a machine that recognizes $L_1.L_2$, obtained from transition diagrams for $M_1$ ... $\varepsilon$ transitions and no new states. (Final states are enclosed in double circles).
commented
in
Theory of Computation
Sep 16, 2023
8.5k
views
gate1996
theory-of-computation
finite-automata
normal
descriptive
9
answers
24
GATE CSE 2013 | Question: 44
Consider the following operation along with Enqueue and Dequeue operations on queues, where $k$ is a global parameter. MultiDequeue(Q){ m = k while (Q is not empty) and (m > 0) { Dequeue(Q) m = m – 1 } } What is the worst case time complexity of a sequence of $n$ queue operations on an initially empty queue? $Θ(n)$ $Θ(n + k)$ $Θ(nk)$ $Θ(n^2)$
comment edited
in
DS
Sep 13, 2023
31.3k
views
gatecse-2013
data-structures
algorithms
normal
queue
4
answers
25
GATE CSE 1996 | Question: 2.7
The probability that top and bottom cards of a randomly shuffled deck are both aces is $\frac{4}{52} \times \frac{4}{52}$ $\frac{4}{52} \times \frac{3}{52}$ $\frac{4}{52} \times \frac{3}{51}$ $\frac{4}{52} \times \frac{4}{51}$
commented
in
Probability
Sep 4, 2023
4.9k
views
gate1996
probability
easy
12
answers
26
GATE CSE 2003 | Question: 64
Let S be a stack of size $n \geq1$. Starting with the empty stack, suppose we push the first n natural numbers in sequence, and then perform $n$ pop operations. Assume that Push and Pop operations take $X$ seconds each, and $Y$ seconds elapse between the end of one such ... S. The average stack-life of an element of this stack is $n(X+Y)$ $3Y+2X$ $n(X+Y)-X$ $Y+2X$
comment edited
in
DS
Aug 29, 2023
30.8k
views
gatecse-2003
data-structures
stack
normal
6
answers
27
GATE CSE 2016 Set 2 | Question: 15
$N$ items are stored in a sorted doubly linked list. For a delete operation, a pointer is provided to the record to be deleted. For a decrease-key operation, a pointer is provided to the record on which the operation is to be performed. An algorithm performs the following operations ... together? $O(\log^{2} N)$ $O(N)$ $O(N^{2})$ $\Theta\left(N^{2}\log N\right)$
commented
in
DS
Aug 26, 2023
34.2k
views
gatecse-2016-set2
data-structures
linked-list
time-complexity
normal
algorithms
5
answers
28
GATE CSE 2017 Set 2 | Question: 36
The pre-order traversal of a binary search tree is given by $12, 8, 6, 2, 7, 9, 10, 16, 15, 19, 17, 20$. Then the post-order traversal of this tree is $2, 6, 7, 8, 9, 10, 12, 15, 16, 17, 19, 20$ $2, 7, 6, 10, 9, 8, 15, 17, 20, 19, 16, 12$ $7, 2, 6, 8, 9, 10, 20, 17, 19, 15, 16, 12$ $7, 6, 2, 10, 9, 8, 15, 16, 17, 20, 19, 12$
comment edited
in
DS
Aug 12, 2023
8.6k
views
gatecse-2017-set2
data-structures
binary-search-tree
2
answers
29
GATE CSE 2013 | Question: 43
The preorder traversal sequence of a binary search tree is $30, 20, 10, 15, 25, 23, 39, 35, 42$. Which one of the following is the postorder traversal sequence of the same tree? $10, 20, 15, 23, 25, 35, 42, 39, 30$ $15, 10, 25, 23, 20, 42, 35, 39, 30$ $15, 20, 10, 23, 25, 42, 35, 39, 30$ $15, 10, 23, 25, 20, 35, 42, 39, 30$
commented
in
DS
Aug 12, 2023
11.9k
views
gatecse-2013
data-structures
binary-search-tree
normal
3
answers
30
GATE CSE 2015 Set 3 | Question: 23
Suppose $U$ is the power set of the set $S = \{1, 2, 3, 4, 5, 6\}$. For any $T \in U$, let $|T|$ denote the number of elements in $T$ and $T'$ denote the complement of $T$. For any $T, R \in U \text{ let } T \backslash R$ be the set ... $X \backslash Y = \phi)$ $\forall X \in U, \forall Y \in U, (X \backslash Y = Y' \backslash X')$
comment edited
in
Set Theory & Algebra
Jul 4, 2023
12.0k
views
gatecse-2015-set3
set-theory&algebra
set-theory
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:...