Lovely Professional University 2010 B.Tech Computer Science and Engineering Assignment -2 Data structures and algorithm - Question Paper
Friday, 25 January 2013 03:00Web
Page 1 of 2
PART: A
Q1: How the concept of pointers is useful in the implementation of data structures? discuss.
Q2: what are the concept of “Fixed block storage allocation” and “Buddy system” in dynamic memory management.
Q3: explain the usage of pointer by taking suitable examples.
PART: B
Q4: elaborate the different memory management functions? what are with examples.
Q5: How debugging pointers are beneficial in data structures?
Q6: With any example implement the searching and Insertion in linked list. Department of Computer Science & Engineering LHST
Department of Computer Science & Engineering LHST
Data Structures and Algorithms
Assignment - 2 Class : A1805
Date of Allotment : 5th March 2010
Date of Submission : 15th March 2010 Date of Test : 17th March 2010
PART: A
Q1: How the concept of pointers is useful in the implementation of data structures? Explain.
Q2: Elaborate the concept of Fixed block storage allocation and Buddy system in dynamic memory management. Q3: Discuss the usage of pointer by taking suitable examples.
PART: B
Q4: What are the various memory management functions? Elaborate with examples. Q5: How debugging pointers are beneficial in data structures?
Q6: With any example implement the searching and Insertion in linked list.
*********
|
Attachment: |
| Earning: Approval pending. |
