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 isro2018
0
votes
2
answers
31
ISRO2018-29
DU-chains(Definition-Use) in compiler design: consist of a definition of a variable and all its uses, reachable from that definition are created using a form static code analysis are prerequisite for many compiler optimization including constant propagation and common sub-expression elimination All of the above
Arjun
asked
in
Compiler Design
Apr 22, 2018
by
Arjun
2.3k
views
isro2018
compiler-design
code-optimization
4
votes
2
answers
32
ISRO2018-30
Which of the following comment about peep-hole optimization is true? It is applied to small part of the code and applied repeatedly It can be used to optimize intermediate code It can be applied to a portion of the code that is not contiguous It is applied in symbol table to optimize the memory requirements.
Arjun
asked
in
Compiler Design
Apr 22, 2018
by
Arjun
4.3k
views
isro2018
compiler-design
code-optimization
2
votes
5
answers
33
ISRO2018-31
A byte addressable computer has a memory capacity of $2$^{m}$KB$ ($k$ bytes) and can perform $2$^{n}$ operations. An instruction involving $3$ operands and one operator needs maximum of: $3m$ bits $3m + n$ bits $m + n$ bits none of the above
Arjun
asked
in
CO and Architecture
Apr 22, 2018
by
Arjun
4.1k
views
isro2018
co-and-architecture
instruction-format
4
votes
3
answers
34
ISRO2018-32
A computer uses ternary system instead of the traditional systen, An $n$ bit string in the binary system will occupy $3+n$ ternary digits $2n/3$ ternary digits $n$\log_{2}3$ ternary digits $n$\log_{3}2$ ternary digits
Arjun
asked
in
Digital Logic
Apr 22, 2018
by
Arjun
4.2k
views
isro2018
digital-logic
number-representation
4
votes
2
answers
35
ISRO2018-33
Which of the following is application of Breath First Search on the graph? Finding diameter of the graph Finding bipartite graph Both (a) and (b) None of the above
Arjun
asked
in
Algorithms
Apr 22, 2018
by
Arjun
3.9k
views
isro2018
graph-algorithm
breadth-first-search
algorithms
3
votes
4
answers
36
ISRO2018-34
Micro program is: the name of a source program in micro computers set of microinstructions that defines the individual operations in response to a machine-language instruction a primitive form of macros used in assembly language programming a very small segment of machine code
Arjun
asked
in
CO and Architecture
Apr 22, 2018
by
Arjun
2.5k
views
isro2018
co-and-architecture
microprogramming
1
vote
1
answer
37
ISRO2018-35
Given two sorted list of size $m$ and $n$ respectively. The number of comparisons needed the worst case by the merge sort algorithm will be: $m \times n$ maximum of $m$ and $n$ minimum of $m$ and $n$ $m+n-1$
Arjun
asked
in
Algorithms
Apr 22, 2018
by
Arjun
2.4k
views
isro2018
algorithms
merge-sort
4
votes
2
answers
38
ISRO2018-36
A hash table with $10$ buckets with one slot pet per bucket is depicted here. The symbols, $S1$ to $S7$ ... $4$ $5$ $6$ $3$
Arjun
asked
in
Algorithms
Apr 22, 2018
by
Arjun
2.5k
views
isro2018
algorithms
hashing
linear-probing
5
votes
3
answers
39
ISRO2018-37
The running time of an algorithm is given by: $T(n) = T(n-1) + T(n-2) - T(n-3)$, if $n > 3$ = $n$, otherwise Then what should be the relation between $T(1), T(2), T(3)$, so that the order of the algorithm is constant? $T(1) = T(2) = T(3)$ $T(1) + T(3) = 2T(2)$ $T(1) - T(3) = T(2)$ $T(1) + T(2) = T(3)$
Arjun
asked
in
Algorithms
Apr 22, 2018
by
Arjun
7.5k
views
isro2018
algorithms
recurrence-relation
time-complexity
7
votes
3
answers
40
ISRO2018-38
The number of edges in a regular graph of degree: $d$ and $n$ vertices is: maximum of $n$ and $d$ $n +d$ $nd$ $nd/2$
Arjun
asked
in
Graph Theory
Apr 22, 2018
by
Arjun
13.9k
views
isro2018
graph-theory
graph-connectivity
2
votes
1
answer
41
ISRO2018-39
Perform window to viewport transformation for the point (20,15). Assume that $(X_{wmin}\ ,Y_{wmin} )$ is $(0,0)$ ; $(X_{wmax}\ ,Y_{wmax} )$ is $(100,100)$ ; $(X_{vmin}\ ,Y_{vmin} )$ is $(5,5)$ ; $(X_{vmax}\ ,Y_{vmax} )$ is $(20,20)$ . The value of $x$ and $y$ in the viewport is $x=4,y=4$ $x=3,y=3$ $x=8,y=7.25$ $x=3,y=4$
Arjun
asked
in
Computer Graphics
Apr 22, 2018
by
Arjun
5.4k
views
isro2018
non-gate
normal
computer-graphics
3
votes
1
answer
42
ISRO2018-40
Given relations $\textsf{R(w,x)}$ and $\textsf{S(y,z)},$ the result of SELECT DISTINCT w, x FROM R, S ls guaranteed to be same as $\text{R},$ if $\textsf{R}$ has no duplicates and $\textsf{S}$ is non-empty $\textsf{R}$ and $\textsf{S}$ have no duplicates $\textsf{S}$ has no duplicates and $\textsf{R}$ is non-empty $\textsf{R}$ and $\textsf{S}$ have the same number of tuples
Arjun
asked
in
Databases
Apr 22, 2018
by
Arjun
2.2k
views
isro2018
sql
databases
5
votes
3
answers
43
ISRO2018-41
For a database relation $R(a,b,c,d)$ where the domain of $a,b,c$ and $d$ include only atomic value, only the following functions dependencies and those that can be inferred from them hold $a\rightarrow c$ $b\rightarrow d$ The relation is in: First normal form but not in second normal form Second normal form but not in third normal form Third normal form None of the above
Arjun
asked
in
Databases
Apr 22, 2018
by
Arjun
1.7k
views
isro2018
database-normalization
databases
1
vote
1
answer
44
ISRO2018-42
Consider the set of relations given below and the SQL query that follows: Students: (Roll_number, Name, Date_of_birth) Coursed: (Course_number, Course_name, Instructor) Grades: (Roll_number, Course_number, Grade) SELECT DISTINCT Name FROM Students, Courses, Grades WHERE Students. ... have got an $\textsf{A}$ grade in at least one of the courses taught by Sriram None of the above
Arjun
asked
in
Databases
Apr 22, 2018
by
Arjun
2.1k
views
isro2018
sql
databases
3
votes
2
answers
45
ISRO2018-43
Consider the following C++ program int a (int m) {return ++m;} int b(int&m) {return ++m;} int{char &m} {return ++m;} void main() { int p = 0, q=0, r = 0; p += a(b(p)) ; q+= b(a(q);) r+=a(c(r)); cout<<p<<q << r; } Assuming the required header first are already included, the above program results in compilation error print $123$ print $111$ print $322$
Arjun
asked
in
Object Oriented Programming
Apr 22, 2018
by
Arjun
3.8k
views
isro2018
object-oriented-programming
non-gate
5
votes
4
answers
46
ISRO2018-44
Station$A$ uses $32$ byte packets to transmit messages to Station $B$ using a sliding window protocol. The round trip delay between $A$ and $B$ is $80$ $ms$ and the bottleneck bandwidth on the path between $A$ and $B$ is $128$ $kbps$. What is the optimal window size that $A$ should use? $20$ $40$ $160$ $320$
Arjun
asked
in
Computer Networks
Apr 22, 2018
by
Arjun
2.9k
views
isro2018
computer-networks
sliding-window
6
votes
1
answer
47
ISRO2018-45
Assuming that for a given network layer implementation, connection establishment overhead is $100\;\text{bytes}$ and disconnection overhead is $28\;\text{bytes}$. What would be the minimum size of the packet the transport layer needs to keep up, if it wishes to implement a ... transport layer overhead) $512\;\text{bytes}$ $768\;\text{bytes}$ $1152\;\text{bytes}$ $1024\;\text{bytes}$
Arjun
asked
in
Computer Networks
Apr 22, 2018
by
Arjun
5.9k
views
isro2018
transport-layer
6
votes
3
answers
48
ISRO2018-46
In cryptography, the following uses transposition ciphers and the keyword is LAYER. Encrypt the following message. (Spaces are omitted during encrypton) $\text{WELCOME TO NETWORK SECURITY!}$ $\text{WMEKREETSILTWETCOOCYONRU!}$ $\text{EETSICOOCYWMEKRONRU!LTWET}$ $\text{LTWETONRU!WMEKRCOOCYEETSI}$ $\text{ONRU!COOCYLTWETEETSIWMEKR}$
Arjun
asked
in
Computer Networks
Apr 22, 2018
by
Arjun
7.6k
views
isro2018
computer-networks
network-security
2
votes
1
answer
49
ISRO2018-47
In a particular program, it is found that $1$% of the code account for $50$% of the execution time. To code a program in C++, it takes $100$ man-days. Coding in assembly language is $10$ times harder than coding in C++, but runs $5$ times ... in assembly language, if a project team needs 13 days, the team consist of $13$ programmers $10$ programmers $8$ programmers $100/13$ programmers
Arjun
asked
in
IS&Software Engineering
Apr 22, 2018
by
Arjun
4.8k
views
isro2018
is&software-engineering
2
votes
1
answer
50
ISRO2018-48
In unit testing of a module, it is found that for a set of test data, at the maximum $90$% of the code alone were tested with the probability of success $0.9$. The reliability of module is Greater than $0.9$ Equal to $0.9$ At most $0.81$ At least $0.81$
Arjun
asked
in
IS&Software Engineering
Apr 22, 2018
by
Arjun
2.3k
views
isro2018
is&software-engineering
software-testing
5
votes
3
answers
51
ISRO2018-49
in a file which contains $1$ million records and the order of the tree is $100$, then what is the maximum number of nodes to be accessed if $B$+ tree index is used? $5$ $4$ $3$ $10$
Arjun
asked
in
Databases
Apr 22, 2018
by
Arjun
10.1k
views
isro2018
databases
b-tree
2
votes
1
answer
52
ISRO2018-50
A particular disk unit uses a bit string to record the occupancy or vacancy of its tracks, with $0$ denoting vacant and $1$ for occupied. A $32$-$bit$ segment of this string has hexadecimal value D4FE2003. The percentage of occupied tracks for the corresponding part of the disk, to the nearest percentage is: $12$ $25$ $38$ $44$
Arjun
asked
in
Operating System
Apr 22, 2018
by
Arjun
2.6k
views
isro2018
disk
operating-system
2
votes
2
answers
53
ISRO2018-51
Which of the following is dense index? Primary index Clustered index Secondary index Secondary non-key index
Arjun
asked
in
Databases
Apr 22, 2018
by
Arjun
10.1k
views
isro2018
indexing
7
votes
2
answers
54
ISRO2018-52
In $\text{E-R}$ model, $\text{Y}$ is the dominant entity and $\text{X}$ is subordinate entity If $\text{X}$ is deleted, then $\text{Y}$ is also deleted If $\text{Y}$ is deleted, then $\text{X}$ is also deleted If $\text{Y}$ is deleted, then $\text{X}$ is not deleted None of the above
Arjun
asked
in
Databases
Apr 22, 2018
by
Arjun
5.7k
views
isro2018
er-diagram
databases
3
votes
1
answer
55
ISRO2018-53
Immunity of the external schemas (or application programs) to changes in the conceptual scheme is referred to as: Physical Data Independence Logical Data Independence Both (a) and (b) None of the above
Arjun
asked
in
Databases
Apr 22, 2018
by
Arjun
4.9k
views
isro2018
databases
file-system
5
votes
3
answers
56
ISRO2018-54
The set of attributes $X$ will be fully functionally dependent on the set of attributes $Y$ if the following conditions are satisfied. $X$ is functionally dependent on $Y$ $X$ is not functionally dependent on any subset of $Y$ Both (a) and (b) None of these
Arjun
asked
in
Databases
Apr 22, 2018
by
Arjun
3.7k
views
isro2018
databases
database-normalization
1
vote
3
answers
57
ISRO2018-55
Let us assume that transaction $T1$ has arrived before transaction $T2$. Consider the schedule $s=r1(A);r2(B): w2(A); w1(B)$ Which of the following is true? Allowed under basic timestamp protocol. Not allowed under basic timestamp protocols because $T1$ is rolled back. Not allowed under basic timestamp protocols because $T2$ is rolled back. None of these
Arjun
asked
in
Databases
Apr 22, 2018
by
Arjun
6.8k
views
isro2018
databases
transaction-and-concurrency
3
votes
4
answers
58
ISRO2018-56
The time complexity of computing the transitive closure of binary relation on a set of $n$ elements is known to be $O(n)$ $O(n*\log(n))$ $O(n^{\frac{3}{2}})$ $O(n^{3})$
Arjun
asked
in
Set Theory & Algebra
Apr 22, 2018
by
Arjun
2.1k
views
isro2018
set-theory&algebra
relations
time-complexity
5
votes
2
answers
59
ISRO2018-57
Given a binary-max heap. The elements are stored in an arrays as $25, 14, 16, 13, 10, 8, 12$. What is the content of the array after two delete operations? $14,13,8,12,10$ $14,12,13,10,8$ $14,13,12,8,10$ $14,13,12,10,8$
Arjun
asked
in
DS
Apr 22, 2018
by
Arjun
15.1k
views
isro2018
data-structures
binary-heap
1
vote
2
answers
60
ISRO2018-58
The Functions Point (FP) metric is Calculated from user requirement Calculated from lines of code Calculated from software complexity assessment None of the above
Arjun
asked
in
IS&Software Engineering
Apr 22, 2018
by
Arjun
5.2k
views
isro2018
software-metrics
is&software-engineering
non-gate
Page:
« prev
1
2
3
next »
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 isro2018
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:...