COURSE PLAN

COMPUTER SCIENCE AND ENGINEERING

Department :

PROBLEM SOLVING USING COMPUTERS & CSE 1051

Course Name & code :

I & FIRST YEAR (COMMON TO ALL BRANCHES)

Semester & branch :

MS TANUJA SHAILESH
Name of the faculty :
L T P C
No of contact hours/week:
25 11 0 3

ASSESSMENT PLAN

Course Outcomes (COs)

No. of
At the end of this course, the student should be able to: Contact Marks
Hours
CO1: Explain basics of computing, use problem solving techniques to solve 5 14
simple problems using C language.
CO2: Use operators, decision making and looping constructs for solving 8 22
complexed programs.
CO3: Understand and use derived data structures like arrays and strings to 8 22
solve higher level programs.
CO4: Understand and implement use of modular programming to decompose a 7 20
problem into functions and synthesize a complete program. Demonstrate
use of recursive functions in problem solving.
CO5: Describe and use the derived data types like structures and pointers. 8 22
Understand to implement file management. Understand the importance
of cyber security

(Page 1 of 5) MIT/GEN/F-01/R1
 Total 36 100

End Semester/
Components Quizzes Sessional Tests
Make-up Examination
Duration 20 to 30 minutes 60 minutes 180 minutes
Weightage 20 % (4 X 5 marks) 30 % (2 X 15 Marks) 50 % (1 X 50 Marks)
Knowledge/ Recall; Understanding/
Understanding/ Comprehension;
Typology of Understanding/ Comprehension;
Application; Analysis; Synthesis;
Questions Comprehension; Application; Analysis;
Evaluation
Application Synthesis; Evaluation
Answer one randomly selected MCQ: 10 questions Answer all 5 full
question from the problem sheet (0.5 marks) questions of 10 marks
Pattern (Students can refer their class Short Answers: 5 each. Each question
notes) questions (2 marks) may have 2 to 3 parts
of 3/4/5/6/7 marks
4, 7, 10, and 13th week of
Schedule Calendared activity Calendared activity
academic calendar
Quiz 1 (L 1-9 & T 1-4 ) (CO1&2) Test 1 Comprehensive
(L 1-11 & T 1-5 ) examination covering
Topics Quiz 2 (L 10-15 & T 5-6 ) (CO3) (CO1&2&3) full syllabus. Students
Covered Quiz 3 (L 16-20 & T 7-8 ) (CO4) Test 2 are expected to answer
(L 12-23 & T 6-9 ) all questions (CO1-5)
Quiz 4 (L 21-25 & T 9-11 ) (CO5)
(CO3&4&5)

Course Plan
Course
L. No./
Topics Outcome
T. No.
Addressed
L0 Introductory class(formal introduction of teacher, students and subject). ---

L1 Introduction, Computer Organization, early Operating System, Machine, Assembly C01

and High Level language
L2 History of C, Typical C program development environment CO1
L3 Problem solving using computers. Idea of Algorithm: steps to solve logical and CO1
numerical problems, Representation of Algorithm, Flowchart/Pseudocode with
examples
T1 Tutorial on algorithms and flowcharts CO1
L4 Simple C programs, Syntax and Logical Errors in compilation, object and executable CO1
code
L5 Variable names and declarations, Datatypes, sizes and constants. CO2
L6 Arithmetic operators, relational and logical operators, increment and decrement CO2
operators and bitwise operators
T2 Tutorial on simple C programs and different operators CO2

(Page 2 of 5) MIT/GEN/F-01/R1
L7 Type conversion, assignment operators and expression, Conditional expressions, CO2
precedence and order of evaluation.
L8 Statements and blocks, if-else, else-if, Switch CO2
T3 Tutorial on expression evaluation, if-else, else-if, Switch CO2
L9 Loops-While, Do-While, For, Break and Continue statement CO2
T4 Tutorial on Loops, Break and continue statement CO2
L10 1-D arrays and strings CO3
L11 searching: Linear and binary searching. Comparison between search procedures CO3
L12 Programs on strings and string handling functions CO3
T5 Tutorial on 1D array and strings CO3
L13 Sorting: Selection, bubble, Quick and Merge sorting. CO3
L14 Comparison between sorting procedures. Sorting with strings CO3
L15 Multidimensional arrays and matrices CO3
T6 Tutorial on 2D arrays CO3
L16 Functions: The prototype declarations, Actual and formal parameters, function CO4
definition
L17 Pointer variables, Declaration and dereferencing pointer variables CO4
L18 Passing arguments to a function, by value, by reference. CO4
T7 Tutorial on functions CO4
L19 Functions with and without returns Scope of variables CO4
L20 Recursive programming, as a different way of solving problems CO4
T8 Tutorial on recursive functions CO4
L21 Structures: Defining structures CO5
L22 Array of Structures CO5
T9 Tutorial on Structures CO5
L23 Pointer arithmetic. Pointer to structures CO5
T10 Tutorial on pointers CO5
L24 File Management CO5
T11 Tutorial on File management CO5
L25 Computer and cyber security CO5

(Page 3 of 5) MIT/GEN/F-01/R1
References:
1.
Dromey.R. G, How to solve it by computers, Pearson, 1982.
2. Brian W. Kernighan and Dennis M. Ritchie, The C Programming language (2e), Pearson Education,
1988.
3. Deital.P. J and Deitel.H.M, C: How to program (7e), Pearson Education, 2010

4. Balagurusamy.E, Computing fundamentals and C programming (1e), McGraw-Hill, 2008.

5. Click or tap here to enter text.

6. Click or tap here to enter text.

7. Click or tap here to enter text.

Submitted by: MS TANUJA SHAILESH

(Signature of the faculty)

Date: 31-07-2018

Approved by: DR ASHALATHA NAYAK

(Signature of HOD)

Date: 31-07-2018

FACULTY MEMBERS TEACHING THE COURSE (IF MULTIPLE SECTIONS EXIST):

FACULTY SECTION FACULTY SECTION
Dr. VIJAYA ARJUNAN X
MR RAJESH G Q
MR. KISHORE B U
MS. TANUJA SHAILESH T
(Page 4 of 5) MIT/GEN/F-01/R1
 MS. ARCHANA PRAVEEN M
KUMAR
MS. D CENITTA P
MR. MANOJ R N
MS. ANJANA R
MS. RAJASHREE KRISHNA O
MS. RADHIKA KAMATH S
MR. GANESH BABU C W
MS ROOPASHREE SHETTY V

(Page 5 of 5) MIT/GEN/F-01/R1