Scribd
Upload
4 views

Class01

The document outlines the course plan for Computer Programming (ZZ1004D), detailing the course objectives, outcomes, syllabus, and grading policy. It emphasizes the fundamentals of C programming and problem-solving skills, with a structured approach to learning through modules covering data types, control flow, functions, and aggregate data types. Additionally, it includes information on faculty contact, reference books, and standards of conduct for students.

Uploaded by

sanjaysr292617
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

Class01

The document outlines the course plan for Computer Programming (ZZ1004D), detailing the course objectives, outcomes, syllabus, and grading policy. It emphasizes the fundamentals of C programming and problem-solving skills, with a structured approach to learning through modules covering data types, control flow, functions, and aggregate data types. Additionally, it includes information on faculty contact, reference books, and standards of conduct for students.

Uploaded by

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

ZZ1004D

COMPUTER PROGRAMMING
COURSE PLAN
• ABOUT THE COURSE
• COURSE OUTCOMES
• COURSE OBJECTIVES
• COURSE SYLLABUS
• TEXT BOOKS
• GRADING POLICY
• STANDARD OF CONDUCT
ZZ1004D
COMPUTER PROGRAMMING
• Title:
Computer Programming
• Code:ZZ1004D
• Credits:
2 Credits
• Slot:B1
• Hours:
Monday 10:00 AM - 10:50 AM,
Tuesday 09:00 AM - 09:50 AM,
Friday 11:00 AM - 11:50 AM,
Thursday 12:00 PM - 12:50 PM (+ Slot)
• Venue: ECLC E
FACULTY

• Name: Dr. Jithin Mathews


• Office: Faculty Room, MB209E
• Email: [email protected]

• Visiting Hours: After taking appointment


If you have any queries/suggestions, feel
free to send an e-mail.
OBJECTIVE OF THE COURSE

To give a thorough introduction to fundamentals of C


programming and to develop and enhance problem
solving and programming skills.
COURSE OUTCOMES

• CO1: Design of algorithms for simple computational


problems.
• CO2: Express algorithmic solutions in the C
programming language.
SYLLABUS
Module 1 (10 Hours)
• Data Types, Operators and Expressions: Variables and
constants - declarations - arithmetic and logical operators –
Assignment operator – Input/output.
• Control Flow: Statements and blocks – if-else, switch, while, for
and do-while statements – break and continue– goto and labels.
Module 2 (8 Hours)
• Functions and Program structure: Basics of functions,
Parameter passing – scope rules recursion.
Module 3 (8 Hours)
• Aggregate data types: Single and multidimensional arrays,
structures and unions – Pointers to arrays and structures -passing
arrays and pointers as arguments to functions.
REFERENCE BOOKS

• B.S. Gottfried, Programming with C (Schaum's Outline


Series), 2nd ed. McGraw-Hill, 1996.
• B. W. Kernighan and D. M. Ritchie, The C Programming
Language, 2nd ed. Prentice Hall, 1988.
• B. W. Kernighan and Rob Pike, The Practice of
Programming, Addison-Wesley, 1999.
GRADING & EVALUATION POLICY
Weightage Date
Mid Exam 30% Apr 24 2023 – Apr 28 2023
Assignment/Quiz/Surprise test 30% —
EndSem 40% Jun 14 2023 - Jun 20 2023
GRADING POLICIES
• Grading will be relative.
• Tentative marks to grade mapping are as follows:
• 90-100: S;
• 80-89: A;
• 70-79: B;
• 60-69: C;
• 50-59: D;
• 40-49: E;
• <40: F.
• Absence for exams/quizzes/Assignments/Surprise tests/Programming tests
without prior written permission from the respective Instructor / Faculty would
be equivalent to zero marks in the corresponding
exam/Quiz/Assignment/Surprise test/Programming test.
• There will be no makeup exams except in case of genuine reasons and institute
rules regarding the same will be followed.
• All issues regarding the valuation of exams and quizzes must be resolved within
one week after the announcement of the result.
STANDARD OF CONDUCT
• Each student is expected to adhere to high standards of
ethical conduct, especially those related to cheating
and plagiarism.
• Any work submitted MUST BE individual effort.
• Any academic dishonesty will result in zero marks in
the corresponding exam or quiz and will be reported to
the department council for record keeping and for
permission to assign an F grade in the course.
• The department policy on academic integrity can be
found at: https://minerva.nitc.ac.in/?q=node/650
WHY COMPUTER PROGRAMMING?
• How does it help us?
• Automation?
• Design?
• Learning? ML/AI? Patterns?
• Medicine /Chemical Combination Prediction?
• Robotics?
• What is the main activity we do in Computer Science?
• Design & implementation of an algorithm
• What is computer?
• Computer is a machine
• Which solves problems.
WHAT IS A PROBLEM?
• What is the characteristics of a problem?
• It has input(s) and output(s)
• Example:
• Given a number, check whether it is an Armstrong
number
• What is Armstrong number?
• Sum of cubes of the digits of a Number = Number
• Let the number be 371, then
• 3^3+7^3+1^3= 371, so 371 is an Armstrong number
• Input : 371, Output : Yes
• Input : 11, Output: No
HOW TO DEFINE “PROBLEM”
PRECISELY?
• How to define “problem” mathematically ?
• How do we define the previous example problem(P)?
P = {(371,Yes), (11,No), …}

• A problem is set of ordered pairs of inputs and outputs.

• There are different types of problems


• Decision problems : Yes/No
• Optimization problems : Optimize the output
• Analyzing problems: Analysis of output/input
• etc.,
STEPS TO SOLVE A PROBLEM
USING COMPUTER
• Define the problem: Problem statement
• Design a method to solve the problem
(Steps to solve the problem)
• Implementation / Coding
Program, here C
• Debugging (correcting errors), if errors are there then see
whether the error is in the code or in the design
• Testing (Check whether the expected output is obtained)
OPTIMIZATION PROBLEM
• Example:
Given a map. Find the shortest distance between two
places (eg: NITC to Calicut airport)

• Our aim is to solve the problem using computer


MAP AS A GRAPH

• Modeled the problem using graph


• There can be many paths from NITC to airport
HOW DO WE OBTAIN THE
SHORTEST PATH?
• There can be many methods (designs) to find the
shortest path
• Design1: Compute all the paths, sort them using the
distance and find the path with shortest distance
among them
• Design2: Compute all the paths (no need to sort the
paths), find the path with shortest distance
SUMMARY
• There are different types of problems in Computer
Science

• We learn Computer Programming to have fun

• And of course to solve problems

• Rather solve problems and have fun


THANK YOU

You might also like