Register

Recent questions tagged ace-test-series

2 votes
2 answers
181
Left recursion
In this question should we eliminate left recursion by putting values of S and A in the respective productions so answer will be c but if according to the given production than answer will be a how to solve?
In this question should we eliminate left recursion by putting values of S and A in the respective productions so answer will be c but if according to the given productio...
User Avatar
0 votes
1 answer
185
Ace Test Series: Programming - Basic Concept
They have given answer B , but after running this program getting runtime error. Please explain
They have given answer B , but after running this program getting runtime error. Please explain
User Avatar
0 votes
0 answers
187
Test Series
Maximun number of nodes in the derivation tree when a word of lenght $2^k$ is derived from a gramar in CNF? My answer was ($2^{k+1}$)-1. But the answer given is 3* $2^k$ -1. Please someone explain
Maximun number of nodes in the derivation tree when a word of lenght $2^k$ is derived from a gramar in CNF? My answer was ($2^{k+1}$)-1. But the answer given is 3* $2^k$...
User Avatar
0 votes
1 answer
190
Ace Test Series: CO & Architecture - RISC Properties
Is the statement true or false; "RISC type processor is designed with minimum number of processing registers" ?
Is the statement true or false; "RISC type processor is designed with minimum number of processing registers" ?
User Avatar
0 votes
3 answers
191
Ace Test Series: Algorithms - Time Complexity & Array
An array $'A'$ has $n$ distinct integers. What is the tightest time complexity to check $A[i]=i$ for some $i$. Consider all elements of array within range from $1$ to $n$. $O(n^2) $ $O(1)$ $O(n)$ $O(logn)$
An array $'A'$ has $n$ distinct integers. What is the tightest time complexity to check $A[i]=i$ for some $i$. Consider all elements of array within range from $1$ to $n$...
User Avatar
0 votes
1 answer
192
test_series
i think answer must be O(1) , as whether n is power of 2 or not,result of if condition is always true
i think answer must be O(1) , as whether n is power of 2 or not,result of if condition is always true
User Avatar
1 votes
1 answer
193
TEST_SERIES
ANSWER IS CORRECT BU I HAVE DOUBT IN A -> .Ab, a/b I think it must be A -> .Ab ,a
ANSWER IS CORRECT BU I HAVE DOUBT IN A - .Ab, a/bI think it must be A - .Ab ,a
User Avatar
3 votes
3 answers
196
Ace Test Series: Graph Theory - Number Of Spanning Trees
How to approach such questions ? Please provide detailed solution. Answer given is option C
How to approach such questions ? Please provide detailed solution. Answer given is option C
User Avatar
0 votes
0 answers
197
Ace Test Series: Computer Networks - Network Security
If p is any prime number such that a p-1 =r (mod p) and p=3 , a=6 then value of r is ________________
If p is any prime number such that a p-1 =r (mod p) and p=3 , a=6 then value of r is ________________
User Avatar
3 votes
0 answers
203
Ace Test Series: Programming - Pointers And Character
Answer given is option C. How ? I gather that the character pointer will point to the first byte of the integer whose value is 255. But after that what should be the solution ?
Answer given is option C. How ?I gather that the character pointer will point to the first byte of the integer whose value is 255.But after that what should be the soluti...
User Avatar
3 votes
1 answer
204
Ace Test Series: DBMS - ER Diagram To Relational Table
Answer given is 3 But my answer is 2 . I have combined the Department and Project relation since the participation of Project was total. please someone explain why can't we combine Department and Project.
Answer given is 3But my answer is 2 . I have combined the Department and Project relation since the participation of Project was total.please someone explain why can't we...
User Avatar
0 votes
0 answers
205
test series
User Avatar
1 votes
1 answer
208
Ace Test Series: CO & Architecture - Cache Memory Tag
The answer was given as 22 bits. I didn't get their method of solving this question. Kindly explain the solution. I even doubt their answer.
The answer was given as 22 bits. I didn't get their method of solving this question. Kindly explain the solution. I even doubt their answer.
User Avatar
Page: