Programming And Data Structures I CS6202 MJ2014 2nd Semester Question Paper

Anna University Question Paper Code :57011
B.E./B.Tech: DEGREE EXAMINATION, -MAY/JUNE 2014
Second Semester
Computer Science and Engineering
CS 6202 - PROGRAMMING AND DATA STRUCTURES – I
(Common to Computer and Communication Engineering and Information Technology)
(Regulation 2013) .

For More 1st Year Question Papers

For More Question paper of CSE

For More Question paper of IT

PART A — (10 x 2 = 20 marks)

1. With the help of the -printf function show how C handle S functions with variable number of arguments.
2. Define macro with an example.
3. Give-applications in which unions rather than structures can be used.
4. Will. the following declaration work. Justify your.answer. struct StUdent
int rollno = 12; float marks 11 = {55; 60, 56); char gender;
};
5. Should arrays or linked lists be used for the following types of applications: -Justify your answer.
(a) Many search operations in sorted list
(b) Many search operations in unsorted list

CS6202 Programming And Data Structures I syllabus

OBJECTIVES:
The student should be made to:
- Be familiar with the basics of C programming language.
- Be exposed to the concepts of ADTs
- Learn linear data structures – list, stack, and queue.
- Be exposed to sorting, searching, hashing algorithms

UNIT I C PROGRAMMING FUNDAMENTALS- A REVIEW 9
Conditional statements – Control statements – Functions – Arrays – Preprocessor – Pointers – Variation in pointer declarations – Function Pointers – Function with Variable number of arguments

UNIT II C PROGRAMMING ADVANCED FEATURES 9
Structures and Unions – File handling concepts – File read – write – binary and Stdio – File Manipulations

UNIT III LINEAR DATA STRUCTURES – LIST 9
Abstract Data Types (ADTs) – List ADT – array-based implementation – linked list implementation –– singly linked lists- circularly linked lists- doubly-linked lists – applications of lists –Polynomial Manipulation – All operation (Insertion, Deletion, Merge, Traversal)

UNIT IV LINEAR DATA STRUCTURES – STACKS, QUEUES 9
Stack ADT – Evaluating arithmetic expressions- other applications- Queue ADT – circular queue implementation – Double ended Queues – applications of queues

UNIT V SORTING, SEARCHING AND HASH TECHNIQUES 9 Sorting algorithms: Insertion sort – Selection sort – Shell sort – Bubble sort – Quick sort – Merge sort – Radix sort – Searching: Linear search –Binary Search Hashing: Hash Functions – Separate Chaining – Open Addressing – Rehashing – Extendible Hashing

TOTAL: 45 PERIODS

OUTCOMES:
At the end of the course, the student should be able to:
- Use the control structures of C appropriately for problems.
- Implement abstract data types for linear data structures.
- Apply the different linear data structures to problem solutions.
- Critically analyse the various algorithms.

TEXT BOOKS:

REFERENCES:
1. Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein, “Introduction to Algorithms”, Second Edition, Mcgraw Hill, 2002.
2. Reema Thareja, “Data Structures Using C”, Oxford University Press, 2011
3. Aho, Hopcroft and Ullman, “Data Structures and Algorithms”, Pearson Education,1983.
4. Stephen G. Kochan, “Programming in C”, 3rd edition, Pearson Ed.,