Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged isro2018
1
votes
1
answer
1
ISRO CS 2018
#include <stdio.h> int main() { int i,j,x; scanf("%d ",x); i=1; j=1; while(i<10){ j=j*i; i=i+1; if(i==x) break; } return 0; }
#include <stdio.h int main() {int i,j,x;scanf("%d ",x);i=1;j=1;while(i<10){j=j*i;i=i+1;if(i==x) break;}return 0;}
Rakshita Jadoun
621
views
Rakshita Jadoun
asked
Feb 4, 2023
Programming in C
isro2018
programming-in-c
+
–
5
votes
2
answers
2
ISRO2018-1
Consider the following program { int x=1; printf("%d",(*char(char*)&x)); } Assuming required header files are included and if the machine in which this program is executed is little endian, then the output will be 0 99999999 1 unpredictable
Consider the following program{ int x=1; printf("%d",(*char(char*)&x)); }Assuming required header files are included and if the machine in which this program is executed ...
Arjun
8.6k
views
Arjun
asked
Apr 22, 2018
Programming in C
isro2018
programming
output
+
–
5
votes
3
answers
3
ISRO2018-2
Consider the following declaration : structaddr { char city[10]; char street[30]; int pin; }; struct { char name[30]; int gender; struct addr locate; } person, *kd = &person; Then *$(kd->name + 2)$ can be used instead of: $person.name+2$ $kd-> (name+2)$ $*((*kd).name+2)$ either $A)$ or $B)$ , not $C)$
Consider the following declaration :structaddr { char city[10]; char street[30]; int pin; }; struct { char name[30]; int gender; struct addr locate; } person, *kd = &pers...
Arjun
5.6k
views
Arjun
asked
Apr 22, 2018
Programming in C
isro2018
programming
structure
+
–
6
votes
4
answers
4
ISRO2018-3
If a variable can take only integral values from $0$ to $n$, where $n$ is an integer, then the variable can be represented as a bit-field whose width is $($the log in the answer are to the base $2$, and $\left \lceil \log_{}{n} \right \rceil$ ... $\left \lceil \log (n+1) \right \rceil + 1\text{ bits}$ None of the above
If a variable can take only integral values from $0$ to $n$, where $n$ is an integer, then the variable can be represented as a bit-field whose width is $($the log in the...
Arjun
6.4k
views
Arjun
asked
Apr 22, 2018
Digital Logic
isro2018
number-representation
digital-logic
+
–
3
votes
3
answers
5
ISRO2018-4
The following $C$ program: { fork(); fork(); printf("yes"); } If we execute this core segment, how many times the string yes will be printed? Only once 2 times 4 times 8 times
The following $C$ program:{ fork(); fork(); printf("yes"); }If we execute this core segment, how many times the string yes will be printed?Only once2 times4 times8 times
Arjun
10.9k
views
Arjun
asked
Apr 22, 2018
Operating System
isro2018
fork-system-call
operating-system
+
–
3
votes
3
answers
6
ISRO2018-5
Considering the following table in a relational database : ... could be a candidate key of the table? $\text{{Last Name}}$ $\text{{Room}}$ $\text{{Shift}}$ $\text{{Room, Shift}}$
Considering the following table in a relational database : $$\begin{array}{|c|c|c|c|} \hline \textbf{Last Name} & \textbf{Rank} & \textbf{Room} & \textbf{shift} \\ \hline...
Arjun
3.7k
views
Arjun
asked
Apr 22, 2018
Databases
isro2018
databases
database-normalization
+
–
2
votes
3
answers
7
ISRO2018-6
A data driven machine is one that executes an instruction if the needed data is available. The physical ordering of the code listing does not dictate the course of execution. Consider the following pseudo-code: Multiply $E$ by $0.5$ to get $F$ Add $A$ and $B$ to get $E$ Add $B$ with $0.5$ to get ... sequence of execution is valid? B, C, D, A, E C, B, E, A, D A, B, C, D, E E, D, C, B, A
A data driven machine is one that executes an instruction if the needed data is available. The physical ordering of the code listing does not dictate the course of execut...
Arjun
3.2k
views
Arjun
asked
Apr 22, 2018
CO and Architecture
isro2018
co-and-architecture
instruction-format
+
–
1
votes
2
answers
8
ISRO2018-7
Assume $A$ and $B$ are non-zero positive integers. The following code segment: while(A!=B){ if*(A> B) A -= B; else B -= A; } cout<<A; // printing the value of A Computes the $LCM$ of two numbers Divides the larger number by the smaller number Computes the $GCD$ of two numbers Finds the smaller of two numbers
Assume $A$ and $B$ are non-zero positive integers. The following code segment:while(A!=B){ if*(A B) A -= B; else B -= A; } cout<<A; // printing the value of AComputes the...
Arjun
4.2k
views
Arjun
asked
Apr 22, 2018
Algorithms
isro2018
algorithms
identify-function
+
–
1
votes
2
answers
9
ISRO2018-8
A language with string manipulation facilities uses the following operations. head$(s)$- returns the first character of the string $s$ tails$(s)$- returns all but the first character of the string $s$ concat$(s1, s2)$- concatenates string $s1$ with $s2.$ The output of concat(head$(s)$, head(tail(tail$(s)$))), where s is $acbc$ is: ab ba ac aa
A language with string manipulation facilities uses the following operations.head$(s)$- returns the first character of the string $s$tails$(s)$- returns all but the first...
Arjun
2.7k
views
Arjun
asked
Apr 22, 2018
Programming in C
isro2018
programming
output
+
–
14
votes
3
answers
10
ISRO2018-9
In the diagram above, the inverter (NOT gate) and the AND-gates labeled $1$ and $2$ have delays of $9, 10$ and $12$ nanoseconds (ns), respectively. Wire delays are negligible. For certain values $a$ and $c$, together with certain transition of $b$, a glitch (spurious output) is ... correct value. The duration of glitch is: $7\;\text{ns}$ $9\;\text{ns}$ $11\;\text{ns}$ $13\;\text{ns}$
In the diagram above, the inverter (NOT gate) and the AND-gates labeled $1$ and $2$ have delays of $9, 10$ and $12$ nanoseconds (ns), respectively. Wire delays are neglig...
Arjun
6.1k
views
Arjun
asked
Apr 22, 2018
Digital Logic
isro2018
digital-logic
circuit-output
+
–
3
votes
1
answer
11
ISRO2018-10
Which of the following comparisons between static and dynamic type checking incorrect? Dynamic type checking slows down the execution Dynamic type checking offers more flexibility to the programmers In contrast to Static type checking, dynamic type checking may cause failure in runtime due to type errors Unlike static type checking dynamic type checking is done during compilation
Which of the following comparisons between static and dynamic type checking incorrect?Dynamic type checking slows down the executionDynamic type checking offers more flex...
Arjun
4.0k
views
Arjun
asked
Apr 22, 2018
Programming in C
isro2018
programming
semantic-analysis
+
–
2
votes
1
answer
12
ISRO2018-11
________ can detect burst error of length less than or equal to degree of the polynomial and detects burst errors that affect odd number of bits. Hamming Code CRC VRC None of the above
________ can detect burst error of length less than or equal to degree of the polynomial and detects burst errors that affect odd number of bits.Hamming CodeCRCVRCNone of...
Arjun
4.0k
views
Arjun
asked
Apr 22, 2018
Computer Networks
isro2018
computer-networks
crc-polynomial
+
–
1
votes
1
answer
13
ISRO2018-12
An array $A$ consists of $n$ integers in locations $A[0], A[1], \ldots A[n-1]$. It is required to shift the elements of the array cyclically to the left by $k$ places, where $1<=k<=(n-1)$. An incomplete algorithm for doing this in linear time, without using another array is given ...
An array $A$ consists of $n$ integers in locations $A[0], A , \ldots A[n-1]$. It is required to shift the elements of the array cyclically to the left by $k$ places, wher...
Arjun
5.2k
views
Arjun
asked
Apr 22, 2018
Algorithms
isro2018
algorithms
identify-function
+
–
3
votes
2
answers
14
ISRO2018-13
The difference between a named pipe and a regular file in Unix is that Unlike a regular file, named pipe is a special file The data in a pipe is transient, unlike the content of a regular file Pipes forbid random accessing, while regular files do allow this. All of the above
The difference between a named pipe and a regular file in Unix is thatUnlike a regular file, named pipe is a special fileThe data in a pipe is transient, unlike the conte...
Arjun
3.8k
views
Arjun
asked
Apr 22, 2018
Operating System
isro2018
operating-system
pipes
non-gate
+
–
5
votes
3
answers
15
ISRO2018-14
A class of $30$ students occupy a classroom containing $5$ rows of seats, with $8$ seats in each row. If the students seat themselves at random, the probability that sixth seat in the fifth row will be empty is: $1/5$ $1/3$ $1/4$ $2/5$
A class of $30$ students occupy a classroom containing $5$ rows of seats, with $8$ seats in each row. If the students seat themselves at random, the probability that sixt...
Arjun
4.8k
views
Arjun
asked
Apr 22, 2018
Probability
isro2018
probability
+
–
3
votes
3
answers
16
ISRO2018-15
The domain of the function $\log (\log \sin(x))$ is: $0<x<$\pi$ $2n$\pi$<$x$<$(2n+1)$\pi$, for $n$ in $N$ Empty set None of the above
The domain of the function $\log (\log \sin(x))$ is:$0<x<$$\pi$$2n$$\pi$$<$$x$$<$$(2n+1)$$\pi$, for $n$ in $N$Empty setNone of the above
Arjun
5.4k
views
Arjun
asked
Apr 22, 2018
Calculus
isro2018
calculus
functions
+
–
3
votes
1
answer
17
ISRO2018-16
The following paradigm can be used to find the solution of the problem in minimum time: Given a set of non-negative integer and a value $K$, determine if there is a subset of the given set with sum equal to $K$: Divide and Conquer Dynamic Programming Greedy Algorithm Branch and Bound
The following paradigm can be used to find the solution of the problem in minimum time:Given a set of non-negative integer and a value $K$, determine if there is a subset...
Arjun
5.1k
views
Arjun
asked
Apr 22, 2018
Algorithms
isro2018
algorithm-design-technique
algorithms
+
–
8
votes
3
answers
18
ISRO2018-17
$(\text{G}, \ast )$ is an abelian group. Then $x= x^{-1}$ for any $x$ belonging to $\text{G}$ $x=x^{2}$ for any $x$ belonging to $\text{G}$ $\left( x \ast y \right )^{2}= x^{2} \ast y^{2}$ , for any $x, y$ belonging to $\text{G}$ $\text{G}$ is of finite order
$(\text{G}, \ast )$ is an abelian group. Then$x= x^{-1}$ for any $x$ belonging to $\text{G}$$x=x^{2}$ for any $x$ belonging to $\text{G}$$\left( x \ast y \right )^{2}= x^...
Arjun
4.4k
views
Arjun
asked
Apr 22, 2018
Set Theory & Algebra
isro2018
group-theory
set-theory&algebra
abelian-group
+
–
5
votes
1
answer
19
ISRO2018-18
Consider the following C code segment: #include <stdio.h> main() { int i, j, x; scanf("%d", &x); i=1; j=1; while (i<10) { j =j*i; i= i+1; if(i==x) break; } } For the program fragment above, which of the following statements about the variables i and j must be true ... $\wedge$ $(i=x))$ $(j=9!)$ $\wedge$ (i\geqslant$10$)) $\vee$ $((j=(x-1)!) $\wedge$ (i=x))$
Consider the following C code segment:#include <stdio.h main() { int i, j, x; scanf("%d", &x); i=1; j=1; while (i<10) { j =j*i; i= i+1; if(i==x) break; } }For the program...
Arjun
4.4k
views
Arjun
asked
Apr 22, 2018
Programming in C
isro2018
programming-in-c
programming
+
–
4
votes
3
answers
20
ISRO2018-19
Given $\sqrt{224_{r}}$= $13$_{r}$ the value of radix $r$ is $10$ $8$ $6$ $5$
Given $\sqrt{224_{r}}$= $13$$_{r}$ the value of radix $r$ is$10$$8$$6$$5$
Arjun
3.8k
views
Arjun
asked
Apr 22, 2018
Digital Logic
isro2018
number-representation
digital-logic
+
–
1
votes
2
answers
21
ISRO2018-20
Determine the number of page faults when references to pages occur in the order - $1, 2, 4, 5, 2, 1, 2, 4$. Assume that the main memory can accommodate $3$ pages and the main memory already has the pages $1$ and $2$, with page $1$ having brought earlier than page $2$. (assume LRU i.e. Least-Recently-Used algorithm is applied) $3$ $4$ $5$ None of the above
Determine the number of page faults when references to pages occur in the order - $1, 2, 4, 5, 2, 1, 2, 4$. Assume that the main memory can accommodate $3$ pages and the ...
Arjun
1.1k
views
Arjun
asked
Apr 22, 2018
Operating System
isro2018
operating-system
page-fault
+
–
3
votes
3
answers
22
ISRO2018-20
Determine the number of page faults when references to pages occur in the order $1,2,4,5,2,1,2,4.$ Assume that the main memory can accommodate $3$ pages and the main memory already has the pages $1$ and $2,$ with page $1$ brought earlier than page $2.$ (assume LRU i.e., Least-Recently-Used algorithm is applied) $3$ $4$ $5$ None of the above
Determine the number of page faults when references to pages occur in the order $1,2,4,5,2,1,2,4.$ Assume that the main memory can accommodate $3$ pages and the main memo...
srestha
2.8k
views
srestha
asked
Apr 22, 2018
Operating System
isro2018
operating-system
page-replacement
+
–
4
votes
5
answers
23
ISRO2018-21
Consider a system having $m$ resources of the same type. These resources are shared by $3$ processes $A, B, C,$ which have peak time demands of $3, 4, 6$ respectively. The minimum value of $m$ that ensures that deadlock will never occur is: $11$ $12$ $13$ $14$
Consider a system having $m$ resources of the same type. These resources are shared by $3$ processes $A, B, C,$ which have peak time demands of $3, 4, 6$ respectively. Th...
Arjun
5.0k
views
Arjun
asked
Apr 22, 2018
Operating System
isro2018
deadlock-prevention-avoidance-detection
operating-system
+
–
4
votes
3
answers
24
ISRO2018-22
A computer has $1000K$ of main memory. The jobs arrive and finish in the following sequence. Job $1$ requiring $200$ $K$ arrives Job $2$ requiring $350$ $K$ arrives Job $3$ requiring $300$ $K$ arrives Job $1$ finishes Job $4$ requiring $120$ ... $K$ arrives Among best fit and first fit, which performs better for this sequence? First fit Best fit Both perform the same None of the above
A computer has $1000K$ of main memory. The jobs arrive and finish in the following sequence. Job $1$ requiring $200$ $K$ arrives Job $2$ requiring $350$ $...
Arjun
2.7k
views
Arjun
asked
Apr 22, 2018
Operating System
isro2018
memory-management
fragmentation
operating-system
+
–
4
votes
5
answers
25
ISRO2018-23
Disk requests come to a disk driver for cylinders in the order $10$, $22$, $20$, $2$, $40$, $6$ and $38$ at a time when the disk drive is reading from cylinder $20$. The seek time is $6$ ms/cylinder. The total seek time, if the disk arm scheduling algorithms is first-come-first-served is $360$ $850$ $900$ None of the above
Disk requests come to a disk driver for cylinders in the order $10$, $22$, $20$, $2$, $40$, $6$ and $38$ at a time when the disk drive is reading from cylinder $20$. The ...
Arjun
3.7k
views
Arjun
asked
Apr 22, 2018
Operating System
isro2018
disk
operating-system
+
–
3
votes
3
answers
26
ISRO2018-24
Choose the correct statement - $A=\{a^nb^n \mid n= 1, 2, 3, \ldots\}$ is a regular language The set $B$, consisting of all strings made up of only $a's$ and $b's$ having equal number of $a's$ and $bs$ defines a regular language $L(A^*B)\cap B$ gives the set $A$ None of the above
Choose the correct statement -$A=\{a^nb^n \mid n= 1, 2, 3, \ldots\}$ is a regular languageThe set $B$, consisting of all strings made up of only $a's$ and $b's$ having eq...
Arjun
8.1k
views
Arjun
asked
Apr 22, 2018
Theory of Computation
isro2018
theory-of-computation
regular-language
+
–
4
votes
2
answers
27
ISRO2018-25
$CFG$ (Context Free Grammar) is not closed under: Union Complementation Kleene star Product
$CFG$ (Context Free Grammar) is not closed under: UnionComplementationKleene starProduct
Arjun
1.6k
views
Arjun
asked
Apr 22, 2018
Theory of Computation
isro2018
closure-property
context-free-language
theory-of-computation
+
–
4
votes
2
answers
28
ISRO2018-26
The $FSM$ (Finite State Machine) machine pictured in the figure above Complements a given bit pattern Finds $2's$ complement of a given bit pattern Increments a given bit pattern by $1$ Changes the sign bit
The $FSM$ (Finite State Machine) machine pictured in the figure aboveComplements a given bit patternFinds $2's$ complement of a given bit patternIncrements a given bit pa...
Arjun
7.1k
views
Arjun
asked
Apr 22, 2018
Theory of Computation
isro2018
finite-automata
theory-of-computation
+
–
2
votes
2
answers
29
ISRO2018-27
A $CFG$ (Context Free Grammar) is said to be in Chomsky Normal Form $(CNF)$, if all the productions are of the form A$\to$ BC or A$\to$ a. Let $G$ be a $CFG$ in $CNF$. To derive a string of terminals of length x, the number of products to be used is: $2x-1$ $2x$ $2x+1$ $2^{x}$
A $CFG$ (Context Free Grammar) is said to be in Chomsky Normal Form $(CNF)$, if all the productions are of the form A$\to$ BC or A$\to$ a. Let $G$ be a $CFG$ in $CNF$. To...
Arjun
3.1k
views
Arjun
asked
Apr 22, 2018
Theory of Computation
isro2018
context-free-grammar
theory-of-computation
+
–
2
votes
1
answer
30
ISRO2018-28
Incremental-Compiler is a compiler: which is written in a language that is different from the source language compiles the whole source code to generate object code afresh compiles only those portion of source code that have been modified that runs on one machine but produces object code for another machine
Incremental-Compiler is a compiler:which is written in a language that is different from the source languagecompiles the whole source code to generate object code afreshc...
Arjun
2.5k
views
Arjun
asked
Apr 22, 2018
Compiler Design
isro2018
compiler-design
intermediate-code
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register