CS8391 DS Important Questions
Anna University Regulation 2017 IT CS8391 DS Important Questions with Answer Key and IT 3rd SEM CS8391 Data Structures Engineering Answer Key is listed down for students to make perfect utilization and score maximum marks with our study materials.
UNIT-1 OVERVIEW AND INSTRUCTIONS
PART- A
1. Define ADT. Give any two examples.
2. What are the postfix and prefix forms of the expression:
A + B* (C – D) / (P – R)
3. List out the areas in which data structures are applied extensively.
4. Define data structure with example.
5. What is circular linked list?
6. List out the advantage of circular linked list.
7. Distinguish between linear and nonlinear data structures.
8. Interpret the advantages and disadvantages of linked lists over arrays.
9. Differentiate arrays and linked lists.
10. Give an example for linked list application.
11. Examine a doubly linked list with neat diagram.
12. Illustrate the basic operations carried out in a linked list.
13. Show the ways in which list ADT can be implemented.
14. Compare calloc() and realloc() function and mention its application
in linked list.
15. Analyze and write a routine to find position of given element in
singly linked list.
16. Analyze and write the linked list representation of a polynomial:
p(x)=4×3+6×2+7x+9
CS8391 DS All units Important Questions – Download Here
If you require any other notes/study materials, you can comment in the below section.
Related Links
For CS8391 DS Previous Year Question Papers – Click here
For CS8391 DS Question Bank/2marks 16marks with answers – Click here
For CS8391 DS Lecture Handwritten Notes – Click here
Search Terms
CS8391 DS Important Questions
Anna University 3rd SEM IT DS Important Questions
CS8391 Data Structures Engineering Answer Key free download
Anna University IT DS Important Questions Regulation 2017
CS8391 Answer Key, DS Unit wise Important Questions- IT 3rd SEMester