Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for isro2017
38
votes
5
answers
1
GATE CSE 2005 | Question: 1, ISRO2017-55
What does the following C-statement declare? int (*f) (int * ); A function that takes an integer pointer as argument and returns an integer A function that takes an integer as argument and returns an integer pointer A pointer ... pointer as argument and returns an integer A function that takes an integer pointer as argument and returns a function pointer
What does the following C-statement declare?int (*f) (int * );A function that takes an integer pointer as argument and returns an integerA function that takes an integer ...
Kathleen
20.6k
views
Kathleen
asked
Sep 22, 2014
Programming in C
gatecse-2005
programming
programming-in-c
pointers
easy
isro2017
+
–
29
votes
7
answers
2
GATE CSE 1994 | Question: 1.7, ISRO2017-14
The recurrence relation that arises in relation with the complexity of binary search is: $T(n) = 2T\left(\frac{n}{2}\right)+k, \text{ k is a constant }$ $T(n) = T\left(\frac{n}{2}\right)+k, \text{ k is a constant }$ $T(n) = T\left(\frac{n}{2}\right)+\log n$ $T(n) = T\left(\frac{n}{2}\right)+n$
The recurrence relation that arises in relation with the complexity of binary search is:$T(n) = 2T\left(\frac{n}{2}\right)+k, \text{ k is a constant }$$T(n) = T\left(\fra...
Kathleen
17.9k
views
Kathleen
asked
Oct 4, 2014
Algorithms
gate1994
algorithms
recurrence-relation
easy
isro2017
+
–
35
votes
6
answers
3
GATE CSE 1994 | Question: 1.4, ISRO2017-2
Let $A$ and $B$ be any two arbitrary events, then, which one of the following is TRUE? $P (A \cap B) = P(A)P(B)$ $P (A \cup B) = P(A)+P(B)$ $P (A \mid B) = P(A \cap B)P(B)$ $P (A \cup B) \leq P(A) + P(B)$
Let $A$ and $B$ be any two arbitrary events, then, which one of the following is TRUE?$P (A \cap B) = P(A)P(B)$$P (A \cup B) = P(A)+P(B)$$P (A \mid B) = P(A \cap B)P(B)$$...
Kathleen
13.8k
views
Kathleen
asked
Oct 4, 2014
Probability
gate1994
probability
conditional-probability
normal
isro2017
+
–
6
votes
3
answers
4
ISRO2017-16
Given two statements Insertion of an element should be done at the last node of the circular list Deletion of an element should be done at the last node of the circular list Both are true Both are false First is false and second is true None of the above
Given two statementsInsertion of an element should be done at the last node of the circular listDeletion of an element should be done at the last node of the circular lis...
sh!va
10.5k
views
sh!va
asked
May 7, 2017
DS
isro2017
data-structures
linked-list
bad-question
+
–
29
votes
9
answers
5
GATE CSE 1995 | Question: 1.9 , ISRO2017-13
In some programming language, an identifier is permitted to be a letter followed by any number of letters or digits. If $L$ and $D$ denote the sets of letters and digits respectively, which of the following expressions defines an identifier? $(L + D)^+$ $(L.D)^*$ $L(L + D)^*$ $L(L.D)^*$
In some programming language, an identifier is permitted to be a letter followed by any number of letters or digits. If $L$ and $D$ denote the sets of letters and digits ...
Kathleen
13.0k
views
Kathleen
asked
Oct 8, 2014
Theory of Computation
gate1995
theory-of-computation
regular-expression
easy
isro2017
+
–
9
votes
4
answers
6
ISRO2017-24
When two $n$-bit binary numbers are added the sum will contain at the most $n$ bits $n + 2$ bits $n + 3$ bits $n + 1$ bits
When two $n$-bit binary numbers are added the sum will contain at the most$n$ bits$n + 2$ bits$n + 3$ bits$n + 1$ bits
sh!va
7.7k
views
sh!va
asked
May 7, 2017
Digital Logic
isro2017
digital-logic
adder
+
–
15
votes
5
answers
7
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
Wha is the output of the following program?main() { int a = 10; if(fork()) == 0)) a++; printf("%d\n",a); }10 and 11101111 and 11
sh!va
8.7k
views
sh!va
asked
May 7, 2017
Operating System
isro2017
operating-system
fork-system-call
+
–
66
votes
8
answers
8
GATE IT 2005 | Question: 23, ISRO2017-67
A B-Tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then the maximum number of nodes that could be newly created in the process are $5$ $4$ $3$ $2$
A B-Tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then the maximum number of nodes tha...
Ishrat Jahan
18.5k
views
Ishrat Jahan
asked
Nov 3, 2014
Databases
gateit-2005
databases
b-tree
normal
isro2017
+
–
8
votes
3
answers
9
ISRO2017-3
Using Newton-Raphson method, a root correct to 3 decimal places of $x^3 - 3x -5 = 0$ 2.222 2.275 2.279 None of the above
Using Newton-Raphson method, a root correct to 3 decimal places of $x^3 - 3x -5 = 0$2.2222.2752.279None of the above
sh!va
25.6k
views
sh!va
asked
May 7, 2017
Numerical Methods
isro2017
newton-raphson
non-gate
+
–
45
votes
6
answers
10
GATE CSE 2009 | Question: 16, ISRO2017-12
Which one of the following is FALSE? There is a unique minimal DFA for every regular language Every NFA can be converted to an equivalent PDA. Complement of every context-free language is recursive. Every nondeterministic PDA can be converted to an equivalent deterministic PDA.
Which one of the following is FALSE?There is a unique minimal DFA for every regular languageEvery NFA can be converted to an equivalent PDA.Complement of every context-fr...
Kathleen
15.5k
views
Kathleen
asked
Sep 22, 2014
Theory of Computation
gatecse-2009
theory-of-computation
easy
isro2017
pushdown-automata
+
–
10
votes
3
answers
11
ISRO2017-21
A cache memory needs an access time of $30$ ns and main memory $150$ ns, what is average access time of CPU (assume hit ratio $= 80\%)?$ $60$ ns $30$ ns $150$ ns $70$ ns
A cache memory needs an access time of $30$ ns and main memory $150$ ns, what is average access time of CPU (assume hit ratio $= 80\%)?$$60$ ns$30$ ns$150$ ns$70$ ns
sh!va
13.2k
views
sh!va
asked
May 7, 2017
CO and Architecture
isro2017
co-and-architecture
cache-memory
+
–
6
votes
1
answer
12
ISRO2017-59
The best data structure to check whether an arithmetic expression has balanced parenthesis is a: Queue Stack Tree List
The best data structure to check whether an arithmetic expression has balanced parenthesis is a:QueueStackTreeList
sh!va
18.6k
views
sh!va
asked
May 7, 2017
DS
isro2017
data-structures
stack
easy
+
–
4
votes
3
answers
13
ISRO2017-26
Advantage of synchronous sequential circuits over asynchronous one is : Lower hardware requirement Better noise immunity Faster operation All of the above
Advantage of synchronous sequential circuits over asynchronous one is :Lower hardware requirementBetter noise immunityFaster operationAll of the above
sh!va
10.6k
views
sh!va
asked
May 7, 2017
Digital Logic
isro2017
digital-logic
digital-circuits
bad-question
+
–
5
votes
4
answers
14
ISRO2017-44
Which of the following is associated with objects? State Behavior Identity All of the above
Which of the following is associated with objects?StateBehaviorIdentityAll of the above
sh!va
4.5k
views
sh!va
asked
May 7, 2017
Object Oriented Programming
isro2017
object-oriented-programming
non-gate
+
–
6
votes
3
answers
15
ISRO2017-8
Which symbol denote derived attributes in ER Model? Double ellipse Dashed ellipse Squared ellipse Ellipse with attribute name underlined
Which symbol denote derived attributes in ER Model?Double ellipseDashed ellipseSquared ellipseEllipse with attribute name underlined
sh!va
9.1k
views
sh!va
asked
May 7, 2017
Databases
isro2017
databases
er-diagram
+
–
11
votes
3
answers
16
ISRO2017-1
If $\text{A}$ is a skew symmetric matrix then $\text{A}^t$ is Diagonal matrix $\text{A}$ $0$ $-\text{A}$
If $\text{A}$ is a skew symmetric matrix then $\text{A}^t$ isDiagonal matrix $\text{A}$$0$$-\text{A}$
sh!va
5.5k
views
sh!va
asked
May 7, 2017
Linear Algebra
isro2017
linear-algebra
matrix
+
–
5
votes
2
answers
17
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
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...
Durgesh Singh
3.6k
views
Durgesh Singh
asked
Dec 17, 2017
Theory of Computation
theory-of-computation
isro2017
context-free-language
context-free-grammar
+
–
5
votes
3
answers
18
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
We use malloc and calloc for:Dynamic memory allocationStatic memory allocationBoth dynamic memory allocation and static memory allocationNone of these
sh!va
7.1k
views
sh!va
asked
May 7, 2017
Programming in C
isro2017
programming-in-c
runtime-environment
+
–
4
votes
2
answers
19
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
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,20Assuming the head is currently...
sh!va
7.5k
views
sh!va
asked
May 7, 2017
Operating System
isro2017
operating-system
disk-scheduling
+
–
10
votes
8
answers
20
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
Which of the following data structure is useful in traversing a given graph by breadth first search?StackQueueListNone of the above
Arjun
13.1k
views
Arjun
asked
May 9, 2017
Algorithms
isro2017
data-structures
graph-algorithms
breadth-first-search
easy
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register