Recent questions tagged test-series

Recent questions tagged test-series

0 votes

0 answers 33 views

Made Easy 2022 test series, CD-1 question
Consider the following syntax directed definition: What type of SDT is this? S-attributed L-attributed Neither Both Due to production #2 and #3, it should not be L-attributed as parent is taking value from its child. Also, as semantic rules are written anywhere in the RHS of the production, it is not S-attributed. Given answer in test series : L-attributed

Naman9495 asked in Compiler Design Sep 5

5 points

33 views

0 votes

0 answers 10 views

test series
what should be its correct option . According to me, I applied longest prefix match so interface 0 should be correct but test series mentions DEFAULT . Please explain @Arjun sir, @ Lakshman Patel RJIT please explain.. thanks in advance

rish1602 asked in Computer Networks Aug 20

9 points

10 views

0 votes

0 answers 24 views

gatebook
Let A and B be two sets such that . There is a one to one function from A to B. Which of the following must be true for S1: is onto function S2: has an inverse A) Only S1 B) Only S2 C) Both S1 and S2 D) None of the above

farmanahmed888 asked in Mathematical Logic Aug 19

by farmanahmed888

5 points

24 views

0 votes

0 answers 27 views

gatebook test series
Which of the following statements about caches is (are) true? I. A direct-mapped cache can have a lower miss rate than an associative cache of the same size (number of blocks). II. Programs with high spatial locality have a low cache miss rate primarily because the exact same ... addresses are re-referenced. A) III only B) I and III only C) II and III only D) I , II, III ALL

farmanahmed888 asked in CO & Architecture Aug 17

by farmanahmed888

5 points

27 views

0 votes

0 answers 40 views

Igate bhilai test series 2022
Which of the following options is true. A) P and R only B) Q and S only C) P, Q and R only D) R and S only

DKY123 asked in Algorithms Aug 13

by DKY123

15 points

40 views

0 votes

0 answers 29 views

Igate bhilai test series 2022
Find the difference of profit between Aamir and Salman of above problem .

DKY123 asked in Algorithms Aug 13

by DKY123

15 points

29 views

0 votes

0 answers 10 views

Igate bhilai test 2022
Correct sequence of options A) s1 only B) s1 & s2 C) s2 only D) All the these

DKY123 asked in Algorithms Aug 13

by DKY123

15 points

10 views

0 votes

0 answers 27 views

Igate bhilai test series 2022
What is the largest value of 'P 'of above problem using divide conquer methods together will take time.

DKY123 asked in Algorithms Aug 13

by DKY123

15 points

27 views

0 votes

0 answers 29 views

IGATE bhilai test series 2022
What is output of above problem using huffman coding is ____ (upto one decimal place )

DKY123 asked in Algorithms Aug 13

by DKY123

15 points

29 views

1 vote

0 answers 29 views

Applied Gate Test
A chair car compartment has 16 chairs in a row and 12 people randomly take up a chair each and the next person comes up with additional luggage which requires him to have two adjacent chairs. The probability that the 13th person is able to sit on the same row is ? A) 11/20 B) 4/7 C) 81/140 D) 17/28

Dheeraj Varma asked in Mathematical Logic Jun 26

by Dheeraj Varma

19 points

29 views

0 votes

0 answers 71 views

Applied Gate Practice Test
Consider the following counter. If the initial states of Q0(MSB) and Q1(LSB) are 0. What is the sequence Q0 Q1 given by the following diagram?

ketandalvi asked in Digital Logic Jun 13

5 points

71 views

0 votes

0 answers 33 views

Igate bhilai test gate 2022
What is the output of program? void swap (char *x, char *y) { char *t = x; x = y; y = t; } int main() { char *x = "IGATE"; char *y = "BEST IN CG"; char *t; swap(x, y); printf("(%s, %s)", x, y); t = x; x = y; y ... BEST IN CG, IGATE) (IGATE, BEST IN CG) . C: (IGATE, BEST IN CG) (IGATE, BEST IN CG). D: (BEST IN CG, IGATE) (BEST IN CG, IGATE).

DKY123 asked in Programming Jun 11

by DKY123

15 points

33 views

0 votes

0 answers 21 views

Madeeasy test series gate 2021
Consider the following C function: void f(int m) { while (m! = 0) { if(!(m &1)) printf("hello"); m = m >> 1; } } The number of times printf("hello") statement is executed, when 2048 is passed to the function ()

DKY123 asked in Programming Jun 8

by DKY123

15 points

21 views

0 votes

0 answers 24 views

Madeeasy test series gate 2021
which of the following is/are illegal after the following declaration int A[10],B[20],*C; A) A=B B) B=A C) A= C D) C=A

DKY123 asked in Programming Jun 8

by DKY123

15 points

24 views

1 vote

1 answer 43 views

Madeeasy test series gate 2022
What does the following function declare int *(*p)(char (*a) []); A)p is a pointer to a function that takes an argument as pointer and returns an integer. B) p is a pointer to a function takes an argument as pointer to a character and ... to a function that takes an argument as array of pointers to characters and returns a pointer to an integer. D) None of these.

DKY123 asked in Programming Jun 6

by DKY123

15 points

43 views

0 votes

1 answer 50 views

Madeeasy test series gate 2022
The value of k at the end of the execution of following program: int increase(int p) { int amount = 0; amount = amount +p; return(amount); } main( ) { int i, j, k; for(i = 0: i < 4; i++) { for( j = 0: j <=i; j++) { k = increase(j); } } } A) 4 B) 10 C) 20 D) 6

DKY123 asked in Programming Jun 6

by DKY123

15 points

50 views

0 votes

0 answers 30 views

Madeeasy test series gate 2022
Which rule of recursion is violated in the following code int rec(int n) { if(n == 0) return 0; else return (n + rec(n/2) +rec(n/2+ 1); } A) No base case B ) Fails to make progress C) It performs redundant work D) No violation

DKY123 asked in Programming Jun 6

by DKY123

15 points

30 views

0 votes

1 answer 37 views

ACE TEST SERIES
WHICH OF THE FOLLOWING INDICATES 8`s COMPLEMENT OF $[70700]_8$ IN SIX DIGIT? $[707100]_8$ $[007100]_8$ $[707078]_8$ $[007078]_8$

abhishek.maurya asked in Digital Logic May 3

by abhishek.maurya

5 points

37 views

0 votes

1 answer 47 views

Series solution
Series solution of $(2^k) \times 1 + (2^{k-1}) \times 2+ (2^{k-2}) \times 3+…+(2^2) \times(n-2) +2(n-1) +n?$

kishanyadav123 asked in Mathematical Logic May 2

by kishanyadav123

5 points

47 views

1 vote

0 answers 98 views

Gate Applied Course
Suppose: TLB lookup time = 20 ns TLB hit ratio = 80% Memory access time = 75 ns Swap page time = 500,000 ns 50% of the pages are dirty OS uses a single level page table What is the effective access time (EAT) if we assume the page fault rate is 10%? ... update the TLB, the page table, and the frame table (if needed) is negligible. A 15106 ns B 76000 ns C 15200 ns D 75110 ns

GopiChand asked in Operating System Feb 11

9 points

98 views

1 vote

0 answers 23 views

MADEEASY TEST SERIES
https://gateoverflow.in/3622/gate2006-it-78 with reference to the concept used in previous year question the answer for the true data dependencies in the following question should be 5 ?? but solution is given as 3... M[100<-r1 r2<-M[700] r1<-r2 / r1 r2<-r1+r2 M[500]<-r2 M[200]<-r1

eyeamgj asked in CO & Architecture Feb 9

29 points

23 views

0 votes

0 answers 40 views

ACE Test Series
What is the minimum no of states in DFA which accepts the language generated by reg exp (0*1)*1(0+1)* ?. Is this binary strings containing 1? Pls Answer.

akashks asked in Theory of Computation Feb 9

5 points

40 views

0 votes

0 answers 25 views

Made Easy Test series
find the total number of subnets available and broadcast address is given mask is 255.255.255.224 and IP is 192.168.0.102?

arshin jain asked in Computer Networks Feb 8

5 points

25 views

0 votes

0 answers 35 views

madeeasy test series
can we apply master theorm for 2T(n/2)+(n/logn) ? answer says no but as i am following extended master theorm it says we can…

eyeamgj asked in Algorithms Feb 8

29 points

35 views

0 votes

0 answers 33 views

Made easy test
In this question, it is asked to retrieve the name of each employee who has a dependent with the same first name and is the same sex as employee. How Q1 will give the correct result, coz inside IN() the condition Essn=D,Essn is not there. Can anybody explain.

Ankita87077 asked in Databases Feb 6

11 points

33 views

0 votes

0 answers 34 views

Tga test series
Why dirty read ? Here T2 was commited after the T1....what about the option c?

Enolx.21 asked in Databases Feb 5

53 points

34 views

0 votes

0 answers 52 views

Made easy test series
Consider the following table: A B C a1 b1 c1 a1 b1 c2 a2 b1 c1 a2 b1 c3 Number of non-trivial functional dependencies exists in the above Table ___________.

vikashrajpoot0100 asked in Databases Feb 4

by vikashrajpoot0100

5 points

52 views

0 votes

0 answers 59 views

Made easy test series
Number of sorting algorithms given below that has a time complexity of O(n^2) : Selection sort Merge sort Bubble sort Quick sort Answer for this should be 3, but in made easy test solution they have given answer as 4, can time complexity of merge sort be O(n^2) ??

Ankita87077 asked in Programming Feb 3

11 points

59 views

0 votes

0 answers 58 views

ACE Test Series
$A. Regular$ $B. CSL but not CFL$ $C. CFL$ $D. CSL$ Solution given is

Parth27 asked in Theory of Computation Feb 2

163 points

58 views

0 votes

0 answers 69 views

TOC Made easy
Consider the grammar consisting of seven productions. S → aA | aBB A → aaA | λ B → bB | bbC C → B After elimination of unit, useless, and λ -productions how many productions remain in the resulting grammar ? 2 3 4 5

kirtipurohit asked in Theory of Computation Feb 2

by kirtipurohit

15 points

69 views

1 vote

0 answers 66 views

Made Easy Test
How to solve it?

Parth27 asked in Compiler Design Jan 29

163 points

66 views

1 vote

0 answers 49 views

Testbook Testseries COA
Consider a hypothetical system that uses Direct Memory mode access(DMA) mode to transfer the data from the hard disk to the main memory. If the size of the DMA controller's data count register is 32 bits. A file of 1024 GB needs to transfer ... DMA controller needs to get the control of the system bus if the system is byte-addressable? Please explain, the answer was 256.

Abhipsa asked in CO & Architecture Jan 25

17 points

49 views

0 votes

0 answers 111 views

Applied Course Mock Test 7 [2021]
Q14. [Computer Architecture - Pipelining] Consider the following sequence of instructions -: $LD\ R1, 50\ (R2)\ \ //\ R1= M[R2+50]$ $ADD\ R3,\ R1,\ R4$ $LD\ R5, 100(R3)\ \ //\ R5 = M[R3+100]$ ... searched and tracked this question down to an old Northern Kentucky University Architecture course. Is this standard in GATE, or will all fields be specified separately?

pritishc asked in Others Jan 24

27 points

111 views

0 votes

0 answers 47 views

Made easy test series
Consider a cache of 2y blocks, and the main memory of 2y blocks. At what set location (y+4)th block will be mapped in 2-way set associative? In this question, it is asking about (y+4)th block of main memory, then it would be numbered (y+3) in the main memory, so it should get mapped at set location 3. But answer in made easy test is given 4. Is it correct??

Ankita87077 asked in CO & Architecture Jan 24

11 points

47 views

1 vote

1 answer 84 views

The Gate Academy Control Unit Design Test
Please explain. The answer given was 3072 B.

Abhipsa asked in CO & Architecture Jan 23

17 points

84 views

0 votes

1 answer 44 views

testbook operating system sub test 1
Consider a variable partitioning technique for allocation of memory to processes. There are currently 4 partitions of size 50 MB, 150 MB, 250 MB, and 350 MB. The smallest partition that could be denied for a total memory of 3500 MB is _____ MB. (answer in integer)

Abhipsa asked in Operating System Jan 21

17 points

44 views

0 votes

0 answers 33 views

Testbook OS subject test 2
In a certain computer, the virtual addresses are 32 bits long and the physical addresses are 48 bits long. The memory is word addressable. The page size is 16 kB and the word size is 2 bytes. The Translation Look-aside Buffer (TLB) in the ... 64 valid entries. Hit ratio of TLB is 100% then maximum number of distinct virtual addresses that can be translated is _____ K.

Abhipsa asked in Operating System Jan 21

17 points

33 views

0 votes

1 answer 48 views

Made Easy Test Series
Time complexity of an algorithm $T(n)$ where n is the input size is given by $T(n)$ =$(T(n-1)+1)/n$ if $n>1$ $T(n) = n$ otherwise $logn$ $n$ $n^2$ $n^n$

Parth27 asked in Algorithms Jan 21

163 points

48 views

0 votes

0 answers 31 views

Ace Test Series
In this functional dependency there is no transitive dependency so it will be in 3 NF but it has partial dependency. So whether it will be 2 NF or not. As 3NF must be in 2NF. This is MSQ.

Diya07 asked in Databases Jan 19

by Diya07

5 points

31 views

0 votes

0 answers 21 views

MadeEasy Test Series
Can someone explain why progress isn’t there ? If thread A execute LineNo 1 and then prempts and thread B execute LineNo1 then deadlock is pretty much possible here, and if thread A doesn”t want to access CS, how come it stop thread B from accessing it, so I think progress is guaranteed… Can somebody explain why?

FreddieMercury asked in Operating System Jan 18

by FreddieMercury

9 points

21 views

Page:

1
2
3
next »

Search GATE CSE Doubts