JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

Pre-requisites:

• 1. Requires analytical skills and logical reasoning.

Course Objectives

To learn

• This course covers the basics of computers and program development
• It covers various concepts of C programming language
• It introduces searching and sorting algorithms
• It provides an understanding of data structures such as stacks and queues.

Course Outcomes

After learning the contents of this paper the student must be able to

• Ability to develop C programs for computing and real-life applications using basic elements like control statements, arrays, functions, pointers and strings; and data structures like stacks, queues and linked lists.
• Ability to implement searching and sorting algorithms

UNIT - I

Introduction to Computers: Computer Systems, Computing Environments, Computer Languages, Creating and running programs, Software Development Method, Algorithms, Pseudo code, flow charts, applying the software development method. Introduction to C Language: Background, Simple C programs, Identifiers, Basic data types, Variables, Constants, Input / Output, Operators. Expressions, Precedence and Associativity, Expression Evaluation, Type conversions, Bit wise operators, Statements, Simple C Programming examples.

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, Simple C Programming examples. Designing Structured Programs: Functions, basics, user defined functions, inter function communication, Scope, Storage classes-auto, register, static, extern, scope rules, type qualifiers, recursion- recursive functions, Pre-processor commands, example C programs

UNIT - III

Arrays and Strings: Concepts, using arrays in C, inter function communication, array applications, two – dimensional arrays, multidimensional arrays, C program examples. Concepts, C Strings, String Input / Output functions, arrays of strings, string manipulation functions, string / data conversion, C program examples. Pointers: Introduction (Basic Concepts), Pointers for inter function communication, pointers to pointers, compatibility, memory allocation functions, array of pointers, programming applications, pointers to void, pointers to functions, command –line arguments.

UNIT - IV

Derived Types: Structures – Declaration, definition and initialization of structures, accessing structures, nested structures, arrays of structures, structures and functions, pointers to structures, self-referential structures, unions, typedef, bit fields, enumerated types, C programming examples. Input and Output: Concept of a file, streams, standard input / output functions, formatted input / output functions, text files and binary files, file input / output operations, file status functions (error handling), C program examples.

UNIT - V

Sorting and Searching: selection sort, bubble sort, insertion sort, 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,3rd Edition, Cengage Learning.
• 2. Problem Solving and Program Design in C, J.R. Hanly and E.B. Koffman, 5th Edition, Pearson Education.
• 3. The C Programming Language, B.W. Kernighan and Dennis M.Ritchie, PHI/Pearson Education.

REFERENCES:

• 1. C for Engineers and Scientists, H.Cheng, Mc.Graw-Hill International Edition.
• 2. Data Structures using C – A.M.Tanenbaum, Y.Langsam, and M.J. Augenstein, Pearson Education / PHI.
• 3. C Programming & Data Structures, P. Dey, M Ghosh R Theraja, Oxford University Press.