R25 B.
Tech (CSE), Syllabus BITS, Narsampet
25CS101ES: PROGRAMMING FOR PROBLEM SOLVING
B. Tech. I Year I Sem. 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
Explain the fundamental concepts of C programming, including data types, operators,
control structures, and looping constructs.
Apply modular programming principles using functions and pointers for structured
problem-solving.
Implement and manipulate arrays and strings to solve computational problems including
searching, sorting, and string operations.
Implement recursive functions and utilize user-defined data structures such as structures
and unions.
Develop programs to perform file operations, searching, and sorting using standard
algorithms in C.
UNIT - I: Overview of C:C Language Elements, Variable Declarations and Data Types,
Executable Statements, General Form of a C Program, Arithmetic Expressions, Formatting
Numbers in Program Output.
Selection Structures: Control Structures, Conditions, if Statement, if Statements with Compound
Statements, Decision Steps in Algorithms.
Repetition and Loop Statements: Repetition in Programs, Counting Loops and the while
Statement, computing a Sum or Product in a Loop, for Statement, Conditional Loops, Loop
Design, Nested Loops, do-while Statement.
UNIT - II: Top-Down Design with Functions: Building Programs from Existing Information,
Library Functions, Top-Down Design and Structure Charts, Functions without Arguments,
Functions with Input Arguments.
Pointers and Modular Programming: Pointers and the Indirection Operator, Functions with
Output Parameters, Multiple Calls to a Function with Input/ Output Parameters, Scope of Names,
Formal Output Parameters as Actual Arguments.
UNIT - III: Arrays: Declaring and Referencing Arrays, Array Subscripts, Using for Loops for
Sequential Access, Using Array Elements as Function Arguments, Array Arguments, Searching
and Sorting an Array, Parallel Arrays and Enumerated Types, Multidimensional Arrays. Strings:
String Basics, String Library Functions: Assignment and Substrings, Longer Strings:
Concatenation and Whole-Line Input, String Comparison, Arrays of Pointers.
Balaji Institute of Technology & Science - UG- Autonomous - Regulations – R25
R25 B. Tech (CSE), Syllabus BITS, Narsampet
UNIT - IV: Recursion: The Nature of Recursion, Tracing a Recursive Function, Recursive
Mathematical Functions, Recursive Functions with Array and String Parameters Structure and
Union Types: User-Defined Structure Types, Structure Type Data as Input and Output
Parameters, Functions with Structured Result Values, Union Types.
UNIT - V: Text and Binary File Pointers: Input/ Output Files - Review and Further Study,
Binary Files, Searching a Database. 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).
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.
Balaji Institute of Technology & Science - UG- Autonomous - Regulations – R25