PROGRAMMING FOR PROBLEM SOLVING-3

DEAR STUDENTS,
PLEASE CLICK ON THE BELOW LINK TO GET PROGRAMMING FOR PROBLEM SOLVING CHAPTER 1 NOTES
https://docs.google.com/document/d/1aJs4CjWtqOxT19OEOvefLpbSw8X7LbBBpAkWc3Jz9dA/edit?usp=sharing

PROGRAMMING FOR PROBLEM SOLVING-2

MARKS DISTRIBUTION:

          The evaluation of the students in each course is a continuous process and is based on their performance in 

          different examinations as mentioned below:

	Continuous Internal Evaluation (CIE)
Internal Evaluation	Midterm Exam: 20 Marks (Two midterm exams of each 20 marks and average marks is taken as final)	30 Marks
	Assignment: 05 marks
	Alternate Assessment: 05 marks (Seminar, In-class Assessment, Mini Project, Quiz, Regularity)
External Evaluation	Semester End Examination (SEE)	70 Marks

Midterm Examinations:

There will be two midterm examinations in theory courses for a maximum of 30 marks to be answered in 90 minutes duration and will be scaled down to 20 marks. The first midterm examination will be on the first two units of the syllabus and the second midterm examination will be on the last three units. The final marks of midterm examinations are calculated by taking average of two midterm examinations. Any fraction will be rounded off to next higher integer. In case a student does not appear for midterm examination, a missing examination will be conducted upon the recommendations of standing committee subjected to payment of a prescribed fee for each missing examination.

Assignment and Alternate Assessment:

There will be five assignments in a semester for each subject. Each assignment carries 05 marks. The average of five assignments will be considered for awarding 05 marks. Remaining 05 marks are based on the performance in the alternate assessment. The alternate assessment strategies include in-class participation, regularity, quiz, seminar, mini-project etc. The modalities for conducting the assignment and alternate assessment will be decided by the department concerned.

Semester End Examinations (SEE):

The SEE question paper in theory courses will be for a maximum of 70 marks to be answered in three hours duration. The details of the question paper pattern are as follows,

·         The SEE will be conducted for 70 marks consisting of two parts viz.

i) Part- A for 20 marks ii) Part - B for 50 marks.

·         Part-A is compulsory which consists of ten questions carrying 2 marks each. Two questions from each unit.

• Part-B consists of five questions (numbered from 2 to 6) carrying 10 marks each. Each of these questions is from one unit and may contain sub-questions. For each question there will be an “either” “or” choice, which means that there will be two questions from each unit and the student should answer either of the two questions.

PROGRAMMING FOR PROBLEMS SOLVING -1

COURSE OVERVIEW:

The course is a Basic Engineering course for all computation aspiring students. It is designed to provide a comprehensive study of the C programming language that covers the fundamental principles of computer programming, with an emphasis on problem solving strategies using structured programming techniques. The syntax and constructs of data types, control statements, arrays, functions and pointers are elaborated. The derived data types like structures are discussed. It stresses the strengths of C, which provide students with the means of writing efficient, maintainable and reusable code to solve mathematical, engineering and simple data processing problems.

II.      COURSE PRE-REQUISITES:

Level	Prerequisites
UG	Nil

III.     DELIVERY / INSTRUCTIONAL METHODOLOGIES:

Ö	CHALK & TALK	Ö	QUIZ		Ö	ASSIGNMENTS	X	MOOCs
Ö	PPT	Ö	SEMINARS		X	MINI PROJECT	X	VIDEOS
X	OPEN ENDED EXPERIMENTS			Ö		ACTIVE LEARNING STRATEGIES

IV.     ASSESSMENT METHODOLOGIES – DIRECT:

Ö	MID EXAMS	Ö	END SEMESTER EXAMS	Ö	ASSIGNEMNTS	X	SEMINARS
X	LABORATORY PRACTICES	Ö	INVOLVEMENT IN CLASSROOM ACTIVITY	X	OBJECTIVE TEST	X	CERTIFICATION (MOOCs/NPTEL)
X	COURSE PROJECT (SINGLE/TEAM)

V.      ASSESSMENT METHODOLOGIES – INDIRECT:

Ö	COURSE END SURVEY	X	EXAMINER SURVEY
Ö	COURSE INSTRUCTOR SURVEY	X	EXIT INTERVIEW

VI.     COURSE OUTCOMES:

CO1. Select right identifiers, data types and operators for effective computation.

 CO2.Write programs using control statements.

CO3. Write programs demonstrating use of arrays, strings and their applications.

CO4. Demonstrate the applications of function and recursion.

CO5.Write programs for simple real life problems using pointers and structures.

.

VII.   Mapping Course Outcomes with Blooms Level of Taxonomy

         

COs	Blooms Level (BL)
	Remembering (L1)	Understanding (L2)	Applying (L3)	Analyzing (L4)	Evaluating (L5)	Creating (L6)
CO1	✔	✔	✔
CO2	✔	✔	✔
CO3	✔	✔	✔
CO4	✔	✔	✔
CO5	✔	✔	✔

VIII.  Course Articulation Matrix: Mapping of Course outcomes (COs) with Program outcomes (POs)

PO 1

PO 2

PO 3

PO 4

PO 5

PO 6

PO 7

PO 8

PO 9

PO 10

PO 11

PO 12

PSO 1

PSO 2

CO1

3

2

CO2

3

CO3

3

2

CO4

3

2

CO5

3

2

                Note: Enter correlation levels 1, 2 or 3 as defined below:

                1: Slight (Low)                                       2: Moderate (Medium)                                       3:Substantial (High)

IX.    COURSE CONTENT

Course Content:
Unit - I	INTRODUCTION TO PROGRAMMING	Lecture Hours:	8Hrs
Introduction to components of Computer Systems. Steps to solve logical and numerical problems. Representation of Algorithm, Flowchart and Pseudo code with examples program structure, identifiers, data types, Formatting input/output, Syntax and Logical Errors in compilation, object and executable code.
Unit – II	OPERATORS, EXPRESSIONS and DECISION MAKING AND LOOPING	Lecture Hours:	10Hrs
Arithmetic, Logical, Relational, Conditional, Assignment, Increment and Decrement operators. Arithmetic Expressions, Operator precedence and Associativity. Writing and evaluation of decision making, branching and looping.
Unit – III	ARRAYS	Lecture Hours:	10Hrs
Definition, Types of Arrays, declaration and Initialization of n-Dimensional Arrays and Character array, String manipulation. Linear search, Bubble sort and Selection sort.
Unit – IV	Functions	Lecture Hours:	9Hrs
Functions, Parameter passing in functions through call by value, passing arrays to functions, storage classes. Recursion as a different way of solving problems. Example programs, such as finding factorial, Fibonacci series.
Unit - V	Pointers and Structures	Lecture Hours:	8Hrs
Definition, Declaration, Pointer arithmetic, Pointer to Pointer, Pointer to an array (base pointer), Dynamic memory allocation, Command Line arguments, idea of call by reference in functions.  Defining, Declaring and initialization of structures, nested structures, Array of Structures.

Text Books:
1	B. A. Fouruzan and R. F. Gilberg, C Programming & Data Structures, 3rd Edition, CENGAGE, Learning, India, 2014.
Reference Books:
1	Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, 2nd Edition, Prentice Hall of India, 2015.
2	E. Balagurusamy, Programming in ANSI C, 7th Edition Tata McGraw-Hill, 2017.