STRUCTURES AND FILE MANAGEMENT: Basic of structures, structures and
Functions, Arrays of structures, structure Data types, type definition, Defining, opening
and closing of files, Input and output operations, programming examples and exercises.
Text 1: 6.1 to 6.3.
Text 2: 10.1 to 10.4, Chapter 11.
POINTERS AND PREPROCESSORS: Pointers and address, pointers and functions
arguments, pointers and arra ys, address arithmetic, character pointer and functions,
pointers to pointer ,Initialization of pointers arrays, Dynamic allocations methods,
Introduction to Preprocessors, Complier control Directives, programming examples and
Text 1: 5.1 to 5.6, 5.8.
Text 2: 12.2, 12.3, 13.1 to 13.7.
Introduction to Data Structures: Primitive and non primitive data t ypes, Definition and
applications of Stacks, Queues, Linked Lists and Trees.
Text 2 : 14.1, 14.2, 14.11, 14.12, 14.13, 14.15, 14.16, 14.17, 15.1.
08 Hours + 04 Hours
Course Outcomes: On completion of this course, students are able to
Achieve Knowledge of design and development of problem solving
Understand the basic principles of Programming in C language
Design and develop modular programming skills.
Effective utilization of memory using pointer technology
Understands the basic concepts of pointers and data structures.
1. Brain W. Kernighan and Dennis M. Richie: The C programming Language, 2nd
Edition, PHI, 2012.
2. Jacqueline Jones & Keith Harrow: Problem Solving with C, 1st Edition, Pearson
1. Vikas Gupta: Computer Concepts and C Programming, Dreamtech Press 2013.
2. R S Bichkar, Programming with C, University Press, 2012.
3. V Rajaraman: Computer Programming in C, PHI, 2013.