Programming for Problem Solving

The complete, source-checked syllabus—organized so you can see the path from your first algorithm to searching, sorting, and complexity.

Transcription verified against the source PDFPDF pages 22–23 · checked 7 August 2026

What this course is meant to do

Objectives and outcomes

Course objectives

Learn the fundamentals of computers.
Understand the steps involved in program development.
Learn the syntax and semantics of the C programming language.
Use a structured programming approach to solve problems.

By the end, students should be able to

Write algorithms and draw flowcharts for solving problems.
Convert algorithms and flowcharts into C programs.
Code and test a given logic in the C programming language.
Decompose a problem into functions and develop modular, reusable code.
Use arrays, pointers, strings, and structures to write C programs.
Solve searching and sorting problems.

The full path

Five syllabus units

The summaries improve readability; the topic coverage remains bounded by the source syllabus.

Introduction to Programming

Build the mental model behind a C program—from computer components and algorithms to control flow and standard I/O.

Computer-system components, memory, processors, operating systems, compilers, and number systems
Algorithms, flowcharts, pseudocode, program design, and structured programming
C variables, data types, compilation, errors, object code, and executable code
Operators, precedence, expression evaluation, storage classes, and type conversion
Bitwise operations, conditionals, branching, loops, and command-line arguments
Formatted input/output and the stdin, stdout, and stderr streams

Arrays, Strings, Structures and Pointers

Move from individual values to connected data structures and the memory relationships that make them work.

One- and two-dimensional arrays
Strings, character arrays, common string functions, and arrays of strings
Structures, unions, and arrays of structures
Pointers to arrays and structures
Self-referential structures and the linked-list concept without implementation
Enumeration data types

Preprocessor and File Handling in C

Organize compilation and persist data using C preprocessor directives and text or binary files.

include, define, undef, if, ifdef, and ifndef directives
Text and binary files
Creating, reading, writing, and appending files
Reading and writing structures in binary files
Random access with fseek, ftell, and rewind

Functions and Dynamic Memory Allocation

Break programs into reusable functions, understand recursion, and manage memory at runtime.

Function declarations, signatures, parameters, and return types
Value, array, and pointer parameters and the idea of reference
C standard functions and libraries
Recursion through factorial and Fibonacci examples, including limitations
Allocating and freeing memory for values and arrays

Introduction to Algorithms

Practice small problem-solving algorithms, searching, sorting, and the first intuition for complexity.

Quadratic roots, minimum and maximum values, and primality
Linear and binary search
Bubble, insertion, and selection sort
Introductory order-of-complexity concepts through example programs

Reading list

Textbooks and references

Textbooks

Byron Gottfried, Schaum’s Outline of Programming with C, McGraw-Hill.
B. A. Forouzan and R. F. Gilberg, C Programming and Data Structures, 3rd edition, Cengage Learning.

Reference books

Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, Prentice Hall of India.
R. G. Dromey, How to Solve It by Computer, Pearson, 16th impression.
Stephen G. Kochan, Programming in C, 4th edition, Pearson Education.
Herbert Schildt, C: The Complete Reference, 4th edition, McGraw-Hill.

Source and independence note

This page is a normalized transcription of R18B.TechIYearSyllabusofEEECSEIT1.pdf. Formatting and obvious PDF extraction artifacts were cleaned without expanding the learning scope. The source document remains authoritative.

Chaduvu Bidda is an independent learning platform and is not affiliated with or endorsed by JNTUH. Future explanations and practice will be Chaduvu Bidda content, clearly separated from the official syllabus.

Course draft ready

Continue into the complete bilingual lesson path.

All five units now have English explanations and Roman-script source drafts. Telugu-script plus English explanations are being enabled lesson by lesson after language review. Every lesson includes examples, practice, and quick checks awaiting academic review.

Open course map