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
ISRO 2017 Computer Science Questions with Solution
Recent questions tagged isro2017
1
vote
2
answers
1
isro exam december 2017
The number of elements in the power set of {{1,2},{2,1,1},{2,1,1,2}} is:
snehareddy
asked
in
Set Theory & Algebra
Feb 16, 2018
by
snehareddy
848
views
isro2017
5
votes
2
answers
2
NIELT 2017 Question
Let G be a grammar in CFG and Let W1 and W2 is element of G such that |w1| = |w2| then which of the following is true? A. Any derivation of W1 has exactly the same number of steps as any derivation of W2 B. Different derivation have different length C.Some derivation of W1 may be shorter that derivation of W2 D. None of the options
Durgesh Singh
asked
in
Theory of Computation
Dec 18, 2017
by
Durgesh Singh
2.7k
views
theory-of-computation
isro2017
context-free-language
context-free-grammar
6
votes
3
answers
3
ISRO-2017
Q.A strictly binary tree with 10 leaves A) cannot have more than 19 nodes B) has exactly 19 nodes C)has exactly 17 nodes D) has exactly 20 nodes
junaid ahmad
asked
in
Programming
Dec 17, 2017
by
junaid ahmad
4.9k
views
isro2017
non-gate
3
votes
1
answer
4
ISRO-2017
Consider the code segment int i,j,x,y,m,n; n=20; for(i=0;i<n;i++) { for(j=0;j<n;j++) { if(i%2) { x+=((4*j)+5*i); y+=(7+4*j); } } } m=x+y; Which one of the following is false ? A) The code contains ... B) There is scope of common sub-expression elimination in this code C)There is scope of strength reduction in this code D)There is scope of dead code elimination in this code
junaid ahmad
asked
in
Programming
Dec 17, 2017
by
junaid ahmad
2.1k
views
isro2017
non-gate
0
votes
1
answer
5
ISRO-2017
Let S be an NP-complete problem.Q and R are other two problems not known to be NP.Q is polynomial time reducible to S and S is polynomial time reducible to R.Which of the following statements is true ? A) R is NP-complete B) R is NP-hard C) Q is NP-complete D) Q is NP-hard
junaid ahmad
asked
in
Algorithms
Dec 17, 2017
by
junaid ahmad
1.6k
views
isro2017
non-gate
1
vote
1
answer
6
ISRO-2017
Q.Consider the following query : Select E.no,COUNT(*) FROM Employee E GROUP BY E.no If an index on eno is available,the query can be answered by scanning only the index if A) the index is only hash and clustered B) the index is only B+ tree and clustered C)index can be hash or B+ tree and clustered or non-clustered D)index can be hash or B+ tree and clustered
junaid ahmad
asked
in
Databases
Dec 17, 2017
by
junaid ahmad
2.5k
views
isro2017
databases
indexing
non-gate
10
votes
8
answers
7
ISRO2017-17
Which of the following data structure is useful in traversing a given graph by breadth first search? Stack Queue List None of the above
Arjun
asked
in
Algorithms
May 10, 2017
by
Arjun
11.4k
views
isro2017
data-structures
graph-algorithms
breadth-first-search
easy
9
votes
4
answers
8
ISRO2017-23
What is the minimum number of two-input $\text{NAND}$ gates used to perform the function of two-input $\text{OR}$ gate? One Two Three Four
Arjun
asked
in
Digital Logic
May 10, 2017
by
Arjun
8.0k
views
isro2017
digital-logic
min-no-gates
13
votes
3
answers
9
ISRO2017-80
The time complexity of computing the transitive closure of a binary relation on a set of $n$ elements is known to be a. $O(n\log n)$ b. $O\left( n^{3/2}\right)$ c. $O( n^3 )$ d. $O(n)$
sh!va
asked
in
Algorithms
May 7, 2017
by
sh!va
3.6k
views
isro2017
relations
algorithms
time-complexity
5
votes
2
answers
10
ISRO2017-77
If $L$ and $P$ are two recursively enumerable languages then they are not closed under Kleene star $L^*$ of $L$ Intersection $L \cap P$ Union $L \cup P$ Set difference
sh!va
asked
in
Theory of Computation
May 7, 2017
by
sh!va
5.9k
views
isro2017
set-theory
theory-of-computation
recursive-and-recursively-enumerable-languages
closure-property
3
votes
3
answers
11
ISRO2017-74
Which of these is a super class of all errors and exceptions in the Java language? Runtime Exceptions Throwable Catchable None of the above
sh!va
asked
in
Java
May 7, 2017
by
sh!va
6.0k
views
isro2017
java
7
votes
2
answers
12
ISRO2017-73
Which of the following statement is true? Hard real time OS has less jitter than soft real time OS Hard real time OS has more jitter than soft real time OS Hard real time OS has equal jitter as soft real time OS None of the above
sh!va
asked
in
Operating System
May 7, 2017
by
sh!va
5.6k
views
isro2017
operating-system
realtime-systems
5
votes
1
answer
13
ISRO2017-72
The Linux command mknod myfifo b 4 16 will create a character device if user is root will create a named pipe FIFO if user is root will create a block device if user is root None of these
sh!va
asked
in
Operating System
May 7, 2017
by
sh!va
6.2k
views
isro2017
operating-system
unix
non-gate
5
votes
3
answers
14
ISRO2017-70
We use malloc and calloc for: Dynamic memory allocation Static memory allocation Both dynamic memory allocation and static memory allocation None of these
sh!va
asked
in
Programming
May 7, 2017
by
sh!va
6.0k
views
isro2017
programming-in-c
memory-management
9
votes
3
answers
15
ISRO2017-69
Choose the equivalent prefix form of the following expression (a+(b-c))*((d-e)/(f+g-h)) *+a-bc/-de-+fgh *+a-bc-/de-+fgh *+a-bc/-ed-+fgh *+ab-c/-de-+fgh
sh!va
asked
in
DS
May 7, 2017
by
sh!va
10.6k
views
isro2017
data-structures
infix-prefix
stack
6
votes
4
answers
16
ISRO2017-68
A critical region is a piece of code which only one process executes at a time is a region prone to deadlock is a piece of code which only a finite number of processes execute is found only in windows NT operating system
sh!va
asked
in
Operating System
May 7, 2017
by
sh!va
4.6k
views
isro2017
operating-system
critical-section
process-synchronization
4
votes
2
answers
17
ISRO2017-66
Consider the disk system with 100 cylinders. The request to access the cylinders occur in the following sequence. 4, 37, 10,7,19,73,2,15,6,20 Assuming the head is currently at cylinder 50 what is the time taken to satisfy all requests if it takes 1 ms to move from one cylinder to adjacent one and shortest seek ime first algorithm is used. 95 ms 119 ms 233 ms 276 ms
sh!va
asked
in
Operating System
May 7, 2017
by
sh!va
5.2k
views
isro2017
operating-system
disk-scheduling
6
votes
1
answer
18
ISRO2017-65
Which product metric gives the measure of the average length of words and sentence in documents? SCI number Cyclomatic complexity LOC Fog index
sh!va
asked
in
IS&Software Engineering
May 7, 2017
by
sh!va
4.5k
views
isro2017
is&software-engineering
non-gate
8
votes
4
answers
19
ISRO2017-64
What is the output of the following program? #include<stdio.h> int tmp=20; main() { printf("%d", tmp); func(); printf("%d", tmp); } func() { static int tmp=10; printf("%d", tmp); } 20 10 10 20 10 20 20 20 20 10 10 10
sh!va
asked
in
Programming
May 7, 2017
by
sh!va
4.6k
views
isro2017
programming-in-c
15
votes
1
answer
20
ISRO2017-63
What does the following program do when the input is unsigned 16 bit integer? #include<stdio.h> main(){ unsigned int num; int i; scanf("%u", &num); for(i=0;i<16;i++){ printf("%d", (num<<i&1<<15)?1:0); } } It prints all even bits from num It prints all odd bits from num It prints binary equivalent of num None of above
sh!va
asked
in
Programming
May 7, 2017
by
sh!va
6.2k
views
isro2017
programming-in-c
7
votes
5
answers
21
ISRO2017-62
What will be the output of the following C code? #include <stdio.h> main() { int i; for(i=0;i<5;i++) { int i=10; printf("%d" , i); i++; } return 0; } 10 11 12 13 14 10 10 10 10 10 0 1 2 3 4 Compilation error
sh!va
asked
in
Programming
May 7, 2017
by
sh!va
6.2k
views
isro2017
programming-in-c
4
votes
1
answer
22
ISRO2017-61
In software maintenance tackling the changes in the hardware or software environment where the software works, is Corrective maintenance Perfective maintenance Adaptive maintenance Preventive maintenance
sh!va
asked
in
IS&Software Engineering
May 7, 2017
by
sh!va
4.2k
views
isro2017
is&software-engineering
non-gate
6
votes
1
answer
23
ISRO2017-59
The best data structure to check whether an arithmetic expression has balanced parenthesis is a: Queue Stack Tree List
sh!va
asked
in
DS
May 7, 2017
by
sh!va
16.6k
views
isro2017
data-structures
5
votes
3
answers
24
ISRO2017-58
Which of the following is not a life cycle model? Spiral model Prototyping model Waterfall model Capability maturity model
sh!va
asked
in
IS&Software Engineering
May 7, 2017
by
sh!va
6.4k
views
isro2017
is&software-engineering
non-gate
6
votes
3
answers
25
ISRO2017-56
Mutual exclusion problem occurs between two disjoint processes that do not interact among processes that share resources among processes that do not use the same resource between two processes that uses different resources of different machine
sh!va
asked
in
Operating System
May 7, 2017
by
sh!va
6.2k
views
isro2017
operating-system
process-synchronization
3
votes
2
answers
26
ISRO2017-52
Given reference to the following pages by a program 0,9,0,1,8,1,8,7,8,7,1,2,8,2,7,8,2,3,8,3 How many page faults will occur if the program has three page frames available to it and uses an optimal replacement? 7 8 9 None of the above
sh!va
asked
in
Operating System
May 7, 2017
by
sh!va
4.5k
views
isro2017
operating-system
page-replacement
13
votes
4
answers
27
ISRO2017-51
Wha is the output of the following program? main() { int a = 10; if(fork()) == 0)) a++; printf("%d\n",a); } 10 and 11 10 11 11 and 11
sh!va
asked
in
Operating System
May 7, 2017
by
sh!va
6.5k
views
isro2017
operating-system
fork-system-call
8
votes
3
answers
28
ISRO2017-50
If the post order traversal gives ab -cd * + then the label of the nodes 1,2,3.. will be + , -, *, a,b,c,d a, -,b,+,c,*,d a,b,c,d,-,*,+ -,a,b,+,*,c,d
sh!va
asked
in
DS
May 7, 2017
by
sh!va
5.6k
views
isro2017
data-structures
binary-tree
tree-traversal
8
votes
5
answers
29
ISRO2017-49
The number of swappings needed to sort the numbers 8 , 22, 7, 9, 31, 5, 13 in ascending order using bubble sort is 11 12 13 10
sh!va
asked
in
Algorithms
May 7, 2017
by
sh!va
5.4k
views
isro2017
algorithms
sorting
8
votes
2
answers
30
ISRO2017-48
What problem is solved by Dijikstra banker' algorithm? Mutual exclusion Deadlock recovery Deadlock avoidance Cache coherence
sh!va
asked
in
Operating System
May 7, 2017
by
sh!va
5.0k
views
isro2017
operating-system
deadlock-prevention-avoidance-detection
resource-allocation
Page:
1
2
3
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Delhi Subordinate Services Selection Board
IIT GATE Admission Online Form 2023
All about M.Tech. and Research Admissions at IITP
IIT JAM Admission Online Form 2023
All about M.Tech. and Research Admissions at IITGn
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(8.9k)
Digital Logic
(3.2k)
Programming and DS
(5.7k)
Algorithms
(4.4k)
Theory of Computation
(6.5k)
Compiler Design
(2.2k)
Operating System
(4.8k)
Databases
(4.4k)
CO and Architecture
(3.6k)
Computer Networks
(4.4k)
Non GATE
(1.2k)
Others
(2.3k)
Admissions
(644)
Exam Queries
(836)
Tier 1 Placement Questions
(17)
Job Queries
(72)
Projects
(9)
Unknown Category
(851)
Recent questions tagged isro2017
Recent Blog Comments
The spreadsheet is up to date.
Can somebody give the details of how many topic...
@kabir5454 Anyway you should not be looking for...
General boys be like " Hum kya kare ab parhai...
14 backlogs to top 100