Programming and Data Structures
Syllabus | Books | Current semester | All semesters | Miscellaneous information

Syllabus

CS10001/CS11001 Programming and Data Structures (Theory: 3–0–0/3–1–0)

Introduction to digital computers; introduction to programming – variables, assignments; expressions; input/output; conditionals and branching; iteration; functions; recursion; arrays; introduction to pointers; structures; introduction to data–procedure encapsulation; dynamic allocation; linked structures; introduction to data structures – stacks and queues; time and space requirements.

(A programming language like C/C++ may be used as a basis language. The same language must be used for the laboratory).

CS19101/CS19001 PDS Laboratory (0–1–3/0–0–3)

Suggested assignments to be conducted on a 3–hour slot. It will be conducted in tandem with the theory course so the topics for problems given in the lab are already initiated in the theory class. The topics taught in the theory course should be appropriately be sequenced for synchronization with the laboratory. A sample sequence of topics and lab classes for the topic are given below:

  1. Familiarization of a computer and the environment and execution of sample programs
  2. Expression evaluation
  3. Conditionals and branching
  4. Iteration
  5. Functions
  6. Recursion
  7. Arrays
  8. Structures
  9. Linked lists
  10. Data structures

It is suggested that some problems related to continuous domain problems in engineering and their numerical solutions are given as laboratory assignments. It may be noted that some of basic numerical methods are taught in the Mathematics course.

Syllabus | Books | Current semester | All semesters | Miscellaneous information

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.
Syllabus | Books | Current semester | All semesters | Miscellaneous information

PDS in different semesters

Syllabus | Books | Current semester | All semesters | Miscellaneous information

More information

Syllabus | Books | Current semester | All semesters | Miscellaneous information