Scribd
Upload
11 views1 page

BOOK1

The document outlines the syllabus for the CS103ES: Programming for Problem Solving course in the B.Tech. CSE program at JNTU Hyderabad. It covers fundamental programming concepts, the C programming language, data structures, file handling, and dynamic memory allocation. Students will learn to write algorithms, develop modular code, and utilize various programming constructs in C.

Uploaded by

Eslavathramdas
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
11 views1 page

BOOK1

The document outlines the syllabus for the CS103ES: Programming for Problem Solving course in the B.Tech. CSE program at JNTU Hyderabad. It covers fundamental programming concepts, the C programming language, data structures, file handling, and dynamic memory allocation. Students will learn to write algorithms, develop modular code, and utilize various programming constructs in C.

Uploaded by

Eslavathramdas
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/ 1

Page 8 of 154

R22 B.Tech. CSE Syllabus JNTU Hyderabad

CS103ES: PROGRAMMING FOR PROBLEM SOLVING


B.Tech. IYear ISem. LT P C
3 00 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/ilowcharts 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: ntroduction 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
VO: Simple input and output with scanf and printf, formatted /O, Introduction to stdin, stdout and stderr.
Command line arguments

UNIT- Il: 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 aray of characters, basic string functions available
in C (strlen, strcat, strcpy, strstr etc.), arrays of strings
Structures: Defining structures, initializing structures, unions, Aray of structures
Pointers: ldea of pointers, Defining pointers, Pointers to Arrays and Structures, Use of Pointers in self
referential structures, usage of self referential structures in linked list (no implementation) Enumeration
data type

UNIT - Il: 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,
passing pointers to functions, idea of call by reference, Some C standard functions and libraries

Page 9 of 154

R22 B.Tech. CSE Syllabus JNTUHyderabad


Recursion: Simple programs, such as Finding Factorial, Fibonacci series etc., Limitations of Recursive
functions Dynamic memory allocation: Allocating and freeing memory, Allocating memory for arays of
different data types

You might also like