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 rajankakaniya
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by rajankakaniya
5
answers
1
GATE IT 2004 | Question: 76
A table T1 in a relational database has the following rows and columns: ... set marks = marks + 5 Select avg(marks) from T1 What is the output of the select statement? $18.75$ $20$ $25$ $\text{Null}$
commented
in
Databases
Feb 17
7.5k
views
gateit-2004
databases
sql
normal
3
answers
2
GATE IT 2004 | Question: 78
Consider two tables in a relational database with columns and rows as follows: ... 1 Both i and ii will fail i will fail but ii will succeed i will succeed but ii will fail Both i and ii will succeed
commented
in
Databases
Feb 17
8.4k
views
gateit-2004
databases
sql
normal
7
answers
3
GATE IT 2005 | Question: 69
In an inventory management system implemented at a trading corporation, there are several tables designed to hold all the information. Amongst these, the following two tables hold information on which items are supplied by which suppliers, and which warehouse ... who do not supply any item supply exactly one item supply one or more items supply two or more items
commented
in
Databases
Feb 16
9.6k
views
gateit-2005
databases
sql
normal
5
answers
4
GATE CSE 2005 | Question: 30
Let r be a relation instance with schema R = (A, B, C, D). We define $r_1 = \pi_{A, B, C} (R)$ and $r_2=\pi_{A, D} (r)$. Let $s =r_1 \: * \: r_2$ where $*$ denotes natural join. Given that the decomposition of $r$ into $r_1$ and $r_2$ is lossy, which one of the following is TRUE? $s \subset r$ $r \cup s =r$ $r \subset s$ $r*s=s$
commented
in
Databases
Jan 30
12.4k
views
gatecse-2005
databases
relational-algebra
natural-join
normal
1
answer
5
GATE CSE 2016 Set 2 | Question: 46
A student wrote two context-free grammars G1 and G2 for generating a single C-like array declaration. The dimension of the array is at least one. For example, int a[10] [3]; The grammars use D as the start symbol, and use six ... Which of the grammars correctly generate the declaration mentioned above? Both G1 and G2 Only G1 Only G2 Neither G1 nor G2
commented
in
Compiler Design
Jan 24
6.4k
views
gatecse-2016-set2
compiler-design
grammar
normal
5
answers
6
GATE CSE 2017 Set 2 | Question: 05
Match the following according to input (from the left column) to the compiler phase (in the right column) that processes it: ... $\text{P-iii; Q-iv; R-i; S-ii}$ $\text{P-i; Q-iv; R-ii; S-iii}$
commented
in
Compiler Design
Jan 22
7.4k
views
gatecse-2017-set2
compiler-design
compilation-phases
easy
4
answers
7
GATE CSE 2021 Set 2 | Question: 19
Consider a set-associative cache of size $\text{2KB (1KB} =2^{10}$ bytes$\text{)}$ with cache block size of $64$ bytes. Assume that the cache is byte-addressable and a $32$ -bit address is used for accessing the cache. If the width of the tag field is $22$ bits, the associativity of the cache is _________
commented
in
CO and Architecture
Dec 30, 2021
3.7k
views
gatecse-2021-set2
numerical-answers
co-and-architecture
cache-memory
1-mark
9
answers
8
GATE CSE 2017 Set 2 | Question: 23
$G$ is an undirected graph with $n$ vertices and $25$ edges such that each vertex of $G$ has degree at least $3$. Then the maximum possible value of $n$ is _________ .
commented
in
Graph Theory
Dec 9, 2021
13.4k
views
gatecse-2017-set2
graph-theory
numerical-answers
degree-of-graph
4
answers
9
GATE CSE 2004 | Question: 64
Consider the following program segment for a hypothetical CPU having three user registers $R_1, R_2$ and $R_3.$ ... }\\\hline \end{array} The total number of clock cycles required to execute the program is $29$ $24$ $23$ $20$
commented
in
CO and Architecture
Dec 2, 2021
15.6k
views
gatecse-2004
co-and-architecture
machine-instructions
normal
5
answers
10
GATE CSE 2016 Set 1 | Question: 23
A database of research articles in a journal uses the following schema. $\text{(VOLUME, NUMBER, STARTPAGE, ENDPAGE, TITLE, YEAR, PRICE)}$ The primary key is '$\text{(VOLUME, NUMBER, STARTPAGE, ENDPAGE)}$ and the following functional dependencies exist in the ... database satisfies, but the old one does not? $\text{1NF}$ $\text{2NF}$ $\text{3NF}$ $\text{BCNF}$
commented
in
Databases
Nov 28, 2021
12.2k
views
gatecse-2016-set1
databases
database-normalization
normal
6
answers
11
GATE CSE 2002 | Question: 2.25
From the following instance of a relation schema $R(A,B,C)$ ... functionally determine $C$ $B$ does not functionally determine $C$ $A$ does not functionally determine $B$ and $B$ does not functionally determine $C$
comment edited
in
Databases
Nov 14, 2021
12.3k
views
gatecse-2002
databases
database-normalization
1
answer
12
GATE CSE 1989 | Question: 4-x
A switching function is said to be neutral if the number of input combinations for which its value is $1$ is equal to the number of input combinations for which its value is $0.$ Compute the number of neutral switching functions of $n$ variables (for a given $n$).
commented
in
Digital Logic
Oct 21, 2021
1.5k
views
gate1989
descriptive
digital-logic
boolean-algebra
2
answers
13
#OS process synchronization
What happens if we run the following program? int main() { int sem; sem = screate(1); //Semaphore is created and is initialized to 1 fork (); Wait(sem); printf(―Gate ―); Signal(sem); return 0; } (A) Starvation occurs (B) Deadlock occurs (C) Both processes enter critical section simultaneously (D) ―Gate Gate―will be the output
commented
in
Operating System
Oct 3, 2021
631
views
process-synchronization
1
answer
14
Undefined Behaviour in C
What will be the output of the following code? #include<stdio.h> int main() { int x=10, y; y = (x++) + (++x); printf("%d %d %d %d ", y, x++, x, ++x); } 22,10,11,13 22,11,11,11 12,10,11,13 22 13 13 13
commented
in
Programming
Jul 22, 2021
6.9k
views
programming-in-c
output
undefined-behaviour
non-gate
4
answers
15
GATE CSE 2000 | Question: 1.17, ISRO2015-79
Consider the following C declaration: struct { short x[5]; union { float y; long z; } u; )t; Assume that the objects of the type short, float and long occupy $2$ bytes, $4$ bytes and $8$ bytes, respectively. The memory requirement for variable $t$, ignoring alignment consideration, is: $22$ bytes $14$ bytes $18$ bytes $10$ bytes
comment edited
in
Programming
Jul 22, 2021
16.4k
views
gatecse-2000
programming
programming-in-c
easy
isro2015
union
5
answers
16
GATE CSE 2018 | Question: 21
Consider the following $\text{C}$ program: #include<stdio.h> int counter=0; int calc (int a, int b) { int c; counter++; if(b==3) return (a*a*a); else { c = calc(a, b/3); return (c*c*c); } } int main() { calc(4, 81); printf("%d", counter); } The output of this program is ______.
commented
in
Programming
Jul 21, 2021
7.6k
views
gatecse-2018
programming-in-c
numerical-answers
recursion
programming
1-mark
11
answers
17
GATE CSE 2016 Set 1 | Question: 35
What will be the output of the following $C$ program? void count (int n) { static int d=1; printf ("%d",n); printf ("%d",d); d++; if (n>1) count (n-1); printf ("%d",d); } void main(){ count (3); } $3 \ 1 \ 2 \ 2 \ 1 \ 3 \ 4 \ 4 \ 4$ $3 \ 1 \ 2 \ 1 \ 1 \ 1 \ 2 \ 2 \ 2$ $3 \ 1 \ 2 \ 2 \ 1 \ 3 \ 4$ $3 \ 1 \ 2 \ 1 \ 1 \ 1 \ 2$
commented
in
Programming
Jul 21, 2021
10.8k
views
gatecse-2016-set1
programming-in-c
recursion
normal
4
answers
18
GATE CSE 2015 Set 2 | Question: 15
Consider the following function written in the C programming langauge : void foo(char *a) { if (*a && *a != ' ') { foo(a+1); putchar(*a); } } The output of the above function on input "$ABCD \ EFGH$" is $ABCD \ EFGH$ $ABCD$ $HGFE \ DCBA$ $DCBA$
comment edited
in
Programming
Jul 18, 2021
11.2k
views
gatecse-2015-set2
programming
programming-in-c
normal
4
answers
19
GATE CSE 2012 | Question: 48
Consider the following C code segment. int a, b, c = 0; void prtFun(void); main() { static int a = 1; /* Line 1 */ prtFun(); a += 1; prtFun(); printf( \n %d %d , a, b); } void prtFun(void) { static int a = 2; /* Line 2 */ int b = 1; a += + ... $\begin{array}{lll} 3 & & 1 & \\ 5 & & 2 & \\ 5 & & 2 & \end{array}$
comment edited
in
Programming
Jul 17, 2021
9.9k
views
gatecse-2012
programming
programming-in-c
normal
4
answers
20
GATE CSE 2018 | Question: 29
#include<stdio.h> void fun1(char* s1, char* s2){ char* temp; temp = s1; s1 = s2; s2 = temp; } void fun2(char** s1, char** s2){ char* temp; temp = *s1; *s1 = *s2; *s2 = temp; } int main(){ char *str1="Hi", *str2 = "Bye"; fun1 ... of the program above is: $\text{Hi Bye Bye Hi}$ $\text{Hi Bye Hi Bye}$ $\text{Bye Hi Hi Bye}$ $\text{Bye Hi Bye Hi}$
commented
in
Programming
Jul 13, 2021
10.9k
views
gatecse-2018
programming-in-c
pointers
parameter-passing
normal
programming
2-marks
4
answers
21
GATE CSE 2001 | Question: 2.17 | UGCNET-AUG2016-III: 21
What is printed by the print statements in the program $P1$ assuming call by reference parameter passing? Program P1() { x = 10; y = 3; func1(y,x,x); print x; print y; } func1(x,y,z) { y = y + 4; z = x + y + z } $\text{10, 3}$ $\text{31, 3}$ $\text{27, 7}$ None of the above
comment edited
in
Programming
Jul 12, 2021
8.9k
views
gatecse-2001
programming
compiler-design
parameter-passing
normal
runtime-environment
ugcnetcse-aug2016-paper3
1
answer
22
test series question
(int *) a means the base address of the array a ,(int *) a+1 means the address of 2nd element in the array. or base address of 2nd row of the array ? please clear this doubt i am facing problems in these type of question or if anyone knows basics of these types problems please explain that one. 1, 1, 1, 1 ... , 4 1, 1, 1, 1 2, 4, 2, 4 3, 0, 3, 0 4, 2, 4, 2 5, 5, 5, 5 6, 0, 6, 0
commented
in
Programming
Jul 10, 2021
2.2k
views
array-of-pointers
3
answers
23
TIFR CSE 2010 | Part A | Question: 8
Which of the following is NOT necessarily true? { Notation: The symbol ''$\neg$''notes negation; $P (x, y)$ means that for given $x$ and $y$, the property $P(x, y)$ is true }. $(∀x∀y P(x, y)) \Rightarrow (∀y∀x P(x, y))$ ... $(∃x∀y P(x, y)) \Rightarrow (∀y∃x P(x, y))$ $(∀x∃y P(x, y)) \Rightarrow (∃y∀x P(x, y))$
commented
in
Mathematical Logic
Jul 1, 2021
2.6k
views
tifr2010
mathematical-logic
first-order-logic
2
answers
24
GATE CSE 2013 | Question: 47
Which one of the following is NOT logically equivalent to $¬∃x(∀ y (α)∧∀z(β ))$ ? $∀ x(∃ z(¬β )→∀ y(α))$ $∀x(∀ z(β )→∃ y(¬α))$ $∀x(∀ y(α)→∃z(¬β ))$ $∀x(∃ y(¬α)→∃z(¬β ))$
commented
in
Mathematical Logic
Jun 30, 2021
9.3k
views
mathematical-logic
normal
marks-to-all
gatecse-2013
first-order-logic
1
answer
25
GATE Civil 2021 Set 1 | GA Question: 2
The mirror image of the above text about the $\text{X}$-axis is
commented
in
Spatial Aptitude
Jun 29, 2021
594
views
gatecivil-2021-set1
mirror-image
5
answers
26
GATE CSE 2021 Set 1 | Question: 7
Let $p$ and $q$ be two propositions. Consider the following two formulae in propositional logic. $S_1: (\neg p\wedge(p\vee q))\rightarrow q$ $S_2: q\rightarrow(\neg p\wedge(p\vee q))$ Which one of the following choices is correct? Both $S_1$ and ... but $S_2$ is not a tautology $S_1$ is not a tautology but $S_2$ is a tautology Neither $S_1$ nor $S_2$ is a tautology
commented
in
Mathematical Logic
Jun 28, 2021
3.9k
views
gatecse-2021-set1
mathematical-logic
propositional-logic
1-mark
6
answers
27
GATE CSE 2017 Set 1 | Question: 29
Let $p$, $q$ and $r$ be propositions and the expression $\left ( p\rightarrow q \right )\rightarrow r$ be a contradiction. Then, the expression $\left ( r\rightarrow p \right )\rightarrow q$ is a tautology a contradiction always TRUE when $p$ is FALSE always TRUE when $q$ is TRUE
commented
in
Mathematical Logic
Jun 28, 2021
7.7k
views
gatecse-2017-set1
mathematical-logic
propositional-logic
3
answers
28
GATE CSE 2004 | Question: 70
The following propositional statement is $\left(P \implies \left(Q \vee R\right)\right) \implies \left(\left(P \wedge Q \right)\implies R\right)$ satisfiable but not valid valid a contradiction None of the above
commented
in
Mathematical Logic
Jun 28, 2021
5.5k
views
gatecse-2004
mathematical-logic
normal
propositional-logic
3
answers
29
GATE CSE 2012 | Question: 13
What is the correct translation of the following statement into mathematical logic? “Some real numbers are rational” $\exists x (\text{real}(x) \lor \text{rational}(x))$ $\forall x (\text{real}(x) \to \text{rational}(x))$ $\exists x (\text{real}(x) \wedge \text{rational}(x))$ $\exists x (\text{rational}(x) \to \text{real}(x))$
commented
in
Mathematical Logic
Jun 28, 2021
6.5k
views
gatecse-2012
mathematical-logic
easy
first-order-logic
3
answers
30
GATE CSE 2006 | Question: 27
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
in
Mathematical Logic
Jun 27, 2021
6.1k
views
gatecse-2006
mathematical-logic
normal
propositional-logic
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Life happens, just chill and do hardwork
ISRO RECRUITMENT FOR SCIENTIST B THROUGH GATE
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(648)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(854)
Recent Blog Comments
Please upload 4th Mock Test, due date was 4th Dec.
The counts of answered, marked etc in the exam...
Tests have been sent and all tests will be...
Maximum age limit changed from 35 yrs. to 28...
Hmm, sir totally getting your point ☺️☺️....