Scribd
Upload
201 views2 pages

PPS R22 Syllabus

Uploaded by

jagadeesh sirigiri
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
201 views2 pages

PPS R22 Syllabus

Uploaded by

jagadeesh sirigiri
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

R22 B.Tech.

CSE Syllabus JNTU Hyderabad

B.Tech. I Year I Sem.


PROGRAMMING FOR PROBLEM SOLVING
L T P C
3 0 0 3
Course Objectives:
● To learn the fundamentals of computers.
● To understand the various steps in program development.
● To learn the syntax and semantics of the C programming language.
● To learn the usage of structured programming approaches in solving problems.

Course Outcomes: The student will learn


● To write algorithms and to draw flowcharts for solving problems.
● To convert the algorithms/flowcharts to C programs.
● To code and test a given logic in the C programming language.
● To decompose a problem into functions and to develop modular reusable code.
● To use arrays, pointers, strings and structures to write C programs.
● Searching and sorting problems.

UNIT - I: Introduction to Programming Compilers,


compiling and executing a program.
Representation of Algorithm - Algorithms for finding roots of a quadratic equations, finding minimum
and maximum numbers of a given set, finding if a number is prime number Flowchart/Pseudocode with
examples, Program design and structured programming
Introduction to C Programming Language: variables (with data types and space requirements),
Syntax and Logical Errors in compilation, object and executable code, Operators, expressions and
precedence, Expression evaluation, Storage classes (auto, extern, static and register), type conversion,
The main method and command line arguments Bitwise operations: Bitwise AND, OR, XOR and NOT
operators
Conditional Branching and Loops: Writing and evaluation of conditionals and consequent branching
with if, if-else, switch-case, ternary operator, goto, Iteration with for, while, do- while loops
I/O: Simple input and output with scanf and printf, formatted I/O, Introduction to stdin, stdout and stderr.
Command line arguments

UNIT - II: Arrays, Strings, Structures and Pointers:


Arrays: one and two dimensional arrays, creating, accessing and manipulating elements of arrays
Strings: Introduction to strings, handling strings as array of characters, basic string functions available
in C (strlen, strcat, strcpy, strstr etc.), arrays of strings
Structures: Defining structures, initializing structures, unions, Array of structures
Pointers: Idea of pointers, Defining pointers, Pointers to Arrays and Structures, Use of Pointers in
selfreferential structures, usage of self referential structures in linked list (no implementation)
Enumeration data type

UNIT - III: Preprocessor and File handling in C:


Preprocessor: Commonly used Preprocessor commands like include, define, undef, if, ifdef, ifndef Files:
Text and Binary files, Creating and Reading and writing text and binary files, Appending data to existing
files, Writing and reading structures using binary files, Random access using fseek, ftell and rewind
functions.

UNIT - IV: Function and Dynamic Memory Allocation:


Functions: Designing structured programs, Declaring a function, Signature of a function, Parameters
and return type of a function, passing parameters to functions, call by value, Passing arrays to functions,
R22 B.Tech. CSE Syllabus JNTU Hyderabad

passing pointers to functions, idea of call by reference, Some C standard functions and libraries
Recursion: Simple programs, such as Finding Factorial, Fibonacci series etc., Limitations of Recursive
functions Dynamic memory allocation: Allocating and freeing memory, Allocating memory for arrays of
different data types

UNIT - V: Searching and Sorting:


Basic searching in an array of elements (linear and binary search techniques), Basic algorithms to sort
array of elements (Bubble, Insertion and Selection sort algorithms), Basic concept of order of complexity
through the example programs

TEXT BOOKS:
1. Jeri R. Hanly and Elliot B.Koffman, Problem solving and Program Design in C 7th Edition,
Pearson
2. B.A. Forouzan and R.F. Gilberg C Programming and Data Structures, Cengage Learning, (3rd
Edition)

REFERENCE BOOKS:
1. Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, Prentice Hall of
India
2. E. Balagurusamy, Computer fundamentals and C, 2nd Edition, McGraw-Hill
3. Yashavant Kanetkar, Let Us C, 18th Edition, BPB
4. R.G. Dromey, How to solve it by Computer, Pearson (16th Impression) 5. Programming in C,
Stephen G. Kochan, Fourth Edition, Pearson Education.
6. Herbert Schildt, C: The Complete Reference, Mc Graw Hill, 4th Edition
7. Byron Gottfried, Schaum’s Outline of Programming with C, McGraw-Hill

You might also like