CS8391 Question Paper Data Structures
CS8391 Question Paper Data Structures Regulation 2017 Anna University free download. Data Structures Previous year Question Paper CS8391 pdf free download.
Previous Year CS8391 Question Paper Data Structures:
9List out the advantage of circular linked list.
BTL-1 Previous year CS8391 Question Paper Data Structures
Remember
10Binary search cannot be performed on a linked list. Examine.
BTL-3
Apply
11Discuss the advantages and disadvantages of linked lists and arrays.
BTL-2 Previous year CS8391 Question Paper Data Structures
Understand
12Give an example for linked list application.
BTL-2
Understand
13Specify the use of Header node in a linked list.
BTL-6
Create
14Illustrate the use of linked list with an example.
BTL-3
Apply
15Show the ways in which list ADT can be implemented.
BTL-3 Previous year CS8391 Question Paper Data Structures
Apply
16Differentiate arrays and linked lists.
BTL-2
Understand
17Analyze and write a find routine in array implementation.
BTL-4
Analyze
18Analyze and write the array representation of a polynomial:
p(x) = 4×3+6×2+7x+9
19Should arrays or linked lists be used for the following types of applications? Support your justification.
1. Many search operations in sorted list. Previous year CS8391 QP Data Structures
2. Many search operations in Unsorted list.
BTL-5
Evaluate
20Develop an algorithm for insertion operation in a singly linked list.
1Describe the following:
i. Applications of lists. (5)
ii. Polynomial manipulation. (8)
BTL-1
Remember
2i. What is a linked list? (2)
ii. Describe the suitable routine segments for any four operations. (11)
BTL-1 Previous year CS8391 Question Paper Data Structures
Remember
| Subject name | Data Structures |
| Semester | 3 |
| Subject Code | CS8391 |
| Regulation | 2017 regulation |
Previous year CS8391 Question Paper Data Structures Click Here To Download
CS8391 Syllabus Data Structures
CS8391 Important Questions Data Structures