×
YOU DID NOT WAKE UP TODAY TO BE MEDIOCRE.
--Your friends at LectureNotes
Close

Note for Programming And Datastructure - PDS by Mohit Katiyar

  • Programming And Datastructure - PDS
  • Note
  • 25 Views
  • Uploaded 2 months ago
Mohit Katiyar
Mohit Katiyar
0 User(s)
Download PDFOrder Printed Copy

Share it with your friends

Leave your Comments

Text from page-1

A Course Material on Programming and Data Structures-I By C.Premalatha ASSISTANT PROFESSOR DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING SASURIE COLLEGE OF ENGINEERING VIJAYAMANGALAM – 638 056

Text from page-2

QUALITY CERTIFICATE This is to certify that the e-course material Subject Code : CS6202 Subject : Programming and Data Structures-I Class : I Year CSE being prepared by me and it meets the knowledge requirement of the university curriculum. Signature of the Author Name:C.Premalatha Designation: Assistant Professor This is to certify that the course material being prepared by Mrs. C.Premalatha is of adequate quality. He has referred more than five books amount them minimum one is from abroad author. Signature of HD Name: SEAL

Text from page-3

SNO 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 CONTENTS UNIT-I Conditional statements Control statements Functions Arrays Preprocessor Pointers Variation in pointer declarations Function Pointers Function with Variable number of arguments UNIT-II Structures Unions File handling concepts File read – write binary and Stdio File Manipulations PAGE NO 5 14 21 25 29 34 36 37 38 41 47 50 52 56 57 16 17 18 19 20 21 22 23 24 UNIT-III 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 UNIT-IV 68 68 70 71 72 78 82 88 88 25 26 Stack ADT Evaluating arithmetic expressions 92 95 27 28 29 other applications Queue ADT circular queue implementation 99 99 101 30 31 Double ended Queues applications of queue 102 103

Text from page-4

UNIT-V 32 33 34 35 36 37 38 39 40 41 42 43 44 Sorting algorithms: Bubble sort Quick sort Selection sort Insertion sort Shell sort merge sort Radix sort Searching: Linear search ,Binary Search Hashing: Hash Functions Separate Chaining Open Addressing Rehashing Extendible Hashing 105 108 114 117 118 121 128 130 138 139 140 142 146

Lecture Notes