JNTU Kakinada EEE C Programming and Data Structures Syllabus

JNTU Kakinada EEE C Programming and Data Structures Syllabus

 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY
KAKINADA
I Year B.Tech EEE T P C
3+1* 0 6
C PROGRAMMING AND DATA STRUCTURES
UNIT – I
Algorithm / pseudo code, flowchart, program development steps, structure of C program, A Simple C
program, identifiers, basic data types and sizes, Constants, variables, arithmetic, relational and logical
operators, increment and decrement operators, conditional operator, bit-wise operators, assignment
operators, expressions, type conversions, conditional expressions, precedence and order of evaluation.
Input-output statements, statements and blocks, if and switch statements, loops- while, do-while and for
statements, break, continue, goto and labels, programming examples.
UNIT – II
Designing structured programs, Functions, basics, parameter passing, storage classes- extern, auto,
register, static, scope rules, block structure, user defined functions, standard library functions, recursive
functions, header files, C preprocessor, example c programs.
UNIT – III
Arrays- concepts, declaration, definition, accessing elements, storing elements, arrays and functions, twodimensional
and multi-dimensional arrays, applications of arrays. pointers- concepts, initialization of
pointer variables, pointers and function arguments, address arithmetic, Character pointers and functions,
pointers to pointers, pointers and multidimensional arrays, dynamic memory managements functions,
command line arguments, c program examples.
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, bitfields, C program examples.
UNIT – V
Input and output – concept of a file, text files and binary files, streams, standard I/o, Formatted I/o, file I/o
operations, error handling, C program examples.
UNIT – VI
Searching – Linear and binary search methods, sorting – Bubble sort, selection sort, Insertion sort, Quick
sort, merge sort.
UNIT – VII
Introduction to data structures, singly linked lists, doubly linked lists, circular list, representing stacks and
queues in C using arrays and linked lists, infix to post fix conversion, postfix expression evaluation.
UNIT – VIII
Trees- Binary tress, terminology, representation, traversals, graphs- terminology, representation, graph
traversals (dfs & bfs)
TEXT BOOKS :
1. Computer science, A structured programming approach using C, B.A. Forouzan and R.F.
Gilberg, Third edition, Thomson.
2. DataStructures Using C – A.S.Tanenbaum, Y. Langsam, and M.J. Augenstein, PHI/Pearson
education.
REFERENCES :
1. C& Data structures – P. Padmanabham, B.S. Publications.
2. The C Programming Language, B.W. Kernighan, Dennis M.Ritchie,
PHI/Pearson Education
3. C Programming with problem solving, J.A. Jones & K. Harrow,
dreamtech Press
4. Programming in C – Stephen G. Kochan, III Edition, Pearson Eductaion.
5. Data Structures and Program Design in C, R.Kruse, C.L. Tondo, BP Leung, Shashi M, Second
Edition, Pearson Education.

Leave a Comment