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 abir_banerjee
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by abir_banerjee
2
answers
1
GATE CSE 2001 | Question: 12
Consider a $5-$stage pipeline - IF (Instruction Fetch), ID (Instruction Decode and register read), EX (Execute), MEM (memory), and WB (Write Back). All (memory or register) reads take place in the second phase of a clock cycle ... Show all data dependencies between the four instructions. Identify the data hazards. Can all hazards be avoided by forwarding in this case.
commented
in
CO and Architecture
Feb 1
17.4k
views
gatecse-2001
co-and-architecture
pipelining
normal
descriptive
3
answers
2
GATE CSE 2016 Set 1 | Question: 04
A probability density function on the interval $[a, 1]$ is given by $1/x^{2}$ and outside this interval the value of the function is zero. The value of $a$ is _________.
commented
in
Probability
Jan 13
9.7k
views
gatecse-2016-set1
probability
normal
numerical-answers
continuous-distribution
7
answers
3
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
comment edited
in
Linear Algebra
Jan 11
27.2k
views
gatecse-2018
linear-algebra
matrix
eigen-value
normal
2-marks
3
answers
4
GATE CSE 2005 | Question: 49
What are the eigenvalues of the following $2\times 2$ matrix? $\left( \begin{array}{cc} 2 & -1\\ -4 & 5\end{array}\right)$ $-1$ and $1$ $1$ and $6$ $2$ and $5$ $4$ and $-1$
comment edited
in
Linear Algebra
Jan 9
6.0k
views
gatecse-2005
linear-algebra
eigen-value
easy
9
answers
5
GATE CSE 2001 | Question: 2.1
How many $4$-digit even numbers have all $4$ digits distinct? $2240$ $2296$ $2620$ $4536$
comment edited
in
Combinatory
Sep 20, 2023
12.7k
views
gatecse-2001
combinatory
normal
3
answers
6
GATE2019 EE: GA-4
It takes two hours for a person $X$ to mow the lawn. $Y$ can mow the same lawn in four hours. How long (in minutes) will it take $X$ and $Y,$ if they work together to mow the lawn$?$ $60$ $80$ $90$ $120$
comment edited
in
Quantitative Aptitude
Sep 14, 2023
2.2k
views
gate2019-ee
general-aptitude
quantitative-aptitude
work-time
4
answers
7
GATE CSE 2014 Set 1 | Question: 30
Given the following two statements: S1: Every table with two single-valued attributes is in $\text{1NF, 2NF, 3NF}$ and $\text{BCNF}.$ S2: $AB \to C, D \to E, E \to C$ ... is CORRECT? S1 is TRUE and S2 is FALSE. Both S1 and S2 are TRUE. S1 is FALSE and S2 is TRUE. Both S1 and S2 are FALSE.
commented
in
Databases
Sep 13, 2023
12.2k
views
gatecse-2014-set1
databases
database-normalization
normal
5
answers
8
GATE CSE 2013 | Question: 55
Relation $R$ has eight attributes $\text{ABCDEFGH}$. Fields of $R$ contain only atomic values. $F = \text{{CH $\rightarrow$ G, A $\rightarrow$ BC, B $\rightarrow$ CFH, E $\rightarrow$ A, F $\rightarrow$ EG}}$ is a set of functional dependencies $(FDs)$ ... in $\text{2NF}$, but not in $\text{3NF}$. in $\text{3NF}$, but not in $\text{BCNF}$. in $\text{BCNF}$.
commented
in
Databases
Sep 13, 2023
14.4k
views
gatecse-2013
databases
database-normalization
normal
4
answers
9
GATE CSE 2015 Set 2 | Question: 17
Consider a complete binary tree where the left and right subtrees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is $\Omega(\log n)$ $\Omega(n)$ $\Omega(n \log n)$ $\Omega(n^2)$
commented
in
DS
Sep 9, 2023
16.2k
views
gatecse-2015-set2
data-structures
binary-heap
normal
9
answers
10
GATE CSE 2016 Set 1 | Question: 38
Consider the weighted undirected graph with $4$ vertices, where the weight of edge $\{i,j\}$ is given by the entry $W_{ij}$ in the matrix $W$ ... integer value of $x$, for which at least one shortest path between some pair of vertices will contain the edge with weight $x$ is ___________.
commented
in
DS
Sep 9, 2023
24.0k
views
gatecse-2016-set1
data-structures
graph-theory
normal
numerical-answers
8
answers
11
GATE CSE 2005 | Question: 2
An Abstract Data Type (ADT) is: same as an abstract class a data type that cannot be instantiated a data type for which only the operations defined on it can be used, but none else all of the above
commented
in
DS
Sep 9, 2023
19.4k
views
gatecse-2005
data-structures
normal
abstract-data-type
3
answers
12
GATE CSE 2021 Set 2 | Question: 52
Consider a Boolean function $f(w,x,y,z)$ such that $\begin{array}{lll} f(w,0,0,z) & = & 1 \\ f(1,x,1,z) & =& x+z \\ f(w,1,y,z) & = & wz +y \end{array}$The number of literals in the minimal sum-of-products expression of $f$ is _________
commented
in
Digital Logic
Sep 8, 2023
13.2k
views
gatecse-2021-set2
digital-logic
boolean-algebra
min-sum-of-products-form
numerical-answers
2-marks
10
answers
13
GATE CSE 2016 Set 2 | Question: 08
Let, $x_{1} ⊕ x_{2} ⊕ x_{3} ⊕ x_{4}= 0$ where $x_{1}, x_{2}, x_{3}, x_{4}$ are Boolean variables, and $⊕$ is the XOR operator. Which one of the following must always be TRUE? $x_{1}x_{2}x_{3}x_{4} = 0$ $x_{1}x_{3} + x_{2} = 0$ $\bar{x}_{1} ⊕ \bar{x}_{3} = \bar{x}_{2} ⊕ \bar{x}_{4}$ $x_{1} + x_{2} + x_{3} + x_{4} = 0$
commented
in
Digital Logic
Sep 8, 2023
13.5k
views
gatecse-2016-set2
digital-logic
boolean-algebra
normal
3
answers
14
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 _____
commented
in
DS
Sep 8, 2023
12.0k
views
gatecse-2018
data-structures
binary-tree
numerical-answers
1-mark
3
answers
15
GATE CSE 2012 | Question: 47
The height of a tree is defined as the number of edges on the longest path in the tree. The function shown in the pseudo-code below is invoked as height (root) to compute the height of a binary tree rooted at the tree pointer root. int height(treeptr n) { if(n == NULL) return -1 ... ; B2: $\max(h1, h2) $ B1: $(1+ \text{height}(n \to \text{ right}))$ ; B2: $\max(h1, h2)$
commented
in
DS
Sep 7, 2023
11.0k
views
gatecse-2012
data-structures
binary-tree
normal
4
answers
16
GATE CSE 2020 | Question: 41
In a balanced binary search tree with $n$ elements, what is the worst case time complexity of reporting all elements in range $[a,b]$? Assume that the number of reported elements is $k$. $\Theta (\log n)$ $\Theta (\log n +k)$ $\Theta (k \log n)$ $\Theta ( n \log k)$
commented
in
DS
Sep 7, 2023
21.8k
views
gatecse-2020
data-structures
binary-search-tree
2-marks
3
answers
17
GATE CSE 2012 | Question: 17
Let $G$ be a simple undirected planar graph on $10$ vertices with $15$ edges. If $G$ is a connected graph, then the number of bounded faces in any embedding of $G$ on the plane is equal to $3$ $4$ $5$ $6$
commented
in
Graph Theory
Sep 6, 2023
10.0k
views
gatecse-2012
graph-theory
graph-planarity
normal
2
answers
18
GATE CSE 2011 | Question: 17
K4 and Q3 are graphs with the following structures. Which one of the following statements is TRUE in relation to these graphs? K4 is a planar while Q3 is not Both K4 and Q3 are planar Q3 is planar while K4 is not Neither K4 nor Q3 is planar
commented
in
Graph Theory
Sep 6, 2023
7.0k
views
gatecse-2011
graph-theory
graph-planarity
normal
8
answers
19
GATE CSE 2013 | Question: 26
The line graph $L(G)$ of a simple graph $G$ is defined as follows: There is exactly one vertex $v(e)$ in $L(G)$ for each edge $e$ in $G$. For any two edges $e$ and $e'$ in $G$, $L(G)$ has an edge between $v(e)$ and $v(e')$, if and only if ... planar graph is planar. (S) The line graph of a tree is a tree. $P$ only $P$ and $R$ only $R$ only $P, Q$ and $S$ only
commented
in
Graph Theory
Sep 5, 2023
19.1k
views
gatecse-2013
graph-theory
normal
graph-connectivity
3
answers
20
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$.
commented
in
Graph Theory
Sep 5, 2023
8.1k
views
gatecse-2023
graph-theory
graph-coloring
multiple-selects
2-marks
2
answers
21
GATE Mechanical 2021 Set 2 | GA Question: 9
Consider a square sheet of side $1$ unit. The sheet is first folded along the main diagonal. This is followed by a fold along its line of symmetry. The resulting folded shape is again folded along its line of symmetry. The area of each face of the final folded shape, ... units, equal to _________ $\frac{1}{4}$ $\frac{1}{8}$ $\frac{1}{16}$ $\frac{1}{32}$
comment edited
in
Spatial Aptitude
Sep 2, 2023
2.0k
views
gateme-2021-set2
spatial-aptitude
paper-folding
area
3
answers
22
GATE2016 ME-2: GA-4
Fact: If it rains, then the field is wet. Read the following statements: It rains The field is not wet The field is wet It did not rain Which one of the options given below is NOT logically possible, based on the given fact? If (iii), then (iv). If (i), then (iii). If (i), then (ii). If (ii), then (iv).
commented
in
Analytical Aptitude
Sep 2, 2023
2.7k
views
gate2016-me-2
analytical-aptitude
statements-follow
5
answers
23
GATE CSE 2005 | Question: 27
An organization has a class $B$ network and wishes to form subnets for $64$ departments. The subnet mask would be: $255.255.0.0$ $255.255.64.0$ $255.255.128.0$ $255.255.252.0$
commented
in
Computer Networks
Feb 20, 2023
39.8k
views
gatecse-2005
computer-networks
subnetting
normal
7
answers
24
GATE CSE 2015 Set 1 | Question: 22
Which of the following fields of an IP header is NOT modified by a typical IP router? Check sum Source address Time to Live (TTL) Length
commented
in
Computer Networks
Feb 18, 2023
10.1k
views
gatecse-2015-set1
computer-networks
ip-packet
easy
2
answers
25
GATE CSE 2004 | Question: 16
Which of the following is NOT true with respect to a transparent bridge and a router? Both bridge and router selectively forward data packets A bridge uses IP addresses while a router uses MAC addresses A bridge builds up its routing table by inspecting incoming packets A router can connect between a LAN and a WAN
commented
in
Computer Networks
Feb 17, 2023
10.1k
views
gatecse-2004
computer-networks
routers-bridge-hubs-switches
normal
7
answers
26
GATE CSE 2013 | Question: 37
In an IPv4 datagram, the $M$ bit is $0$, the value of $HLEN$ is $10$, the value of total length is $400$ and the fragment offset value is $300$. The position of the datagram, the sequence numbers of the first and the last bytes of the payload, ... , $2400$ and $2789$ First fragment, $2400$ and $2759$ Last fragment, $2400$ and $2759$ Middle fragment, $300$ and $689$
commented
in
Computer Networks
Feb 17, 2023
29.6k
views
gatecse-2013
computer-networks
ip-addressing
normal
8
answers
27
GATE CSE 2004 | Question: 57
Consider three IP networks $A, B$ and $C$. Host $H_A$ in network $A$ sends messages each containing $180$ $bytes$ of application data to a host $H_C$ in network $C$. The TCP layer prefixes $20$ byte header to the message. This passes through an intermediate network $B$ ... overheads. $325.5$ $\text{Kbps}$ $354.5$ $\text{Kbps}$ $409.6$ $\text{Kbps}$ $512.0$ $\text{Kbps}$
commented
in
Computer Networks
Feb 16, 2023
19.0k
views
gatecse-2004
computer-networks
ip-addressing
tcp
normal
6
answers
28
GATE CSE 2003 | Question: 27
Which of the following assertions is FALSE about the Internet Protocol (IP)? It is possible for a computer to have multiple IP addresses IP packets from the same source to the same destination can take different routes in the network IP ensures that a ... set the route of an outgoing packets; the route is determined only by the routing tables in the routers on the way
comment edited
in
Computer Networks
Feb 16, 2023
16.2k
views
gatecse-2003
computer-networks
ip-addressing
normal
7
answers
29
GATE CSE 1994 | Question: 9
Following $7$ ... that at most $1$ bit could be corrupted). If the message contains an error find the bit which is erroneous and gives correct message.
commented
in
Computer Networks
Feb 16, 2023
8.7k
views
gate1994
computer-networks
error-detection
hamming-code
normal
descriptive
1
answer
30
GATE1987-2-i
Match the pairs in the following questions: $\begin{array}{|l|l|l|} \hline \text {(A) Cyclic Redundancy Code} & \text {(p) Error Correction} \\\hline \text {(B) Serial Communication} & \text{(q) Wired-OR } \\\hline \text{(C) Open Collector} & \text{(r) Error detection} \\\hline \text{(D) Hamming Code} & \text{(s) RS-232-C} \\\hline \end{array}$
commented
in
Computer Networks
Feb 14, 2023
2.9k
views
gate1989
descriptive
computer-networks
error-detection
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:...