Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
307 views2 pages

JNTU C Syllabus

This document outlines the contents of a course on C programming and data structures across 8 units. Unit I covers basic C programming concepts like algorithms, data types, operators, and control structures. Unit II discusses functions, parameter passing, and header files. Unit III focuses on arrays, pointers, and dynamic memory allocation. Unit IV presents derived data types like structures, unions, and enumerations. Unit V covers input/output operations and file handling. Units VI and VII introduce searching and sorting algorithms as well as common data structures like linked lists, stacks, and queues. Unit VIII discusses binary trees and graphs.

Uploaded by

rameshscribd
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
307 views2 pages

JNTU C Syllabus

This document outlines the contents of a course on C programming and data structures across 8 units. Unit I covers basic C programming concepts like algorithms, data types, operators, and control structures. Unit II discusses functions, parameter passing, and header files. Unit III focuses on arrays, pointers, and dynamic memory allocation. Unit IV presents derived data types like structures, unions, and enumerations. Unit V covers input/output operations and file handling. Units VI and VII introduce searching and sorting algorithms as well as common data structures like linked lists, stacks, and queues. Unit VIII discusses binary trees and graphs.

Uploaded by

rameshscribd
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 2

C PROGRAMMING AND DATA STRUCTURES

UNIT - I
Algorithm / pseudo code, flowchart, program development steps, structure of C pr
ogram, A Simple C program, identifiers, basic data types and sizes, Constants, v
ariables, arithmetic, relational and logical operators, increment and decrement
operators, conditional operator, bit-wise operators, assignment operators, expre
ssions, type conversions, conditional expressions, precedence and order of evalu
ation.
Input-output statements, statements and blocks, if and switch statements, loops-
while, do-while and for statements, break, continue, goto and labels, programmi
ng examples.
UNIT - II
Designing structured programs, Functions, basics, parameter passing, storage cla
sses- extern, auto, register, static, scope rules, block structure, user defined
functions, standard library functions, recursive functions, header files, C pre
processor, example c programs.
UNIT - III
Arrays- concepts, declaration, definition, accessing elements, storing elements,
arrays and functions, two-dimensional and multi-dimensional arrays, application
s of arrays. pointers- concepts, initialization of pointer variables, pointers a
nd function arguments, address arithmetic, Character pointers and functions, poi
nters to pointers, pointers and multidimensional arrays, dynamic memory manageme
nts functions, command line arguments, c program examples.
UNIT - IV
Derived types- structures- declaration, definition and initialization of structu
res, accessing structures, nested structures, arrays of structures, structures a
nd functions, pointers to structures, self referential structures, unions, typed
ef, 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, In
ertion sort, Quick sort, merge sort.
UNIT â VII
Introduction to data structures, singly linked lists, doubly linked lists, circu
lar list, representing stacks and queues in C using arrays and linked lists, inf
ix to post fix conversion, postfix expression evaluation.
UNIT - VIII
Trees- Binary tress, terminology, representation, traversals, graphs- terminolog
y, representation, graph traversals (dfs & bfs)
TEXT BOOKS :
Computer science, A structured programming approach using C, B.A. Forouzan and R
.F. Gilberg, Third edition, Thomson.
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
Programming in C â Stephen G. Kochan, III Edition, Pearson Eductaion.
Data Structures and Program Design in C, R.Kruse, C.L. Tondo, BP Leung, Shashi M
, Second Edition, Pearson Education.

You might also like