Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
No answer
No selected answer
No upvoted answer
Previous GATE
Featured
Recent questions without answers
0
votes
0
answers
4111
PIPELINING.
How to find number of stall cycles and branch penalty & CPI in a branched instruction pipelining?
How to find number of stall cycles and branch penalty & CPI in a branched instruction pipelining?
Ritabrata Dey
390
views
Ritabrata Dey
asked
May 21, 2019
CO and Architecture
co-and-architecture
pipelining
stall
+
–
1
votes
0
answers
4112
GEEKSFORGEEKS ALGO
What does it mean when we say that an algorithm X is asymptotically more efficient than Y? (A) X will be a better choice for all inputs (B) X will be a better choice for all inputs except small inputs (C) X will be a better choice for all inputs except large ... is it always the case?? At some points it might be true but I do not think this is the case for each and every input..
What does it mean when we say that an algorithm X is asymptotically more efficient than Y?(A) X will be a better choice for all inputs(B) X will be a better choice for al...
Hirak
7.4k
views
Hirak
asked
May 20, 2019
Algorithms
algorithms
+
–
1
votes
0
answers
4113
Recurrence Relation-Self Doubt(Discrete Math+Algo)
Let $A(n)$ denotes the number of $n$ bit binary strings which have no pair of consecutive $1’s.$ what will be recurrence relation for it and what will be it’s Time Complexity??
Let $A(n)$ denotes the number of $n$ bit binary strings which have no pair of consecutive $1’s.$ what will be recurrence relation for it and what will be it’s Time Co...
srestha
596
views
srestha
asked
May 19, 2019
Algorithms
algorithms
recurrence-relation
time-complexity
+
–
0
votes
0
answers
4114
Self Doubt:Operating System-Threads
User level threads doesnot require context switching- This is a true statement (Because OS cannot recognize user level threads) Can somebody elaborate more on it?? This given answer is wrong I think:https://gateoverflow.in/290648/made_easy_test_series Plz check
User level threads doesnot require context switching- This is a true statement (Because OS cannot recognize user level threads)Can somebody elaborate more on it??This giv...
srestha
621
views
srestha
asked
May 19, 2019
Operating System
operating-system
threads
+
–
0
votes
0
answers
4115
jnu mtech 2016- 47
Which of the following is not true about Turing machine? (a) It can accept any palindrome (b) It can accept any context free language (c) It can accept {a^m b^n c^mn:m,n>=0 (d) One tape Turing machine can be converted into C++ programs
Which of the following is not true about Turing machine?(a) It can accept any palindrome(b) It can accept any context free language(c) It can accept {a^m b^n c^mn:m,n>=0(...
MonikaV
228
views
MonikaV
asked
May 19, 2019
1
votes
0
answers
4116
IIIT-H INTERVIEW
Why does OS and DBMS have their own synchronisation mechanisms, when OS can alone do it and it sits at the bottom of DB?
Why does OS and DBMS have their own synchronisation mechanisms, when OS can alone do it and it sits at the bottom of DB?
shraddha priya
1.1k
views
shraddha priya
asked
May 18, 2019
Databases
iiith-pgee
interview
mtech
+
–
0
votes
0
answers
4117
Admission through ccmt
In second round of ccmt i got nit warangal cs-is and if i float again for third round i can get nit surathakal cs ,so for third round should i float or internal sliding for cs of warangal ??please help
In second round of ccmt i got nit warangal cs-is and if i float again for third round i can get nit surathakal cs ,so for third round should i float or internal sliding f...
Prateek Raghuvanshi
1.1k
views
Prateek Raghuvanshi
asked
May 18, 2019
NITs
admissions
nit
+
–
1
votes
0
answers
4118
Self Doubt:Mathematical Logic
Represent these two statement in first order logic: $A)$ Only Alligators eat humans $B)$ Every Alligator eats humans Is Every represents $\equiv \exists$ and Only represents $\equiv \forall$ ?? Can we differentiate it with verb ‘eat’ and ‘eats’??
Represent these two statement in first order logic:$A)$ Only Alligators eat humans$B)$ Every Alligator eats humansIs Every represents $\equiv \exists$and Only represents ...
srestha
529
views
srestha
asked
May 18, 2019
Mathematical Logic
discrete-mathematics
mathematical-logic
first-order-logic
+
–
1
votes
0
answers
4119
Made Easy Test Series: Algorithm-Reverse Polish Notation
Consider the new-order strategy for traversing a binary tree: Visit the root Visit the right subtree using new-order Visit the left subtree using new-order The new-order traversal of expression tree corresponding to the reverse polish expression 3 4 * 5 – 2 ^ 6 7 * 1 + – What will be expression, any procedure for it??
Consider the new-order strategy for traversing a binary tree:Visit the rootVisit the right subtree using new-orderVisit the left subtree using new-orderThe new-order trav...
srestha
578
views
srestha
asked
May 16, 2019
Compiler Design
infix-prefix
algorithms
time-complexity
+
–
2
votes
0
answers
4120
Made Easy Test Series:Compiler Design-CLR parser
$S\rightarrow aA|bAc|dc$ $A\rightarrow d$ Number of states in $CLR\left ( 1 \right )$ parser construction _______________ Is $S\rightarrow d.c|$ $A\rightarrow d.,a$ will be in $1$ state or in $2$ different states??
$S\rightarrow aA|bAc|dc$$A\rightarrow d$Number of states in $CLR\left ( 1 \right )$ parser construction _______________Is$S\rightarrow d.c|$$$A\rightarrow d.,a$will be in...
srestha
1.9k
views
srestha
asked
May 15, 2019
Compiler Design
compiler-design
made-easy-test-series
+
–
0
votes
0
answers
4121
Discrete Mathematics by Kenneth Rosen,section2.4,recursive functions
$C_{a}^{k}:\mathbb{N}^{k}\rightarrow \mathbb{N}$ I am studying discrete math from beginnings and came across this term in primitive recursive function.I don't know what $C_{a}^{k}$ means and does $\mathbb{N}$ means set of natural numbers?Someone please help me out.
$C_{a}^{k}:\mathbb{N}^{k}\rightarrow \mathbb{N}$I am studying discrete math from beginnings and came across this term in primitive recursive function.I don't know what $C...
souren
396
views
souren
asked
May 15, 2019
Set Theory & Algebra
discrete-mathematics
set-theory&algebra
kenneth-rosen
+
–
1
votes
0
answers
4122
Made Easy Test Series: Computer Network-Dijkstra Algo
Consider Dijkstra's algorithm in linked state routing protocol at node $u.$ Professor Ram first sets the route for each directly connected node $v.$ to be the link connecting $u$ to $v.$ Ram then implements the rest of the algorithm ... costs where all routing table entry will be correct. $D)$ Both $A)$ and $B)$ How Dijkstra working here?
Consider Dijkstra’s algorithm in linked state routing protocol at node $u.$ Professor Ram first sets the route for each directly connected node $v.$ to be the link conn...
srestha
677
views
srestha
asked
May 14, 2019
Computer Networks
computer-networks
made-easy-test-series
+
–
0
votes
0
answers
4123
Rosen 7e Exercise 8.2 Questionno-26 page no-525 Recurrence Relation
What is the general form of the particular solution guaranteed to exist of the linear nonhomogeneous recurrence relation $a_n$=$6a_{n-1}$-$12a_{n-2}$+$8a_{n-3}$+F(n) if F(n)=$n^2$ F(n)=$2^n$ F(n)=$n2^n$ F(n)=$(-2)^n$ F(n)=$n^22^n$ F(n)=$n^3(-2)^n$ F(n)=3
What is the general form of the particular solution guaranteed to exist of the linear nonhomogeneous recurrence relation$a_n$=$6a_{n-1}$-$12a_{n-2}$+$8a_{n-3}$+F(n) ifF(n...
aditi19
544
views
aditi19
asked
May 14, 2019
Combinatory
kenneth-rosen
discrete-mathematics
recurrence-relation
+
–
0
votes
0
answers
4124
Rosen 7e Exercise-8.2 Question no-23 page no-525 Recurrence Relation
Consider the nonhomogeneous linear recurrence relation $a_n$=$3a_{n-1}$+$2^n$ in the book solution is given $a_n$=$-2^{n+1}$ but I’m getting $a_n$=$3^{n+1}-2^{n+1}$
Consider the nonhomogeneous linear recurrence relation $a_n$=$3a_{n-1}$+$2^n$in the book solution is given $a_n$=$-2^{n+1}$but I’m getting $a_n$=$3^{n+1}-2^{n+1}$
aditi19
630
views
aditi19
asked
May 13, 2019
Combinatory
kenneth-rosen
discrete-mathematics
recurrence-relation
+
–
0
votes
0
answers
4125
set associative (carl hamacher)
Block set associative cache consists of a total of 64blocks divided into 4blocks sets .The main memory contains 4096blocks ,each consisting of 128 words. how many bits for Main memory how many bits for TAG,SET,WORD . solution: MM=block size*words 2^12 * 2^7=19 bits TAG=9 SET=4 WORD=6 is this correct method or not please correct me
Block set associative cache consists of a total of 64blocks divided into 4blocks sets .The main memory contains 4096blocks ,each consisting of 128 words.how many bits for...
altamash
460
views
altamash
asked
May 13, 2019
CO and Architecture
co-and-architecture
cache-memory
+
–
0
votes
0
answers
4126
Bits hd 2018 operating system
Which of this is allowed by multiprogramming not by multitasking? A) New to ready B)Ready to Running C) Waiting to running D) Running to Waiting
Which of this is allowed by multiprogramming not by multitasking?A) New to readyB)Ready to RunningC) Waiting to runningD) Running to Waiting
Winner
570
views
Winner
asked
May 12, 2019
Operating System
bits
+
–
1
votes
0
answers
4127
First set and follow set self-doubt
why do first sets can have epsilon symbol but follow sets don’t? P.S: I’ve a silly doubt :P
why do first sets can have epsilon symbol but follow sets don’t?P.S: I’ve a silly doubt :P
aditi19
1.6k
views
aditi19
asked
May 12, 2019
Compiler Design
compiler-design
parsing
first-and-follow
+
–
1
votes
0
answers
4128
ISI2018-PCB-A3
Let $n,r\ $and$\ s$ be positive integers, each greater than $2$.Prove that $n^r-1$ divides $n^s-1$ if and only if $r$ divides $s$.
Let $n,r\ $and$\ s$ be positive integers, each greater than $2$.Prove that $n^r-1$ divides $n^s-1$ if and only if $r$ divides $s$.
akash.dinkar12
430
views
akash.dinkar12
asked
May 12, 2019
Quantitative Aptitude
isi2018-pcb-a
general-aptitude
quantitative-aptitude
descriptive
+
–
0
votes
0
answers
4129
#algorithms #recurrence-relation
T(n)=T(√n) + n I am finding it difficult to solve last step of this recurrence relation . Please help me with expansion of this recurrence relation.
T(n)=T(√n) + n I am finding it difficult to solve last step of this recurrence relation . Please help me with expansion of this recurrence relation.
aniketpatil32
215
views
aniketpatil32
asked
May 11, 2019
Algorithms
algorithms
recurrence-relation
+
–
0
votes
0
answers
4130
Rosen 7e Exercise-9.6 Question no-27 page no-631
What is the covering relation of the partial ordering {(A, B) | A ⊆ B} on the power set of S, where S = {a, b, c}? i'm getting R={(Ф, {a}), (Ф, {b}), (Ф, {c}), (Ф, {a, b}), (Ф, {b, c}), (Ф, {a, c}), (Ф, {a, b, c}), ({a}, {a, b}), ({a}, {a, c}), ({b}, ... b, c}), ({c}, {a, c}), ({c}, {b, c}), ({a, b}, {a, b, c}), ({a, c}, {a, b, c})({b, c}, {a, b, c})
What is the covering relation of the partial ordering {(A, B) | A ⊆ B} on the power set of S, where S = {a, b, c}?i’m gettingR={(Ф, {a}), (Ф, {b}), (Ф, {c}), (Ф, ...
aditi19
638
views
aditi19
asked
May 10, 2019
Set Theory & Algebra
kenneth-rosen
discrete-mathematics
relations
set-theory&algebra
set-theory
+
–
1
votes
0
answers
4131
Made Easy Test Series : Programming Test4
Consider the following C code: int getNextGap(int gap){ gap=(gap*10)/13; if(gap<1)return 1; return gap; } void mystery(int a[ ],int n){ int gap=n; bool red=true; while(gap!=1||red==true){ gap=getNextGap(gap); red ... elements, then what output will print at last? I mostly stuck how bool function working here. Plz help me out, how program executing:(
Consider the following C code:int getNextGap(int gap){ gap=(gap*10)/13; if(gap<1)return 1; return gap; } void mystery(int a[ ],int n){ int gap=n; bool red=true; while(gap...
srestha
942
views
srestha
asked
May 10, 2019
Programming in C
made-easy-test-series
programming
programming-in-c
+
–
0
votes
0
answers
4132
What would be the upper and lower bound for this decreasing function or invalid case? #Algorithm #Asymtotic-notations
aniketpatil32
461
views
aniketpatil32
asked
May 10, 2019
Algorithms
algorithms
asymptotic-notation
+
–
2
votes
0
answers
4133
GO screening test
Which one of the following notations is most relevant for finding the best algorithm for a problem? (A) $o(f(n))$ (B) $O(f(n))$ (C) $\omega (f(n))$ (D) $ \Omega (f(n))$
Which one of the following notations is most relevant for finding the best algorithm for a problem?(A) $o(f(n))$(B) $O(f(n))$(C) $\omega (f(n))$(D) $ \Omega (f(n))$
toxicdesire
866
views
toxicdesire
asked
May 9, 2019
Algorithms
time-complexity
algorithms
go-screening-test
+
–
1
votes
0
answers
4134
NPTEL: OS
Hirak
726
views
Hirak
asked
May 9, 2019
Operating System
operating-system
nptel-quiz
+
–
2
votes
0
answers
4135
Vani Question Bank:Operating System
Hirak
256
views
Hirak
asked
May 9, 2019
Operating System
operating-system
page-replacement
page-fault
paging
+
–
0
votes
0
answers
4136
Operating system swapping process
Please help me explaining this in simpler words: If we were to swap out process P1 and swap in process P2, the I/O operation might then attempt to use memory that now belongs to process P2. There are two main solutions to this ... system buffers and process memory then occur only when the process is swapped in. Note that this double buffering itself adds overhead.
Please help me explaining this in simpler words:If we were to swap out process P1 and swap in process P2, theI/O operation might then attempt to use memory that now belon...
manisha11
778
views
manisha11
asked
May 9, 2019
Operating System
operating-system
process-scheduling
+
–
1
votes
0
answers
4137
Made Easy Test Series:Programming Test4-Function Call
Consider the following function int fun(int a[ ],int l, int target){ int i=0,j=0,sum=0,count=0; while(j<l){ if(sum<target){ sum=sum+a[j]; j++; } else if(sum>target){ sum=sum-a[i]; i++; } else{ count++; sum= ... call $fun\left ( a,16,8 \right )=$_______________ Given ans $6,$ but I got $4.$ Which one correct?? Any shortcut to evaluate??
Consider the following function int fun(int a[ ],int l, int target){ int i=0,j=0,sum=0,count=0; while(j<l){ if(sum<target){ sum=sum+a[j]; j++; } else if(sum>target){ sum=...
srestha
881
views
srestha
asked
May 8, 2019
Programming in C
made-easy-test-series
programming
programming-in-c
+
–
0
votes
0
answers
4138
sequential logic Morris Mano
design a counter with the following binary sequence:0,4,2,1,6 and repeat use JK flip-flop
design a counter with the following binary sequence:0,4,2,1,6 and repeat use JK flip-flop
altamash
280
views
altamash
asked
May 8, 2019
0
votes
0
answers
4139
Molina Exercise-6.3.1 Question no-f Page no-280 SQL
Product(maker, model, type) PC(model, speed, ram, hd, price) Laptop(model, speed, ram, hd, screen, price) Printer(model, color, type, price) Find the maker(s) of the PC(s) with the fastest processor among all those PC 's that have the ... p where p.speed IN( select max(p1.speed) from PC p1 where p1.ram IN( select MIN(p2.ram) from PC p2)))
Product(maker, model, type)PC(model, speed, ram, hd, price)Laptop(model, speed, ram, hd, screen, price)Printer(model, color, type, price)Find the maker(s) of the PC(s) wi...
aditi19
926
views
aditi19
asked
May 8, 2019
Databases
ullman
databases
sql
query
+
–
0
votes
0
answers
4140
Natural Join Self Doubt
how to write the query for natural join on three relations in SQL using the NATURAL JOIN clause?
how to write the query for natural join on three relations in SQL using the NATURAL JOIN clause?
aditi19
780
views
aditi19
asked
May 8, 2019
Databases
natural-join
databases
sql
+
–
Page:
« prev
1
...
133
134
135
136
137
138
139
140
141
142
143
...
590
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register