|
|
2007-08
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY,
HYDERABAD
I Year B.Tech. M.E. T P C
2+1* 0 4
COMPUTER PROGRAMMING
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.
UNIT – II
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 – III
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 – IV
Arrays- concepts, declaration, definition, accessing elements, storing elements, arrays and functions, two-dimensional 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 – V
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 – VI
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 – VII
Introduction to data structures-Stacks and Queues, representing stacks and queues in C using arrays and linked lists.
Implementation of Searching and sorting in C– Linear and binary search methods, sorting – Bubble sort, Quick Sort, merge sort.
UNIT - VIII
Trees- Binary trees, representation, traversals (Recursive) implemented in C, graphs- terminology, representation and basic operations on graphs.
|
No responses found. Be the first to respond and make money from revenue sharing program.
|