C Programming and Data Structures - JNTU Kakinada First Year Syllabus 2009 |
UNIT-I |
Introduction to Computers, Some novice HW and SW concepts, Algorithm / pseudo code, flowchart, program
development steps, Introduction to various IDEs and their use in C program development, 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. Control
structures such as if, goto , labels, and switch statements.
|
UNIT-II |
Loops- while, do-while and for statements, break, continue, programming examples.
Arrays - concepts, declaration, definition, accessing elements, storing elements, Strings and string manipulations, 1-
D arrays other than strings, 2-D character arrays 2-D arrays other than character arrays Multidimensional arrays
Practical examples to expose Engineering problems.
|
UNIT III |
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 pre-processor, example c programs.
Passing 1-D arrays, 2-D arrays , and functions.
|
UNIT IV |
Pointers- concepts, initialization of pointer variables, pointers and function arguments, passing by address dangling
memory, dangling memory, 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, bit-fields, Input and output concept of a file, text files and binary files, Formatted I/o, file I/o operations,
C program examples.
|
UNIT VI |
Introduction to Data Structures Time Complexity Space Complexity Pattern matching naive method Robin
Karp Algorithm - Searching Linear and binary search methods, sorting Bubble sort, selection sort, Insertion sort,
Quick sort, merge sort.
|
UNIT VII |
Introduction to data structures, single 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. Adding two large integers
using linked lists.
|
UNIT VIII |
Trees- Binary tress, terminology, representation, traversals, Graphs - terminology, representation, graph traversals
(dfs & bfs) Warshalls Dijkstra Kruskal Prims Algorithms. Only Algorithms
|
REFERENCES |
TEXT BOOKS: |
1. C and Data Structures: A Snap Shot Oriented Treatise Using Live Engineering Examples, N.B.
Venkateswarlu & E.V. Prasad, S Chand & Co, 2009.
2. Computer science, A structured programming approach using C, B.A. Forouzan and R.F. Gilberg, Third
edition, Thomson.
|
Reference Books |
1. Fundamentals of Data Structures in C , Horowitz, Sahni, anderson-Freed, 2nd ed, Universities Press,2008.
2. Classic Data Structures, Samanta,2nd ed, PHI, 2009.
3. The C Programming Language, B.W. Kernighan, Dennis M.Ritchie, PHI/ Pearson.
4. C Programming with problem solving, J.A. Jones & K. Harrow, Dreamtech Press
5 DataStructures Using C , A.S.Tanenbaum, Y. Langsam, and M.J. Augenstein, PHI/ Pearson.
6. Programming in C , Stephen G. Kochan, III Edition, Pearson .
7. Data Structures and Program Design in C, R.Kruse,, Tondo, Leung, Shashi M, 2nd Edition, Pearson.
8. Data Structures and Algorithms, Aho, Hopcroft, Ullman, Pearson ,2006
9. C and Data Structures, Ashok N.Kamthane, Pearson.
10. C Programming and Data Structures, E Balaguruswamy, TMH, 2008.
|
|