Anna University -Study Materials for all Departments # CS2201/CD 33/ 10144 CS 302/08023007 Data Structures Unit 2 Part A and Part B Question Bank

Anna university

CS2201/CS 33/ 10144 CS 302/08023007 Data Structures Question Bank for Unit 2

Department of Computer science and Engineering

Meant for Anna University Coimbatore,trichy,trinelveli

Question Bank
(Regulation 2008/2010)
___________________________________________________________________________________
Details:
University:Anna University
Year: second Year
Department: B.E Computer Science and Engineering
Semester:Three(III)
Content:CS2201/CD 33/ 10144 CS 302/08023007 Data Structures Question Bank for Unit I
Subject code: CS2201/CD 33/ 10144 CS 302/08023007
Subject Name: Data Structures ( DS )
Unit Number: 2
Regulation: 2008 or 2010
Post Type: Question Bank

PART A QUESTION BANK

1. What is an Abstract Data type (ADT)? Explain?
2. What is a Stack?
3. What are the two operations of Stack?
4. Write postfix from of the expression –A+B-C+D?
5. What is a Queue?
6. What is a Priority Queue?
7. What are the different ways to implement list?
8. What are the advantages in the array implementation of list?
9. What is a linked list?
10. Name the two fields of Linked list?
11. What is a doubly linked list?
12. Name the three fields of Doubly Linked list?
13. Define double circularly linked list?
14. What is the need for the header?
15. List three examples that uses linked list?
16. Give some examples for linear data structures?
17. Write postfix from of the expression –A+B-C+D?
18. How do you test for an empty queue?
19. What are the postfix and prefix forms of the expression?
20. Explain the usage of stack in recursive algorithm implementation?
21. Write down the operations that can be done with queue data structure?
22. What is a circular queue?

PART A QUESTION BANK

1. Write a program in C to return the position of an element X in a List L. (16)
2. (a) State & explain the algorithm to perform Radix Sort. (8)
(b) Write a Program in C to create an empty stack and to push an element into it. (8)
3. Explain how queues can be implemented using Arrays (16)
4. (a) Write a ‘c’ program to multiply two polynomials. (8)
(b) Write a ‘c’ program to add two polynomials. (8)
5. (a) Write an algorithm to convert infix to postfix expression and explain it with example (8)
(b) Write an algorithm to evaluate a postfix expression and explain it with example (8)
6. (a) Write an algorithm to check given expression contains balanced Parenthesis or not. (8)
(b) Write an algorithm for insertion and deletion operation in a circular queue (8)
---------------------------------------------------------------------------------------------------------------------

Search Terms used by students:

Anna University Coimbatore Question Bank
Anna University Chennai Question Bank
Anna University trichy Question Bank
Anna University tiruelveli  Question Bank
CS2201 Data Structures Question Bank
CS33 Data Structures Question Bank
CS302  Data Structures Question Bank
10144 CS 302  Data Structures Question Bank
08023007 Data Structures (DS)
UNIT II Question Bank
Part A DS Question Bank
3rd Semester QB
3rd semester Question Bank
Part B Question Bank on unit 3

Blogger Comment