Register

Recent questions tagged gatebook

4 votes
3 answers
1
GateBook Test Series: Digital Logic - Boolean Algebra
What is the time complexity for checking whether an assignment of truth values to variables $x_1,\dots ,x_n$ satisfies a given formula $f(x_1\dots,x_n)$? $O(2^n)$ $O(g(n))$ where $g$ is a polynomial $O(log(n))$ None of the above
What is the time complexity for checking whether an assignment of truth values to variables $x_1,\dots ,x_n$ satisfies a given formula $f(x_1\dots,x_n)$?$O(2^n)$$O(g(n))$...
User Avatar
3 votes
1 answer
4
GB DL - Test 1 - Question 19
If decimal value of is less than that of then possible values of x and y in octal number system respectively are: (A) 11, 16 (B) 15, 9 (C) 9, 12 (D) 17, 11
If decimal value of is less than that of then possible values of x and y in octal number system respectively are:(A) 11, 16(B) 15, 9(C) 9, 12(D) 17, 11
User Avatar
1 votes
0 answers
5
GB DL - Test 1 - Question 16
The gray code for a decimal number N is . This number N is converted into P which belongs to 84 − 2 − 1 code system. What is the Hexadecimal representation for P? (A) ABC (B) F55 (C) 170 (D) 790
The gray code for a decimal number N is . This number N is converted into P which belongs to 84 − 2 − 1 code system. What is the Hexadecimal representation for P?(A) ...
User Avatar
0 votes
1 answer
6
GB DL - Test 1 - Question 7
The Gray code representation of 11710 is: (A) 1111001 (B) 1001111 (C) 1110110 (D) 1110101
The Gray code representation of 11710 is: (A) 1111001 (B) 1001111 (C) 1110110 (D) 1110101
User Avatar
0 votes
0 answers
7
Gatebook Test series ques
Answer given is Option A , but here we wil first sort the jobs in order of profit , for each value of deadline scan linearly in the array depending on the value of deadline , so it should take O(n^2) in worst case .
Answer given is Option A , but here we wil first sort the jobs in order of profit , for each value of deadline scan linearly in the array depending on the value of deadli...
User Avatar
0 votes
0 answers
9
Pipelining
Approach :
Approach :
User Avatar
0 votes
0 answers
10
Addressing
User Avatar
0 votes
0 answers
11
GB DSA-Test 4-Question 17
The number of elements that can be sorted in Θ() time using merge sort is, where n is the size of input which can be represented as some power of 2 for some positive integer k: (A) (B) (C) (D)
The number of elements that can be sorted in Θ() time using merge sort is, where n is the size of input which can be represented as some power of 2 for some positive in...
User Avatar
0 votes
0 answers
12
GB-DSA-Test 3-Question 15Consider the graph shown below:
Consider the graph shown below: Cardinality of the largest maximum independent set of the above graph is: ——?
Consider the graph shown below:Cardinality of the largest maximum independent set of the above graph is: ——?
User Avatar
2 votes
2 answers
14
GB test series
User Avatar
3 votes
2 answers
15
gatebook
How many ways are there for arranging letters of the word AMAZING such that the 'I' appears between the two 'A's? (A) 5! ways (B) 7! ways (C) 8! ways (D) 4! ways Note: AMZIA is valid and AIA is also valid right?
How many ways are there for arranging letters of the word AMAZING such that the 'I' appears between the two 'A's?(A) 5! ways(B) 7! ways(C) 8! ways(D) 4! waysNote: AMZIA i...
User Avatar
1 votes
0 answers
18
no of balanced paraenthesis
The no of different balanced parenthesizes possible with n pairs of parenthesis? A. B. C. (2n)! D. n! please explain the answer.
The no of different balanced parenthesizes possible with n pairs of parenthesis?A. B. C. (2n)!D. n!please explain the answer.
User Avatar
To see more, click for the full list of questions or popular tags.