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-2023
8
votes
1
answer
31
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, 2023
by
admin
7.0k
views
gatecse-2023
co-and-architecture
assembly-code
2-marks
11
votes
2
answers
32
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, 2023
by
admin
6.1k
views
gatecse-2023
co-and-architecture
memory-interfacing
2-marks
6
votes
1
answer
33
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, 2023
by
admin
8.7k
views
gatecse-2023
digital-logic
sequential-circuit
flip-flop
2-marks
19
votes
3
answers
34
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, 2023
by
admin
9.2k
views
gatecse-2023
digital-logic
combinational-circuit
multiplexer
2-marks
10
votes
2
answers
35
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, 2023
by
admin
10.3k
views
gatecse-2023
co-and-architecture
ieee-representation
2-marks
7
votes
3
answers
36
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, 2023
by
admin
6.1k
views
gatecse-2023
data-structures
priority-queue
time-complexity
heap
2-marks
8
votes
2
answers
37
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, 2023
by
admin
6.6k
views
gatecse-2023
data-structures
binary-tree
2-marks
14
votes
3
answers
38
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, 2023
by
admin
6.3k
views
gatecse-2023
combinatory
counting
2-marks
11
votes
2
answers
39
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, 2023
by
admin
5.7k
views
gatecse-2023
set-theory&algebra
equivalence-class
multiple-selects
2-marks
12
votes
5
answers
40
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, 2023
by
admin
9.6k
views
gatecse-2023
computer-networks
tcp
multiple-selects
2-marks
10
votes
1
answer
41
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, 2023
by
admin
5.5k
views
gatecse-2023
set-theory&algebra
group-theory
multiple-selects
2-marks
13
votes
2
answers
42
GATE CSE 2023 | Question: 42
Suppose in a web browser, you click on the $\textsf{www. gate-2023.in}\; \text{URL}$. The browser cache is empty. The $\text{IP address}$ for this $\text{URL}$ is not cached in your local host, so a $\text{DNS}$ lookup is triggered (by the ... $5$ parallel $\text{TCP}$ connections. $6\; \text{RTT}$s, in case of persistent $\text{HTTP}$ with pipelining.
admin
asked
in
Computer Networks
Feb 15, 2023
by
admin
10.5k
views
gatecse-2023
computer-networks
ip-address
multiple-selects
2-marks
8
votes
4
answers
43
GATE CSE 2023 | Question: 43
Consider a random experiment where two fair coins are tossed. Let $A$ be the event that denotes $\text{HEAD}$ on both the throws, $B$ be the event that denotes $\text{HEAD}$ on the first throw, and $C$ be the event that denotes $\text{HEAD}$ on the ... . $A$ and $C$ are independent. $B$ and $C$ are independent. $\operatorname{Prob}(B \mid C)=\operatorname{Prob}(B)$
admin
asked
in
Probability
Feb 15, 2023
by
admin
6.8k
views
gatecse-2023
probability
independent-events
multiple-selects
2-marks
21
votes
4
answers
44
GATE CSE 2023 | Question: 44
Consider functions $\textsf{Function_1}$ and $\textsf{Function_2}$ ... $f_{1}(n) \in \omega\left(f_{2}(n)\right)$ $f_{1}(n) \in O(n)$
admin
asked
in
Algorithms
Feb 15, 2023
by
admin
11.3k
views
gatecse-2023
algorithms
asymptotic-notation
multiple-selects
2-marks
7
votes
3
answers
45
GATE CSE 2023 | Question: 45
Let $G$ be a simple, finite, undirected graph with vertex set $\left\{v_{1}, \ldots, v_{n}\right\}$. Let $\Delta(G)$ denote the maximum degree of $G$ and let $\mathbb{N}=\{1,2, \ldots\}$ denote the set of all possible colors. Color the vertices ... $\Delta(G)$. The number of colors used is equal to the chromatic number of $G$.
admin
asked
in
Graph Theory
Feb 15, 2023
by
admin
8.1k
views
gatecse-2023
graph-theory
graph-coloring
multiple-selects
2-marks
10
votes
1
answer
46
GATE CSE 2023 | Question: 46
Let $U=\{1,2,3\}$. Let $2^{U}$ denote the powerset of $U$. Consider an undirected graph $G$ whose vertex set is $2^{U}$. For any $A, B \in 2^{U},(A, B)$ is an edge in $G$ if and only if (i) $A \neq B$, and (ii) ... $A$ is denoted by $\mathcal{B}(A)$. If $\emptyset$ denotes the empty set, then the cardinality of $\mathcal{B}(\emptyset)$ is ______________.
admin
asked
in
Algorithms
Feb 15, 2023
by
admin
6.3k
views
gatecse-2023
algorithms
breadth-first-search
numerical-answers
2-marks
21
votes
4
answers
47
GATE CSE 2023 | Question: 47
Consider the following two-dimensional array $\text{D}$ in the $\text{C}$ programming language, which is stored in row-major order: int D[128][128]; Demand paging is used for allocating memory and each physical page frame holds $512$ elements of the ... j++) D[j][i] *= 10; The number of page faults generated during the execution of this code snippet is _______________.
admin
asked
in
Operating System
Feb 15, 2023
by
admin
10.4k
views
gatecse-2023
operating-system
page-replacement
least-recently-used
page-fault
numerical-answers
2-marks
11
votes
2
answers
48
GATE CSE 2023 | Question: 48
Consider a computer system with $57$-bit virtual addressing using multi-level tree-structured page tables with $\mathrm{L}$ levels for virtual to physical address translation. The page size is $4 \mathrm{~KB}(1 \mathrm{~KB}=1024 \mathrm{~B})$ and a page table entry at any of the levels occupies $8$ bytes. The value of $\mathrm{L}$ is ______________.
admin
asked
in
Operating System
Feb 15, 2023
by
admin
11.3k
views
gatecse-2023
operating-system
multilevel-paging
numerical-answers
2-marks
6
votes
3
answers
49
GATE CSE 2023 | Question: 49
Consider a sequence $a$ of elements $a_{0}=1, a_{1}=5, a_{2}=7, a_{3}=8, a_{4}=9$, and $a_{5}=2$. The following operations are performed on a stack $S$ and a queue $Q,$ both of which are initially empty. $\textsf{push}$ the ... $S$. $\textsf{pop}$ an element from $S$. The top element of $S$ after executing the above operations is ______________.
admin
asked
in
DS
Feb 15, 2023
by
admin
6.6k
views
gatecse-2023
data-structures
stack
numerical-answers
2-marks
easy
4
votes
2
answers
50
GATE CSE 2023 | Question: 50
Consider the syntax directed translation given by the following grammar and semantic rules. Here $N, I, F$ and $B$ are non-terminals. $N$ is the starting non-terminal, and $\#, \mathbf{0}$ and $\mathbf{1}$ are lexical tokens ... \] The value computed by the translation scheme for the input string $10\#011$ is ____________. (Rounded off to three decimal places)
admin
asked
in
Compiler Design
Feb 15, 2023
by
admin
6.9k
views
gatecse-2023
compiler-design
syntax-directed-translation
numerical-answers
2-marks
9
votes
2
answers
51
GATE CSE 2023 | Question: 51
Consider the following table named $\text{Student}$ in a relational database. The primary key of this table is $\text{rollNum}.$ $\text{Student}$ ... . SELECT * FROM Student WHERE gender = 'F' AND marks > 65; The number of rows returned by the query is ___________.
admin
asked
in
Databases
Feb 15, 2023
by
admin
7.3k
views
gatecse-2023
databases
sql
numerical-answers
2-marks
easy
13
votes
2
answers
52
GATE CSE 2023 | Question: 52
Consider a database of fixed-length records, stored as an ordered file. The database has $25,000$ records, with each record being $100$ bytes, of which the primary key occupies $15$ bytes. The data file is block-aligned in that each data ... required to identify the block in the data file that may contain a record with the key, in the worst case, is _____________.
admin
asked
in
Databases
Feb 15, 2023
by
admin
11.5k
views
gatecse-2023
databases
file-system
indexing
numerical-answers
2-marks
9
votes
4
answers
53
GATE CSE 2023 | Question: 53
Consider the language $L$ over the alphabet $\{0,1\}$, given below: \[ L=\left\{w \in\{0,1\}^{*} \mid w \text { does not contain three or more consecutive } 1 \text { 's }\right\} . \] The minimum number of states in a Deterministic Finite-State Automaton $\text{(DFA)}$ for $L$ is ____________.
admin
asked
in
Theory of Computation
Feb 15, 2023
by
admin
9.0k
views
gatecse-2023
theory-of-computation
minimal-state-automata
numerical-answers
2-marks
12
votes
4
answers
54
GATE CSE 2023 | Question: 54
An $8$-way set associative cache of size $64 \mathrm{~KB} \;(1 \mathrm{~KB}=1024\; \text{bytes})$ is used in a system with $32$-bit address. The address is sub-divided into $\text{TAG, INDEX},$ and $\text{BLOCK OFFSET.}$ The number of bits in the $\text{TAG}$ is ___________.
admin
asked
in
CO and Architecture
Feb 15, 2023
by
admin
11.1k
views
gatecse-2023
co-and-architecture
cache-memory
numerical-answers
2-marks
8
votes
4
answers
55
GATE CSE 2023 | Question: 55
The forwarding table of a router is shown below. ... to a destination address $200.150 .68 .118$ arrives at the router. It will be forwarded to the interface with $\text{ID}$ __________.
admin
asked
in
Computer Networks
Feb 15, 2023
by
admin
11.8k
views
gatecse-2023
computer-networks
subnetting
numerical-answers
2-marks
4
votes
5
answers
56
GATE CSE 2023 | GA Question: 1
We reached the station late, and _______ missed the train. near nearly utterly mostly
admin
asked
in
Verbal Aptitude
Feb 15, 2023
by
admin
10.8k
views
gatecse-2023
verbal-aptitude
most-appropriate-word
1-mark
4
votes
3
answers
57
GATE CSE 2023 | GA Question: 2
Kind : _______ : : Often : Frequently (By word meaning) Mean Type Cruel Kindly
admin
asked
in
Verbal Aptitude
Feb 15, 2023
by
admin
11.0k
views
gatecse-2023
verbal-aptitude
word-pairs
1-mark
8
votes
1
answer
58
GATE CSE 2023 | GA Question: 3
A series of natural numbers $F_1, F_2, F_3, F_4, F_5, F_6, F_7, \ldots$ obeys $F_{n+1}=F_n+F_{n-1}$ for all integers $n \geq 2$. If $F_6=37,$ and $F_7=60,$ then what is $F_1 ?$ $4$ $5$ $8$ $9$
admin
asked
in
Quantitative Aptitude
Feb 15, 2023
by
admin
8.8k
views
gatecse-2023
quantitative-aptitude
sequence-series
1-mark
7
votes
2
answers
59
GATE CSE 2023 | GA Question: 4
A survey for a certain year found that $90\%$ of pregnant women received medical care at least once before giving birth. Of these women, $60\%$ received medical care from doctors, while $40\%$ received medical care from other healthcare providers. ... at most once from a doctor. Less than half of the pregnant women received medical care at most once from a doctor.
admin
asked
in
Analytical Aptitude
Feb 15, 2023
by
admin
6.3k
views
gatecse-2023
analytical-aptitude
logical-reasoning
1-mark
10
votes
3
answers
60
GATE CSE 2023 | GA Question: 5
Looking at the surface of a smooth $3$-dimensional object from the outside, which one of the following options is $\text{TRUE}?$ The surface of the object must be concave everywhere. The surface of the object must be convex everywhere. The surface of the object may be concave in some places and convex in other places. The object can have edges, but no corners.
admin
asked
in
Spatial Aptitude
Feb 15, 2023
by
admin
10.9k
views
gatecse-2023
spatial-aptitude
three-dimensional-figure
1-mark
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-2023
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:...