Dark Mode

Recent questions tagged test-series

0 votes

0 answers

421

Test series
How it solve this ?

Kalpataru Bose asked in Set Theory & Algebra Dec 26, 2017

by Kalpataru Bose

318 views

1 vote

1 answer

422

test series
Arrange the following functions in asymptotically increasing order f1(n) = n0.999999 log n f2(n) = 10000000n Please explain your solution. Thanks

Tridhara Chakrabarti asked in Algorithms Dec 24, 2017

by Tridhara Chakrabarti

608 views

1 vote

1 answer

423

test series
How many DFA states are constructed for the following augmented grammar using LR(0) parser? S'->S$ S->x|(A) A->A,S|S Where S is the start symbol and S′ → S$ is augmented production. i got 11 state but ans is 10 . can you plz explain i don't know where i am wrong

92komal asked in Compiler Design Dec 24, 2017

773 views

0 votes

2 answers

424

Algo-test
Let f (n) = Ο(n), g(n) = Ο(n) and h(n) = θ(n). Then [f (n) . g(n)] + h(n) is : a) Ο(n) b)θ(n) I think it must be 0(n)

junaid ahmad asked in Algorithms Dec 24, 2017

by junaid ahmad

368 views

2 votes

2 answers

425

GateForum Test Series
Assume we have two dimensional array of size 100x100, each element is occupying 4 bytes and array is stored in row major order. Further assume RAM is 1MB and cache is 4KB with each size of 32 bytes: X: for(i = 0; i < 100; i++){ for(j = 0; j < ... of 2-way set associative cache, number of cache misses is(assume initially cache is empty) (A) 1250 (B) 2500 (C) 2400 (D) 2372

vishal chugh asked in CO and Architecture Dec 24, 2017

by vishal chugh

788 views

0 votes

2 answers

426

test series
Consider the following statements: S1 : Three-address code is a linearized representation of syntax tree. S2 : The syntax tree not depicts the natural hierarchical structure of source program. Which of the following is true? plz explain s1 statement

92komal asked in Compiler Design Dec 22, 2017

2.4k views

2 votes

2 answers

427

Nielit
I studies in my book that time complexity of buble sort in best case =n^2 but I found it here ....its wrong ? If correct then how

Harikesh Kumar asked in Algorithms Dec 13, 2017

by Harikesh Kumar

423 views

0 votes

0 answers

428

Gatebook test
Consider the following code. int a = 1; int b = 1; Function foo() { print(a); } Function bar(int x, int y){ int a = 0; foo() ; x = 0 ; b = b-y; r = Y+1; } Function foobar() { int r = 1 ; bar(r,b); print(b); print(r); ... So how will the function bar( int x,int y) access the variable 'r'?..it is local to fooBar()..i think this will throw compilation error..can anyone verify.

Tridhara Chakrabarti asked in Programming in C Dec 12, 2017

by Tridhara Chakrabarti

281 views

0 votes

1 answer

429

test-series
What is the time complexity of the following code snippet? Assume x is a global variable and “statement” takes O(n) time?

Rudra Pratap asked in Algorithms Dec 10, 2017

by Rudra Pratap

482 views

1 vote

0 answers

430

Abhijeet_Kumar asked in Databases Dec 8, 2017

by Abhijeet_Kumar

373 views

2 votes

1 answer

431

Abhijeet_Kumar asked in Databases Dec 8, 2017

by Abhijeet_Kumar

372 views

3 votes

1 answer

432

Abhijeet_Kumar asked in Databases Dec 8, 2017

by Abhijeet_Kumar

580 views

4 votes

0 answers

433

Abhijeet_Kumar asked in Databases Dec 8, 2017

by Abhijeet_Kumar

410 views

0 votes

2 answers

434

Algo:- Test series
Consider the following code: Which of the following represents the number of additions performed by above code?

rahul sharma 5 asked in Algorithms Dec 7, 2017

by rahul sharma 5

561 views

1 vote

1 answer

435

Kaluti asked in Algorithms Dec 6, 2017

by Kaluti

689 views

0 votes

1 answer

436

class test
Which of the following strings will match the linux regex a?b*? 1. (empty string) 2. b,bb,bbb.... and ab,abb,abbb...... 3. both a and b 4. acbd, acbde and acbdef

targate2018 asked in Theory of Computation Dec 5, 2017

265 views

0 votes

3 answers

437

class test
m=1; for i=1 to n do begin m=m*3; for j=1 to m do {Something which is O(1)} What is the complexity of above algorithm? 1. O(n*m3) 2. O(n3) 3. O(3n) 4. O(3m)

targate2018 asked in Algorithms Dec 5, 2017

640 views

0 votes

2 answers

438

pa-try asked in Compiler Design Dec 5, 2017

by pa-try

567 views

0 votes

2 answers

439

MadeEasy Test Series: Algorithms - Hashing
S1 :- if load factor of hash table is less than 1 then there are no collision S2:- As the size of hash table increases, the number of collisions will decrease. True false?

rahul sharma 5 asked in Algorithms Dec 4, 2017

by rahul sharma 5

1.6k views

0 votes

1 answer

440

Test Series
Please explain why first option is wrong

Diksha Aswal asked in Algorithms Dec 4, 2017

by Diksha Aswal

692 views

1 vote

1 answer

441

DFS- Depth First Search

Shubham Kumar Gupta asked in Algorithms Dec 3, 2017

by Shubham Kumar Gupta

1.1k views

4 votes

0 answers

442

How to solve test series questions?
Hi All, Here, I have seen many fellow aspirants discuss questions from their respective test series where they try to validate their answers from here but the given answers from the test series turn out to be wrong most of the time.... I'll ... because of such delusions which those test series put them into.... What is the right way to solve test series??

Namit Dhupar asked in Others Dec 1, 2017

by Namit Dhupar

412 views

1 vote

0 answers

443

MadeEasy Test Series: Databases - Transactions
Deadlock prevention(wait-kill && wound-wait) is free from both starvation as well as deadlock? True or false?

learner_geek asked in Databases Dec 1, 2017

by learner_geek

369 views

1 vote

3 answers

444

AVL tree rotations

Parshu gate asked in DS Nov 28, 2017

777 views

0 votes

1 answer

445

Database 2PL protocol
In 2PL protocol if all exclusive locks are acquired by transaction in increasing order of their accesses then is the 2PL starvation free ?

sumit chakraborty asked in Databases Nov 26, 2017

by sumit chakraborty

1.2k views

0 votes

1 answer

446

Breadth first Search

VS asked in Algorithms Nov 26, 2017

by VS

972 views

0 votes

1 answer

447

self doubt
in 1 first part answer is d? in 2nd part i have doubt regarding c==>4. is it synthesised attribute?

arch asked in Compiler Design Nov 20, 2017

by arch

423 views

2 votes

1 answer

448

Test series
T(n)= T(n-1) + log n Ans theta( n log n) Facing problem while solving.. Tell me the valid source also to practice and learn .

Chirag arora asked in Algorithms Nov 19, 2017

by Chirag arora

295 views

0 votes

1 answer

449

Backtracking
Here , Number of backtracks are 3 or 4 ? I am getting 3 but given answer is 4. Please explain.

ankitgupta.1729 asked in Compiler Design Nov 18, 2017

by ankitgupta.1729

388 views

0 votes

1 answer

450

TestSeries
Can Bfs be applied for topological sort?

shreyansh jain asked in Algorithms Nov 16, 2017

by shreyansh jain

500 views

Page:

« prev
1
...
10
11
12
13
14
15
16
17
18
19
20
...
29
next »

Recent questions tagged test-series