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
Questions by sandip_1999
0
votes
0
answers
1
If case values are widely spaced, it is better to use (A) Table search (B) Jump table (C) Either jump table or simple table (D) None of the other options
can anyone help me out this plz?i want to know about jump table its an nptel assignment
221
views
asked
May 15, 2022
Compiler Design
compiler-design
target-code-generation
+
–
0
votes
0
answers
2
For pair of goto based storage allocation for functions, the second goto statement transfers control to the beginning of (A) Storage space (B) Program (C) Function code (D) None of the other options
i cannot understand this question.can anyone help me out plz? it is an nptel assignment
309
views
asked
May 15, 2022
Compiler Design
compiler-design
+
–
2
votes
0
answers
3
Why does Kruskal's algorithm find the minimum spanning tree if it's greedy? Isn't a minimum spanning tree a global optimization problem? Isn't the point of being greedy is that there is a chance you won't find the most optimal solution? So how can Kruskal be able to find the minimum spanning tree while also being greedy?
Please can anyone tell me though Prim’s and Kruskal’s algorithms are greedy algorithms. Greedy algorithms always give local optimum solutions but how Prim’s and Kru...
687
views
asked
May 11, 2022
Algorithms
kruskals-algorithm
prims-algorithm
minimum-spanning-tree
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register