Ip CSE101
Ip CSE101
Format For Instruction Plan [for Courses with Lectures and Labs ]
Course No. CSE101
FOUNDATIONS OF COMPUTING
Course Title:
L: 3
T: 0
P: 4
Cr: 5
Course Planner :-
TextBook
1. Byron Gottfried , Programming With C, Tata McGraw Hill Publishing Company Limited, New Delhi
Other Specific Books
2. 3. 4. 5. 6.
Relevant Websites
Author: Ashok N. Kamthane,Title: Programming with ANSI & Turbo C,Publishers: Pearson Educationl B.W. Kernighan and D.M. Ritchie, The C Programming Language, Prentice Hall of India, New Delhi E.Balagurusamy , Programming in ANSI C , Tata McGraw Hill Publishing Company Limited, New Delhi. Behrauz A.Foruzan & Richard F.Gilberg , Computer science A structure programming approach Using C , Thomson Asia , 2001 P.K. Sinha & Preeti Sinha, Computer Fundamentals, BPB Pub., New Delhi.,1990
Sr. No.
Web adress
Salient Features
7 8 9 10 11 12 13
Provides online tutorials on basics of C programming language his is a C Programming Tutorial for people who have a little experience of any programming language Provides animations on looping PPT Slides on Control Structures String Library Functions handling multiple files Writing your own header files
Page 1 of 9
Part 1
Week 1
Problem Solving & Program Planning: Need for problem solving and planning a program Program design tools - flow charts Algorithms and pseudo codes Decision tables Basics of C Language: Phases in the development of a program, Compilers & Interpreters Declarations: 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
Book :6,Ch11 Book :6,Ch11 Book :6,Ch11 Book :6,Ch11 Book :2,Ch1/1.3-1.6 http://www.tenouk.com/ ModuleW_files/ccompile rlinker001.png
HomeWork 1 Allocation Term Paper 1 Allocation
Week 2
Lecture 4 Lecture 5
Lecture 6
Week 3
Book :1,Ch2/ 2.1-2.3 Book :1,Ch2/ 2.7-2.10 Book :1,Ch3/ 3.1-3.5 Book :1,Ch3/ 3.5 Book :1,Ch4/ 4.1-4.8
Week 4
Lecture 10
Part 2
Week 4
Lecture 11 Lecture 12
Decision making statements if, else if, switch Control Statements: For, do while, while
Week 5
Control transfer statements - break, continue. Functions: Defining and accessing a function Functions Passing arguments call by value Introduction to Pointers, Declaring and initializing pointers
Book :1,Ch6/ 6.8-6.10 Book :1,Ch7/ 7.1-7.3 Book :1,Ch7/ 7.5 Book :1,Ch10/ 10.1-10.2
Week 6
Lecture 16
Page 2 of 9
Part 2
Week 6
Lecture 17 Lecture 18
call by address, function prototypes recursive functions Storage Classes: Storage classes and their usage various storage classes(Automatic, Register, Static and External storage class) concept of scope ,visibility and lifetime of variables, local & global variable/function declaration
Book :1,Ch7/ 7.4-7.6 Book :1,Ch7/ 7.6 Book :1,Ch8/ 8.1 Book :1,Ch8/ 8.2-8.4 Book :1,Ch8
HomeWork 2 Submission
Week 7
MID-TERM
Part 3
Week 8
Arrays: Defining arrays ;declaration and initialization of arrays, I/O & Processing of arrays Dynamic memory Allocation, memory leak Arrays & Functions: Passing array to a function Arrays and Strings; built-in library functions to manipulate strings array of strings, passing strings to a function Structures: Defining and processing structures, Declaring a structure (globally and locally) memory requirement of structure, inputting/ outputting & processing using structures. Structures & Unions: Array of structures, nested structures
Book :1,Ch9/ 9.1-9.2 Book :1,Ch10/10.5 Book :1,Ch9/9.3 Book :4,Ch8/8.1-8.8 Book :1,Ch9/9.5 Book :1,Ch11/ 11.1- 11.3 Book :1, Book :3,Ch6/6.3
HomeWork 4 Allocation HomeWork 3 Allocation
Week 9
Week 10
Lecture 28 Lecture 29
Part 4
Week 10 Week 11
Lecture 30 Lecture 31
self-referential Unions; union of structures; bit-fields Pointers: pointer arithmetic; Array & Pointers
HomeWork 3 Submission
Page 3 of 9
Part 4
Week 11
Lecture 32
Book :1,Ch10/ 10.4 Ch11/ 11.4 Book :1,Ch10/ 10.4 Book :1,Ch12/ 12.1- 12.2 Book :1,Ch12/ 12.3 Book :4,Ch12/ 12.6 12.5 Book :4,Ch12/ 12.6 12.5 Book :12, Book :13,
HomeWork 4 Submission Term Paper 1 Submission
Lecture 33
Week 12
pointers and functions Dynamic memory Allocation File handling: Opening a file, file opening modes reading from and writing to files manipulating file pointers using fseek(), rewind() and ftell() functions, random accessing files, file updation Managing multi file programs and projects: making executable files ,creating your own library files and header files creating your own library files and header files, adding user defined functions in existing library
Week 13
Spill Over
Week 14
Book :1,Ch14/ 14.2 Book :1,Ch14/ 14.4 Book :3,Ch6/6.4 Book :3,Ch4/4.11
Week 15
Lecture 43
Page 4 of 9
Homework 1
algorithms, flow charts, pseudo codes, decision tables , Character Set, delimiters, keywords, identifiers, constants, variables, data types, declaring & Initializing variables. Opreators & Expressions: Various operators, precedence & Associativity, Type Conversion Decision making statements if, else if. Control Statements: For, do while, while, Control transfer statements - break, continue. Functions: Defining and accessing a function Passing arguments Def and initialization of arrays, I/O & Processing of arrays, Dynamic mem Allocation, memory leak Arrays & Functions: Passing array to a function;Strings; built-in library func to manipulate strings, array of strings, passing strings to func Structures: processing structures, Declaring a structure Structures & Unions: nested structures, self-referential Unions; union of structures; bit-fields pointer arithmetic; Array & Pointers, pointers and strings; pointers and structures; pointers and functions Dynamic memory Allocation file opening modes, reading from and writing to files,
Individual
Homework 2
Individual
Homework 3
Individual
Homework 4
Individual
*Normally all the homeworks shall be submitted online but in special courses where homeworks cannot be submited online , the insructor can edit the mode of submission while entering the IP Details
1 10 3 4
Total :-
25 3 15
25 30 45
100
* 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
Page 5 of 9
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 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17
Railway reservation Library management system Shopping mall Scientific calculator Calendar Book store Management System Bill book Petrol pump mgt. system Pay calculation of a employee Airline ticket reservation system Hotel management(hospitality) Banking system Electronic Goods Mobile Service provider database Distributor Management System Fee structure of a university University course details
*Each experiment of the lab will be evaluated using following relative scheme:
Component
% of Marks
VIVA WR J/E
30 20 50
Page 6 of 9
Before Mid-Term
implementation 1
1. to print name, address, ph no details of student 2. addition of two numbers 3. division of two numbers Program to find greatest among three numbers Programs to calculate vol & area of sphere using symbolic const PI=3.14 Program to convert centigrade temp. into Fahrenhiet temp. Programs for generating Fibonacci series, prime numbers, Program to display 4-digit number in opposite order Program to find the factorial of a number. Program to print average Marks of N students Program to print GCD of Two numbers Menu driven programs using switch statement to do different arithmetic operations
PC, Turbo C
implementation 2
PC, Turbo C
implementation 3
PC, Turbo C
implementation 4
PC, Turbo C
Page 7 of 9
implementation 5
Programs to demonstrate the use of continue, break and conditional operators like days of the week and months based on selection of a character from user. Program to print the following pyramid: 1 121 12321 1234321 123454321 Program to find whether the string is Palindrome or not Programs to demonstrate passing of variables to functions by values and by address (pointer) Addition of n numbers using pointer to functions and also to call the function using pointer variable.
PC, Turbo C
implementation 6
PC, Turbo C
After Mid-Term
implementation 7
Addition of n numbers using pointer to functions and also to call the function using pointer variable. Arithmetic operations on matrices program to display array elements in reverse order Programs demonstrating the use of pointers in arrays Program to read a string from keyboard and display that string using character pointer to enter names of some states and show all the entered state names alphabetically.
PC, Turbo C
implementation 8
PC, Turbo C
Page 8 of 9
implementation 9
Creating various types of records using structures; String manipulation - comparing, copying, reversing , finding length, extracting characters; Program to pass structure variables to a function and returning of a structure variable from a function Program based on dynamic memory allocations. Programs demonstrating the use of pointers in functions; Programs to manipulate arrays sorting and searching Write a function to insert another string into array of strings sorted in alphabetical order. to read and write record into file. to copy contents of one file into another. to search and delete a particular record from file
PC, Turbo C
implementation 10
PC, Turbo C
implementation 11
PC, Turbo C
Spill Over
implementation 12
program which will read a line of text and delete from it all occurrences of word 'the'. to find LCM of two positive numbers program to display a given matrix along with the row sums and column sums.
PC, Turbo C
implementation 13
PC, Turbo C
Page 9 of 9