Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Ashwani
0
answers
1
Gate-2019
ER- no of tables?
ER- no of tables?
644
views
commented
Jan 10, 2019
Databases
databases
+
–
1
answer
2
MadeEasy Test Series: Algorithms - Dynamic Programming
Consider two Person (Person X, Person Y). Person X who was given a problem to calculate A1 A2 A3 with dimension 3 100, 100 2 and 2 2 in minimum multiplication. Person X is the knows only ... Y solved the same problem using Dynamic algorithm with M2multiplications. How many number of multiplications saved by Person Y than Person X?
Consider two Person (Person X, Person Y). Person X who was given a problem to calculate A1 × A2 × A3 with dimension 3 × 100, 100 × 2 and 2 × 2 in minimum multiplicat...
913
views
commented
Jan 10, 2019
Algorithms
made-easy-test-series
algorithms
dynamic-programming
+
–
2
answers
3
MadeEasy Test Series: CO & Architecture - Pipelining
here why to take stall at the highlighted cell as its OPERAND FORWARDING and unless mentioned its EX-EX and its being followed without stall also, please clarify how to understand where Operand Forwarding is to be applied in such generalized cases., Thanks in advance :)
here why to take stall at the highlighted cell as its OPERAND FORWARDING and unless mentioned its EX-EX and its being followed without stall also, please clarify how to u...
974
views
commented
Jan 2, 2019
CO and Architecture
co-and-architecture
pipelining
made-easy-test-series
operand-forwarding
+
–
1
answer
4
Complement of a language which is recursively enumerable but not recursive
What is the complement of a language which is recursively enumerable but not recursive? Is it only non rel or can be both both non rel and recursive?
What is the complement of a language which is recursively enumerable but not recursive? Is it only non rel or can be both both non rel and recursive?
2.0k
views
answered
Dec 25, 2018
0
answers
5
Breadth first Search
Which of following statement is true ? A. In BFS of UDG there are no back edges and forward edges. B. In BFS of Directed Graph there is no back edge and forward edges. C. In BFS of UDG for each back edge(u,v) we have 0<= v.d <= u.d D. Both b and c. Ans. A
Which of following statement is true ?A. In BFS of UDG there are no back edges and forward edges.B. In BFS of Directed Graph there is no back edge and forward edges.C. In...
3.9k
views
commented
Dec 25, 2018
DS
breadth-first-search
data-structures
graph-algorithms
+
–
0
answers
6
Heap Smallest Element
My question is in Question like find 5th Smallest element in a heap: It requires O(logn) time if we do only Delete operation 5 Times.But what if the array contains no 5th smallest element say our array contain [1,1,1,1,1,1,1,1,1,1] now ... need to do extract min operation n number of times which would give nlogn time? Plz Clear my doubt https://gateoverflow.in/1110/gate2003-23
My question is in Question like find 5th Smallest element in a heap:It requires O(logn) time if we do only Delete operation 5 Times.But what if the array contains no 5th ...
800
views
commented
Feb 17, 2018
Algorithms
binary-heap
algorithms
+
–
6
answers
7
GATE CSE 1998 | Question: 2.12
What value would the following function return for the input $x=95$? Function fun (x:integer):integer; Begin If x > 100 then fun = x – 10 Else fun = fun(fun (x+11)) End; $89$ $90$ $91$ $92$
What value would the following function return for the input $x=95$?Function fun (x:integer):integer; Begin If x 100 then fun = x – 10 Else fun = fun(fun (x+11)) End;$...
13.9k
views
answered
Feb 16, 2018
Algorithms
gate1998
algorithms
recursion
identify-function
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register