Register
Filter

Recent questions without answers

0 votes
0 answers
8101
algo graph questions
AB min value 10 is answer wrong here??
AB min value 10 is answer wrong here??
User Avatar
0 votes
0 answers
8102
operating system question
I think answer given is wrong ,please have a look
I think answer given is wrong ,please have a look
User Avatar
0 votes
0 answers
8103
Karumanchi
f(n)=$2^n$ g(n)=n! h(n)=$n^{logn}$ which one is true? A) f(n)=O(g(n)) and g(n)=O(h(n)) B) f(n)=$\Omega(g(n)))$ and g(n)=O(h(n)) C) g(n)=O(f(n)) and h(n)=O(f(n)) D) h(n)=O(f(n)) and g(n)=$\Omega(f(n))$
f(n)=$2^n$g(n)=n!h(n)=$n^{logn}$ which one is true?A) f(n)=O(g(n)) and g(n)=O(h(n))B) f(n)=$\Omega(g(n)))$ and g(n)=O(h(n))C) g(n)=O(f(n)) and h(n)=O(f(n))D) h(n)=O(f(n))...
User Avatar
0 votes
0 answers
8104
Rank of the index
Consider the following What is the rank(index) of the node $50?$
Consider the followingWhat is the rank(index) of the node $50?$
User Avatar
0 votes
0 answers
8105
TOC Self doubt
State true/false:- 1.if L is CSL, then L' is not regular 2.if L is RE, then L' is maybe regular give reason.
State true/false:-1.if L is CSL, then L' is not regular2.if L is RE, then L' is maybe regulargive reason.
User Avatar
0 votes
0 answers
8106
divide and conquer
The runtime of a divide-and-conquer algorithm is described by the following recurrence: T(n) = 4T(n/2) + O(1). How many subproblems will we have at the 6th level of recursion if the top level is considered to be the 0th level________? what does mean by branching factor in this????
The runtime of a divide-and-conquer algorithm is described by the following recurrence: T(n) = 4T(n/2) + O(1). How many subproblems will we have at the 6th level of recur...
User Avatar
1 votes
0 answers
8107
Testseries
Correct answer is A
Correct answer is A
User Avatar
1 votes
0 answers
8108
#Self Doubt
In definition of transitive dependency we use conditions as A → B It is not the case that B → A B → C I am not able to understand why we need condition 2 for this ?
In definition of transitive dependency we use conditions as A → BIt is not the case that B → AB → C I am not able to understand why we need condition 2 for this ?
User Avatar
0 votes
0 answers
8109
Test Series
Can anyone please explain
Can anyone please explain
User Avatar
0 votes
0 answers
8111
SELF DOUBT
https://gateoverflow.in/80571/gate1987-1-xxvi A CAN BE ALSO ANSWER?
https://gateoverflow.in/80571/gate1987-1-xxviA CAN BE ALSO ANSWER?
User Avatar
0 votes
0 answers
8113
FLOATING POINT
https://gateoverflow.in/80201/gate1987-1-vii NOT GETTING ITS ANSWER .......
https://gateoverflow.in/80201/gate1987-1-viiNOT GETTING ITS ANSWER .......
User Avatar
0 votes
0 answers
8115
self doubt
Best book for probability in gate point of view. variety of question should be in this book. and the question should be gate type. please reply fast. thank you
Best book for probability in gate point of view.variety of question should be in this book.and the question should be gate type.please reply fast.thank you
User Avatar
0 votes
0 answers
8116
ACE Test Series
please help me to solve this
please help me to solve this
User Avatar
0 votes
0 answers
8117
Self Doubt
What is inbound and outbound packets? And How they are linked with Stateless and Statefull firewall..?
What is inbound and outbound packets? And How they are linked with Stateless and Statefull firewall..?
User Avatar
0 votes
0 answers
8119
SudoGate Test Series - Virtual Memory
A computer system has TLB access time = 30 ns and the main memory access time is 150 ns and if the miss rate is 20 % the calculate the effective memory access time if 3 level of paging is applied. i am getting 270 ns
A computer system has TLB access time = 30 ns and the main memory access time is 150 ns and if the miss rate is 20 % the calculate the effective memory access time if 3 l...
User Avatar
0 votes
0 answers
8120
Self doubt
No of PRIME IMPLICANTS ??
No of PRIME IMPLICANTS ??
User Avatar
1 votes
0 answers
8122
Asymptotic Notation
Please explain 2nd line complexity.
Please explain 2nd line complexity.
User Avatar
5 votes
0 answers
8123
Spanning Tree
Calculate the number of Spanning trees possible for each of these graphs
Calculate the number of Spanning trees possible for each of these graphs
User Avatar
0 votes
0 answers
8124
discrete maths
User Avatar
0 votes
0 answers
8125
self doubt
when an nfa is converted to dfa, is obtained dfa always minimal?
when an nfa is converted to dfa, is obtained dfa always minimal?
User Avatar
0 votes
0 answers
8126
Self Doubt
If you do every problem in this book, then you will learn discrete mathematics. You learned discrete mathematics. Therefore, you did every problem in this book. The above argument is A Valid and Satisfiable B Valid but not satisfiable C Invalid D Tautology
If you do every problem in this book, then you will learn discrete mathematics. You learned discrete mathematics. Therefore, you did every problem in this book.The above ...
User Avatar
0 votes
0 answers
8128
Test series
User Avatar
1 votes
0 answers
8129
Ace test series
Why the ans is 253 and not 254???????Please help???
Why the ans is 253 and not 254???????Please help???
User Avatar
0 votes
0 answers
8130
Ace volume 1 compiler design
Consider the grammar S-> if expr then | if expr then stmt | If expr then stmt else | if expr then stmt else stmt The grammar is a) LL(1 ) b)LL(4) c ) LL(5) d) LL(6)
Consider the grammar S- if expr then | if expr then stmt | If expr then stmt else | if expr then stmt else stmtThe grammar is a) LL(1 )b)LL(4)c ) LL(5)d) ...
User Avatar
Page: