Lovely Professional University,Punjab

Course No Cours Title Course Planner Lectures Tutorial Practical Credits

CSE101T FOUNDATIONS OF COMPUTING 15367 :: Kanwar Preet Singh 3 1 0 4
Course Category Courses with conceptual focus / presentation component
Sr No Jouranls atricles as compulsary readings (specific articles, Complete reference)
8 http://cplus.about.com/od/thecden/Welcome_to_the_C_Area_with_Articles_about_C_Development.htm
9 http://www.programmersheaven.com/tags/C/
Computer Science A Structured Programming Approach Using C,by Behrouz A. Forouzan & Richard F. Gilberg,Publishers:Cengage
Learning ,Third Edition
1 Text Book:
Other Specific Book:
Programming with ANSI & Turbo C, by Ashok N. Kamthane, Publishers: Pearson Education 2
The C Programming Language, by B.W. Kernighan and D.M. Ritchie, Publishers: Prentice Hall of India, New Delhi 3
Programming in ANSI C, by E.Balagurusamy, Publishers: Tata McGraw Hill Publishing Company Limited, New Delhi 4
Programming with C ,by Byron Gottfried,Publishers:Tata McGraw-Hill,Second Edition 5
Computer Fundamentals, by P.K. Sinha & Preeti Sinha, Publishers: BPB Publications 6
Vikas Verma, "A Workbook on C++", Cengage Learning 7
Relevant Websites
Other Reading
Format For Instruction Plan [for Courses with Lectures and Tutorials
1 Approved for Spring Session 2011-12
Sr. No. (Web adress) (only if relevant to the courses) Salient Features
10 www.cprogramming.com/ A website designed to help you learn C or C++. Understandable C and C++ programming
tutorials, compiler reviews, source code, tips and tricks.
11 http://www.howstuffworks.com/c.htm Learn how to write computer programs in C.
12 http://cprogramminglanguage.net/ C Programming Language website gives you a lot of helpful resources which help you to learn C
programming.
Detailed Plan For Lectures
Week Number Lecture Number Lecture Topic Chapters/Sections of
Textbook/other
reference
Pedagogical tool
Demonstration/case
study/images/anmatio
n ctc. planned
Part 1
Week 1 Lecture 1 Problem Solving & Program Planning:
Need for problem solving and planning a program
->Reference
:6,Chapter11
Lecture 2 Program design tools: algorithms, flow charts ->Reference
:6,Chapter11
Lecture 3 Pseudo codes and decision tables ->Reference
:6,Chapter11
Week 2 Lecture 4 Basics of C Language: Phases in the development
of a program, Compilers & Interpreters
->Reference
:6,Chapter11
Lecture 5 Declarations: Character Set, delimiters, keywords,
identifiers, constants, variables.
->Reference :1,Chap2
(Pg2.1-2.5)(Pg2.14-
2.24)
Lecture 6 Data types, declaring & Initializing variables, Type
Conversion
->Reference :1,Chap2
(Pg2.12- 2.14) Chap2
(Pg2.25- 2.28)
Week 3 Lecture 7 Operators & Expressions: Various operators,
Precedence & Associativity
->Reference :1,Chap3
(Pg3.1-3.21)
Lecture 8 Handling Input/Output: Unformatted & Formatted I/O ->Reference :1,Chap4
(Pg4.1-4.29)
Lecture 9 Decision making statements ->Reference :1,Chap6
(Pg6.2-6.9)
Week 4 Lecture 10 Control Statements: For, Do while, while, ->Reference :1,Chap6
(Pg6.9-6.33)
2 Approved for Spring Session 2011-12
Part 2
Week 4 Lecture 11 Control transfer statements - break, continue. ->Reference :1,Chap6
(Pg6.42-6.47)
Lecture 12 Functions: Defining and accessing a function,
Function prototypes
->Reference :1,Chap7
(Pg7.1-7.20)
Week 5 Lecture 13 Functions & Introduction to Pointers: Passing
arguments ,call by value
->Reference :1,Chap7
(Pg7.20-7.26)
Lecture 14 Declaring and initializing pointers; call by address ->Reference :1,Chap10
(Pg10.5- 10.16)
Lecture 15 Recursive functions ->Reference :1,Chap7
(Pg7.26-7.33)
Week 6 Lecture 16 Arrays: Defining arrays ;declaration and initialization
of arrays
->Reference :1,Chap9
(Pg9.1-9.7)
Lecture 17 I/O & Processing of arrays ->Reference :1,Chap9
(Pg9.7-9.10)
Lecture 18 Dynamic memory Allocation, memory leak ->Reference :1,Chap10
(Pg10.20- 10.23)
Week 7 Lecture 19 Arrays & Functions: Passing array to a function ->Reference :1,Chap9
(Pg9.10-9.24)
Lecture 20 Arrays and Strings; built-in library functions to
manipulate strings
->Reference
:1,Chap9(Pg9.32-
9.35)
->Reference
:4,Chap8(Pg8.1-8.8)
Lecture 21 Array of strings, passing strings to a function ->Reference :1,Chap9
(Pg9.32-9.35)
MID-TERM
Part 3
Week 8 Lecture 22 Structures: Defining and processing structures,
Declaring a structure (globally and locally)
->Reference :1,Chap11
(Pg11.1- 11.7)
Lecture 23 Memory requirement of structure, inputting/
outputting & processing using structures
->Reference :1,Chap11
(Pg11.8- 11.20)
Lecture 24 Structures & Unions: Array of structures, nested
structures
->Reference :1,Chap6
(Pg6.1-6.3)
Week 9 Lecture 25 Self-referential Unions; union of structures; bit-fields. ->Reference :1,Chap11
(Pg11.1- 11.6) Chap13
(Pg13.17- 13.27)
Lecture 26 Pointers: pointer arithmetic ->Reference :1,Chap10
(Pg10.23- 10.26)
3 Approved for Spring Session 2011-12
Week 9 Lecture 27 Array & Pointers, pointers and strings ->Reference :1,Chap10
(Pg10.16- 10.19)
Week 10 Lecture 28 Pointers and structures; Pointers and functions ->Reference :1,Chap11
(Pg11.24- 11.41)
Lecture 29 Storage Classes: Storage classes and their usage,
concept of scope ,visibility and lifetime of variables
->Reference :1,Chap8
(Pg8.1-8.11)
Part 4
Week 10 Lecture 30 Local & global variable/function declaration ->Reference :1,Chap8
(Pg8.2-8.11)
Week 11 Lecture 31 Various storage classes(Automatic and Register
class)
->Reference :1,Chap8
(Pg8.2-8.5) Chap13
(Pg13.1- 13.4)
Lecture 32 Static and External storage class ->Reference :1,Chap8
(Pg8.5-8.15)
Lecture 33 File handling: Opening a file, file opening modes ->Reference :1,Chap12
(Pg12.1- 12.11)
Week 12 Lecture 34 Reading from and writing to files ->Reference :1,Chap12
(Pg12.1- 12.11)
Lecture 35 Manipulating file pointers using fseek(), rewind() and
ftell() functions
->Reference :4,Chap12
(Pg12.1- 12.6)
Lecture 36 Random accessing files, file Updation ->Reference :4,Chap12
(Pg12.1- 12.6)
Week 13 Lecture 37 Managing multi file programs and projects: making
executable files
->Reference :1,Chap2
(Pg2.10- 2.12)
Lecture 38 Creating your own library files and header files ->Reference :1,Chap14
(Pg14.1- 14.7)
Lecture 39 Adding user defined functions in existing library. ->Reference :1,Chap14
(Pg14.12- 14.21)
Spill Over
Week 14 Lecture 40 Enumerations, Command Line Parameters ->Reference :1,Chap14
(Pg14.1- 14.7) Chap14
(Pg14.8- 14.11)
Lecture 41 More About Library Functions, Macros ->Reference :1,Chap14
(Pg14.11- 14.12)
Chap14(Pg14.12-
14.21)
4 Approved for Spring Session 2011-12
Details of homework and case studies
Homework No. Objective Topic of the Homework Nature of homework
(group/individuals/field
work
Evaluation Mode Allottment /
submission
Week
Homework 1 To check the
knowlegde of
students
Problem Solving & Program Planning : Need for problem solving
and planning a program.Program design tools,Basic Of Computer
Languages,Translators,Phases in development of a
program/software,Structure of C ,Character
Set,Delimiters,Keywords,Identifiers,Constants,Variables,Data
Types, Declaring & Initializing variables,Operators & Expressions
:Various operators Precedence & Associativity ,Type
Conversion.,Handling Input/Output : Unformatted & Formatted
I/O,Control Statements:Sequence Control,Conditional control
Statements,Looping Control,Jumping Control,Functions
Individual Step marking 3 / 5
Mini project 1 To check practical
knowledge of
students.
Scientific Calculator,Digital Calendar,Mobile Service Provider
Database,University Management system,Employee
Details,Salary Slip Generation,Expenses Calculator,Hardware
Management System,C Programming Database,Books Sale and
Purchase System,Attendance Record System,Examination
Seating Plan System,Paper Setter System,Parking Record
System,Gate Pass Generation System
Individual Checking level of
coding and output.
3 / 11
Test 1 To check
knowledge of
students.
Storage Classes, Arrays,Pointers,String,Structure Individual Step marking 10 / 10
Scheme for CA:out of 100*
Component Frequency Out Of Each Marks Total Marks
Homework,Test,Mini project 2 3 10 20
Total :- 10 20
* In ENG courses wherever the total exceeds 100, consider x best out of y components of CA, as explained in teacher's guide available on the
UMS
List of suggested topics for term paper[at least 15] (Student to spend about 15 hrs on any one specified term paper)
Sr. No. Topic
1 Mobile Service provider database
2 University Management System
5 Approved for Spring Session 2011-12
3 Employee Details
4 Salary Slip Generation
5 Expenses Calculator
6 Hardware Management System
7 C Programming Database
8 Books Sale and Purchase System
9 Attendance Record System
10 Examination Seating Plan System
11 Paper Setter System
12 Parking Record System
Plan for Tutorial: (Please do not use these time slots for syllabus coverage)
Tutorial No. Lecture Topic Type of pedagogical tool(s) planned
(case analysis,problem solving test,role play,business game etc)
Tutorial 1 C Programming Fundamentals Problem solving
Tutorial 2 Control Structures Problem solving
Tutorial 3 Functions Problem solving
Tutorial 4 Recursive Functions Problem solving
Tutorial 5 Storage Classes Problem solving
Tutorial 6 Arrays Problem solving
Tutorial 7 Arrays with functions Problem solving,Test
After Mid-Term
Tutorial 8 Pointers Problem solving
Tutorial 9 Strings Problem solving
Tutorial 10 Test 1 Problem solving
Tutorial 11 Structure ,Union and Enumerations Problem solving
Tutorial 12 Arrays of structure variables (instances) Problem solving
Tutorial 13 File Handling Problem solving,Test
6 Approved for Spring Session 2011-12
7 Approved for Spring Session 2011-12