Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
0% found this document useful (1 vote)
354 views

COSC 1101 Programming Fundamentals

This document provides a tentative weekly course plan for a Programming Fundamentals course over 16 weeks. It outlines the course learning outcomes, reference materials, topics to be covered each week including introduction to programming, conditional structures, arrays, functions, pointers, and file handling. It also describes the student evaluation criteria involving assignments, tests, projects, and papers. Finally, it lists the student responsibilities such as attending class and completing assignments on time.

Uploaded by

Saqib
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (1 vote)
354 views

COSC 1101 Programming Fundamentals

This document provides a tentative weekly course plan for a Programming Fundamentals course over 16 weeks. It outlines the course learning outcomes, reference materials, topics to be covered each week including introduction to programming, conditional structures, arrays, functions, pointers, and file handling. It also describes the student evaluation criteria involving assignments, tests, projects, and papers. Finally, it lists the student responsibilities such as attending class and completing assignments on time.

Uploaded by

Saqib
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

Department of

Computer Science

Tentative Weekly Course Plan

Course Title Programming Fundamentals


Course Code COSC-1101 Credit Hour 4 (3+1)

Course Learning Outcomes (CLOs):

1. Understand basic problem-solving steps and logic constructs.


2. Apply basic programming concepts.
3. Design and implement algorithms to solve real world problems.

1. Reference Books

i. Beginning
i C++ by Ivor Horton, Apress, 2nd Edition, ISBN-13: 978-1484200087
.

Resource Material ii. C++ How to Program, by Paul Deitel & Harvey M. Deital

iii. Starting
i out with Programming Logic & Design by Tony Gaddis, Pearson, 4th
Edition,
i 2015; ISBN-13: 978-0133985078.

2. Web Resources

i. http://www.w3schools.com

ii. https://www.tutorialspoint.com/cplusplus/

TOPICS TO BE COVERED

Week # Topics (outline of main topics and sub topics) Tutorial


/Laboratory

Introduction to Programming Part 1


• Introduction to Computer Program,

• Problem Solving,

• Algorithm,
1
• Pseudocode,

• Flow Charts,

• Generations of Programming Languages.

Page # 1 / 5
Department of
Computer Science

• Basic C++ Program,

• C++ basic program construct,

• Pre-processor directives,

• Header files, Main function, Comments, Output in C++ program

Introduction to Programming Part 2

• Program development Stages,

• History of C++,

• Features of C++,

• Programming Techniques: Structured & Modular,


2
• Identifiers, Types of identifiers, keywords,

• Datatypes,

• Variables, Variable declaration, Variable initialization,

• Size of operator,

• Limits of Datatypes.

Programming in C++ Part 1

• Constants, Expressions, escape sequences,

• Operators (Unary and Binary),

• Assignment Statement,

• Compound Assignment statement.


3
• Increment Operator and Decrement Operator,

• Operator Precedence

• Input/ output Program,

• how to take user input,

• Types of errors

Page # 2 / 5
Department of
Computer Science

• Conditional Structures in C++

• Integer over flow, underflow,

• Relational Operators,

• Type Casting, Implicit and Explicit type casting


4
• Control structures types (selection, repetition, function)

• Selection: Basic If/else statements, If-else-if statements

• Nested if

• Conditional Structures in C++

• Selection: Compound Structure/Statement,

• Logical Operators,
5
• Switch Statement,

• Conditional Operator Go-to statement

• Conditional Structures in C++

• Repetition: loop, while loop, do while loop,


6
• Pretest, posttest loop

• Control Structures in C++


7
• Repetition: for loop (Continue & break statement), nested for loop

• Arrays in C++

• Advantages of Arrays,
8 • Declaration of One-Dimensional Array,

• Accessing elements of array.

Mid Term Exam

Page # 3 / 5
Department of
Computer Science

• Arrays in C++

• Accessing elements of Array by using loops,

• Searching in Arrays (Sequential),


9
• Binary Search,

• Sorting in Arrays

• Structures,
10 • Union,
• Enumeration

• Functions in C++

• Types of Functions: (Built in functions),

• User defined functions,


11
• Function declaration, definition

• Function call.

• Functions in C++

• Scope of Functions,
12
• pass by value, and pass by reference.

• Functions in C++

• Returning value from function,


13
• Static variables, local variables, global variables

14 • Pointers

15 • File Handling

16 • Project Week
Final Term Exam

Student Evaluation Criteria:


Workshop / Assignments/Case study 2%

Surprise Test/Sudden Test, Quizzes 3%

Page # 4 / 5
Department of
Computer Science

Semester Project 15%


Mid Term Paper 30%

Final Term paper 50%

Total 100%

Student Responsibilities:
Students must attend class. Failure to attend class may result in failure in the course. Students must also arrive on time
and remain in class for the entire period. Cellular Phones and Beeper must be Turned off (Proper classroom
decorum [behavior] adopts, Course outlines and calendars explain requirements and assignments, students are responsible
for knowing what they say. Students are also responsible for doing all assigned work on time. Excessive absences (more
than 03) will result in “F Grade”. Students may prepare Sketchbook for taking notes and for references.

_______________________________
Instructor/ Subject Specialist

____________________________
Chairman/ Head of Department

Page # 5 / 5

You might also like