Anna university
CS2201/CS 33/ 10144 CS 302/08023007 Data Structures Question Bank for Unit I
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: 1
Regulation: 2008 or 2010
Post Type: Question Bank
PART A QUESTION BANK
---------------------------------------------------------------------------------------------------------------------
PART A QUESTION BANK
- Define ADT
- What is the need for ADT
- What is List ADT
- Give the array implementation of list
- What is Doubly linked list
- What is meant by circularly linked list
- Write short note on multilist
- What is Stack ADT
- What is post fix notation
- How will you Balance the parenthesis in the expression
- What is Queue ADT
- What is an abstract data type? (Jan 06), Jun 05, Dec06, Jun 06,jun07
- What is pointer? Compare it with cursor. (Jan 06)
- What is the postfix equivalent of the infix expression a+b*c+(d*e+f)*g? (Jan 06), Jun 05
- What are the applications of linked list? May 06, Jun 06
- Construct the expression tree for the expression ab+cde+**. May 06
- Differentiate circularly lined list and linear linked list. Nov 05
- Write procedure for changing the ith element of the stack. Nov 05
- Define a list. Mention any two operations that are performed on a list. Dec06
- What are the advantages of linked list over array? Jun 06
- Give any two applications of stacks. Jun 06
- List the characteristics of stacks May 07
PART A QUESTION BANK
1. Explain in detail the steps involved in Top down Design. (16)
2. Write the verification condition of a program segments with
i) Straight line statements (4)
ii) Branches (6)
iii) Loops (6)
3. Write short notes on efficiency of an algorithm (16)
4. Write short notes on analysis of an algorithm (16)
5. (a) Develop an algorithm to compute the sums for the first n terms
S=1+ (1/2) + (1/3) +.... (8)
(b) Discuss in detail about the implementation of the algorithm. (8)
6. (a) Write an algorithm to reverse the digits of a decimal number. (8)
(b) Write an algorithm to compute the Fibonacci series for ‘n’ terms. (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 3 Question Bank
Part A DS Question Bank
3rd Semester QB
3rd semester Question Bank
Part B Question Bank on unit 3
Blogger Comment