What are the difference between linear and non-linear data structure?
Difference between Linear and Non-linear Data Structures
Main difference between linear and non-linear data structures lie in the way they organize data elements. In linear data structures, data elements are organized sequentially and therefore they are easy to implement in the computer’s memory. In non-linear data structures, a data element can be attached to several other data elements to represent specific relationships that exist among them. If one element can be connected to more than two adjacent element then it is known as non-linear data structure.
Write the recursive algorithm to find x^ n.
What is a Judy array?
What is a self referential structure? What is difference between Union & Structure?
What are the problems of binary tree?
Explain the improvement of performance by the use of height-balanced tree.
Explain how a height-balanced tree can be formed by inserting the following elements in the given order :
1, 2, 3, 4, 5, 6, 8, 9, 10, 7, 11
Show the root element the can be deleted from the above tree.
Explain when and why you will use PERT charts and when and why you will use Gantt charts while you are a project manager.
Consider a software project with 5 activities T1 to T5. Duration of 5 activities in weeks are 3,2,3,5,2 respectively. T2 and T4 can start when T1 is complete. T3 can start when T2 is complete. T5 can start when both T3 and T4 are complete. Draw activity network for the project. When is the latest start date of the activity T3? What is the float of the activity T4? Which activities are on the critical path? Draw the Gantt chart also.