JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

Course Objectives

Introduce the importance of programming, C language constructs, program

development, data structures, searching and sorting.

Course Outcomes:

• 1. Understand the various steps in Program development.
• 2. Explore the basic concepts in C Programming Language.
• 3. Develop modular and readable C Programs
• 4. Understand the basic concepts such as Abstract Data Types, Linear and Non-Linear Data structures.
• 5. Apply data structures such as stacks, queues in problem solving
• 6. To understand and analyze various searching and sorting algorithms.

UNIT - I

Introduction to Computers – Computer Systems, Computing Environments, Computer Languages, Creating and running programs, Software Development Introduction to C Language – Background, Simple C programs, Identifiers, Basic data types, Variables, Constants, Input / Output Structure of a C Program – Operators, Bit-wise operators, Expressions, Precedence and Associatively, Expression Evaluation, Type conversions, Statements.

UNIT - II

Statements – if and switch statements, Repetition statements – while, for, do-while statements, Loop examples, other statements related to looping – break, continue, go to, Recursion. Designing Structured Programs- Functions, basics, user defined functions, inter function communication, standard functions. Arrays – Concepts, using arrays in C, inter function communication, array applications, two – dimensional arrays, multidimensional arrays.

UNIT - III

Pointers – Introduction, Pointers for inter function communication, pointers to pointers, compatibility, Pointer Applications – Passing an array to a function, Memory allocation functions, array of pointers Strings – Concepts, C Strings, String Input / Output functions, arrays of strings, string manipulation functions, string / data conversion.

UNIT - IV

Derived types – The Typedef, enumerated types, Structures – Declaration, definition and initialization of structures, accessing structures, operations on structures, complex structures. Unions – Referencing unions, initializers, unions and structures. Input and Output – Text vs Binary streams, standard library functions for files, converting file types, File programs – copy, merge files.

UNIT - V

Sorting- selection sort, bubble sort, insertion sort, Searching-linear and binary search methods. Data Structures – Introduction to Data Structures, abstract data types, Linear list – singly linked list implementation, insertion, deletion and searching operations on linear list, Stacks-Operations, array and linked representations of stacks, stack applications, Queues-operations, array and linked representations.

TEXT BOOKS:

• 1. C Programming & Data Structures, B.A.Forouzan and R.F. Gilberg, Third Edition, Cengage Learning.
• 2. Problem Solving and Program Design in C, J.R. Hanly and E.B. Koffman, Fifth Edition, Pearson Education.
• 3. The C Programming Language, B.W. Kernighan and Dennis M.Ritchie, PHI/Pearson Education

REFERENCE BOOKS:

• 1. C & Data structures – P. Padmanabham, 3rd Edition, B.S. Publications.
• 2. C Programming with problem solving, J.A. Jones & K. Harrow, Dreamtech Press 3 Programming in C – Stephen G. Kochan, III Edition, Pearson Education.
• 4. C for Engineers and Scientists, H. Cheng, McGraw-Hill International Edition
• 5. Data Structures using C – A. M. Tanenbaum, Y. Langsam, and M.J. Augenstein, Pearson Education / PHI
• 6. C Programming & Data Structures, E. Balagurusamy, TMH.
• 7. C Programming & Data Structures, P. Dey, M Ghosh R Thereja, Oxford University Press
• 8. C & Data structures – E V Prasad and N B Venkateswarlu, S. Chand & Co.