menu
search
Log In
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

Subjects

Recent questions tagged appld-course-2019-mock1

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Recent questions tagged appld-course-2019-mock1

0 votes
1 answer
1
Applied Course 2019 Mock1-1
The more you practice, the _______ room for error there will be. fewer few less lesser
The more you practice, the _______ room for error there will be. fewer few less lesser
asked Jan 16, 2019 in Unknown Category Applied Course 289 views
0 votes
1 answer
2
Applied Course 2019 Mock1-2
As traffic congestion plagues every significant road, similarly it also _______ the narrow lanes of the city. clogs obliterates restricts prevents
As traffic congestion plagues every significant road, similarly it also _______ the narrow lanes of the city. clogs obliterates restricts prevents
asked Jan 16, 2019 in Unknown Category Applied Course 125 views
0 votes
1 answer
3
Applied Course 2019 Mock1-3
The average of $5$ consecutive numbers is $N$. If the next three numbers are also added, the average shall Remain unchanged Increase by $1$ Increase by $1.5$ Increase by $2$
The average of $5$ consecutive numbers is $N$. If the next three numbers are also added, the average shall Remain unchanged Increase by $1$ Increase by $1.5$ Increase by $2$
asked Jan 16, 2019 in Unknown Category Applied Course 94 views
0 votes
1 answer
4
Applied Course 2019 Mock1-4
A number $5k89k2$ can be divided by $18$ if $k$ is $8$ $6$ $1$ More than one value possible
A number $5k89k2$ can be divided by $18$ if $k$ is $8$ $6$ $1$ More than one value possible
asked Jan 16, 2019 in Unknown Category Applied Course 178 views
0 votes
1 answer
5
Applied Course 2019 Mock1-5
In the following figure, rectangle represents engineers, circle represents art, triangle represents comedians and square represents asians. Which set of letters represents asians who are both art as well as engineers? ECB AB B BH
In the following figure, rectangle represents engineers, circle represents art, triangle represents comedians and square represents asians. Which set of letters represents asians who are both art as well as engineers? ECB AB B BH
asked Jan 16, 2019 in Unknown Category Applied Course 107 views
0 votes
1 answer
6
Applied Course 2019 Mock1-6
Study the following table and answer the question: ... ? Raisins worth RS. $16$ Badam worth RS.$15$ Cashew worth RS.$8$ All the three worth RS. $12.5$ ($125$ gms of each)
Study the following table and answer the question: ... maximum amount of sugar? Raisins worth RS. $16$ Badam worth RS.$15$ Cashew worth RS.$8$ All the three worth RS. $12.5$ ($125$ gms of each)
asked Jan 16, 2019 in Unknown Category Applied Course 107 views
0 votes
1 answer
7
Applied Course 2019 Mock1-7
Determine the value of $'P'$ in the equation: $P=\sqrt{20+\sqrt{20+\sqrt{20+ \sqrt{20+ \dots + \infty}}}}$ $4$ $5$ $10$ $20$
Determine the value of $'P'$ in the equation: $P=\sqrt{20+\sqrt{20+\sqrt{20+ \sqrt{20+ \dots + \infty}}}}$ $4$ $5$ $10$ $20$
asked Jan 16, 2019 in Unknown Category Applied Course 114 views
0 votes
1 answer
8
Applied Course 2019 Mock1-8
The last sentence has been deleted from the following paragraph. From the given options, choose that one that completes the paragraph in the most appropriate way. For decades, psychologists believed that men experienced depression at only a fraction ... as a characteristic attribute of depression. Men's irritability is usually seen as a telling sign of medical problems.
The last sentence has been deleted from the following paragraph. From the given options, choose that one that completes the paragraph in the most appropriate way. For decades, psychologists believed that men experienced depression at only a fraction of the rate of ... usually seen as a characteristic attribute of depression. Men's irritability is usually seen as a telling sign of medical problems.
asked Jan 16, 2019 in Unknown Category Applied Course 113 views
0 votes
1 answer
9
Applied Course 2019 Mock1-9
$5$ liters of wine are drawn from a case containing $50$ liters of wine. It is replaced by a water. The process is repeated in $3$ times. What is the final quantity of wine left in the case? $29.16$ liters $36.45$ liters $16.29$ liters $45.36$ liters
$5$ liters of wine are drawn from a case containing $50$ liters of wine. It is replaced by a water. The process is repeated in $3$ times. What is the final quantity of wine left in the case? $29.16$ liters $36.45$ liters $16.29$ liters $45.36$ liters
asked Jan 16, 2019 in Unknown Category Applied Course 103 views
0 votes
1 answer
10
Applied Course 2019 Mock1-10
Select the pair that best expresses the relation in the original pair. ARENA: DEBATE Confess: Conceal Palate: Mouth Forum: Discussion Timely: Belated
Select the pair that best expresses the relation in the original pair. ARENA: DEBATE Confess: Conceal Palate: Mouth Forum: Discussion Timely: Belated
asked Jan 16, 2019 in Unknown Category Applied Course 106 views
0 votes
1 answer
11
Applied Course 2019 Mock1-11
The value of derivative of $f(x) = \mid x -1 \mid + \mid x -3 \mid \text{ at } x = 2$ is $-2$ $0$ $2$ Not defined
The value of derivative of $f(x) = \mid x -1 \mid + \mid x -3 \mid \text{ at } x = 2$ is $-2$ $0$ $2$ Not defined
asked Jan 16, 2019 in Unknown Category Applied Course 218 views
0 votes
1 answer
12
Applied Course 2019 Mock1-12
The number of miles that a particular car can run before its battery wears out is exponentially distributed with an average of $10,000$ miles. The owner of the car needs to take a $5000$-mile trip. What is the probability that he will be able to complete the trip without having to replace the car battery? $0.5$ $0.604$ $0.72$ None
The number of miles that a particular car can run before its battery wears out is exponentially distributed with an average of $10,000$ miles. The owner of the car needs to take a $5000$-mile trip. What is the probability that he will be able to complete the trip without having to replace the car battery? $0.5$ $0.604$ $0.72$ None
asked Jan 16, 2019 in Unknown Category Applied Course 174 views
0 votes
1 answer
13
Applied Course 2019 Mock1-13
Which of the following statement is not correct? $a^nb^nc^m$ is not CFG $a^mb^nc^n$ is deterministic CFG $a^nb^n$ is CFG $a^{800}b^{800}c^{800}$ is CFG
Which of the following statement is not correct? $a^nb^nc^m$ is not CFG $a^mb^nc^n$ is deterministic CFG $a^nb^n$ is CFG $a^{800}b^{800}c^{800}$ is CFG
asked Jan 16, 2019 in Unknown Category Applied Course 144 views
0 votes
1 answer
14
Applied Course 2019 Mock1-14
Consider the following regular expression over the alphabet $\Sigma = \{0, 1\}$ $\text{RE} =\Sigma ^* 1 \Sigma^* $ The complement of the language generated by given $\text{RE}$ is $L= \{ w \mid w \text{ contains substring 1 }$ $L=\{ w \mid w \text{ contains at least 1 }$ $L=\{ w \mid w \text{ does not contain substring 1 }$ $L=\{ w \mid w \text{ contains exactly 1}$
Consider the following regular expression over the alphabet $\Sigma = \{0, 1\}$ $\text{RE} =\Sigma ^* 1 \Sigma^* $ The complement of the language generated by given $\text{RE}$ is $L= \{ w \mid w \text{ contains substring 1 }$ $L=\{ w \mid w \text{ contains at least 1 }$ $L=\{ w \mid w \text{ does not contain substring 1 }$ $L=\{ w \mid w \text{ contains exactly 1}$
asked Jan 16, 2019 in Unknown Category Applied Course 76 views
0 votes
1 answer
15
Applied Course 2019 Mock1-15
Suppose there are $3$ jobs A, B and C arrive at approximately at the same time. But job A arrives slightly earlier than job B, and job B arrives alightly earlier than job C. Job A requires $2$ sec of CPU, Job B requires $8$ sec and job C ... sec. Given Round Robin scheduler, what is the turn around time of job B? $1$ seconds $4$ seconds $16$ seconds $17$ seconds
Suppose there are $3$ jobs A, B and C arrive at approximately at the same time. But job A arrives slightly earlier than job B, and job B arrives alightly earlier than job C. Job A requires $2$ sec of CPU, Job B requires $8$ sec and job C requires $7$ sec. Assume ... of $1$ sec. Given Round Robin scheduler, what is the turn around time of job B? $1$ seconds $4$ seconds $16$ seconds $17$ seconds
asked Jan 16, 2019 in Unknown Category Applied Course 95 views
0 votes
1 answer
16
Applied Course 2019 Mock1-16
Which phase of the compiler generates parse tree? Lexical analyzer Semantic analyzer Syntax analyzer None of them.
Which phase of the compiler generates parse tree? Lexical analyzer Semantic analyzer Syntax analyzer None of them.
asked Jan 16, 2019 in Unknown Category Applied Course 79 views
0 votes
1 answer
17
Applied Course 2019 Mock1-17
What is the output of the following c program void fun1(int *a, int *b, int *c) { *a = *b; *b = *c; *c = *a; } Void fun2(int a, int b, int c) { a = b; b = c; c = a; } int main() { int a = 5, b =10, c =15; fun1(&a, &b, &c); fun2(a, b, c); printf("%d", a+b-2*c); return 0; } $20$ $40$ $5$ $-5$
What is the output of the following c program void fun1(int *a, int *b, int *c) { *a = *b; *b = *c; *c = *a; } Void fun2(int a, int b, int c) { a = b; b = c; c = a; } int main() { int a = 5, b =10, c =15; fun1(&a, &b, &c); fun2(a, b, c); printf("%d", a+b-2*c); return 0; } $20$ $40$ $5$ $-5$
asked Jan 16, 2019 in Unknown Category Applied Course 73 views
0 votes
1 answer
18
Applied Course 2019 Mock1-18
Which of the following is an applications of a stack I. Reversal of a string. II. Checking validity of an expression containing nested parameters. III. Conversion of infix expression to postfix expression form. IV. We can't evaluate prefix expression using stack. I, II and III I and II I, II and IV I, II, III and IV
Which of the following is an applications of a stack I. Reversal of a string. II. Checking validity of an expression containing nested parameters. III. Conversion of infix expression to postfix expression form. IV. We can't evaluate prefix expression using stack. I, II and III I and II I, II and IV I, II, III and IV
asked Jan 16, 2019 in Unknown Category Applied Course 120 views
0 votes
1 answer
19
Applied Course 2019 Mock1-19
What is the total number of comparisons performed in the creation of max-heap of height $k$ using "insertion method" which involves insertion of a new element in the heap one at a time and bubble up this new node upwards till heap-property is satisfied? (Assume root at level $1$) $k2^k+2^{k-1}+2$ $k2^{k+1}-2^k+2$ $k2^k-2^{k+1}+2$ None of these
What is the total number of comparisons performed in the creation of max-heap of height $k$ using "insertion method" which involves insertion of a new element in the heap one at a time and bubble up this new node upwards till heap-property is satisfied? (Assume root at level $1$) $k2^k+2^{k-1}+2$ $k2^{k+1}-2^k+2$ $k2^k-2^{k+1}+2$ None of these
asked Jan 16, 2019 in Unknown Category Applied Course 159 views
0 votes
1 answer
20
Applied Course 2019 Mock1-20
Assuming $P \neq NP$, Which of the following statements are TRUE? There is no language in $NP$ which has a Deterministic Polynomial time algorithm. There is no language in $P$ which has a Deterministic Polynomial time algorithm. $NP$ is not a subset of $P$ $P$ is not a subset of $NP$
Assuming $P \neq NP$, Which of the following statements are TRUE? There is no language in $NP$ which has a Deterministic Polynomial time algorithm. There is no language in $P$ which has a Deterministic Polynomial time algorithm. $NP$ is not a subset of $P$ $P$ is not a subset of $NP$
asked Jan 16, 2019 in Unknown Category Applied Course 87 views
0 votes
1 answer
21
Applied Course 2019 Mock1-21
Which of the following statements is FALSE? There exists a language which is Undecidable and Turing Recognizable. There exists a language which is Decidable and Turing Recognizable. There exists a language which is both UnDecidable and not Turing Recognizable. There exists a language which is both Decidable and not Turing Recognizable.
Which of the following statements is FALSE? There exists a language which is Undecidable and Turing Recognizable. There exists a language which is Decidable and Turing Recognizable. There exists a language which is both UnDecidable and not Turing Recognizable. There exists a language which is both Decidable and not Turing Recognizable.
asked Jan 16, 2019 in Unknown Category Applied Course 96 views
0 votes
1 answer
22
Applied Course 2019 Mock1-22
Consider there are $3$ threads T1, T2 and T3. And there are $4$ locks L1, L2, L3 and L4. 1. T1 acquires and releases the locks L1 and L2. 2. T2 acquires and releases the locks L1 and L3. 3. T3 acquires and releases the locks L3, ... T1 and T2 runs concurrently to completion and then T3 runs. T1 and T3 runs concurrently to completion and then T2 runs. None of the above.
Consider there are $3$ threads T1, T2 and T3. And there are $4$ locks L1, L2, L3 and L4. 1. T1 acquires and releases the locks L1 and L2. 2. T2 acquires and releases the locks L1 and L3. 3. T3 acquires and releases the locks L3, L1 and L4. In which ... T3 runs. T1 and T2 runs concurrently to completion and then T3 runs. T1 and T3 runs concurrently to completion and then T2 runs. None of the above.
asked Jan 16, 2019 in Unknown Category Applied Course 97 views
0 votes
1 answer
23
Applied Course 2019 Mock1-23
If Danny owns a bike, then Edward owns a bike. If Edward owns a bike, then Freddy owns a bike. If Danny owns a bike, which of the following statements must be true? I. Edward owns a bike. II. Freddy owns a bike. III. Freddy does not own a bike. I only II only III only I and II only
If Danny owns a bike, then Edward owns a bike. If Edward owns a bike, then Freddy owns a bike. If Danny owns a bike, which of the following statements must be true? I. Edward owns a bike. II. Freddy owns a bike. III. Freddy does not own a bike. I only II only III only I and II only
asked Jan 16, 2019 in Unknown Category Applied Course 123 views
0 votes
1 answer
24
Applied Course 2019 Mock1-24
How many number bits are required to represent a $32$ digit decimal number in binary? $6$ bits $32$ bits $106$ bits $107$ bits
How many number bits are required to represent a $32$ digit decimal number in binary? $6$ bits $32$ bits $106$ bits $107$ bits
asked Jan 16, 2019 in Unknown Category Applied Course 117 views
0 votes
1 answer
25
Applied Course 2019 Mock1-25
What is the minimal form of the function of the given $k$-map, where $\phi$ is the don't care term? $a'b+bd+bc'$ $a'b+bd+ad+bc'$ $a'b+ad+bd$ $a'b+bc'+ad$
What is the minimal form of the function of the given $k$-map, where $\phi$ is the don't care term? $a'b+bd+bc'$ $a'b+bd+ad+bc'$ $a'b+ad+bd$ $a'b+bc'+ad$
asked Jan 16, 2019 in Unknown Category Applied Course 59 views
0 votes
1 answer
26
Applied Course 2019 Mock1-26
How many minterms exist at the output of $6$ input XOR gate? $6$ $16$ $32$ $64$
How many minterms exist at the output of $6$ input XOR gate? $6$ $16$ $32$ $64$
asked Jan 16, 2019 in Unknown Category Applied Course 106 views
1 vote
1 answer
27
Applied Course 2019 Mock1-27
Which of the following statements is/are true? B tree is faster for range search and B+ tree is faster for equality search. B tree is faster for equality search and B+ tree is faster for range search. Both B tree is and B+ tree are equally fast for equality and range search. Both B tree is and B+ tree are slow for equality and range search.
Which of the following statements is/are true? B tree is faster for range search and B+ tree is faster for equality search. B tree is faster for equality search and B+ tree is faster for range search. Both B tree is and B+ tree are equally fast for equality and range search. Both B tree is and B+ tree are slow for equality and range search.
asked Jan 16, 2019 in Unknown Category Applied Course 71 views
1 vote
2 answers
28
Applied Course 2019 Mock1-28
Consider the following Relation $\text{employee}$ ... $1$ $2$ $4$ $5$
Consider the following Relation $\text{employee}$ ... $1$ $2$ $4$ $5$
asked Jan 16, 2019 in Databases Applied Course 232 views
2 votes
1 answer
29
Applied Course 2019 Mock1-29
Consider a hypothetical $8$-bit IEEE floating point representation: $\begin{array}{|l|l|l|} \hline \text{s} & \text{exp(3bits)} & \text{frac(4 bits)} \\ \hline \end{array}$ What is the largest positive denormalized value? $\frac{1}{4}$ $\frac{31}{2}$ $\frac{15}{64}$ None of the above
Consider a hypothetical $8$-bit IEEE floating point representation: $\begin{array}{|l|l|l|} \hline \text{s} & \text{exp(3bits)} & \text{frac(4 bits)} \\ \hline \end{array}$ What is the largest positive denormalized value? $\frac{1}{4}$ $\frac{31}{2}$ $\frac{15}{64}$ None of the above
asked Jan 16, 2019 in Unknown Category Applied Course 179 views
0 votes
2 answers
30
Applied Course 2019 Mock1-30
Consider the following program code, where pow() is the exponentiation function. f (int n) { if (n <= 1) return 1; return f(n-1) + g(n) + g(pow(2, n-1)); } g (int n) { if (n <= 1) return 1; return 1 + g(n/2); } What is the worst-case time complexity of $f(n)$? $O(2^n)$ $O(n^2)$ $O(2^n \log (n))$ $O( \log ^n (n))$
Consider the following program code, where pow() is the exponentiation function. f (int n) { if (n <= 1) return 1; return f(n-1) + g(n) + g(pow(2, n-1)); } g (int n) { if (n <= 1) return 1; return 1 + g(n/2); } What is the worst-case time complexity of $f(n)$? $O(2^n)$ $O(n^2)$ $O(2^n \log (n))$ $O( \log ^n (n))$
asked Jan 16, 2019 in Unknown Category Applied Course 148 views
Page:
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...