To multiply two n-digit numbers, one must do normally See Answer →
Define a recurrence relation. Describe the following problems with the help of examples which can be solved through Divide and Conquer technique and Show its recurrence relation.
(i) Binary Search
(ii) Merge Sort
Solve these recurrence relations with a substitution method
(a) Solve for
by Substitution method.
(b) Solve the recurrence by using iterative approach :
See Answer →
Is a Hamiltonian graph Eulerian ? Is a Eulerian graph Hamiltonian ? Show with the help of a suitable example.
See Answer →i) Inheritance
ii) Concurrency Control
iii) Deployment Diagram
iv) Integrity Constraints
See Answer →
Draw a DFD for Online Shopping System. Make necessary assumptions.
See Answer →What is object model ? Which diagrams are used in Object model? How Object model is different from dynamic model? Explain in detail.
See Answer →What is Sequence Diagram ? Draw Sequence Diagram for cash withdrawal from an ATM system.
See Answer →What is aggregation? Example using suitable example
See Answer →Draw state chart diagram for Online Examination System. Make necessary assumptions.
See Answer →What is Use Case diagram? Draw Use Case Diagram for Online Shopping System. Make necessary assumptions.
See Answer →What is UML? What are types of UML diagrams? Draw class diagram for Online Examination System. Make necessary assumptions.
See Answer →What is OOAD? Explain advantages of Object Oriented Systems.
See Answer →Give an algorithm for topological sort. Obtain a topological ordering for the following graph:
Define fractional Knap-Sack problem, and give a greedy algorithm to solve this problem efficiently
See Answer →Discuss the relationship between class P, NP, NP complete and NP Hard problems with suitable example of each class.
See Answer →Use Prim's algorithm to construct a minimum spanning tree for the following graph. (use starting node A).
Define ambiguity in Context-Free Grammar (CFG). Prove that the following grammar is ambiguous.
See Answer →Write a Turing machine to recognize the language of all strings of even length over the alphabet {a, b}.
See Answer →Show stepwise sorting of elements using Heapsort algorithm to the following max heap
.