Scheme of Studies for BS (Computer Science) 2023

Curriculum / Course Outline

BS Computer Science

National University of Modern Languages, Islamabad

 Scheme of Studies for BS (Computer Science) 2023
Table of Contents
OBJECTIVES .................................................................................................................................... 1
VISION STATEMENT OF THE DEPARTMENT OF COMPUTER SCIENCE .................................................. 1
PROGRAM MISSION – BACHELOR OF COMPUTER SCIENCE ................................................................ 1
PROGRAM EDUCATIONAL OBJECTIVES ............................................................................................. 1
PROGRAM LEARNING OUTCOMES ..................................................................................................... 1
AREAS COVERED IN BS IN COMPUTER SCIENCE ............................................................... 3
SCHEME OF STUDY FOR BS COMPUTER SCIENCE............................................................. 6
DETAILED COURSE OUTLINES ................................................................................................. 8
SEMESTER I ..................................................................................................................................... 9
INTRODUCTION TO INFORMATION AND COMMUNICATION TECHNOLOGIES ..................................... 10
INTRODUCTION TO INFORMATION AND COMMUNICATION TECHNOLOGIES-LAB ............................. 13
PROGRAMMING FUNDAMENTALS .................................................................................................... 15
PROGRAMMING FUNDAMENTALS-LAB............................................................................................ 18
ENGLISH COMPOSITION & COMPREHENSION .................................................................................. 21
PAKISTAN STUDIES ......................................................................................................................... 23
ISLAMIC STUDIES ............................................................................................................................ 25
APPLIED PHYSICS............................................................................................................................ 28
PRE-MATH-I ................................................................................................................................... 31
SEMESTER II.................................................................................................................................. 33
OBJECT ORIENTED PROGRAMMING ................................................................................................. 34
OBJECT ORIENTED PROGRAMMING-LAB ........................................................................................ 37
COMMUNICATION & PRESENTATION SKILLS................................................................................... 39
UNIV. ELEC. - I, INTRO. TO PSYCHOLOGY ....................................................................................... 41
CALCULUS AND ANALYTICAL GEOMETRY ...................................................................................... 45
DISCRETE STRUCTURES .................................................................................................................. 47
UNIV. ELEC. - II, SOCIAL SERVICE .................................................................................................. 49
PRE-MATH-II .................................................................................................................................. 51
SEMESTER III ................................................................................................................................ 53
DIGITAL LOGIC DESIGN .................................................................................................................. 54
DIGITAL LOGIC DESIGN-LAB .......................................................................................................... 57
DATA STRUCTURES AND ALGORITHMS ........................................................................................... 61
DATA STRUCTURES AND ALGORITHMS-LAB ................................................................................... 65
LINEAR ALGEBRA ........................................................................................................................... 68
PROFESSIONAL PRACTICES ............................................................................................................. 71
CS SUPPORTING- I, MULTI VARIABLE CALCULUS .......................................................................... 75
SEMESTER IV ................................................................................................................................ 77
DESIGN & ANALYSIS OF ALGORITHMS ........................................................................................... 78
SOFTWARE ENGINEERING ............................................................................................................... 81
CS ELEC. - I, WEB-PROGRAMMING ................................................................................................. 84
CS ELEC. - I, WEB-PROGRAMMING-LAB ........................................................................................ 86
CS SUPPORTING - II, DIFFERENTIAL EQUATIONS ............................................................................ 89
CS ELEC. - II, ADVANCE OOP ........................................................................................................ 92
National University of Modern Languages, Islamabad
 Scheme of Studies for BS (Computer Science) 2023
CS ELEC. - II, ADVANCE OOP-LAB ................................................................................................ 95
UNIV. ELEC. - III, DIGITAL MARKETING ......................................................................................... 98
SEMESTER V ................................................................................................................................ 101
DATABASE SYSTEMS .................................................................................................................... 102
COMPUTER ORGANIZATION AND ASSEMBLY LANGUAGE ............................................................. 107
COMPUTER ORGANIZATION AND ASSEMBLY LANGUAGE-LAB ..................................................... 110
OPERATING SYSTEMS ................................................................................................................... 113
OPERATING SYSTEMS-LAB ........................................................................................................... 116
CS SUPPORTING - III, NUMERICAL COMPUTING ........................................................................... 122
SEMESTER VI .............................................................................................................................. 124
CS ELEC. - III, VISUAL PROGRAMMING ........................................................................................ 125
CS ELEC. - III, VISUAL PROGRAMMING-LAB ................................................................................ 128
COMPUTER NETWORKS ................................................................................................................. 131
COMPUTER NETWORKS-LAB ........................................................................................................ 134
ARTIFICIAL INTELLIGENCE............................................................................................................ 136
ARTIFICIAL INTELLIGENCE-LAB ................................................................................................... 140
AUTOMATA THEORY..................................................................................................................... 142
TECHNICAL BUSINESS WRITING ................................................................................................... 145
SEMESTER VII ............................................................................................................................. 147
CS ELEC. - IV, COMPUTER GRAPHICS........................................................................................... 148
CS ELEC. - IV, COMPUTER GRAPHICS-LAB .................................................................................. 151
CS ELEC. - V, SOFTWARE PROJECT MANAGEMENT ...................................................................... 154
COMPILER CONSTRUCTION ........................................................................................................... 157
INFORMATION SECURITY .............................................................................................................. 160
UNIV. ELEC. - IV, FOREIGN LANGUAGE (CHINESE) ...................................................................... 163
SEMESTER VIII ........................................................................................................................... 165
CS ELEC. - VI, MOBILE APPLICATION DEVELOPMENT.................................................................. 166
CS ELEC. - VI, MOBILE APPLICATION DEVELOPMENT-LAB ......................................................... 169
PARALLEL AND DISTRIBUTED COMPUTING ................................................................................... 171
ECONOMICS FOR COMPUTING ....................................................................................................... 173
FINAL YEAR PROJECT ................................................................................................................... 176
RUBRICS........................................................................................................................................ 179
RUBRICS FOR FINAL YEAR PROJECT (FYP) EVALUATION ......................................... 180
RUBRICS TO EVALUATE FYP PROPOSAL....................................................................................... 180
RUBRICS TO EVALUATE FYP PROGRESS ....................................................................................... 182
RUBRICS TO EVALUATE FYP FINAL DEFENSE .............................................................................. 184
RUBRICS FOLLOWED BY SUPERVISOR TO EVALUATE FYP............................................................ 186
RUBRICS FOR LAB EVALUATION ......................................................................................... 188
RUBRICS TO EVALUATE SOFTWARE BASED LABS ......................................................................... 188
RUBRICS TO EVALUATE HARDWARE BASED LABS ....................................................................... 189
ASSESSMENT OF THEORY AND LAB: .................................................................................. 190
GRADING POLICY ...................................................................................................................... 190
National University of Modern Languages, Islamabad
 Scheme of Studies for BS (Computer Science) 2023

OBJECTIVES
The main objective of Computer Science program is to produce Computer Scientists having strong
knowledge and understanding about theoretical concepts and comprehensive skills of computing
tools to solve complex computing problems.

Vision Statement of the Department of Computer Science

To be a Leading knowledge hub to perform industry oriented research and produce responsible
computer science professionals for positive contribution in society.

Program Mission – Bachelor of Computer Science

Fostering knowledge for research and innovation through latest computing technologies.

Program Educational Objectives

The program educational objectives for Bachelor of Science in Computer Science is to produce
graduates who will:

PEO-1: Contribute in computing industry nationally and internationally and develop

aptitude for analyzing problems and finding optimal solutions.

PEO-2: Solve real world problems through the use of modern computing tools.

PEO-3: Demonstrate effective written and verbal communication skills.

PEO-4: Establish ethical and moral values in professional life with an aim of learning new
skills and technologies for a life-long learning.

Program Learning Outcomes

Computing programs prepare students to attain educational objectives by ensuring that students
demonstrate achievement of the following outcomes (derived from Graduate Attributes defined by
Seoul Accord www.seoulaccord.org).

PLO 1: Academic Education: To prepare graduates as computing professionals

PLO 2: Knowledge for Solving Computing Problems: Apply knowledge of computing

fundamentals, knowledge of a computing specialization, and mathematics, science, and DOMAIN
knowledge appropriate for the computing specialization to the abstraction and conceptualization
of computing models from defined problems and requirements.

PLO 3: Problem Analysis: Identify, formulate, research literature, and solve complex computing
problems reaching substantiated conclusions using fundamental principles of mathematics,
computing sciences, and relevant DOMAIN disciplines.

1
 Scheme of Studies for BS (Computer Science) 2023
PLO 4: Design/ Development of Solutions: Design and evaluate solutions for complex
computing problems, and design and evaluate systems, components, or processes that meet
specified needs with appropriate consideration for public health and safety, cultural, societal, and
environmental considerations.

PLO 5: Modern Tool Usage: Create, select, adapt and apply appropriate techniques, resources,
and modern computing tools to complex computing activities, with an understanding of the
limitations.

PLO 6: Individual and Team Work: Function effectively as an individual and as a member or
leader in diverse teams and in multi-disciplinary settings.

PLO 7: Communication: Communicate effectively with the computing community and with
society at large about complex computing activities by being able to comprehend and write
effective reports, design documentation, make effective presentations, and give and understand
clear instructions.

PLO 8: Computing Professionalism and Society: Understand and assess societal, health, safety,
legal, and cultural issues within local and global contexts, and the consequential responsibilities
relevant to professional computing practice.

PLO 9: Ethics: Understand and commit to professional ethics, responsibilities, and norms of
professional computing practice.

PLO 10: Life-long learning: Recognize the need, and have the ability, to engage in independent
learning for continual development as a computing professional.

2
 Scheme of Studies for BS (Computer Science) 2023

Areas Covered in BS in Computer Science

Course Group – Common Courses Cr. Hrs. % age
Computing – Core 39 29%
General Education 19 14%
University Electives 12 09%
Mathematics & Science Foundation 12 09%
Common Courses 82 62%
Course Group – DOMAIN CS Cr. Hrs. % age
DOMAIN CS Core 24 18%
DOMAIN CS Supporting 9 07%
DOMAIN CS Electives 18 14%
DOMAIN CS courses 51 38%

TOTAL [Common + DOMAIN Courses] 133 100%

Common Courses for BS (COMPUTER SCIENCE)

1. Computing Core Courses – 30%

Course Title Cr. Hrs.
Programming Fundamentals 3-1
Object Oriented Programming 3-1
Data Structures & Algorithms 3-1
Discrete Structures 3-0
Operating Systems 3-1
Database Systems 3-1
Software Engineering 3-0
Computer Networks 3-1
Information Security 3-0
Final Year Project 0-6
Total 39 (27-12)

2. General Education Courses – 15%

Course Title Cr. Hrs.
English Composition & Comprehension 3-0
Technical & Business Writing 3-0
Communication & Presentation Skills 3-0
Professional Practices 3-0
Intro to Info. & Comm. Technologies 2-1
Pakistan Studies 2-0
Islamic Studies 2-0
Total 19 (18-1)

3
Scheme of Studies for BS (Computer Science) 2023
3. University Elective Courses – 9% (Not limited to the list below, Institutions
may add more courses)
Course Title Cr. Hrs.
University Elective-I, Social Service 1-0
University Elective-II, Intro. to Psychology 3-0
University Elective-III, Digital Marketing 3-0
University Elective-IV, Foreign Language 2-0
University Elective-V, Economic for Computing 3-0
Total 12 (12-0)
4. Mathematics and Science Foundation Courses – 9%
Course Title Cr. Hrs.
Applied Physics 3-0
Calculus & Analytical Geometry 3-0
Linear Algebra 3-0
Probability & Statistics 3-0
Total 12 (12-0)

DOMAIN Courses for BS (COMPUTER SCIENCE)

5. Computer Science CORE (Compulsory) courses – 18%

Course Title Cr. Hrs.
Compiler Construction 3-0
Comp. Organization & Assembly Language 3-1
Digital Logic Design 3-1
Design & Analysis of Algorithms 3-0
Parallel & Distributed Computing 3-0
Artificial Intelligence 3-1
Theory of Automata 3-0
Total 24 (21-3)

6. Computer Science SUPPORTING courses – 7%

Course Title Cr. Hrs.
Differential Equation 3-0
Multi Variable Calculus 3-0
Numerical Computing 3-0
Total 9 (9-0)

4
Scheme of Studies for BS (Computer Science) 2023

7. Computer Science ELECTIVE courses – 14%

Course Title Cr. Hrs.
CS Elective-I, Web Programming 2-1
CS Elective-II, Advance OOP 2-1
CS Elective-III, Visual Programming 2-1
CS Elective-IV, Computer Graphics 2-1
CS Elective-V, Software Project Management 2-1
CS Elective-VI, Mobile Application Development 2-1
Total 18 (12-6)

5
 Scheme of Studies for BS (Computer Science) 2023

Scheme of Study for BS Computer Science

Semester – I
Code Course Title Cr. Hrs. Pre-Requisites
CSIT-111 Intro. to Info. & Comm. Tech. 2-1
CSPF-141 Programming Fundamentals 3-1
ESEC-112 English Composition & Comprehension 3-0
SSPS-113 Pakistan Studies 2-0
SSIS-114 Islamic Studies 2-0
EEAP-121 Applied Physics 3-0
MTPM-161 Maths-I 3-0 (NC) Pre-Medical Only
TOTAL 15-2 (17)

Semester – II
Code Course Title Cr. Hrs. Pre-Requisites
CSOO-142 Object Oriented Programming 3-1 CSPF-141
ESPS-115 Communication and Presentation Skills 3-0 ESEC-112
SSIP-163 Univ. Elec. – I, Intro. to Psychology 3-0
MTCA-122 Calculus and Analytical Geometry 3-0
CSDS-143 Discrete Structures 3-0
SSSS-164 Univ. Elec. – II, Social Service 1-0
MTPM-162 Maths-II 3-0 (NC) Pre-Medical Only
TOTAL 16-1 (17)

Semester – III
Code Course Title Cr. Hrs. Pre-Requisites
EEDL-201 Digital Logic Design 3-1 EEAP-121
CSDA-244 Data Structures and Algorithms 3-1 CSOO-142
MTLA-223 Linear Algebra 3-0
CSPP-216 Professional Practices 3-0
MTMC-224 CS Supporting – I, Multi Variable Calculus 3-0
TOTAL 15-2 (17)

Semester – IV
Code Course Title Cr. Hrs. Pre-Requisites
CSAA-202 Design and Analysis of Algorithms 3-0 CSDA-244
SESE-245 Software Engineering 3-0
CSWP-265 CS Elec. – I, Web Programming 2-1 CSOO-142
MTDE-225 CS Supporting – II, Differential Equations 3-0
CSAO-267 CS Elec. – II, Advanced OOP 2-1 CSOO-142
CSDM-266 Univ. Elec. – III, Digital Marketing 3-0
TOTAL 16-2 (18)

6
Scheme of Studies for BS (Computer Science) 2023
Semester – V
Code Course Title Cr. Hrs. Pre-Requisites
CSDB-346 Database Systems 3-1 CSDA-244
CSCA-303 Computer Organization & Assembly 3-1
Language
CSOS-347 Operating System 3-1 CSDA-244
MTSP-326 Statistics & Probability 3-0
CSNC-327 CS Supporting – III, Numerical Computing 3-0
TOTAL 15-3 (18)

Semester – VI
Code Course Title Cr. Hrs. Pre-Requisites
CSVP-368 CS Elec. – III, Visual Programming 2-1 CSOO-142, CSDB-346
CSCN-348 Computer Networks 3-1
CSAI-304 Artificial Intelligence 3-1 CSDS-143
CSTA-305 Theory of Automata 3-0
ESTW-317 Technical & Business Writing 3-0
TOTAL 14-3 (17)

Semester – VII
Code Course Title Cr. Hrs. Pre-Requisites
CSCG-469 CS Elec. – IV, Computer Graphics 2-1
SESM-470 CS Elec. – V, Software Project Management 3-0
CSCC-406 Compiler Construction 3-0 CSTA-305
FLxx-471 Univ. Elec. – IV, Foreign Language 2-0
CSFP-499 Final Year Project – I 0-3 Programming Courses
CSIS-449 Information Security 3-0
TOTAL 13-4 (17)

Semester – VIII
Code Course Title Cr. Hrs. Pre-Requisites
CSMA-472 CS Elec. – VI, Mobile Application 2-1
Development
CSPD-407 Parallel & Distributed Computing 3-0 CSOS-347
CSEC-473 Univ. Elec. – V, Economics for Computing 3-0
CSFP-499 Final Year Project – II 0-3 Programming Courses
TOTAL 8-4 (12)

TOTAL CR. HRS. 133

7
Scheme of Studies for BS (Computer Science) 2023

Detailed Course Outlines

8
Scheme of Studies for BS (Computer Science) 2023

Semester I

9
 Scheme of Studies for BS (Computer Science) 2023
Introduction to Information and Communication Technologies
Course Code: CSIT-111

Semester Credit Hours Prerequisite

[BSCS-1] [2+1] [None]

Course Description
This course provides a very broad range of topics and prepares the students for various DOMAINs
in computing that they will face in upcoming semesters. This course is very comprehensive as it
provides every student a set of productivity tools that they will be able to use for the rest of their
lives. It provides knowledge and skills for use of computing and communication technologies to
solve real life problems. This is an introductory course about Information and Communication
Technologies that includes ICT terminologies, hardware and software components, the internet
and World Wide Web, and ICT based applications.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Define various types and components of C1
computer including input/output devices, C 1
memory, storage media Knowledge

CLO-2 Describe different types of software C2

from operating systems to system C 2
utilities and productivity apps Comprehension

CLO-3 Demonstrate the basic concepts

regarding computer networks, database
management and computer security from C2
C 4
a user point of view, components of Comprehension
computer including input/output devices,
memory, storage media
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
Introducing Today's Technologies Computers, Devices, and the Web: Computing Components,
Processors, Memory, the Cloud, and More. Input and Output Extending Capabilities of Computers
and Mobile Devices. Digital Storage Preserving Content Locally and, on the Cloud. Operating
Systems Managing, Coordinating, and Monitoring Resources, GUI and CLI with CLI
commands and their usages. Storing and retrieving Information & Input/output media and devices.
Communicating Digital Content Wired and Wireless Networks and Devices. Connecting and
Communicating Online the Internet, Websites, and Media. Computers and Mobile Devices

10
 Scheme of Studies for BS (Computer Science) 2023
Evaluating Options for Home and Work. Programs and Apps Productivity, Graphics, Security, and
Other Tools. Digital Security, Ethics, and Privacy Threats, Issues, and Defenses. Building
Solutions Database, System, and Application Development Tools. Numbering Systems: Binary,
Octal, Decimal and Hexadecimal, Base inter conversions, Binary arithmetic operations.

Course Weekly Schedule

The course schedule for 17 weeks is detailed below.

Week Topic
Technology, Types of Computers, Mobile & Game Devices, Data and Information, The
1
Web ,Web Searching, Online Social Networks, Internet Communications
Digital Security and Privacy, Viruses and Other Malware, Privacy, Health Concerns,
Environmental Issues, Programs and Apps, Operating Systems, Applications, Installing
and Running Programs, Developing Programs and Apps, Communications and Networks,
2
Wired and Wireless Communications, Networks, Technology Uses, Government,
Finance, Retail, Entertainment, Health Care, Science, Travel, Publishing, Manufacturing,
Technology Users
Online: The Internet, Websites and Media, The Internet , Evolution of the Internet ,
Connecting to the Internet, Internet Service Providers , How Data Travels the Internet ,
3
IP & MAC Addresses and Domain Names , The World Wide Web ,Navigating the Web,
Web Addresses, Web Apps and Mobile Apps
Types of Websites, Digital Media on the Web, Graphics ,Audio , Video, Plug-Ins , Other
4 Internet Services, Email , Email Lists , Internet Messaging, Chat Rooms , Online
Discussions ,VoIP, FTP ,Netiquette
Evaluating Computers and Mobile Devices, Mobile Computers and Desktops, Laptops,
Tab and Other Mobile Computers, Handheld Computers, Desktops and All-in-Ones,
5
SServers , Terminals , Point-of-Sale Terminals, Wearable Devices ,Game Devices,
Embedded Computers
Inside the Case, The Motherboard , Processors, The Control Unit, The Arithmetic Logic
Unit, Machine Cycle , Registers , The System Clock, Personal Computer and Mobile
6
Device Processors, Processor Cooling, The Internet of Things, Cloud Computing , Cloud
Computing Services
Memory, Bytes and Addressable Memory, Types of Memory, RAM, Cache, ROM, Flash
Memory, CMOS , Memory Access Times, Adapters, Adapter Cards, USB Adapters,
7
Buses, Bus Width , Types of Buses ,Power Supply and Batteries, Data Representation &
Number System
Programs and Apps, Role of the Operating System ,Obtaining Software, Installing
8 Software, Categories of Programs and Apps, Multimedia and Interest Applications,
Communications Applications ,File, Disk, and System Management Tools
9 Mid Term Exams

11
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
Operating Systems, Operating System Functions, Starting Computers and Mobile
10 Devices ,Shutting Down Computers and Mobile Devices, Providing a User Interface ,
Managing Programs, Managing Memory
Types of Operating Systems , Desktop Operating Systems , Windows/Mini Feature, Mac
11 OS/Mini Feature , Unix ,Linux ,Chrome Os, Running Multiple, Systems, Android ,
iOS ,Windows Phone Mobile versus Desktop Operating Systems
Communications , Networks, LANs, MANs, WANs, and PANs, Network Architectures ,
12 Communications Software, Communications Network, Communications Standards and
Protocols
Communications Lines, Transmission Media , Physical Transmission Media, Twisted-
13 Pair Cable , Coaxial Cable ,Fiber-Optic Cable, Wireless, Infrared , Broadcast
Radio ,Cellular Radio, Microwaves
CH 5 :Digital Security Ethics, and Privacy: Threats, Issues, and Defenses
14 Digital Security Risks , Cybercrime, Internet and Network Attacks Malware , Botnets,
Encryption , Digital Signatures and Certificates, Hardware Theft, Vandalism, and Failure
Backing Up — The Ultimate Safeguard, Wireless Security , Ethics and Society,
Information Accuracy, Intellectual Property Rights , Codes of Conduct , Cookies ,
15 Phishing, Spyware and Adware, Social Engineering , Privacy Laws , Employee
Monitoring, Content Filtering
What is data base and data base management system, Evolution of database management,
16 Data Concepts and Characteristics, Data Organization

Operating Systems, Operating System Functions, Starting Computers and Mobile

17 Devices, Shutting Down Computers and Mobile Devices, Providing a User Interface ,
Managing Programs, Managing Memory

Recommended Textbooks
1. Discovering Computers, Shelly Cashman series, 2016.

Recommended Reference (Books/Websites/Articles)

1. Introduction to Computers, Peter Norton, 6th edition.
2. Understanding computers: today and tomorrow, comprehensive, Deborah Morley, Charles S.
Parker, 15th Edition, Cengage Learning, 2014.
3. Using information technology, Brian K. Williams, Stacey C. Sawyer.

12
 Scheme of Studies for BS (Computer Science) 2023
Introduction to Information and Communication Technologies-Lab
Course Code: CSIT-111L

Semester Credit Hours Prerequisite

[BSCS-1] [2+1] [None]

Course Description
This course provides a very broad range of topics and prepares the students for various DOMAINs
in computing that they will face in upcoming semesters. This course is very comprehensive as it
provides every student a set of productivity tools that they will be able to use for the rest of their
lives. It provides knowledge and skills for use of computing and communication technologies to
solve real life problems. This is an introductory course about Information and Communication
Technologies that includes ICT terminologies, hardware and software components, the internet
and World Wide Web, and ICT based applications.

Course Learning Outcomes (CLOs) for Labs

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Knowledge of MS Office (Word, Excel, C2
Power point), Operate MS Office, C 2
Understanding of MS Office Comprehension

CLO-2 Revise the Tasks, discuss problems, P3

participate and feedback of previous P Guided 5
Labs in the form of lab reports Response
CLO-3 Apply the understanding, operating, and
designing to real problems, develop A2
A 7
problem solving skills, promote Responding
creativity
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
Introducing Today's Technologies Computers, Devices, and the Web: Computing Components,
Processors, Memory, the Cloud, and More. Input and Output Extending Capabilities of Computers
and Mobile Devices. Digital Storage Preserving Content Locally and, on the Cloud. Operating
Systems Managing, Coordinating, and Monitoring Resources, GUI and CLI with CLI
commands and their usages. Storing and retrieving Information & Input/output media and devices.
Communicating Digital Content Wired and Wireless Networks and Devices. Connecting and
Communicating Online the Internet, Websites, and Media. Computers and Mobile Devices
Evaluating Options for Home and Work. Programs and Apps Productivity, Graphics, Security, and
Other Tools. Digital Security, Ethics, and Privacy Threats, Issues, and Defenses. Building

13
 Scheme of Studies for BS (Computer Science) 2023
Solutions Database, System, and Application Development Tools. Numbering Systems: Binary,
Octal, Decimal and Hexadecimal, Base inter conversions, Binary arithmetic operations.

Lab Weekly Schedule

The labs schedule for 17 weeks is detailed below. All lab CLOs shall be accessed in each lab.

Week Topic
1 Introduction to the lab equipment and SOPs of the labs
2 Introduction to computer hardware and system information
3 Learning of different functions of Microsoft Word
4 Working with Insert tab (table, smart art , pictures, shapes)
Working with Insert tab (page no., header/footer, page break, symbols and equations
5
comments, links, track changes.)
6 Working with Design and page layout tabs and table figure and contents.
7 Referencing, PDF conversion, views reviews
8 Report writing and CV making in Microsoft Word
9 Mid Term Exam
10 Introduction to Excel (different functions of Microsoft Excel)
11 Cell merging, sum, average, cell sizing, sorting swapping, designing, filters
12 Graph making, Chart making and formula implementation in Microsoft Excel
13 Pivot table in Microsoft Excel
14 Introduction to Power point
15 Designing presentation in Power point
16 Presentation making
17 Lab Exam

Recommended Textbooks
2. Discovering Computers, Shelly Cashman series, 2016.

Recommended Reference (Books/Websites/Articles)

4. Introduction to Computers, Peter Norton, 6th edition.
5. Understanding computers: today and tomorrow, comprehensive, Deborah Morley, Charles S.
Parker, 15th Edition, Cengage Learning, 2014.
Using information technology, Brian K. Williams, Stacey C. Sawyer.

14
 Scheme of Studies for BS (Computer Science) 2023
Programming Fundamentals
Course Code: CSPF-141

Semester Credit Hours Prerequisite

[BSCS-1] [3+1] [None]

Course Description
This course provides a basic introduction to computers and fundamental programming concepts
and methods. Emphasis is on problem solving using algorithmic development methods; good
programming practices and style. C++ is used as tool in learning programming. Coding
environments such as Visual Studio or DevC++ will be used for programming in class and lab.
ITCP is designed to be a first course for students with little or no prior programming experience.
It also includes the practice of all programming fundamental concepts and the additional language
for practicing these concepts is C++, so that student will be able to solve any problem in any
language.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below
S# CLO STATEMENT DOMAIN BT LEVEL PLO
CLO-1 Understand basic concepts of C2
problem analysis and solving C 2
techniques Comprehension

CLO-2 Apply fundamental programming C3

concepts of conditional and C 2
repetitive structures Application

CLO-3 Implement concepts of modular C3

design, data handling, and pointers C 2
Application
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
Introduction to problem solving, a brief review of Von-Neumann architecture, Introduction to
programming, role of compiler and linker, introduction to algorithms, basic data types and
variables, input/output constructs, arithmetic, comparison and logical operators, conditional
statements and execution flow for conditional statements, repetitive statements and execution flow
for repetitive statements, lists and their memory organization, multi-dimensional lists, introduction
to modular programming, function definition and calling, stack rolling and unrolling, string and
string operations, pointers/references, static and dynamic memory allocation, File I/O operations.

Course Weekly Schedule

The course schedule for 17 weeks is detailed below

15
 Scheme of Studies for BS (Computer Science) 2023

Week Topic

Introduction to Programming Languages, Benefits gained from Programming

1 Languages. Generations of Programming Languages, Use of different languages in
different generations. Working of Compilers, and Linkers.
Introduction to C++, Advantages of using C++, First program in C++, Naming
2 rules in C++, Data types, Types of C++ Instructions.

3 Preprocessor directive, The Main Method, Compiling and Executing the program.
Variable definition and declaration, Escape sequences, Arithmetic Operators, Input
4
gathering

5 Decision making statements, if, if else and nested if else statements.

Loops, for loop, nested for loop, Using for loop with single and multiple
6
statements, while and nested while loop.
The do while loop, Difference between while and do while loop, Using switch and
7 break statements, Logical and Conditional Operators, Operators Precedence,
continue and goto statements.
Local and global variables, Introduction to Arrays and defining Arrays. Arrays
8 initialization, Operations, Passing to functions, Multidimensional Arrays.

9 Mid Term Exams

Functions, Functions Declaration, Function Calling, Function Definition.

10
Eliminating function declaration, Passing arguments to functions (by value).
Passing variables to functions, returning values from functions, Return statement,
11
Overloaded functions, Inline functions.
Structures, Defining structures and structure variables, Accessing structure
12
members.
Returning structure variables, Passing arguments to functions (with respect to
13
structure)
Pointers, Pointers of Arrays, Pointer constants and pointer variables, Passing
14
pointers as arguments,
15 Pointer and functions, Basic concept of Pass by reference. Function Pointers
File Handling, Introduction to ifstream and ofstream, Writing to /from file, Simple
16
Programs: word count, sentence count.
17 File Handling Practices

16
 Scheme of Studies for BS (Computer Science) 2023
Recommended Textbooks
1. C++ How to Program by Deitel and Deitel, 10th Edition, Pearson, (2016)

Recommended Reference (Books/Websites/Articles)

1. Starting out with Python, Tony Gaddis, Pearson; 4th edition (2017)
2. Starting out with Programming Logic & Designs, Tony Gaddis, Pearson; 4th edition (2015)
3. Introduction to Computation and Programming Using Python: With Application to Understanding
Data, 2nd Edition by Guttag, John, MIT Press; 2nd edition (2016)
4. Practice of Computing Using Python by William Punch & Richard Enbody, Pearson; 2nd edition
(2012)
5. A first book of C++, Garry Bronson, Cengage Learning, 4th edition, 2011

17
 Scheme of Studies for BS (Computer Science) 2023
Programming Fundamentals-Lab
Course Code: CSPF-141L

Semester Credit Hours Prerequisite

[BSCS-1] [3+1] [None]

Course Description
This course provides a basic introduction to computers and fundamental programming concepts
and methods. Emphasis is on problem solving using algorithmic development methods; good
programming practices and style. C++ is used as tool in learning programming. Coding
environments such as Visual Studio or DevC++ will be used for programming in class and lab.
ITCP is designed to be a first course for students with little or no prior programming experience.
It also includes the practice of all programming fundamental concepts and the additional language
for practicing these concepts is C++, so that student will be able to solve any problem in any
language.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below
S# CLO STATEMENT DOMAIN BT LEVEL PLO
CLO-1 Develop simple programs to provide C6
solution for stated specifications C 4
Evaluation
CLO-2 Manipulate state of the art tools to P3
develop, debug and test simple P 5
applications Guided Response

* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
Introduction to problem solving, a brief review of Von-Neumann architecture, Introduction to
programming, role of compiler and linker, introduction to algorithms, basic data types and
variables, input/output constructs, arithmetic, comparison and logical operators, conditional
statements and execution flow for conditional statements, repetitive statements and execution flow
for repetitive statements, lists and their memory organization, multi-dimensional lists, introduction
to modular programming, function definition and calling, stack rolling and unrolling, string and
string operations, pointers/references, static and dynamic memory allocation, File I/O operations.

18
 Scheme of Studies for BS (Computer Science) 2023
Lab Weekly Schedule
The labs schedule for 16 weeks is detailed below. All lab CLOs shall be accessed in each lab.

Week Topic

Introduction to C++, Basic features of Microsoft Visual Studio, first program in

1
C++, Compiling and Executing the program.
2 Variable declaration and initialization, Assignment Operator

3 Arithmetic Operators, Input gathering, Operators Precedence

4 Decision making statements, if, if else and nested if else statements,
5 Using switch and break statements, Logical and Conditional Operatrs
6 Loops, While Loop

7 Do-while loop, Difference between while and do while loop

8 For Loop (Basic Examples)

9 For Loop (Advanced Examples)
10 Functions, Functions Declaration and Definition, Function Calling
11 Mid Term Exams

12 Parameters of Functions, Argument Passing

Return Type, Return Value, Inline Functions, Overloaded Functions, Local and
13
Global Variables
14 Basic concepts of arrays, Traversing arrays

15 Arrays (Advanced Examples)

Pointers, Pointers of Arrays, Pointer constants and pointer variables, Passing
16
pointers as arguments, Pointer and functions, Basic concept of Pass by reference
17 Structures, defining structures and structure variables, Accessing structure members

Recommended Textbooks
2. C++ How to Program by Deitel and Deitel, 10th Edition, Pearson, (2016)

Recommended Reference (Books/Websites/Articles)

6. Starting out with Python, Tony Gaddis, Pearson; 4th edition (2017)
7. Starting out with Programming Logic & Designs, Tony Gaddis, Pearson; 4th edition (2015)

19
 Scheme of Studies for BS (Computer Science) 2023
8. Introduction to Computation and Programming Using Python: With Application to Understanding
Data, 2nd Edition by Guttag, John, MIT Press; 2nd edition (2016)
9. Practice of Computing Using Python by William Punch & Richard Enbody, Pearson; 2nd edition
(2012)
10. A first book of C++, Garry Bronson, Cengage Learning, 4th edition, 2011

20
 Scheme of Studies for BS (Computer Science) 2023
English Composition & Comprehension
Course Code: ESEC-112

Semester Credit Hours Prerequisite

[BSCS-I] [3+0] [None]

Course Description
In this course, students will develop reading comprehension, writing, speaking and listening skills
by providing rich language content. The teaching objectives and assessment criteria ensure
confident delivery of all the core skills for second language learners. Course topics provide
language practice and support to students and offer a record progress in both professional and non-
professional field. The course is carefully crafted to provide optimum practice of English language
for computer science students.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

Identify the parts of speech, phrase C C1
CLO-1 clause and sentence 7
Knowledge
Change the voice and narration of the C C2
CLO-2 sentence 7
Comprehension
Use English vocabulary and skills to in C C2
CLO-3 writing paragraphs, essays, letters and Comprehension 7
applications
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
Parts of speech, Modals and Articles, Tenses and Conditional sentence, Types of Sentences,
Change of voice, Change of Narration, Writing Strategies, Writing strategies Paragraph writing,
Use of articles and Punctuation marks, Reading Comprehension, Essay Writing, Phonemes-
vowels, consonants and diphthongs. Rules of Pronunciation, American and British sound
differences, Rules of Spellings, Reading: extensive/intensive, skimming/scanning

Course Weekly Schedule

The course schedule for 16 weeks are detailed below

Week Topic
1 Parts of speech

21
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
2 Modals and Articles
3 Tenses and Conditional sentence
4 Change of voice
5 Change of narration
6 Writing strategies
7 Paragraph writing
8 Phonemes-vowels, consonants
9 Parts of speech
10 Mid Term Exams
11 Rules of Pronunciation, American and British sound differences, Rules of Spellings)
12 Rules of spellings and use of articles
13 Reading : extensive/intensive, skimming/scanning
14 Use of punctuation marks
15 Reading comprehension
16 Essay writing
17 Note taking/note making and preparing for exams

Recommended Textbooks

1. High school English grammar and composition by Wren and Martin

Recommended Reference (Books/Websites/Articles)

1. College Writing Skills with reading by John Langan, Mc Graw-Hill, 5th Edition

22
 Scheme of Studies for BS (Computer Science) 2023
Pakistan Studies
Course Code: SSPS-113

Semester Credit Hours Prerequisite

[BSCS-1] [2+0] [None]

Course Description
Pakistan Studies (Compulsory) has been developed in line with HEC guidelines on the subject and
need analysis carried out at NUML Campuses for accruing optimum course outcomes. The course
has been developed in Cognitive, Affective, as well as Psychomotor Domains.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

Discuss Pakistan’s historical perspective;
ideological basis; environmental outlook; C2
CLO-1 C 1
political and constitutional developments; Comprehension
contemporary and future Pakistan.
Apply the guiding principle driven out from
study of Pakistan’s history; ideology;
environment; politics; constitutional C3
CLO-2 developments; social and economic C 10
challenges in fulfilment of Pakistan’s Application
Vision 2025 with special reference to the
role of Pakistani youth.
Analyze the impact based social activism to
enable students play their respective role in C4
CLO-3 C 10
development of prosperous Pakistan Analysis
alongside their personal growth.
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
Historical background of Pakistan: Muslim society in Indo-Pakistan, the movement led by the
societies, the downfall of Islamic society, the establishment of British Raj- Causes and
consequences. Political evolution of Muslims in the twentieth century: Sir Syed Ahmed Khan;
Muslim League; Nehru; Allama Iqbal: Independence Movement; Lahore Resolution; Pakistan
culture and society, Constitutional and Administrative issues, Pakistan and its geo-political
dimension, Pakistan and International Affairs, Pakistan and the challenges ahead.

23
 Scheme of Studies for BS (Computer Science) 2023
Course Weekly Schedule
The course schedule for 17 weeks is detailed below.

Week Topic
1 Evolution
2 Factors
3 Definition, sources and significance of Ideology.
4 Basis of Pakistan’s Ideology with particular reference to the Values of Islam,
economic deprivation of Muslims and role of All India Muslim League (AIML) in
Subcontinent.
5 Two Nation Theory: Origin and Explication.
6 Ideological rationale with special reference to Sir Syed Ahmad Khan, Allama
Muhammad Iqbal and Quaid-i-Azam Muhammad Ali Jinnah.
7 Landforms, climate and water resources.
8 Environmental hazards and remedies.
9 Mid Term
10 Constitutional and political developments in Pakistan.
11 Geo-political significance of Pakistan.
12 Economic potential and its utilization.
13 Social issues, their gravity and resolution.
14 World affairs: challenges and contributions.
15 Human rights in Pakistan.
16 Pakistan’s Vision 2025.
17 Youth’s Role in Development of Pakistan, Projects

Recommended Textbooks
1. Sh. Muhammad Rafiq, Pakistan Studies

Recommended Reference (Books/Websites/Articles)

2. Pakistan Affairs by Ikram Rabbani
3. Empire at Retreat by Rabia Umer Ali

24
 Scheme of Studies for BS (Computer Science) 2023
Islamic Studies
Course Code: SSIS-114

Semester Credit Hours Prerequisite

[BSCS-1] [2+0] [None]

Course Description
This course has been designed as a compulsory subject for the students of Bachelor’s degree
program. The course has 2 credit hours and carrying 100 marks. This course provides sufficient
knowledge on faith & pillars of Islam than systems of Islam. The main objective of this course is
to enhance knowledge of the students on Islam and their character building.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

Discuss basic concept of Islam (faith, pillars

and systems etc.) and express their impact on 2
CLO-1 society and describe the religion of Islam C 1
importance in the human life in the light of Comprehension
guidance provided by Quran and Sunnah
Demonstrate the challenges of modern 3
CLO-2 science and contemporary world C 10
Valuing
Analyze Islamic Ethics and code of personal 4
CLO-3 practice in social life C 9
Analysis
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
Basic Themes of Quran, Introduction to Sciences of Hadith, Introduction to Islamic Jurisprudence,
Primary & Secondary Sources of Islamic Law, Makken & Madnian life of the Prophet, Islamic
Economic System, Political theories, Social System of Islam.

Course Weekly Schedule

The course schedule for 17 weeks is detailed below.

Week Topic
1 Importance of Quran to be a noble human
Introduction of Quran, Fazail-e-Quran, Duties of a Muslim during recitation of the Quran,
Importance of Understanding of the Quran

25
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
2 Characteristics of true human being and a beloved servant of Al-Rehman (Surh al-Furqan
63-78)
Humbleness in dealings/ walk, Focusing on the Vision, Spending nights in prayer, Pray
for protection from the hell , Pray for the Family (spouse and child)
3 Social norms: Towards Rasool (‫)ﷺ‬/ elders & authorities (Surah Al-Hujrat 1-5) Lowering
voice in front of Rasool‫ﷺ‬/ Authority, Presentation of matters in respectful words. ,
Manners of Calling Rasool‫ ﷺ‬/ Authority
Conduct of a human towards Media (al-Hujrat 5-8)
4 Why the Sunnah is important for a Human? Literal Meaning of the Sunnah, Importance
of the Sunnah according to the Quran, Relativity among the Quran and the Sunnah
5 Twenty selected Ahadith with translation
6 Twenty selected Ahadith with translation
7 Islam in the Light of the Quran and Hadith(Theological Section) Tauheed, Risalat,
Aakhrat
8 Islam in the Light of the Quran and Hadith (Teaching section) Prayer, Fasting, Charity
(Zakat/Sadaqat), Hajj, Jihad
9 Mid Term
10 Study of Seerat-un-Nabi(‫ )ﷺ‬Makkah Life
Birth / early childhood, Before & after revelation of the Quran, The preaching and its
different stages
11 Study of Seerat un Nabi (‫)ﷺ‬Madina Life; Hijrah; Qualities of the Leadership and the
Nation ,Fatah-e-Makkah and conduct of the Prophet towards his opponents, Hajat0ul
Wida
12 Importance of Quran to be a noble human Introduction of Quran, Fazail-e-Quran, Duties
of a Muslim during recitation of the Quran, Importance of Understanding of the Quran
13 Characteristics of true human being and a beloved servant of Al-Rehman (Surh al-Furqan
63-78) Humbleness in dealings/ walk, Focusing on the Vision, Pray for the Family
(spouse and child) , Spending within limits (wealth/time/education/ energies.
14 Pray Allah in hard times, Don’t harm any thing in the universe , Don’t make unlawful
relations , Don’t attend falsehood meetings , Pass by from irrelevant things
15 Social norms:
Towards Rasool (‫)ﷺ‬/ elders & authorities (Surah Al-Hujrat 1-5) Lowering voice in front
of Rasool‫ﷺ‬/ Authority Presentation of matters in respectful words , Manners of Calling
Rasool‫ ﷺ‬/ Authority

26
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
16 Why the Sunnah is important for a Human? Literal Meaning of the Sunnah, Importance
of the Sunnah according to the Quran, Relativity among the Quran and the Sunnah

Recommended Textbooks

1. Islamic education for BA B-SC B-COM. By M.D.Zafar. Aziz book depot Urdu Bazar Lahore
2. Islamic studies for BA B-SC B-COM. by Zia urRahman Ahmad Aziz book depot Urdu Bazar
Lahore
3. Ali, K. (2006). A Study of Islamic History. Adam Publishers & Distributors. ISBN13:
9788174352286.

Recommended Reference (Books/Websites/Articles)

1. Islam in the light of the final testament and traditions by Shaukatomari Taurus Publications
Karachi.
2. Islamic Ideology by Khalifa Abdul Hakim Institute of Islamic culture 2-club road, Lahore.
3. Whatever everyone should know about Islam and Muslims by Suzanne HaneefKazi
publications 121 zulqarnain chambers Ganpat road Lahore

27
 Scheme of Studies for BS (Computer Science) 2023
Applied Physics
Course Code: EEAP-121

Semester Credit Hours Prerequisite

[BSCS-1] [3+0] [None]

Course Description
To give understanding on how current flows through the p-n junction and relating this phenomenon
to the characteristics and operation of the diodes, bipolar and field-effect transistors.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

Apply acquired knowledge to solve C3
CLO-1 series and parallel resistor networks by C Application 1
using KVL and KCL
Understand and explain the basic C3
CLO-2 operation and working semiconductor C Application 1
devices
Apply acquired knowledge to solve C3
CLO-3 circuits which consists of semiconductor C Application 1
devices
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
Charge, Negative and Positive charge, and Electric field, Basic concept of Voltage, Current and
Resistor, Series and Parallel combinations of Resistors, Ohm’s Law, KCL and KVL, Introduction
of materials, conductor insulator semiconductor, electronic configuration, P type and N type
materials, doping process, Introduction to diode theory, Approximations of diodes in circuits, some
mathematical problems, Voltage and current relationship in diode, forward and reverse biasing of
diodes, Zener diode and its applications, Rectifiers, Introduction to rectifiers, Half wave and full
wave rectifier, Power supplies, Ripple factor and its calculations, Introduction of BJT and its
operation, Collector characteristics of BJTs and region of operations, Continuation with BJT
operation, Biasing of BJT, Common emitter configuration of BJT and concept of load line and q
point, Continuation with load line and Q point with some problems, Emitter bias configuration and
stability of Q point, Voltage divider bias configuration and its analysis, Introduction of JFETs and
MOSFETs, Basic theory of JFETs and MOSFETs, Basic calculations of JFETs and MOSFETs.

Course Weekly Schedule

The course schedule for 17 weeks is detailed below

28
 Scheme of Studies for BS (Computer Science) 2023

Week Topic
1 Basis of Electricity
Charge, Negative and Positive charge, and Electric field
Basic concept of Voltage, Current and Resistor
2 Series and Parallel combinations of Resistors
Ohm’s Law
3 KCL and KVL
4 Basis of Diode Theory
Introduction of materials, conductor insulator semiconductor, electronic configuration
5 P type and N type materials, doping process
Introduction to diode theory
6 Approximations of diodes in circuits, some mathematical problems. Voltage and
current relationship in diode, forward and reverse biasing of diodes
7 Zener diode and its applications
Rectifiers
8 Introduction to rectifiers
Half wave and full wave rectifier
9 Mid Term-
10 Power supplies
Ripple factor and its calculations
11 Bipolar Junction Transistors
Introduction of BJT and its operation
12 Collector characteristics of BJTs and region of operations
13 Continuation with BJT operation
14 Biasing of BJT
15 Common emitter configuration of BJT and concept of load line and q point
Continuation with load line and Q point with some problems
16 Emitter bias configuration and stability of Q point
Voltage divider bias configuration and its analysis
17 Introduction of JFETs and MOSFETs
Basic theory of JFETs and MOSFETs
Basic calculations of JFETs and MOSFETs

29
 Scheme of Studies for BS (Computer Science) 2023
Recommended Textbooks
1. Fundamentals of Physics (Extended), 10th edition, Resnick and Walker

Recommended Reference (Books/Websites/Articles)

1. Electronic Devices (Conventional Current Version), 10th Edition Thomas L. Floyd

30
 Scheme of Studies for BS (Computer Science) 2023
Pre-Math-I
Course Code: MTPM-161

Semester Credit Hours Prerequisite

[BSCS-1] [Non Credit] [Pre- Medical]

Course Description
The purpose of this course is to assist students from pre-medical background so that they will be
able to continue their studies in computer science discipline without any hurdle.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Understand the concepts of sets, binary
operations, and number theory a line, C2
C 2
curves, functions, and be able to draw the Comprehension
graphs.
CLO-2 Evaluate the limits, continuity, C3
differentiation C 2
Application
CLO-3 Evaluate the limits, continuity, C3
differentiation, and Integration. C 2
Application
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
This course introduces the following topics to students:
 Introduction of Sets, types of sets
 Venn diagrams
 Number theory; Properties of real numbers and real line
 Coordinate plane
 Complex numbers properties and operations
 Introduction to functions, types of functions, graphs, the inverse of functions, slope tangent
and normal.
 Introduction to limits
 Techniques of funding limits
 Continuous and discontinuous functions Partial Fraction
 Concept and idea of differentiation, Geometrical and Physical meaning of derivatives
 Rules of differentiation, Chain rule, Techniques of differentiation, Maxima and Minima of
a function for single-variable
 Concavity

31
 Scheme of Studies for BS (Computer Science) 2023
 Antiderivatives
 Concept, and idea of Integration Rules and techniques of integration
 The area under the curve a graphical perspective
 Definite Integrals
 Introduction to differential equations

Course Weekly Schedule

The course schedule for 16 weeks are detailed below

Week Topic
1 Sets definition , types of sets,
2 Venn diagrams, Number theory
3 Properties of real numbers and real line, coordinate plane
4 Complex numbers, properties, and operations
Introduction to functions, Types of functions, graphs, the inverse of functions, slope
5
tangent, and normal
6 Introduction to limits, Techniques of funding limits
7 Continuous and discontinuous functions
8 Partial Fraction
9 Concept and idea of differentiation
10 Geometrical and Physical meaning of derivatives
11 Rules of differentiation, Chain rule, Techniques of differentiation,
12 Maxima and Minima of a function for single-variable, Concavity,
13 Antiderivatives, Concept, and idea of Integration
14 Rules and techniques of integration.
15 The area under the curve a graphical perspective, definite Integrals
16 Introduction to differential equations

Recommended Textbooks
1. Thomas, G. B., & Finney, R. L. (1992). Calculus and Analytic Geometry. ISBN:
9780201529296.

32
Scheme of Studies for BS (Computer Science) 2023

Semester II

33
 Scheme of Studies for BS (Computer Science) 2023
Object Oriented Programming
Course Code: CSOO-142

Semester Credit Hours Prerequisite

[BSCS-2] [3+1] [ CSPF-141]

Course Description
The course introduces the students to the concepts and principles of Object Oriented Programming.
The central theme will be about using object orientation in coming up with software with an
emphasis on developing insights about how object orientation changes the way we conceptualize,
design, develop and implement computer systems. This course prepares students for advanced
programming courses. The course uses Java as the programming language and does not assume
prior knowledge of the language. In addition to these a semester project of commercial worth will
also be developed to implement the object orientation concepts.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

Understand principles of object C C2

CLO-1 2
oriented paradigm. Understanding
Identify the objects & their C C4
CLO-2 relationships to build object oriented Analysis 3
solution

Develop object-oriented solutions for C C6

CLO-3 4
small systems Evaluation
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
Introduction to object oriented design, history and advantages of object oriented design,
introduction to object oriented programming concepts, classes, objects, data encapsulation,
constructors, destructors, access modifiers, const vs non-const functions, static data members &
functions, function overloading, operator overloading, identification of classes and their
relationships, composition, aggregation, inheritance, multiple inheritance, polymorphism, abstract
classes and interfaces, generic programming concepts, function & class templates, standard
template library, object streams, data and object serialization using object streams, exception
handling.

Course Weekly Schedule

The course schedule for 16 weeks are detailed below

34
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
Procedural programming Vs object-oriented programming, Revision of Programming
Fundamental Concepts.
1 History of Java, Java programming environment, Fundamental programming structure
in java, Lexical issues (white spaces, identifiers, literals, comments, separators and java
keywords, Data types
Structure of Java program, Java Compilation Process Compiling and running a Java
2 program
Methods, Introducing methods, Method signatures, Arguments, and parameters
Introduction to classes and its importance
Types of Classes
3
Objects creation and handling, Anonymous object
Utilizing methods of classes
Controlling access to members, Constructors, Constructor overloading, Static class
4
members, Static methods
Inheritance, Types of Inheritance (Multiple , Multilevel, Hierarchical and Hybrid )
5 Superclass and Subclass, Relationship between super class and subclass, Use of super
keyword for using variables, function and constructor of super class
Polymorphism, Abstraction and Encapsulation
Generalization, specialization, Aggregation, Composition
6
Nested Classes, Run-time Polymorphism, Compile-time Polymorphism, Late binding
and Early Binding.
Method overriding, use of super in override functions, using abstract classes, using final
7 and protected keyword with inheritance,
Abstract and non-abstract methods. Dynamic and dispatch methods.
Packages Defining package, Package access protection, Importing packages. Use of
8
Object class.
9 Mid Term Exams
Interfaces, defining an interface, implementing and applying interfaces, Variables in
10 interfaces,
Interface with Multiple Inheritance
Exception Handling Fundamentals, Types of Exceptions, using exception clauses (try,
11
catch, throw, throws and finally)
Graphical User Interface Components, Introduction to Swing. Controls Button, Labels,
Text Fields, Text Area, Checkbox and Radio buttons
12 Event Handling, The delegation event model (events, event sources and event listeners)
Introduction to AWT, AWT classes
Creating a window program, working with graphics.
13
Layout managers and menus, Control fundamentals

35
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
Enums, Generics, Boxing, auto Boxing, Collections
14
File Handling
15 Week For Open Ended Lab For Lab Final Exams, Projects, Presentations
16 Revision Week/Final Paper Discussion
17 Event Handling Practice

Recommended Textbooks

1. JAVA: The Complete Reference Object Oriented Programming by Herbert Schildt,11th

Edition, McGraw-Hill Osborne Media; (2018)

Recommended Reference (Books/Websites/Articles)

1. Starting Out with C++ from Control Structures to Objects, 9th Edition, Tony Gaddis, Pearson; 8th
edition (2014)
2. C++ How to Program, Deitel & Deitel, Pearson; 10th edition (2016)
3. Object Oriented Programming in C++ by Robert Lafore, 4th edition, ISBN-13: 978-0672323089,
Sams; (2001)
4. Java: How to Program by Paul Deitel, Pearson College Div; 9th edition (2011)

36
 Scheme of Studies for BS (Computer Science) 2023
Object Oriented Programming-Lab
Course Code: CSOO-142L

Semester Credit Hours Prerequisite

[BSCS-2] [3+1] [ CSPF-141]

Course Description
The course introduces the students to the concepts and principles of Object Oriented Programming.
The central theme will be about using object orientation in coming up with software with an
emphasis on developing insights about how object orientation changes the way we conceptualize,
design, develop and implement computer systems. This course prepares students for advanced
programming courses. The course uses Java as the programming language and does not assume
prior knowledge of the language. In addition to these a semester project of commercial worth will
also be developed to implement the object orientation concepts.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Develop programs using object- C C6
oriented programming concepts 4
Evaluation
Manipulate the use of Java Complier P P3
CLO-2
and Eclipse IDE to create java Guided 5
applications Response
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
Introduction to object oriented design, history and advantages of object oriented design,
introduction to object oriented programming concepts, classes, objects, data encapsulation,
constructors, destructors, access modifiers, const vs non-const functions, static data members &
functions, function overloading, operator overloading, identification of classes and their
relationships, composition, aggregation, inheritance, multiple inheritance, polymorphism, abstract
classes and interfaces, generic programming concepts, function & class templates, standard
template library, object streams, data and object serialization using object streams, exception
handling.

37
 Scheme of Studies for BS (Computer Science) 2023
Lab Weekly Schedule
The lab schedule for 17 weeks is detailed below. All lab CLOs shall be accessed in each lab.

Week Topic
1 Introduction to Eclipse, Writing Java programs, Basic programming structure of Java
2 Methods, Method signatures, Parameters and Arguments
3 Classes and objects, Properties, and behavior
4 Constructors of classes and their utility, Constructor Overloading
5 Static Variables and Static Methods, Basic concept of Final Keyword
6 Encapsulation as concept and its implementation, Access modifiers, Data Hiding
7 Polymorphism through method overloading
8 Basic concept of inheritance, Parent and Child Classes
9 Polymorphism through method overriding, Use of Super Keyword, Use of Protected
10 Use of Final Keyword with respect to inheritance, Final classes, Final methods
11 Mid Term Exams
12 Object Casting and Dynamic Method Dispatch
13 Abstract Classes and Abstract Methods
14 Packages Defining package, Package access protection, Importing packages,
15 Interfaces, defining an interface, implementing interfaces, Variables in interfaces
Exception Handling Fundamentals, Types of Exceptions, using exception clauses (try,
16
catch, throw, throws and finally)
17 Graphical User Interface Components, Introduction to AWT, AWT classes

Recommended Textbooks

3. JAVA: The Complete Reference Object Oriented Programming by Herbert Schildt,11th

Edition, McGraw-Hill Osborne Media; (2018)

Recommended Reference (Books/Websites/Articles)

5. Starting Out with C++ from Control Structures to Objects, 9th Edition, Tony Gaddis, Pearson; 8th
edition (2014)
6. C++ How to Program, Deitel & Deitel, Pearson; 10th edition (2016)
7. Object Oriented Programming in C++ by Robert Lafore, 4th edition, ISBN-13: 978-0672323089,
Sams; (2001)
8. Java: How to Program by Paul Deitel, Pearson College Div; 9th edition (2011)

38
 Scheme of Studies for BS (Computer Science) 2023
Communication & Presentation Skills
Course Code: ESPS-115

Semester Credit Hours Prerequisite

[BSCS-2] [3+0] [ESEC-112]

Course Description
The course is designed to develop awareness, knowledge, skills and attitude of participants needed
to deliver effective and professional communication. The objective of the course is to make the
participants understand the theory of effective and good communication prior to preparing and
delivering a presentation within a simulated context to have a persuasive impact on the audience.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

Define basic concepts and terms about C C1
CLO-1 communication 7
Understanding
Discuss different theories and principles C C2
CLO-2 about communication 7
Comprehension
Apply different techniques to prepare a C C3
CLO-3 presentation 7
Application
Participate in class presentations and A A2
CLO-4 volunteer to share knowledge in the Responding 6
class individually or as a group member
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
Definition, importance, components, seven Cs, barriers and theories of communication, Ethical
and Global Communication, Team Communication, Job search communication Writing resume
and cover letters, Types and importance of interviews, preparation for interviews, Types and
importance of meetings, planning meetings, Manners and princinciples to participate in a meeting,
presentation Skills-steps to prepare a presentation, ways of oral delivery, verbal and nonverbal
strategies. Remedies to overcome stage fear, Rhetoric-art of persuasion.

Course Weekly Schedule

The course schedule for 16 weeks are detailed below

Week Topic
1 Definition, importance, components, seven Cs of Communication

39
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
2 Ethical and Global Communication,
3 Team Communication
4 Job search communication
5 Writing resume and cover letters
6 Types and importance of interviews, preparation for interviews
7 Giving interviews and steps after interviews
Types and importance of meetings, planning meetings
8
Manners and princinciples to participate in a meeting,
9 Definition, importance, components, seven Cs of Communication

10 Mid Term Exams

11 Manners and principles to participate in a meeting

12 Steps to prepare a presentation, ways to deliver an oral message

13 Verbal and nonverbal strategies

Remedies to overcome the stage fear

14
Preparation and delivery of the presentation

15 Rhetoric- art of persuasion

16 Final presentations

17 Presentation

Recommended Textbooks

1. Effective business communication, hamurphy 8th edition.

2. Business communications-strategy and Skills, Mary Munter.
3. Business English and communication, Lyn R. Clark and Kenneth Zimmer-8th edition.

Recommended Reference (Books/Websites/Articles)

1. Technical report writing today by Daniel G Riordan, 8th edition.

2. Patterns of college writing, Laurie G. Kirszner and Stephen R. Mandell, 4th edition.
3. English Phonetics and phonology, Peter Roach.

40
 Scheme of Studies for BS (Computer Science) 2023
Univ. Elec. - I, Intro. to Psychology
Course Code: SSIP-163

Semester Credit Hours Prerequisite

[BSCS-2] [3+0] [None]

Course Description
The course will examine the different models upon which modern Psychology has been built,
along with such things as the history and origins of psychology, research methods, biological
aspects of psychology, human development, perception, consciousness, learning, personality
theory, and psychological issues.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Identify key components in the field of C2
Psychology C 1
Comprehension
CLO-2 Discuss psychological concepts and C3
techniques for practical problem C 6
solving Application

CLO-3 Apply basic Psychological concepts in C4

their daily life (academic and personal) C 10
Analysis
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
This course introduces the following topics to students:
 Introduction to Psychology
o Nature and Application of Psychology with special reference to Pakistan.
o Historical Background and Schools of Psychology (A Brief Survey)

 Methods of Psychology
o Observation, Case History Method, Experimental Method, Survey Method
o Interviewing Techniques

 Biological Basis of Behavior

o Neuron: Structure and Functions
o Central Nervous System and Peripheral Nervous System
o Endocrine Glands

41
Scheme of Studies for BS (Computer Science) 2023

 Sensation, Perception and Attention

o Sensation: Characteristics and Major Functions of Different Sensations, Vision:
Structure and functions of the Eye and Audition: Structure and functions of the Ear.
o Perception: Nature of Perception, Factors of Perception: Subjective, Objective and
Social, Kinds of Perception: Spatial Perception (Perception of Depth and Distance),
Temporal Perception; Auditory Perception.
o Attention: Factors, Subjective and Objective, Span of Attention, Fluctuation of
Attention and Distraction of Attention (Causes and Control)
 Motives
o Definition and Nature, Classification
o Primary (Biogenic) Motives: Hunger, Thirst, Defection and Urination, Fatigue, Sleep,
Pain, Temperature, Regulation, Maternal Behavior, Sex
o Secondary (Sociogenic) Motives: Play and Manipulation, Exploration and Curiosity,
Affiliation, Achievement and Power, Competition, Cooperation, Social Approval and Self
Actualization.

 Emotions
o Definition and Nature
o Physiological changes during Emotions (Neural, Cardial,
Visceral, Glandular), Galvanic Skin
o Response;
o Pupilliometrics
o Theories of Emotion
o James Lange Theory; Cannon-Bard Theory
o Schachter –Singer Theory

 Learning
o Definition of Learning
o Types of Learning: Classical and Operant Conditioning Methods of Learning: Trial and
Error; Learning by Insight; Observational Learning

 Memory
o Definition and Nature
o Memory Processes: Retention, Recall and Recognition
o Forgetting: Nature and Causes

 Thinking
o Definition and Nature
o Tools of Thinking: Imagery; Language; Concepts
o Kinds of Thinking
o Problem Solving; Decision Making; Reasoning

42
 Scheme of Studies for BS (Computer Science) 2023
 Individual differences
o Definition concepts of;
o Intelligence, personality, aptitude, achievement.

Course Weekly Schedule

The course schedule for 17 weeks are detailed below

Week Topic
1 Definition of Psychology, Sub-fields of Psychology
Structuralism, Functionalism, Gestalt, Neuroscience, Psychodynamic, Behavioral,
2
Cognitive, Humanistic
Research Process, Hypothesis, Theory, Archival Research, Naturalistic Observation,
3
Survey Research, Case Study, Correlation, Research, Experimental Research
Sensing the World Around Us, Absolute Thresholds: Detecting, What’s Out There ,
4 Difference Thresholds: Noticing Distinctions Between Stimuli , Sensory Adaptation:
Turning Down Our Responses
Constructing Our View of the World , The Gestalt Laws of Organization , Top-
5
Down and Bottom-Up Processing
Depth Perception: Translating 2-D to 3-D , Perceptual Constancy , Motion Perception:
6
As the World Turns, Perceptual Illusions: The Deceptions of Perceptions
Definition , Factors affecting , Types of attention (sustained, selective, and divided
7
attention)
The Basics of Classical Conditioning , Applying Conditioning, Principles to Human
8 Behavior, Extinction , Generalization and, Discrimination , Beyond Traditional
Classical Conditioning:, Challenging Basic Assumptions
9 Mid Term Exams
Thorndike’s Law of Effect , The Basics of Operant Conditioning:, Reinforcement and
10 Punishment

Comparing classical and operant conditioning, Latent Learning , Observational

11
Learning: Learning Through Imitation
12 Sensory Memory, Short-Term Memory, Working, Memory

43
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
Long-Term Memory
Recalling Long-Term Memories , Retrieval Cues , Levels of Processing Theory
Explicit and Implicit Memory , Flashbulb Memories , Constructive Processes in
13 Memory: lding the Past
Why we forget?Proactive and Retroactive Interference: The Before and After of
Forgetting Memory Dysfunctions: Afflictions of Forgetting
Thinking and Reasoning ,Problem Solving, What Is Intelligence?, Theories of
14 Intelligence , The Biological Basis of Intelligence, Practical and Emotional, Intelligence
Assessing Intelligence, Adaptive Testing
Explaining motivation , Understanding Emotional Experiences, The Functions of
15 Emotions , Determining the Range of Emotions: Labelling Our Feelings, The Roots of
Emotions: James-Lange theory, Cannon-Bard theory, Schahchter-Singer theory
Freud’s Psychoanalytic Theory: Mapping the Unconscious Mind, Assessing
16 Personality: Determining What Makes Us Distinctive
Stress: Reacting to Threat and Challenge , The High Cost of Stress , Coping with
17 Stress , Promoting Health and Wellness: Following Medical Advice , Well-Being and
Happiness

Recommended Textbooks
1. Feldman, R.S. (2010). Understanding psychology. New York: McGraw-Hill.
2. Myers, D. G. (2010). Introduction to Psychology (10th ed.)

Recommended Reference (Books/Websites/Articles)

1. Atkinson, R., & Smith, E. E. (2005). Introduction to Psychology (14th ed.)
2. Lahey, B. B. (2004). Psychology: An Introduction

44
 Scheme of Studies for BS (Computer Science) 2023
Calculus and Analytical Geometry
Course Code: MTCA-122

Semester Credit Hours Prerequisite

[BSCS-2] [3+0] [none]

Course Description
Calculus serves as the foundation of advanced subjects in all areas of mathematics. The objective
of this course is to introduce students to the fundamental concepts of limit, continuity, differential
and integral calculus of functions of one variable. This course covers in depth the differential
calculus of function of single variable

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

Apply the concepts of graphs of the function, C3
CLO-1 C 1
limits, and continuity to solve problems Application

Solve the problems related to derivation, C3

CLO-2 C 1
maxima, and minima. Application

Solve the problems related to integration, and C3

CLO-3 C 2
conic section Application
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials

Limits and Continuity; Introduction to functions, Introduction to limits, Techniques of funding

limits, Indeterminate forms of limits, Continuous and discontinuous functions and their
applications, Differential calculus; Concept and idea of differentiation, Geometrical and Physical
meaning of derivatives, Rules of differentiation, Techniques of differentiation, Rates of change,
Tangents and Normal lines, Chain rule, implicit differentiation, linear approximation, Applications
of differentiation; Extreme value functions, Mean value theorems, Maxima and Minima of a
function for single-variable, Concavity, Integral calculus; Concept and idea of Integration,
Indefinite Integrals, Techniques of integration, Riemann sums and Definite Integrals, Applications
of definite integrals, Improper integral, Applications of Integration; Area under the curve,
Analytical Geometry; Straight lines in R3, Equations for planes.

45
 Scheme of Studies for BS (Computer Science) 2023
Course Weekly Schedule
The course schedule for 17 weeks are detailed below

Week Topic
1 Introduction to functions, Even and Odd Functions, Domain and Range of Functions,
Piecewise Continuous Functions, Periodic Functions
2 Increasing and Decreasing Functions, Graph of the functions
3 Limit of a function, Graphical approach, Properties of limits, Theorems of limits
4 Limits of various types of functions
5 Continuity of a function at a point, Continuous and discontinuous functions, Continuity
by Graphical approach
6 Derivatives, geometrical meaning of the derivative, general Theorems of derivatives
7 Trigonometric functions, explicit and implicit functions and its derivatives, second
order and higher order derivatives
8 Tangents and Normal Lines, Application of Derivatives, Max-Min Theorem, Absolute
Extrema, Local Extrema, Concavity Examples
9 Mid Term Exams

10 Integration, Techniques of Integration, Basic Integration Formulas, Substitution method

11 Partial Fraction, Integration by Parts
12 Trigonometric Substitution
13 Riemann sums and Definite Integrals
14 Improper integrals
15 Properties of definite integral, Fundamental theorems of calculus
16 Application of Integration: Area under the curves, Solids of revolution
17 Straight lines in R3, Equations for planes

Recommended Textbooks
1. Calculus and analytical Geometry, Thomas and Finney, 11th edition, Pearson Addison
Wesley, 2007.

Recommended Reference (Books/Websites/Articles)

1. Advanced engineering mathematics, Erwin Kreyszig, John Wiley & Sons, 2019.

46
 Scheme of Studies for BS (Computer Science) 2023
Discrete Structures
Course Code: CSDS-143

Semester Credit Hours Prerequisite

[BSCS-3] [3+0] [None]

Course Description
Introduces the foundations of discrete mathematics as they apply to Computer Science, focusing
on providing a solid theoretical foundation for further work. Further, this course aims to develop
understanding and appreciation of the finite nature inherent in most Computer Science problems
and structures through study of combinatorial reasoning, abstract algebra, iterative procedures,
predicate calculus, tree and graph structures.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Apply the elements of propositional logic C3
statements and logical operations. C 2
Application
CLO-2 Solve basic problems demonstrating the C2
understanding of fundamental for sets, C 3
functions, relations and counting principles Comprehension

CLO-3 Apply some properties to graphs, trees and

related discrete structures, and be able to C3
C 2
discover their relationship with practical Application
examples
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
Mathematical reasoning, propositional and predicate logic, rules of inference, proof by induction,
proof by contraposition, proof by contradiction, proof by implication, set theory, relations,
equivalence relations and partitions, partial orderings, recurrence relations, functions, mappings,
function composition, inverse functions, recursive functions, Number Theory, sequences, series,
counting, inclusion and exclusion principle, pigeonhole principle, permutations and combinations,
elements of graph theory, planar graphs, graph coloring, euler graph, Hamiltonian path, rooted
trees, traversals.

Course Weekly Schedule

The course schedule for 17 weeks are detailed below

47
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
1 Introduction to Logic, Conditional Statement, converse, Contrapositive, Inverse,
Logic and bit operations, Proofs, valid and invalid arguments, Propositional
2 Equivalences, Constructing new logical equivalences
Propositional logic, Translating from English into logical expressions involving
3 propositions.
Predicates and Quantifiers, The universal quantifier, the existential quantifier, Nested
4 Quantifier, Order of Quantifier.

5 Translating from English into logical expressions involving predicates and quantifiers.
Rules of Inference, Modus Ponens, Modus Tollens ,Hypothetical Syllogism, Disjunctive
6 Syllogism, Addition, Simplification, Conjunction, Resolution

7 Problem Solving Using Rules of Inference.

8 Proof by induction, proof by contraposition, proof by contradiction, proof by implication.

9 -Mid Term-

10 -Mid Term Break-

Set theory, Set operations , Set identities and Proofs ,Set builder notation, Empty set,
11 Null set, Singleton set, Proper and Improper subsets.

12 Applications and definition of functions, domain, co domain, image, range, preimage.

Sequence and summations, arithmetic progression, Special integer sequences, geometric
13 progressions.

14 The basics of counting, applications, product rule, sum rule, complex counting problems.

15 Relations, Properties of relations, reflexive relations.

Types of graphs, Graph Terminology, adjacent vertices, degree of a vertex, Graph
Models, Undirected graphs.
16
Walk, path, trail, circuit, Euler Paths and Circuits, Hamilton Path and Circuits.
Introduction to Trees, Applications of Trees, Tree Traversal, Post Order, PreOrder and
17 InOrder Traversals.

Recommended Textbooks
1. Epp, S. S. (1993). Discrete Mathematics with Applications, 5th Edition. Wadsworth
Publishing Company. ISBN: 9780534096304.

Recommended Reference (Books/Websites/Articles)

1. Discrete mathematics with applications, Susanna S. Epp, 5th Edition, 2019.
2. Discrete mathematics, Richard Johnson Baugh, Global edition, 2018

48
 Scheme of Studies for BS (Computer Science) 2023
Univ. Elec. - II, Social Service
Course Code: SSSS-164

Semester Credit Hours Prerequisite

[BSCS-2] [1+0] [None]

Course Description
This course will enable the student to explore social work as a helping profession. The student will
examine the development of social work as a profession as well as the knowledge and skills used
by social workers.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Define knowledge of social work 1
theories, principles and concepts related C 10
to social work. Knowledge

CLO-2 Discuss societal, health, poverty, safety,

legal issues within local and global
contexts, and the consequential 2
C 8
responsibilities relevant to professional Comprehension
computing practice.

CLO-3 Demonstrate social work theories and 3

practices to address real societal issues. C 8
Application
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
This course introduces students to get the understanding about social work. It will be helpful for
them to get the insight about fundamental norms and value system of the society and teach them
to be empathetic about society and individual problems. The course explores social welfare
through social work and human services lenses. This includes their shared values, historical
foundations, and critical perspectives. Once some approaches and theories, practices, processes,
and levels have been introduced, students develop a personal philosophy statement of social
welfare that self-assesses their fit in these fields. The students learn to apply their foundational
learning to specific populations. At the students integrate material from the entire course and begin
applying it to specific scenarios.

49
 Scheme of Studies for BS (Computer Science) 2023
Course Weekly Schedule
The course schedule for 16 weeks is detailed below

Week Topic
Introduction and Philosophical background of Social Work, Use of models: social work
1 diamond, the social construction of social work theory.
Principles of Social Work, Voluntary and Involuntary Social Work, Professional Social
2 Work, Social Policy, social policy triangle.
Modern Concepts of Social Work: Rehabilitation, Stress Management, Preventive
3 etcetera. Role of State
Primary and Secondary Research Methods in Social Work,
4
Defining social needs.
Field Work in Social Work and Field Ethics, Values & Ethics of the social work
5 profession, Code of Ethics
Exploration of specific arenas of practice, including key challenges, populations, and
6 setting. Poverty.

7 Rights, types of human rights, human right Act. A debate between rights and duties.

8 Aspects of inequality, Slogan under Human Rights Agenda.

9 Mid Term Exams

10 Problem Identification, Funding and spending for social work

11 Problem Identification, Funding and spending for social work

12 Case work example: Crisis and task-centered practice

13 Case work example: Cognitive-behavioral practice

14 Working with Special Populations

15 Working with Special Populations

16 Project Presentations

Recommended Textbooks
1. Social Work and Social Policy. An Introduction, Jonathan Dickens, 2nd edition, Taylor and Francis,
2016.

Recommended Reference (Books/Websites/Articles)

1. Modern Social Work Theory, Malcolm Payne, 4th edition, Palgrave Macmillan, 2016.
2. Social Work Fields of Practice, Catherine N. D. & Karen M.S, John Wiley & Sons, 2012.
3. Social Work: A Beginner’s Text written, Andrea Bernstein & Mel Gray Juta, 1997.

50
 Scheme of Studies for BS (Computer Science) 2023
Pre-Math-II
Course Code: MTPM-162

Semester Credit Hours Prerequisite

[BSCS-2] [Non-credit] [Pre-medical]

Course Description
The purpose of this course is to assist students from pre-medical background so that they will be
able to continue their studies in computer science discipline without any hurdle.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

Understand the concepts of System C1
CLO-1 Linear Equations and operation of C 2
matrices Knowledge

Solve the Homogeneous and C2

CLO-2 C 2
nonhomogeneous Systems of Equations Comprehension

Understand the concepts of vectors and C3

CLO-3 C 2
fields. Application
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
This course introduces the following topics to students:
 Introduction to linear algebra,
 Systems of Linear Equations;
 Solution of a system of linear equations;
 Concept of Matrices, and their types;
 Basic operation of Matrices;
 Techniques and concept of Matric multiplication
 Concept of the determinant of matric and Nonsingular Matrices;
 Inverse of a matrix and Cramer’s Rule; Elementary row operation of a matrix;
 Echelon form and Gauss’s elimination method;
 Reduce Echelon form and Gauss’s Jordon elimination method;
 Elimination Method for solving system of linear equations;
 Homogeneous Systems of Equations Ax=0;
 Non- Homogeneous Systems of Equations Ax=b;
 Introduction to Vectors spaces; Dot product; Cross product; Gradient of a scalar field;
Divergence of a vector field; Curl of a vector field;

51
 Scheme of Studies for BS (Computer Science) 2023
 Concepts of Stokes’s theorem and the Divergence theorem

Course Weekly Schedule

The course schedule for 16 weeks is detailed below

Week Topic
1 Introduction to linear algebra, Systems of Linear Equations
2 Solution of a system of linear equations
3 Concept of Matrices, and their types
4 The basic operation of Matrices
5 Techniques and concept of Matric multiplication
6 Concept of the determinant of a matric and Nonsingular Matrices
7 The inverse of a matrix and Cramer’s Rule
8 Elementary row operation of a matrix
9 Echelon form and Gauss’s elimination method
10 Reduce Echelon form and Gauss’s Jordon elimination method
11 Elimination Method for solving system of linear equations
Homogeneous Systems of Equations Ax=0, Non- Homogeneous Systems of Equations
12
Ax=b
13 Introduction to Vectors spaces, Dot product, Cross product
14 The gradient of a scalar field, Divergence of a vector field
15 The curl of a vector field
16 Concepts of Stokes’s theorem and the Divergence theorem

Recommended Textbooks

1. Kreyszig, E., Stroud, K., & Stephenson, G. (2008). Advanced engineering

mathematics. Integration. ISBN: 9781119571094.

52
Scheme of Studies for BS (Computer Science) 2023

Semester III

53
 Scheme of Studies for BS (Computer Science) 2023
Digital Logic Design
Course Code: EEDL-201

Semester Credit Hours Prerequisite

[BSCS-3] [3+1] [ EEAP-121]

Course Description
The basic purpose of this course is to introduce the concepts and tools for design of digital
electronic circuits using both combinational and sequential logic. Students will learn methods for
systematically designing digital circuits that satisfy their functional specifications and will be able
to develop application-specific logic designs in a structured, repeatable, convergent, and self-
documenting manner. This course provides a modern introduction to logic design and the basic
building blocks used in digital systems, in particular digital computers. It starts with a discussion
of combinational logic: logic gates, minimization techniques, arithmetic circuits, and modern logic
devices such as field programmable logic gates. The second part of the course deals with sequential
circuits: flip-flops, synthesis of sequential circuits.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Identify and explain fundamental concepts
of digital logic design including basic and
universal gates, number systems, binary C2
coded system, and Boolean algebra to C 1
interrelate with basic understanding of Comprehension
Boolean functions, logic diagram and truth
table
CLO-2 Demonstrate the acquired knowledge to
apply techniques related to the design and C3
analysis of digital electronic circuits C 2
including Boolean algebra and multi- Application
variable Karnaugh map methods.
CLO-3 Design of small-scale combinational and C5
sequential digital circuits C 4
Synthesis
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
This course introduces the following topics to students:
 Binary Systems: Introduction to digital and analogue systems, Number Systems and
Conversions, Arithmetic with number systems, Radix/r’s Complement and Diminished

54
 Scheme of Studies for BS (Computer Science) 2023
radix/(r-1)’s Complements, Subtraction using r’s Complements and (r-1)’s complement,
Signed and unsigned number systems and their arithmetic, Binary Codes, Decimal Codes
and Alphanumeric Codes
 Boolean Algebra and Logic Gates: Boolean Postulates and Theorems, Boolean Functions
and their Complements, Sum of Min Terms and Product of Max Terms, Standard forms
and Canonical Forms, Digital logic gates
 Gate level Minimization: Karnaugh maps, Multi-variable (2,3,4) K-maps, Product of Sum
(POS) and Sum of Product (SOP) simplification, Don’t care conditions, Digital Circuits
using Basic and Universal Gates
 Combinational Logic: Analysis and Design Procedure, Code Converters, Adders and its
types, Subtractors, Multiplier, Magnitude Comparator, Decoders and Encoders,
Multiplexers and De-multiplexer
 Sequential Circuits: Latches (SR Latch,S’R’ Latch, D Latch), Flip Flops ( D Flip Flop, JK
Flip Flop,SR Flip Flop, T Flip Flop), Characteristic Tables, Characteristic Equations.,
Design and Analysis of Clocked Sequential Circuits (Timing diagram), Designing
Counters

Course Weekly Schedule

The course schedule for 16 weeks is detailed below

Week Topic
1 Digital computers and information representation
Fundamentals of Digital Logic system and Number system Introduction
2 Number system and conversions: decimal to any other base (binary, hexadecimal
and octal numbers) conversion and vice versa. Hexadecimal to binary and octal to
binary conversion.
3 Arithmetic operations (addition, subtraction and multiplication) using binary
numbers, hexadecimal and octal numbers
4 Complements of Numbers: Radix/r’s Complement and Diminished radix/(r-1)’s
Complements, Subtraction using r’s Complements and (r-1)’s complement
5 Signed and unsigned numbers representation (for the binary numbers), Binary
codes: BCD, Excess-3 and gray code, Alpha numeric codes: ASCII character codes
and uni code, Error detecting code and parity bit, Binary logics and logic gates.
6 Boolean algebra, Common Algebra postulates, Basic theorem, and properties,
Boolean expression representation 1) Standard form: Sum of Min-term and product
of Max-term form, 2) Canonical forms: Sum of product (SOP) and product of sum
forms (POS), 3) Non-Standard forms, Two level implementation and multi-level
implementation of Boolean expressions, Simplification of expression using Boolean
algebra rules/theorems, Complement of a function

55
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
7 Simplification of Boolean expression using K-map technique for 2 and 3 variables.
(Examples: Combinational circuits implementation for 2 and 3 input variables using
design procedure approach (i.e. Half adder and full adder))
8 Simplification of Boolean expression using K-map technique for 4 variables (in
SOP and POS form), Prime implicant and Essential prime implicant. (Examples:
Combinational Circuits implementation for 4 input variables)
9 K-map technique: Don’t care condition and simplification of incompletely specified
function using k-map method (Examples: Implement BCD to binary
convertor/Binary to BCD convertor using design procedure approach)
10 Combinatorial circuits: Analysis procedure and Design procedure examples: BCD
to Excess-3 Code converter, BCD to gray code converter, Excess-3 to BCD Code
converter, and gray to BCD code converter etc.
11 Design procedure examples: BCD to Seven segment decoder, Implementation of
parity bit generator and checker
12 Binary adders: Half adder, Full adder, Ripple carry adder, and Carry look ahead
adder, Binary adder and subtractor, Overflow
13 Binary multiplier, Magnitude comparator, Decoders and implementation of
combinational circuits using decoder, Encoders.
14 Multiplexer (MUX) and De-multiplexer and its implementation, Sequential circuits
and its types, Asynchronous sequential circuits and implementation of memory
elements: Latches (S’R’ latch, Enable SR latch and Transparent/D latch).
15 Synchronous sequential circuits and implementation of its memory elements: Flip
Flops (Master slave D flip flop and JK flip flop) and their timing diagrams
16 Flip Flops (T Flip Flop), Timing consideration, Design of counters

Recommended Textbooks
1. Mano, M. M. (2017). Digital Logic and Computer Design. Pearson India. ISBN:
9789332586048.

56
 Scheme of Studies for BS (Computer Science) 2023
Digital Logic Design-Lab
Course Code: EEDL-201L

Semester Credit Hours Prerequisite

[BSCS-3] [3+1] [ EEAP-121]

Course Description
The basic purpose of this course is to introduce the concepts and tools for design of digital
electronic circuits using both combinational and sequential logic. Students will learn methods for
systematically designing digital circuits that satisfy their functional specifications and will be able
to develop application-specific logic designs in a structured, repeatable, convergent, and self-
documenting manner. This course provides a modern introduction to logic design and the basic
building blocks used in digital systems, in particular digital computers. It starts with a discussion
of combinational logic: logic gates, minimization techniques, arithmetic circuits, and modern logic
devices such as field programmable logic gates. The second part of the course deals with sequential
circuits: flip-flops, synthesis of sequential circuits.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Apply the fundamental concepts of C3
digital logic design to implement a C 3
combinational and sequential circuit. Application

CLO-2 P3
Practice circuits by using discrete
P Complete Overt 3
components and digital ICs.
Response
CLO-3 Contribute individually or as a team A2
A 9
member to work effectively. Responding

* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
This course introduces the following topics to students:
 Binary Systems: Introduction to digital and analogue systems, Number Systems and
Conversions, Arithmetic with number systems, Radix/r’s Complement and Diminished
radix/(r-1)’s Complements, Subtraction using r’s Complements and (r-1)’s complement,
Signed and unsigned number systems and their arithmetic, Binary Codes, Decimal Codes
and Alphanumeric Codes

57
 Scheme of Studies for BS (Computer Science) 2023
 Boolean Algebra and Logic Gates: Boolean Postulates and Theorems, Boolean Functions
and their Complements, Sum of Min Terms and Product of Max Terms, Standard forms
and Canonical Forms, Digital logic gates
 Gate level Minimization: Karnaugh maps, Multi-variable (2,3,4) K-maps, Product of Sum
(POS) and Sum of Product (SOP) simplification, Don’t care conditions, Digital Circuits
using Basic and Universal Gates
 Combinational Logic: Analysis and Design Procedure, Code Converters, Adders and its
types, Subtractors, Multiplier, Magnitude Comparator, Decoders and Encoders,
Multiplexers and De-multiplexer
 Sequential Circuits: Latches (SR Latch,S’R’ Latch, D Latch), Flip Flops ( D Flip Flop, JK
Flip Flop,SR Flip Flop, T Flip Flop), Characteristic Tables, Characteristic Equations.,
Design and Analysis of Clocked Sequential Circuits (Timing diagram), Designing
Counters

Lab Weekly Schedule

The course schedule for 16 weeks is detailed below

Week Topic
1 Introduction to Lab Equipment and verification of basic logic gates
 Introduction to digital trainer i.e. power supply, input-output ports, and
different modules.
 Study logic gates and verify their truth tables.
2 Introduction to Verilog and synapticad.
 Introduction to Verilog design methodologies and conventions.
 Identifiers, number specification, and keywords used in Verilog.
 Module structure and stimulus block in Verilog.
3 Implementation of Demorgans Law, Distributive Law using gates and
Verilog.
 Applications of Demorgans law and Distributive law using basic gates.
 The HDL-based design language of de-morgans law and distributive law using
Verilog.
4 Simplified Boolean expression to a minimum number of literals using Logic
gates and Verilog.
 Simplify Boolean expression using properties.
 The HDL-based design language for simplified expressions using Verilog.
5 Design and implementation of adders and subtractors using Logic gates and
Verilog.
 Design and construct half adder, full adder, half subtractor and
full subtractor circuits and verify the truth table using logic gates.
 The HDL-based design language for adders and subtractors using Verilog.

58
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
6 Design and implementation of code converter using logic gates and Verilog.
 Design and implement 4-bit Binary to gray code converter and Gray to binary
code converter.
 HDL based design language for gray code converters using verilog.
7 Design and implementation of BCD to Excess-3 and Excess-3 to BCD
converter using logic gates and verilog.
 Design and implement 4-bit BCD to Excess-3 and Excess-3 to BCD converter.
 HDL based design language for Excess-3 converters using verilog.
8 Open Ended Lab
 Design and implement the designated task using gates.
 HDL based design language for designated task using Verilog.
9 Design and implementation of magnitude comparator using logic gates and
using Verilog.
 Design and implement 2 – Bit magnitude comparator using basic gates.
 HDL based design language for 2-bit magnitude comparator using Verilog.
10 Design and implementation of multiplexer and de-multiplexer using logic
gates and Verilog.
 Design and implement multiplexer and demultiplexer using logic gates and
study of IC 74150 and IC 74154.
 HDL based design language for multiplexer and demultiplexer using Verilog.

11 Design and implementation of encoder and decoder using logic gates and
verilog.
 Design and implement encoder and decoder using logic gates
and study of IC 7445 and IC 74147.
 HDL based design language for encoder and decoder using Verilog.
12 Study of different types of flip flops using gates.
 Verify basic flip flops i.e. D-flip flop and JK flip flop using IC.

13 Design and Implementation of shift register.

 Verify serial to parallel shift register using IC.

14 Implementation of decade counter.

 Verify mod 10/decade counter using IC.

Recommended Textbooks

59
 Scheme of Studies for BS (Computer Science) 2023
2. Mano, M. M. (2017). Digital Logic and Computer Design. Pearson India. ISBN:
9789332586048.

60
 Scheme of Studies for BS (Computer Science) 2023
Data Structures and Algorithms
Course Code: CSDA-244

Semester Credit Hours Prerequisite

[BSCS-3] [3+1] [CSOO-142]

Course Description
The purpose of this course is to build upon a strong understanding of “Data Structures and famous
dealing algorithms”. Also to give a practical approach to computer science students for a better
view of what is going on beyond the desktop? Data storage policies, representations, operations,
algorithms and above all a programming approach to data structures in C++.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Understand the properties of various data C C2
structures and their usage in real world Comprehension 2
problems.
CLO-2 Demonstrate the working of algorithms C C3
related to various data structures. 2
Application
CLO-3 Apply appropriate data structure for modeling C C3
an optimized solution for a given problem. 3
Application
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
This course introduces the following topics to students:
 Abstract data types
 Arrays (properties, functions to manipulate array, searching and sorting algorithms)
 Singular Linked list (properties, functions and its significance)
 Doubly Link List (properties, related functions and its significance)
 Stack (properties, representation, related functions and its applications)
 Queue (properties, representation, related functions and its applications)
 Circular Queue (properties, representation, related functions and its applications)
 Priority Queue (properties, representation using linked list and array, related functions and
its applications)
 Implementation of Stack and Queue using Link list
 Graphs (properties, related functions and algorithms such as Depth first search, breadth
first search)

61
 Scheme of Studies for BS (Computer Science) 2023
 Trees (types of trees, properties of various types of trees, related functions algorithms such
as traversing, finding spanning tree and finding minimum spanning tree)
 Heap (properties, related functions and its applications)
 AVL Trees ((properties, related functions and its applications)
 Hashing (properties, related functions and its applications)

Course Weekly Schedule

The course schedule for 17 weeks is detailed below

Week Topic
1 Brief introduction of different data structures with advantages and disadvantages
Array data structure, representation of array in memory
Searching algorithms such as Linear search and binary search on arrays data structure.
2 Sorting algorithm such as selection sort, bubble sort and insertion sort.
3 Introduction of Linked List, properties of linked list and comparison w.r.t array data
structure.
Traversing Function in linked list
Insertion Functions in linked list: AddToHead(element) and AddToTail(element).
4 Insertion Functions in linked list, i.e., AddAfter(element), addBefore(element) and
AddSorted(element).
Deletion Functions in Linked list: Remove(element) and RemoveAll(), Shifting
Function in Linked List: MovetoHead(element), and MoveToTail(element).
Application and Advantages/Disadvantages of linked list with respect to array
5 Introduction of Two way linked list, its properties and comparison w.r.t singular linked
list.
Insertion and deletion functions in two way linked list (all functions covered in singular
linked list needs to be covered with two way linked list also).
6 Applications and Advantages/Disadvantages of Two way linked
Introduction of Stack, its properties and basic functions of Stack such as, push
(element), pop(), isEmpty(), isFull(), and topValue().
Stack using array vs. stack using linked list
7 Brief overview of different applications of stack.
Stack applications in detail: String reversal, Symbol balancing and evaluation of postfix
expression
8 Stack applications in detail: conversion of mathematical expression using stack such as,
Infix-to-postfix, Postfix-to infix, Postfix-to-prefix, Infix-to-prefix, Prefix-to-infix, and
Prefix-to-postfix

62
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
9 Mid Exam Week
10 Mid Exam Week
11 Queue and its related functions such as Enqueue(element), Dequeue(), isEmpty(),
isFull(), and isInlist(element).
Queue using linked list along with related functions such as Enqueue(element),
Dequeue(), isEmpty(), isFull(), and isInlist(element).
12 Queue using Circular array, its benefits, and related functions such as
Enqueue(element), Dequeue(), isEmpty(), isFull(), and isInlist(element).
Application of Circular queue.
Priority Queue using Linked list and Multiple queues
13 Introduction to Graph Data Structure, its properties and Applications.
Representation of Graphs as adjacency list and adjacency matrix
Graph Algorithms: Depth-first search, breadth-first search, PRIMS and KRUSKAl
algorithms for finding Minimum Spanning Tree
14 Introduction to trees, binary trees, representation of binary trees using array and linked
list.
Pre-order, In-order and post-order traversing operations in binary trees
Introduction to Binary Search Tree (BST) along with Insertion operation in Binary
Search Tree.
15 Searching and deletion operation in Binary Search Tree.
Introduction to Heap, its representation and related operations such as Max heapify(),
Min heapify(), Insert and Delete,
16 Introduction to AVL Trees, its properties, related operations for height balancing and
applications.
17 Introduction to Hashing, its properties, representation, related functions and
applications
Hash functions: Division Method, Multiplication Method, Mid-square Method and
Folding methods
Collision Resolution Techniques: Linear Probing, Quadratic Probing and Separate
Chaining
18 End Term Exam
19 End Term Exam

Recommended Textbooks

63
 Scheme of Studies for BS (Computer Science) 2023
1. Weiss, M. A. (2014). Data structures and algorithm analysis in C++, 4th Edition. Pearson.
ISBN: 9780132847377.

Recommended Reference (Books/Websites/Articles)

1. Lafore, R. (2002). Object-oriented programming in C++, 4th Edition. Pearson Education.
ISBN-10: 0672323087.
2. Lipschutz, S., & Pai, G. A. (2008). Data Structures. Tata McGraw-Hill Publishing
Company Limited. ISBN: 0070380015.
3. R.S. Salaria (2013). Data Structures: Theory, Problems and Algorithms, 1st Edition.
Khanna Publishing House. ISBN: 9789381068403.

64
 Scheme of Studies for BS (Computer Science) 2023
Data Structures and Algorithms-Lab
Course Code: CSDA-244L

Semester Credit Hours Prerequisite

[BSCS-3] [3+1] [CSOO-142]

Course Description
The purpose of this course is to build upon a strong understanding of “Data Structures and famous
dealing algorithms”. Also to give a practical approach to computer science students for a better
view of what is going on beyond the desktop? Data storage policies, representations, operations,
algorithms and above all a programming approach to data structures in C++.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Implement the abstract data types and P P3
algorithms related to various data structures. Guided 3
Response
CLO-2 Demonstrate linear and non-linear data P4
structures and related algorithms P 4
Mechanism
CLO-3 Express the experiments in the form of a LAB A3
report A 7
Valuing
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
This course introduces the following topics to students:
 Abstract data types
 Arrays (properties, functions to manipulate array, searching and sorting algorithms)
 Singular Linked list (properties, functions and its significance)
 Doubly Link List (properties, related functions and its significance)
 Stack (properties, representation, related functions and its applications)
 Queue (properties, representation, related functions and its applications)
 Circular Queue (properties, representation, related functions and its applications)
 Priority Queue (properties, representation using linked list and array, related functions and
its applications)
 Implementation of Stack and Queue using Link list
 Graphs (properties, related functions and algorithms such as Depth first search, breadth
first search)

65
 Scheme of Studies for BS (Computer Science) 2023
 Trees (types of trees, properties of various types of trees, related functions algorithms such
as traversing, finding spanning tree and finding minimum spanning tree)
 Heap (properties, related functions and its applications)
 AVL Trees ((properties, related functions and its applications)
 Hashing (properties, related functions and its applications)

Lab Weekly Schedule

The lab schedule for 17 weeks is detailed below. All CLOs shall be accessed in each lab.

Week Topic
1 Array: Implementation of functions to perform insertion, deletion and linearly search
in an array.
2 Array: Implementation of Array Data Structure: Functions to perform iterative binary
search, recursive binary search and sorting such as selection sort, bubble sort and
insertion sort.
Function to Manipulate 2D array.
3 Singular linked list: Implementation of traversing and insertion functions in a Singular
linked list.
Implementation of Singular linked list as template.
4 Singular linked list: Implementation of deletion functions in singular linked list
5 Two way linked list: Implementation of traversing, insertion and deletion functions in
a two way linked list with.
6 Stack: Implementation of Stack using Array and Linked List.
7 Stack: Implementation of function related to various application of Stack.
8 Open Ended Lab
9 Exam Week
10 Mid Break
11 Queue: Implementation of Queue using Array and Linked List
12 Circular Queue: Implementation of Circular Queue
13 Graph: Implementation of Graph Data Structures along with DFS and BFS functions.
14 Binary Search Tree: Implementation of Insertion and traversing function in BST.
15 Binary Search Tree: Implementation of search and delete function in BST
16 Open Ended Lab
17 Lab Examination

66
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
18 End Term Exam
19 End Term Exam

Recommended Textbooks
2. Weiss, M. A. (2014). Data structures and algorithm analysis in C++, 4th Edition. Pearson.
ISBN: 9780132847377.

Recommended Reference (Books/Websites/Articles)

4. Lafore, R. (2002). Object-oriented programming in C++, 4th Edition. Pearson Education.
ISBN-10: 0672323087.
5. Lipschutz, S., & Pai, G. A. (2008). Data Structures. Tata McGraw-Hill Publishing
Company Limited. ISBN: 0070380015.
6. R.S. Salaria (2013). Data Structures: Theory, Problems and Algorithms, 1st Edition.
Khanna Publishing House. ISBN: 9789381068403.

67
 Scheme of Studies for BS (Computer Science) 2023
Linear Algebra
Course Code: MTLA-223

Semester Credit Hours Prerequisite

[BSCS-3] [3+0] [none]

Course Description
Linear algebra is the study of linear system and linear transformations. The main objective of this
course is to help students learn in rigorous manner, the tools and methods essential for studying
the solution spaces of problems in mathematics, engineering, and develop mathematical skills
needed to apply these to the problems arising within their field of study and to various real-world
problems.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

Solve a system of linear equations using C3
CLO-1 Matrices C 1
Application
Apply the basic knowledge of vector spaces, C3
CLO-2 eigenvalue and eigenvectors C 1
Application
Solve a system of linear equations using C3
CLO-3 different methods C 2
Application
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective
Domain

Course Materials
System of Linear Equations and Matrices: Introduction to system of linear equations, Matrix form
of system of Linear Equations, Gaussian Elimination method, Gauss-Jorden Method, Consistent
and inconsistent systems, Homogeneous system of equations. Vector Equations: Introduction to
vector in plane, Vector in Rn, Vector form of straight line, Linear Combinations, Geometrical
interpretation of solution of Homogeneous and Non-homogeneous equations, Applications of
Linear Systems: Traffic Flow Problem, Electric circuit Problem, Economic Model, Linear
transformations: Introduction to linear transformations, Matrix transformations, Domain and range
of linear transformations, Geometric interpretation of linear transformations, Matrix of linear
transformations, Inverse of a matrix: Definition of inverse of a matrix, Algorithm to find the
inverse of matrices, LU factorization, Determinants: Introduction to determinants, Geometric
meaning of determinants, Properties of determinants, Cramer Rule, Cofactor method for finding
the inverse of a matrix, Vector Spaces: Definition of vector spaces, Subspaces, Spanning set, Null
Spaces and column spaces of linear transformation, Linearly Independent sets and basis, Bases for

68
 Scheme of Studies for BS (Computer Science) 2023
Null space, Dimension of a vector space EigenValues and Eigenvectors: Introduction to
Eigenvalue and Eigenvectors, Computing the Eigenvalues, Properties of Eigenvalues,
Diagonalization, applications of Eigenvalues. Numerical Linear Algebra, Gauss Elimination, Inner
product, Cross product, Gram-Schmidt Process, QR – Decomposition, AV = b by LU -
decomposition, Elimination Matrix, Orthogonal Matrices, Least square Vector, Least Square
Error, Hessenberg's Theorem, Schur's theorem, Singular value Decomposition (SVD).

Course Weekly Schedule

The course schedule for 16 weeks are detailed below

Week Topic
1 Introduction to the Course System of Linear Equations
System of Linear Equations and Matrices: Introduction to system of linear equations,
2
Matrix form of system of Linear Equations
Gaussian Elimination Method, Gauss-Jordan Method, Consistent and inconsistent
3
systems
Homogeneous system of equations.
4 Linear Combinations, Applications of Linear Systems: Traffic Flow Problem, Electric
circuit Problem
Determinants: Introduction to determinants, Geometric meaning of determinants,
5
Properties of determinants, Cramer Rule
Cofactor method for finding the inverse of a matrix
6 Vector Equations: Introduction to vector in plane, Vector in Rn, Vector form of straight
line
Matrix transformations, Domain and range of linear transformations
7
Inverse of a matrix: Definition of inverse of a matrix
Vector Spaces: Definition of vector spaces, Subspaces, Spanning set
8 Null Spaces and column spaces of linear transformation, Bases for Null space, Dimension
of a vector space, Linearly Independent sets and basis
9 MID-TERM
10 MID-TERM-BREAK
Introduction to Eigenvalue and Eigenvectors, Eigen values and Eigenvectors: Examples
11
Computing the Eigenvalues, Properties of Eigenvalues
12 Diagonalization, Diagonalization, Inner product, Cross product

69
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
13 Gram-Schmidt Process: QR – Decomposition, Least square Vector, Least Square Error
14 Least Square Error, QR - Decomposition
15 Orthogonal Matrices, Hessenberg's Theorem, Schur's theorem
16 Elimination Matrix, AV = b by LU – decomposition,The Power Method
17 Singular value Decomposition (SVD), Project Presentations

Recommended Textbooks
1. Elementary Linear Algebra by Howard Anton
2. Applied Linear Algebra by Peter J. Olver, Chehrzad Shakiban Second Edition, 2018

Recommended Reference (Books/Websites/Articles)

1. Linear Algebra and its Applications by Gilbert Strang
2. Advanced Engineering Mathematics, Author Erwin Kreyszig, Tenth Edition, Publisher John Wiley &
Sons, Limited, 2019

70
 Scheme of Studies for BS (Computer Science) 2023
Professional Practices
Course Code: CSPP-216

Semester Credit Hours Prerequisite

[BSCS-3] [3+0] [None]

Course Description
A Computing graduate as professional has some responsibilities with respect to the society. It
identifies key sources for information and opinion about professionalism and ethics. Historical,
social context of Computing (SE, CS & IT). Professional activities; professional societies;
professional ethics; professional competency and life-long learning. Uses, misuses, risks of
software; information security & privacy. Business practices; intellectual property & software law
(cyber law). Social responsibilities, software related contracts, Software Houses Management.
This course will cover the basic professional ethics methodologies, computer ethics, ethical issues
and social impact of these ethical issues in our lives. Students analyze, evaluate, and assess ethical
and professional computing case studies.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Explain various terms in Computer and C2
General Ethics. C 9
Comprehension
CLO-2 Apply the IEEE / ACM Code of Ethics C3
on various situations. C 8
Application
CLO-3 Analyze given situations for finding C4
ethical, legal and religious issues and C 10
their solutions. Analysis

* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
This course introduces the following topics to students:
 What is Computer Ethics? (Introduction)
 Overview of the ACM Code of Conduct
 Plagiarism and its types
 Intellectual Property
 Software Piracy
 Privacy and Anonymity
 Computer Reliability
 Computer Crime and Security

71
 Scheme of Studies for BS (Computer Science) 2023
 The Structure and Anatomy of a Software House
 The Framework of Employee Relations Law and Changing Management Practices ∙
Human Resource Management and IT, Health and Safety at Work, Software Liability,
Liability and Practice
 Accountability and Auditing
 Bioinformatics and Computational Genomics

Course Weekly Schedule

The course schedule for 16 weeks are detailed below

Week Topic
1 What is Computer Ethics? (Introduction)
• Technology and Ethics w.r.t Islam
• Computer Ethics vs morality
• Ethical Decision Making in Computing
2 Computer Crime and Security
• What is Computer Crime?
• Who are Computer Criminals?
• Computer Fraud
• Deep Fake
• Dark Web
3 Computer Crime and Security
• Hackers and Hacking, Cracking
• Computer Sabotage
• Security, Legislation, and Education
4 ACM
• ACM Code of Ethics and Professional Conduct,
• Overview of all four parts
• General Ethical Principles for IT Users
• IT Professionals’ Responsibilities
• IT Leaders’ Responsibilities
• Compliance with the Code
5 • Plagiarism and its types
• Copyright
• Patent
• The Basis of property law

72
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
• Legal Aspects
6 Intellectual Property
• The Problem of Information ownership
• Arguments For and Against proprietorship
• Intellectual Property Rights
• Protecting Intellectual Property
• Free Software, Adware & Spyware
• Pirated software
Software Piracy
• The Moral Implications of Software Piracy
• Islamic Perspective of software piracy
• Piracy vs Plagiarism
7 Privacy and Anonymity
• The Invasion of Privacy
• The Right of Privacy
• Methods of Privacy Violation
• Surveillance Technologies
• Neighborhood Surveillance
• Protecting Privacy
8 Computer Reliability
• Can we trust computers?
• What is Computer reliability?
• Professional Responsibility
• Software Liability
• Solutions to the Problems
9 Mid Term Examination
10 Computer Crime and Security
• Objectionable Material: What is it? How to protect children from accessing it.
• Vulgarity: Pornography, Unethical Videography and Cyber Laws, Punishment.
• Violence and Hatred: What is it? Cyber Laws, Punishment.
• Blasphemy: What is it? Cyber Laws, Punishment.
• Bitcoins: What is it? Cyber Laws, Punishment

73
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
11 The Structure of Organizations
• Anatomy of a Software House
• Finance and Accounting
• The Framework of Employee Relations Law and Changing Management Practices
• Accountability and Auditing
• Human Resource Management and IT
• JD (Job Descriptions) & Contracts
12 Computers and Health & Safety at Work
• Medical Robots
• Telemedicine
13 Ethical Concerns in:
• Off-shore employment (anonymous)
• Free lancing
• FIA (roles)
14 Bioinformatics and computational genomics
• Introduction & Basic issues
• Judgments about individuals (Employment/ Insurance)
• Ethical concern on ownership of genetic data
15 Bioinformatics and computational genomics
• Ethical concerns in plants and animal’s genomics
• Cloning, Genetic Engineering
16 End Term Examination

Recommended Textbooks
1. Computer Ethics by Deborah G. Johnson, Pearson (Latest Edition). ISBN 10:
0131112414
2. 2. Professional Issues in Software Engineering by Frank Bott, Allison Coleman, Jack
Eaton and Diane Rowland, CRC Press

Recommended Reference (Books/Websites/Articles)

1. A Gift of Fire: Social, Legal, and Ethical Issues for Computing and the Internet by Sara
Baase, Prentice Hall. ISBN-10: 0136008488
2. Applied Professional Ethics by Gregory R. Beabout,University Press of America (1993).
ISBN-10: 0819193747

74
 Scheme of Studies for BS (Computer Science) 2023
CS Supporting- I, Multi Variable Calculus
Course Code: MTMC-224

Semester Credit Hours Prerequisite

[BSCS-3] [3+0] [None]

Course Description
The mathematics required to describe most "real life" systems involves functions of more than one
variable, so the differential and integral calculus developed in a first course in Calculus must be
extended to functions of more variables. In this course, the key results of one-variable calculus are
extended to higher dimensions: differentiation, integration. The machinery developed can be
applied to another generalization of one-variable Calculus, namely to multi variable calculus, and
the course also provides an introduction to this subject.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Understand the basic concepts and know the C2
basic techniques of differential and integral C 2
calculus of functions of several variables Comprehension

CLO-2 Apply the theory to calculate the gradients, C3

directional derivatives, area of surfaces, and C 2
volume of solids Application

CLO-3 Solve problems involving maxima and C3

minima, line integral and surface integral, C 2
and vector calculus Application

* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
This course introduces the following topics to students:
 Introduction to multivariable calculus, Level curves and graph of the functions.
 Understanding of limit and continuity of the function of several functions.
 Understanding of differentiation of functions of several variables. Higher order
differentiations
 Chain rule of differentiation to calculate the derivatives of composite functions.
 Directional derivatives and gradient of the function
 Understanding of Maximum/minimum of the function of several variable and its
application
 Lagrange Multipliers and Example

75
 Scheme of Studies for BS (Computer Science) 2023
 Double integral over a region and its application to calculate volume of the close surface
 Double integral as an area of close region in 2D plane.
 Understanding of vector field and line integral
 Surface Integral and related theorems

Course Weekly Schedule

The course schedule for 16 weeks is detailed below

Week Topic
1 Introduction to Multivariable function and Multivariable calculus
2 Level curves and graph of functions
3 Limit of several functions
4 Continuity of the function of several functions
5 Introduction to partial derivatives
6 Chain Rule of differentiation
7 Directional derivatives and the gradient
8 Maximum/minimum problems
9 Lagrange Multipliers and Example
10 Definition and example of Double Integration
11 Double integrals over general regions
12 Double integrals in polar coordinates
13 Triple integrals
14 Vector fields, Line integrals
15 Conservative Field and Green’s Theorem.
16 Stoke’s Theorem.

Recommended Textbooks

1. Weir, M. D., & Hass, J. (2008). Thomas’ Calculus. Pearson Education India. ISBN:
9788131718674.
2. Stewart, J. (2011). Multivariable Calculus. Cengage Learning. ISBN: 9781133170723.

76
Scheme of Studies for BS (Computer Science) 2023

Semester IV

77
 Scheme of Studies for BS (Computer Science) 2023
Design & Analysis of Algorithms
Course Code: CSAA-202

Semester Credit Hours Prerequisite

[BSCS-4] [3+0] [CSDA-244]

Course Description
This course is an advanced undergraduate course on design and analysis of algorithms. Topics
such as Role of algorithms in computing, Big-O, Big Ω, Big Θ, loop invariants, Search algorithms,
Linear sorting algorithms, Recursion and recurrence relations, divide-and-conquer approach,
dynamic programming, String Matching algorithms, Heaps, Hashing and Greedy algorithms.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Understand the fundamental algorithms in
computer science, given a problem, students C2
C 2
would be able to explain the strategies and Understanding
design algorithms.
CLO-2 Analyze the time and space complexity of C4
algorithms using asymptotic notations. C 3
Analysis
CLO-3 Use of the strategies to solve an appropriate C3
problem more efficiently. C 3
Application
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
This course introduces the following topics to students:

 Introduction to Course, Analyzing algorithms

 RAM Model
 Proof techniques, Asymptotic analysis (Big-O, Big Ω, Big Θ)
 Amortized Analysis
 Sorting Algorithms Analysis (Bubble Sort, Selection Sort)
 Insertion Sort, Custom Sorting Algorithms)
 Searching Algorithms
 Recursion
 Recurrence Relations
 Method to Solve Recurrence Relation (Iteration Method)

78
 Scheme of Studies for BS (Computer Science) 2023
 Algorithm Design Techniques: Divide-and-conquer: Merge-Sort + Quicksort, Randomized
Quicksort + Complexity Analysis
 Recursion Tree Method
 Master’s Theorem, Heaps
 Bucket Sort, String Matching Algorithms
 Hashing
 Greedy algorithms
 Dynamic programming
 NP Complete Problems

Course Weekly Schedule

The course schedule for 16 weeks is detailed below

Week Topic
1 Basics:
Introduction to Course, Analyzing algorithms
RAM (Computational Model, Computational Complexity
2 Proof techniques, Induction Summations
Asymptotic analysis (Big-O, Big Ω, Big Θ)
3 Amortized Analysis:
Charging schemes, potential method,
binary incrementing/decrementing counter, loop invariants
4 Linear Programming:
Sorting Algorithms Analysis (Bubble Sort, Selection Sort)
5 Insertion Sort, Custom Sorting Algorithms )
6 Searching Algorithms
Recursion
7 Recurrence Relations
Method to Solve Recurrence Relation (Iteration Method)
Exercise
8 Algorithm Design Techniques.
Divide-and-conquer: Merge-Sort + Complexity Analysis
9 Quicksort, Randomized Quicksort + Complexity Analysis
10 Recursion Tree Method
11 Master’s Theorem, Heaps

79
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
12 Bucket Sort, String Matching Algorithms
13 Hashing
14 Greedy algorithms
15 Dynamic programming
16 NP Complete Problems

Recommended Textbooks

1. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2022). Introduction to Algorithms, 4th
edition. MIT Press, 2022. ISBN: 9780262046305.
2. Kleinberg, J., & Tardos, É. (2006). Algorithm Design. Pearson Education India, 2006. ISBN:
9788131703106.

80
 Scheme of Studies for BS (Computer Science) 2023
Software Engineering
Course Code: SESE-245

Semester Credit Hours Prerequisite

[BSCS-4] [3+0] [None]

Course Description
In this course, students will learn about some of the most basic topics on software engineering.
This course would cover the basic and agile software process models. It further goes into the details
of different phases of these models as Requirements Engineering, Analysis, Design and Testing.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Describe various software engineering C2
processes and activities C 2
Understanding
CLO-2 Explain various software development C2
processes/methodologies C 2
Understanding
CLO-3 Analyze software engineering key areas C4
C 3
Analysis
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
Nature of Software, Overview of Software Engineering, Professional software development,
Software engineering practice, Software process structure, Software process models, Agile
software Develop-ment, Agile process models, Agile development techniques, Kanban software
development, lean software development, Requirements engineering process, Functional and non-
functional require-ments, UML diagrams, Context models, behavioral models, model driven
engineering, Architectural design, Design and implementation, Risk Management, Software
testing and quality assurance, Pro-ject management, configuration management, Software Process
improvement.

Course Weekly Schedule

The course schedule for 17 weeks is detailed below

Week Topic
1 Software Crisis. What is a software? The Nature of Software, Defining Software,
Software Application Domains,Legacy Software, The Changing Nature of

81
 Scheme of Studies for BS (Computer Science) 2023

Week Topic
Software (web apps, mobile apps, cloud computing, product line software),
Software Engineering, The Software Process, The Process Framework, Umbrella
Activities, Software Engineering Principles.

2 Software Development Life Cycle, A Generic Process Model, Defining a

Framework Activity, Software Process Flow, Identifying Task sets, Process
Patterns, Process Assessment and Improvement

3 What is process Model?, process flow, prescriptive vs descriptive process

models, Prescriptive Process Model; The Waterfall Model, Incremental Process
Models, Evolutionary Process Models, Concurrent Models.

4 Specialized Process Models; Component-Based Development, The Formal

Methods Model, Aspect-Oriented Software Development, The Unified Process, A
Brief History, Phases of the Unified Process, Personal and Team Process Models,
Personal Software Process, Team Software Process.

5 What Is Agility? Agile Software Development, Predictive vs descriptive, Agile

manifesto, Agility and the Cost of Change, What Is an Agile Process?,
Characteristics of Agile Software Development, Agility Principles, User Stories,
template, good user stories, spike, user story writing workshop, story mapping

6 Agile Planning, concepts of effort, duration, accuracy, precision, relative, and

absolute, estimation styles (planning porker, card sorting), velocity in agile, release
planning its types, Scrum process model, Extreme Programming

7 Dynamics system development method, Feature driven development, Kanban, pair

programming

8 Human aspects of software engineering (Software teams, stakeholders):

Characteristics of a Software Engineer, The Psychology of Software Engineering,
The Software Team, Team Structures, Agile Teams

9 Mid Term Exams

10 Software requirement engineering, Functional vs non-functional requirement, RE

process, Developing Use case

11 Software Design and Modelling-Introduction to UML, use case modelling, Context

Models (Data Flow Diagrams) and behavioral models (activity Diagram)

82
 Scheme of Studies for BS (Computer Science) 2023

Week Topic
12 Architectural Design- Software Architecture, Architectural Styles Architectural
Descriptions, Architectural Decisions, What is quality? Software quality, software
quality dilemma, achieving software quality, Review techniques, informal reviews,
formal reviews, post mortem evaluation, software quality assurance, formal
approaches to SQA, software reliability, Software process improvement- CMM
and CMMI.

13 Software Testing fundamentals, testing types, testing levels

14 Risk Management: Reactive versus Proactive Risk Strategies, SoftwareRisks ,Risk

Identification, Assessing Overall Project Risk, Risk Components and Drivers,
Risk Projection, Developing a Risk Table, Assessing Risk Impact, Risk
Refinement, Risk Mitigation, Monitoring, and Management, The RMMM Plan

15 Maintenance and Reengineering: Software Maintenance, Software Supportability,

Reengineering, Business Process Reengineering, Business Processes , A BPR
Model, Software Reengineering, A Software Reengineering Process Model,
Software Reengineering Activities, Reverse Engineering ,Reverse Engineering to
Understand Data, Reverse Engineering to Understand Processing, Reverse
Engineering User Interfaces

16 Presentation Week

Recommended Textbook(s)
1. Sommerville, I. (2015). Software engineering, 10th Edition. Pearson. ISBN:
9780133943030.
2. Pressman, R. S., & Bruce R. Maxim, D. (2014). Software Engineering: A Practitioner’s
Approach. ISBN: 9780078022128.

Recommended Reference (Books/Websites/Articles)

1. The new software engineering, Sue Conger, 2008.

83
 Scheme of Studies for BS (Computer Science) 2023
CS Elec. - I, Web-Programming
Course Code: CSWP-265

Semester Credit Hours Prerequisite

[BSCS-4] [2+1] [CSOO-142]

Course Description
This course is designed to provide the student with foundational web programming knowledge and
skills for interactive and dynamic website building. The student will learn about the web
programming as a development platform through the use of popular front-end technologies:
HTML, CSS, JavaScript, Bootstrap, jQuery and ReactJs. Moreover, the student will learn to plan,
design, construct, and integrate server-side components of modern web applications. For back-end
the students will learn PHP with MVC based framework such as Laravel. This will allow students
to create websites that store, access, and use data which is stored in the database by exploring SQL
queries and Object–relational mapping (ORM). By the end of this course a strong foundation will
be laid for full-stack development in the carrier of the student.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Design interactive and responsive C5
website using front-end technologies. C 4
Synthesis
CLO-2 Integrate server-side technologies for C5
handling information. C 4
Synthesis
CLO-3 Utilize modern frameworks to increase C3
the efficient and productivity. C 5
Application
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
This course introduces the following topics to students:
 HTML
 CSS
 JavaScript
 PHP
 Bootstrap
 Laravel and ReactJs

Course Weekly Schedule

The course schedule for 16 weeks is detailed below

84
 Scheme of Studies for BS (Computer Science) 2023

Week Topic
1 Introduction to HTML and CSS.
2 Introduction to JavaScript and PHP
3 Introduction to PHP OOP
4 Introduction to Bootstrap
5 Introduction to Laravel, Routes and Controllers
6 Views in Laravel and Blade templating engine
7 Databases, Eloquent, Models, Migrations, Seeders and Faker Factory
8 User authentication and authorization
9 Laravel - RESTful APIs authentication
10 React Basics, ReactDOM and JSX
11 Props, States and Components
12 Redux
13 React Router
14 Consuming RESTful APIs created in Laravel
15 Project Demonstration/Presentations
16 Project Demonstration/Presentations

Recommended Textbooks
1. Meloni, J. C., & Kyrnin, J. (2018). Sams Teach Yourself HTML, CSS, and JavaScript All in
One, 3rd Edition. Pearson Education. ISBN: 9780672338083.
2. Tatroe, K., & MacIntyre, P. (2020). Programming PHP: Creating Dynamic Web Pages, 4th
Edition. O'Reilly Media, ISBN: 9781492054139.
3. Stauffer, M. (2019). Laravel: Up & Running: A Framework for Building Modern PHP Apps,
2nd Edition. O'Reilly Media. ISBN: 9781492041184.

85
 Scheme of Studies for BS (Computer Science) 2023
CS Elec. - I, Web-Programming-Lab
Course Code: CSWP-265L

Semester Credit Hours Prerequisite

[BSCS-4] [2+1] [CSOO-142]

Course Description
This course is designed to provide the student with foundational web programming knowledge and
skills for interactive and dynamic website building. The student will learn about the web
programming as a development platform through the use of popular front-end technologies:
HTML, CSS, JavaScript, Bootstrap, jQuery and ReactJs. Moreover, the student will learn to plan,
design, construct, and integrate server-side components of modern web applications. For back-end
the students will learn PHP with MVC based framework such as Laravel. This will allow students
to create websites that store, access, and use data which is stored in the database by exploring SQL
queries and Object–relational mapping (ORM). By the end of this course a strong foundation will
be laid for full-stack development in the carrier of the student.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Designs a fully functional frontend for a P6
web page based on a given scenario. P 3
Adaption
CLO-2 Construct a fully functional backend for P6
a web page based on a given scenario. P 4
Adaption
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
This course introduces the following topics to students:
 HTML
 CSS
 JavaScript
 PHP
 Bootstrap
 Laravel and ReactJs

Lab Weekly Schedule

The lab schedule for 16 weeks is detailed below. All CLOs shall be accessed in each lab.

86
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
1 Creating development environment setup
2 Learning the following HTML tags for web pages required for front-end.
 HTML5 page structure
 HTML headings
 Anchor link,
 Line break
 Paragraph
 Image
 Div
 Ordered and unordered list tags
3 Learn to create tables using HTML
 Designing registration form using HTML
4
Designing first page of website using HTML and CSS
 Design the navigation bar using CSS property display: flex
 Enhance the cosmetic look of HTML table using CSS.
 Design a contact form by customizing HTML form with input controls
 Add alignment of form: In center vertically and horizontally regard less of
screen size.
 Design complete layout of web page using HTML, CSS and CSS Grid.

5 Create a PHP MySQL CRUD application using MySQLi.

6 Create an Object Oriented Programming based PHP MySQL CRUD application using
PDOs.
7 Create a PHP session based user authentication and authorization system also make
sure to upload user photo at the time of registration.
8 Mid-term evaluation
9  Validate a HTML form using JavaScript and display appropriate messages
using DOM manipulation.
 Use fetch to display album title in an unordered list from the API
https://jsonplaceholder.typicode.com/albums.

87
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
10  Design responsive layout for a shopping catalog using Bootstrap grid, card,
and helper classes.
 Design a pop-up contact us form using Bootstrap form controls, modal, and
helper classes.
 Use Bootstrap carousel with controls, indicators and captions to display a
company’s portfolio in shape of images and text on them.
11 Use Laravel code first approach to create CRUD application using MySQL and Blade
templating engine (Part 1).
12 Use Laravel code first approach to create CRUD application using MySQL and Blade
templating engine (Part 2).
13 Create RESTful APIs for tasks table having columns id, text, day and reminder using
Laravel.

14 Consuming GET API to display data in React application

15 Using POST and DELETE APIs in React application
16 Final-term evaluation

Recommended Textbooks
5. Meloni, J. C., & Kyrnin, J. (2018). Sams Teach Yourself HTML, CSS, and JavaScript All in
One, 3rd Edition. Pearson Education. ISBN: 9780672338083.
6. Tatroe, K., & MacIntyre, P. (2020). Programming PHP: Creating Dynamic Web Pages, 4th
Edition. O'Reilly Media, ISBN: 9781492054139.
7. Stauffer, M. (2019). Laravel: Up & Running: A Framework for Building Modern PHP Apps,
2nd Edition. O'Reilly Media. ISBN: 9781492041184.

88
 Scheme of Studies for BS (Computer Science) 2023
CS Supporting - II, Differential Equations
Course Code: MTDE-225

Semester Credit Hours Prerequisite

[BSCS-4] [3+0] [None]

Course Description
This course provides an introduction to topics involving ordinary differential equations. Emphasis
is placed on the development of abstract concepts and applications for first-order and linear second
and higher-order differential equations, series solutions and Laplace transforms. Upon completion,
students will be able to demonstrate understanding of the theoretical concepts and select and use
appropriate models and techniques for finding solutions to differential equations-related problems
with and without technology.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Describe types and formation of differential C2
equations & their solutions. C 2
Understand
CLO-2 Apply techniques to solve 1st, 2nd and higher
order differential equations and various models C3
C 2
depicted by 1st, 2nd and higher order differential Apply
equations.
CLO-3 Use of Laplace transform to solve the C3
differential equations. C 2
Apply
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
This course introduces the following topics to students:
 Introduction to ordinary differential equations, classification by order, linear,
homogeneous, Types of solution, General solution, particular solution
 First order differential equation and initial value problems, Separable differential equations
 Reduction to separable equation (homogeneous equation), Exact differential equation
 Integrating factors Type I and II, Reduction to exact differential equation by integrating
factors
 First order- Linear differential equations
 First order non-Linear (Bernoulli equation)
 Power series method
 Modelling electric circuit, Existence and uniqueness of solutions

89
 Scheme of Studies for BS (Computer Science) 2023
 Introduction to linear second and higher order differential equation, fundamental theorem
of homogeneous equations
 Homogeneous second and higher order equations with constant coefficients : Types and
roots: Real roots of characteristic equation , Complex roots and double roots of
characteristic equation
 Solution of second and higher order differential equations by Undetermined coefficients
 Non-homogeneous equation and method of Wronskian: Solution of second and higher
order by variation of parameters
 Euler- Cauchy equation
 Laplace transform
 Inverse Laplace transform
 Solution of differential equations using Laplace transform

Course Weekly Schedule

The course schedule for 16 weeks is detailed below

Week Topic
1 Introduction to ordinary differential equations, classification by order, linear,
homogeneous, Types of solution, General solution, particular solution
2 First order differential equation and initial value problems, Separable differential
equations
3 Reduction to separable equation (homogeneous equation), Exact differential equation
4 Integrating factors Type I and II, Reduction to exact differential equation by integrating
factors
5 First order- Linear differential equations
6 First order non-Linear (Bernoulli equation)
7 Power series method
8 Modelling electric circuit, Existence and uniqueness of solutions
9 Introduction to linear second and higher order differential equation, fundamental
theorem of homogeneous equations
10 Homogeneous second and higher order equations with constant coefficients : Types
and roots: Real roots of characteristic equation , Complex roots and double roots of
characteristic equation
11 Solution of second and higher order differential equations by Undetermined
coefficients
12 Non-homogeneous equation and method of Wronskian: Solution of second and higher
order by variation of parameters

90
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
13 Euler- Cauchy equation
14 Laplace transform
15 Inverse Laplace transform
16 Solution of differential equations using Laplace transform

Recommended Textbooks

1. Kreyszig, E. (1988). Advanced Engineering Mathematics, 6th Edition. Wiley. ISBN:

9780471858249.
2. Zill, D. G., & Cullen, M. R. (2005). Differential Equations with Boundary-value Problems.
Thomson Brooks/Cole. ISBN: 9780534420741.

91
 Scheme of Studies for BS (Computer Science) 2023
CS Elec. - II, Advance OOP
Course Code: CSAO-267

Semester Credit Hours Prerequisite

[BSCS-4] [2+1] [CSOO-142]

Course Description
The course introduces the students to the concepts and principles of enterprise level application
development using Java EE environment. The central theme will be about using object orientation
in coming up with software with an emphasis on conceptualize, design, and implement windows
and web based applications. It also covers the client server and 3-tier architecture based
applications. This course provides a strong base to students for web and visual programming
courses. The course uses Java as the programming language and assumes prior knowledge of
programming, J2SE and algorithms. In addition to these a semester project of commercial worth
will also be developed.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

Analyze current programming problems for
industry and compare their solutions using C4
CLO-1 C 3
concepts of Advance object oriented Analysis
programming.
Design and develop GUI based, network C5
CLO-2 based and web based application having C 4
connectivity with database. Synthesis

Evaluate and indicate pros & cons of certain C5

CLO-3 Object Oriented Model. C 2
Synthesis

* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
This course introduces the following topics to students:
 Review an understanding of the principles of the object-oriented paradigms.
 Utilize collections frame work for handling algorithms and data structures.
 Develop Client / Server based applications.
 Multithreaded application to achieve concurrent execution of tasks
 Develop applications for Relational, Object Oriented and distributed databases.

92
 Scheme of Studies for BS (Computer Science) 2023
 Comprehend a programming problem and design a solution.
 Model the object oriented applications.
 Design and develop Web applications using conventional style.

Course Weekly Schedule

The course schedule for 16 weeks is detailed below

Week Topic
1 Review of Inheritance, Encapsulation, Abstraction, Polymorphism, Interfaces
Anonymous Object, Dynamic Dispatch, Exception Handling, User Defined Exception
2
and its Handling
Runtime Windows form Designing, Buttons, TextFields, Labels etc. using AWT and
3
Swing packages.
4 Database Connectivity (mysql) with swing GUI, CRUD Operations
5 Layered Architecture (DAO), CRUD Operations
Collections Framework and its Applications in Software development. Creating
6
Dynamic array, LinkedList, HashSet etc.
7 Insert, modify, remove and search values in ArrayList.
8 CRUD Opertions in ArrayList with Swing GUI.
Multithreading in java, Synchronization, IntherThread Communication, Multithreaded
9
server client application
Web page designing and development and web page life cycle.J2ME, J2EE, Java EE and
10
J2SE comparison and applications
Web application, web server and database server interactivity concepts. Overview of
11
HTML, javaScript, Servlets, JSP.
Session Handling (Session, Cookies, Hidden Fields, URL Rewriting), JSP comparison
12
with Servlets, JSP Tags Implementation
Database Connectivity (mysql) with Java Web (JSP+Servlets), Layered Architecture
13
(DAO) in java web designing
Concept Of Framework, Overview Of Java Server Faces For Web Application
14
Development, Insertion, deletion, modification in JSF.
Interaction Of Model View Controller And Applications, its Advantages as compared to
15
Non-Layered Win & Web Apps
MVC Frameworks Overview, Transformation of web application into Java Web
16
Frameworks

93
 Scheme of Studies for BS (Computer Science) 2023

Recommended Textbooks

1. Schildt, H. (2006). Java The Complete Reference, Seventh Edition. Mcgraw-hill. ISBN:
9780072263855.
2. Deitel, P. J., & Deitel, H. M. (2007). Java: How to Program. Pearson Prentice Hall. ISBN:
9780136132479.
3. Liang, Y. D. (2005). Introduction to Java Programming: Comprehensive Version, Fifth
Edition. Pearson Prentice Hall. ISBN: 9780131857216

94
 Scheme of Studies for BS (Computer Science) 2023
CS Elec. - II, Advance OOP-Lab
Course Code: CSAO-267L

Semester Credit Hours Prerequisite

[BSCS-4] [2+1] [CSOO-142]

Course Description
The course introduces the students to the concepts and principles of enterprise level application
development using Java EE environment. The central theme will be about using object orientation
in coming up with software with an emphasis on conceptualize, design, and implement windows
and web based applications. It also covers the client server and 3-tier architecture based
applications. This course provides a strong base to students for web and visual programming
courses. The course uses Java as the programming language and assumes prior knowledge of
programming, J2SE and algorithms. In addition to these a semester project of commercial worth
will also be developed.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Develop software solutions for different P6

problems and construct software based P 5
application for it. Adaption

Design & Develop enterprise applications P5

CLO-2 Using an object oriented programming
P Complete Overt 4
language, and associated class libraries based
on object oriented patterns. Response

* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
This course introduces the following topics to students:
 Review an understanding of the principles of the object-oriented paradigms.
 Utilize collections frame work for handling algorithms and data structures.
 Develop Client / Server based applications.
 Multithreaded application to achieve concurrent execution of tasks
 Develop applications for Relational, Object Oriented and distributed databases.
 Comprehend a programming problem and design a solution.
 Model the object oriented applications.
 Design and develop Web applications using conventional style.

95
 Scheme of Studies for BS (Computer Science) 2023
Lab Weekly Schedule
The lab schedule for 16 weeks is detailed below. All CLOs shall be accessed in each lab.

Week Topic
1 Review of Inheritance, Encapsulation, Abstraction, Polymorphism, Interfaces
Anonymous Object, Dynamic Dispatch, Exception Handling, User Defined Exception
2
and its Handling
Runtime Windows form Designing, Buttons, TextFields, Labels etc. using AWT and
3
Swing packages.
4 Database Connectivity (mysql) with swing GUI, CRUD Operations
5 Layered Architecture (DAO), CRUD Operations
Collections Framework and its Applications in Software development. Creating
6
Dynamic array, LinkedList, HashSet etc.
7 Insert, modify, remove and search values in ArrayList.
8 CRUD Opertions in ArrayList with Swing GUI.
Multithreading in java, Synchronization, IntherThread Communication, Multithreaded
9
server client application
Web page designing and development and web page life cycle.J2ME, J2EE, Java EE
10
and J2SE comparison and applications
Web application, web server and database server interactivity concepts. Overview of
11
HTML, javaScript, Servlets, JSP.
Session Handling (Session, Cookies, Hidden Fields, URL Rewriting), JSP comparison
12
with Servlets, JSP Tags Implementation
Database Connectivity (mysql) with Java Web (JSP+Servlets), Layered Architecture
13
(DAO) in java web designing
Concept Of Framework, Overview Of Java Server Faces For Web Application
14
Development, Insertion, deletion, modification in JSF.
Interaction Of Model View Controller And Applications, its Advantages as compared
15
to Non-Layered Win & Web Apps
MVC Frameworks Overview, Transformation of web application into Java Web
16
Frameworks

96
 Scheme of Studies for BS (Computer Science) 2023
Recommended Textbooks

1. Schildt, H. (2006). Java The Complete Reference, Seventh Edition. Mcgraw-hill. ISBN:
9780072263855.
2. Deitel, P. J., & Deitel, H. M. (2007). Java: How to Program. Pearson Prentice Hall. ISBN:
9780136132479.
3. Liang, Y. D. (2005). Introduction to Java Programming: Comprehensive Version, Fifth
Edition. Pearson Prentice Hall. ISBN: 9780131857216

97
 Scheme of Studies for BS (Computer Science) 2023
Univ. Elec. - III, Digital Marketing
Course Code: CSDM-266

Semester Credit Hours Prerequisite

[BSCS-4] [3+0] [None]

Course Description
The course provides a framework to design and execute a winning SEO strategy and Digital
Campaigns. Also enables students to leverage the power of Optimization techniques and online
marketing to create awareness (upper funnel marketing) to realizing sales due to organic traffic.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

Explain emerging trends in SEO/digital
marketing and critically assess the use of C C2
CLO-1 3
digital marketing tools by applying relevant Comprehension
marketing theories and frameworks.
Demonstrate cognitive knowledge of the skills
required in conducting online research and C3
CLO-2 research on online markets for identifying, C 3
assessing and selecting SEO techniques and Application
digital marketing opportunities for a business.
Investigate and evaluate issues in adapting to C4
CLO-3 globalized markets that are constantly C 10
changing and increasingly networked. Analysis

* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
This course introduces the following topics to students:
 Understand how to reach your target customers using SEO.
 Define the main elements of a well-optimized website.
 Utilize keyword research insights to understand user intent.
 Determine how to build and grow sustainable and qualified website traffic.
 Fundamental concepts of Marketing
 Setting the right “Campaign Objective”
 Overview of available Digital Platforms (Google Search, Youtube, Facebook, Instagram)
and Digital properties they offer
 Tracking campaign success vs. selected KPI’s (Key Performance Indicators)

98
 Scheme of Studies for BS (Computer Science) 2023
 Creative Excellence – What makes an ad stand out

Course Weekly Schedule

The course schedule for 16 weeks is detailed below

Week Topic
Introduction/Overview: SEO intro, History, Development and Growth of Search Engine
1 in Cyber space. Pull Marketing, Purpose of SEO, How Google search engine works,
Google Ranking, SEO success factors.
Keywords: Intro, Purpose, Types of keywords (primary, secondary, LSI keywords),
Keyword Researching and Planner tools, Other 3rd party tools and desktop applications,
2-3
Mapping keywords to webpage, Segregation of High and Low priority keywords, Excel
file of Keywords, Uses of formulas to find Best Keywords.
OnPage SEO: Introduction, Basics of HTML, designing how to use Keywords, URL,
Meta, Title, Description, Heading Tags, Content, images, ALT, video, Anchortext,
4
HTML sitemaps, sitemaps creation tools, interlinking, Google search console and Bing
Webmaster.
OffPage SEO: Introduction, Backlinks, gTLD and ccTLD, PageRank Algorithm, Local
5
SEO, Social SEO
UI and UX: Introduction, difference between UI and Ux, UI/UX Critical Factors, UX
6
conversion rate optimization, Conversion Matrices, Google search analytics.
Technical SEO: Introduction, Factors of Technical SEO, URL architecture, Page Speed
Analysis, Page Speed Tools (GTMetrix, Pingdom, Google page speed checker), Test and
7-8
Improved page speed, Mobile web crawling, Structured data usage and optimization,
creating crawlable resources, Auditing internal links, reviewing sitemap
Local SEO: SEO strategies for localized business, social media back linking and
marketing, Local SEO tools (Quora, Twitter, LinkedIn, Facebook, Google+, Pinterest),
9 Online Reputation Management, Targeted Audience Strategy, Lead generation for local
audience, Local SEO by Category(Niche, products, services), Schema for local
addresses, local keywords and websites.
SEO Site Audit: Audit before launching the site, Domain name (Brand name generator,
EMD for specific purpose), Brainstorming (Tools), Prototyping (Tools), Mockup
maping (tools), Logo Suggestion-color scheme, Design and SEO UI/UX,Audit after
10 launching website, onPage Audit, offPage Audit, Tools: Online free tools, Paid Tools,
Desktop Applications, Audit Report. How to analyze and measure audit report,
Reporting for client, Google Algorithm Updates, Search algorithm overview, google
algorithm change, Google ML.

99
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
Search Engine Marketing-Adwords: Introduction and Types of SEM, Google PPC and
11 Adwords, Fundamentals of Ad making, ad position, ad auction, Ad rank, ad formats,
bidding, Google dashboard.
Campaign creation-Adwords: Cost per Click, Costs per Impression, Cost per
Acquisition, Keyword targeting and strategy, Enhanced cost per click, Keyword match
12
types, Broad Phrase, Broad match (modifier, exact, negative), Keyword Performance
high conversion.
Display Advertisement: Introduction (PPC, CPM), purpose and advantage of Display
13 Ads Mapping, Marketing objectives, targeting methods, Display ad formats and tools,
Remarketing of SEM, Reports and Optimizing display campaign.
Video Paid Ads: Video Paid Advertising, AdWords video ads, Platforms (youtube,
14 instream), video discovery ads, bumper ads, how to create video ads, creation of CTA,
overlay ads, Optimizing video ads, Ad reporting and Youtube analytics.
Shopping advertisement: Google shopping ads, product listing ad, ad formats,
15 appearance on Goofle, Requirements of Advertisement, create shopping campaign on
Google AdWord, Features of Google Shopping, PLA.
16 End Term Exam

Recommended Textbooks

1. Enge, E., Spencer, S., & Stricchiola, J. (2015). The Art of SEO: Mastering Search Engine
Optimization. Zarrella, D. (2009). The Social Media Marketing Book. O'Reilly Media, Inc.
ISBN: 9781491903650.
2. Kingsnorth, S. (2019). Digital Marketing Strategy: An Integrated Approach to Online
Marketing. Kogan Page Limited. ISBN: 9780749484224

100
Scheme of Studies for BS (Computer Science) 2023

Semester V

101
 Scheme of Studies for BS (Computer Science) 2023
Database Systems
Course Code: CSDB-346

Semester Credit Hours Prerequisite

[BSCS-4] [3+1] [CSDA-244]

Course Description
This module introduces the basic concepts of databases and database management systems. Help
students understand benefits that can be attained by using both Relational Database Management
System and NoSql. It Enable students to become comfortable in designing databases and schemas,
plus writing both simple and complex queries (SQL and XPath) to manipulate database.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Explain fundamental database concepts. C2
C 2
Comprehension
CLO-2 Design conceptual, logical and physical
database schemas using various data C5
C 4
models. Synthesis

CLO-3 Identify functional dependencies &

resolve database anomalies by C5
C 4
normalizing database tables. Synthesis

* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
Fundamental database concepts, Database approach vs file based system, database architecture, three level
schema architecture, data independence, types of data model(relational data model, entity relationship
model), Entity Relationship diagram, entity sets, attributes, relationship, attributes, schemas, tuples,
domains Enhanced entity relationship model(EER diagram),relational and logical database design, ,
relation instances, keys of relations, integrity constraints, types of joins, functional dependencies, normal
forms, Structured Query Language (SQL), data definition languages , sub-queries in SQL, Transaction
Management ,data mining, data warehousing, NoSQL.

Course Weekly Schedule

The course schedule for 16 weeks is detailed below

102
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
Course introduction, Fundamental database concepts: Data, data versus information,
1 data, manual file processing, traditional file processing, disadvantages of manual and
traditional file processing systems.
Database approach vs file-based system, Advantages and dis-advantages of database
2
management system, components of DBMS environment.
Data Models (Relational Data Model, ER Data Model) Three level schema architecture
3 (ANSI SPARC), external level, conceptual level, internal level, data independence, data
dependence database languages overview
Modeling rules process in organization (overview of business rules, scope of business
4 rules) types of business rules structure of business rules, constraints, types of keys
(primary key, composite key, surrogate key and foreign key)
ERD vs business rules, modelling entities and attributes (entity and entity type, Strong
vs weak entity, associative entity attributes and types of attributes) relationship type.
5 Degree of relationship (unary/recursive, binary and ternary relationship) structural
constraints (one to one, one to many, many to many), minimum and maximum
cardinality.
Enhanced Entity–Relationship Modeling (EERD), data modeling concepts of the
6 Enhanced Entity–Relationship model (super type, sub type, specialization and
generalization
Specifying constraints in super type and sub type in Enhanced Entity–Relationship
7
Modeling (EERD)
Logical database design and relational model (relations, relation keys, integrity
8 constraints (domain constraint, entity integrity and referential integrity), transforming
ERD and EERD into relations.
9 Mid Term Exams
Functional dependencies (Full functional dependency, partial functional dependency,
10
transitive dependency)
Normalization process- 1NF, 2NF, 3NF, Denormalization, BCNF(optional), 4NF
11
(optional)
Relational Algebra selection, Project Cartesian product, Union, Set difference, Join
12
operation
13 Database recovery and security OR Introduction to data mining
14 Introduction to data mining (data ware housing, OLAP, OLTP)
15 NoSQL OR Database life cycle

103
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
16 Transaction management (optional), Concurrency control (optional)

Recommended Textbooks

1. Modern database management, Jeffrey A. Hoffer, 12th Edition, Pearson, 2016.

2. Database systems: A practical approach to design, implementation, and management, Thomas
Connolly and Carolyn Begg, 6th Edition, Pearson, 2015.
Recommended Reference (Books/Websites/Articles)
1. Database system concepts, Avi Silberschatz, Henry F. Korth and S. Sudarshan, 6th Edition,
McGraw-Hill, 2010.
2. Database systems: Design, implementation and management, Carlos M. Coronel, 13th Edition,
Cengage Learning, 2018.

104
 Scheme of Studies for BS (Computer Science) 2023
Database Systems-Lab
Course Code: CSDB-346L

Semester Credit Hours Prerequisite

[BSCS-4] [3+1] [CSDA-244]

Course Description
This module introduces the basic concepts of databases and database management systems. Help
students understand benefits that can be attained by using both Relational Database Management
System and NoSql. It Enable students to become comfortable in designing databases and schemas,
plus writing both simple and complex queries (SQL and XPath) to manipulate database.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Demonstrate knowledge about the C2
practical aspects of database systems C 2
Comprehension
CLO-2 Manipulate tools and techniques to solve P3
problems by applying database concepts. P 5
Guided Reponse
CLO-3 Report the outcome of an experiment/task A2
in standard format A 7
Responding
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
Fundamental database concepts, Database approach vs file based system, database architecture,
three level schema architecture, data independence, types of data model(relational data model,
entity relationship model), Entity Relationship diagram, entity sets, attributes, relationship,
attributes, schemas, tuples, domains Enhanced entity relationship model(EER diagram),relational
and logical database design, , relation instances, keys of relations, integrity constraints, types of
joins, functional dependencies, normal forms, Structured Query Language (SQL), data definition
languages , sub-queries in SQL, Transaction Management ,data mining, data warehousing,
NoSQL.

Lab Weekly Schedule

The lab schedule for 16 weeks are detailed below. All CLOs shall be accessed in each lab.

Week Topic
1 Introduction to oracle and installation guidelines

105
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
2 Retrieving data using the SQL SELECT statement

3 Restricting using where and sorting data using order by

4 Using single-row character functions to customize output, use of NVL function

5 Using single-row date functions to customize output & type conversion

6 Constructing ERD using VISIO or Erwin

7 Displaying data from multiple tables

8 Midterm assessment

9 Use of inner & outer joins for displaying data from multiple tables

10 Aggregating data using group functions

11 Use of subqueries

12 Using the set operators

13 Manipulating data

14 Using DDL statements to create and manage tables

15 Views, sequences, indexes

16 Final term assessment

Recommended Textbooks

1. Modern database management, Jeffrey A. Hoffer, 12th Edition, Pearson, 2016.

2. Database systems: A practical approach to design, implementation, and management, Thomas
Connolly and Carolyn Begg, 6th Edition, Pearson, 2015.
Recommended Reference (Books/Websites/Articles)
1. Database system concepts, Avi Silberschatz, Henry F. Korth and S. Sudarshan, 6th Edition,
McGraw-Hill, 2010.
2. Database systems: Design, implementation and management, Carlos M. Coronel, 13th Edition,
Cengage Learning, 2018.

106
 Scheme of Studies for BS (Computer Science) 2023
Computer Organization and Assembly Language
Course Code: CSCA-303

Semester Credit Hours Prerequisite

[BSCS-5] [3+1] [None]

Course Description
This course is designed to introduce the student with foundation and working of computers. The
basic functional units that reside inside it and their function as part of the unit. The student will
learn about the multi-core processors and the parameters that measure the performance of a system.
A useful technique called Pipelining will be exercised. The concept of cache memory along with
the constraints are discussed. Finally Input/output techniques are introduced to the students.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Explain the major components of a computer, C1
basics of computer organization and the C 2
interconnection between computer modules. Knowledge

CLO-2 Demonstrate the functions and internal C3

working of Central Processing unit and C 2
Assembly Language. Application

CLO-3 Analyze the memory hierarchy, I/O modules,

instruction set architecture (x86-64), C4
C 2
addressing modes, formats and Assembly Analysis
language techniques.
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
This course introduces the following topics to students:
 Define Computer Organization, Hierarchy of Computer, Different functions of computer,
A brief History of Computers
 Stored Program Concept, IAS computer, IC era, Moore’s Law, Later Generations
 Designing for Performance, Multicore CPU
 Interrupts, Types, Cycles, Program flow control, Interrupt handler, cycle, multiple
Interrupts
 System Interconnections, Bus Interconnection Scheme, Multiple buses, Types, bus
elements
 Computer Memory System Overview, Memory Hierarchy, Characteristics of Memory

107
 Scheme of Studies for BS (Computer Science) 2023
 Cache Memory Principles, Cache Hierarchy, Main memory Blocks to Cache Mapping,
Elements of Cache Design
 Cache Addresses, Cache Size, Cache Hit & Miss, Mapping, Types of Cache Mapping,
Direct, Associative, Set-Associative
 Replacement Algorithms, Write Policy, Write through, write back, Line Size, Block Size,
Unified & Split Caches
 Semiconductor Memory, Organization, Characteristics of DRAM & SRAM, ROM Types
 External Devices, Module Function, Module Structure, Input / Output Modules, I/O
Operation types,
 I/O Operation Methods Programmed I/O, Interrupt Driven I/O, Direct Memory Access

Course Weekly Schedule

The course schedule for 16 weeks is detailed below.

Week Topic
1 Difference between Computer Organization and Architecture
2 A brief History of Computers, Computer Generations, CPU registers
Stored Program Concept, IAS computer and its registers, Arithmetic commands in
3
Assembly
IC era, Moore’s Law, Later Generations, Multicore CPU, C++ Conditionals conversion
4
in Assembly
Designing for Performance, performance improvement, MIPS rate, Program Flow
5
Control in Assembly
Interrupts, Types, Cycles, Interrupt handler, cycle, multiple Interrupts, Assembly
6
Application Programs
Bus Interconnection Scheme, Multiple buses, Types, bus elements, Logical Operations
7
in Assembly
8 Pipelining and Parnellism, Assembly Quiz
Computer Memory System Overview, Memory Hierarchy, Characteristics of Memory,
9
Stack Operations Assembly
Cache Memory Principles, Cache Hierarchy, Main memory Blocks to Cache Mapping,
10
Procedure Calls
Elements of Cache Design, Cache Addresses, Cache Size, Cache Hit & Miss, Mapping,
11
Shift Operations
Cache Mapping, Direct, Associative, Set-Associative, Replacement Algorithms, File
12
Handling Assembly

108
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
Write Policy, Write through, Write back, Line Size, Block Size, Unified & Split Caches,
13
I/O in Assembly
External Devices, Module Function, Module Structure, Input / Output Modules,
14
Keyboard/mouse handling
I/O Operation types, Programmed I/O, Interrupt Driven I/O, Direct Memory Access,
15
BIOS access in Assembly
16 Project/Presentation & Revision

Recommended Textbooks

1. Stallings, W. (2015). Computer Organization and Architecture: Designing for Performance,

10th Edition. Pearson Prentice Halli. ISBN: 9789332570405.
2. Brey, B. B. (2009). The Intel Microprocessors : Architecture, Programming, and Interfacing.
Pearson Education India. ISBN: 9788131726228.

109
 Scheme of Studies for BS (Computer Science) 2023
Computer Organization and Assembly Language-Lab
Course Code: CSCA-303L

Semester Credit Hours Prerequisite

[BSCS-5] [3+1] [None]

Course Description
This course is designed to introduce the student with foundation and working of computers. The
basic functional units that reside inside it and their function as part of the unit. The student will
learn about the multi-core processors and the parameters that measure the performance of a system.
A useful technique called Pipelining will be exercised. The concept of cache memory along with
the constraints are discussed. Finally Input/output techniques are introduced to the students.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Understand the internal working of a P3
microprocessor registers, ISA and interrupts P Guided 2
Response
CLO-2 Understanding of Assembly Language P4
Programming Concepts for a microprocessor. P 4
Mechanism
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
This course introduces the following topics to students:
 Define Computer Organization, Hierarchy of Computer, Different functions of computer,
A brief History of Computers
 Stored Program Concept, IAS computer, IC era, Moore’s Law, Later Generations
 Designing for Performance, Multicore CPU
 Interrupts, Types, Cycles, Program flow control, Interrupt handler, cycle, multiple
Interrupts
 System Interconnections, Bus Interconnection Scheme, Multiple buses, Types, bus
elements
 Computer Memory System Overview, Memory Hierarchy, Characteristics of Memory
 Cache Memory Principles, Cache Hierarchy, Main memory Blocks to Cache Mapping,
Elements of Cache Design
 Cache Addresses, Cache Size, Cache Hit & Miss, Mapping, Types of Cache Mapping,
Direct, Associative, Set-Associative
 Replacement Algorithms, Write Policy, Write through, write back, Line Size, Block Size,
Unified & Split Caches

110
 Scheme of Studies for BS (Computer Science) 2023
 Semiconductor Memory, Organization, Characteristics of DRAM & SRAM, ROM Types
 External Devices, Module Function, Module Structure, Input / Output Modules, I/O
Operation types,
 I/O Operation Methods Programmed I/O, Interrupt Driven I/O, Direct Memory Access

Lab Weekly Schedule

The lab schedule for 16 weeks is detailed below. All CLOs shall be accessed in each lab.

Week Topic
Introduction to Assembly Language
1 To learn the basic commands, CPU registers and assembly language program
structure.
Arithmetic Operations
2
To learn the basic arithmetic commands and their use.
Program Flow Control Instructions
3 To learn to change the sequence of execution of a program by using program flow
control instructions.
String Operations
4
To learn to display, input a string, copy, search and reverse a string.
Assembly’ Application Programs
To learn to write the following application codes:
 Password protected application, used to sign-in to a computer.
5  Count the capital characters in a defined string.
 Search and Replace a character in a string.
 Count the ‘Even’ numbers in an entered string.

6 Logical Operations: To learn the basic ‘logic commands’ and their use.

Shift and Rotate Instructions: To learn the basic ‘shift and rotate’ instructions and
7
their use.
Defining and Using Procedures
8
To learn how to make procedures and perform procedure calls.
9 Mid-term exam
Stack Operations
10
To learn about runtime stack in Assembly

111
 Scheme of Studies for BS (Computer Science) 2023

Week Topic
File Handling in Assembly
To learn how to deal with files in following ways:
11 Opening File and reading file
Detecting Next line in File and Counting Characters in File
Writing to File, Appending File and Closing File

BIOS Level Programming

12
To learn about Keyboard and Mouse control at BIOS level
Graphics
13
To Graphics in Assembly.
Interrupt Handling, Macros and Structures
Interrupt Handling
Interrupt Vector Table
14 Exceptions, Traps and Interrupts
Divide by Zero Exception
Overflow Exception
Macros
Input / Output - Parallel Port Operation
Getting introduced to parallel port, introduction to pin configuration of the port
Learning how to address parallel port of computer through assembly and how to
15 write on parallel port and how to read data from any external source
This lab is being designed to make the students enable to interface the
microprocessor to external world and making them enable to control externally
interfaced devices by microprocessor
16 End term Examinations

Recommended Textbooks

1. Stallings, W. (2015). Computer Organization and Architecture: Designing for

Performance, 10th Edition. Pearson Prentice Halli. ISBN: 9789332570405.
2. Brey, B. B. (2009). The Intel Microprocessors : Architecture, Programming, and
Interfacing. Pearson Education India. ISBN: 9788131726228.

112
 Scheme of Studies for BS (Computer Science) 2023
Operating Systems
Course Code: CSOS-347

Semester Credit Hours Prerequisite

[BSCS-5] [3+1] [CSDA-244]

Course Description
This course is about learning and understanding the overview of the Operating Systems. A
computer cannot be used and operated without an operating system. There are many operating
systems available now a days that can be installed and used in order to operate a system. Installing
and using a particular operating system also depends on the factors, like cost, availability, hardware
and usage etc. Furthermore, operating system used on mobile devices are different from the ones
that we use on desktop and laptop systems. In this course, students will learn about i) different
operating systems available in the market, ii) what are the major components available in an
operating system, iii) what is the significance of those components, and iv) how they are designed
and developed.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Understand the characteristics of different C2
structures of OS and identify the core
C Comprehensiv 1
functions and services provided by OS.
e
CLO-2 Explain processes and threads, process C2
management, IPC, Process Synchronization,
C Comprehensiv 1
Scheduling, and deadlocks.
e
CLO-3 Evaluate algorithms used in Memory
Management, disk management and File C3
C 2
Systems. Application

* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
Introduction to Operating Systems, What is an OS, Single User Systems, Batch Systems, Multi
programmed Systems, Time Sharing Systems, Multiprocessor Systems, Real Time Systems
Computer System Structures (Computer System Operation, I/O Structure, Storage Structure,
Storage Hierarchy, Hardware Protection) Operating System Structures (Operating Systems
Concepts, System Calls) Processes & Threads (Process Concept, Process Scheduling, Operation
on Processes, Cooperating Processes, Threads) CPU Scheduling (Introduction to Scheduling,
Scheduling Criteria, Scheduling Algorithms) Process Synchronization (The Critical Section
Problem, Synchronization Hardware, Semaphores, Classical Problems of Synchronization)

113
 Scheme of Studies for BS (Computer Science) 2023
Deadlocks (Deadlock Characterization, Methods for Handling Deadlocks, Deadlock Prevention,
Avoidance and Detection) Memory Management (Logical vs. Physical Address Space, Swapping,
Contiguous Allocation, Paging, Segmentation, Segmentation with Paging) Virtual Memory
(Demand Paging, Page Replacement, Page Replacement Algorithms, Allocation of frames,
Thrashing) File System Interface and Implementation (File Concept, Access Methods, Directory
Structure, Protection, File System Structure, Allocation Methods, Free Space Management,
Directory Implementation)

Course Weekly Schedule

The course schedule for 17 weeks is detailed below

Week Topic
1 Types of software, Application Software and System software, Application software
categories, System software categories.
2 Introduction to OS, Single user, Multi user and Network OS, H/W dependent and
independent OS, Important OS components, Kernel, Shell, Shell types
3 Type of services provided by OS, Uni- programming and Multi-programming, Uni-
tasking and Multi-tasking, Uni- processing and Multi-processing.
4 Distributed systems and its types, Reason for building distributed systems,
5 SPOOLing, Buffering, Real-Time systems, Booting mechanism.
6 Process and process states. Process Control Block, Independent and Cooperating
processes, Process and Threads, Hierarchy of processes.
7 Inter Process Communication, Process Synchronization, Race condition, Mutual
exclusion, Critical section, Achieving process synchronization.
8 Scheduler and scheduling queues, Types of schedulers, CPU and I/O bound processes,
Context switching, Criteria for comparing CPU scheduling algorithms.
9 Mid Term Exams
10 First Come First Served scheduling, Shortest Job First scheduling, Priority scheduling
(Preemptive & Non-Preemptive), Round Robin scheduling.
11 Multi-level queue scheduling, Multi-level feedback queue (MLFBQ) scheduler, Multi-
processor scheduling, and CPU Scheduling Algorithm evaluation.
12 Introduction to Deadlocks, Deadlock characterization, Deadlock prevention, Deadlock
avoidance.
13 Introduction to Banker’s Algorithm and importance of its usage, Deadlock detection in
single resource of each resource type.
14 Deadlock detection in multiple resources of each resource type, Deadlock Recovery,
Techniques used to recover processes from deadlock.

114
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
15 Introduction of memory management, Swapping, Single partition allocation and
Multiple partition allocation memory management schemes. Multiprogramming with
Fixed partition.
16 Multiprogramming with Variable partition, First-Fit, Best-Fit, Next-Fit and Worst-Fit
algorithms. External fragmentation, Compaction, Paging, Segmentation.
17 Virtual Memory, Demand Paging, Page Replacement, Page Replacement algorithms,
Thrashing, Introduction to File System, Directory structure, Single and Two level
directory, Tree structured directory, Acyclic graph directories, General graph
directories, File protection.

Recommended Textbooks
1. Operating system by Albert shilberschatz, Latest Edition, 2021

Reference Books:
1. Modern Operating Systems, Andrew Tanenbaum, Thirteen Edition, Prentice Hall, 2021
2. Operating System by William Stalling, Latest Edition, 2021

115
 Scheme of Studies for BS (Computer Science) 2023
Operating Systems-Lab
Course Code: CSOS-347L

Semester Credit Hours Prerequisite

[BSCS-5] [3+1] [CSDA-244]

Course Description
This course is about learning and understanding the overview of the Operating Systems. A
computer cannot be used and operated without an operating system. There are many operating
systems available now a days that can be installed and used in order to operate a system. Installing
and using a particular operating system also depends on the factors, like cost, availability, hardware
and usage etc. Furthermore, operating system used on mobile devices are different from the ones
that we use on desktop and laptop systems. In this course, students will learn about i) different
operating systems available in the market, ii) what are the major components available in an
operating system, iii) what is the significance of those components, and iv) how they are designed
and developed.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

Demonstrate Shell Scripts/ System Calls C3
CLO-1 using Linux Operating System C 2
Application
Apply operating system concepts/ commands
CLO-2 P4
to perform various functions in Windows and P 4
Linux Mechanism

Express the experimental data in the A3

CLO-3 appropriate format in the form of a LAB A 7
report Valuing

* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
Introduction to Operating Systems, What is an OS, Single User Systems, Batch Systems, Multi
programmed Systems, Time Sharing Systems, Multiprocessor Systems, Real Time Systems
Computer System Structures (Computer System Operation, I/O Structure, Storage Structure,
Storage Hierarchy, Hardware Protection) Operating System Structures (Operating Systems
Concepts, System Calls) Processes & Threads (Process Concept, Process Scheduling, Operation
on Processes, Cooperating Processes, Threads) CPU Scheduling (Introduction to Scheduling,
Scheduling Criteria, Scheduling Algorithms) Process Synchronization (The Critical Section
Problem, Synchronization Hardware, Semaphores, Classical Problems of Synchronization)
Deadlocks (Deadlock Characterization, Methods for Handling Deadlocks, Deadlock Prevention,

116
 Scheme of Studies for BS (Computer Science) 2023
Avoidance and Detection) Memory Management (Logical vs. Physical Address Space, Swapping,
Contiguous Allocation, Paging, Segmentation, Segmentation with Paging) Virtual Memory
(Demand Paging, Page Replacement, Page Replacement Algorithms, Allocation of frames,
Thrashing) File System Interface and Implementation (File Concept, Access Methods, Directory
Structure, Protection, File System Structure, Allocation Methods, Free Space Management,
Directory Implementation)

Lab Weekly Schedule

The lab schedule for 17 weeks is detailed below. All lab CLOs shall be accessed in each lab.

Week Topic
1 Introduction to Linux. Advantages of Linux and different versions of UNIX. Tutorial
on installation of Linux. Getting started with your Linux and general overview of the
OS

2 A brief introduction to a few of the basic commands of Linux.

3 Exploring the Linux file system, including the basic concepts of files and directories
and their organization in a hierarchical tree structure.

4 Overview of The Bourne Again Shell

5 Performing Basic File Management (copy command (cp), move command (mv), rm,
touch). Directory utilities (mkdir, rmdir) and wildcard patterns.

6 An introduction to Processing of Text Streams using Text Processing Filters.

7 Parameters passing in Linux.

8 Use of Unix Streams, Pipes and Redirects.

9 Mid Term Exams

10 Implementation of Environment variables in Linux, Searching Text Files Using

Regular Expressions (grep)

11 Programming Fundamentals, if-else, for, While, do while loop shell scripts.

12 Implementing Switch case structure, functions and Various Programming related

exercises in Linux.

13 File handling in Linux using System calls.

14 Implementation of System calls using GCC Compiler in Linux.

15 fork (), getpid(), getppid(), wait(), opendir(), readdir(), closedir() system calls
implementation using Linux.

117
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
16 Implementation of various CPU scheduling algorithms

17 Implementation of various CPU scheduling algorithms

Recommended Textbooks
1. Operating system by Albert shilberschatz, Latest Edition, 2021

Reference Books:
1. Modern Operating Systems, Andrew Tanenbaum, Thirteen Edition, Prentice Hall, 2021
2. Operating System by William Stalling, Latest Edition, 2021

118
 Scheme of Studies for BS (Computer Science) 2023
Statistics and Probability
Course Code: MTSP-326

Semester Credit Hours Prerequisite

[BSCS-5] [3+0] [None]

Course Description
This course provides an elementary introduction to probability and statistics with applications.
Topics include: sample spaces, conditional probability, Bayes' rule, random
variables, probability distribution of continuous and discrete random variables, inference,
hypothesis testing, confidence intervals, linear and multiple regression.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Explain fundamental concepts related to C2
probability and statistics and graphical C 1
representation Comprehension

CLO-2 Solve problems by using probability C3

formulas and probability distributions C 1
Application
CLO-3 Apply basic statistical techniques such as C3
regression, curve fitting to engineering data C 2
Application
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
Introduction to Statistics and Data Analysis, Statistical Inference, Samples, Populations, and the
Role of Probability. Sampling Procedures. Discrete and Continuous Data. Probability: Sample
Space, Events, Counting Sample Points, Probability of an Event, Additive Rules, Conditional
Probability, Independence, and the Product Rule, Bayes’ Rule. Random Variables and Probability
Distributions. Mathematical Expectation: Mean of a Random Variable, Variance and Covariance
of Random Variables, Means and Variances of Linear Combinations of Random Variables,
Chebyshev’s Theorem. Discrete Probability Distributions. Continuous Probability Distributions.
Fundamental Sampling Distributions and Data Descriptions: Random Sampling, Sampling
Distributions, Sampling Distribution of Means and the Central Limit Theorem. Sampling
Distribution of S2, t-Distribution. Tests of Hypotheses. The Use of P Values for Decision Making
in Testing Hypotheses (Single Sample & One- and Two Sample Tests), Linear Regression and
Correlation. Least Squares and the Fitted Model, Multiple Linear Regression and Certain,
Nonlinear Regression Models, Linear Regression Model Using Matrices, Properties of the Least
Squares Estimators.

119
 Scheme of Studies for BS (Computer Science) 2023
Course Weekly Schedule
The course schedule for 17 weeks is detailed below

Week Topic
1 Introduction to Statistics and Data Analysis: Descriptive and inferential statistics,
population and sample, Observations and variables, Types of variables, Data
collection

2 Measure of central tendency and Measure of dispersion, quartiles for ungroup data,
Graphical representation of data: dot plot, Stem leaf Display, Box and whisker plot

3 Introduction to Probability, concept of sets, Venn diagram, operation and algebra on

sets, Cartesian product

4 Counting Sample Points, Sample Space, Events

5 Definition of probability axioms of probability, conditional probability, independent

events,

6 Additive Rules and the Product Rule, Bayes’ Rule

7 Random variables, Mathematical Expectation: Mean of a Random Variable, Variance

of Random Variables,

8 Means and Variances of Linear Combinations of Random Variables, Chebyshev’s

Theorem

9 Mid Term Exams

10 Discrete Probability Distributions: Binomial distribution, Poisson distribution

11 Continuous Probability Distributions: Normal distribution and standard normal

distribution and its properties

12 Random Sampling, Sampling Distribution of Means and the Central Limit Theorem

13 Linear Regression Model using Matrices, Least Squares and the Fitted Model

14 Multiple Linear Regression, coefficient of correlation

15 Tests of Hypotheses: The Use of P Values for Decision Making in Testing

Hypotheses, alpha level, significance

16 Sampling Distribution of S2

17 Chi-squared distribution, t-Distribution

Recommended Textbooks

1. Walpole, R. E., Myers, R. H., Myers, S. L., & Ye, K. (2017). Probability & Statistics for
Engineers & Scientists: MyStatLab Update. Pearson. ISBN: 9780134508610.

120
 Scheme of Studies for BS (Computer Science) 2023
Recommended Reference (Books/Websites/Articles)

1. Introduction to Statistical Theory by Sher Muhammad Chaudhry, Dr. Shahid Kamal, Ninth Edition
2013,
2. Probability and Statistics for Engineers and Scientists by Anthony J. Hayter.
3. Schaum's Outline of Probability and Statistics, by John Schiller, R. Alu Srinivasan and Murray Spiegel,
McGraw-Hill; 3rd Edition (2008). ISBN-10:0071544259

121
 Scheme of Studies for BS (Computer Science) 2023
CS Supporting - III, Numerical Computing
Course Code: CSNC-327

Semester Credit Hours Prerequisite

[BSCS-5] [3+0] [None]

Course Description
This course will enable students to provide various kinds of numerical methods to solve linear and
non-linear equations and to perform a systematical analysis of the problems and their solutions. In
addition, it will help them to make the right decision to choose the most appropriate numerical
method according to the given conditions of every problem by doing a careful analysis.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 COMPARE the different kinds of numerical C4
methods and their advantages and C 2
limitations. Analysis

CLO-2 APPLY various numerical methods in real C3

world problems. C 2
Application
CLO-3 EVALUATE the solution by selecting the C6
best numerical method under the given C 2
scenario of a problem. Evaluation

* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain.

Course Materials
This course introduces the following topics to the students:
 Introduction, Advantages of Numerical Methods, Rounding off, Approximations and
Errors, Types and Sources of Errors.
 Algorithm, Solutions of Algebraic and Transcendental Equations.
 Numerical Solution of Nonlinear Equations: Bisection Method, The Method of False
Position, Fixed Point Iteration Method.
 Newton-Raphson Method, Secant Method, Order of Convergence of these methods.
 Numerical Solution of System of Algebraic Linear Equations.
 Exact Methods: Gauss Elimination Method, LU Decomposition Method, Dolittle's, Crout's
and Cholesky's Methods. Iterative Methods: Jacobi and Gauss-Seidel Methods.
 Interpolation and Polynomial Approximation: Lagrange's and Newton's difference
formulae.

122
 Scheme of Studies for BS (Computer Science) 2023
 Numerical Differentiation. Numerical Integration and Error Estimates: Trapezoidal
Method, Simpson's one-third and three-eight Rules and Composite Rules.

Course Weekly Schedule

The course schedule for 16 weeks are detailed below:

Week Topic
Introduction, Advantages of Numerical Methods, Approximations and Errors, Types
1
and Sources of Errors.
2 Algorithm, Solutions of Algebraic and Transcendental Equations.
Numerical Solution of Nonlinear Equations: Bisection Method, The method of False
3
Position.
4 Fixed Point Iteration Method, Newton-Raphson Method.
5 Secant Method, Order of Convergence of these methods.
Numerical Solution of System of Algebraic Linear Equations. Exact Methods: Gauss
6
Elimination Method.
7 LU Decomposition Method.
8 Dolittle's, Crout's and Cholesky's Methods.
9 Iterative Methods: Jacobi Method.
10 Gauss-Seidel Method.
11 Interpolation and Polynomial Approximation: Lagrange's formula.
12 Newton's difference formulae.
13 Numerical Differentiation.
14 Numerical Integration and Error Estimates: Trapezoidal Method.
15 Simpson's one-third and three-eight Rules.
16 Composite Rules.

Recommended Textbooks
1. Ahmed, Rana, F., Afzal, M. (2015). Elements of Numerical Analysis. National Book
Foundation, Pakistan, ISBN: 9789693708165.
2. Süli, E., & Mayers, D. F. (2003). An Introduction to Numerical Analysis. Cambridge
University Press. ISBN: 9780521007948.
3. Burden, R. L., & Faires, J. D. (2011). Numerical Analysis. Cengage Learning. ISBN:
9788131516546.

123
Scheme of Studies for BS (Computer Science) 2023

Semester VI

124
 Scheme of Studies for BS (Computer Science) 2023
CS Elec. - III, Visual Programming
Course Code: CSVP-368

Semester Credit Hours Prerequisite

[BSCS-6] [2+1] [CSOO-142,
CSDB-346]

Course Description
The purpose of this course to provide the foundational knowledge of visual programming and skills
for event driven application building. Introduce the students to Graphical User Interfaces and
applications in a Windows as well as in Web environment. To enable them to plan, design,
construct, and integrate applications by using C#, ASP.Net and their frameworks.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Implement the solution for windows C5
C 4
application. Synthesis
CLO-2 Design Asp.NET base web solution for C5
dynamic content delivery and e- C 4
Synthesis
commerce solutions.
CLO-3 Adapt an Asp.NET Core to enable
applications to exchange data easily and C5
C 5
securely using Model View Controller Synthesis
Model.
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective
Domain

Course Materials
This course introduces the following topics to students:
 Introduction to Visual Programming
 C# and Windows Applications
 ADO.Net
 ASP.Net (Form, Master page etc.)
 Three layer architecture
 Stored Procedures
 LINQ
 Entity Frame Work
 Model View Controller
 Windows Communication Foundation

125
 Scheme of Studies for BS (Computer Science) 2023
 ASP.Net Core

Course Weekly Schedule

The course schedule for 16 weeks is detailed below

Week Topic
1 Visual Programming Basics, Introduction to Events; Fundamentals of Event-driven
Programming
Message handling, user interfaces, graphics device interface, Common Controls,
Windows Management
Introduction to Windows Form Application using Visual Studio. Simple Calculator and
Scientific Calculator using Windows Form Application.
2 Database Connectivity of Windows Form application with SQL server. Use of ADO.Net
for Insert, Update and Delete Records.
Entity Data Model, Querying Database using LINQ to SQL, Data binding, Use of Data
Grid View. Retrieving data from multiple tables.
3 Designing Centralized Database operations using DbConn class
Search records using Connection-less approach
Using Data Set, Data Table and Data Adapter using Connection-less Approach
4 Web Applications, Master Page, Web Pages
Introduction to ASP.net Life Cycle, Web Form Application Development
Overview of Front-end pages and applying a template using Master pages
5 Dynamic link libraries, Building Class Libraries, Using References
Three-tier architecture including Properties, Presentation Layer, Business Layer, Data
Access Layer
6 Creating Stored Procedures for CRUD operations and calling in visual application in a
3-tier architecture.
Populating List boxes and Combo boxes with data tables
Using Data Readers with Connection Oriented Approach
7 Assemblies, Private Assembly, Shared Assembly, Configuration Overview
Reporting mechanism using RDLC reports in a 3-tier architecture
Login and Signup using Web Form development in a 3-tier architecture
Mange the User Access Level and design appropriate Master page and webpages.
Session Management on multiple forms

126
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
8 Dynamically display product catalogue in a 3-tier architecture
Add functionality for Shopping Cart along with Add to Cart, View cart and delete item
Validation for Required fields and formats. Validation Summary
9 Entity Framework, Code first approach, Add/Update Model classes
EF Migrations, Retrieve, edit, insert and delete records.
10 Threading and Synchronization,
Delegates, Lambda Expressions, State Management
Debugging application, Tracing Event Logs, Using the Boolean Switch and Trace Switch
Classes
Using Listeners, and Implementing Custom Listeners
11 Model View Controller
Designing classes and properties in Model to generate Database using code first approach
Index, Create, edit, delete and Details Actions
Model binding
12 Collection Framework
Use of LINQ to take data from collections and populate on Grid or List View.

13 Load json data from any Web API and use LINQ to JSON to read and display on grid.
Save the record to database Table
WCF / Web Service creation, deployment, debugging and calling at client side
14 Dot net Core, Entity Framework Core, Asp.NET Core web applications, applications and
request life cycle with MVC and code-first approach
15 ASP.net Core Web APIs and its applicability for cross platform applications
Introduction to Graph Query Language and its applicability
16 Introduction to Micro Service and its application scenarios
Introduction Containerization (Docker)

Recommended Textbooks

1. Deitel, Harvey, and Paul Deitel. Visual C# How to Program. Prentice Hall Press, 6th
Edition, (2016)
2. Pro C# 7 With .NET and .NET Core — Eighth Edition — Andrew Troelsen Philip Japikse,
2017.
3. Joseph Albahari, C# 10 in a Nutshell The Definitive Reference. " O'Reilly
Media, Inc.", 2022.

127
 Scheme of Studies for BS (Computer Science) 2023
CS Elec. - III, Visual Programming-Lab
Course Code: CSVP-368L

Semester Credit Hours Prerequisite

[BSCS-6] [2+1] [CSOO-142,
CSDB-346]

Course Description
The purpose of this course to provide the foundational knowledge of visual programming and skills
for event driven application building. Introduce the students to Graphical User Interfaces and
applications in a Windows as well as in Web environment. To enable them to plan, design,
construct, and integrate applications by using C#, ASP.Net and their frameworks.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Design and implement the window P7
forms based applications for a given P 4
scenario. Organization

CLO-2 Construct a fully functional Asp.NET P7

based solution for a given scenario. P 4
Organization
CLO-3 Design a solution based on MVC based P7
Asp.NET applications for a given P 4
scenario. Organization

* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials

Course Materials
This course introduces the following topics to students:
 Introduction to Visual Programming
 C# and Windows Applications
 ADO.Net
 ASP.Net (Form, Master page etc.)
 Three layer architecture
 Stored Procedures
 LINQ
 Entity Frame Work
 Model View Controller

128
 Scheme of Studies for BS (Computer Science) 2023
 Windows Communication Foundation
 ASP.Net Core

Course Weekly Schedule

The course schedule for 16 weeks is detailed below. All CLOs shall be accessed in each CLO.

Week Topic
1  Create a child class and parent class for calculator and scientific Calc, Create
windows forms with Menus, buttons, etc.
 Create Account class with public and private variables and props, Design
Windows to get values and store in props and pass
2  Database Connectivity of Windows Form application with SQL server. Use of
ADO.Net for Insert, Update and Delete Records.
 Entity Data Model, Querying Database using LINQ to SQL, Data binding, Use
of Data Grid View. Retrieving data from multiple tables.
3  Develop an employee page to perform Insert and Search the records, Design
database in SQL server
 Designing Centralized Database operations using DbConn class
 Search records using Connection-less approach
 Using Data Set, Data Table and Data Adapter using Connection-less Approach
4  Web Applications, Master Page, Web Pages
 Introduction to ASP.net Life Cycle, Develop a MasterPage in ASP.net, Apply
AJAX and provide the data to web pages. Add pages in different Master Pages
5  Dynamic link libraries, Building Class Libraries, Using References
 Three-tier architecture including Properties, Presentation Layer, Business
Layer, Data Access Layer
6  Create a stored procedure and execute it in sql server to proof results of
execution
 Write code behind insert button to call stored procedure
7  Create an rdlc file, add table and select columns, design header and footer of
report.
 Write code behind view report button to display list of all employees and print
it.
8  Using Data Readers using Connection Oriented Approach
Add functionality for Shopping Cart along with Add to Cart, View cart and
delete item

129
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
9  Entity Framework, Code first approach, Add/Update Model classes
Retrieve, edit, insert and delete records.
10  Threading and Synchronization,
 Using Listeners, and Implementing Custom Listeners
11  Create a view class to show the results
 Create controller class to utilise model and view, finally create a web form to
utilize mvc.
12  LINQ to Objects, LINQ to SQL, LINQ to DataSet
 LINQ to XML, JSON to connect with XML and JSON based Data, like in
Mongo DB etc.
13  Load json data from any Web API and use LINQ to JSON to read and display
on grid. Save the record to database Table
 WCF / Web Service creation, deployment, debugging and calling at client side
14  Dot net Core, Entity Framework Core, Asp.NET Core web applications,
applications and request life cycle with MVC and code-first approach
15  ASP.net Core Web APIs and its applicability for cross platform applications
 Introduction to Graph Query Language and its applicability
16  Introduction to Micro Service and its application scenarios
 Introduction Containerization (Docker)

Recommended Textbooks
1. Deitel, Harvey, and Paul Deitel. Visual C# How to Program. Prentice Hall Press, 6th
Edition, (2016)
2. Pro C# 7 With .NET and .NET Core — Eighth Edition — Andrew Troelsen Philip
Japikse, 2017.
3. Joseph Albahari, C# 10 in a Nutshell The Definitive Reference. " O'Reilly Media, Inc.",
2022.

130
 Scheme of Studies for BS (Computer Science) 2023
Computer Networks
Course Code: CSCN-348

Semester Credit Hours Prerequisite

[BSCS-6] [3+1] [None]

Course Description
An introduction to the design and analysis of computer communication networks. Topics include
application layer protocols, Internet protocols, network interfaces, local and wide area networks,
wireless networks, bridging and routing, and current topics.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Describe fundamental concepts of
communication protocols and layered C2
network architectures, especially information C 1
Understanding
related to TCP/IP architecture.

CLO-2 Outline different internetworking devices,

their functions, techniques, and protocols C3
C 2
within a network. Application

CLO-3 Analyze features, services, and operations of

various network, and transport layer protocols C2
C 3
of the communication stack. Understanding

* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
Introduction and protocols architecture, basic concepts of networking, network topologies, layered
architecture, physical layer functionality, data link layer functionality, multiple access techniques,
circuit switching, and packet switching, LAN technologies, MAC address, networking devices,
network layer protocols, IPv4 and IPv6, DHCP, NAT, IP addressing, IP datagram, ICMP, routing
protocols, UDP and (TCP), ports and sockets, connection establishment, flow and congestion
control, application layer protocols, latest trends in computer networks.

Course Weekly Schedule

The course schedule for 17 weeks is detailed below

131
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
1 Intro to Networks components, Basic concepts of networking. Network topologies,
network layers, internet standards, and architecture.
2 The concept of layered architecture modeling. TCP/IP protocol suite, comparison, and
protocols and OSI.
3 The distinction between Data and Signals of Analog and Digital Transmission
Impairments. Network performance measures including throughput, and delays. Data
vs. signaling rates. Channel bandwidth and capacity.
4 Switching Technologies: Circuit Switching, Packet Switching, datagram, and Virtual
Circuit Switching. Phases, efficiency, and delays.
5 Data link layer (DLL), Nodes and links, services, framing, flow, error, congestion
control, data link addressing, ARP, and communication using DLL.
6 Error Detection and Correction, Types of Error, Redundancy, Error Detection, Parity,
checksum, VRC, LRC, cyclic codes, Detection versus Correction, Forward Error
Correction (Hamming codes, Hamming distance) versus Retransmission
7 Data link control services, Flow, and error control (simple protocol & stop N wait
protocol), PAP and CHAP Protocols,
Go back N (GBN) and Selective Reject.
8 Multiple Control Access: Random access protocols (Aloha, CSMA, CSMA/CD, CA),
Wireless hidden and exposed node problems, and Controlled access protocols
(Reservation, Polling, and Token Passing)
9 Mid Term Exams
10 Ethernet, Evolution, Standard Ethernet addressing, access method
Fast Ethernet Access, Mac sub-layer.
11 Wlans: architecture, characteristics, 802.11 sublayers, Exposed and hidden node
problem.
12 Connecting devices: Hub, Switch and Router, Virtual Lans, Spanning tree Algorithm.
IP addressing, classful, classless routing, local and global addresses including APIPA.
13 IP addressing format, fragmentation, ICMP v4: error reporting and query messages.
14 Routing: Least cost, Routing Algorithms: Distance vector and link state, RIP and RIP
messages, algorithm, and timers.
15 UDP Error control and Flow control, congestion.
TCP Features, segments, connections, pushing, handshaking, windows in TCP.

132
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
16 Flow control: opening and closing, silly window syndrome.
Error Control: acknowledgments, retransmissions.
TCP Congestion control, detection, and policies.

Recommended Textbooks
1. Data Communications and Networking, Behrouz A. Forouzan, 5th Edition, McGraw-Hill, 2012.
2. Computer Networking: A Top Down Approach, James F. Kurose, Keith Ross,Pearson,2017

Recommended Reference (Books/Websites/Articles)

1. Data and Computer Communications, William Stallings,10th Edition,Pearson,2014.

133
 Scheme of Studies for BS (Computer Science) 2023
Computer Networks-Lab
Course Code: CSCN-348L

Semester Credit Hours Prerequisite

[BSCS-6] [3+1] [None]

Course Description
An introduction to the design and analysis of computer communication networks. Topics include
application layer protocols, Internet protocols, network interfaces, local and wide area networks,
wireless networks, bridging and routing, and current topics.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Demonstrate knowledge about the practical C2
aspects of Computer Networks C 3
Understanding
CLO-2 Manipulate tools and techniques to perform P3
network simulation P Guided 5
Response
CLO-3 Report the outcome of an experiment/task in A2
a standard format A 7
Responding
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
Introduction and protocols architecture, basic concepts of networking, network topologies, layered
architecture, physical layer functionality, data link layer functionality, multiple access techniques,
circuit switching, and packet switching, LAN technologies, MAC address, networking devices,
network layer protocols, IPv4 and IPv6, DHCP, NAT, IP addressing, IP datagram, ICMP, routing
protocols, UDP and (TCP), ports and sockets, connection establishment, flow and congestion
control, application layer protocols, latest trends in computer networks.

Lab Weekly Schedule

The lab schedule for 17 weeks is detailed below. All CLOs shall be accessed in each lab.

Week Topic
1 Cables, Connectors, and Preparing Ethernet Cables

134
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
2 Understanding Network Commands

3 IP Addressing and Subnetting

4 Configuring basic Switch: Switch configuration, Speed, and Duplex

5 Securing the Switch: Setting up telnet, MOTD banner, etc, Test telnet connection,
Line VTY, Cisco Password Encryption, Cisco port security

6 Virtual LAN (VLANs): Create VLANs, Router On A Stick, Native VLAN, and
Mismatch

7 Servers and CDP: DHCP server, Web Server, CDP Protocol

8 Open Ended Lab

9 Mid Term Exams

10 Switch Redundant connections and Loops (STP)

11 Setting up basic Router Configurations: Setting up router names and passwords,

Adding modules to a Router, Basic router configuration

12 Setting up Static Routes

13 Setting up Default Routes

14 Configuring WAN Connection: Serial connection, PPP encapsulation

15 Implementing and analyzing Router Information Protocol (RIP) ver. 2

16 Setting up an Enterprise level Network and testing connectivity

17 Open Ended Lab

Recommended Textbooks
1. Data Communications and Networking, Behrouz A. Forouzan, 5th Edition, McGraw-Hill, 2012.
2. Computer Networking: A Top Down Approach, James F. Kurose, Keith Ross,Pearson,2017

Recommended Reference (Books/Websites/Articles)

1. Data and Computer Communications, William Stallings,10th Edition,Pearson,2014.

135
 Scheme of Studies for BS (Computer Science) 2023
Artificial Intelligence
Course Code: CSAI-304

Semester Credit Hours Prerequisite

[BSCS-6] [3+1] [CSDS-143]

Course Description
In this course we will talk about the past, present, and the future of AI. This course covers all the
introductory topics to AI to get started on the path of becoming an AI specialist. In this course, the
students will learn about the main philosophy, history, and approaches of AI as well as its
applications. In this course, we will study the most fundamental knowledge for understanding AI.
We will introduce some basic search algorithms for problem-solving; knowledge representation
and reasoning; pattern recognition; fuzzy logic; and neural networks.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

Explain fundamental concepts related to C2
CLO-1 Artificial Intelligence C 2
Comprehension
Demonstrate the working of algorithms
related to various approaches of Artificial C3
CLO-2 C 3
Intelligence. Application

Analyze artificial intelligence techniques for C4

CLO-3 practical problem solving C 5
Analysis
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials

What is artificial intelligence, the foundation, and the history of Artificial Intelligence? Concept
of rationality, rational agents, agents and environment, Problems in AI. Problem-solving by
searching, defining problems, categories of problems, Categories of the search algorithm, tree vs
graph search, informed vs uninformed search, measuring the performance of problem-solving by
search, BFS, DfS, uninformed cost search, informed search best first search heuristics, A* search.
Beyond classical search, optimization problems, local search algorithm, hill climbing, online and
offline search agents, unknown environment Adversarial search, games, optimal decision in
games, minimax algorithm, alpha-beta pruning Constraint satisfaction problems, backtracking
forward filtering, Arc consistency, ordering, logical agents, first-order logic, inference
Introduction to machine learning and pattern recognition decision process, feature selection.
Problems in pattern classification: overfitting model selection missing features, etc. problems in
machine learning, the big four problems, (density estimation regression, clustering, and

136
 Scheme of Studies for BS (Computer Science) 2023
classification), Bayesian decision theory with and without prior knowledge, minimum error rate,
Supervised, unsupervised learning, reinforcement learning, The measure of accuracy, Receiver
operating characteristic (ROC), confusion matrix, Artificial neural networks, Convolution neural
networks, Deep learning.

Course Weekly Schedule

The course schedule for 17 weeks is detailed below

Week Topic
1 What is artificial intelligence, the foundation, and the history of AI.
Different factors/behaviors counted as Intelligent. How can we implement it in a
computer system?
2 Concept of rationality, rational agents, agents and environment, Problems in AI.
3 Problem-solving by searching, defining problems, categories of problems. Classical
Problem-solving Approach.
Generate and Test Approach. Problem. Representation through graph or tree,
Component of Problem Solving The two-one puzzle Problem (example), Graph theory
and Tree Terminology
4 Searching and searching Algorithm. Categories of the search algorithm, tree vs graph
search, informed vs uninformed search.
Data-Driven vs. Goal-driven Search. Breadth-First Search & its Algorithm, Depth
First Search & Algorithm. Comparison b\w Depth-First and Breadth-First Search.
Non-deterministic search
5 Progressive deepening (An approach to improve the efficiency of depth-first search).
Informed vs Uninformed Searching. Heuristics and Hill climbing to highlight the
importance of heuristics. Best-first Search and Algorithm. Greedy search
6 Heuristics and Heuristic Evaluation Function. Heuristics for tic tac toe and 8 puzzle
problem. What is Optimal searching? Why is it significant? Branch and Bound
technique as an optimal approach over the best-first search.
7 A* procedure to improve the quality of heuristics.
Constraint satisfaction problems, backtracking forward filtering,
8 What is Adversarial Search? What is meant by a look-ahead strategy? How look
ahead strategy is implemented using Min Max? Min-Max algorithm and dry run.
How Min-Max algorithm can be optimized? Alpha Beta Pruning as an efficient
approach over the min-max procedure.
9 Mid Term Exams

137
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
10 What is an expert system? Comparison of a human expert and an expert system.
Roles of an expert system. Components of an Expert system. Applications of an
Expert system.
11 What is Machine Learning and its importance? Difference between machine learning
and expert systems. What are the different categories of Machine learning?
Terminologies of machine learning (Datasets, features, and model) Process of
Machine learning (Data collection, feature selection, training, evaluation, fine-tuning,
and application) Types of Machine learning
12 Supervised learning with example, What is classification and some examples of the
classifier? Different techniques to implement Machine learning? Introduction to
Machine Learning
Problems in pattern classification: overfitting model selection missing features, etc.
problems in machine learning, the big four problems, (density estimation regression,
clustering, and classification)
13 Bayesian decision theory with and without prior knowledge, minimum error rate,
How Bayesian classifier classify input data with example (Continuous Data),
KNNclassifier with example
14 Unsupervised learning, reinforcement learning
Un-supervised learning with example, K- Means Clustering algorithm and it's working
mathematically
15 The measure of accuracy, Receiver operating characteristic (ROC), confusion matrix,
Model evaluation parameters, Errors and accuracy (Type I and Type II errors)
16 Biologically Inspired Algorithm: Neural Networks and its working, How they are
inspired from neural system, Applications of Neural networks, Examples
Artificial neural networks, Convolution neural networks,
17 Deep learning and Its Applications
Implementation in Keras ( TensorFlow and Pytorch)

Recommended Textbooks

1. Artificial Intelligence A Modern Approach, Stuart J. Russell and Peter Norvig, 3rd edition,
Pearson Education, Inc., year 2016.
2. Pattern Classification by Richard O. Duda, David G. Stork, Peter E.Hart, 2nd edition, John
Wiley & sons, Inc., year 2012

138
 Scheme of Studies for BS (Computer Science) 2023
Recommended Reference (Books/Websites/Articles)
1. Artificial Neural Networks and Information Theory by colin fyfe, 2nd Edition, year 2000.
2. Deep learning, Ian Goodfellow, Yoshua Bengio, Aaron Courville, the MIT press, year 2018

139
 Scheme of Studies for BS (Computer Science) 2023
Artificial Intelligence-Lab
Course Code: CSAI-304L

Semester Credit Hours Prerequisite

[BSCS-6] [3+1] [CSDS-143]

Course Description
In this course we will talk about the past, present, and the future of AI. This course covers all the
introductory topics to AI to get started on the path of becoming an AI specialist. In this course, the
students will learn about the main philosophy, history, and approaches of AI as well as its
applications. In this course, we will study the most fundamental knowledge for understanding AI.
We will introduce some basic search algorithms for problem-solving; knowledge representation
and reasoning; pattern recognition; fuzzy logic; and neural networks.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Demonstrate knowledge about the practical C2
aspects of Artificial Intelligence C 2
Comprehension
Design the Intelligent algorithms in Python P3
CLO-2
P Guided 5
Response
CLO-3 Report the outcome of an experiment/task in A2
standard format A 7
Responding
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials

What is artificial intelligence, the foundation, and the history of Artificial Intelligence? Concept
of rationality, rational agents, agents and environment, Problems in AI. Problem-solving by
searching, defining problems, categories of problems, Categories of the search algorithm, tree vs
graph search, informed vs uninformed search, measuring the performance of problem-solving by
search, BFS, DfS, uninformed cost search, informed search best first search heuristics, A* search.
Beyond classical search, optimization problems, local search algorithm, hill climbing, online and
offline search agents, unknown environment Adversarial search, games, optimal decision in
games, minimax algorithm, alpha-beta pruning Constraint satisfaction problems, backtracking
forward filtering, Arc consistency, ordering, logical agents, first-order logic, inference
Introduction to machine learning and pattern recognition decision process, feature selection.
Problems in pattern classification: overfitting model selection missing features, etc. problems in
machine learning, the big four problems, (density estimation regression, clustering, and
classification), Bayesian decision theory with and without prior knowledge, minimum error rate,

140
 Scheme of Studies for BS (Computer Science) 2023
Supervised, unsupervised learning, reinforcement learning, The measure of accuracy, Receiver
operating characteristic (ROC), confusion matrix, Artificial neural networks, Convolution neural
networks, Deep learning.

Lab Weekly Schedule

The lab schedule for 17 weeks is detailed below. All lab CLOs shall be accessed in each lab.

Week Topic
1 Introduction to Artificial intelligence and Python and Installation of Python IDE
2 Python programming (Syntax, printing, data types and variables, conditional loops)
3 Python programming (loops, functions, classes)
4 Python programming (lists, tuples, strings, dictionaries)
5 Intelligent Agents
6 Graph Search: Uninformed search and Informed search
7 Introduction to NumPy, Pandas, Scikit-learn and Matplotlib Python Packages
8 Midterm Term Exams
9 Introduction to Machine Learning, Deep learning and deep learning Frameworks (TensorFlow,
Keras) in Python
10 Supervised machine Learning: Classification with K-Nearest Neighbors
11 Supervised machine Learning: Regression with K-Nearest Neighbors
12 Unsupervised machine learning: K-mean clustering
13 Implementation of Neural Networks (NN) in Python
14 Evaluation Metrics to evaluate machine learning algorithms, Fuzzy Logic Systems
15 Final term assessment

Recommended Textbooks

1. Artificial Intelligence A Modern Approach, Stuart J. Russell and Peter Norvig, 3rd edition,
Pearson Education, Inc., year 2016.
2. Pattern Classification by Richard O. Duda, David G. Stork, Peter E.Hart, 2nd edition,
John Wiley & sons, Inc., year 2012

Recommended Reference (Books/Websites/Articles)

1. Artificial Neural Networks and Information Theory by colin fyfe, 2nd Edition, year 2000.
2. Deep learning, Ian Goodfellow, Yoshua Bengio, Aaron Courville, the MIT press, year 2018

141
 Scheme of Studies for BS (Computer Science) 2023
Automata Theory
Course Code: CS-327

Semester Credit Hours Prerequisite

[BSCS-6] [3+0] [None]

Course Description
Unlike most courses in Computer Science, this course is not directly about programming. Rather,
it introduces some of the models, like automata and grammars that are useful in many applications.
The theories of un-decidability and intractability are there to remind us that there are certain things
we would like to solve by computation, but which are either impossible (undecidable) or are
possible but cannot be solved efficiently (intractable).

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

Design of mathematical models for regular C4

CLO-1 C 4
languages Analysis

Design of mathematical models for non- C4

CLO-2 C 4
regular languages. Analysis
C4
CLO-3 Design of Turing Machine. C 4
Analysis
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
This course introduces the following topics to the students
 Finite State Models:
 Language definitions preliminaries
 Descriptive Method
 Regular expressions
 Finite automata (NFA, DFA)
 Transition graphs
 Kleene’s theorem
 Union, Intersection & Complement of FA
 DFA Minimization
 Transducers (automata with output),
 Pumping lemma
 Non Regular Language Grammars

142
 Scheme of Studies for BS (Computer Science) 2023
 Context free grammars
 Derivations, derivation trees and ambiguity
 Simplifying CFLs ,
 Normal form grammars and parsing
 Decidability
 Push Down Automata
 Context sensitive languages, grammars and linear bounded automata (LBA)
 Chomsky’s hierarchy of grammars
 Turing Machine
 Turing Machines Theory
 Post machine
 Variations on TM
 TM encoding
 Universal Turing Machine
 Defining Computers by TMs

Course Weekly Schedule

The course schedule for 16 weeks are detailed below

Week Topic
1 Language definitions preliminaries
Descriptive Method
2 Regular expressions
3 Finite Automata: NFA, DFA
4 Transition graphs, TG to RE
5 Kleene’s theorem
Union, Intersection & Complement of FA
DFA Minimization
6 Transducers (Mealy Machine, Moore Machine) and Conversions
7 Regular languages vs Non regular languages
Properties of regular languages and Pumping Lemma
8 Context free grammars
Derivations, derivation trees and ambiguity
9 Simplifying CFL
Normal form grammars and parsing
Decidability

143
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
10 Push Down Automata
11 Context sensitive languages, Grammar and Linear bounded automata (LBA)
12 Chomsky’s hierarchy of grammars
13 Turing Machine Theory and Post machine
14 Variations on TM and TM encoding
15 Universal Turing Machine
Defining Computers by TMs
16 Revision

Recommended Textbooks

1. Cohen, D. I. A. (2003). Introduction to Computer Theory. John Wiley.

2. Rich, E. (2008). Automata, Computability and Complexity: Theory and Applications. Prentice
Hall. ISBN: 9780132288064.
3. Xavier, S. P. E. (2005). Theory Of Automata, Formal Languages And Computation (As Per
Uptu Syllabus). New Age International. ISBN: 9788122416558.
4. Martin, J. C. (2003). Introduction to Languages and the Theory of Computation. McGraw-
Hill. ISBN: 9780072322002.

144
 Scheme of Studies for BS (Computer Science) 2023
Technical Business Writing
Course Code: ESTW-317

Semester Credit Hours Prerequisite

[BSCS-6] [3+0] [None]

Course Description
The purpose of this course is that students will learn about the mechanics of Writing Skills which
will help them to write effectively and accurately. Course topics address both the technical aspects
of writing skills and issues pertaining to formal documentation.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 State purposes and qualities of reports C1
C 7
Knowledge
CLO-2 Apply different techniques and principles to C3
prepare a report C 7
Application
CLO-3 Explain different types of plagiarism C2
C 7
Comprehension
CLO-4 Participate in presentations and volunteer A2
to share your knowledge in the class A 6
Responding
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
Technical writing-an essential job skills, types and purposes of reports, the research process, primary and
secondary research, writing process at work-outlining, paraphrasing, sequencing. Proposals-types and
Characteristics Proposals for research reports. Effective mechanics: spellings, abbreviations, caps
Summarizing skills-writing summary an abstract, process of revising-editing , plagiarism, paraphrasing
skills, short reports-IMRD reports, Recommendation reports, progress reports, long repots, business emails,
quoting/referencing skills.

Weekly Schedule
The course schedule for 16 weeks is detailed below

Week Topic
1 Technical writing-an essential job skills, types and purposes of reports

145
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
2 The research process, primary and secondary research
3 writing process at work-outlining, paraphrasing, sequencing
4 Proposals-types and Characteristics
5 Proposals for research reports
6 Writing proposals for solutions/bids for technical projects
7 Summarizing skills-writing summary an abstract
8 Process of revising-editing, sentence errors
9 Mid Term Exams
10 Effective mechanics: spellings, abbreviations, caps
11 Short reports-types and format
12 IMRD reports and progress reports
13 Plagiarism-definition, types and techniques to avoid it.
14 Long reports contents, parts and format
15 Business emails, quoting/referencing skills,
16 Final presentations

Recommended Textbooks
1. Riordan, D. (2013). Technical Report Writing Today. Cengage Learning. ISBN:
9781133607380.

Recommended Reference (Books/Websites/Articles)

1. Hardesty, R. E. (2010). Technical and Business Writing for Working Professionals. Xlibris
Corporation. ISBN: 9781456819408.

146
Scheme of Studies for BS (Computer Science) 2023

Semester VII

147
 Scheme of Studies for BS (Computer Science) 2023
CS Elec. - IV, Computer Graphics
Course Code: CSCG-469

Semester Credit Hours Prerequisite

[BSCS-7] [2+1] [None]

Course Description
In this course, students will learn about some of the advanced and emerging topics in 3D graphics
along with the classic graphics algorithms and the standard phases in the graphics pipeline. This
course overs ore 3d graphics concepts like transformation, projections and rendering. Course
topics include both the mathematical as well as technical aspects of developing graphics.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

Understand and be familiar with current C1
CLO-1 concepts in 3d graphics, along with the C 2
basic workflow of the graphics pipeline. Knowledge

Learn and implement basic graphics C3

CLO-2 related Algorithms and techniques to C 3
create and manipulate 3d graphics. Application

Be able to create a simple 3D game in Unit C3

CLO-3 3d and be familiar with the basics of game C 4
development. Application

* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
This course introduces basic and standard aspects of Computer Graphics that are currently being
practiced:
 CRT (Cathode Ray Tube) devices: DVST.
 Color Models: Pseudo Colors, True Colors, High colors and Deep colors
 Color Modes: Additive and Subtractive
 Transformations: 2D, 3D, HCS and Composite Transformations
 Projection: Affine and Solid Body
 World window to Viewport Transformations
 Line Drawing Algorithms: DDA (Digital differential algorithm)
 Bresenham’s Line Drawing Algorithm
 Clipping Algorithms: Cohen Sutherland Clipping Algorithm
 Sutherland Hodgeman Clipping Algorithm

148
 Scheme of Studies for BS (Computer Science) 2023
 Filling Algorithms: Scanline Filling Algorithm.
 8-point filling Algorithm & 4-Point Filling Algorithm
 Rendering: Forward and Backward Rendering and rendering in Nature
 Lighting and Shading
 Texture Mapping: Minification and Magnification
 Ellipse and other Curves
 Visible Surface Detection: Painter’s Algorithm
 Ray Tracing Algorithm
 Z-Buffer Algorithm & Revision

Course Weekly Schedule

The course schedule for 16 weeks are detailed below

Week Topic
1 CRT (Cathode Ray Tube) devices: DVST.
2 Color Models: Pseudo Colors, True Colors, High colors and Deep colors.
3 Color Modes: Additive and Subtractive.
4 Transformations: 2D, 3D, HCS and Composite Transformations.
5 Projection: Affine and Solid Body.
6 World window to Viewport Transformations.
7 Line Drawing Algorithms: DDA (Digital differential algorithm)
8 Bresenham’s Line Drawing Algorithm
9 Clipping Algorithms: Cohen Sutherland Clipping Algorithm
10 Sutherland Hodgeman Clipping Algorithm
11 Filling Algorithms: Scanline Filling Algorithm
12 8-point filling Algorithm & 4-Point
Filling Algorithm
13 Rendering: Forward and Backward Rendering and rendering in Nature, Vectors and
3d Geometry.
14 Lighting and Shading
15 Texture Mapping: Minification and Magnification
16 Ellipse and other Curves

149
 Scheme of Studies for BS (Computer Science) 2023
Recommended Textbooks

1. Hearn, D., Baker, M. P., & Carithers, W. (2014). Computer Graphics with OpenGL. Dorling
Kindersley, India. ISBN: 9789332518711.
2. Gortler, S. J. (2012). Foundations of 3D Computer Graphics. MIT Press. ISBN:
9780262017350.
3. Hughes, J. F., Van Dam, A., McGuire, M., Foley, J. D., Sklar, D., Feiner, S. K., & Akeley, K.
(2014). Computer Graphics: Principles and Practice. Addison-Wesley. ISBN:
9780321399526.
4. Akenine-Möller, T., Haines, E., & Hoffman, N. (2008). Real-Time Rendering. CRC Press.
ISBN: 9781439865293.

150
 Scheme of Studies for BS (Computer Science) 2023
CS Elec. - IV, Computer Graphics-Lab
Course Code: CSCG-469L

Semester Credit Hours Prerequisite

[BSCS-7] [2+1] [None]

Course Description
In this course, students will learn about some of the advanced and emerging topics in 3D graphics
along with the classic graphics algorithms and the standard phases in the graphics pipeline. This
course overs ore 3d graphics concepts like transformation, projections and rendering. Course
topics include both the mathematical as well as technical aspects of developing graphics.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

Create a 3D model in any modelling tool, P3
CLO-1
light and shade it, add texture to it etc. and P Guided 5
create a photorealistic scene. Response
Be able to create programs in OpenGL P3
CLO-2
using any library. P Guided 5
Response
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
This course introduces basic and standard aspects of Computer Graphics that are currently being
practiced:
 CRT (Cathode Ray Tube) devices: DVST.
 Color Models: Pseudo Colors, True Colors, High colors and Deep colors
 Color Modes: Additive and Subtractive
 Transformations: 2D, 3D, HCS and Composite Transformations
 Projection: Affine and Solid Body
 World window to Viewport Transformations
 Line Drawing Algorithms: DDA (Digital differential algorithm)
 Bresenham’s Line Drawing Algorithm
 Clipping Algorithms: Cohen Sutherland Clipping Algorithm
 Sutherland Hodgeman Clipping Algorithm
 Filling Algorithms: Scanline Filling Algorithm.
 8-point filling Algorithm & 4-Point Filling Algorithm
 Rendering: Forward and Backward Rendering and rendering in Nature

151
 Scheme of Studies for BS (Computer Science) 2023
 Lighting and Shading
 Texture Mapping: Minification and Magnification
 Ellipse and other Curves
 Visible Surface Detection: Painter’s Algorithm
 Ray Tracing Algorithm
 Z-Buffer Algorithm & Revision

Lab Weekly Schedule

The lab schedule for 13 weeks is detailed below. All CLOs shall be accessed in each lab.

Week Topic
1 Introduction to OpenGL, Basic Structure of an OpenGL Program
Program to draw a Single dot on the screen.
2 Parameters for the glBegin() function and their purpose.
Wireframe based graphical modeling.
Creating filled shapes and automatically creating the triangles and quadrilateral with
GL_TRIANGLES and GL_QUADS.
3 Create a 2 dimensional circle with OpenGL.
Use of loops within the glBegin() and glEnd() functions.
Create a function that puts dots on the circumference of a 2D circle in Orthographic
view.
4 Write a program to capture the mouse click. Create a program that puts a red dot on
the
Output Window whenever the left mouse button is clicked.
Learn how th glut callback functions work. What is the glutMouseFunc(). What is the
parameter passed to the glutMotionFunc()
What parameters are automatically passed to the function called through the
glutMouseFunct().
5 Write a program to capture the movement of the mouse using openGL. Create a
program that draws a freehand line wherever the mouse moves if the left mouse
button is clicked
Learn what the mouseMotionFunct() is and what are the parameters passed to the
function called through glutMotionFunct()
6 Create a program to define a viewport within the output screen
Understand what World Window and Viewport Transformation is. Create a custom
output window number system and define viewports in it
7 Write a program to implement the DDA(Digital Differential Analyzer) line drawing
Algorithm.
Learn how C++ and OpenGL are used to draw a line between the given starting and
ending points. Calculate the intermediate points with DDA

152
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
8 Create a 3d cube to that rotates with arrow keys. The arrow keys rotate the cube when
they are pressed
Using the callback function to capture the arrow keypresses.
Use transformation in OpenGL
3d perspective projection.
9 Program to animate objects in OpenGL
The use of glutPostRedisplay() in animations
10 Program to implement the coghen Sutherland line clipping Algorithm
The working of Cohen Sutherland Line clipping.
11 Program Create a Rigidbody in Unity3d.
Understand the workflow in Unity3d and the layout of Unity3d.
Create materials and adding Materials.
Adding Scripts to move objects.
12 Demonstration of [SerializeField] in Unity 3d
Controlling the Player through the keyboard
Making the Camera follow the player. - Restarting the level through Keyboard keys.
13 Automatically reloading the scene. Adding tags to Objects, detection of collision and
Exporting the game

Recommended Textbooks

1. Hearn, D., Baker, M. P., & Carithers, W. (2014). Computer Graphics with OpenGL.
Dorling Kindersley, India. ISBN: 9789332518711.
2. Gortler, S. J. (2012). Foundations of 3D Computer Graphics. MIT Press. ISBN:
9780262017350.
3. Hughes, J. F., Van Dam, A., McGuire, M., Foley, J. D., Sklar, D., Feiner, S. K., & Akeley,
K. (2014). Computer Graphics: Principles and Practice. Addison-Wesley. ISBN:
9780321399526.
4. Akenine-Möller, T., Haines, E., & Hoffman, N. (2008). Real-Time Rendering. CRC Press.
ISBN: 9781439865293.

153
 Scheme of Studies for BS (Computer Science) 2023
CS Elec. - V, Software Project Management
Course Code: SESM-470

Semester Credit Hours Prerequisite

[BSCS-7] [3+0] [None]

Course Description
In this course, students will learn about some of the most basic topics on software Project
Management. This course would cover the basic management practices for software houses. This
course will cover all the process areas and management knowledge areas of Project Management.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

Explain fundamental concepts of project C2
CLO-1 management, PMI process groups C 1
Comprehension
Analyze various software project
management process areas and knowledge C4
CLO-2 C 3
areas Analysis
Apply various software project management
processes and knowledge area on small scale C4
CLO-3 C 4
project Analysis

* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
Introduction to Project Management. The Project Management Process Groups. Project Integration
Management. Project Scope Management. Project Time Management. Project Cost Management.
Project Quality Management. Project Human Resource Management. Project Communications
Management. Project Risk Management. Project Procurement Management. Controlling and
tracking

Course Weekly Schedule

The lab schedule for 16 weeks is detailed below.

Week Topic
1 Course introduction, software crises, project failure, what is a project, what is project
management, Program and Project Portfolio Management, Role of project manager,
project management ethics and certifications, project management profession

154
 Scheme of Studies for BS (Computer Science) 2023

Week Topic
2 Software project acquision from external client (RFP, proposal, negotiation, contract
acceptance) Software project acquis ion from internal client (feasibility study,
preparing and finalizing proposal)

3 PMI Framework, Project management process groups, Mapping the Process Groups
to the Knowledge Areas , Case study (JWD consultancy intranet site project) of
project management process groups

4 Software project initiation, project management office level activities, software

project manager level activities. Common pitfalls in project initiation

5 What is Project Integration Management, Strategic Planning and Project Selection,

Methods for Selecting Projects, Developing a Project Charter, Developing a Project
Management Plan, Monitoring and Controlling Project Work

6 Project Scope Management, Planning Scope Management, collecting requirements,

Defining Scope Creating the Work Breakdown Structure, Validating Scope
Controlling Scope

7 The Importance of Project Schedule, Planning Schedule Management, Defining

Activities, Sequencing Activities, Estimating Activity Resources and Activity
Durations (PERT,CPM), Developing the Schedule, Controlling the Schedule,

8 Project Cost Management, Basic Principles of Cost Management, Planning Cost

Management, Estimating Costs, controlling costs

9 Mid Term Exams

10 Project Quality Management, The Importance of Project Quality

Management ,Planning Quality Management Performing Quality Assurance,
Controlling Quality , Tools and Techniques for Quality Control

11 What is Project Human Resource Management, Keys to Managing and Leading

People, Developing the Human Resource Plan, Acquiring the Project Team,
developing the Project Team, managing the Project Team

12 The Importance of Project Communications Management, Keys to Good

Communications, Planning Communications Management ,Managing
Communications, Controlling Communications

13 The Importance of Project Risk Management Planning Risk Management, Identifying

Risks, Performing Qualitative Risk Analysis, Performing Quantitative Risk Analysis,
controlling risks

155
 Scheme of Studies for BS (Computer Science) 2023

Week Topic
14 Planning Procurement Management, Conducting Procurements, Controlling
Procurements

15 Project tracking and control, earned value analysis

16 Project closure (best practices, lessons learnt, project post martum, releasing the team,
releasing the contracts)

Recommended Textbooks
1. Information technology project management, Kathy Schwalbe 9th Edition, Cengage, 2019

Recommended Reference (Books/Websites/Articles)

1. Mastering software project management: Best practices, tools and techniques Chemuturi, M. &
Cagley, T. M. (2010)

156
 Scheme of Studies for BS (Computer Science) 2023
Compiler Construction
Course Code: CSCC-406

Semester Credit Hours Prerequisite

[BSCS-7] [3+0] [CSTA-305]

Course Description
Understand the role of front-end and back-end of a compiler. Recognize different types of
grammars. Understand and define grammars in BNF, syntax diagrams, regular expressions. Define
tokens using the notation of regular expressions. Convert regular expressions into finite automata.
Implement a lexical analyzer. Define a programming language syntax using a CFG. Construct a
parse tree for a given program. Differentiate between top-down and bottom-up parsing strategies.
Understand LL (k) and LR (k) grammars. Write a top-down parser using recursive-descent and LL
(1) parsing methods. Understand simple-precedence, operator precedence and SLR parsing
methods. Understand semantic analysis (type checking, scope checking etc.) Understand various
types of runtime environments. Understand code generation techniques. Understand code
optimization techniques.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Elaborate the process of Language C C4 2
understanding, architecture of a compiler, and Analysis
function of its components.
CLO-2 Demonstrate appropriate formal notations to C C3 2
define a programming language. Application
CLO-3 Design and implement lexical, syntax C C3 4
semantics analyzers by using various Application
algorithms.
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
This course introduces the following topics to students:
 High level languages and translators
 Phases of the compilation process
 Syntax and semantic specification of a language
 Chomsky’s hierarchy of grammars
 Design and implementation of a lexical analyzer
 Top-down and bottom-up parsing strategies

157
 Scheme of Studies for BS (Computer Science) 2023
 Ambiguous Grammars
 LL(k) and LR(k) grammars
 Recursive-descent and LL(1) parsing
 Left factoring and left recursion removal
 Simple precedence, SLR and LALR parsing
 Semantic Analysis, Attributed grammars
 Code generation from annotated parse tree and Code optimization

Course Weekly Schedule

The course schedule for 16 weeks are detailed below

Week Topic
1 Translation process, Language Characteristics, High Level Language properties, Rules
and its importance, Machine understandable code Properties, Passes options of
compiler, Phases of compiler, Lexical Analysis
2 Lexical Analysis: type of words, Rule for Lexical analysis, Regular Expression for
Lexical. RENFADFA
3 Lexical Rule Automation process. NFADFAoptimization implementation,
algorithms and code.
4 Lexical Rule Implementation issues, options and Algorithms.
5 Syntax Analysis: Context Free Grammar why and how. Ambiguity specific and
generalized removal.
6 Top down vs bottom up. Top down Approach and Left factoring Recursive decent
algorithm vs Predictive Parsing
7 Left Factoring and LL(k), Recursive decent
8 Mid Term Examination
9 Parsing Implementation, Top Down : LL(k), Recursive decent using parsing table
Implementations
10 Bottom UP implementations, LR(k) , Stack Processing implementation algorithms
11 Type checking and semantic analysis …Rules working updation of parse table to
semantic table and parse tree to semantic tree.
12 Intermediate code Generation from parse table
13 Code optimization
14 Target code and semantic Rules
15 Revision

158
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
16 End Term Examination

Recommended Textbooks

1. Aho, A. V., Lam, M. S., Sethi, R., & Ullman, J. D. (2007). Compilers: Principles, Techniques,
& Tools. Pearson/Addison Wesley. ISBN: 9780321486813.
2. Louden, K. C. (1997). Compiler Construction: Principles and Practice. PWS Publishing
Company. ISBN: 9780534939724.
3. Grune, D., van Reeuwijk, K., Bal, H. E., Jacobs, C. J. H., & Langendoen, K. (2012). Modern
Compiler Design. Springer New York. ISBN: 9781461446989.

159
 Scheme of Studies for BS (Computer Science) 2023
Information Security
Course Code: CSIS-449

Semester Credit Hours Prerequisite

[BSCS-7] [3+0] [None]

Course Description
This course introduces students with basics of information security, in both management aspect
and technical aspect. Students understand various types of security incidents and attacks, and learn
methods to prevent, detect and react incidents and attacks. It also covers basics of cryptography
which are one of the key technology to implement security functions

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Explain security services like confidentiality,
Integrity and Availability as well as the C2
C 2
related tools and technologies, security Comprehension
protocols and Standards.
CLO-2 Use the appropriate techniques to tackle the C3
problems in the discipline of information C 3
security. Application

CLO-3 Develop various security and risk C5

management techniques for achieving C 5
information security and privacy. Synthesis

* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
This course introduces the following topics to students:
 Information security foundations, security design principles
 Security mechanisms
 Symmetric and asymmetric cryptography, encryption, hash functions, digital signatures,
key management, authentication and access control
 Software security, vulnerabilities and protections
 Malware
 Database security
 Network security, firewalls, intrusion detection
 Security policies, policy formation and enforcement, risk assessment, cybercrime, law and
ethics in information security, privacy and anonymity of data.

160
 Scheme of Studies for BS (Computer Science) 2023

Course Weekly Schedule

The course schedule for 16 weeks are detailed below

Week Topic
1 Introduction to Information Security, Security attacks, Security Services, Security
Mechanisms
2 Cryptography
Exhaustive Key search, Principles of Counting
3 Classical Encryption Techniques:
Modular arithmetic, Ceaser Cipher, Mono alphabetic Ciphers,
Frequency analysis attacks,
4 Classical Encryption Techniques:
Substitution Techniques: Poly alphabetic ciphers, one-time Pad
5 Transposition Ciphers, Product ciphers: Rotor Machines
6 Secret Key Cryptography:
History and implementation of AES
7 Secret Key Cryptography:
Traffic confidentiality and placement of encryption function tools
8 Principles of public-key cryptography
RSA algorithm
9 Digital signatures and certificates
Digital signatures
10 Placement of Encryption Function
End to end, Link to Link
Key Distribution and Management
Key distribution using Secret key cryptography, For link encryption, For E2E
encryption, Key Management, Diffie-Hellman Key Exchange
11 Authentication Mechanisms
Passwords, Hashing and Salting techniques, Biometrics, Security Tokens, Two Factor
Authentication,
Authentication Protocols:
Kerberos, X.509 Certificates

161
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
12 Access Control
Types of Access Controls, Discretionary , Mandatory Access Control, Bell La Padula,
Access Biba
13 Attacks and Malicious Software
Sniffing, Spoofing, Replay attacks, TCP/IP Hijacking, Attacks on Encryption, Password
Guessing, Software Exploitation
Social Engineering, Distributed Denial of Service Attacks
Malware, Anti-Virus Software
14 Firewalls
Types of Firewalls, Attacks and Countermeasures, Application Level Gateways,
Bastion Host, Configuration DMZ Network, Intrusion Detection & Response
15 Software Vulnerabilities
buffer overflow, stack buffer overflow working, shell code, defenses
Database Security
Threats, computer-based-controls, security in Oracle/MS Access
DBMSs And Web Security, SQL Injection Attack
Risk Management
What is Risk Management?, Business Risks, Risk Management Models Qualitative Vs.
Quantitative Risk Management, Tools
16 Privacy and Anonymity of Data

Recommended Textbooks

1. Stallings, W. (2022). Cryptography and network security: principles and practice. Pearson.
ISBN: 9789332585225.
2. Maymi, F., & Harris, S. (2016). CISSP All-in-One Exam Guide, 7th Edition. McGraw-Hill
Education. ISBN: 9780071849272.

162
 Scheme of Studies for BS (Computer Science) 2023
Univ. Elec. - IV, Foreign Language (Chinese)
Course Code: FLCH-471

Semester Credit Hours Prerequisite

[BSCS-7] [2+0] [None]

Course Description
Chinese language course aims at acquisition of the usual basic language skills of reading, writing
and speaking Chinese language at beginner level. Not only it will nourish student’s ability to
understand basic grammar but will also let students learn Chinese characters in order to be able to
communicate effectively I real Chinese situations.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Understand familiar, everyday expressions C2
and very simple sentences, which relate to C 2
the satisfying of concrete needs Comprehension

CLO-2 Analyze words of everyday use to introduce C3

him/herself and others as well as ask others C 3
about themselves. Application

CLO-3 Apply different sentences to communicate C4

about where they live, who they know and C 3
what they own, and what they need etc. Analysis

* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

163Course Weekly Schedule

The course schedule for 16 weeks are detailed below

Week Topic
1 Oral Drilling & Speaking (Greetings,, Counting 1-10, Intro questions, Questions)
2 Oral Drilling & Speaking (Times of day, Counting 21-100, Days of Week, Months,
Seasons of a Year,)
3 Odinals numbers 0-20, Years i.e 1990, Questions, Alphabets, Combination of alphabets
and their sounds
4 Combination of alphabets and their sounds

5 Grammar: Writing & Revision, Personal Pronouns & exercises, Verbs and conjugation

163
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
6 Grammar: Verbs and conjugation, Articles (Definite & indefinite, Possessive) &
Exercises, Family
7 Possessive article and exercise

8 Speaking & Writing (How to make simple questions, Time and preposition of time) &
exercises
9 Mid Term Exams

10 Revision, Speaking & Writing (Modal Verbs), Exercises, Negation

11 Grammar (Intro to Akkusativ, Exercises)
12 Formal Email & Form Filling
13 Revision
14 Presentations
15 Presentations
16 Exams

Recommended Textbooks
1. Menschen A1.1 Deutsch Als Fremdsprache

Recommended Reference (Books/Websites/Articles)

1. Studio d, A1

164
Scheme of Studies for BS (Computer Science) 2023

Semester VIII

165
 Scheme of Studies for BS (Computer Science) 2023
CS Elec. - VI, Mobile Application Development
Course Code: CSMA-472

Semester Credit Hours Prerequisite

[BSCS-8] [2+1] [None]

Course Description
Objective of mobile development is creating applications and any other kind of software specific
to mobile devices, including tablets. Mobile development seeks to optimize functionality and user
experience on mobile devices, as there are important differences between mobile and desktop UX.
This course aims to introduce students to the following concepts and cognitive skills.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Understand the life cycle of android C2
applications C 2
Comprehension
CLO-2 Design interactive interface for mobile C6
applications using various layouts C 4
Evaluation
CLO-3 Develop mobile applications for
comprehensive systems using latest trends C6
C 4
and practices Evaluation

* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective

Domain

Course Materials
Mobiles Application Development Platform, Android OS: Architecture, Framework and
Application Development; iOS: Architecture, Framework; Application Development with
Windows Mobile; Eclipse; Fragments; Calling Built-in Applications using Intents; Displaying
Notifications; Components of a Screen; Adapting to Display Orientation; Managing Changes to
Screen Orientation; Utilizing the Action Bar; Creating the User Interface; Listening for UI
Notifications; Views; User Preferences; Persisting Data; Sharing Data; Sending SMS Messages;
Getting Feedback; Sending E-mail; Displaying Maps; Consuming Web Services Using HTTP;
Web Services: Accessing and Creating; Threading; Publishing, Android Applications;
Deployment on App Stores; Mobile Programming Languages; Challenges with Mobility and
Wireless Communication; Location-aware Applications; Performance/Power Tradeoffs; Mobile
Platform Constraints; Emerging Technologies.

Course Weekly Schedule

The course schedule for 17 weeks is detailed below.

166
 Scheme of Studies for BS (Computer Science) 2023

Week Topic
1 Mobile Application Development Platforms, System installation (Android Studio)
2 Android Architecture and framework
What is Android
The various Android devices on the market
The Android Market application store
How to develop your first Android application
3 Components of Android Project (Application Structure)
Using code Completion
Debugging Application
What activities are?
4 Android Studio Layout editor, component tree, Constraint view, layout properties
5 Activities, Layouts, layout attributes, Views. View Groups, layout Orientation, XML
files(string, colors, values, dimen) in the project, Resource folders
6 Intents in Android
7 Calling build in intents, communication between activities
8 Fragments, Display Notifications
9 Mid Term Exams
10 Design interface with views
11 Displaying Pictures and menus with views
12 Data Persistence, Content providers
13 Messages (SMS, EMAIL), Location based services(Maps)
14 Networking, Establishing an HTTP Connection, Consuming Web Services using HTTP,
Consuming JSON Services
15 Android Services, Create Own Services, Establishing Communication between a
Service and an Activity
Binding Activities to Services, Understanding Threading
16 Introduction to iOS Architecture and framework, Introduction to Xamarin/Flutter for
cross platform development
17 Publishing, Android Applications, Mobile Programming Languages, Emerging
Technologies.

167
 Scheme of Studies for BS (Computer Science) 2023

Recommended Textbooks

1. Professional Android Application Development, Reto Meier, Wrox Programmer to Programmer,

3rd Edition (2014)
2. iOS Programming: The Big Nerd Ranch Guide, Conway, J., Hillegass, A., & Keur, C., 5th Edition
(2015)

Recommended Reference (Books/Websites/Articles)

1. Android Programming: The Big Nerd Ranch Guides, Phillips, B. & Hardy, B., 3rd Edition (2017)

168
 Scheme of Studies for BS (Computer Science) 2023
CS Elec. - VI, Mobile Application Development-Lab
Course Code: CSMA-472L

Semester Credit Hours Prerequisite

[BSCS-8] [2+1] [None]
Course Description
Objective of mobile development is creating applications and any other kind of software specific
to mobile devices, including tablets. Mobile development seeks to optimize functionality and user
experience on mobile devices, as there are important differences between mobile and desktop UX.
This course aims to introduce students to the following concepts and cognitive skills.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Develop programs using fundamental C6
concepts of mobile application development C 4
Evaluation
CLO-2 Manipulate the use of Android Studio for P3
making mobile applications P Guided 5
Response
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
Mobiles Application Development Platform, Android OS: Architecture, Framework and
Application Development; iOS: Architecture, Framework; Application Development with
Windows Mobile; Eclipse; Fragments; Calling Built-in Applications using Intents; Displaying
Notifications; Components of a Screen; Adapting to Display Orientation; Managing Changes to
Screen Orientation; Utilizing the Action Bar; Creating the User Interface; Listening for UI
Notifications; Views; User Preferences; Persisting Data; Sharing Data; Sending SMS Messages;
Getting Feedback; Sending E-mail; Displaying Maps; Consuming Web Services Using HTTP;
Web Services: Accessing and Creating; Threading; Publishing, Android Applications;
Deployment on App Stores; Mobile Programming Languages; Challenges with Mobility and
Wireless Communication; Location-aware Applications; Performance/Power Tradeoffs; Mobile
Platform Constraints; Emerging Technologies.

Lab Weekly Schedule

The lab schedule for 17 weeks is detailed below. All CLOs shall be accessed in each lab,

Week Topic
1 Introduction to Android Studio, Different features/components, and their use

169
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
2 Basic concept of layouts, Designing UI through XML
3 Code Classes, Events and Event Handling, Accessing UI components in code
4 Component tree, Constraint view, layout properties

5 Views, View Groups, layout Orientation, XML files (string, colors, values, dimen) in
the project, Resource folders
6 Intents in Android
7 Calling build in intents, communication between activities
8 Fragments, Display Notifications
9 Mid Term Exams
10 Design interface with views
11 Displaying Pictures and menus with views

12 Data Persistence, Content providers

13 Messages (SMS, EMAIL), Location based services (Maps)
14 Networking, Establishing an HTTP Connection, Consuming Web Services using HTTP,
Consuming JSON Services
15 Android Services, Create Own Services, Establishing Communication between a
Service and an Activity
Binding Activities to Services, Understanding Threading
16 Introduction to Xamarin/Flutter for cross platform development
17 Publishing, Android Applications

Recommended Textbooks

1. Professional Android Application Development, Reto Meier, Wrox Programmer to Programmer,

3rd Edition (2014)
2. iOS Programming: The Big Nerd Ranch Guide, Conway, J., Hillegass, A., & Keur, C., 5th Edition
(2015)

Recommended Reference (Books/Websites/Articles)

1. Android Programming: The Big Nerd Ranch Guides, Phillips, B. & Hardy, B., 3rd Edition
(2017)

170
 Scheme of Studies for BS (Computer Science) 2023
Parallel and Distributed Computing
Course Code: CSPD-407

Semester Credit Hours Prerequisite

[BSCS-8] [3+0] [CSOS-347]

Course Description
The goal of this course is to introduce students to the principles and paradigm of parallel and distributed
systems, algorithm and applications.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

Learn about the different parallel C2
CLO-1 architecture, profiling and parallelization C 2
of code Comprehension

Analytical modeling and performance of C4

CLO-2 C 4
parallel programs Analysis

Analyze complex problems with shared C3

CLO-3 C 3
memory programming with OpenMP Application
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
This course introduces the following topics to students:
 Introduction to parallel and distributed systems, tools, languages, architectural support
from the application side
 Analysis and profiling of applications
 Shared memory concepts like Threads and OpenMP,
 Distributed memory point to point collectives, Parallel and Distributed Programming
Paradigms
 Parallel and Distributed Algorithms
 Applications of Parallel and Distributed Computing, Multi-core, Client-server, GPU
 Heterogeneous Computing
 Advanced topics in Parallel & Distributed System

Course Weekly Schedule

The course schedule for 16 weeks is detailed below

171
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
1 Introduction to parallel and distributed computing, Flynn’s Classical Taxonomy and
general parallelism terminologies
2 Platforms for parallel programming and types of parallelism, Amdahl’s Law and
profiling
3 Parallel Memory Architectures, Parallel programming models
4 Dependence Analysis
5 Designing parallel programs
6 Inter-process Communication, Message Passing System
7 Introduction to Multithreading, C++ Threads and Design Patterns
8 Shared Memory Parallel Programming: OpenMP,
9 Programming with OpenMP
10 Distributed memory parallel programming, Heterogeneous distributed systems
11 Message Passing Interface (MPI)
12 GPU based Computing, Introduction to CUDA
13 Concurrency Control
14 Fault Tolerance
15 Asynchronous/synchronous computation/communication
16 Advanced topics in parallel and Distributed computing

Recommended Textbooks

1. Lin, C. (2008). Principles of Parallel Programming. Pearson Education India. ISBN:

9788131729526.
2. Coulouris, G. F., Dollimore, J., Kindberg, T., & Blair, G. (2012). Distributed Systems: Concepts
and Design. Addison-Wesley. ISBN: 9780132143011.
3. Rauber, T., & Rünger, G. (2013). Parallel Programming: for Multicore and Cluster Systems.
Springer Science & Business Media. ISBN: 9783642378010.

172
 Scheme of Studies for BS (Computer Science) 2023
Economics for Computing
Course Code: CSEC-473

Semester Credit Hours Prerequisite

[BSCS-8] [3+0] [None]

Course Description
The purpose of this course is to provide knowledge of basic concepts of economics, importance of
economics for software engineering, value based trends in software engineering, decision making
process and how to make decision based on present economy.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT LEVEL PLO

CLO-1 Identify the basic concepts of economics and C1
value based trends in Software Engineering C 1
Knowledge
CLO-2 Apply cost assigning methods to a software C3
project/product and Make business decisions C 3
based on present economy Application

CLO-3 Propose business decisions based on present C5

C 4
economy Synthesis
* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Course Materials
This course introduces the following topics to students:
 Introductory concepts of economics
 Importance/impact of economics in terms of software engineering
 Business decision and business decision making process
 Costing
 Time value of money
 Make business decisions based on present economy
 For profit business decisions
 Uncertainty and risk in decision making
 Economics of reuse
 Value based software engineering

Course Weekly Schedule

The course schedule for 16 weeks are detailed below

173
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
1 Introduction to Economics
Software economics impact on nations and Return on software
2 Problem in estimation and Mythical man month
Proposal Cash flow
3 Costing/ Revenue, Cost and Profit
The cost of quality and Business Decision making process
4 Project Discussion
Time value of money, Interest
5 Equivalence
Basis for comparison
6 Developing Mutually Exclusive Alternatives
OHT1
7 Economics of Reuse
Break Even Analysis
8 Optimization Analysis
Problem analysis
9 For profit decision analysis (The basic for profit decision process)
For profit decision analysis (Comparisons based on total cash flow streams)
10 Planning horizons and economic life
Replacement and retirement decisions
11 OHT2
Expected value decision making/decision tree
12 Laplace rule, maximax rule, maximin rule
Hurwics rule, minimax rule
13 Decision making under uncertainty
Limitations of neutral software engineering, VBSE agenda
14 VBSE 4+1 theory (criteria of good theory)
VBSE 4+1 theory ( theory and its validation)
15 OHT 3
Presentations

174
 Scheme of Studies for BS (Computer Science) 2023
Week Topic
16 Presentations
Skills assessment and wrap up

Recommended Textbooks

1. Tockey, S. (2008). Return on Software: Maximizing the Return on Your Software Investment.
Addison-Wesley. ISBN: 9780321561497.

175
 Scheme of Studies for BS (Computer Science) 2023
Final Year Project
Course Code: CSFP-499

Semester Credit Hours Prerequisite

[BSCS-7/8] [0+6] [CSPF-141,
CSOO-142,
CSVP-368,
CSWP-265,
CSDB-346]
Description
This course is designed as finale project which requires students to demonstrate technical,
theoretical and presentation skills at levels which are aligned with professional software
engineering practices. It is needed that students will apply their knowledge of computing
throughout the course such as development of requirements, design and implementation to develop
a software solution to a real-world problem from conception to completion. In this part, students
propose a practically useful project, and develop a document which consists of project plan and
software design document.

Course Learning Outcomes (CLOs)

The course learning outcome along with domain and BT level are listed below

S. # CLO STATEMENT DOMAIN BT Level PLO

Identify the problem or deficiency in the C2

CLO-1 existing software product, system or C Comprehension 1
concept

Apply knowledge of computing to

formulate a problem statement and C3
CLO-2 requirements (functional and non- C Application 2
functional) based on research literature and
existing systems.
Propose the different components of a C5
software project and model requirements to
CLO-3 C Synthesis 3
generate system design based on the
proposed components.
P5
Construct the proposed software project
Complete Overt
CLO-4 using suitable tools based on the P 5
Response
appropriate algorithms/APIs/DB schema

176
 Scheme of Studies for BS (Computer Science) 2023

Produce test results (based on test cases) of P4

CLO-5 P 4
various modules of the developed project Mechanism
C6
Justify the application of the proposed
CLO-6 C Evaluation 8
solutions for the betterment of Society

Demonstrate development of solutions A4

CLO-7 effectively through written and oral mode A Organization 7
with the aid of multimedia tools.

Demonstrate the originality and relevance A3

CLO-8 A 9
of document’s content to the project Valuing

Show professional team coordination and A3

CLO-9 A 6
communication Valuing
Demonstrate and defend understanding of C3
CLO-10 tools and techniques used in the C 10
development of the developed project Application

* BT= Bloom’s Taxonomy, C=Cognitive Domain, P=Psychomotor Domain, A= Affective Domain

Marks weightage of CLOs according to Rubrics and Assessment Artifacts

Final Year Project (FYP) is evaluated out of 200 marks at three different stages; proposal, progress
evaluation and final defense. Proposal and progress are evaluated out of 40 marks each, final
defense is evaluated out of 90 marks whereas, the remaining 30 marks awarded by supervisor
according to the designed rubrics. Marks distribution at each stage of evaluation with respect to
FYP CLOs and assessment artifacts of each CLO are as follow

FYP
FYP Final Supervisor
Progres
S. # Proposal Defense Evaluation Assessment Artifacts
s
(40) (90) (30)
(40)

Proposal presentation /Proposal

CLO-1 4
report
Proposal presentation /Proposal
CLO-2 12 6
report
Progress presentation / Progress
CLO-3 2 6
report

177
 Scheme of Studies for BS (Computer Science) 2023

CLO-4 4 16 8 Final report/ Prototype

CLO-5 44 Final report

CLO-6 4 Presentation

CLO-7 8 8 8 5 Project code/Presentation

CLO-8 4 2 6 10 Final report

CLO-9 2 2 8 10 Presentation

CLO-10 16 5 Presentation

178
Scheme of Studies for BS (Computer Science) 2023

Rubrics

179
 Scheme of Studies for BS (Computer Science) 2023

Rubrics for Final Year Project (FYP) Evaluation

Final Year Project (FYP) is a 6 credit hour course. It is evaluated out of 200 marks. FYP is
evaluated at three different stages; proposal evaluation, progress evaluation and final evaluation.
Proposal and progress are evaluated out of 40 marks each, final defense is evaluated out of 90
marks whereas, the remaining 30 marks awarded by supervisor according to the designed rubrics.

Rubrics to Evaluate FYP Proposal

Proposal will be evaluated out of 40 marks according to the following rubrics.

Marginal Adequate Good Excellent

Domain CLOs Criteria
10-25% 26-50% 51-75% 76-100%
Problem Very little Some Good Excellent
understanding understandin understanding understanding understanding
[4 marks] g regarding regarding regarding regarding
problem problem problem problem
domain. domain. Need domain. Need domain.
CLO1
clarification little
about some clarification.
aspects of the
problem
domain.

Literature The The evidence Good Evidence is

Cognitive

review / presented is relevant, coverage with with higher

Existing evidence is of accurate and relevant and degree of
systems [6 low covers several accurate relevance and
CLO2
marks] relevance aspects of the support. originality.
with project.
questionable
accuracy.

Problem The project The project The project The project

statement [4 problem problem problem problem
marks] statement is statement is statement is statement is
CLO2
unclearly somehow almost clearly clearly
described. unclearly described. described.
described.

180
Scheme of Studies for BS (Computer Science) 2023
Validity of the Solution is Solution Solution Solution
proposed ambiguous. solves about solves solves
solution [2 50% aspects of problem problem in
marks] problem about 75% most effective
CLO3
statement aspects of manner using
effectively. problem proper
statement techniques.
effectively.

Motivation Very little Some Good Excellent

behind tools understandin understanding understanding understanding
and g of the of the suitable of the suitable of latest tools
Psychomotor

technologies suitable tools tools and tools and and

CLO4 [4 marks] and technologies technologies technologies
technologies applicable to applicable to applicable to
applicable to the problem the problem the problem
the problem domain. domain. domain.
domain.

Innovative Presented Presented Presented Presented

idea [2 marks] solution is a solution is a solution is a solution is a
replica of the replica of the replica of the novel idea.
CLO2 existing existing existing
solution with solution with solution with
about 25% about 50% about 75%
Cognitive

new features. new features. new features.

Social/professi Social and Social and Social and Social and

onal benefits professional professional professional professional
[4 marks] impact is impact is impact is impact is
CLO6
marginally adequately discussed in discussed in
discussed. discussed. detail. detail with
references.

Document Poorly Partially Well Well

format [4 formatted formatted with formatted formatted
Affective

marks] with many some with few with almost

CLO8
grammatical grammatical grammatical no
mistakes. mistakes. mistakes. grammatical
mistakes.

181
 Scheme of Studies for BS (Computer Science) 2023
Communicatio Answer at Answer most Answer most Handle
n skills [4 least one questions questions difficult
marks] question correctly. correctly and questions
CLO7 correctly. Need concisely. with ease and
Need clarification confidence.
clarification. sometimes. Illustrative
explanation.

Organization Bare Basic Good Excellent

and organization organization organization organization
preparation [4 and and and and
marks] preparation. preparation. preparation. preparation.
Lack of Confident in Confident in Confident and
CLO7 confidence only some most parts of relaxed in the
and parts of the the whole
familiarity in presentation. presentation. presentation.
some parts of
the
presentation.

Attire [2 Barely Appropriate Good attire. Excellent

CLO9 marks] acceptable attire. attire.
attire.

Rubrics to Evaluate FYP Progress

Progress will be evaluated out of 40 marks according to the following rubrics.

Marginal Adequate Good Excellent

Domain CLOs Criteria
10-25% 26-50% 51-75% 76-100%
Requirements Unclearly Suitable Suitable Suitable
elicitation defined and process is process is process is
process [2 not properly defined but defined but defined and
CLO2
marks] followed. not followed. partially followed
followed. with
Cognitive

evidence.
Definition of Incorrectly Incorrectly Correctly Correctly
user defined with defined with defined with defined with
interactions low high coverage. low coverage. high
CLO3
(use cases, use coverage. coverage.
case diagram
etc.) [2 marks]

182
Scheme of Studies for BS (Computer Science) 2023
Description of Incorrectly Incorrectly Correctly Correctly
functional of defined with defined with defined with defined with
non-functional low high coverage. low coverage. high
requirements coverage. coverage.
(Correct:
CLO2
Unambiguous,
Complete,
Verifiable and
Consistent) [4
marks]
Selection of Architecture Architecture/d Suitable Suitable
software /design esign architectural architectural
architecture/fra methodolog methodology pattern/design pattern/desig
mework/design y is not partially methodology n
methodology [4 suitable. defined and is defined and methodology
CLO3
marks] represented. clearly is defined
represented. and clearly
represented
with proper
justification.
Data Not suitable Not suitable Suitable Suitable with
representation without with without justification.
diagrams/datas justification. justification. justification.
et/data (ERD,
CLO4
JSON
schema/models
/algorithms) [2
marks]
Process flow Incorrect Incorrect with Correct Correct with
(system flow without description. without description.
CLO4 diagram) [2 description. description.
marks]
Psychomotor

Design models Incorrect Incorrect with Correct Correct with

(class, without description. without description.
sequence, description. description.
component
CLO4 diagrams)
/Data training
& testing
models [2
marks]
40% project Implementat Implementatio Implementatio Implementati
implementation ion is 25% n is 50% of n is 75% of on is 100%
(based on no. of the the required the required of the
CLO4 of modules to required 40%. 40%. required
be 40%. 40%.
implemented)
[8 marks]

183
 Scheme of Studies for BS (Computer Science) 2023
User interface Look and Look and feel Look and feel Look and feel
design [2 feel of user of user of user of user
marks] interface is interface is interface is interface is
CLO4 poor satisfactory good excellent
according to according to according to according to
HCI HCI HCI HCI
standards. standards. standards. standards.
Document Poorly Partially Well Well
format [2 formatted formatted with formatted with formatted
marks] with many some few with almost
CLO8
grammatical grammatical grammatical no
mistakes. mistakes. mistakes. grammatical
mistakes.
Communicatio Answer at Answer most Answer most Handle
n skills [4 least one questions questions difficult
marks] question correctly. correctly and questions
CLO7 correctly. Need concisely. with ease and
Need clarification confidence.
clarification. sometimes. Illustrative
explanation.
Affective

Organization Bare Basic Good Excellent

and preparation organization organization organization organization
[4 marks] and and and and
preparation. preparation. preparation. preparation.
Lack of Confident in Confident in Confident
CLO7 confidence only some most parts of and relaxed
and parts of the the in the whole
familiarity presentation. presentation. presentation.
in some
parts of
presentation.
Attire [2 Barely Appropriate Good attire. Excellent
marks] acceptable attire. attire.
CLO9 attire.

Rubrics to Evaluate FYP Final Defense

Final defense will be evaluated out of 90 marks according to the following rubrics.

Domain CLOs Criteria Marginal Adequate Good Excellent

10-25% 26-50% 51-75% 76-100%

184
Scheme of Studies for BS (Computer Science) 2023
Software Software Software Software Software
Testing (testing verification verification verification verification
methodology, and and validation and validation and
Psychomotor

test case design validation has been has been validation

etc.) [4 marks] has been applied on applied on has been
CLO5 applied on about 50% of about 75% of applied on
about 25% the project the project about 100%
of the implementatio implementatio of the project
project n. n. implementati
implementat on.
ion.
Coding Very little Some Good Excellent
standards / understandi understanding understanding understandin
conventions [8 ng of the and usage of and usage of g and usage
CLO10
marks] usage of coding coding of coding
Cognitive

coding standards. standards. standards.

standards.
Understanding Poor Some Good Excellent
of implemented understandi understanding understanding understandin
CLO10 algorithms/API ng of of of g of
s/DB schema implementat implementatio implementatio implementati
etc. [8 marks] ion. n. n. on.
Used suitable Very little Some Good Excellent
Psychomotor

tools and understandi understanding understanding understandin

technologies [8 ng of the of the of the g of the
CLO4
marks] suitability of suitability of suitability of suitability of
the used the used the used the used
technology. technology. technology. technology.
Implementation 25% 50% 75% 100%
according to implementat implementatio implementatio implementati
Cognitive

the proposed ion is n is according n is according on is

CLO5
solution [32 according to to proposed to proposed according to
marks] proposed solution. solution. proposed
solution.
Team Poor team Poor team good team Excellent in
Affective

coordination [6 coordination coordination coordination team

CLO9 marks] and poor and work and work coordination
work division is division is and work
division. satisfactory. satisfactory. division.
User interface Look and Look and feel Look and feel Look and feel
Psychomotor

design [8 feel of user of user of user of user

marks] interface is interface is interface is interface is
CLO5 poor satisfactory good excellent
according to according to according to according to
HCI HCI HCI HCI
standards. standards. standards. standards.

185
 Scheme of Studies for BS (Computer Science) 2023
Document Poorly Partially Well Well
format [6 formatted formatted with formatted with formatted
marks] with many some few with almost
CLO8
grammatical grammatical grammatical no
mistakes. mistakes. mistakes. grammatical
mistakes.
Communicatio Answer at Answer most Answer most Handle
n skills [4 least one questions questions difficult
marks] question correctly. correctly and questions
CLO7 correctly. Need concisely. with ease and
Need clarification confidence.
clarification. sometimes. Illustrative
explanation.
Affective

Organization Bare Basic Good Excellent

and preparation organization organization organization organization
[4 marks] and and and and
preparation. preparation. preparation. preparation.
Lack of Confident in Confident in Confident
CLO7 confidence only some most parts of and relaxed
and parts of the the in the whole
familiarity presentation. presentation. presentation.
in some
parts of the
presentation.
Attire [2 Barely Appropriate Good attire. Excellent
marks] acceptable attire. attire.
CLO9 attire.

Rubrics Followed by Supervisor to Evaluate FYP

FYP supervisor will evaluate the project out of 30 marks according to the following rubrics.

Marginal Adequate Good Excellent

Domain CLOs Criteria
10-25% 26-50% 51-75% 76-100%
Understanding Poor Some Good Excellent
Cognitive

of implemented understandi understanding understanding understandin

CLO10 algorithms/API ng of the of the of the g of the
s/DB schema implementat implementatio implementatio implementati
etc. [5 marks] ion. n. n. on.
Project No Limited Good Excellent
ownership [5 ownership. ownership. ownership. ownership.
marks] Depend Mainly Contribute in Self-
Affective

solely on the depend on the discussion initiatives to

CLO9
input from input from the during make the
the supervisor to meetings. progress.
supervisor make
progress.

186
Scheme of Studies for BS (Computer Science) 2023
to make
progress.

Document Poorly Partially Well Well

format [5 formatted formatted with formatted with formatted
marks] with many some few with almost
CLO8
grammatical grammatical grammatical no
mistakes. mistakes. mistakes. grammatical
mistakes.
Team Poor team Poor team Good team Excellent in
coordination [5 coordination coordination coordination team
CLO9 marks] and poor and work and work coordination
work division is division is and work
division. satisfactory. satisfactory. division.
Communicatio Answer at Answer most Answer most Handle
n skills [5 least one questions questions difficult
marks] question correctly. correctly and questions
CLO7 correctly. Need concisely. with ease and
Need clarification confidence.
clarification. sometimes. Illustrative
explanation.
Professional Demonstrate Demonstrate Demonstrate Demonstrate
ethics [5 poor limited good excellent
marks] discipline, discipline, discipline, discipline,
CLO8
punctuality, punctuality, punctuality, punctuality,
and and manners. and manners. and manners.
manners.

187
 Scheme of Studies for BS (Computer Science) 2023

Rubrics for Lab Evaluation

In computer science discipline, two kinds of labs are conducted, i.e. software based labs and
hardware based labs, depending on the course. According to the nature of lab conduct, separate
rubrics are followed to evaluate software based labs and hardware based labs. The designed rubrics
are applicable to CLOs which are mapped either to psychomotor domain or affective domain only.

Rubrics to Evaluate Software Based Labs

Rubrics to evaluate software based labs are as follow

Performance Outstanding Good Average Below Unsatisfactory BT PLO Marks

Performance Performanc Performance Average Performance Level Obtai
e Performance ned
(5) (4) (3) (2) (0-1)
Conducting Students Students Students Students The student
Experiment present a present a require require fails to P3 5
[a] clear and clear and effective effective present a
concise concise guidance to guidance to coherent plan
plan/ plan/ present a present a to solve the
solution to solution to clear and clear and problem. The
solve the solve the concise concise plan/ student fails
problem. problem plan/ solution to to code with
The code The code solution to solve the complete
is is solve the problem. The steps to get
completel functional problem. code has the correct
y with The code is substantial outputs.
functional complete partially errors and
with steps functional has missing
complete producing or has steps
steps the outputs missing producing
producing with steps the outputs
the correct acceptable producing with errors.
outputs. error. the outputs
with a
minor
error.
Individual An active Cooperatio Shows Frequent Negatively
&Teamwor cooperatio n among average conflict affects the A2 9
k n develops group cooperation occurs other group
among members with the among the members and
[b] group to support group group creates
members the members as members as a hindrance in
to support execution a team and team and as successful
the of the as an an individual performance
execution experiment individual to perform or
of the as a team to perform the completion
experimen and the experiment. of
t as a team individuall experiment. experiment
and y was as an
individuall reasonable. individual or
y. as a team
member.

188
 Scheme of Studies for BS (Computer Science) 2023
Rubrics to Evaluate Hardware Based Labs
Rubrics to evaluate hardware based labs are as follow

Performance Outstanding Good Average Below Unsatisfactory BT PLO Marks

Performance Performance Performance Average Performance Level Obtaine
Performance d
(5) (4) (3) (2) (0-1)
Conducting A careful A careful Carefully Selection of Incapable to
Experiment selection of selection of examines equipment select the
[a] equipment equipment the under suitable P3 5
under under equipment, supervision equipment
supervision supervision under of instructor and
of of instructor supervision is done but inaccurate
instructor for task of instructor perform equipment
for completion, with minor experiment operation,
effective data errors in with data
operation, collection data substantial collection
task and display collection error. resulting in
completion of results and display all errors.
, data with of results.
collection acceptable
and display errors.
of results.
Individual An active Cooperation Shows Frequent Negatively
&Teamwor cooperatio among average conflict affects the
k n develops group cooperation occurs other group A2 9
[b] among members to with the among the members
group support the group group and creates
members execution of members as members as hindrance in
to support the a team and a team and successful
the experiment as an as an performance
execution as a team individual individual to or
of the and to perform perform the completion
experiment individually the experiment. of
as a was experiment. experiment
team and reasonable. as an
individuall individual or
y. as a team
member.

189
 Scheme of Studies for BS (Computer Science) 2023

Assessment of Theory and Lab:

Theory and lab both will be evaluated out of 100, separately. The detail distribution of 100 marks
for theory and lab is given in the following tables.

Marks Distribution for Theory

Evaluation Methods Theory weight (%)

Quizzes 5-10
Assignments 5-10 = 25
Project / Presentation 5-10
Mid Term 25
Final Term 50
Total 100

Marks Distribution for Lab

Evaluation Methods Lab weight (%)

Internal Evaluation/ Lab Reports 60
Project /Open Ended Labs 15
Final Term Exam 25
Total 100

Grading Policy
Student performance in each subject will be awarded with grads according to the following grading
policy

Grade A+ A B+ B C+ C D+ D F
%age >=90 80-89 75-79 70-74 65-69 60-64 55-59 50-54 <50
GPA 4.00 4.00 3.50-3.99 3.00-3.49 2.50-2.99 2.00-2.49 1.50-1.99 1.00-1.49 0.00

190