CS6202 – PROGRAMMING AND DATA STRUCTURES – I  SYLLABUS (REGULATION 2013) AFFILIATED TO ANNA UNIVERSITY (SEMESTER 2)

UNIT I C PROGRAMMING FUNDAMENTALS- A REVIEW 

(CS6202)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

TEXT BOOKS:

1. Brian W. Kernighan and Dennis M. Ritchie, “The C Programming Language”, 2nd Edition, Pearson Education, 1988.
2. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, 2nd Edition, Pearson Education, 1997.

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.,

CLICK HERE TO DOWNLOAD THE SYLLABUS OF (CS6202) PROGRAMMING AND DATA STRUCTURES 1 (PDS 1) (REG 2013) SEMESTER 2 (SEM 2)

Course Curriculum

QUESTION BANK CS6202 PROGRAMMING AND DATA STRUCTURES 1 FREE 00:00:00
Unit 1
cs6202-unit 1- introduction FREE 00:00:00
cs6202 – c programming fundamentals FREE 00:15:00
cs6202 – c tokens FREE 00:00:00
cs6202 – operator and expression FREE 00:00:00
cs6202 – control statement FREE 00:00:00
cs6202 – switch statement FREE 00:00:00
cs6202 – looping statement FREE 00:00:00
cs6202 – break , continue and goto statement FREE 00:00:00
cs6202 – functions FREE 00:00:00
cs6202 – parameter passing method FREE 00:00:00
cs6202 – recursion FREE 00:00:00
cs6202 – array FREE 00:00:00
cs6202 – preprocessors FREE 00:00:00
cs6202 -pointers FREE 00:00:00
cs6202 -pointer and function FREE 00:00:00
cs6202 – variable length argument FREE 00:00:00
cs6202 -unit 1 conclusion FREE 00:00:00
Unit 2
cs6202 – unit 2 introduction FREE 00:00:00
cs6202 – structure FREE 00:00:00
cs6202 – array of structure FREE 00:00:00
cs6202 – example of nested structure FREE 00:00:00
cs6202 – self referential structure FREE 00:00:00
cs6202 – structure and function FREE 00:00:00
cs6202 – union FREE 00:00:00
cs6202 – file handling FREE 00:00:00
cs6202 – unformatted I/O file function FREE 00:00:00
cs6202 – other file function FREE 00:00:00
cs6202 – file operation in binary mode FREE 00:00:00
cs6202 – unit 2 conclusion FREE 00:00:00
Unit 3
cs6202 -unit 3 introduction FREE 00:00:00
cs6202 -list ADT FREE 00:00:00
cs6202 -operation on array FREE 00:00:00
cs6202 – linked list implementation of queue FREE 00:00:00
cs6202 -double link list FREE 00:00:00
cs6202 – circular link list FREE 00:00:00
cs6202 – routine to delete an element FREE 00:00:00
cs6202 -double link circular list FREE 00:00:00
cs6202 -routine to delete an element FREE 00:00:00
cs6202 – application of list FREE 00:00:00
cs6202 – subtraction of 2 polynomial FREE 00:00:00
cs6202 -multilist FREE 00:00:00
cs6202 – conclusion of unit 3 FREE 00:00:00
Unit 4
cs6202 – unit 4 introduction FREE 00:00:00
cs6202 – stack ADT FREE 00:00:00
cs6202 – linked list implementation FREE 00:00:00
cs6202 – application of stack FREE 00:00:00
cs6202 – evaluating post fix expression FREE 00:00:00
cs6202 – balacing the symbol FREE 00:00:00
cs6202 – towers of honoi FREE 00:00:00
cs6202 – function calls FREE 00:00:00
cs6202 – queue FREE 00:00:00
cs6202 – linked list implementation of queue FREE 00:00:00
cs6202 – circular queue FREE 00:00:00
cs6202 – double ended queue FREE 00:00:00
cs6202 – delete the element in rear FREE 00:00:00
cs6202 – application of queue FREE 00:00:00
cs6202 – unit 4 – conclusion FREE 00:00:00
Unit 5
cs6202 – unit 5 introduction FREE 00:00:00
cs6202 – sorting FREE 00:00:00
cs6202 – insertion sort FREE 00:00:00
cs6202 – selection sort FREE 00:00:00
cs6202 – shell sort FREE 00:00:00
cs6202 – bubble sort FREE 00:00:00
cs6202 – merge sort FREE 00:00:00
cs6202 – quick sort FREE 00:00:00
cs6202 – searching algorithm FREE 00:00:00
cs6202 – binary search FREE 00:00:00
cs6202 – hashing technique FREE 00:00:00
cs6202 – methods of hashing function FREE 00:00:00
cs6202 – folding method FREE 00:00:00
cs6202 – pseudo random number generator FREE 00:00:00
cs6202 – collision FREE 00:00:00
cs6202 – open addressing FREE 00:00:00
cs6202 – double hashing FREE 00:00:00
cs6202 – rehashing FREE 00:00:00
cs6202 – extendible hashing FREE 00:00:00
cs6202 – unit 5 conclusion FREE 00:00:00
programs for practice
cs6202-program for practise 1 FREE 00:00:00
cs6202-program for practise 2 FREE 00:00:00
cs6202-program for practise 3 FREE 00:00:00
cs6202-program for practise 4 00:00:00
cs6202-program for practise 5 00:00:00
cs6202-program for practise 6 00:00:00
cs6202-program for practise 7 00:00:00
cs6202 – program for practise 8 00:00:00
cs6202 – program for practise 9 00:00:00
cs6202 – program for practise 10 00:00:00
cs6202 – program for practise 11 00:00:00
cs6202 – program for practise 12 00:00:00
cs6202 – program for practise 13 00:00:00
cs6202 – program for practise 14 00:00:00
cs6202 – program for practise 15 00:00:00
cs6202 – program for practise 16 00:00:00
cs6202 – program for practise 17 00:00:00
cs6202 – program for practise 18 00:00:00
cs6202 – program for practise 19 00:00:00
cs6202 – program for practise 20 00:00:00
cs6202 – program for practise 21 00:00:00
cs6202 – program for practise 22 00:00:00
cs6202 – program for practise 23 00:00:00
cs6202 – program for practise 24 00:00:00
cs6202 – program for practise 25 00:00:00
cs6202 – program for practise 26 00:00:00
cs6202 – program for practise 27 00:00:00
cs6202 – program for practise 28 00:00:00
cs6202 – program for practise 29 00:00:00

Course Reviews

5

5
1 ratings
  • 5 stars1
  • 4 stars0
  • 3 stars0
  • 2 stars0
  • 1 stars0
  1. good

    5

    excellent with code simulation

3017 STUDENTS ENROLLED
66659

Popular Courses

top
© BANDHE LEARNENGG SOLUTIONS PRIVATE LIMITED
X