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 str
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by str
4
answers
1
GATE IT 2005 | Question: 26
Traceroute reports a possible route that is taken by packets moving from some host $A$ to some other host $B$. Which of the following options represents the technique used by traceroute to identify these hosts: By progressively querying routers about the next ... in the ascending order of their hop distance from $A$ By locally computing the shortest path from $A$ to $B$
commented
in
Computer Networks
Jan 26
14.3k
views
gateit-2005
computer-networks
icmp
application-layer-protocols
normal
19
answers
2
GATE CSE 2004 | Question: 47
Consider a system with a two-level paging scheme in which a regular memory access takes $150$ $nanoseconds$, and servicing a page fault takes $8$ $milliseconds$. An average instruction takes $100$ nanoseconds of CPU time, and two memory accesses. ... execution time? $\text{645 nanoseconds}$ $\text{1050 nanoseconds}$ $\text{1215 nanoseconds}$ $\text{1230 nanoseconds}$
commented
in
CO and Architecture
Jan 11
63.6k
views
gatecse-2004
co-and-architecture
virtual-memory
normal
2
answers
3
GATE CSE 1994 | Question: 3.2
State True or False with one line explanation Expanding opcode instruction formats are commonly employed in RISC. (Reduced Instruction Set Computers) machines.
commented
in
CO and Architecture
Jan 11
4.7k
views
gate1994
co-and-architecture
machine-instruction
instruction-format
normal
true-false
9
answers
4
GATE IT 2008 | Question: 39
Consider a CPU where all the instructions require $7$ clock cycles to complete execution. There are $140$ instructions in the instruction set. It is found that $125$ control signals are needed to be generated by the control unit. While designing the horizontal ... size of the control word and control address register? $125, 7$ $125, 10$ $135, 9$ $135, 10$
commented
in
CO and Architecture
Jan 10
17.8k
views
gateit-2008
co-and-architecture
microprogramming
normal
17
answers
5
GATE CSE 2004 | Question: 62
A 4-bit carry look ahead adder, which adds two 4-bit numbers, is designed using AND, OR, NOT, NAND, NOR gates only. Assuming that all the inputs are available in both complemented and uncomplemented forms and the delay of each gate is one time ... the carry network has been implemented using two-level AND-OR logic. 4 time units 6 time units 10 time units 12 time units
comment edited
in
Digital Logic
Dec 14, 2023
32.4k
views
gatecse-2004
digital-logic
normal
adder
5
answers
6
GATE CSE 2006 | Question: 64
Consider three processes (process id $0$, $1$, $2$ respectively) with compute time bursts $2$, $4$ and $8$ time units. All processes arrive at time zero. Consider the longest remaining time first (LRTF) scheduling algorithm. In LRTF ties are broken by ... the process with the lowest process id. The average turn around time is: $13$ units $14$ units $15$ units $16$ units
answered
in
Operating System
Nov 9, 2023
24.2k
views
gatecse-2006
operating-system
process-scheduling
normal
10
answers
7
GATE CSE 2009 | Question: 30
Consider a system with $4$ types of resources $R1$ ($3$ units), $R2$ ($2$ units), $R3$ ($3$ units), $R4$ ($2$ units). A non-preemptive resource allocation policy is used. At any given instance, a request is not entertained if it cannot be ... deadlock Only $P1$ and $P2$ will be in deadlock Only $P1$ and $P3$ will be in deadlock All three processes will be in deadlock
commented
in
Operating System
Nov 4, 2023
33.9k
views
gatecse-2009
operating-system
resource-allocation
normal
6
answers
8
GATE CSE 2005 | Question: 7
The time complexity of computing the transitive closure of a binary relation on a set of $n$ elements is known to be: $O(n)$ $O(n \log n)$ $O \left( n^{\frac{3}{2}} \right)$ $O\left(n^3\right)$
commented
in
Set Theory & Algebra
Oct 9, 2023
24.5k
views
gatecse-2005
set-theory&algebra
normal
relations
8
answers
9
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
Oct 7, 2023
19.1k
views
gatecse-2013
graph-theory
normal
graph-connectivity
1
answer
10
How to effectively use exercises in standard textbooks
For discrete mathematics, I am referring to Eric Rosen. After reading a section I can solve most of the exercise questions in a few minutes. But some (which are marked difficult (*) or challenging (**)) take a lot more time. ... in the same isn't sufficient to solve the questions in time. Or, should one ignore them?) Thanks in advance!
commented
in
Study Resources
Oct 3, 2023
228
views
study-resources
query
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:...