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 isro2008
5
votes
7
answers
61
ISRO2008-52
Dynamic address translation is part of the operating system paging algorithm is useless when swapping is used is the hardware necessary to implement paging storage pages at a specific location on disk
ajit
asked
in
Operating System
Sep 20, 2015
by
ajit
5.2k
views
isro2008
operating-system
paging
3
votes
2
answers
62
ISRO2008-53
Thrashing always occurs on large computers is a natural consequence of virtual memory systems can always be avoided by swapping can be caused by poor paging algorithms
ajit
asked
in
Operating System
Sep 20, 2015
by
ajit
3.9k
views
isro2008
operating-system
paging
10
votes
3
answers
63
ISRO2008-62
In which of the following four necessary conditions for deadlock processes claim exclusive control of the resources they require? no preemption mutual exclusion circular wait hold and wait
ajit
asked
in
Operating System
Sep 20, 2015
by
ajit
6.7k
views
isro2008
operating-system
resource-allocation
deadlock-prevention-avoidance-detection
10
votes
4
answers
64
ISRO2008-68
Which of the following class of statement usually produces no executable code when compiled? declaration assignment statements input and output statements structural statements
ajit
asked
in
Compiler Design
Sep 20, 2015
by
ajit
8.1k
views
isro2008
compiler-design
code-optimization
2
votes
5
answers
65
ISRO2008-76
The minimum number of fields with each node of doubly linked list is 1 2 3 4
ajit
asked
in
DS
Sep 20, 2015
by
ajit
19.4k
views
isro2008
data-structures
linked-list
24
votes
2
answers
66
GATE CSE 1996 | Question: 2.20, ISRO2008-15
Four jobs to be executed on a single processor system arrive at time $0$ in the order $A, B, C, D$. Their burst CPU time requirements are $4, 1, 8, 1$ time units respectively. The completion time of $A$ under round robin scheduling with time slice of one time unit is $10$ $4$ $8$ $9$
Kathleen
asked
in
Operating System
Oct 9, 2014
by
Kathleen
10.5k
views
gate1996
operating-system
process-scheduling
normal
isro2008
30
votes
4
answers
67
GATE CSE 1996 | Question: 1.20, ISRO2008-56
Which of the following is an example of spooled device? A line printer used to print the output of a number of jobs A terminal used to enter input data to a running program A secondary storage device in a virtual memory system A graphic display device
Kathleen
asked
in
Operating System
Oct 9, 2014
by
Kathleen
11.0k
views
gate1996
operating-system
io-handling
normal
isro2008
23
votes
1
answer
68
GATE CSE 1996 | Question: 1.19, ISRO2008-61
A critical section is a program segment which should run in a certain amount of time which avoids deadlocks where shared resources are accessed which must be enclosed by a pair of semaphore operations, $P$ and $V$
Kathleen
asked
in
Operating System
Oct 9, 2014
by
Kathleen
5.6k
views
gate1996
operating-system
process-synchronization
easy
isro2008
76
votes
12
answers
69
GATE CSE 1994 | Question: 1.6, ISRO2008-29
The number of distinct simple graphs with up to three nodes is $15$ $10$ $7$ $9$
Kathleen
asked
in
Graph Theory
Oct 4, 2014
by
Kathleen
34.7k
views
gate1994
graph-theory
graph-connectivity
combinatory
normal
isro2008
counting
38
votes
2
answers
70
GATE CSE 1993 | Question: 6.4, ISRO2008-14
Assume that each character code consists of $8$ bits. The number of characters that can be transmitted per second through an asynchronous serial line at $2400$ baud rate, and with two stop bits is $109$ $216$ $218$ $219$
Kathleen
asked
in
Computer Networks
Sep 29, 2014
by
Kathleen
10.8k
views
gate1993
computer-networks
serial-communication
normal
isro2008
out-of-gate-syllabus
34
votes
3
answers
71
GATE CSE 1997 | Question: 3.10, ISRO2008-57, ISRO2015-64
Dirty bit for a page in a page table helps avoid unnecessary writes on a paging device helps maintain LRU information allows only read on a page None of the above
Kathleen
asked
in
Operating System
Sep 29, 2014
by
Kathleen
11.0k
views
gate1997
operating-system
paging
easy
isro2008
isro2015
4
votes
3
answers
72
GATE CSE 1998 | Question: 2.10, ISRO2008-17
The address space of $8086$ CPU is one Megabyte $256$ Kilobytes $1 \;\text{K}$ Megabytes $64$ Kilobytes
Kathleen
asked
in
CO and Architecture
Sep 25, 2014
by
Kathleen
4.5k
views
gate1998
co-and-architecture
microprocessors
out-of-syllabus-now
isro2008
26
votes
3
answers
73
GATE CSE 1998 | Question: 1.25, ISRO2008-41
In a resident – OS computer, which of the following systems must reside in the main memory under all situations? Assembler Linker Loader Compiler
Kathleen
asked
in
Compiler Design
Sep 25, 2014
by
Kathleen
9.3k
views
gate1998
compiler-design
runtime-environment
normal
isro2008
25
votes
2
answers
74
GATE CSE 1998 | Question: 1.21, ISRO2008-16
Which one of the following algorithm design techniques is used in finding all pairs of shortest distances in a graph? Dynamic programming Backtracking Greedy Divide and Conquer
Kathleen
asked
in
Algorithms
Sep 25, 2014
by
Kathleen
9.1k
views
gate1998
algorithms
algorithm-design-technique
easy
isro2008
23
votes
6
answers
75
GATE CSE 1999 | Question: 2-18, ISRO2008-46
Raid configurations of the disks are used to provide Fault-tolerance High speed High data density (A) & (B)
Kathleen
asked
in
Operating System
Sep 23, 2014
by
Kathleen
10.3k
views
gate1999
operating-system
disk
easy
isro2008
28
votes
3
answers
76
GATE CSE 2004 | Question: 31, ISRO2008-40
Consider the following C function: int f(int n) { static int i = 1; if(n >= 5) return n; n = n+i; i++; return f(n); } The value returned by $f(1)$ is: $5$ $6$ $7$ $8$
Kathleen
asked
in
Programming in C
Sep 18, 2014
by
Kathleen
14.3k
views
gatecse-2004
programming
programming-in-c
recursion
easy
isro2008
29
votes
3
answers
77
GATE CSE 2002 | Question: 2.6, ISRO2008-19
The performance of a pipelined processor suffers if: the pipeline stages have different delays consecutive instructions are dependent on each other the pipeline stages share hardware resources All of the above
Kathleen
asked
in
CO and Architecture
Sep 15, 2014
by
Kathleen
11.4k
views
gatecse-2002
co-and-architecture
pipelining
easy
isro2008
39
votes
8
answers
78
GATE CSE 2002 | Question: 1.25, ISRO2008-30, ISRO2016-6
The maximum number of edges in a $n$-node undirected graph without self loops is $n^2$ $\frac{n(n-1)}{2}$ $n-1$ $\frac{(n+1)(n)}{2}$
Kathleen
asked
in
Graph Theory
Sep 15, 2014
by
Kathleen
17.5k
views
gatecse-2002
graph-theory
easy
isro2008
isro2016
graph-connectivity
44
votes
5
answers
79
GATE CSE 2001 | Question: 1.7, ISRO2008-18
More than one word are put in one cache block to: exploit the temporal locality of reference in a program exploit the spatial locality of reference in a program reduce the miss penalty none of the above
Kathleen
asked
in
CO and Architecture
Sep 14, 2014
by
Kathleen
17.0k
views
gatecse-2001
co-and-architecture
easy
cache-memory
isro2008
41
votes
6
answers
80
GATE CSE 2000 | Question: 1.20, ISRO2008-47
Which of the following need not necessarily be saved on a context switch between processes? General purpose registers Translation look-aside buffer Program counter All of the above
Kathleen
asked
in
Operating System
Sep 14, 2014
by
Kathleen
11.9k
views
gatecse-2000
operating-system
easy
isro2008
context-switch
Page:
« prev
1
2
3
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 isro2008
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:...