Scribd
Upload
918 views2 pages

Pps 2nd Sem Syllabus

This document outlines the objectives, topics, and outcomes of the Programming for Problem Solving course for the first year of the B. Tech program. The course introduces students to computer programming through the C language. It covers topics such as algorithms, variables, conditionals, loops, functions, recursion, arrays, pointers, structures, and basic sorting and searching algorithms. The course aims to teach students how to formulate algorithms, write programs in C, debug syntax and logic errors, and apply programming to solve numerical problems. It is a 3-credit course assessed through classwork, examination, and programming assignments.

Uploaded by

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

Pps 2nd Sem Syllabus

This document outlines the objectives, topics, and outcomes of the Programming for Problem Solving course for the first year of the B. Tech program. The course introduces students to computer programming through the C language. It covers topics such as algorithms, variables, conditionals, loops, functions, recursion, arrays, pointers, structures, and basic sorting and searching algorithms. The course aims to teach students how to formulate algorithms, write programs in C, debug syntax and logic errors, and apply programming to solve numerical problems. It is a 3-credit course assessed through classwork, examination, and programming assignments.

Uploaded by

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

B. Tech.

Semester – I/II (Common to all Branches)


CSE101C PROGRAMMING FOR PROBLEM SOLVING
CATEGORY : ENGINEERING SCIENCE COURSE

L T P Credits Class Work : 25 Marks


3 0 0 3 Examination : 75 Marks
Total : 100 Marks

Duration of Examination : 3 Hours

Course Objectives:
1. To make students understand basics of parts of computers and the programming.
2. To give knowledge of basic constructs of computer programming.
3. To make students understand Recursion.
4. To impart knowledge of Basic Algorithms.

Unit I ( 10 Lectures)

Introduction to components of a computer system (disks, memory, processor, where a program is


stored and executed, operating system, compilers etc.), Introduction to Programming ,Idea of
Algorithm: steps to solve logical and numerical problems. Representation of Algorithm:
Flowchart/ Pseudocode with examples. ,From algorithms to programs; source code, variables
(with data types) variables and memory locations, Syntax and Logical Errors in compilation,
object and executable code.

Unit II (10 Lectures)

Arithmetic expressions and precedence, Conditional Branching and Loops, Writing and
evaluation of conditionals and consequent branching ,Iteration and loops Arrays: Arrays (1-D, 2-
D), Character arrays and Strings, Functions (including using built in libraries), Parameter passing
in functions, call by value, Passing arrays to functions: idea of call by reference

Unit III (10 Lectures)

Recursion: Recursion, as a different way of solving problems. Example programs, such as


Finding
Factorial, Fibonacci series, Ackerman function etc. Structure: Defining structures and Array of
Structures, Pointers :Idea of pointers, Defining pointers, Use of Pointers in self-referential
structures, notion of linked list (no implementation)

Unit IV (10 Lectures)

Basic Algorithms: Searching (Linear and binary search), Basic Sorting Algorithms (Bubble,
Insertion, Quick sort), Finding roots of equations, notion of order of complexity through example
49
Recommended by corresponding Board of Undergraduate studies and Faculty of Engineering
and Technology
Approved in 13th meeting of The Academic Council held on 18th June 2018
programs (no formal definition required)File handling (only if time is available, otherwise should
be done as part of the lab)
Suggested Text Books:
1. Byron Gottfried, Schaum's Outline of Programming with C, McGraw-Hill
2. E. Balaguruswamy, Programming in ANSI C, Tata McGraw-Hill
Suggested Reference Books :
1. Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, 2 nd Edition,
Pearson Education.
Course Outcomes:
The student will learn
1. To formulate simple algorithms for arithmetic and logical problems.
2. To translate the algorithms to programs (in C language).
3. To test and execute the programs and correct syntax and logical errors
4. To implement conditional branching, iteration and recursion.
5. To decompose a problem into functions and synthesize a complete program using
divide and conquer approach.
6. To use arrays, pointers and structures to formulate algorithms and programs.
7. To apply programming to solve matrix addition and multiplication problems and
searching and sorting problems.
8. To apply programming to solve simple numerical method problems, namely rot
finding of function, differentiation of function and simple integration.
Note: The paper setter will set two questions ( with or without parts ) from each of four units , &
a ninth compulsory question comprising of 5 to 10 sub-parts , covering the entire syllabus . The
examinee will attempt 5 questions in all, alongwith the compulsory question ( with all its subparts
), selecting one question from each unit.

You might also like