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 2-marks
3
votes
1
answer
1
GO Classes Weekly Quiz 4 | Propositional Logic | Question: 8
A very special island, "Smullyan's island", is inhabited only by knights and knaves. Knights always tell the truth, and knaves always lie. You encounter two people, $\text{A}$ and $\text{B. A}$ says " ... , respectively, if they address you in the above way described: Knight, Knight Knight, Knave Knave, Knight Knave, Knave
GO Classes
asked
in
Mathematical Logic
1 day
ago
by
GO Classes
107
views
goclasses2024_wq4
goclasses
mathematical-logic
propositional-logic
2-marks
4
votes
3
answers
2
GO Classes Weekly Quiz 1 | Fundamental Course | Question: 8
Let $k$ be some integer and it is given that $a \equiv b(\bmod n)$ then which of the following(s) is/are ALWAYS true? More than one option can be true. $a \equiv b-3 n(\bmod n)$ $a \equiv b+k(\bmod n)$ $a+k \equiv b+k(\bmod n)$ $a+5 n \equiv b-3 n(\bmod n)$
GO Classes
asked
in
Quantitative Aptitude
Mar 1
by
GO Classes
283
views
goclasses2024_wq1
goclasses
quantitative-aptitude
modular-arithmetic
multiple-selects
2-marks
3
votes
2
answers
3
GO Classes Weekly Quiz 1 | Fundamental Course | Question: 9
Which of the following(s) ALWAYS hold given that $a \equiv b(\bmod n)$ is true for some integers $a, b$ and $n.$ More than one option can be true. $a \bmod n=b \bmod n$ $n \mid(a-b)$ $n \mid a$ $n \mid b$
GO Classes
asked
in
Quantitative Aptitude
Mar 1
by
GO Classes
235
views
goclasses2024_wq1
goclasses
quantitative-aptitude
modular-arithmetic
multiple-selects
2-marks
1
vote
2
answers
4
GO Classes Weekly Quiz 1 | Fundamental Course | Question: 10
Which of the following options is/are TRUE? $43 \equiv-2(\bmod 5)$ $5 \equiv-7(\bmod 3)$ $-10 \equiv-25(\bmod 7)$ $8 \equiv-8(\bmod 5)$
GO Classes
asked
in
Quantitative Aptitude
Mar 1
by
GO Classes
205
views
goclasses2024_wq1
goclasses
quantitative-aptitude
modular-arithmetic
multiple-selects
2-marks
2
votes
1
answer
5
GATE CSE 2023 | Question: 26
Consider the following program: int main() int f1() int f2(int X) int f3() { { { { f1(); return(1); f3(); return(5); f2(2); } if(X==1) } f3(); return f1(); return(0); else } return (X*f2(X-1)); } Which one of the following options represents the activation tree corresponding to the main function?
admin
asked
in
Programming
Feb 15
by
admin
1.1k
views
gatecse-2023
programming
programming-in-c
recursion
2-marks
2
votes
0
answers
6
GATE CSE 2023 | Question: 27
Consider the control flow graph shown. Which one of the following choices correctly lists the set of live variables at the exit point of each basic block? $\text{B1: { }, B2: {a}, B3: {a}, B4: {a}}$ $\text{B1: {i, j}, B2: {a}, B3: {a}, B4: {i}}$ $\text{B1: {a, i, j}, B2: {a, i, j}, B3: {a, i}, B4: {a}}$ $\text{B1: {a, i, j}, B2: {a, j}, B3: {a, j}, B4: {a, i, j}}$
admin
asked
in
Compiler Design
Feb 15
by
admin
1.2k
views
gatecse-2023
compiler-design
live-variable
2-marks
3
votes
1
answer
7
GATE CSE 2023 | Question: 28
Consider the two functions $\textsf{incr}$ and $\textsf{decr}$ shown below. incr(){ decr(){ wait(s); wait(s); X = X+1; X = X-1; signal(s); signal(s); } } There are $5$ threads each invoking $\textsf{incr}$ once, and $3$ threads each ... of the following choices corresponds to the minimum possible values of $\text{V1, V2},$ respectively? $15,7$ $7,7$ $12,7$ $12,8$
admin
asked
in
Operating System
Feb 15
by
admin
1.2k
views
gatecse-2023
operating-system
semaphore
2-marks
4
votes
2
answers
8
GATE CSE 2023 | Question: 29
Consider the context-free grammar $G$ below \[ \begin{array}{l} S \rightarrow a S b \mid X \\ X \rightarrow a X \mid X b \mid a \mid b, \end{array} \] where $S$ and $X$ are non-terminals, and $a$ and $b$ are terminal symbols. The starting non- ... $G$ is $a^{\ast} b^{\ast}(a+b)$ The language generated by $G$ is not a regular language
admin
asked
in
Theory of Computation
Feb 15
by
admin
945
views
gatecse-2023
theory-of-computation
context-free-grammar
2-marks
2
votes
2
answers
9
GATE CSE 2023 | Question: 30
Consider the pushdown automaton $\text{(PDA)}\;P$ below, which runs on the input alphabet $\{a, b\}$, has stack alphabet $\{\perp, A\}$, and has three states $\{s, p, q\}$, with $s$ being the start state. A transition from state $u$ to state $v$ ... $\left.0 \leq n\right\}$ $\left\{a^{m} \mid 0 \leq m\right\} \cup\left\{b^{n} \mid 0 \leq n\right\}$
admin
asked
in
Theory of Computation
Feb 15
by
admin
833
views
gatecse-2023
theory-of-computation
pushdown-automata
2-marks
1
vote
1
answer
10
GATE CSE 2023 | Question: 31
Consider the given $\text{C}$-code and its corresponding assembly code, with a few operands $\text{U1-U4}$ being unknown. Some useful information as well as the semantics of each unique assembly instruction is annotated as inline comments in the code. The memory is byte-addressable. Which one of ... $(3,4,4, \text{L01)}$ $(8,1,1, \text{L02)}$ $(3,1,1, \text{L01)}$
admin
asked
in
CO and Architecture
Feb 15
by
admin
1.0k
views
gatecse-2023
co-and-architecture
assembly-code
2-marks
1
vote
1
answer
11
GATE CSE 2023 | Question: 32
A $4$ kilobyte $\text{(KB)}$ byte-addressable memory is realized using four $1 \mathrm{~KB}$ memory blocks. Two input address lines $\text{(IA4 and IA3)}$ are connected to the chip select $\text{(CS)}$ port of these memory blocks through a decoder as shown in the figure. The ... options is $\text{CORRECT}?$ $(0,1,2,3)$ $(0,1024,2048,3072)$ $(0,8,16,24)$ $(0,0,0,0)$
admin
asked
in
CO and Architecture
Feb 15
by
admin
1.2k
views
gatecse-2023
co-and-architecture
memory-interfacing
2-marks
1
vote
1
answer
12
GATE CSE 2023 | Question: 33
Consider a sequential digital circuit consisting of $\mathrm{T}$ flip-flops and $\mathrm{D}$ flip-flops as shown in the figure. $\text{CLKIN}$ is the clock input to the circuit. At the beginning, $\text{Q1, Q2}$ and $\text{Q3}$ have values $0,1$ and $1,$ respectively. ... $\text{NEVER}$ be obtained with this digital circuit? $(0,0,1)$ $(1,0,0)$ $(1,0,1)$ $(1,1,1)$
admin
asked
in
Digital Logic
Feb 15
by
admin
821
views
gatecse-2023
digital-logic
sequential-circuit
flip-flop
2-marks
2
votes
3
answers
13
GATE CSE 2023 | Question: 34
A Boolean digital circuit is composed using two $4$-input multiplexers $\text{(M1 and M2)}$ and one $2$-input multiplexer $\text{(M3)}$ as shown in the figure. $\text{X0-X7}$ are the inputs of the multiplexers $\text{M1 and M2}$ and could be connected to either $0$ or $1.$ The select lines of the ... $(1,1,0,0,1,1,0,1)$ $(1,1,0,1,1,1,0,0)$ $(0,0,1,1,0,1,1,1)$
admin
asked
in
Digital Logic
Feb 15
by
admin
832
views
gatecse-2023
digital-logic
combinational-circuit
multiplexer
2-marks
2
votes
1
answer
14
GATE CSE 2023 | Question: 35
Consider the $\textsf{IEEE-754}$ single precision floating point numbers $\text{P} = \textsf{0xC1800000}$ and $\text{Q} = \textsf{0x3F5C2EF4}.$ ... $\textsf{IEEE-754}$ single precision format? $\textsf{0x404C2EF4}$ $\textsf{0x405C2EF4}$ $\textsf{0xC15C2EF4}$ $\textsf{0xC14C2EF4}$
admin
asked
in
CO and Architecture
Feb 15
by
admin
873
views
gatecse-2023
co-and-architecture
ieee-representation
2-marks
1
vote
1
answer
15
GATE CSE 2023 | Question: 36
Let $A$ be a priority queue for maintaining a set of elements. Suppose $A$ is implemented using a max-heap data structure. The operation $\text{EXTRACT-MAX} (A)$ extracts and deletes the maximum element from $A$. The operation $\operatorname{INSERT}(A, key )$ inserts a new ... $O(1)$ whereas $\operatorname{INSERT}(A, k e y)$ runs in $O(\log (n))$.
admin
asked
in
DS
Feb 15
by
admin
945
views
gatecse-2023
data-structures
priority-queue
time-complexity
2-marks
1
vote
1
answer
16
GATE CSE 2023 | Question: 37
Consider the $\text{C}$ function $\text{foo}$ and the binary tree shown. typedef struct node { int val; struct node *left, *right; } node; int foo(node *p) { int retval; if (p == NULL) return 0; else { retval = p->val + foo(p->left) + foo(p->right); printf("%d ", ... $3 \;5\; 8\; 10\; 11\; 13$ $3 \;8 \;16 \;13\; 24\; 50$ $3\; 16\; 8\; 50\; 24\; 13$
admin
asked
in
DS
Feb 15
by
admin
858
views
gatecse-2023
data-structures
binary-tree
2-marks
4
votes
0
answers
17
GATE CSE 2023 | Question: 38
Let $U=\{1,2, \ldots, n\},$ where $n$ is a large positive integer greater than $1000.$ Let $k$ be a positive integer less than $n$. Let $A, B$ be subsets of $U$ with $|A|=|B|=k$ and $A \cap B=\emptyset$. We say that a permutation of $U$ separates $A$ from $B$ if ... $2\left(\begin{array}{c}n \\ 2 k\end{array}\right)(n-2 k) !(k !)^{2}$
admin
asked
in
Combinatory
Feb 15
by
admin
928
views
gatecse-2023
combinatory
counting
2-marks
2
votes
1
answer
18
GATE CSE 2023 | Question: 39
Let $f: A \rightarrow B$ be an onto (or surjective) function, where $A$ and $B$ are nonempty sets. Define an equivalence relation $\sim$ on the set $A$ as \[ a_{1} \sim a_{2} \text { if } f\left(a_{1}\right)=f\left(a_{2}\right), \] ... is NOT well-defined. $F$ is an onto (or surjective) function. $F$ is a one-to-one (or injective) function. $F$ is a bijective function.
admin
asked
in
Set Theory & Algebra
Feb 15
by
admin
875
views
gatecse-2023
set-theory&algebra
equivalence-class
multiple-selects
2-marks
1
vote
2
answers
19
GATE CSE 2023 | Question: 40
Suppose you are asked to design a new reliable byte-stream transport protocol like $\text{TCP}.$ This protocol, named $\textsf{myTCP}$, runs over a $100 \mathrm{~Mbps}$ network with Round Trip Time of $150$ ... lengths of the Sequence Number field in the $\textsf{myTCP}$ header? $30$ bits $32$ bits $34$ bits $36$ bits
admin
asked
in
Computer Networks
Feb 15
by
admin
1.2k
views
gatecse-2023
computer-networks
tcp
multiple-selects
2-marks
1
vote
1
answer
20
GATE CSE 2023 | Question: 41
Let $X$ be a set and $2^{X}$ denote the powerset of $X$. Define a binary operation $\Delta$ on $2^{X}$ as follows: \[ A \Delta B=(A-B) \cup(B-A) \text {. } \] Let $H=\left(2^{X}, \Delta\right)$. Which of the following statements about $H$ is/are correct? ... $A \in 2^{X},$ the inverse of $A$ is the complement of $A$. For every $A \in 2^{X},$ the inverse of $A$ is $A$.
admin
asked
in
Set Theory & Algebra
Feb 15
by
admin
1.0k
views
gatecse-2023
set-theory&algebra
group-theory
multiple-selects
2-marks
Page:
1
2
3
4
5
6
...
49
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
BITSHD 2023
My journey from being a MSc student to AIR 239 in GATE CSE 2023 and qualified UGC-NET JRF.
NEEPCO Recruitment 2023
GATE CSE 2023 Results
IIIT Banglore MTech 2023-24
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.7k)
Non GATE
(1.3k)
Others
(2.5k)
Admissions
(653)
Exam Queries
(845)
Tier 1 Placement Questions
(17)
Job Queries
(76)
Projects
(9)
Unknown Category
(866)
Recent questions tagged 2-marks
Recent Blog Comments
Please provide some tips about NET, since I want...
Amazing story to hear
Link added now:...
Sir can you please provide some good resources...
Where can we see the responses of the form filled?