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 Satbir
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Satbir
1
vote
61
CMI2018-B-2
A student requests a recommendation letter from a professor. The professor gives three sealed envelopes. Each envelope contains either a good recommendation letter or a bad recommendation letter. Make a list of all the possible scenarios. Suppose now the professor tells ... and the other two are false. Can the student find out the contents of the envelopes without breaking their seals?
answered
in
Analytical Aptitude
Sep 13, 2019
539
views
cmi2018
descriptive
logical-reasoning
1
vote
62
CMI2018-B-1
Consider the following non-deterministic finite automata(NFA) $A_{1}$ and $A_{2}:$ Give an example of a word which is accepted by both $A_{1}$ and $A_{2}.$ Give an example of a word which is accepted by $A_{1},$ but not by $A_{2}.$ Draw the deterministic finite automaton(DFA) equivalent to $A_{1}.$
answered
in
Theory of Computation
Sep 13, 2019
631
views
cmi2018
finite-automata
descriptive
1
vote
63
CMI2018-A-10
What does the following function compute in terms of $n$ and $d$, for integer value of $n$ and $d,d>1?$ Note that $a//b$ denotes the quotient(integer part) of $a \div b,$ for integers $a$ and $b$. For instance $7//3$ is $2.$ function foo(n,d) ... $n.$ The number of digits in the base $d$ representation of $n.$ The number of ways of partitioning $n$ elements into groups of size $d.$
answered
in
Programming in C
Sep 13, 2019
856
views
cmi2018
identify-function
2
votes
64
CMI2018-A-8
There are $7$ switches on a switchboard, some of which are on and some of which are off. In one move, you pick any $2$ switches and toggle each of them-if the switch you pick is currently off, you turn it on, if it is on, you turn it off. Your aim is to execute a sequence of ... (off,on,off,on,off,off,on) (off,on,on,on,on,on,off) (on,off,on,on,on,on,on) (off,off,off,off,off,on,off)
answered
in
Probability
Sep 13, 2019
980
views
cmi2018
conditional-probability
6
votes
65
CMI2018-A-6
You are given two coins $A$ and $B$ that look identical. The probability that coin $A$ turns up heads is $\frac{1}{4}$, while the probability that coin $B$ turns up heads is $\frac{3}{4}.$ You choose one of the coins at random and toss it twice. If both the outcomes are heads, what is the probability that you chose coin $B?$ $\frac{1}{16}$ $\frac{1}{2}$ $\frac{9}{16}$ $\frac{9}{10}$
answered
in
Probability
Sep 13, 2019
759
views
cmi2018
conditional-probability
1
vote
66
CMI2018-A-4
Let $G=(V, E)$ be an undirected simple graph, and $s$ be a designated vertex in $G.$ For each $v\in V,$ let $d(v)$ be the length of a shortest path between $s$ and $v.$ For an edge $(u,v)$ in $G,$ what can not be the value of $d(u)-d(v)?$ $2$ $-1$ $0$ $1$
answered
in
Graph Theory
Sep 13, 2019
769
views
cmi2018
graph-theory
shortest-path
1
vote
67
CMI2018-A-3
In a running race, Geetha finishes ahead of Shalini and Vani finishes after Aparna. Divya finishes ahead of Aparna. Which of the following is a minimal set of additional information that can determine the winner? Geetha finishes ahead of Divya and Vani finishes ahead of Shalini. Aparna finishes ahead of Shalini. Divya finishes ahead of Geetha. None of the above.
answered
in
Analytical Aptitude
Sep 13, 2019
468
views
cmi2018
logical-reasoning
0
votes
68
CMI2018-A-2
Akash, Bharani, Chetan and Deepa are invited to a party. If Bharani and Chetan attend, then Deepa will attend too. If Bharani does not attend, then Akash will not attend. If Deepa does not attend, which of the following is true? Chetan does not attend Akash does not attend either (A) or (B) none of the above
answered
in
Analytical Aptitude
Sep 13, 2019
679
views
cmi2018
logical-reasoning
6
votes
69
CMI2019-A-4
There are five buckets, each of which can be open or closed. An arrangement is a specification of which buckets are open and which bucket are closed. Every person likes some of the arrangements and dislikes the rest. You host a party, and amazingly, no two people on the guest list have the ... What is the maximum number of guests possible? $5^{2}$ $\binom{5}{2}$ $2^{5}$ $2^{2^{5}}$
answered
in
Combinatory
Sep 13, 2019
701
views
cmi2019
combinatory
arrangements
4
votes
70
CMI2019-A-2
Let $A$ be an $NFA$ with $n$ states. Which of the following is necessarily true? The shortest word in $L(A)$ has length at most $n-1.$ The shortest word in $L(A)$ has length at least $n.$ The shortest word not in $L(A)$ has length at most $n-1.$ The shortest word not in $L(A)$ has length at least $n.$
answered
in
Theory of Computation
Sep 13, 2019
857
views
cmi2019
finite-automata
3
votes
71
CMI2019-A-1
Let $L_{1}:=\{a^{n}b^{m}\mid m,n\geq 0\: \text{and}\: m\geq n\}$ and $L_{2}:=\{a^{n}b^{m}\mid m,n\geq 0\: \text{and}\: m < n\}.$ The language $L_{1}\cup L_{2}$ is: regular, but not context-free context-free, but not regular both regular and context-free neither regular nor context-free
answered
in
Theory of Computation
Sep 13, 2019
871
views
cmi2019
regular-language
context-free-language
closure-property
23
votes
72
GATE CSE 1998 | Question: 24
Four jobs are waiting to be run. Their expected run times are $6, 3, 5$ and $x.$ In what order should they be run to minimize the average response time? Write a concurrent program using $\text{par begin-par end}$ to represent the precedence graph shown below.
answered
in
Operating System
Sep 11, 2019
12.1k
views
gate1998
operating-system
process-scheduling
descriptive
7
votes
73
VIEW SERIALIZABILITY
Consider the 2 transactions T1: R(A) W(A) W(B) T2: R(A) W(A) R(B) W(B) How many view serializable schedules are possible which are not conflict serializable? (A) 0 (B) 1 (C) 2 (D) 3
answered
in
Databases
Aug 27, 2019
2.9k
views
view-serializable
databases
transaction-and-concurrency
concurrency
3
votes
74
GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 9
For which of the following languages a LL(1) grammar does not exist? $\{a^n o b^n \mid n \geq 1\} \cup \{ a^n b^{n} \mid n \geq 1 \}$ $\{ a^n b^m \mid m,n \geq 0 \}$ $\{a^ib^j\mid i\geq j\}$ $\{a^ib^j\mid i= j\}$
answered
in
Compiler Design
Aug 24, 2019
1.9k
views
go-cd-1
2
votes
75
GATE IT 2005 | Question: 3
The determinant of the matrix given below is $\begin{bmatrix} 0 &1 &0 &2 \\ -1& 1& 1& 3\\ 0&0 &0 & 1\\ 1& -2& 0& 1 \end{bmatrix}$ $-1$ $0$ $1$ $2$
answered
in
Linear Algebra
Aug 5, 2019
20.3k
views
gateit-2005
linear-algebra
normal
determinant
26
votes
76
GATE CSE 2018 | Question: 49
Consider the minterm list form of a Boolean function $F$ given below. $F(P, Q, R, S) = \Sigma m(0, 2, 5, 7, 9, 11) + d(3, 8, 10, 12, 14)$ Here, $m$ denotes a minterm and $d$ denotes a don't care term. The number of essential prime implicants of the function $F$ is ___
answered
in
Digital Logic
Jul 29, 2019
16.5k
views
gatecse-2018
digital-logic
min-sum-of-products-form
numerical-answers
2-marks
2
votes
77
Common Careless Mistakes
What are the most common mistakes you have made in tests? A good list will help aspirants reduce their mistakes in GATE. Just listing out some common ones. Missing the NOT in question - our eyes have a tendency to focus on important words and ... many calculation mistakes. In any formula you do, you must get the correct unit for the result Please add more as answers.
answered
in
Revision
Jul 28, 2019
4.1k
views
mistakes
preparation
2
votes
78
UGC NET CSE | June 2019 | Part 2 | Question: 45
Consider three CPU intensive processes, which require $10$, $20$ and $30$ units of time and arrive at times $0$, $2$ and $6$ respectively. How many context switches are needed if the operating system implements a shortest remaining time first scheduling algorithm? Do not count the context switches at time zero and at the end. $4$ $2$ $3$ $1$
answered
in
Operating System
Jul 24, 2019
3.7k
views
ugcnetcse-june2019-paper2
process-scheduling
20
votes
79
GATE CSE 1999 | Question: 2.6
For the schedule given below, which of the following is correct: ... schedule is not serializable but can occur in a scheme using 2PL protocol This schedule is not serializable and cannot occur in a scheme using 2PL protocol
answered
in
Databases
Jul 21, 2019
14.1k
views
gate1999
databases
transaction-and-concurrency
normal
0
votes
80
UGC NET CSE | June 2019 | Part 2 | Question: 35
Which of the following key constraints is required for functioning of foreign key in the context relational databases? Unique key Primary key Candidate key Check key
answered
in
Databases
Jul 20, 2019
3.5k
views
ugcnetcse-june2019-paper2
candidate-key
5
votes
81
UGC NET CSE | June 2019 | Part 2 | Question: 42
Match List-I with List-II: ... -i; b-ii; c-iii; d-iv a-iii; b-i; c-iv; d-ii a-ii; b-i; c-iv; d-iii a-ii; b-iv; c-iii; d-i
answered
in
Operating System
Jul 19, 2019
1.9k
views
ugcnetcse-june2019-paper2
disk-cpu-memory-interrupt
1
vote
82
UGC NET CSE | June 2019 | Part 2 | Question: 43
Consider that a process has been allocated $3$ frames and has a sequence of page referencing as $1, 2, 1, 3, 7, 4, 5, 6, 3, 1$. What shall be the difference in page faults for the above string using the algorithms of LRU and optimal page replacement for referencing the string? $2$ $0$ $1$ $3$
answered
in
Operating System
Jul 19, 2019
4.2k
views
ugcnetcse-june2019-paper2
page-replacement
least-recently-used
4
votes
83
UGC NET CSE | June 2019 | Part 2 | Question: 75
How many states are there in a minimum state automata equivalent to regular expression given below? Regular expression is $a^*b(a+b)$ $1$ $2$ $3$ $4$
answered
in
Theory of Computation
Jul 19, 2019
4.6k
views
ugcnetcse-june2019-paper2
finite-automata
minimal-state-automata
1
vote
84
UGC NET CSE | June 2019 | Part 2 | Question: 48
A computer has six tape drives with $n$ processes competing for them. Each process may need two drives. What is the maximum value of $n$ for the system to be deadlock free? $5$ $4$ $3$ $6$
answered
in
Operating System
Jul 19, 2019
2.5k
views
ugcnetcse-june2019-paper2
deadlock-prevention-avoidance-detection
8
votes
85
UGC NET CSE | June 2019 | Part 2 | Question: 34
In relational databases, if relation R is in BCNF, then which of the following is true about relation R? R is in 4NF R is not in 1NF R is in 2NF and not in 3NF R is in 2NF and 3NF
answered
in
Databases
Jul 19, 2019
3.2k
views
ugcnetcse-june2019-paper2
database-normalization
12
votes
86
GATE IT 2006 | Question: 85
Consider a database with three relation instances shown below. The primary keys for the Drivers and Cars relation are did and cid respectively and the records are stored in ascending order of these primary keys as given in the tables. No indexing is available in the database. ... key, then $n$ lies in the range: $36 - 40$ $44 - 48$ $60 - 64$ $100 - 104$
answered
in
Databases
Jul 19, 2019
22.4k
views
gateit-2006
databases
sql
normal
18
votes
87
GATE CSE 2010 | Question: 19
A relational schema for a train reservation database is given below. passenger(pid, pname, age) reservation(pid, class, tid) ... (SELECT * FROM Passenger WHERE age>65 AND Passenger.pid=Reservation.pid) $1, 0$ $1, 2$ $1, 3$ $1, 5$
answered
in
Databases
Jul 18, 2019
8.3k
views
gatecse-2010
databases
sql
normal
26
votes
88
GATE CSE 2006 | Question: 67
Consider the relation account (customer, balance) where the customer is a primary key and there are no null values. We would like to rank customers according to decreasing balance. The customer with the largest balance gets rank $1.$ Ties are not broke but ranks are skipped: if ... of the above statements are correct? $2$ and $5$ $1$ and $3$ $1$ and $4$ $3$ and $5$
answered
in
Databases
Jul 18, 2019
21.0k
views
gatecse-2006
databases
sql
normal
24
votes
89
GATE IT 2008 | Question: 63
Consider the following three schedules of transactions T1, T2 and T3. [Notation: In the following NYO represents the action Y (R for read, W for write) performed by transaction N on object O.] ... equivalent to each other S2 is conflict equivalent to S3, but not to S1 S1 is conflict equivalent to S2, but not to S3
answered
in
Databases
Jul 17, 2019
18.5k
views
gateit-2008
databases
transaction-and-concurrency
normal
1
vote
90
UGC NET CSE | June 2019 | Part 2 | Question: 6
Which of the following is principal conjunctive normal form for $[(p\vee q)\wedge\ \neg p \rightarrow \neg q ]$ ? $p\ \vee \neg q$ $p \vee q $ $\neg p \vee q$ $\neg p\ \vee \neg q$
answered
in
Mathematical Logic
Jul 6, 2019
7.6k
views
ugcnetcse-june2019-paper2
propositional-logic
Page:
« prev
1
2
3
4
5
6
7
8
...
10
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:...