0% found this document useful (0 votes)
3 views

Programming Fundamental Lab IT-105

The document outlines the course objectives and weekly plan for the Programming Fundamentals (Lab) course at the University of Gujrat, focusing on basic structured programming skills using C++. It covers topics such as problem analysis, algorithm design, program development, and testing, along with a detailed weekly breakdown of the course content. Students will gain hands-on experience with C++ constructs and learn to create, test, and debug programs.

Uploaded by

syedkashanali623
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
3 views

Programming Fundamental Lab IT-105

The document outlines the course objectives and weekly plan for the Programming Fundamentals (Lab) course at the University of Gujrat, focusing on basic structured programming skills using C++. It covers topics such as problem analysis, algorithm design, program development, and testing, along with a detailed weekly breakdown of the course content. Students will gain hands-on experience with C++ constructs and learn to create, test, and debug programs.

Uploaded by

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

University of Gujrat

University of Gujrat
Faculty of C & IT
Course Objectives, Content and Weekly Plan
Title Programming Fundamental (Lab)
Code IT-105
Credit Hours 1
Prerequisite No
Prerequisite Skills No
Category Core
The course is designed to familiarize students with the basic structured programming skills. It emphasizes upon problem analysis,
algorithm designing, program development and testing. They will also be exposed to the C++ programming language commands, syntax
and functions in text based environment. They will learn to define, solve, code, test and document programming problems using the C++
language.
Upon completing this course, students should be able to:
Prepare programs using top-down structured design.
Aims and Objectives Perform problem solving skills.
Understand the syntax and concepts of C++ programming language.
Design, create, test and debug C++ programs.
Developed programs that are both syntactically and logically correct.
The student will be able to understand basic designing techniques of programming language.
Hands on experience of different C/C++ constructs.

A. C++ How to program by DEITEL AND DEITEL


Text Book/s

A. Let us C by Yashwant Kantaker


Reference Material B. C++ How to program by DEITEL AND DEITEL
C. Hanly Koffman – Problem Solving & Program Design in C – Addison Wesley 3rd addition.
University of Gujrat

Course Content and Weekly Plan


Week Lab Topic

 INTRODUCTION
 Course Policies
 Overview
 Course Contents
 Course Objectives
1
 INTRODUCTION TO COMPUTER:
 Computer hardware components
 Computer software components.
 Operating systems, compiler, interpreter, editor, application
1 Source file and object file

 INTRODUCTION TO PROGRAMMING:
 Programming languages
 Machine language, assembly, high level programming language
2  C/C++ language
 Program Life Cycle
 Steps for creating, compiling and executing a C program
 C programming environment.
 Sample C program

 PROBLEM SOLVING
 Software development method.
3  Problem analysis.
 Design and algorithm representation – flowchart, pseudo code.
 Testing and verification & Implementation.
2  Program documentation.
 GETTING STARTED WITH C/C++:
 The C Character Set
4  Constants, Variables and Keywords
 Types of C constants and variables
 C character set and tokens – reserved words, identifiers
 Constants, string literals.
‘]]’
[‘
University of Gujrat

 C PROGRAM STRUCTURE:
 Preprocessor directives.
 Types of Preprocessor directives.
5  Main function and body of the main function.
 Statements, compound statements.
 Standard Input-Output functions in C/C++.
3  Comments and types of comments.
 CONCEPT OF DATA TYPES:
 Data types causes and reasons.
 Classification of data and their supportive type’s analogy.
6
 Data types supported by C/C++.
 Range and Limitations of different data types.
 Type casting and conversion.
 VARIABLES DECLARATIONS AND INITIALIZATION:
 How to declare a variable in C/C++.
 How to initialize the variable.
7  Defining the variables.
 Naming conventions and variables description.
 Rules for declaring the name of variables.
4  Escape Sequence characters.
 STANDARD INPUT-OUTPUT FUNCTIONS IN C/C++:
 What is standard input and Output?
 Input and out functions supported by C/C++.
8

 BASIC C/C++ OPERATORS:


 Arithmetic operators.
 Assignment operators.
9
 Equalities and relational operators.
 Logical operators.
 Conditional operators.
5
THE DECISION CONTROL STRUCTURE USING IF:
 The if statement.
 Flow chart of if statement.
10
 Multiple statements within if.
 Examples and Exercise.
 The goto statement.
University of Gujrat

THE DECISION CONTROL STRUCTURE USING IF-ELSE:


 The if-else statement.
 Flow chart of if-else statement.
11
 Multiple if-else Statements.
 Nested if-else’s.
 The break statement.
6
THE DECISION CONTROL STRUCTURE USING SWITCH-CASE:
 Syntax of Switch-case statements.
12  Difference of switch case with multiple if-else statements.
 Benefits and limitations of switch-case statements.
 Examples and Exercise.

THE REPETITION CONTROL STRUCTURE USING FOR LOOP:


 What is a loop?
 Elements or components of a loop.
13
 Syntax of for loop.
 Flow chart of for loop to understand it’s working.
7  for loop as counter controlled loop?
THE REPETITION CONTROL STRUCTURE USING WHILE LOOP:
 Syntax of while loop.
14  Flow chart of while loop to understand it’s working.
 What is a counter/sentinel controlled loop?
 Sentinel value controlled loop vs. counter controlled loop.

8 15, 16 Mid Term Examinations

THE REPETITION CONTROL STRUCTURE USING DO-WHILE LOOP:


 Syntax of do-while loop.
17  Working of do-while loop using Flow chart.
 Difference between while and do-while.
 An application of do-while loop for data validation.

9 THE NESTED REPETITION CONTROL STRUCTURES & CONTINUE


STATEMENTS:
 What is nested loop?
18  Working of nested loop using flow chart.
 Nested for loop.
 Infinite loop.
 The continue statement.
University of Gujrat

THE SIMPLE FUNCTIONS:


 Why use functions?
 Standard functions.
 User defined functions.
19
 Signature of the functions.
 Function prototype.
 Function definition.
10  Function call.
THE FRUITFUL & PARAMETERIZED FUNCTIONS:
 Functions that return a value.
 Parameters and use of arguments to pass data to a function.
20
 Formal / Actual parameters.
 Parameters vs. arguments.
 Passing values between functions.

THE FUNCTIONS & SIMPLE RECURSION:


 Using more than one function.
 Local and global variables.
21
 What is recursion?
 Example using recursion.
 Recursion vs. iteration.
11

THE ARRAYS CONSTRUCT I:


 Concept of arrays – why, how, advantages.
22
 Array declaration and initialization.
 A simple program using array.
 Referring to individual elements of the array.

THE ARRAYS CONSTRUCT II:


 Operation on arrays – simple sorting and Searching.
23
 Passing arrays to the functions as argument.
 Initializing a two-Dimensional array.
 Multidimensional arrays.
12
THE STRING CONSTRUCT I:
 String and String constant.
24
 String variables.
 The string I/O functions gets() and puts()
 Initializing strings.
University of Gujrat

THE STRING CONSTRUCT II:


 String handling library functions:
25  strlen ()
 strcpy ()
 strcat ()
 strcmp ()
13
THE POINTERS CONSTRUCT:
 Concept of pointers.
26  Pointers overview.
 Pointer declaration and control.
 Pointer operator (& and *).
 Parameter passing by pointers.
THE STRUCTURES CONSTRUCT:
 Why use structures.
 Structures declaration.
27  Structure variables declaration.
 Initializing structure variables.
 Accessing structures elements.
14  Referencing structure members.

THE STRUCTURES AND UNION CONSTRUCT:


 Nested structures.
28  Uses of structures.
 Concept of Unions.
 Unions vs. structures.
 Unions of structures.

THE FILE HANDLING I:


 Basic of files.
 Types of Disk I/O.
29
 Standard Input/output.
 Binary Mode and Text Mode.
 File operators.
15  End-Of-File.

THE FILE HANDLING II:


 Opening and closing a file.
30  Writing to a file.
 Reading from a file.
 Error condition.
 Record input/output.
University of Gujrat

REVISIONS :
16 31, 32
Tying-up loose ends.

You might also like