Programming and Data Structures Theory and Laboratory



Syllabus

CS10003 Programming and Data Structures (Theory: 3–0–0)

Introduction: Basic operation of digital computers, basic concepts of integer and floating point number representations.

Elements of C programming language: Data types, constants, and variables, expressions and assignment statements, input and output statements, conditional and branch statements, iteration statements, 1-d and 2-d arrays, functions and parameter passing, recursion, strings, structures, introduction to pointers and dynamic allocation, file read and write.

Searching and sorting: Linear and binary search, selection sort, bubble sort, insertion sort, merge sort, quick sort.

Data structures: Linked lists, stacks, queues.

CS19003 PDS Laboratory (0–0–3)

Topics of Lab Assignments

  1. Familiarization with C Programming Environment
  2. Data types, constants, variables, assignment statements and input-output
  3. Conditional and branch statements
  4. Loops and iteration statements
  5. 1-d and 2-d static arrays
  6. Functions and recursion
  7. Structures
  8. Pointers and dynamic memory allocation
  9. Linked lists
  10. Stacks and queues



References

  1. Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, Prentice Hall of India.
  2. E. Balaguruswamy, Programming in ANSI C, Tata McGraw-Hill.
  3. Byron Gottfried, Schaum's Outline of Programming with C, McGraw-Hill.
  4. Seymour Lipschutz, Data Structures, Schaum's Outlines Series, Tata McGraw-Hill.
  5. Ellis Horowitz, Satraj Sahni and Susan Anderson-Freed, Fundamentals of Data Structures in C, W. H. Freeman and Company.
  6. R. G. Dromey, How to Solve it by Computer, Prentice-Hall of India.



PDS in different semesters



More information