CS6202 Programming and Data Structures I Previous Year Question Paper
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
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
Structures and Unions – File handling concepts – File read – write – binary and Stdio – File Manipulations
UNIT III LINEAR DATA STRUCTURES – LIST
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
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
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.
CS6202 Programming and Data Structures I Previous Year Question Paper Regulation 2013 question paper
- CS6202 Programming and Data Structures I Nov/Dec 2018 Question Paper
- CS6202 Programming and Data Structures I Nov/Dec 2017 Question Paper
- CS6202 Programming and Data Structures I Apr/May 2019 Question Paper
- CS6202 Programming and Data Structures I Nov/Dec 2019 Question Paper