Sei sulla pagina 1di 1

HOMEWORK NO:2

Course Code: CAP205 Course Title: Data Structure

PART A

1. Differentiate between static memory allocation and dynamic memory allocation. Illustrate
various memory management functions

2. Differentiate between linked list and arrays in terms of representations, traversal and searching.

1. 3. Write an algorithm to delete a given node in two way link list.

PART B
1. Discuss the Concept to insert an element in the first node in Link List And also implement that
concept to insert ITEM=75 in the list where the list is as following:
33,39,45,49,58

2. Discuss the Concept to insert an element in Link List where the list is sorted . And also
implement that concept to insert ITEM=45 where the list is as following:
33,44,55,66,88,99

3. How stacks are useful in calculation of arithmetic expressions? Show step by step procedure to
convert following expression into equivalent post fix expression:
Q = (A+B* ( C / ( D/E ) ) ) - P

Potrebbero piacerti anche