Register
Filter

Questions by Souvik33

0 votes
1 answer
1
Data Structure | Set | IIT Kanpur Interview question
There are Insert and Retrieve_Max operations on a set {}. for n such operations what is the time complexity of the efficient algorithm possible? $n^{2}$ nlogn n logn
There are Insert and Retrieve_Max operations on a set {}. for n such operations what is the time complexity of the efficient algorithm possible?$n^{2}$nlogn n logn
0 votes
0 answers
2
GATE 2023 question
In which of the given operations, will a user level to kernel level switch, surely happen? Page Fault System Call Subroutine Call Malloc()
In which of the given operations, will a user level to kernel level switch, surely happen?Page FaultSystem CallSubroutine CallMalloc()
5 votes
2 answers
5
GATE CSE 2014 Set 2 | Question: 10 | Modified
Consider the function func shown below: int func(int num) { int count = 0; while (num) { count++; num>>= 1; } return (count); } The value returned by func(-435) is: 6 9 Will loop forever Depends on computer architecture
Consider the function func shown below: int func(int num) { int count = 0; while (num) { count++; num>>= 1; } return (count); }The value returned by func(-435) is:69Will ...
0 votes
2 answers
6
Made Easy Test Series | 3NF | True/False
A relation is in 3NF if every non-prime attribute of R is fully functionally reliant on every key of R TRUE FALSE
A relation is in 3NF if every non-prime attribute of R is fully functionally reliant on every key of RTRUEFALSE
1 votes
2 answers
7
Compiler Design | Error in which stage detection
What is the earliest stage compiler error for the following C code snippet: int x = @33; Lexical Error Syntax Error Semantic Error None
What is the earliest stage compiler error for the following C code snippet:int x = @33;Lexical ErrorSyntax ErrorSemantic ErrorNone
0 votes
1 answer
12
Set Theory, Basic | Power of a set
Given set A= {a,b}$^3$ What do the formed set look like and what is |A| (cardinility of A)
Given set A= {a,b}$^3$What do the formed set look like and what is |A| (cardinility of A)
0 votes
1 answer
16
Number Of Substrings | Made Easy Test Series
The number of subwords for w=’SCALABLE” is equal to: 34 35 37
The number of subwords for w=’SCALABLE” is equal to:343537
1 votes
1 answer
18
Dijkstra's algorithm | Negative Weight Cycle
If a -ve weight cycle is reachable from source, the Dijkstra's algorithm gets into an infinite loop TRUE FALSE
If a -ve weight cycle is reachable from source, the Dijkstra's algorithm gets into an infinite loop TRUEFALSE
Page: