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 Sherrinford03
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Sherrinford03
3
answers
1
GATE CSE 2021 Set 1 | Question: 26
Consider the following grammar (that admits a series of declarations, followed by expressions) and the associated syntax directed translation $\text{(SDT)}$ ... used to type-check syntactically correct boolean variable declarations and boolean expressions. The actions will lead to an infinite loop
commented
in
Compiler Design
Mar 2, 2021
10.5k
views
gatecse-2021-set1
compiler-design
syntax-directed-translation
2-marks
5
answers
2
GATE CSE 2021 Set 1 | Question: 43
A relation $R$ is said to be circular if $a\text{R}b$ and $b\text{R}c$ together imply $c\text{R}a$. Which of the following options is/are correct? If a relation $S$ is reflexive and symmetric, then $S$ is an equivalence relation ... and circular, then $S$ is an equivalence relation. If a relation $S$ is transitive and circular, then $S$ is an equivalence relation.
commented
in
Set Theory & Algebra
Mar 1, 2021
8.1k
views
gatecse-2021-set1
multiple-selects
set-theory&algebra
relations
2-marks
3
answers
3
GATE CSE 2021 Set 1 | Question: 19
There are $6$ jobs with distinct difficulty levels, and $3$ computers with distinct processing speeds. Each job is assigned to a computer such that: The fastest computer gets the toughest job and the slowest computer gets the easiest job. Every computer gets at least one job. The number of ways in which this can be done is ___________.
commented
in
Combinatory
Feb 23, 2021
11.7k
views
gatecse-2021-set1
combinatory
counting
numerical-answers
1-mark
2
answers
4
GATE CSE 2021 Set 1 | Question: 41
An $articulation$ $point$ in a connected graph is a vertex such that removing the vertex and its incident edges disconnects the graph into two or more connected components. Let $T$ be a $\text{DFS}$ tree obtained by doing $\text{DFS}$ ... is a descendent of $u$ in $T$, then all paths from $x$ to $y$ in $G$ must pass through $u$.
answer edited
in
DS
Feb 21, 2021
13.9k
views
gatecse-2021-set1
multiple-selects
data-structures
tree
2-marks
3
answers
5
GATE CSE 2021 Set 1 | Question: 44
A $\text{TCP}$ server application is programmed to listen on port number $P$ on host $S$. A $\text{TCP}$ client is connected to the $\text{TCP}$ server over the network. Consider that while the $\text{TCP}$ connection was active, the ... receive a $\text{RST}$ segment If the client sends a packet after the server reboot, it will receive a $\text{FIN}$ segment
answer edited
in
Computer Networks
Feb 21, 2021
12.9k
views
gatecse-2021-set1
multiple-selects
computer-networks
tcp
2-marks
3
answers
6
GATE CSE 2021 Set 1 | Question: 40
Define $R_n$ to be the maximum amount earned by cutting a rod of length $n$ meters into one or more pieces of integer length and selling them. For $i>0$, let $p[i]$ denote the selling price of a rod whose length is $i$ meters. ... $R_7=18$ $R_7=19$ $R_7$ is achieved by three different solutions $R_7$ cannot be achieved by a solution consisting of three pieces
commented
in
Algorithms
Feb 19, 2021
8.2k
views
gatecse-2021-set1
multiple-selects
algorithms
algorithm-design
2-marks
5
answers
7
GATE CSE 2021 Set 1 | Question: 39
For a Turing machine $M$, $\langle M \rangle$ denotes an encoding of $M$ ... decidable $L_1$ is decidable and $L_2$ is undecidable $L_1$ is undecidable and $L_2$ is decidable Both $L_1$ and $L_2$ are undecidable
answered
in
Theory of Computation
Feb 19, 2021
9.8k
views
gatecse-2021-set1
theory-of-computation
recursive-and-recursively-enumerable-languages
decidability
easy
2-marks
5
answers
8
GATE CSE 2021 Set 1 | Question: 33
Consider the relation $R(P,Q,S,T,X,Y,Z,W)$ with the following functional dependencies. $PQ\rightarrow X;\quad P\rightarrow YX;\quad Q\rightarrow Y; \quad Y\rightarrow ZW$ Consider the decomposition of the relation $R$ into the ... $D_2$ is a lossless decomposition Both $D_1$ and $D_2$ are lossless decompositions Both $D_1$ and $D_2$ are lossy decompositions
answered
in
Databases
Feb 19, 2021
13.1k
views
gatecse-2021-set1
databases
database-normalization
2-marks
4
answers
9
GATE CSE 2021 Set 1 | Question: 14
Which of the following standard $C$ library functions will always invoke a system call when executed from a single-threaded process in a $\text{UNIX/Linux}$ operating system? $\textsf{exit}$ $\textsf{malloc}$ $\textsf{sleep}$ $\textsf{strlen}$
answered
in
Operating System
Feb 19, 2021
10.6k
views
gatecse-2021-set1
multiple-selects
operating-system
system-call
1-mark
3
answers
10
GATE CSE 2021 Set 1 | Question: 4
Consider the following statements. $S_1:$ The sequence of procedure calls corresponds to a preorder traversal of the activation tree. $S_2:$ The sequence of procedure returns corresponds to a postorder traversal of the activation tree. Which one of the following options is ... and $S_2$ is true $S_1$ is true and $S_2$ is true $S_1$ is false and $S_2$ is false
answered
in
Compiler Design
Feb 19, 2021
6.5k
views
gatecse-2021-set1
runtime-environment
normal
1-mark
1
answer
11
Testbook Test Series: Programming & DS - Hashing
How to solve such kind of questions ? Can anybody tell what's is the concept behind this ?? someone provide me link so that I read it and understand the actual concept
answered
in
DS
Aug 9, 2020
503
views
testbook-test-series
data-structures
hashing
1
answer
12
MadeEasy Test Series: Programming & DS - Hashing
Consider the hashing table with m' slots and n' keys. If the expected number of probes in an unsuccessful search is 3, the expected number of probes in successful search is _____(Up to 2 decimals) Ans. 1.647 Here by default ... given here in the table http://cs360.cs.ua.edu/notes/hashing_formulas.pdf With linear hashing, I am getting around 1.61
answered
in
Programming in C
Aug 9, 2020
931
views
made-easy-test-series
data-structures
hashing
1
answer
13
MadeEasy Test Series 2019: Programming & DS - Hashing
Consider the hashing table with 'm' slots and 'n' keys. If the expected number of probes in unsuccessful search is 3. The expected number of probes in a successful search is_ Answer 1.647
answered
in
DS
Aug 9, 2020
1.4k
views
programming-in-c
data-structures
hashing
made-easy-test-series
2
answers
14
MadeEasy Test Series: Algorithms - Huffman Code
Alice needs to send a large message to Bob using only five words. Seeing that the message is too long she decides to compress the message using Huffman coding algorithm. If the respective frequencies of words are given in the table, what ... be the hamming code for w3 w1 w2 that she was supposed to use? a 100011011 b 100011101 c 100001101 d 111011000
commented
in
Algorithms
Aug 9, 2020
1.1k
views
made-easy-test-series
algorithms
huffman-code
1
answer
15
Made easy test GATE 2019 MOCK 1 Question 53
IF the above network uses class C network 192.203.16.0; Then find the DBA used for Dept Y
answered
in
Computer Networks
Jul 21, 2020
340
views
2
answers
16
monotonically increasing grammar
Which of the following is not a monotonically increasing grammar? (A) Context-sensitive grammar (B) Unrestricted grammar (C) Regular grammar (D) Context-free grammar
answered
in
Theory of Computation
Jul 21, 2020
1.9k
views
bad-question
2
answers
17
NIELIT 2016 MAR Scientist B - Section B: 5
The greatest and the least value of $f(x)=x^4-8x^3+22x^2-24x+1$ in $[0,2]$ are $0,8$ $0,-8$ $1,8$ $1,-8$
answered
in
Calculus
Jun 26, 2020
656
views
nielit2016mar-scientistb
engineering-mathematics
calculus
maxima-minima
1
answer
18
NIELIT 2016 MAR Scientist B - Section B: 14
The minimum value of $\mid x^2-5x+2\mid$ is $-5$ $0$ $-1$ $-2$
answered
in
Calculus
Jun 26, 2020
564
views
nielit2016mar-scientistb
engineering-mathematics
calculus
maxima-minima
1
answer
19
Test by Bikram | Digital Logic | Test 2 | Question: 2
The inputs of a NAND gate are connected together. The resulting circuit is ______. an OR gate an AND gate a NOT gate None of the above
commented
in
Digital Logic
May 20, 2020
413
views
tbb-digital-logic-2
4
answers
20
GATE CSE 2006 | Question: 75
Consider two cache organizations. First one is $32$ $kB$ $2$-way set associative with $32$ $byte$ block size, the second is of same size but direct mapped. The size of an address is $32$ $bits$ in both cases . A $2$-to-$1$ multiplexer has latency of $0.6 ns$ while a $k-$ ... of direct mapped is $h_2$. The value of $h_2$ is: $2.4$ $ns$ $2.3$ $ns$ $1.8$ $ns$ $1.7$ $ns$
commented
in
CO and Architecture
Oct 13, 2019
11.4k
views
gatecse-2006
co-and-architecture
cache-memory
normal
5
answers
21
GATE CSE 2010 | Question: 51
Consider a complete undirected graph with vertex set $\{0, 1, 2, 3, 4\}$. Entry $W_{ij}$ in the matrix $W$ below is the weight of the edge $\{i, j\}$ ... weight of a path $P$ from vertex $1$ to vertex $2$ in this graph such that $P$ contains at most $3$ edges? $7$ $8$ $9$ $10$
commented
in
Algorithms
Sep 6, 2019
14.8k
views
gatecse-2010
normal
algorithms
spanning-tree
3
answers
22
Test by Bikram | Operating Systems | Test 2 | Question: 6
A system that uses a two-level page table has $2^{12}$ – byte pages and $32$ – bit virtual addresses. The first $8$ – bits of the address serve as the index into the first level page table. The number of bits specify the second level index is ________
commented
in
Operating System
Sep 2, 2019
1.1k
views
tbb-os-2
numerical-answers
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 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:...