Course10610517161 lectures
Problem Solving through Programming in C
Prof. Anupam Basu · IIT Kharagpur
About
This course is aimed at enabling the students to
Formulate simple algorithms for arithmetic and logical problems
Translate the algorithms to programs (in C language)
Test and execute the programs and correct syntax and logical errors
Implement conditional branching, iteration and recursion
Decompose a problem into functions and synthesize a complete program using divide and conquer approach
Use arrays, pointers and structures to formulate algorithms and programs
Apply programming to solve matrix addition and multiplication problems and searching and sorting problems
Apply programming to solve simple numerical method problems, namely rot finding of function, differentiation of function and simple integration
INTENDED AUDIENCE : BE/BTech in all disciplines BCA/MCA/M. Sc
INDUSTRY SUPPORT : All IT Industries
Lectures
Week 1
- Lecture 1 : Introduction
- Lecture 2: Idea of Algorithms
- Lecture 3: Flow Chart and Pseudocode
- Lecture 4 : Introduction to Programming Language Concepts
- Lecture 5 : Variables and Memory
Week 2
- Lecture 6 : Types of Software and Compilers
- Lecture 7: Introduction to C Programming Language
- Lecture 8 : Variables and Variable Types in C
- Lecture 9 : Introducing Functions
- Lecture 10 : Address and Content of Variables and Types
Week 3
- Lecture 11 : Assignment Statement and Operators in C
- Lecture 12 : Arithmetic Expressions and Relational Expressions
- Lecture 13 : Logical Operators and Change in Control Flow
- Lecture 14 : Use of Logical Operators in Branching
- Lecture 15 : Branching : IF - ELSE Statement
Week 4
- Lecture 16: IF-ELSE Statement (Contd.)
- Lecture 17: Switch statement
- Lecture 18: Switch Statement (Contd.) and Introduction to Loops
- Lecture 19: Implementing Repetitions (Loops)
- Lecture 20: Implementation of Loops with for Statement (Contd.)
Week 5
- Lecture 21: For Statement (Contd.)
- Lecture 22: Example of If-Else
- Lecture 23 : Example of Loops
- Lecture 24 : Example of Loops (Contd.)
- Lecture 25 : Example of Loops (Contd.), Use of FOR Loops
Week 6
- Lecture 26: Introduction to Arrays
- Lecture 27: Arrays (Contd.)
- Lecture 28: Arrays (Contd.)
- Lecture 29: Program using Arrays
- Lecture 30: Array Problem
Week 7
- Lecture 31 : Linear Search
- Lecture 32 : Character Array and Strings
- Lecture 33 : String Operations
- Lecture 34 : 2-D Array Operation
- Lecture 35 : Introducing Functions
Week 8
- Lecture 36: More on Functions
- Lecture 37: Function (Contd.)
- Lecture 38: Scanf and Printf Functions; Function Prototype
- Lecture 39 : Parameter Passing in Function Revision
- Lecture 40: Parameter Passing in Function Revision (Contd.)
Week 9
- Lecture 41: Substitution of # include and Macro
- Lecture 42: "search" as a function
- Lecture 43: Binary Search
- Lecture 44: Binary Search (Contd.)
- Lecture 45: Sorting Methods
Week 10
- Lecture 46: Bubble Sort (Contd.)
- Lecture 47: Use of Pointer in Function : Context Bubble Sort
- Lecture 48: Arrays at Strings
- Lecture 49: Data Representation
- Lecture 50: Bisection Method
Week 11
- Lecture 51 : Interpolation
- Lecture 52 : Trapezoidal Rule and Runge-Kutta Method
- Lecture 53 : Recursion
- Lecture 54 : Recursion(Contd.)
- Lecture 55 : Structure
Week 12
Syllabus and materials
At NPTEL, as the course publishes them.
Credits and licence
- Institution
- IIT Kharagpur
- Department
- Computer Science and Engineering
- Teacher
- Prof. Anupam Basu
- Level
- Undergraduate
- Language
- English
- Subjects
- Computer science, Engineering
- Source
- NPTEL
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only. NPTEL's terms
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
- Who can watch
- NPTEL gives no rating. Invisible Network shows it to Tweens profiles and older, judged from what the source says about it. How courses are placed