The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent activity by SomeEarth
User SomeEarth
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User SomeEarth
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
3
answers
1
GATE200627
Consider the following propositional statements: $P_1: ((A ∧ B) → C)) ≡ ((A → C) ∧ (B → C))$ $P_2: ((A ∨ B) → C)) ≡ ((A → C) ∨ (B → C))$ Which one of the following is true? $P_1$ is a tautology, but not $P_2$ $P_2$ is a tautology, but not $P_1$ $P_1$ and $P_2$ are both tautologies Both $P_1$ and $P_2$ are not tautologies
commented
Aug 23, 2019
in
Mathematical Logic

2.2k
views
gate2006
mathematicallogic
normal
propositionallogic
2
answers
2
GATE199202,xvi
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: Which of the following is/are a tautology? $a \vee b \to b \wedge c$ $a \wedge b \to b \vee c$ $a \vee b \to \left(b \to c \right)$ $a \to b \to \left(b \to c \right)$
commented
Aug 20, 2019
in
Mathematical Logic

1.3k
views
gate1992
mathematicallogic
easy
propositionallogic
2
answers
3
TIFR2011A12
The action for this problem takes place in an island of Knights and Knaves, where Knights always make true statements and Knaves always make false statements and everybody is either a Knight or a Knave. Two friends A and B lives in a house. The census taker (an outsider) ... B is a Knave. A is a Knave and B is a Knight. Both are Knaves. Both are Knights. No conclusion can be drawn.
commented
Aug 19, 2019
in
Mathematical Logic

547
views
tifr2011
mathematicallogic
logicalreasoning
7
answers
4
GATE2015324
In a room there are only two types of people, namely $\text{Type 1}$ and $\text{Type 2}$. $\text{Type 1}$ people always tell the truth and $\text{Type 2}$ people always lie. You give a fair coin to a person in that room, without knowing which type he is from ... If the person is of $\text{Type 2}$, then the result is tail If the person is of $\text{Type 1}$, then the result is tail
commented
Aug 19, 2019
in
Mathematical Logic

5.5k
views
gate20153
mathematicallogic
difficult
logicalreasoning
4
answers
5
GATE2006IT21
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
commented
Aug 11, 2019
in
Mathematical Logic

4.5k
views
gate2006it
mathematicallogic
normal
firstorderlogic
2
answers
6
Kenneth Rosen Edition 7th Exercise 2.3 Question 69 (Page No. 155)
Find the inverse function of $f(x) = x^3 +1.$
answered
Apr 11, 2019
in
Set Theory & Algebra

51
views
kennethrosen
discretemathematics
settheory&algebra
5
answers
7
GATE201940
Consider the following statements: The smallest element in a maxheap is always at a leaf node The second largest element in a maxheap is always a child of a root node A maxheap can be constructed from a binary search tree in $\theta(n)$ time A binary search tree can be ... time Which of te above statements are TRUE? I, II and III I, II and IV I, III and IV II, III and IV
commented
Feb 9, 2019
in
DS

3k
views
gate2019
datastructures
heap
4
answers
8
GATE2019GA3
Two cars at the same time from the same location and go in the same direction. The speed of the first car is $50$ km/h and the speed of the second car is $60$ km/h. The number of hours it takes for the distance between the two cars to be $20$ km is _____. $1$ $2$ $3$ $6$
answer edited
Feb 8, 2019
in
Numerical Ability

2.5k
views
gate2019
generalaptitude
numericalability
speedtimedistance
3
answers
9
GATE201919
Consider the grammar given below: $S \rightarrow Aa$ $A \rightarrow BD$ $B \rightarrow b \mid \epsilon $ $D \rightarrow d \mid \epsilon $ Let $a,b,d$ and $\$ be indexed as follows:$\begin{array}{llll} \hline a & b & d & \$ \\ \hline ... $)$ , then the answer should be $3210$)
answer edited
Feb 8, 2019
in
Compiler Design

2.7k
views
gate2019
numericalanswers
compilerdesign
parsing
10
answers
10
GATE201921
The value of $3^{51} \text{ mod } 5$ is _____
commented
Feb 7, 2019
in
Combinatory

4.1k
views
gate2019
numericalanswers
permutationandcombination
modulararithmetic
6
answers
11
GATE201913
Compute $\displaystyle \lim_{x \rightarrow 3} \frac{x^481}{2x^25x3}$ $1$ $53/12$ $108/7$ Limit does not exist
answered
Feb 7, 2019
in
Calculus

2k
views
gate2019
engineeringmathematics
calculus
limits
3
answers
12
GATE2006IT2
For the set $N$ of natural numbers and a binary operation $f : N \times N \to N,$ an element $z \in N$ is called an identity for $f,$ if $f (a, z) = a = f(z, a),$ for all $a \in N.$ Which of the following binary operations have an identity? $f (x, y) = x + y  3$ $f (x, y) = \max(x, y)$ $f (x, y) = x^y$ I and II only II and III only I and III only None of these
commented
Jan 29, 2019
in
Set Theory & Algebra

2.4k
views
gate2006it
settheory&algebra
easy
binaryoperation
5
answers
13
GATE200338
Consider the set \(\{a, b, c\}\) with binary operators \(+\) and \(*\) defined as follows: ... $(x, y)$ that satisfy the equations) is $0$ $1$ $2$ $3$
commented
Jan 29, 2019
in
Set Theory & Algebra

2k
views
gate2003
settheory&algebra
normal
binaryoperation
5
answers
14
GATE200784
Suppose that a robot is placed on the Cartesian plane. At each step it is allowed to move either one unit up or one unit right, i.e., if it is at $(i,j)$ then it can move to either $(i + 1, j)$ or $(i,j + 1)$. How many distinct paths are there for the robot to reach the point $(10,10)$ starting from the initial position $(0,0)$? $^{20}\mathrm{C}_{10}$ $2^{20}$ $2^{10}$ None of the above
commented
Jan 28, 2019
in
Combinatory

3.9k
views
gate2007
permutationandcombination
5
answers
15
GATE201045
The following program consists of $3$ concurrent processes and $3$ binary semaphores. The semaphores are initialized as $S0=1, S1=0$ and $S2=0.$ ... $P0$ print '$0$'? At least twice Exactly twice Exactly thrice Exactly once
commented
Jan 19, 2019
in
Operating System

6.9k
views
gate2010
operatingsystem
processsynchronization
normal
3
answers
16
GATE2017251
Consider the set of process with arrival time (in milliseonds), CPU burst time (in millisecods) and priority ($0$ ... The average waiting time (in milli seconds) of all the process using premtive priority scheduling algorithm is ______
commented
Jan 17, 2019
in
Operating System

4.2k
views
gate20172
operatingsystem
processschedule
numericalanswers
4
answers
17
GATE200387
Consider three data items $D1, D2,$ and $D3,$ and the following execution schedule of transactions $T1, T2,$ and $T3.$ In the diagram, $R(D)$ and $W(D)$ denote the actions reading and writing the data item $D$ ... $T2; T1; T3$ The schedule is serializable as $T3; T2; T1$ The schedule is not serializable
commented
Jan 16, 2019
in
Databases

2.7k
views
gate2003
databases
transactions
normal
6
answers
18
GATE200760
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? ... no immediate male subordinates. Names of employees with no immediate female subordinates. Names of employees with a female supervisor.
commented
Jan 14, 2019
in
Databases

8k
views
gate2007
databases
relationalcalculus
normal
2
answers
19
GATE199922a
Consider the set of relations EMP (Employeeno. Deptno, Employeename, Salary) DEPT (Deptno. Deptname, Location) Write an SQL query to: a)Find all employees names who work in departments located at ‘Calcutta’ and whose salary is greater than Rs.50,000. b)Calculate, for each department number, the number of employees with a salary greater than Rs. 1,00,000.
commented
Jan 14, 2019
in
Databases

1.5k
views
gate1999
databases
sql
easy
4
answers
20
GATE2006IT54
The arrival time, priority, and duration of the CPU and I/O bursts for each of three processes $P_1, P_2 $ and $P_3$ ... and $P_3$? $\text{11, 15, 9}$ $\text{10, 15, 9}$ $\text{11, 16, 10}$ $\text{12, 17, 11}$
commented
Jan 13, 2019
in
Operating System

3.2k
views
gate2006it
operatingsystem
processschedule
normal
3
answers
21
GATE20001.23, ISRO201657
Given the relations employee (name, salary, deptno), and department (deptno, deptname,address), Which of the following queries cannot be expressed using the basic relational algebra operations ... Employees whose name is the same as their department name The sum of all employees' salaries All employees of a given department
commented
Jan 10, 2019
in
Databases

4.3k
views
gate2000
databases
relationalalgebra
easy
isro2016
4
answers
22
GATE20012.23
$R(A,B,C,D)$ is a relation. Which of the following does not have a lossless join, dependency preserving $BCNF$ decomposition? $A \rightarrow B, B \rightarrow CD$ $A \rightarrow B, B \rightarrow C, C \rightarrow D$ $ AB \rightarrow C, C \rightarrow AD$ $A \rightarrow BCD$
commented
Jan 9, 2019
in
Databases

11.9k
views
gate2001
databases
databasenormalization
normal
6
answers
23
GATE19992.7, UGCNETJune2014III25
Consider the schema $R=(S,T, U, V)$ and the dependencies $S \rightarrow T, T \rightarrow U, U \rightarrow V$ and $V \rightarrow S$. Let $R = (R1\text{ and } R2)$ be a decomposition such that $R1 \cap R2 \neq \phi$. The decomposition is not in $2NF$ in $2NF$ but not $3NF$ in $3NF$ but not in $2NF$ in both $2NF$ and $3NF$
commented
Jan 9, 2019
in
Databases

7.7k
views
gate1999
databases
databasenormalization
normal
ugcnetjune2014iii
6
answers
24
GATE2014114
Let $P$ be quicksort program to sort numbers in ascending order using the first element as the pivot. Let $t_1$ and $t_2$ be the number of comparisons made by P for the inputs $[1 \ 2 \ 3 \ 4 \ 5]$ and $[4 \ 1 \ 5 \ 3 \ 2]$ respectively. Which one of the following holds? $t_1 = 5$ $t_1 < t_2$ $t_1>t_2$ $t_1 = t_2$
commented
Jan 2, 2019
in
Algorithms

5.8k
views
gate20141
algorithms
sorting
easy
2
answers
25
GATE200322
The unusual $\Theta(n^2)$ implementation of Insertion Sort to sort an array uses linear search to identify the position where an element is to be inserted into the already sorted part of the array. If, instead, we use binary search to identify the position, the worst case running time will remain $\Theta(n^2)$ become $\Theta(n (\log n)^2)$ become $\Theta(n \log n)$ become $\Theta(n)$
commented
Jan 2, 2019
in
Algorithms

4.8k
views
gate2003
algorithms
sorting
timecomplexity
normal
2
answers
26
GATE200576
The following table has two attributes $A$ and $C$ where $A$ is the primary key and $C$ is the foreign key referencing $A$ ... $(5, 2)$ and $(7, 2)$ $(5, 2), (7, 2)$ and $(9, 5)$ $(3, 4), (4, 3)$ and $(6, 4)$
commented
Dec 26, 2018
in
Databases

2.9k
views
gate2005
databases
referentialintegrity
normal
3
answers
27
GATE200575
Let $E_1$ and $E_2$ be two entities in an $E/R$ diagram with simplevalued attributes. $R_1$ and $R_2$ are two relationships between $E_1$ and $E_2$, where $R_1$ is onetomany and $R_2$ is manytomany. $R_1$ and $R_2$ do not have any attributes of their own. What is the minimum number of tables required to represent this situation in the relational model? $2$ $3$ $4$ $5$
commented
Dec 26, 2018
in
Databases

2.6k
views
gate2005
databases
erdiagram
normal
4
answers
28
GATE200442
What does the following algorithm approximate? (Assume $m > 1, \epsilon >0$). x = m; y = 1; While (xy > ϵ) { x = (x+y)/2; y = m/x; } print(x); $\log \, m$ $m^2$ $m^{\frac{1}{2}}$ $m^{\frac{1}{3}}$
commented
Dec 26, 2018
in
Algorithms

4.1k
views
gate2004
algorithms
identifyfunction
normal
12
answers
29
GATE200482
Let $A[1,\ldots,n]$ be an array storing a bit ($1$ or $0$) at each location, and $f(m)$ is a function whose time complexity is $\Theta(m)$. Consider the following program fragment written in a C like language: counter = 0; for (i=1; i<=n; i++) { if a[i] == 1) ... ;} } The complexity of this program fragment is $\Omega(n^2)$ $\Omega (n\log n) \text{ and } O(n^2)$ $\Theta(n)$ $o(n)$
commented
Dec 26, 2018
in
Algorithms

6.6k
views
gate2004
algorithms
timecomplexity
normal
2
answers
30
GATE19961.11
Which of the following is false? $100n \log n=O(\frac{n\log n}{100})$ $\sqrt{\log n} = O(\log\log n)$ If $0 < x < y \text{ then } n^x = O\left(n^y\right)$ $2^n \neq O\left(nk\right)$
commented
Dec 25, 2018
in
Algorithms

4.2k
views
gate1996
algorithms
asymptoticnotations
normal
5
answers
31
GATE200651, ISRO201634
Consider the following recurrence: $ T(n)=2T\left ( \sqrt{n}\right )+1,$ $T(1)=1$ Which one of the following is true? $ T(n)=\Theta (\log\log n)$ $ T(n)=\Theta (\log n)$ $ T(n)=\Theta (\sqrt{n})$ $ T(n)=\Theta (n)$
commented
Dec 23, 2018
in
Algorithms

10k
views
algorithms
recurrence
isro2016
gate2006
0
answers
32
PSU GATE 2019
I missed filling POSOCO form , what are some other PSU form in which we can sit after gate Score and Respective Deadlines …??? P.S. → I know abt IOCL and ONGC dates but other than these MahaRatnas Companies what are dates of Other good one which must not be missed.? (if already answered somewhere plz provide link . Thanks In advance)
commented
Dec 2, 2018
in
Job Queries

209
views
psu
jobqueries
50,737
questions
57,275
answers
198,154
comments
104,819
users