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
Recent questions tagged gatecse-2017-set1
46
votes
5
answers
31
GATE CSE 2017 Set 1 | Question: 40
Recall that Belady's anomaly is that the page-fault rate may increase as the number of allocated frames increases. Now, consider the following statements: $S_1$: Random page replacement algorithm (where a page chosen at random is replaced) suffers from Belady's ... is true, $S_2$ is false $S_1$ is false, $S_2$ is true $S_1$ is false, $S_2$ is false
Arjun
asked
in
Operating System
Feb 14, 2017
by
Arjun
15.1k
views
gatecse-2017-set1
page-replacement
operating-system
normal
86
votes
4
answers
32
GATE CSE 2017 Set 1 | Question: 39
Let $A$ and $B$ be finite alphabets and let $\#$ be a symbol outside both $A$ and $B$. Let $f$ be a total function from $A^{*}$ to $B^{*}$. We say $f$ is computable if there exists a Turing machine $M$ which given an ... $L_{f}$ is recursive, but not conversely. If $f$ is computable then $L_{f}$ is recursively enumerable, but not conversely.
Arjun
asked
in
Theory of Computation
Feb 14, 2017
by
Arjun
18.4k
views
gatecse-2017-set1
theory-of-computation
decidability
difficult
41
votes
6
answers
33
GATE CSE 2017 Set 1 | Question: 38
Consider the following languages over the alphabet $\Sigma = \left \{ a, b, c \right \}$. Let $L_{1} = \left \{ a^{n}b^{n}c^{m}\mid m,n \geq 0 \right \}$ and $L_{2} = \left \{ a^{m}b^{n}c^{n}\mid m,n \geq 0 \right \}$. Which of the following are context-free languages? $L_{1} \cup L_{2}$ $L_{1} \cap L_{2}$ I only II only I and II Neither I nor II
Arjun
asked
in
Theory of Computation
Feb 14, 2017
by
Arjun
13.6k
views
gatecse-2017-set1
theory-of-computation
context-free-language
normal
48
votes
8
answers
34
GATE CSE 2017 Set 1 | Question: 37
Consider the context-free grammars over the alphabet $\left \{ a, b, c \right \}$ given below. $S$ and $T$ are non-terminals. $G_{1}:S\rightarrow aSb \mid T, T \rightarrow cT \mid \epsilon$ ... is Finite Not finite but regular Context-Free but not regular Recursive but not context-free
Arjun
asked
in
Theory of Computation
Feb 14, 2017
by
Arjun
12.1k
views
gatecse-2017-set1
theory-of-computation
context-free-language
identify-class-language
normal
103
votes
7
answers
35
GATE CSE 2017 Set 1 | Question: 36
Consider the C functions foo and bar given below: int foo(int val) { int x=0; while(val > 0) { x = x + foo(val--); } return val; } int bar(int val) { int x = 0; while(val > 0) { x ... in: Return of $6$ and $6$ respectively. Infinite loop and abnormal termination respectively. Abnormal termination and infinite loop respectively. Both terminating abnormally.
Arjun
asked
in
Programming in C
Feb 14, 2017
by
Arjun
25.2k
views
gatecse-2017-set1
programming-in-c
programming
normal
recursion
47
votes
11
answers
36
GATE CSE 2017 Set 1 | Question: 35
Consider the following two functions. void fun1(int n) { if(n == 0) return; printf("%d", n); fun2(n - 2); printf("%d", n); } void fun2(int n) { if(n == 0) return; printf("%d", n); ... printf("%d", n); } The output printed when $\text{fun1}(5)$ is called is $53423122233445$ $53423120112233$ $53423122132435$ $53423120213243$
Arjun
asked
in
Programming in C
Feb 14, 2017
by
Arjun
20.2k
views
gatecse-2017-set1
programming
normal
tricky
recursion
44
votes
6
answers
37
GATE CSE 2017 Set 1 | Question: 34
If $G$ is a grammar with productions $S\rightarrow SaS\mid aSb\mid bSa\mid SS\mid\epsilon$ where $S$ is the start variable, then which one of the following strings is not generated by $G$? $abab$ $aaab$ $abbaa$ $babba$
Arjun
asked
in
Theory of Computation
Feb 14, 2017
by
Arjun
11.5k
views
gatecse-2017-set1
theory-of-computation
context-free-language
normal
29
votes
7
answers
38
GATE CSE 2017 Set 1 | Question: 33
Consider a combination of $\text{T}$ and $\text{D}$ flip-flops connected as shown below. The output of the $\text{D}$ flip-flop is connected to the input of the $\text{T}$ flip-flop and the output of the $\text{T}$ flip-flop is connected to the input of ... $3^{\text{rd}}$ cycle are $01$ and after the $4^{\text{th}}$ cycle are $01$ respectively.
Arjun
asked
in
Digital Logic
Feb 14, 2017
by
Arjun
14.6k
views
gatecse-2017-set1
digital-logic
flip-flop
normal
34
votes
3
answers
39
GATE CSE 2017 Set 1 | Question: 32
A computer network uses polynomials over $GF(2)$ for error checking with $8$ bits as information bits and uses $x^{3}+x+1$ as the generator polynomial to generate the check bits. In this network, the message $01011011$ is transmitted as: $01011011010$ $01011011011$ $01011011101$ $01011011100$
Arjun
asked
in
Computer Networks
Feb 14, 2017
by
Arjun
11.6k
views
gatecse-2017-set1
computer-networks
crc-polynomial
normal
83
votes
6
answers
40
GATE CSE 2017 Set 1 | Question: 31
Let $A$ be $n\times n$ real valued square symmetric matrix of rank $2$ with $\sum_{i=1}^{n}\sum_{j=1}^{n}A^{2}_{ij} = 50.$ Consider the following statements. One eigenvalue must be in $\left [ -5,5 \right ]$ The eigenvalue ... than $5$ Which of the above statements about eigenvalues of $A$ is/are necessarily CORRECT? Both I and II I only II only Neither I nor II
Arjun
asked
in
Linear Algebra
Feb 14, 2017
by
Arjun
44.4k
views
gatecse-2017-set1
linear-algebra
eigen-value
normal
30
votes
5
answers
41
GATE CSE 2017 Set 1 | Question: 30
Let $u$ and $v$ be two vectors in $\mathbf{R}^{2}$ whose Euclidean norms satisfy $\left \| u \right \| = 2\left \| v \right \|$. What is the value of $\alpha$ such that $w = u + \alpha v$ bisects the angle between $u$ and $v$? $2$ $\frac{1}{2}$ $1$ $\frac{ -1}{2}$
Arjun
asked
in
Linear Algebra
Feb 14, 2017
by
Arjun
14.0k
views
gatecse-2017-set1
linear-algebra
normal
vector-space
48
votes
10
answers
42
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
Arjun
asked
in
Mathematical Logic
Feb 14, 2017
by
Arjun
10.5k
views
gatecse-2017-set1
mathematical-logic
propositional-logic
22
votes
4
answers
43
GATE CSE 2017 Set 1 | Question: 28
The value of $\displaystyle \lim_{x\rightarrow 1} \frac{x^{7}-2x^{5}+1}{x^{3}-3x^{2}+2}$ is $0$ is $-1$ is $1$ does not exist
Arjun
asked
in
Calculus
Feb 14, 2017
by
Arjun
6.0k
views
gatecse-2017-set1
calculus
limits
normal
122
votes
7
answers
44
GATE CSE 2017 Set 1 | Question: 27
A multithreaded program $P$ executes with $x$ number of threads and uses $y$ number of locks for ensuring mutual exclusion while operating on shared memory locations. All locks in the program are non-reentrant, i.e., if a thread holds a lock $l$, then it cannot re-acquire lock $l$ without releasing ... $x = 1, y = 2$ $x = 2, y = 1$ $x = 2, y = 2$ $x = 1, y = 1$
Arjun
asked
in
Operating System
Feb 14, 2017
by
Arjun
33.2k
views
gatecse-2017-set1
operating-system
process-synchronization
normal
45
votes
5
answers
45
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
Arjun
asked
in
Algorithms
Feb 14, 2017
by
Arjun
12.3k
views
gatecse-2017-set1
algorithms
graph-algorithms
normal
102
votes
9
answers
46
GATE CSE 2017 Set 1 | Question: 25
Consider a two-level cache hierarchy with $L1$ and $L2$ caches. An application incurs $1.4$ memory accesses per instruction on average. For this application, the miss rate of $L1$ cache is $0.1$; the $L2$ cache experiences, on average, $7$ misses per $1000$ instructions. The miss rate of $L2$ expressed correct to two decimal places is ________.
Arjun
asked
in
CO and Architecture
Feb 14, 2017
by
Arjun
24.2k
views
gatecse-2017-set1
co-and-architecture
cache-memory
numerical-answers
24
votes
3
answers
47
GATE CSE 2017 Set 1 | Question: 24
Consider the following CPU processes with arrival times (in milliseconds) and length of CPU bursts (in milliseconds) as given below: ... first scheduling algorithm is used to schedule the processes, then the average waiting time across all processes is _____________ milliseconds.
Arjun
asked
in
Operating System
Feb 14, 2017
by
Arjun
8.5k
views
gatecse-2017-set1
operating-system
process-scheduling
numerical-answers
48
votes
2
answers
48
GATE CSE 2017 Set 1 | Question: 23
Consider a database that has the relation schema EMP (EmpId, EmpName, and DeptName). An instance of the schema EMP and a SQL query on it are given below: ... SELECT DeptName, COUNT(EmpId) AS EC(DeptName, Num) FROM EMP GROUP BY DeptName) The output of executing the SQL query is _____________ .
Arjun
asked
in
Databases
Feb 14, 2017
by
Arjun
13.5k
views
gatecse-2017-set1
databases
sql
numerical-answers
54
votes
15
answers
49
GATE CSE 2017 Set 1 | Question: 22
Consider the language $L$ given by the regular expression $(a+b)^{*} b (a+b)$ over the alphabet $\{a,b\}$. The smallest number of states needed in a deterministic finite-state automaton (DFA) accepting $L$ is ___________ .
Arjun
asked
in
Theory of Computation
Feb 14, 2017
by
Arjun
29.1k
views
gatecse-2017-set1
theory-of-computation
finite-automata
numerical-answers
minimal-state-automata
45
votes
4
answers
50
GATE CSE 2017 Set 1 | Question: 21
Consider the Karnaugh map given below, where $X$ represents "don't care" and blank represents $0$. Assume for all inputs $\left ( a,b,c,d \right )$ ... . The above logic is implemented using $2$-input $\text{NOR}$ gates only. The minimum number of gates required is ____________ .
Arjun
asked
in
Digital Logic
Feb 14, 2017
by
Arjun
14.1k
views
gatecse-2017-set1
digital-logic
k-map
numerical-answers
normal
38
votes
7
answers
51
GATE CSE 2017 Set 1 | Question: 20
Let $T$ be a tree with $10$ vertices. The sum of the degrees of all the vertices in $T$ is ________
Arjun
asked
in
DS
Feb 14, 2017
by
Arjun
18.7k
views
gatecse-2017-set1
data-structures
tree
easy
numerical-answers
48
votes
5
answers
52
GATE CSE 2017 Set 1 | Question: 19
Let $X$ be a Gaussian random variable with mean 0 and variance $\sigma ^{2}$. Let $Y$ = $\max\left ( X,0 \right )$ where $\max\left ( a,b \right )$ is the maximum of $a$ and $b$. The median of $Y$ is ______________ .
Arjun
asked
in
Probability
Feb 14, 2017
by
Arjun
20.5k
views
gatecse-2017-set1
probability
numerical-answers
normal-distribution
48
votes
7
answers
53
GATE CSE 2017 Set 1 | Question: 18
Threads of a process share global variables but not heap heap but not global variables neither global variables nor heap both heap and global variables
Arjun
asked
in
Operating System
Feb 14, 2017
by
Arjun
16.8k
views
gatecse-2017-set1
operating-system
threads
20
votes
7
answers
54
GATE CSE 2017 Set 1 | Question: 17
Consider the following grammar: $P\rightarrow xQRS$ $Q\rightarrow yz\mid z$ $R\rightarrow w\mid \varepsilon$ $S\rightarrow y$ What is FOLLOW($Q$)? $\left \{ R \right \}$ $\left \{ w \right \}$ $\left \{ w,y \right \}$ $\left \{ w,\$ \right \}$
Arjun
asked
in
Compiler Design
Feb 14, 2017
by
Arjun
6.7k
views
gatecse-2017-set1
compiler-design
parsing
easy
63
votes
2
answers
55
GATE CSE 2017 Set 1 | Question: 16
The following functional dependencies hold true for the relational schema $R\left \{V,W,X,Y,Z \right \}$: V $\rightarrow$ W VW $\rightarrow$ X Y $\rightarrow$ VX Y $\rightarrow$ Z Which of the following is irreducible equivalent for this set of functional ... $\rightarrow$ Z V $\rightarrow$ W W $\rightarrow$ X Y $\rightarrow$ V Y $\rightarrow$ X Y $\rightarrow$ Z
Arjun
asked
in
Databases
Feb 14, 2017
by
Arjun
13.1k
views
gatecse-2017-set1
databases
database-normalization
normal
39
votes
3
answers
56
GATE CSE 2017 Set 1 | Question: 15
A sender $S$ sends a message $m$ to receiver $R$, which is digitally signed by $S$ with its private key. In this scenario, one or more of the following security violations can take place. $S$ ... with a fraudulent message Which of the following are possible security violations? I and II only I only II only II and III only
Arjun
asked
in
Computer Networks
Feb 14, 2017
by
Arjun
12.5k
views
gatecse-2017-set1
computer-networks
cryptography
normal
network-security
out-of-gate-syllabus
86
votes
7
answers
57
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.
Arjun
asked
in
Programming in C
Feb 14, 2017
by
Arjun
35.2k
views
gatecse-2017-set1
programming-in-c
programming
pointers
36
votes
4
answers
58
GATE CSE 2017 Set 1 | Question: 12
Consider the following intermediate program in three address code p = a - b q = p * c p = u * v q = p + q Which one of the following corresponds to a static single assignment form of the above code? p1 = a - b q1 = p1 * c p1 = u * v q1 = p1 + q1 p3 = a - b q4 = p3 * c p4 = ... = a - b q1 = p2 * c p3 = u * v q2 = p4 + q3 p1 = a - b q1 = p * c p2 = u * v q2 = p + q
Arjun
asked
in
Compiler Design
Feb 14, 2017
by
Arjun
11.5k
views
gatecse-2017-set1
compiler-design
intermediate-code
normal
static-single-assignment
49
votes
3
answers
59
GATE CSE 2017 Set 1 | Question: 11
Consider the $C$ struct defined below: struct data { int marks [100]; char grade; int cnumber; }; struct data student; The base address of student is available in register $R1$. The field student.grade can be accessed efficiently using: Post-increment ... mode, $X(R1)$, where $X$ is an offset represented in $2's$ complement $16\text{-bit}$ representation
Arjun
asked
in
CO and Architecture
Feb 14, 2017
by
Arjun
14.4k
views
gatecse-2017-set1
co-and-architecture
addressing-modes
74
votes
8
answers
60
GATE CSE 2017 Set 1 | Question: 10
Consider the following context-free grammar over the alphabet $\Sigma = \{a,b,c\}$ with $S$ as the start symbol:$S \rightarrow abScT \mid abcT$$T \rightarrow bT \mid b$ ... $\{\left ( ab \right )^{n}\left ( cb^{n} \right )^{m} \mid m,n \geq 1 \}$
Arjun
asked
in
Theory of Computation
Feb 14, 2017
by
Arjun
21.6k
views
gatecse-2017-set1
theory-of-computation
context-free-language
normal
Page:
« prev
1
2
3
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 questions tagged gatecse-2017-set1
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:...