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 Shaik Masthan
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Shaik Masthan
3
votes
1
GATE CSE 2022 | Question: 42
Which of the properties hold for the adjacency matrix $A$ of a simple undirected unweighted graph having $n$ vertices? The diagonal entries of $A^{2}$ ... . If there is at least a $1$ in each of $A\text{'s}$ rows and columns, then the graph must be connected.
answered
in
Graph Theory
Feb 16
1.9k
views
gatecse-2022
graph-theory
graph-connectivity
multiple-selects
5
votes
2
GATE CSE 2022 | Question: 40
The following simple undirected graph is referred to as the Peterson graph. Which of the following statements is/are $\text{TRUE}?$ The chromatic number of the graph is $3.$ The graph has a Hamiltonian path. The following graph is isomorphic to the Peterson ... $3.$ (A subset of vertices of a graph form an independent set if no two vertices of the subset are adjacent.)
answered
in
Graph Theory
Feb 15
2.2k
views
gatecse-2022
graph-theory
graph-isomorphism
multiple-selects
3
votes
3
GATE CSE 2022 | Question: 30
Consider a digital display system $\text{(DDS)}$ shown in the figure that displays the contents of register $\text{X}.$ A $16 - \text{bit}$ code word is used to load a word in $\text{X},$ either from $\text{S}$ or from $\text{R}.$ $\text{S}$ is a $1024-$ ... $1:10$ de-multiplexer$; \quad \; \;\text{Q}$ is $1:5$ de-multiplexer$; \quad \text{T}$ is $2:1$ multiplexer
answered
in
Digital Logic
Feb 15
1.2k
views
gatecse-2022
digital-logic
combinational-circuit
3
votes
4
GATE CSE 2022 | Question: 44
Consider a system with $2 \;\text{KB}$ direct mapped data cache with a block size of $64 \; \text{bytes}.$ The system has a physical address space of $64 \; \text{KB}$ and a word length of $16 \; \text{bits.}$ During the execution of a program, four data ... only $\text{R}$ and $\text{S}$ reside in the cache. Every access to $\text{R}$ evicts $\text{Q}$ from the cache.
answered
in
CO and Architecture
Feb 15
2.1k
views
gatecse-2022
co-and-architecture
direct-mapping
multiple-selects
2
votes
5
GATE CSE 2022 | Question: 36
Which of the following is/are undecidable? Given two Turing machines $\textit{M}_{1}$ and $\textit{M}_{2},$ decide if $\textit{L(M}_{1}) = \textit{L(M}_{2}).$ Given a Turing machine $\textit{M},$ decide if $\textit{L(M)}$ is ... $\textit{M},$ decide if $\textit{M}$ takes more than $1073$ steps on every string.
answered
in
Theory of Computation
Feb 15
2.2k
views
gatecse-2022
theory-of-computation
turing-machine
decidability
multiple-selects
7
votes
6
GATE CSE 2022 | Question: 34
What is printed by the following $\text{ANSI C}$ program? #include<stdio.h> int main(int argc, char *argv[]) { char a = P'; char b = x'; char c = (a&b) + *'; char d = (a|b) - -'; char e = (a^b) + +'; printf( %c %c %c\n , c, d, e); return 0; } ... $\text{z K S}$ $122 \; 75 \; 83$ $ * \; - \; + $ $\text{P x +}$
answered
in
Programming
Feb 15
2.5k
views
gatecse-2022
programming
programming-in-c
output
7
votes
7
GATE CSE 2022 | Question: 11
What is printed by the following $\text{ANSI C}$ program? #include<stdio.h> int main(int argc, char *argv[]) { int x = 1, z[2] = {10, 11}; int *p = NULL; p = &x; *p = 10; p = &z[1]; *(&z[0] + 1) += 3; printf(“%d, %d, %d\n”, x, z[0], z[1]); return 0; } $1, 10, 11$ $1, 10, 14$ $10, 14, 11$ $10, 10, 14$
answered
in
Programming
Feb 15
1.5k
views
gatecse-2022
programming
programming-in-c
pointers
output
3
votes
8
GATE CSE 2022 | Question: 54
Consider a demand paging system with four page frames (initially empty) and $\text{LRU}$ page replacement policy. For the following page reference string $7, 2, 7, 3, 2, 5, 3, 4, 6, 7, 7, 1, 5, 6, 1$ the page fault rate, defined as the ratio of number of page faults to the number of memory accesses $\textit{(rounded off to one decimal place)}$ is _____________.
answered
in
Operating System
Feb 15
2.4k
views
gatecse-2022
numerical-answers
operating-system
page-replacement
demand-paging
2
votes
9
GATE CSE 2022 | Question: 9
Consider the following threads, $\text{T}_{1}, \text{T}_{2},$ and $\text{T}_{3}$ executing on a single processor, synchronized using three binary semaphore variables, $\text{S}_{1}, \text{S}_{2},$ and $\text{S}_{3},$ operated upon using standard $\textsf{wait}()$ ... $\text{S}_{1} = 0; \text{S}_{2} = 1; \text{S}_{3} = 1$
answered
in
Operating System
Feb 15
3.6k
views
gatecse-2022
operating-system
process-synchronization
semaphore
5
votes
10
GATE CSE 2022 | Question: 17
Which of the following statements is/are $\text{TRUE}$ for a group $\textit{G}?$ If for all $x,y \in \textit{G}, \; (xy)^{2} = x^{2} y^{2},$ then $\textit{G}$ is commutative. If for all $x \in \textit{G}, \; x^{2} = 1,$ then ... $2,$ then $\textit{G}$ is commutative. If $\textit{G}$ is commutative, then a subgroup of $\textit{G}$ need not be commutative.
answered
in
Set Theory & Algebra
Feb 15
2.0k
views
gatecse-2022
set-theory&algebra
group-theory
multiple-selects
2
votes
11
GATE CSE 2022 | Question: 55
Consider the following grammar along with translation rules. $S \rightarrow S_{1} \# T \qquad \{S._{\text{val}} =S_{1}. _{\text{val}} \; ^{\ast} T._{\text{val}}\}$ $S \rightarrow T \qquad \qquad \{S._{\text{val}} = T._{\text{val}}\}$ ... value of $S._{\text{val}}$ for root of the parse tree for the expression $20 \# 10 \% 5 \# 8 \% 2 \% 2$ is ________________.
answered
in
Compiler Design
Feb 15
1.4k
views
gatecse-2022
numerical-answers
compiler-design
syntax-directed-translation
6
votes
12
GATE CSE 2022 | Question: 51
A processor $\text{X}_{1}$ operating at $2 \; \text{GHz}$ has a standard $5-$stage $\text{RISC}$ instruction pipeline having a base $\text{CPI (cycles per instruction)}$ of one without any pipeline hazards. For a given program $\text{P}$ ... $\text{X}_{2}$ over $\text{X}_{1}$ in executing $\text{P}$ is _______________.
answered
in
CO and Architecture
Feb 15
2.4k
views
gatecse-2022
numerical-answers
co-and-architecture
pipelining
stall
1
vote
13
GATE CSE 2022 | Question: 46
Consider the relational database with the following four schemas and their respective instances. Student(sNo, sName, dNo) Dept(dNo, dName) Course(cNo, cName, dNo) Register(sNo, cNo) ... SELECT cNo FROM Register WHERE sNo = S.sNo) The number of rows returned by the above $\text{SQL}$ query is ____________.
answered
in
Databases
Feb 15
2.5k
views
gatecse-2022
numerical-answers
databases
sql
7
votes
14
GATE CSE 2022 | Question: 4
In a relational data model, which one of the following statements is $\text{TRUE}?$ A relation with only two attributes is always in $\text{BCNF}.$ If all attributes of a relation are prime attributes, then the relation is in $\text{BCNF}.$ Every relation has at least one non-prime attribute. $\text{BCNF}$ decompositions preserve functional dependencies.
answered
in
Databases
Feb 15
2.0k
views
gatecse-2022
databases
database-normalization
5
votes
15
GATE CSE 2022 | Question: 33
What is printed by the following $\text{ANSI C}$ program? #include<stdio.h> int main (int argc, char *argv[]) { int a[3][3][3] = {{1, 2, 3, 4, 5, 6, 7, 8, 9}, {10, 11, 12, 13, 14, 15, 16, 17, 18}, {19, 20, 21, 22, 23, 24, 25, 26, 27}} ... $\begin {array}{} 1 & 2 & 3 \\ 13 & 14 & 15 \\ 25 & 26 & 27 \end{array}$
answered
in
Programming
Feb 15
1.9k
views
gatecse-2022
programming
programming-in-c
array
output
12
votes
16
GATE CSE 2022 | Question: 32
Consider four processes $\text{P, Q, R,}$ and $\text{S}$ scheduled on a $\text{CPU}$ as per round robin algorithm with a time quantum of $4\text{ units.}$ The processes arrive in the order $\text{P, Q, R, S,}$ all at time $\text{t = 0}.$ ... $\text{P = 4, Q = 12, R = 5, S = 4}$ $\text{P = 3, Q = 7, R = 7, S = 3}$
answered
in
Operating System
Feb 15
3.4k
views
gatecse-2022
operating-system
process-scheduling
round-robin-scheduling
1
vote
17
GATE CSE 2022 | Question: 31
Consider three floating point numbers $\textit{A, B}$ and $\textit{C}$ stored in registers $\text{R}_{\text{A}}, \text{R}_{\text{B}}$ and $\text{R}_{\text{C}},$ respectively as per $\textsf{IEEE-754}$ single precision floating point format. The $\text{32-bit}$ content stored in ... $\textit{A + C} = 0$ $\textit{C = A + B}$ $\textit{B =3C}$ $\textit{(B - C)} > 0$
answered
in
Digital Logic
Feb 15
1.8k
views
gatecse-2022
digital-logic
number-system
number-representation
6
votes
18
GATE CSE 2022 | Question: 22
The number of arrangements of six identical balls in three identical bins is _____________ .
answered
in
Combinatory
Feb 15
2.4k
views
gatecse-2022
numerical-answers
combinatory
balls-in-bins
5
votes
19
GATE CSE 2022 | Question: 29
Let $\textit{R}_{i}(z)$ and $\textit{W}_{i}(z)$ denote read and write operations on a data element $z$ by a transaction $\textit{T}_{i},$ respectively. Consider the schedule $\textit{S}$ ... $T_{4} \rightarrow T_{1} \rightarrow T_{3} \rightarrow T_{2}$ $T_{3} \rightarrow T_{1} \rightarrow T_{4} \rightarrow T_{2}$
answered
in
Databases
Feb 15
1.6k
views
gatecse-2022
databases
transaction-and-concurrency
conflict-serializable
8
votes
20
GATE CSE 2022 | Question: 21
Consider a relation $R (A, B, C, D, E)$ with the following three functional dependencies. $AB \rightarrow C; \; BC \rightarrow D; \; C \rightarrow E;$ The number of superkeys in the relation $R$ is ______________ .
answered
in
Databases
Feb 15
1.2k
views
gatecse-2022
numerical-answers
databases
database-normalization
2
votes
21
GATE CSE 1990 | Question: 12b
Consider the following problem. Given $n$ positive integers $a_{1}, a_{2}\dots a_n,$ it is required to partition them in to two parts $A$ and $B$ ... that part whose sum in smaller at that step. Give an example with $n=5$ for which the solution produced by the greedy algorithm is not optimal.
answered
in
Algorithms
Oct 27, 2021
1.7k
views
gate1990
descriptive
algorithms
algorithm-design-techniques
0
votes
22
can someone share the approach for the following que
14.Show that the grammar S → aSb |SS| e is ambiguous, but that the language denoted by it is not. Can someone share the approach for second part.
answered
in
Theory of Computation
Oct 11, 2021
152
views
context-free-language
context-free-grammar
ambiguous
3
votes
23
GATE CSE 2021 Set 1 | Question: 46
Consider the following pseudocode, where $\textsf{S}$ is a semaphore initialized to $5$ in line $\#2$ and $\textsf{counter}$ is a shared variable initialized to $0$ in line $\#1$. Assume that the increment operation in line $\#7$ ... is $0$ after all the threads successfully complete the execution of $\textsf{parop}$ There is a deadlock involving all the threads
answered
in
Operating System
Feb 19, 2021
7.6k
views
gatecse-2021-set1
multiple-selects
operating-system
process-synchronization
semaphore
7
votes
24
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
answered
in
Mathematical Logic
Feb 19, 2021
3.8k
views
gatecse-2021-set1
mathematical-logic
propositional-logic
2
votes
25
GATE CSE 2021 Set 2 | Question: 53
Consider a pipelined processor with $5$ stages, $\text{Instruction Fetch} (\textsf{IF})$, $\text{Instruction Decode} \textsf{(ID)}$, $\text{Execute } \textsf{(EX)}$, $\text{Memory Access } \textsf{(MEM)}$ ... $\textit{Speedup} $ achieved in executing the given instruction sequence on the pipelined processor (rounded to $2$ decimal places) is _____________
answered
in
CO and Architecture
Feb 19, 2021
6.9k
views
gatecse-2021-set2
co-and-architecture
pipelining
instruction-execution
numerical-answers
8
votes
26
GATE CSE 2021 Set 2 | Question: 50
Let $S$ be a set of consisting of $10$ elements. The number of tuples of the form $(A,B)$ such that $A$ and $B$ are subsets of $S$, and $A \subseteq B$ is ___________
answered
in
Combinatory
Feb 19, 2021
5.8k
views
gatecse-2021-set2
combinatory
counting
numerical-answers
7
votes
27
GATE CSE 2021 Set 2 | Question: 32
Let $S$ be the following schedule of operations of three transactions $T_1$, $T_2$ and $T_3$ in a relational database system: $R_2(Y), R_1(X), R_3(Z), R_1(Y)W_1(X), R_2(Z), W_2(Y), R_3(X), W_3(Z)$ Consider the statements $P$ and $Q$ below: $P$ ... Both $P$ and $Q$ are true $P$ is true and $Q$ is false $P$ is false and $Q$ is true Both $P$ and $Q$ are false
answered
in
Databases
Feb 19, 2021
3.4k
views
gatecse-2021-set2
databases
transaction-and-concurrency
conflict-serializable
8
votes
28
GATE CSE 2021 Set 2 | Question: 31
The relation scheme given below is used to store information about the employees of a company, where $\textsf{empId}$ is the key and $\textsf{deptId}$ indicates the department to which the employee is assigned. Each employee ... average salary of employees in the department employees in the company female employees in the department female employees in the company
answered
in
Databases
Feb 19, 2021
2.5k
views
gatecse-2021-set2
databases
sql
easy
12
votes
29
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 _________
answered
in
CO and Architecture
Feb 19, 2021
3.6k
views
gatecse-2021-set2
numerical-answers
co-and-architecture
cache-memory
10
votes
30
GATE CSE 2021 Set 2 | Question: 16
Consider a complete binary tree with $7$ nodes. Let $A$ denote the set of first $3$ elements obtained by performing Breadth-First Search $\text{(BFS)}$ starting from the root. Let $B$ denote the set of first $3$ elements obtained by performing Depth-First Search $\text{(DFS)}$ starting from the root. The value of $\mid A-B \mid $ is _____________
answered
in
DS
Feb 19, 2021
6.4k
views
gatecse-2021-set2
numerical-answers
data-structures
binary-tree
Page:
1
2
3
4
5
6
...
15
next »
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
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
RECRUITMENT IN OIL AND GAS CORPORATION LIMITED
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
(647)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(855)
Recent Blog Comments
@abir_banerjee Thanks Abir. I'm third year...
@nolan_keats Currently I am in third year...
@abir_banerjee thank you Abir.Supposing you...
@nolan_keats just a suggestion as I also...
@abir_banerjee Hope I can do this in span of one...