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-2018
50
votes
9
answers
31
GATE CSE 2018 | Question: 35
Consider the following languages: $\{a^mb^nc^pd^q \mid m+p=n+q, \text{ where } m, n, p, q \geq 0 \}$ $\{a^mb^nc^pd^q \mid m=n \text{ and }p=q, \text{ where } m, n, p, q \geq 0 \}$ ... Which of the above languages are context-free? I and IV only I and II only II and III only II and IV only
gatecse
asked
in
Theory of Computation
Feb 14, 2018
by
gatecse
21.2k
views
gatecse-2018
theory-of-computation
identify-class-language
context-free-language
normal
2-marks
44
votes
9
answers
32
GATE CSE 2018 | Question: 34
The size of the physical address space of a processor is $2^P$ bytes. The word length is $2^W$ bytes. The capacity of cache memory is $2^N$ bytes. The size of each cache block is $2^M$ words. For a $K$-way set-associative cache memory, the length (in number of bits) of the tag field is $P-N- \log_2K$ $P-N+ \log_2 K$ $P-N-M-W- \log_2 K$ $P-N-M-W+ \log_2 K$
gatecse
asked
in
CO and Architecture
Feb 14, 2018
by
gatecse
11.8k
views
gatecse-2018
co-and-architecture
cache-memory
normal
2-marks
47
votes
7
answers
33
GATE CSE 2018 | Question: 30
Let $G$ be a simple undirected graph. Let $T_D$ be a depth first search tree of $G$. Let $T_B$ be a breadth first search tree of $G$. Consider the following statements. No edge of $G$ is a cross edge with respect to $T_D$. (A cross edge in $G$ ... $\mid i-j \mid =1$. Which of the statements above must necessarily be true? I only II only Both I and II Neither I nor II
gatecse
asked
in
Algorithms
Feb 14, 2018
by
gatecse
27.2k
views
gatecse-2018
algorithms
graph-algorithm
graph-search
normal
2-marks
22
votes
4
answers
34
GATE CSE 2018 | Question: 33
Consider the unsigned 8-bit fixed point binary number representation, below, $b_7 \: \: b_6 \: \: b_5 \: \: b_4 \: \: b_3 \: \: \cdot b_2 \: \: b_1 \: \: b_0$ where the position of the primary point is between $b_3$ ... represented Only $ii$ cannot be exactly represented Only $iii$ and $iv$ cannot be exactly represented Only $i$ and $ii$ cannot be exactly represented
gatecse
asked
in
Digital Logic
Feb 14, 2018
by
gatecse
9.8k
views
gatecse-2018
digital-logic
number-representation
fixed-point-representation
normal
2-marks
33
votes
5
answers
35
GATE CSE 2018 | Question: 32
Consider the following C code. Assume that unsigned long int type length is $64$ bits. unsigned long int fun(unsigned long int n) { unsigned long int i, j=0, sum = 0; for( i=n; i>1; i=i/2) j++; for( ; j>1; j=j/2) sum++; return sum; } The value returned when we call fun with the input $2^{40}$ is: $4$ $5$ $6$ $40$
gatecse
asked
in
Programming in C
Feb 14, 2018
by
gatecse
16.0k
views
gatecse-2018
programming-in-c
normal
programming
2-marks
30
votes
6
answers
36
GATE CSE 2018 | Question: 31
Assume that multiplying a matrix $G_1$ of dimension $ p \times q$ with another matrix $G_2$ of dimension $q \times r$ requires $pqr$ scalar multiplications. Computing the product of $n$ matrices $G_1G_2G_3 \dots G_n$ can be done by parenthesizing ... the explicitly computed pairs is/are $F_1F_2$ and $F_3F_4$ only $F_2F_3$ only $F_3F_4$ only $F_1F_2$ and $F_4F_5$ only
gatecse
asked
in
Algorithms
Feb 14, 2018
by
gatecse
19.0k
views
gatecse-2018
algorithms
dynamic-programming
2-marks
46
votes
5
answers
37
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}$
gatecse
asked
in
Programming in C
Feb 14, 2018
by
gatecse
15.0k
views
gatecse-2018
programming-in-c
pointers
parameter-passing
normal
programming
2-marks
77
votes
3
answers
38
GATE CSE 2018 | Question: 28
Consider the first-order logic sentence $\varphi \equiv \exists \: s \: \exists \: t \: \exists \: u \: \forall \: v \: \forall \: w \forall \: x \: \forall \: y \: \psi(s, t, u, v, w, x, y)$ ... or equal to $3$ There exists no model of $\varphi$ with universe size of greater than $7$ Every model of $\varphi$ has a universe of size equal to $7$
gatecse
asked
in
Mathematical Logic
Feb 14, 2018
by
gatecse
22.3k
views
gatecse-2018
mathematical-logic
normal
first-order-logic
2-marks
52
votes
6
answers
39
GATE CSE 2018 | Question: 27
Let $N$ be the set of natural numbers. Consider the following sets, $P:$ Set of Rational numbers (positive and negative) $Q:$ Set of functions from $\{0,1\}$ to $N$ $R:$ Set of functions from $N$ to $\{0, 1\}$ $S:$ Set of finite subsets of $N$ Which of the above sets are countable? $Q$ and $S$ only $P$ and $S$ only $P$ and $R$ only $P, Q$ and $S$ only
gatecse
asked
in
Set Theory & Algebra
Feb 14, 2018
by
gatecse
21.8k
views
gatecse-2018
set-theory&algebra
countable-uncountable-set
normal
2-marks
77
votes
7
answers
40
GATE CSE 2018 | Question: 26
Consider a matrix P whose only eigenvectors are the multiples of $\begin{bmatrix} 1 \\ 4 \end{bmatrix}$. Consider the following statements. P does not have an inverse P has a repeated eigenvalue P cannot be diagonalized Which one of the ... III are necessarily true Only II is necessarily true Only I and II are necessarily true Only II and III are necessarily true
gatecse
asked
in
Linear Algebra
Feb 14, 2018
by
gatecse
27.2k
views
gatecse-2018
linear-algebra
matrix
eigen-value
normal
2-marks
32
votes
6
answers
41
GATE CSE 2018 | Question: 25
Consider a long-lived $\text{TCP}$ session with an end-to-end bandwidth of $1\; \text{Gbps}\; (=10^9$ bits-per-second$).$ The session starts with a sequence number of $1234$. The minimum time (in seconds, rounded to the closet integer) before this sequence number can be used again is _________.
gatecse
asked
in
Computer Networks
Feb 14, 2018
by
gatecse
21.3k
views
gatecse-2018
computer-networks
tcp
normal
numerical-answers
1-mark
34
votes
5
answers
42
GATE CSE 2018 | Question: 24
Consider a system with $3$ processes that share $4$ instances of the same resource type. Each process can request a maximum of $K$ instances. Resources can be requested and releases only one at a time. The largest value of $K$ that will always avoid deadlock is ___
gatecse
asked
in
Operating System
Feb 14, 2018
by
gatecse
21.5k
views
gatecse-2018
operating-system
deadlock-prevention-avoidance-detection
easy
numerical-answers
1-mark
46
votes
3
answers
43
GATE CSE 2018 | Question: 23
A $32\text{-bit}$ wide main memory unit with a capacity of $1\;\textsf{GB}$ is built using $256\textsf{M} \times 4\text{-bit}$ DRAM chips. The number of rows of memory cells in the DRAM chip is $2^{14}$. The ... The percentage (rounded to the closest integer) of the time available for performing the memory read/write operations in the main memory unit is _________.
gatecse
asked
in
CO and Architecture
Feb 14, 2018
by
gatecse
25.7k
views
gatecse-2018
co-and-architecture
memory-interfacing
normal
numerical-answers
1-mark
41
votes
9
answers
44
GATE CSE 2018 | Question: 22
Consider the sequential circuit shown in the figure, where both flip-flops used are positive edge-triggered $\text{D}$ flip-flops. The number of states in the state transition diagram of this circuit that have a transition back to the same state on some value of "in" is ____
gatecse
asked
in
Digital Logic
Feb 14, 2018
by
gatecse
23.0k
views
gatecse-2018
digital-logic
flip-flop
numerical-answers
normal
1-mark
23
votes
5
answers
45
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 ______.
gatecse
asked
in
Programming in C
Feb 14, 2018
by
gatecse
10.9k
views
gatecse-2018
programming-in-c
numerical-answers
recursion
programming
1-mark
22
votes
3
answers
46
GATE CSE 2018 | Question: 20
The postorder traversal of a binary tree is $\text{8, 9, 6, 7, 4, 5, 2, 3, 1}$. The inorder traversal of the same tree is ${8, 6, 9, 4, 7, 2, 5, 1, 3}$. The height of a tree is the length of the longest path from the root to any leaf. The height of the binary tree above is _____
gatecse
asked
in
DS
Feb 14, 2018
by
gatecse
12.0k
views
gatecse-2018
data-structures
binary-tree
numerical-answers
1-mark
28
votes
4
answers
47
GATE CSE 2018 | Question: 19
Let $G$ be a finite group on $84$ elements. The size of a largest possible proper subgroup of $G$ is _____
gatecse
asked
in
Set Theory & Algebra
Feb 14, 2018
by
gatecse
12.2k
views
gatecse-2018
group-theory
numerical-answers
set-theory&algebra
1-mark
32
votes
5
answers
48
GATE CSE 2018 | Question: 18
The chromatic number of the following graph is _____
gatecse
asked
in
Graph Theory
Feb 14, 2018
by
gatecse
12.1k
views
graph-theory
graph-coloring
numerical-answers
gatecse-2018
1-mark
23
votes
6
answers
49
GATE CSE 2018 | Question: 17
Consider a matrix $A= uv^T$ where $u=\begin{pmatrix}1 \\ 2 \end{pmatrix} , v = \begin{pmatrix}1 \\1 \end{pmatrix}$. Note that $v^T$ denotes the transpose of $v$. The largest eigenvalue of $A$ is ____
gatecse
asked
in
Linear Algebra
Feb 14, 2018
by
gatecse
10.1k
views
gatecse-2018
linear-algebra
eigen-value
normal
numerical-answers
1-mark
28
votes
4
answers
50
GATE CSE 2018 | Question: 16
The value of $\int^{\pi/4} _0 x \cos(x^2) dx$ correct to three decimal places (assuming that $\pi = 3.14$) is ____
gatecse
asked
in
Calculus
Feb 14, 2018
by
gatecse
16.1k
views
gatecse-2018
calculus
integration
normal
numerical-answers
1-mark
35
votes
8
answers
51
GATE CSE 2018 | Question: 15
Two people, $P$ and $Q$, decide to independently roll two identical dice, each with $6$ faces, numbered $1$ to $6$. The person with the lower number wins. In case of a tie, they roll the dice repeatedly until there is no tie. Define a ... and that all trials are independent. The probability (rounded to $3$ decimal places) that one of them wins on the third trial is ____
gatecse
asked
in
Probability
Feb 14, 2018
by
gatecse
10.9k
views
gatecse-2018
probability
normal
numerical-answers
1-mark
37
votes
9
answers
52
GATE CSE 2018 | Question: 14
Consider the following statements regarding the slow start phase of the TCP congestion control algorithm. Note that cwnd stands for the TCP congestion window and MSS window denotes the Maximum Segments Size: The cwnd increases by $2$ MSS on every successful acknowledgment The cwnd ... true Only $\text{(iv)}$ is true Only $\text{(i)}$ and $\text{(iv)}$ are true
gatecse
asked
in
Computer Networks
Feb 14, 2018
by
gatecse
23.0k
views
gatecse-2018
computer-networks
tcp
congestion-control
normal
1-mark
23
votes
5
answers
53
GATE CSE 2018 | Question: 13
Match the following: ... $\text{P-IV, Q-I, R-II, S-III}$ $\text{P-IV, Q-I, R-III, S-II}$
gatecse
asked
in
Computer Networks
Feb 14, 2018
by
gatecse
10.3k
views
gatecse-2018
computer-networks
network-layering
normal
1-mark
20
votes
5
answers
54
GATE CSE 2018 | Question: 12
Consider the following two tables and four queries in SQL. Book (isbn, bname), Stock(isbn, copies) Query 1: SELECT B.isbn, S.copies FROM Book B INNER JOIN Stock S ON B.isbn=S.isbn; Query 2: SELECT B.isbn, S.copies FROM Book B LEFT OUTER JOIN ... is certain to have an output that is a superset of the outputs of the other three queries? Query 1 Query 2 Query 3 Query 4
gatecse
asked
in
Databases
Feb 14, 2018
by
gatecse
10.1k
views
gatecse-2018
databases
sql
easy
1-mark
43
votes
5
answers
55
GATE CSE 2018 | Question: 11
In an Entity-Relationship (ER) model, suppose $R$ is a many-to-one relationship from entity set E1 to entity set E2. Assume that E1 and E2 participate totally in $R$ and that the cardinality of E1 is greater than the cardinality of E2. Which ... Every entity in E2 is associated with exactly one entity in E1 Every entity in E2 is associated with at most one entity in E1
gatecse
asked
in
Databases
Feb 14, 2018
by
gatecse
27.7k
views
gatecse-2018
databases
er-diagram
normal
1-mark
22
votes
3
answers
56
GATE CSE 2018 | Question: 10
Consider a process executing on an operating system that uses demand paging. The average time for a memory access in the system is $M$ units if the corresponding memory page is available in memory, and $D$ units if the memory access causes a page fault. It has been experimentally measured that the average ... $(X-M) / D-M)$ $(D-X) / D-M)$ $(X-M) / D-X)$
gatecse
asked
in
Operating System
Feb 14, 2018
by
gatecse
10.4k
views
gatecse-2018
operating-system
virtual-memory
normal
1-mark
23
votes
4
answers
57
GATE CSE 2018 | Question: 9
The following are some events that occur after a device controller issues an interrupt while process $L$ is under execution. P. The processor pushes the process status of $L$ onto the control stack Q. The processor finishes the execution of the ... based on the interrupt Which of the following is the correct order in which the events above occur? QPTRS PTRSQ TRPQS QTPRS
gatecse
asked
in
Operating System
Feb 14, 2018
by
gatecse
10.4k
views
gatecse-2018
operating-system
interrupts
normal
1-mark
28
votes
3
answers
58
GATE CSE 2018 | Question: 8
Which one of the following statements is FALSE? Context-free grammar can be used to specify both lexical and syntax rules Type checking is done before parsing High-level language programs can be translated to different Intermediate Representations Arguments to a function can be passed using the program stack
gatecse
asked
in
Compiler Design
Feb 14, 2018
by
gatecse
11.6k
views
gatecse-2018
compiler-design
easy
compilation-phases
1-mark
27
votes
6
answers
59
GATE CSE 2018 | Question: 7
The set of all recursively enumerable languages is: closed under complementation closed under intersection a subset of the set of all recursive languages an uncountable set
gatecse
asked
in
Theory of Computation
Feb 14, 2018
by
gatecse
11.4k
views
gatecse-2018
theory-of-computation
closure-property
easy
1-mark
24
votes
2
answers
60
GATE CSE 2018 | Question: 6
Let $N$ be an NFA with $n$ states. Let $k$ be the number of states of a minimal DFA which is equivalent to $N$. Which one of the following is necessarily true? $k \geq 2^n$ $k \geq n$ $k \leq n^2$ $k \leq 2^n$
gatecse
asked
in
Theory of Computation
Feb 14, 2018
by
gatecse
10.3k
views
gatecse-2018
theory-of-computation
minimal-state-automata
normal
1-mark
Page:
« prev
1
2
3
4
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-2018
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:...