Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged isro2018
0
votes
2
answers
61
ISRO2018-59
The lower degree of cohesion is kind of: Logical Cohesion Coincidental Cohesion Procedural Cohesion Communicational Cohesion
The lower degree of cohesion is kind of:Logical CohesionCoincidental CohesionProcedural CohesionCommunicational Cohesion
Arjun
10.6k
views
Arjun
asked
Apr 22, 2018
IS&Software Engineering
isro2018
is&software-engineering
+
–
5
votes
6
answers
62
ISRO2018-60
What is the output of tho following program? main(){ int x=2, y=5; if(x<y) return (x=x+y); else printf("z1"); printf("z2"); } $z2$ $z1z2$ Compilation error None of these
What is the output of tho following program?main(){ int x=2, y=5; if(x<y) return (x=x+y); else printf("z1"); printf("z2"); }$z2$$z1z2$Compilation errorNone of these
Arjun
9.9k
views
Arjun
asked
Apr 22, 2018
Programming in C
isro2018
programming
output
+
–
1
votes
7
answers
63
ISRO2018-61
The Operating System of a computer may periodically collect all the free memory space to form contiguous block of free space. This is called: Concatenation Garbage Collection Collision Dynamic Memory Allocation
The Operating System of a computer may periodically collect all the free memory space to form contiguous block of free space. This is called:ConcatenationGarbage Collecti...
Arjun
2.6k
views
Arjun
asked
Apr 22, 2018
Operating System
isro2018
memory-management
operating-system
+
–
4
votes
2
answers
64
ISRO2018-62
Any set of Boolean operation that is sufficient to represent all Boolean expression is said to be complete. Which of the following is not complete ? $\text{{AND, OR}}$ $\text{{AND, NOT}}$ $\text{{NOT, OR}}$ $\text{{NOR}}$
Any set of Boolean operation that is sufficient to represent all Boolean expression is said to be complete. Which of the following is not complete ?$\text{{AND, OR}}$$\te...
Arjun
1.9k
views
Arjun
asked
Apr 22, 2018
Digital Logic
isro2018
digital-logic
boolean-algebra
+
–
2
votes
3
answers
65
ISRO2018-63
Consider a singly linked list of the form where $F$ is a pointer to the first element in the linked list and $L$ is the pointer to the last element in the list. The time of which of the following operations depends on the length of the list? ... list Delete the first element of the list Add an element after the last element of the list Interchange the first two elements of the list
Consider a singly linked list of the form where $F$ is a pointer to the first element in the linked list and $L$ is the pointer to the last element in the list. The time ...
Arjun
3.8k
views
Arjun
asked
Apr 22, 2018
DS
isro2018
linked-list
data-structures
+
–
6
votes
3
answers
66
ISRO2018-64
A particular BNF definition for a "word is given by the following rules. <word> :: = <letter> I <letter> <charpair> I <letter> <intpair> <charpair> :: = <letter> <letter> I <charpair> <letter> <letter> < ... $\textsf{c44}$ I, II and III I and II only I and III only II and III only
A particular BNF definition for a "word is given by the following rules.<word :: = <letter I <letter <charpair I <letter <intpair <charpair :: = <letter <letter I <charpa...
Arjun
5.7k
views
Arjun
asked
Apr 22, 2018
Compiler Design
isro2018
compiler-design
grammar
context-free-grammar
+
–
3
votes
2
answers
67
ISRO2018-65
Of the following, which best characterizes computers that use memory-mapped $\text{I/O}?$ The computer provides special instructions for manipulating $\text{I/O}$ ports $\text{I/O}$ ports are placed at addresses on the bus and are accessed just like ... register and call channel to perform the operation $\text{I/O}$ can be performed only when memory management hardware is turned on
Of the following, which best characterizes computers that use memory-mapped $\text{I/O}?$The computer provides special instructions for manipulating $\text{I/O}$ ports$\t...
Arjun
3.5k
views
Arjun
asked
Apr 22, 2018
CO and Architecture
isro2018
co-and-architecture
io-handling
+
–
2
votes
2
answers
68
ISRO2018-66
Of the following sorting algorithms, which has a running time that is least dependent on the initial ordering of the input? Mege Sort Insertion Sort Selection Sort Quick Sort
Of the following sorting algorithms, which has a running time that is least dependent on the initial ordering of the input?Mege SortInsertion SortSelection SortQuick Sort...
Arjun
5.6k
views
Arjun
asked
Apr 22, 2018
Algorithms
isro2018
algorithms
sorting
+
–
2
votes
1
answer
69
ISRO2018-67
Procedures $P1$ and $P2$ have a producer-consumer relationship, communicating by the use of a set of shared buffers. $P1$: repeat Obtain an empty buffer Fill it Return a full buffer forever $P2$: repeat Obtain a full buffer Empty it Return an ... ) Decrease the likelihood of deadlock Increase the ease of achieving a correct implementation III only II only I only II and III only
Procedures $P1$ and $P2$ have a producer-consumer relationship, communicating by the use of a set of shared buffers.$P1$: repeat Obtain an empty buffer ...
Arjun
3.2k
views
Arjun
asked
Apr 22, 2018
Operating System
isro2018
process-synchronization
operating-system
+
–
5
votes
2
answers
70
ISRO2018-67
In multi-programmed systems, it is advantageous if some programs such as editors anf compilers can be shared by several users. Which of the following must be true of multi-programmed systems in order that a single copy of a program can be shared by several users? The program is a macro The program is recursive The program is reentrant I only II only III only I, II and III
In multi-programmed systems, it is advantageous if some programs such as editors anf compilers can be shared by several users.Which of the following must be true of multi...
Arjun
3.3k
views
Arjun
asked
Apr 22, 2018
Operating System
isro2018
operating-system
macros
+
–
2
votes
1
answer
71
ISRO2018-69
Let $P$ be a procedure that for some inputs calls itself (i.e. is recursive). If $P$ is guaranteed to terminate, which of the following statement(s) must be true? $P$ has a local variable $P$ has an execution path where it does not call itself $P$ either refers to a global variable or has at least one parameter I only II only III only II and III only
Let $P$ be a procedure that for some inputs calls itself (i.e. is recursive). If $P$ is guaranteed to terminate, which of the following statement(s) must be true?$P$ has ...
Arjun
1.8k
views
Arjun
asked
Apr 22, 2018
Programming in C
isro2018
programming
recursion
+
–
5
votes
4
answers
72
ISRO2018-70
Consider the following C program: main() { float sum= 0.0, j=1.0,i=2.0; while(i/j>0.001){ j=j+1; sum=sum+i/j; printf("%f/n", sum); } } $0$ - $9$ lines of output $10$ - $19$ lines out output $20$ - $29$ lines of output More than $29$ lines of output
Consider the following C program:main() { float sum= 0.0, j=1.0,i=2.0; while(i/j>0.001){ j=j+1; sum=sum+i/j; printf("%f/n", sum); } }$0$ - $9$ lines of output$10$ - $19$ ...
Arjun
4.3k
views
Arjun
asked
Apr 22, 2018
Programming in C
isro2018
programming-in-c
programming
+
–
4
votes
4
answers
73
ISRO2018-71
A particular parallel program computation requires $100$ sec when executed on a single processor, if $40\%$ of this computation is inherently sequential (i.e. will not benefit from additional processors), then theoretically best possible elapsed times of this program running with $2$ and $4$ ... sec and $10$ sec $30$ sec and $15$ sec $50$ sec and $25$ sec $70$ sec and $55$ sec
A particular parallel program computation requires $100$ sec when executed on a single processor, if $40\%$ of this computation is inherently sequential (i.e. will not be...
Arjun
4.9k
views
Arjun
asked
Apr 22, 2018
CO and Architecture
isro2018
co-and-architecture
parallel-programming
+
–
5
votes
2
answers
74
ISRO2018-72
Consider the following C code segment int f(int x) { if(x<1) return 1; else return (if(x-1)+g(x)); } int g(int x) { if(x<2) return 2; else return (if(x-1)+g(x/2)); } Of the following, which best describes the growth of $f(x)$ as a function of $x$ ? Linear Exponential Quadratic Cubic
Consider the following C code segmentint f(int x) { if(x<1) return 1; else return (if(x-1)+g(x)); } int g(int x) { if(x<2) return 2; else return (if(x-1)+g(x/2)); }Of the...
Arjun
4.6k
views
Arjun
asked
Apr 22, 2018
Algorithms
isro2018
algorithms
identify-function
time-complexity
+
–
2
votes
2
answers
75
ISRO2018-73
For a multi-processor architecture, in which protocol a write transaction is forwarded to only those processors that are known to possess a copy of newly altered cache line? Snoopy bus protocol Cache coherency protocol Directory based protocol None of the above
For a multi-processor architecture, in which protocol a write transaction is forwarded to only those processors that are known to possess a copy of newly altered cache li...
Arjun
4.1k
views
Arjun
asked
Apr 22, 2018
CO and Architecture
isro2018
cache-memory
+
–
2
votes
1
answer
76
ISRO2018-74
Avalanche effect in cryptography Is desirable property of cryptographic algorithm Is undesirable property of cryptographic algorithm Has no effect on encryption algorithm None of the above
Avalanche effect in cryptographyIs desirable property of cryptographic algorithmIs undesirable property of cryptographic algorithmHas no effect on encryption algorithmNon...
Arjun
2.4k
views
Arjun
asked
Apr 22, 2018
Computer Networks
isro2018
computer-networks
network-security
+
–
3
votes
3
answers
77
ISRO2018-75
ln neural network, the network capacity is defined as: The traffic (tarry capacity of the network The total number of nodes in the network The number of patterns that can be stored and recalled in a network None of the above
ln neural network, the network capacity is defined as:The traffic (tarry capacity of the networkThe total number of nodes in the networkThe number of patterns that can be...
Arjun
2.7k
views
Arjun
asked
Apr 22, 2018
Artificial Intelligence
isro2018
non-gate
neural-network
+
–
3
votes
1
answer
78
ISRO2018-76
Cloaking is a search engine optimization $(SEO)$ technique. During cloaking: Content presented to search engine spider is different from that presented to user's browser Content present to search engine spider and browser is same Contents of user's requested website are changed None of the above
Cloaking is a search engine optimization $(SEO)$ technique. During cloaking:Content presented to search engine spider is different from that presented to user's browserCo...
Arjun
1.3k
views
Arjun
asked
Apr 22, 2018
IS&Software Engineering
isro2018
is&software-engineering
+
–
2
votes
3
answers
79
ISRO2018-77
What is one advantage of setting up a $\text{DMZ}$ (Demilitarized Zone) with two firewalls? You can control where traffic goes in the three networks You can do statefull packet filtering You can do load balancing Improve network performance
What is one advantage of setting up a $\text{DMZ}$ (Demilitarized Zone) with two firewalls?You can control where traffic goes in the three networksYou can do statefull pa...
Arjun
4.1k
views
Arjun
asked
Apr 22, 2018
Computer Networks
isro2018
computer-networks
network-security
firewall
+
–
2
votes
4
answers
80
ISRO2018-78
Which one of the following algorithm is not used in asymmetric key cryptography? RSA Algorithm Gillie-Hellman Algorithm Electronic Code Book Algorithm None of the above
Which one of the following algorithm is not used in asymmetric key cryptography?RSA AlgorithmGillie-Hellman AlgorithmElectronic Code Book AlgorithmNone of the above
Arjun
14.3k
views
Arjun
asked
Apr 22, 2018
Computer Networks
isro2018
computer-networks
network-security
cryptography
+
–
3
votes
2
answers
81
ISRO2018-79
A doubly linked list is declared as: struct Node { int Value; struct Node *Fwd; struct Node *Bwd; }; Where Fwd and Bwd represent forward and backward link to the adjacent elements of the list. Which of the following segment of code deletes the node pointed to by ... Bwd = X.Bwd; X$\rightarrow$Bwd$\rightarrow$Fwd = X$\rightarrow$Bwd; X$\rightarrow$Fwd$\rightarrow$Bwd = X$\rightarrow$Fwd;
A doubly linked list is declared as:struct Node { int Value; struct Node *Fwd; struct Node *Bwd; };Where Fwd and Bwd represent forward and backward link to the adjacent e...
Arjun
28.6k
views
Arjun
asked
Apr 22, 2018
DS
isro2018
linked-list
data-structures
+
–
2
votes
4
answers
82
ISRO2018-80
If $\text{Tree-1}$ and $\text{Tree-2}$ are the trees indicated below: Which traversals of $\text{Tree-1}$ and $\text{Tree-2}$, respectively, will produce the same sequence? Preorder, postorder Postorder, inorder Postorder, preorder Inorder, preorder
If $\text{Tree-1}$ and $\text{Tree-2}$ are the trees indicated below:Which traversals of $\text{Tree-1}$ and $\text{Tree-2}$, respectively, will produce the same sequence...
Arjun
6.4k
views
Arjun
asked
Apr 22, 2018
DS
isro2018
data-structures
tree-traversal
+
–
Page:
« prev
1
2
3
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register