Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

ITEM NO. 3
To recommend Curriculum, Model Study Plan, and Course Syllabi, for BS
Data Science in the light of the Undergraduate Policy 2023 by Higher
Education Commission (HEC) of Pakistan at University of the Punjab,
Lahore, Punjab University Gujranwala campus, Punjab University Jhelum
campus, Punjab University Pothohar campus, and the affiliated colleges.
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Updated Curriculum
of

Bachelor of Science
in Data Science BS (DS)

By

Department of Data Science,

Faculty of Computing and Information Technology

University of the Punjab,

Lahore, Pakistan

2|Page
Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

3|Page
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

BS in Data Science

Program Title: BS Data Science

Department: Department of Data Science (DDS)
Faculty: Faculty of Computing and Information Technology

Admission Eligibility Criteria for BS (DS)

Same as already approved by Academic Council

4|Page
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Degree Completion Requirement for BS Data Science

• At minimum 130 credit hours are required for award of BS degree in Data
Science.
• A minimum 2.0 CGPA on a scale of 4.0 is required for the award of BS Data
Science Degree
• Maximum duration allowed by the HEC/PU guidelines
• Non-credit Internship (as per HEC/PU guidelines)
• Practical Learning Lab (as per HEC/PU guidelines)
• Non-credit course/s (if any)

Two years Associate Degree in Data Science

• The students after successful completion of 04 semesters in BS Data Science

Program may exit with Associate Degree in Data Science. However, the
completion of all requirements for the award of Associate Degree in Data
Science (Credit Hours, CGPA, and Compulsory Courses) needs to be fulfilled.

5|Page
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Areas Covered in the BS Data Science

Numeric Group
Couse Group HEC PU
Code (N) Code

0 MD Math Deficiency* 0 (2)

1 CC Computing Core 46 (14) 46 (19)

2 DD Data Science Core 18 (6) 18 (6)

3,4 ED Data Science Elective 21 (7) 21 (7)

5 MS Mathematics & Supporting Courses 12 (4) 12 (4)

6,9 GE General Education Requirement 30 (12) 30 (12)

7 UE Elective Supporting Courses 3 (1) 3 (1)

8 HQ Quran Translation 0 4 (8)

Total 130 (44) 134 (57)

*: non credited deficiency course

Course Coding Scheme
Code-YNS
Code = MD, CC, DS, ES, MS, GE, UE, HQ
Y = Year of Offering = 1, 2, 3, 4
N = Numeric Code = 0, 1, …, 9
S = Serial Number (Resets with Year) = 0, 1, 2, …,9
Lab Codes are same as related theory course code with ‘-L’ as the suffix

6|Page
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Computing Core (CC) Courses

Total Credit hours: 46 (19)

Sr. No. Course Title Cr Hrs Lab

1 Programming Fundamentals 3 0

2 Programming Fundamentals Lab 0 1

3 Object Oriented Programming 3 0

4 Object Oriented Programming Lab 0 1

5 Database Systems 3 0

6 Database Systems Lab 0 1

7 Digital Logic Design 2 0

8 Digital Logic Design Lab 0 1

9 Data Structures 3 0

10 Data Structures Lab 0 1

11 Information Security 2 1

12 Artificial Intelligence 2 1

13 Computer Networks 2 1

14 Software Engineering 3 0

15 Computer Organization and Assembly Language 2 1

16 Operating Systems 2 1

17 Analysis of Algorithms 3 0

18 Final Year Project-1 0 2

19 Final Year Project-2 0 4

Total 30 16

7|Page
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Domain Core (DD) Courses

Total Credit hours: 18 (6)

Sr. No. Course Title Cr Hrs Lab

1 Introduction to Data Science 2 1

2 Advanced Statistics 2 1
3 Data Mining and Machine Learning 2 1

4 Data Visualization 2 1

5 Data Warehousing and Business Intelligence 2 1

6 Parallel and Distributed Computing 2 1

Total 12 6

Mathematics and Supporting (MS) Courses

Total Credit hours: 12 (4)

Sr. No. Course Title Cr Hrs Lab

1 Multivariable Calculus 3 0

2 Linear Algebra 3 0

3 Probability and Statistics 3 0

4 Technical and Business Writing 3 0

Total 12 0

8|Page
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

General Education Requirement (GE) Courses

Total Credit hours: 30 (12)

Sr. No. Course Title Sub – Category Cr Hrs Lab

1 Applications of Information and Communication
2 1
Technologies

2 Functional English 3 0
3 Expository Writing 3 0
4 Quantitative
Discrete Structures Reasoning – I
3 0

5 Quantitative
Calculus and Analytic Geometry 3 0
Reasoning – II

6 Islamic Studies* 2 0

7 Ideology and Constitution of Pakistan 2 0

8 Introduction to Management Social Science 2 0
9 Applied Physics Natural Science 2 1
10 Professional Practices 2 0
11 Arts and
Civic and Community Engagement 2 0
Humanities

12 Entrepreneurship 2 0
Total 28 2
*: Alternative course for Islamic Studies will be offered to the non-Muslim students.

Elective Supporting (ES) Courses

Total Credit hours: 3 (1) from the list

Sr. No. Course Title Cr Hrs Lab

1 Introduction to Marketing 3 0

Total 3 0

Note: New courses may be added to the list with the approval of the Convener, Board of Studies,
Department of Data Science, University of the Punjab, Lahore.

9|Page
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Quran Translation (QT) Courses

Total Credit hours: 4(8)

Sr. No. Course Title Cr Hrs Lab

1 Quran Translation I 0.5

2 Quran Translation II 0.5

3 Quran Translation III 0.5

4 Quran Translation IV 0.5

5 Quran Translation V 0.5

6 Quran Translation VI 0.5

7 Quran Translation VII 0.5

8 Quran Translation VIII 0.5

Total 4
Note: Alternative courses will be offered through the university to non-Muslim students.

10 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Domain Elective (DE) Courses

Total Credit hours: 21 (7)

Sr. No. Course Title Cr Hrs Lab

1 Web Technologies 2 1

2 Deep Learning 2 1

3 Natural Language Processing 2 1

4 Computer Vision 2 1

5 Big Data Analytics 2 1

6 Theory of Automata and Formal Languages 2 1

7 Software Construction and Development 2 1

Total 14 7

Note: New courses may be added to the list with the approval of the Convener, Board of Studies,
Department of Data Science, University of the Punjab, Lahore.

MATHEMATICS DEFICIENCY (MD) Courses

Total Credit hours: 0 (2)

Sr. No. Course Title Cr Hrs Lab

1 Math Deficiency - I 0

2 Math Deficiency - II 0
Note: These are PASS/FAIL based courses with 3 hours teaching per week.

11 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Model Scheme of Study for BS Data Science

Semester I
Credit
Sr# Code Course Title Type Prerequisite
hours
1 HQ-001 Quran Translation I HQ 0.5
2 GE-190 Functional English GE 3 (3-0)
3 GE-168 Ideology and Constitution of Pakistan GE 2 (2-0)
Applications of Information and
4 GE-160 GE 3 (2-1)
Communication Technologies
5 GE-163 Islamic Studies GE 2 (2-0)
6 CC-112 Programming Fundamentals CC 3 (3-0)
7 CC-112-L Programming Fundamentals Lab CC 1 (0-1)
8 MD-001 Math Deficiency – I* MD 0
* (Taught 3 hours per week)
Total 14.5
Semester II
Credit
Sr# Code Course Title Type Prerequisite
hours
1 HQ-002 Quran Translation II HQ 0.5
2 GE-169 Applied Physics GE 3 (2-1)
3 MS-251 Probability and Statistics MS 3 (3-0)
4 GE-199 Expository Writing GE 3 (3-0)
5 CC-110 Digital Logic Design CC 2 (2-0)
6 CC-110-L Digital Logic Design Lab CC 1 (0-1)
7 CC-211 Object Oriented Programming CC Programming Fundamentals 3 (3-0)
8 CC-211-L Object Oriented Programming Lab CC Programming Fundamentals 1 (0-1)
9 MD-002 Math Deficiency – II* MD 0
* (Taught 3 hours per week)
Total 16.5
Semester III
Credit
Sr# Code Course Title Type Prerequisite
hours
1 HQ-003 Quran Translation III HQ 0.5
2 GE-162 Calculus and Analytic Geometry GE 3 (3-0)
Computer Organization and Assembly
3 CC-210 CC Digital Logic Design 3 (2-1)
Language
4 GE-167 Discrete Structures GE 3 (3-0)
5 CC-213 Data Structures CC Object-Oriented Programming 3 (3-0)
6 CC-213-L Data Structures Lab CC Object-Oriented Programming 1 (0-3)
7 DD-221 Introduction to Data Science DD Programming Fundamentals 3 (2-1)
8 MS-252 Linear Algebra MS 3 (3-0)
Total 19.5
Semester IV

12 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Credit
Sr# Code Course Title Type Prerequisite
hours
1 HQ-004 Quran Translation IV HQ 0.5
Calculus and Analytical
2 MS-253 Multivariable Calculus MS Geometry
3 (3-0)
3 DD-222 Data Visualization DD 3 (2-1)
4 CC-215 Database Systems CC 3 (3-0)
5 CC-215-L Database Systems Lab CC 1 (0-3)
6 CC-310 Artificial Intelligence CC Object Oriented Programming 3 (2-1)
7 CC-214 Computer Networks CC 3 (2-1)
8 DD-223 Advanced Statistics DD Probability & Statistics 3 (2-1)
Total 19.5
Semester V
Credit
Sr# Code Course Title Type Prerequisite
hours
1 HQ-005 Quran Translation V HQ 0.5
2 CC-311 Operating Systems CC Data Structures 3 (2-1)
3 GE-363 Civics and Community Engagement GE 2 (2-0)
4 CC-313 Analysis of Algorithms CC Data Structures 3 (3-0)
Data Warehousing and Business
5 DD-321 DD Database Systems 3 (2-1)
Intelligence
6 ED-323 Web Technologies ED Object Oriented Programming 3 (2-1)
7 DD-322 Data Mining and Machine Learning DD Introduction to Data Science 3 (3-0)
Total 17.5
Semester VI
Credit
Sr# Code Course Title Type Prerequisite
hours
1 HQ-006 Quran Translation VI HQ 0.5
2 ES-492 Introduction to Marketing UE 3 (3-0)
3 CC-308 Information Security CC 3 (2-1)
4 CC-303 Software Engineering CC 3 (3-0)
5 ED-321 Deep Learning ED 3 (2-1)
7 ED-322 Natural Language Processing ED 3 (2-1)
8 ED-335 Computer Vision ED 3 (2-1)
Total 18.5
Semester VII
Credit
Sr# Code Course Title Type Prerequisite
hours
1 HQ-007 Quran Translation VII HQ 0.5
2 MS-254 Technical and Business Writing MS 3 (3-0)
3 GE-362 Entrepreneurship GE 2 (2-0)
Theory of Automata and Formal
4 ED-333 ED 3 (2-1)
Languages
5 ED-421 Big Data Analytics ED 3 (2-1)
6 ED-324 Software Construction and Development ED Object Oriented Programming 3 (2-1)
7 CC-401 Final Year Project-1 CC 2 (0-6)

13 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Total 16.5
Semester VIII
Credit
Sr# Code Course Title Type Prerequisite
hours
1 HQ-008 Quran Translation VIII HQ 0.5
2 ES-492 Introduction to Management GE 2 (2-0)
3 DD-409 Parallel and Distributed Computing DD Operating Systems 3 (2-1)
4 GE-402 Professional Practices GE 2 (2-0)
5 CC-402 Final Year Project-2 CC FYP-1 4 (0-12)
Total 11.5

14 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Adoption of OBEs for BS Data Science Program

Outcome-based education is about preparing students for life, not simply getting them ready for
college or employment.

Department Vision
To become a premier in institute of Data Science that is dedicated to excellence in teaching,
research, and fostering entrepreneurship.

Department Mission
The mission of the DDS is to effectively prepare our students in Data Science and related fields,
so that they can serve community with skill, knowledge and high character, and be a source of
pride for the Institute and to the homeland (Pakistan).

1. Graduate Attributes (GAs)

Graduate attributes are statements that describe the set of skills, knowledge, and attitude that
the Department of Data Science expects from its graduates. The department will monitor its
performance from the data gathered while evaluating the attainment of GAs by its graduates. By
virtue of this data the institute will be able to assess the quality of its graduates and take steps to
carry out necessary improvements in weak areas that are affecting better attainment of GAs.
GAs defined by NCEAC and adopted by the Department of Data Science at University of the
Punjab are in alignment with the Graduate Attributes laid down in the Seoul Accord document
D.5 for computing professionals. The range qualifier in several attribute statements uses the
notion of complex computing problem, or the notion of complex activity.

• GA-1 Academic Education: Completion of an accredited program of study designed to

prepare graduates as computing professionals.
• GA-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.
• GA-3 Problem Analysis: Identify and solve complex computing problems reaching
substantiated conclusions using fundamental principles of mathematics, computing sciences,
and relevant domain disciplines.

15 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• GA-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.
• GA-5 Modern Tool Usage: Create, select, or adapt and then apply appropriate techniques,
resources, and modern computing tools to complex computing activities, with an
understanding of the limitations.
• GA-6 Individual and Teamwork: Function effectively as an individual and as a member or
leader of a team in multidisciplinary settings.
• GA-7 Communication: Communicate effectively with the computing community about
complex computing activities by being able to comprehend and write effective reports, design
documentation, make effective presentations, and give and understand clear instructions.
• GA-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
• GA-9 Ethics: Understand and commit to professional ethics, responsibilities, and norms of
professional computing practice.
• GA-10 Life-long Learning: Recognize the need, and have the ability, to engage in independent
learning for continual development as a computing professional.

2. Program Educational Objectives (PEOs)

of graduation,
Program Educational Objectives
PEO No Description
PEO-1 Solve real-world problems by applying mathematical and computational
approaches.
PEO-2 Understand, design, and develop computer-based solutions and data
components to fulfill the customer needs.

PEO-3 Present, analyze, and identify patterns in large-sized datasets (numeric, text,
image, video, audio)
PEO-4 Understand professional, ethical, and social responsibilities and effective
communication
PEO-5 Harness the benefits of lifelong useful traits like working in groups, leading and
managing projects and building capacity to learn new tools and techniques as per
need.
PEO-6 Make best use of essential entrepreneurial skills that result in producing next
generation of industry leaders.
the students develop an ability t

16 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

3. Program Learning Outcomes (PLOs)

The Department of Data Science ensures that the graduates are equipped with the right set of
attributes that will make them desirable to potential employers. Problem Solving, Critical Thinking,
Creativity, Communication, Teamwork, Adaptability, and Life-long Learning are all considered as
crucial attributes for employability. These graduate attributes (GAs) are in line with student
outcomes defined by Seoul Accord; therefore, the department of computer science at CUI has
adapted SOs from Seoul Accord which is listed in Table below:

PLO # Program Learning Description

Outcomes (PLOs)
PLO-1 Academic Education To prepare graduates as computing professionals
PLO-2 Knowledge for Solving Apply knowledge of computing fundamentals, knowledge
Computing Problems 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.

PLO-4 Design/ Development Design and evaluate solutions for complex computing
of Solutions 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 Function effectively as an individual and as a member or

Teamwork 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

17 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

reports, design documentation, make effective

presentations, and give and understand clear instructions.

PLO-8 Computing Understand and assess societal, health, safety, legal, and
Professionalism and cultural issues within local and global contexts, and the
Society 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

4. Mapping between PEOs and PLOs

The following is the mapping between PLOs and PEOs.

PLOs to PEOs Mapping

PEOs
PLO Title
PEO-1 PEO-2 PEO-3 PEO-4 PEO-5 PEO-6
PLO-1 Academic Education ✔
PLO-2 Knowledge for Solving Computing ✔ ✔
Problems
PLO-3 Problem Analysis ✔ ✔ ✔
PLO-4 Design/ Development of Solutions ✔ ✔ ✔
PLO-5 Modern Tool Usage ✔ ✔
PLO-6 Individual and Teamwork ✔ ✔
PLO-7 Communication ✔ ✔ ✔
PLO-8 Computing Professionalism and ✔ ✔
Society
PLO-9 Ethics ✔ ✔
PLO-10 Life-long Learning ✔ ✔

18 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

5. Mapping between Courses and PEOs

A mapping between courses offered in the BS Data Science program and PLOs is defined.

PEOs
S# CCode Course Titles 1 2 3 4 5 6
1 GE-190 Functional English ✔ ✔
2 GE-168 Ideology and Constitution of Pakistan ✔ ✔
3 GE-160 Applications of ICT ✔
4 GE-163 Islamic Studies/University Equivalent ✔ ✔
5 CC-112 Programming Fundamentals ✔ ✔
6 GE-169 Applied Physics ✔ ✔
7 MS-251 Probability and Statistics ✔ ✔
8 GE-199 Expository Writing ✔ ✔
9 CC-110 Digital Logic Design ✔ ✔
10 CC-211 Object Oriented Programming ✔ ✔
11 GE-162 Calculus & Analytical Geometry ✔ ✔
12 CC-210 Computer Organization & Assembly ✔
13 GE-167 Discrete Structures ✔
14 CC-213 Data Structures ✔ ✔ ✔
15 DD-221 Introduction to Data Science ✔ ✔
16 MS-252 Linear Algebra ✔ ✔
17 MS-253 Multivariate Calculus ✔ ✔
18 DD-222 Data Visualization & Graphics ✔ ✔
19 CC-215 Database Systems ✔
20 CC-310 Artificial Intelligence ✔ ✔
21 CC-214 Computer Networks ✔
22 DD-223 Advanced Statistics ✔
23 CC-311 Operating Systems ✔
24 GE-363 Civics & Community Engagement ✔ ✔ ✔
25 CC-313 Analysis of Algorithms ✔ ✔
26 DD-321 Data Warehousing & BI ✔ ✔
27 DD-322 Data Mining and Machine Learning ✔ ✔
28 DS-3WW Data Science Elective I ✔ ✔ ✔
29 SS-3XX Social Science Elective ✔ ✔ ✔
30 CC-308 Information Security ✔ ✔ ✔
31 DS-303 Software Engineering ✔ ✔
32 DS-4YZ Data Science Elective II ✔ ✔ ✔
33 DS-3ZZ Data Science Elective III ✔ ✔ ✔
34 DS-3WX Data Science Elective IV ✔ ✔ ✔
35 MS-254 Technical and Business Writing ✔ ✔
36 GE-362 Entrepreneurship ✔ ✔ ✔
37 DS-402 Data Science Elective V ✔ ✔ ✔
38 CC-401 Final Year Project-1 ✔ ✔ ✔ ✔ ✔ ✔
39 DS-4XY Data Science Elective VI ✔ ✔ ✔
40 DS-3YY Data Science Elective VII ✔ ✔ ✔
41 SS-4XX Social Science Elective (SS) ✔ ✔
42 DD-409 Parallel and Distributed Computing ✔ ✔ ✔
43 GE-402 Professional Practices ✔
44 CC-402 Final Year Project-2 ✔ ✔ ✔ ✔ ✔ ✔

19 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

6. Mapping between Courses and PLOs

A mapping between courses offered in the BS Data Science program and PLOs is defined.

PLOs
S# CCode Course Titles 1 2 3 4 5 6 7 8 9 10
1 GE-190 Functional English ✔ ✔ ✔
2 GE-168 Ideology and Constitution of Pakistan ✔ ✔ ✔
3 GE-160 Applications of ICT ✔ ✔
4 GE-163 Islamic Studies/University Equivalent ✔ ✔ ✔ ✔ ✔
5 CC-112 Programming Fundamentals ✔ ✔
6 GE-169 Applied Physics ✔ ✔
7 MS-251 Probability and Statistics ✔ ✔ ✔
8 GE-199 Expository Writing ✔ ✔ ✔ ✔
9 CC-110 Digital Logic Design ✔ ✔
10 CC-211 Object Oriented Programming ✔ ✔ ✔ ✔ ✔
11 GE-162 Calculus & Analytical Geometry ✔ ✔ ✔ ✔
12 CC-210 Computer Organization & Assembly Language ✔ ✔ ✔ ✔
13 GE-167 Discrete Structures ✔ ✔
14 CC-213 Data Structures ✔ ✔ ✔ ✔
15 DD-221 Introduction to Data Science ✔ ✔ ✔ ✔
16 MS-252 Linear Algebra ✔ ✔ ✔ ✔
17 MS-253 Multivariate Calculus ✔ ✔ ✔ ✔
18 DD-222 Data Visualization & Graphics ✔ ✔ ✔ ✔ ✔
19 CC-215 Database Systems ✔ ✔ ✔ ✔ ✔
20 CC-310 Artificial Intelligence ✔ ✔ ✔ ✔ ✔
21 CC-214 Computer Networks ✔ ✔ ✔
22 DD-223 Advanced Statistics ✔ ✔ ✔ ✔
23 CC-311 Operating Systems ✔ ✔ ✔ ✔ ✔
24 GE-363 Civics & Community Engagement ✔ ✔ ✔ ✔ ✔
25 CC-313 Analysis of Algorithms ✔ ✔ ✔ ✔
26 DD-321 Data Warehousing & BI ✔ ✔ ✔ ✔ ✔
27 DD-322 Data Mining and Machine Learning ✔ ✔ ✔ ✔ ✔
28 DS-3WW Data Science Elective I ✔ ✔ ✔ ✔ ✔ ✔
29 SS-3XX Social Science Elective ✔ ✔ ✔ ✔ ✔ ✔ ✔ ✔
30 CC-308 Information Security ✔ ✔ ✔ ✔ ✔ ✔
31 DS-303 Software Engineering ✔ ✔ ✔ ✔ ✔
32 DS-4YZ Data Science Elective II ✔ ✔ ✔ ✔ ✔ ✔
33 DS-3ZZ Data Science Elective III ✔ ✔ ✔ ✔ ✔ ✔
34 DS-3WX Data Science Elective IV ✔ ✔ ✔ ✔ ✔ ✔
35 MS-254 Technical and Business Writing ✔ ✔ ✔ ✔ ✔ ✔
36 GE-362 Entrepreneurship ✔ ✔ ✔ ✔ ✔ ✔
37 DS-402 Data Science Elective V ✔ ✔ ✔ ✔ ✔ ✔
38 CC-401 Final Year Project-1 ✔ ✔ ✔ ✔
39 DS-4XY Data Science Elective VI ✔ ✔ ✔ ✔ ✔
40 DS-3YY Data Science Elective VII ✔ ✔ ✔ ✔ ✔
41 SS-4XX Social Science Elective (SS) ✔ ✔ ✔ ✔ ✔
42 DD-409 Parallel and Distributed Computing ✔ ✔ ✔ ✔
43 GE-402 Professional Practices ✔ ✔ ✔ ✔ ✔ ✔
44 CC-402 Final Year Project-2 ✔ ✔ ✔ ✔

20 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

7. BLOOM’s Taxonomy
In the BS Data Science curricula, the Cognitive domain of Bloom's Taxonomy is used to assess
student mastery of learning outcomes. The Department of Data Science is using the following six
levels for the Cognitive domain, progressing from the lowest order processes to the highest.
• Remembering - Retrieving, recalling, or recognizing information from memory. Students can recall or
remember information. Note: This process is the most basic thinking skill.
• Understanding - Constructing meaning or explaining material from written, spoken, or graphic sources.
Students can explain ideas or concepts.
• Applying - Using learned materials or implementing materials in new situations. Students can
use/apply information in a new way.
• Analyzing - Breaking material or concepts into parts, determining how the parts relate or interrelate
to one another or to an overall structure or purpose. Students can distinguish between different parts.
• Evaluating - Assessing, making judgments and drawing conclusions from ideas, information, or data.
Students can justify a stand or decision.
• Creating - Putting elements together or reorganizing them into a new way, form or product. Students
can create a new product. Note: This process is the most difficult mental function.

8. PLOs and CLOs Assessment Roadmap Framework

The framework proposed for the assessment of PLOs and CLOs is the following. Note that the QEC
survey will be held two years after the graduation of the first batch. The assessment results and
the findings of the survey will be presented to the industrial board for deliberations.

9. Roadmap for Adopting OBE for BSDS

The four-phased proposed roadmap for adopting OBE based system for BS in Data Science.

21 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• Planning and approval:

o Identify and clearly define the desired learning outcomes for PLOs, and CLO.
o Align the curriculum with the defined outcomes. Ensure that each course contributes to the
overall program outcomes.
o Develop instructional materials and teaching methods that align with the desired outcomes.
Incorporate active learning, collaborative activities, and real-world problem-solving tasks.
o Approval of programs from relevant bodies.

• Initiation and Implementation

o Awareness. Introduce students to the OBE framework, explaining the focus on outcomes and
the importance of their active participation in the learning process.
o Faculty training. Conduct training sessions and workshops for faculty to familiarize them with
OBE principles and teaching strategies.

• Assessment and Refinement

o Implement continuous assessment methods to monitor student progress and provide timely
feedback. This can include quizzes, assignments, projects, and peer assessments.
o Conduct end-of-course assessments to evaluate whether the learning outcomes have been
achieved. This can include exams, capstone projects, and practical assessments.
o Collect data on student performance and analyze it to assess the effectiveness of the teaching
methods and the achievement of learning outcomes.
o Establish a feedback mechanism to gather input from students, faculty, and other stakeholders
on the effectiveness of the OBE system.

• Continuous Improvements
o Regularly review the curriculum, teaching methods, and assessment strategies to identify
areas for improvement.

22 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

o Engage stakeholders in the continuous improvement process to ensure that the program
remains relevant and effective.
o Provide ongoing professional development opportunities for faculty to stay updated with the
latest teaching strategies and technological advancements.
o Based on the feedback and data analysis, make necessary adjustments to the curriculum,
teaching methods, and assessments to enhance the overall effectiveness of the OBE system.

23 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Detailed Course Outlines

for BS in DATA SCIENCE

24 | P a g e
Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

25 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code GE-160

Course Title Applications of Information and Communication Technologies

Theory Lab
Credit Hours
2 1

Lecture Duration 60 minutes (1.0 Hours) 2 lectures per week, 3 hours lab session per week

Semester 1

Courses Knowledge
Pre-requisites
Nil Nil

Follow Up Courses

Course Learning Outcomes (CLOs)

CLO No Course Learning Outcome Bloom Taxonomy

CLO-1 Understand basics of computing technology C1 (Knowledge)

CLO-2 Do number systems conversions and arithmetic C2 (Understand)
CLO-3 Have knowledge of types of software C2 (Understand)
CLO-4 Have knowledge of computing related technologies C3 (Apply)
1. This is an introductory course in Computer Science designed for
beginners.

2. Apart from leading the participants through a whirlwind history of

Objectives
computing, the course also develops a feel for web programming
through a series of lectures that help the students develop their
own web page.

26 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

3. Main objective of the course is to build an appreciation for the

fundamental concepts in computing and to become familiar with
popular PC productivity software.

• Understand basics of computing technology

• Do number systems conversions and arithmetic
Learning Outcomes
• Have knowledge of types of software
• Have knowledge of computing related technologies

1. Brief History of Computer

1.1. Four Stages of History
2. Computer Elements and Software Types
2.1. Processor, Memory, Hardware, Software
2.2. Application Software its uses and Limitations
2.3. System Software its Importance and its Types
3. Types of Computer
3.1. Super Compute
3.2. Mainframe Compute
3.3. Mini Compute

Contents 3.4. Micro Compute

4. Organizing Computer Facility
4.1. Centralized Computing Facility
4.2. Distributed Computing Facility
4.3. Decentralized Computing Facility
5. Input Devices
5.1. Keyboard and its Types,
5.2. Terminal (Dump, Smart, Intelligent),
5.3. Dedicated Data Entry
5.4. Pointing Devices, Voice Input,
6. Output Devices

27 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

6.1. Soft- Hard

6.2. Copies, Monitors and its Types, Printers and its Types, Plotters,
6.3. Computer Virus and its Forms,
6.4. Storage Units,
6.5. Primary and Secondary Memories,
7. RAM and its Types
7.1. Popular types of RAM
8. Cache Memory
8.1. Cache Memory Importance
8.2. Type of Cache Memory
9. Hard Disks, Working of Hard Disk
9.1. Diskettes, RAID,
9.2. Optical Disk Storages (DVD, CD ROM),
9.3. Magnetic Types, Backup System,
10. Data Communications
10.1. Data Communication Model
10.2. Data Transmission
10.3. Digital and Analog Transmission
10.4. Modems
10.5. Asynchronous and Synchronous Transmission
10.6. Simplex. Half Duplex, Full Duplex Transmissions
11. Communications
11.1. Medias (Cables, Wireless)
11.2. Protocols, Network Topologies (Star, Bus, Ring)
11.3. LAN, WAN, and MAN
12. Internet
12.1. A Brief History
12.2. Birthplace of ARPA Net
12.3. Web Browser

28 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

12.4. Internet Services provider

12.5. Function and Features of Browse
12.6. Search Engines

• Interactive class session

Teaching-learning
• Hands on practices in class
Strategies
• Brainstorming and group discussion sessions

• Paper based written assignments 4

Assignments
• Coding HTML and CSS 3

Sr. # Elements Weightage Details

1 Formative 25% It is continuous assessment. It

Assessment includes: classroom participation,
attendance, assignments and
presentations, homework, attitude
and behavior, hands-on-activities,
short tests, quizzes etc.

2 Midterm 35% It takes place at the mid-point of

Assessment and
Assessment the semester.
Examinations
3 Final 40% It takes place at the end of the
Assessment semester. It is mostly in the form of
a test, but owing to the nature of
the course the teacher may assess
their students based on term
paper, research proposal
development, field work and report
writing etc.

• Sinha, P. K., & Sinha, P. (2010). Computer fundamentals. BPB

Textbooks
publications.

29 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• Morley, D., & Parker, C. S. (2014). Understanding computers: Today

and tomorrow, comprehensive. Cengage Learning.

• Livesley, R. K. (2017). An introduction to automatic digital

Reference computers. Cambridge University Press.

Material/Suggested • Zawacki-Richter, O., & Latchem, C. (2018). Exploring four decades of

Readings research in Computers & Education. Computers & Education, 122, 136-
152.

• Academic integrity is expected of all students. Plagiarism or

cheating in any assessment will result in at least an F grade in the
course, and possibly more severe penalties.
• You bear all the responsibility for protecting your assignments from
plagiarism. If anyone else submits your assignment or uses your
code in his/her assignment, you will be considered equally
Notes
responsible.
• The instructor reserves the right to modify the grading
scheme/marks division and course outline during the semester.
• There is no makeup for a missed sessional grading instruments like
quizzes, assignments, and homework’s.

30 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Detailed Lecture wise plan

Recommendation
SourceBook
Week Lecture Topic for Learning
(Ch#)
Activities
1 1 Brief History of Computer Ch#1

Four Stages of History

2 Computer Elements and Software Types Ch#1 Assignment

Processor, Memory, Hardware, Software

2 3 Computer Elements and Software Types Ch#2

Processor, Memory, Hardware, Software

4 System Software its Importance and its Ch#3 Quiz

Types, Types of Computer, Super

Computer, Mainframe Compute, Mini
Compute, Micro Compute
3 5 Organizing Computer Facility Ch#4

6 Centralized Computing Ch#4

4 7 Distributed Computing Ch#4 Assignment

8 Input Devices Ch#5

Keyboard and its Types,

Terminal (Dump, Smart, Intelligent),

Dedicated Data Entry

Pointing Devices, Voice Input,

31 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendation
SourceBook
Week Lecture Topic for Learning
(Ch#)
Activities
5 9 Output Devices Ch#5 Quiz

Soft- Hard

Copies, Monitors and its Types, Printers

and its Types, Plotters,

Computer Virus and its Forms,

10 Storage Units, Ch#5

Primary and Secondary Memories,

RAM and its Types

Popular types of RAM

6 11 Cache Memory Ch#5

Cache Memory Importance

12 Type of Cache Memory Ch#5

Hard Disks, Working of Hard Disk

7 13 Diskettes, RAID, Ch#5

Optical Disk Storages (DVD, CD ROM),

Magnetic Types, Backup System,

14 Data Communications Ch#6 Assignment

8 15 Data Communication Model Ch#6

16 Data Transmission Ch#6

Midterm Exams
9 17 Digital and Analog Transmission Ch#9 Quiz

18 Modems

32 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendation
SourceBook
Week Lecture Topic for Learning
(Ch#)
Activities
10 19 Asynchronous and Synchronous Ch#9

Transmission
20 Simplex. Half Duplex, Full Duplex Ch#9

Transmissions
11 21 Communications Ch#9

22 Protocols, Network Topologies (Star, Bus, Ch#11 Assignment

Ring)
12 23 LAN, WAN, and MAN Ch#11

24 Internet Ch#12

13 25 A Brief History Ch#12

26 Birthplace of ARPA Net Ch#12

14 27 Web Browser Ch#13

28 Internet Services provider Ch#14 Quiz

15 29 Internet Services provider Ch#14

30 Function and Features of Browse Ch#14

16 31 Search Engines Ch#14

32 Advanced Search Engines

Final Exam

33 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code GE-167

Course Title Discrete Structures

Theory Lab
Credit Hours
3 0

Lecture Duration 90 minutes (1.5 Hours), 2 lectures per week

Semester 1

Courses Knowledge
Pre-requisites
Nil Python lab Setup

Follow Up Courses Nil

Course Learning Outcomes (CLOs)

CLO No Course Learning Outcome Bloom Taxonomy

Understand the key concepts of Discrete

CLO-1 Structures such as Sets, Permutations, C2 (Understand)
Relations, Graphs and Trees etc.
Apply formal logic proofs and/or informal, but
rigorous, logical reasoning to real problems, C3 (Apply)
CLO-2
such as predicting the behavior of software or
solving problems such as puzzles.
Apply discrete structures into other
computing problems such as formal C3 (Apply)
CLO-3
specification, verification, databases, artificial
intelligence, and cryptography.
Differentiate various discrete structures and
their relevance within the context of computer C4 (Differentiate)
CLO-4
science, in the areas of data structures and
algorithms, in particular
Aims and 1. This course aims to equip the students with an understanding

Objectives and appreciation of the discrete mathematical structures that

34 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

appear in most computer science problems as well as in other

related disciplines
2. In particular, this course seeks to develop critical thinking
skills and the skills for comprehending mathematical
arguments as well for writing rigorous proofs.

• It seeks to polish basic problem solving skills through study of

Learning Outcomes combinatorial problems, predicate calculus and logical reasoning,

abstract algebra, and graph structures.

Logics and Proofs, Sets, Functions, Sequences, Algorithms, Recursion,

Syllabus
Probability, Graphs and Trees

Chapter 01: The Foundations: Logic and Proofs

1.1 Introduction to Discrete Structures
1.2 Application of Propositional Logic
1.3 Propositional Equivalences
1.4 Predicates and Quantifiers
1.5 Nested Quantifiers
1.6 Rules of Inference
Chapter 02: Basic Structures: Sets, Functions, Sequences, Sums, and

Contents Matrices
2.1 Sequences and Summations
2.2 Cardinality of Sets
2.3 Sets, Functions
Chapter 03: Algorithms
3.1 Algorithms
3.2 The Growth of Functions
3.3 Complexity of Algorithms
Chapter 05: Induction and Recursion

35 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

5.1 Mathematical Induction

5.2 Recursive Algorithms
Chapter 06: Counting
6.1 The Basic of Counting
6.2 The Pigeonhole Principle
6.3 Permutations and Combinations
6.4 Binomial Coefficients and Identities
Chapter 07: Discrete Probability
7.1 An Introduction to Discrete Probability
7.2 Probability Theory
Chapter 09: Relations
9.1 Relations and their properties
9.2 Closure of Relations
9.3 Equivalence Relation
9.4 Partial Ordering
Chapter 10: Graphs
10.1 Graphs and Graph Models
10.2 Graph Isomorphism, Graph Connectivity
10.3 Eulerian, Hamiltonian paths and circuits
10.4 Shortest path problems (dijkstra algorithm)
Chapter 11: Trees
11.1 Introduction to Trees, properties of trees
11.2 Applications of Trees
11.3 Tree Traversals

• Late submissions will not be accepted.

• Assignments should be turned in at the start of the class.
Assignments
• Zero credit for turning in questions other than the assigned
questions.

36 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Sr. # Elements Weightage Details

1 Quizzes + 25% There will be a graded quiz and

Assignment assignments. The term project will be
+ Term framed so as to test the concepts
Assessment and Project involved in the lectures.
Examinations
2 Midterm 35% It takes place at the mid-point of the
Assessment semester.

3 Final 40% It takes place at the end of the

Assessment semester.
• Discrete Mathematics & its Applications with Combinatory and
Textbooks
Graph Theory, 7th edition, Kenneth H. Rosen

Reference
Material/Suggested
• N/A
Readings

37 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Detailed Lecture wise plan

SourceB Recommendation
Week Lecture Topic ook for Learning
(Ch#) Activities
1 1 Introduction to discrete mathematics Ch#(01)

2 Introduction to propositional logic Ch#(01) Assign-1

2 3 Application of propositional logic Ch#(01)

Quiz#1
4 Consistent System Specifications Ch#(01)
Propositional Equivalences
3 5 Propositional Equivalences Ch#(01) Quiz#2

6 Propositional Equivalences Ch#(01)

4 7 Predicates and Quantifiers Ch#(01) Assign-2

8 Nested quantifiers Ch#(01)

Rules of inference
5 9 Sets, Functions Ch#(02) Quiz#3

10 Cardinality of Sets Ch#(02)

6 11 Sequences and Summations Ch#(02)

12 Algorithms Ch#(03)

7 13 The Growth of Functions Ch#(03) Quiz#4

14 Complexity of Algorithms Ch#(03)

8 15 Mathematical induction Ch#(05) Assign-3

16 Recursion and Recursive algorithms Ch#(05)

MID TERM
9 17 The Basic of Counting Ch#(06)

18 The Pigeonhole principle. Ch#(06)

10 19 Permutations and combinations Ch#(06) Assign-4

20 Binomial coefficients and identities Ch#(06)

11 21 An Introduction to Discrete Probability Ch#(07)

22 Probability Theory Ch#(07) Quiz#5

38 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

SourceB Recommendation
Week Lecture Topic ook for Learning
(Ch#) Activities
12 23 Relations, Closure of relations Ch#(09) Assign-5

24 Equivalence Relation Ch#(09)

13 25 Partial Ordering Ch#(09)

26 Graphs and Graph representation Ch#(10)

Quiz#7
14 27 Graph Isomorphism, Graph Connectivity Ch#(10)

28 Eulerian, Hamiltonian paths and circuits Ch#(10)

15 29 Shortest path problems (dijkstra algorithm) Ch#(10) Quiz#8

30 Shortest path problems (dijkstra algorithm) Ch#(10)

16 31 Introduction to trees, properties of trees Ch#(11) Assign-6

32 Applications of Trees, Tree traversals Ch#(11)

FINAL TERM

39 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code CC-112

Course Title Programming Fundamentals

Theory Lab
Credit Hours
3 1

Lecture Duration 90 minutes (1.5 Hours), 2 lectures per week, 1 LAB per week

Semester 1

Pre-requisites Courses Knowledge

course / skills Nil Nil

Follow Up Courses Object Oriented Programming

Course Learning Outcomes (CLOs)

CLO No Course Learning Outcome Bloom Taxonomy

CLO-1 Understand basic problem-solving steps and logic constructs C2 (Understand)

CLO-2 Apply basic programming concepts C3 (Apply)

CLO-3 Design and implement algorithms to solve real-world problems C3 (Solve)

1. Students should be able to translate their basic pseudo-code/flow-

charts into some programming language that computer can
understand so that they can get real feel of their efforts.

Objectives 2. Student can translate of their logic into some programming

language.
3. Students can learn basic principles of attacking a problem, a bit of
performance factor and some basic structured design principles.

40 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

4. Students should be ready to take Object Oriented Programming

course.

• Students can write a program.

• Students should be able to translate a computation problem into
program.
Learning Outcomes
• Student can familiar with C++.
• Student can design and implement algorithms to solve real world
problems.

Topics: Flowcharts/Pseudo Codes, Basic C++ Language Constructs: Data

types, Variable and Constants, Operator and Expressions, Input and Output
(I/O), Formatted I/O, Escape Sequences. Structured Programming in C
Language: Decision making using if control structure, Repetition using for
and do while, multiple selection using switch and logical operators.
Procedural Programming in C Language: functions, prototype, parameter
and arguments, call by value and call by reference, library and header files,
scope and life time of variables (storage classes), recursion. Composite
Syllabus data types arrays: definition, processing, and passing of array to a function,
multidimensional arrays, searching and sorting. Pointers: pointer
definition, pointer arithmetic, constant pointers, pointer and arrays.
Strings: string and characters, string conversion functions, Dynamic
Memory Allocation. User Defined Data Types: structures, definition,
initialization, accessing members of structures, typedef, union and bitwise
operators, enumerations. C File Processing: files and streams, Sequential
Access File, Random Access File, Secondary Storage I/O. Miscellaneous
Topics: Command Line Arguments.

1. Flow Charts/Pseudo Code

Contents
1.1. Sequence, Conditions, Repetition

41 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

2. C++ Programming Language Introduction

3. Hello world in C++, COUT
3.1. Difference between Variables and Literals, Identifiers
4. Data Types
5. Cin, extraction operator
6. Formatted Output
7. Selection:
7.1. Relational operators and expression
7.2. If, if-else, switch
8. Repetition:
8.1. Loop, While, For, Do while
8.2. Sentinel-controlled loops, Nested loops
8.3. Increment and decrement operator
9. Function:
9.1. Defining, Calling, function prototype, passing arguments by value
9.2. Local and global variables, Static variables,
9.3. Default arguments
9.4. Overloading functions
10. Arrays:
10.1. Parallel Arrays, 2D Arrays
11. Pointers
12. CString
13. Structs, Union
14. Text and Binary File I/O

• Interactive class session

Teaching-learning • Hands on practices in class

Strategies • Brainstorming and Group discussion sessions

• Coding in LABS

42 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Assignments Coding Assignments 5

Sr. # Elements Weightage Details

1 Formative 25% It is continuous assessment. It includes:

Assessment classroom participation, attendance,
assignments and presentations,
homework, attitude and behavior,
hands-on-activities, short tests, quizzes
etc.

Assessment and 2 Midterm 35% It takes place at the mid-point of the

Examinations Assessment semester.

3 Final 40% It takes place at the end of the

Assessment semester. It is mostly in the form of a
test, but owing to the nature of the
course the teacher may assess their
students based on term paper, research
proposal development, field work and
report writing etc.

• Gaddis, T., & Sengupta, P. (2012). Starting Out with C++: From
Textbooks Control Structures Through Objects. Pearson.

• R1. Reference from different books enlisted in reference material

will be given as required or lecture notes for reading will be
Reference
provided.
Material/Suggested
• R2. Malik, D. S. (2011). JavaTM Programming: From Problem
Readings
Analysis to Program Design. Cengage Learning.
• R3. Ritchie, D. M., Kernighan, B. W., & Lesk, M. E. (1988). The C
programming language. Englewood Cliffs: Prentice Hall.

43 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• Handout provided by the teacher.

44 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Detailed Lecture wise plan

Recomme
ndation
Wee Lectur SourceBook
Topic for
k e (Ch#)
Learning
Activities
1 1 Introduction to the Course:
Role of Course in the Degree.
Pseudo Code: Sequence
2 Flow Charts/Pseudo Code: Conditions Conditional Assign-1
Structure
2 3 Flow Charts/Pseudo Code: Repetition Repetition
Structure Quiz#1
4 Flow Charts/Pseudo Code: Repetition Repetition
Structure
3 5 Flow Charts/Pseudo Code: Repetition Repetition Quiz#2
Structure
6 C++ Programming Language: Introduction, A- (1.3) Assign-2
History, and
Significance. Setting up Programming/Compiling
Environment
Program Development Life Cycle: Editing,
Compiling,
Linking, Loading and Execution. Source file, Object
Files, and Executable files.
4 7 Introduction to C++: Hello world program, cout, A- (2.1- Quiz#3
insertion operator, Escape sequences, #include; 2.3)
Difference between Variables and Literals,
Identifiers
8 Data types: short, int, long, char, float, double, A- (2.5-
bool; 2.7,
sizeof operator; Variable assignment and 2.9-
initialization; 2.16)
Arithmetic operators; Comments;

5 9 Taking input: cin, extraction operator and its A- (3.1- Quiz#4

properties; 3.6)
Concept buffered input; Reading c-strings,
Arithmetic expressions: operator precedence and
associativity; Library functions: power; Overflow,
Underflow, Type coercion, Type casting, Named
constants: const, #define; Multiple assignment

45 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recomme
ndation
Wee Lectur SourceBook
Topic for
k e (Ch#)
Learning
Activities
10 Formatted output: setw, setprecision, fixed, A- (3.7-
showpoint, 3.13)
left, right
Formatted input: cin.get, cin.getline, cin.ignore;
Random number generation
6 11 Selection: Relational operators and expressions, A- (4.1-
Truth 4.12)
values, if, if-else, nested if, if-else if, Logical
operators,
Input validation, Scope
12 Selection: Comparing strings (strcmp), Conditional A- (4.13-
operator, switch statement 4.16) Quiz#5

7 13 Repetition: Increment and decrement operators, A- (5.1-

while 5.6)
loop, Input validation

14 Repetition: Sentinel-controlled loops, Nested A- (5.7,

loops, 5.8,
break, continue 5.11-
5.13)

8 15 Functions: Motivation, Defining, Calling, Function A- (6.1- Quiz#6

prototype, Passing arguments by value 6.9)
16 Passing arguments by reference, Introduction to R1
Pointers
9 17 Functions: Local and global variables, Static A- (6.10-
variables, 6.12,
Default arguments 6.14-
Overloading functions 6.16)

18 Arrays: Introduction, Declaration, Subscripts, A- (7.1- Quiz#7

Input 7.5,
and output, No bounds checking, Array 7.7)
initialization

46 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recomme
ndation
Wee Lectur SourceBook
Topic for
k e (Ch#)
Learning
Activities
10 19 Parallel Arrays A- (7.6,
Searching (Linear, Binary), Sorting (Selection Sort) 9)
Pointer Data Type Significance
Pointer Arithmetic, working of index operator
20 Two-D arrays, Mapping formulae for 1-D and 2-D A- (7.8-
array 7.10) Assign-3
Character Arrays
Array of character arrays (2-D character arrays)
11 21 Pointers: Using const with pointers, Heap: A- (9)
Dynamic Quiz#8
memory allocation (new and delete), Dangling
pointers

22 Pointers: Dangling pointers, Memory leak, Pointer A- (9)

to
pointer (Multiple indirection), Dynamically
allocating a
2-D array
12 23 Alias A- (10) Assign-4
C-Strings: Library functions (strlen, strcpy, strcat,
strncpy, strncat, strstr), Conversion (atoi, atol,
atof, itoa), strtok
24 Structs: Declaration, Accessing members, A- (11)
Initialization,
Arrays of structs, Nested structs,
Passing/returning
structs to/from functions
13 25 Structs: Pointer to struct, Dynamic allocation, A- (11) Quiz#9
Pointer member variables;
26 Structs: Case Study R1

14 27 Unions, Enumerated Data Type A- (11)

Quiz#10
28 Streams: Text, Binary A- (12.1-
Text data reading writing 12.4)

47 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recomme
ndation
Wee Lectur SourceBook
Topic for
k e (Ch#)
Learning
Activities
15 29 Text File Assign-5
R1
30 Binary File I/O: get, put, read, write A- (12) Quiz # 11
Binary File I/O:
16 31 Creating records with structures, Random access R1
files
(seekg, seekp, tellg, tellp)

Binary File I/O: Opening a file for both input and

output
32 Binary File and Structs R1
Case Study

48 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code CC-211

Course Title Object Oriented Programming

Theory Lab
Credit Hours
3 1

Lecture Duration 90 minutes (1.5 Hours), 2 lectures per week, 3 hours lab session per week

Semester 2

Courses Knowledge

Students should know how to

Pre-requisites
Programming Fundamentals program in C++, Structural
programming in C++.

Follow Up Courses Data Structures

Course Learning Outcomes (CLOs)

CLO No Course Learning Outcome Bloom Taxonomy

CLO-1 Understand principles of object-oriented paradigm. C2 (Understand)

Identify the objects & their relationships to build C3 (Identify)
CLO-2
object-oriented solution.
Model a solution for a given problem using object- C3 (Apply)
CLO-3
oriented principles.
CLO-4 Examine an object-oriented solution. C4 (Examine)
1. To equip the learner with the philosophy and necessary skills to
formulate solutions of real world problems using object oriented

Objectives paradigm.
2. Justify the philosophy of object-oriented design and the concepts of
encapsulation, abstraction, inheritance, and polymorphism.

49 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

3. Strong concepts of object manipulation and dynamic memory

allocation within classes

• Students can formulate solutions of real world problems using

object oriented paradigm.
• Students should be able to translate a real world problem to object
Learning Outcomes
oriented model.
• Student can familiar with encapsulation, abstraction, inheritance,
and polymorphism concepts.

Modular vs. Object-Oriented Paradigm, Abstraction, Encapsulation,

Information hiding; Classes and Objects with C++: Data members, Member
functions, Public/private access, Constructors, Destructors, Overloaded
constructors, Constant member functions, Arrays of objects (both static
and dynamic), Objects as arguments, Returning objects from functions,
Copy constructor, Pointers as member variables, Shallow copy vs. Deep
copy, Destructor, this pointer, Constant member variables, Constant
objects, Static member variables, Static member functions; Operator
Overloading: Simple binary operators, Overloading assignment operator
for classes with dynamic memory allocation, Overloading logical and unary
Syllabus
operators, Friend functions, Overloading operators as friend functions,
Overloading stream insertion and extraction operators, Some other
operators; I/O and File Processing: Text filing, Binary filing; Aggregation
and Composition: Classes within classes, UML, Constructor, destructor
calling sequence; Inheritance: Basics, Examples, UML, Public inheritance,
Protected access specifier, Public inheritance vs. private and protected
inheritance, Multiple inheritance, Diamond problem, Virtual inheritance,
Writing copy constructors and overloading assignment operator for
derived classes; Inheritance and Polymorphism: Virtual functions, Static vs.
dynamic binding, Pure virtual functions, Abstract classes, Examples;

50 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Templates: Function templates, Class templates; Exceptions and Exception

handling; Recursion: Basics, Examples

1. Introduction to Object Oriented Concepts

1.1. Real world examples
2. Define the keyword ‘class’
2.1. Access modifiers
2.2. Setter/Mutator and Getter/Accessor methods
2.3. Constructor & Destructor
3. Pointer/Reference to objects
4. Preventing changes in data members from a method
4.1. Constant method
4.2. Constant data members
5. Static functions
6. Static data members
7. constant and static objects

Contents 8. Calling sequence of Constructor & Destructor for constant and static
objects
9. Composition/Aggregation Cont...
10. Nameless objects
11. Array of objects;
12. Operator Overloading
13. Friend functions
14. Inheritance
14.1. Multilevel Inheritance
14.2. Private Inheritance
15. Polymorphism
15.1. Pure virtual functions and abstract class
16. Diamond inheritance
17. Virtual inheritance

51 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

18. Template
18.1. Templated Function
18.2. Templated Class
19. Exception handling

• Interactive class session

Teaching-learning • Hands on practices in class

Strategies • Brainstorming and Group discussion sessions

• Coding in LABS

Assignments Coding Assignments 5

Sr. # Elements Weightage Details

1 Formative 25% It is continuous assessment. It includes:

Assessment classroom participation, attendance,
assignments and presentations,
homework, attitude and behavior,
hands-on-activities, short tests, quizzes
etc.

Assessment and 2 Midterm 35% It takes place at the mid-point of the

Examinations Assessment semester.

3 Final 40% It takes place at the end of the

Assessment semester. It is mostly in the form of a
test, but owing to the nature of the
course the teacher may assess their
students based on term paper, research
proposal development, field work and
report writing etc.

52 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• A. Deitel, H. M., & Deitel, P. J. (2010). C++ How to Program 6 th

Edition. Prentice Hall.
Textbooks • B. Gaddis, T., & Sengupta, P. (2012). Starting Out with C++: From
Control Structures Through Objects. Pearson.

Reference
• R1. Handouts.
Material/Suggested • R2. Shtern, V. (2000). Core C++: A software engineering Approach.
Prentice Hall.,
Readings
• R3. Prata, S. (2002). C++ primer plus. Sams Publishing.
• R4. Stroustrup, B. (2013). The C++ Programming Language

53 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Detailed Lecture wise plan

Recomme
ndation
Source Book
Week Lecture Topic for
(Ch#)
Learning
Activities
1 1 Course Introduction B (9,10)
Overview/Extension of/to Programming
Fundamentals
• Function Atomicity (Cohesion/Coupling)
Pointer/Alias
2 Overview/Extension of/to PF Cont... B (9,10)
Pointer/Alias, Arrays, Dynamic Memory
Allocation
2 3 Overview/Extension of/to PF Cont... B (11)
• C structs: Data Driven Programming Quiz#1
o Use/Benefits of Data Driven
Programming
struct keyword
4 Overview/Extension of/to PF Cont... B (11)
• C structs: Data Driven Programming
o Struct as other struct members
Array of structs
3 5 Overview/Extension of/to PF Cont... B (11) Quiz#2
• C structs: Data Driven Programming Assign-1
struct objects on heap
6 Overview/Extension of/to PF Cont... R2-(Ch-1 –
• PF constructs: enum, union Remedy-3)
Introduction to Object Oriented Concepts R2-(Ch-8)
and Terminology: Real world examples
4 7 Define the keyword ‘class’ A-(Ch-3
(3.1~3.6))
Access modifiers: private and public only;
First Member function;
Data Abstraction through Encapsulation;
Setter/Mutator and Getter/Accessor
methods;

54 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recomme
ndation
Source Book
Week Lecture Topic for
(Ch#)
Learning
Activities
8 Two Special Method: Constructor & A-(Ch-3
Destructor; (3.7~3.11)) Quiz#3
A-(Ch-9 (9.1 ~
Constructor with No argument (Default
9.6))
Constructor);
Constructor with Default arguments
Constructor Delegation
5 9 Pointer as data member A-(Ch-9 (9.7 ~
9.12))
Pointer/Reference to objects,
A-(Chapter-
Passing objects to functions by reference 10.5, 10.6)
Pointer this
Importance of destructor
Calling sequence of Constructor & Destructor
for multiple objects
10 Passing objects to functions by value, R1 Quiz#4
Default Member-wise copy (Assignment &
Initialization),
Problem of Member-wise copy & its solution:
Copy Constructor,
Calling sequence of Constructor &
Destructor: when objects are passed by
value/reference
6 11 Preventing changes in data members from a A-(Chapter
method: const method; 10.2, 10.7)
Constant data members
Static functions
Static data members
constant and static objects
Calling sequence of Constructor & Destructor
for constant and static objects
12 Object as data member (Composition), A-(Chapter
Aggregation; 10.3) Quiz#5
R2-(Chapter
Cascading calls with and without this pointer.
12)

55 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recomme
ndation
Source Book
Week Lecture Topic for
(Ch#)
Learning
Activities
7 13 Composition/Aggregation Cont... A-(Chapter
10.3)
Nameless objects
R2-(Chapter
Array of objects;
12)
14 Operator Overloading; A-(Chapter
Binary Operator receiving Instance of class as 11.7)
1st operand
8 15 Overloading Unary Operator: as member, as A-(Chapter Quiz#6
non-member 11.11)
Unusual Operators: ++, --,
16 [ ] (set & get, both versions), type-cast, A-(Chapter Assign-2
Parentheses 11.8, 11.9)
9 17 Friend functions (efficient but shake the A-(Chapter
concept of encapsulation); 10.4)
Declaring a global function as friend of a
class;
Declaring member function of a class as
friend of another class
Friend class (an easy but more un-secure
way);
18 Operator NOT receiving Instance of class as A-(Chapter Quiz#7
1st operand Overloading Binary Operators 11.5)
(Stream Insertion/Extraction) for I/O stream
10 19 In theory what is inheritance A-(Chapter
12.1~12.4)
is-A Relationship: Public Inheritance
R2-(Chapter
Protected data member 14)
protected, private inheritance
20 Multilevel Inheritance: Direct and Indirect A-(Chapter
Base Class 12.5, 12.6) Assign-3
Case Study-A
Calling of Constructor and Destructor for
Derived Class Objects;
Explicit call to the constructor of Base class
from Derived class;

56 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recomme
ndation
Source Book
Week Lecture Topic for
(Ch#)
Learning
Activities
11 21 Review of Simple Inheritance, Multi Level A-(Chapter
Inheritance, Multiple Inheritance 12) Quiz#8
Case Study-B
A review of OO relationships terminologies:
Aggregation, composition, generalization (is-
A), knows-a.
22 Polymorphism: Overriding base-class A-(Chapter
members in derived class; Virtual functions 13)
R1-Reading
and Dynamic binding;
Material
Concept of v-Pointer and v-Table
Case Study-B
12 23 Pure virtual functions and abstract class; R1-Reading Assign-4
Defining a pure virtual destructor Material
24 Detail discussion on v-table structure, virtual R1-Reading
constructor, object cloning Material
13 25 Some tricky things in pointer type casting and R1-Reading Quiz#9
applying them on different topics studied so Material
far.
26 Diamond inheritance R1-Reading
Virtual inheritance Material

14 27 C++ Streams, Members and Manipulators of R1-Reading

Streams; Material Quiz#10
A-(Chapter
File Handling using Streams
Chapter-15)
28 Access Techniques: Sequential, Direct, and R1-Reading
Random Access Files; Material
A-(Chapter
Input/Output of Object from/to File (binary/
Chapter-17)
text mode);
15 29 Function Template; A-(Chapter Assign-5
14.2,14.3)
Overloading of Function Template;
Specialized of Template Function
30 Class Template; A-(Chapter Quiz # 11
14.4, 14.5)
Specialized method of Template Class;
Complete Specialized Template Class

57 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recomme
ndation
Source Book
Week Lecture Topic for
(Ch#)
Learning
Activities
16 31 Friendship and Inheritance with Templates A-(Chapter
14.6, 14.7,
14.8)
32 What is Exception? Error vs. Exception; A-(Chapter
16)
Evolution of Exception Handling: exit, abort,
assert, new-keywords;
try, catch, throw
Unhandled Exception;
Propagation of Exception and its advantage

58 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code CC-215

Course Title Database Systems

Theory Lab
Credit Hours
3 1

Lecture Duration 90 minutes (1.5 Hours), 2 lectures per week, 3 hours lab session per week

Semester 3

Courses Knowledge
Pre-requisites
Nil Nil

Follow Up Courses Advanced Database Management System

Upon completion of this course, the student will be able to:

Aims and
1. Grasp the theory of database design
Objectives 2. Should be able to design a database
3. Should be able to write queries
Course Learning Outcomes (CLOs)
CLO No Course Learning Outcome Bloom Taxonomy

CLO-1 Explain fundamental database concepts. C2 (Explain)

CLO-2 Design conceptual, logical and physical database

C5 (Design)
schemas using different data models.

CLO-3 Identify functional dependencies and resolve

C2 (Identify)
database anomalies by normalizing database tables.

CLO-4 Use Structured Query Language (SQL) for database

C4 (Use)
definition and manipulation in any DBMS
At the end of the course, you should be able to:
Learning Outcomes •
Explain fundamental database concepts.
• Design conceptual, logical and physical database schemas using different
data models.

59 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• Identify functional dependencies and resolve database anomalies by

normalizing database tables.
• Use Structured Query Language (SQL) for database definition and
manipulation in any DBMS

1. Introduction
1.1. Basic database concepts
1.2. Database approach
1.3. File based system
2. Database architecture
2.1. Three level schema architecture
2.2. Data independence
3. Relational data model
3.1. Attributes
3.2. Schemas
3.3. Tuples
3.4. Domains

Contents 3.5. Relation instances

4. Details of relational data model
4.1. Keys of relations
4.2. Integrity constraints
5. Relational algebra
5.1. Selection
5.2. Projection
5.3. Cartesian product
5.4. Types of joins
6. Normalization
6.1. Functional dependencies
6.2. Normal forms
7. Entity relationship model

60 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

7.1. Entity sets

7.2. Attributes
7.3. Relationship
8. Structured Query Language (SQL)
8.1. Joins
8.2. Sub-queries in SQL
8.3. Grouping SQL
8.4. Aggregation in SQL
9. Concurrency control
9.1. Database backup
9.2. Recovery
9.3. Indexes
9.4. NoSQL systems.

• Interactive class session

Teaching-learning • Hands on practices in class

Strategies • Brainstorming and Group discussion sessions

• Paper based written assignments 3

Assignments • Project 2
• Quiz 4

Sr. # Elements Weightage Details

1 Formative 25% It is continuous

assessment. It includes:
Assessment
Assessment and classroom participation,
attendance, assignments
Examinations
and presentations,
homework, attitude and
behavior, hands-on-
activities, short tests,
quizzes etc.

61 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

2 Midterm 35% It takes place at the mid-

point of the semester.
Assessment

3 Final 40% It takes place at the end

of the semester. It is
Assessment
mostly in the form of a
test, but owing to the
nature of the course the
teacher may assess their
students based on term
paper.
• Database Systems: A Practical Approach to Design, Implementation, and
Management, 6th Edition by Thomas Connolly and Carolyn Begg
• Database Systems: The Complete Book, 2nd Edition by Hector Garcia-
Textbooks & Molina, Jeffrey D. Ullman, Jennifer Widom
• Database System Concepts, 6th Edition by Avi Silberschatz, Henry F. Korth
Reference material and S. Sudarshan.
• Database Management Systems, 3rd Edition by Raghu Ramakrishnan,
Johannes Gehrke

• The instructor reserves the right to modify the grading scheme/marks

Notes division and course outline during the semester.

62 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code CC-213

Course Title Data Structures

Theory Lab
Credit Hours
3 1

Lecture Duration 90 minutes (1.5 Hours), 2 lectures per week, 3 hours lab session per week

Semester 3

Courses Knowledge
Pre-requisites
Programming Fundamentals Nil

Follow Up Courses Operating Systems, Analysis of Algorithms

Course Learning Outcomes (CLOs):

CLO No Course Learning Outcome Bloom Taxonomy

Implement various data structures and their algorithms

CLO-1 C3 (Apply)
and apply them in implementing simple applications
Analyze simple algorithms and determine their
CLO-2 C5 (Analyze)
complexities.
Apply the knowledge of data structure to other
CLO-3 C3 (Apply)
application domains.
Design new data structures and algorithms to solve
CLO-4 C6 (Design)
problems.
1. To introduce data structures as basic building blocks of large
programs.

Aims and 2. To learn the commonly used data structures.

Objectives 3. To introduce the notion of time and space complexity.

4. To develop the skills to analyze time and space requirements for a
data structure and associated algorithms.

63 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

5. To prepare the students to pick the right data structure for a given
problem.

• Implement various data structures and their algorithms and apply

them in implementing simple applications
• Analyze simple algorithms and determine their complexities.
Learning Outcomes
• Apply the knowledge of data structure to other application
domains.
• Design new data structures and algorithms to solve problems.

Abstract data types, complexity analysis, Big Oh notation, Stacks (linked

lists and array implementations), Recursion and analyzing recursive
algorithms, divide and conquer algorithms, Sorting algorithms (selection,
insertion, merge, quick, bubble, heap, shell, radix, bucket), queue,
dequeuer, priority queues (linked and array implementations of queues),
Syllabus linked list & its various types, sorted linked list, searching an unsorted
array, binary search for sorted arrays, hashing and indexing, open
addressing and chaining, trees and tree traversals, binary search trees,
heaps, M-way tress, balanced trees, graphs, breadth-first and depth-first
traversal, topological order, shortest path, adjacency matrix and adjacency
list implementations, memory management and garbage collection.

1. Collections, Abstract data types, Complexity analysis, Big Oh

notation
2. Recursion and analyzing recursive algorithms, divide and conquer
algorithms
Contents
3. Sorting algorithms (selection, insertion, merge, quick, bubble, heap,
shell, radix, bucket)
4. Array vs. Linked representation of Collections
5. Stacks (linked lists and array implementations)

64 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

6. Queue (linked lists and array implementations), Introduction to

priority queues
7. Lists (linked and array implementations), Various types of linked lists,
sorted linked list
8. Trees and tree traversals, binary search trees, heaps, M-way tress,
balanced trees
9. Heaps and priority queues
10. Graphs, breadth-first and depth-first traversal, topological order,
shortest path, adjacency matrix and adjacency list implementations
11. Searching an unsorted array, binary search for sorted arrays, hashing
and indexing, open addressing and chaining
• Memory management and garbage collection.

• Interactive class session

Teaching-learning • Hands on practices in class

Strategies • Brainstorming and Group discussion sessions

• Coding in LABS

• Paper based written assignments 4

Assignments
• Coding assignments 6

Sr. # Elements Weightage Details

1 Formative 25% It is continuous assessment. It includes:

Assessment classroom participation, attendance,
assignments and presentations,
Assessment and
homework, attitude and behavior,
Examinations
hands-on-activities, short tests, quizzes
etc.

2 Midterm 35% It takes place at the mid-point of the

Assessment semester.

65 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

3 Final 40% It takes place at the end of the

Assessment semester. It is mostly in the form of a
test, but owing to the nature of the
course the teacher may assess their
students based on term paper, research
proposal development, field work and
report writing etc.

• Data Structures and Algorithm Analysis in C++ by Mark Allen Weiss

Textbooks

• Data Structures and Algorithms in C++ by Adam Drozdek

• Data Structures and Algorithm Analysis in Java by Mark A. Weiss
Reference
• Data Structures and Abstractions with Java by Frank M. Carrano &
Material/Suggested
Timothy M. Henry
Readings
• Java Software Structures: Designing and Using Data Structures by
John Lewis and Joseph Chase

• Academic integrity is expected of all students. Plagiarism or

cheating in any assessment will result in at least an F grade in the
course, and possibly more severe penalties.
• You bear all the responsibility for protecting your assignments from
plagiarism. If anyone else submits your assignment or uses your
code in his/her assignment, you will be considered equally
Notes
responsible.
• The instructor reserves the right to modify the grading
scheme/marks division and course outline during the semester.
• Introductory knowledge of using the computers is assumed for this
course. All code written in quizzes, assignments, homework’s, and
exams must be in JavaScript. Code must be intelligently

66 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

documented (commented). Undocumented code may not be given

any credit.
• The IDE use is not allowed, Notepad++ has to be used for coding.
• There is no makeup for a missed sessional grading instruments like
quizzes, assignments, and homework’s.

67 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Detailed Lecture wise plan

Recommendat
Lectur ion for
Week Topic SourceBook
e Learning
Activities
Introduction to Data Structures;
Role of Data Structures in
1 Computer Science
Defining Algorithm: Properties of
Algorithm
Introduction to Algorithm's Performance
1 Analysis and Measurement Learning to
Calculate Running Time of Different Code
2
Snippets, Examples i.e. Binary search,
Selection sort etc;
3 More on Step Counting (Big Oh Notation)
Case Study: Polynomial as ADT: Take it as
sample application to decide its structure
2 4 and operations and also calculating the
step counting of its operations.
(Arrays)Matrix, Row major and column
major Representation of N-Dimensional
5
Arrays in different Languages.
3
6 Sparse Matrices
The Stack ADT, Applications of Stack:
7 Function Call Stack, Usage of Stack in
different CS Applications.
4
Application of Stack: Expressions
8
Evaluation
Queues: Linear/Circular, Applications of
9
Queue.
Recursive Definition and Processes,
5
10 Direct Recursion, Learning the Recursive
Trace
Recursion Continued: Binary Search,
Exiting from Maze, Towers of Hanoi and
11
Islamic Fractals as an example
6
12 Recursion Continued:
Review of Dynamic Memory Allocation;
13 Object Manipulation of Self Referential
objects
7 Linear Single Link List Linked
14 Stacks/Queues Linear Double Link List

68 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
Lectur ion for
Week Topic SourceBook
e Learning
Activities

Circular Single Link List, Circular Double

8 15 Link List Container vs Iterator:
Defining Iterator for Link List
Array-based implementation of Link-
16
based Structures, Generalized Lists
Midterm Exam
Introduction to Trees, Tree Terminology,
Logical construction and
Representation of Trees, Introduction
to Binary Tree ADT, Mathematical
17 properties
Tree Traversals
9 Array-Based Implementation of Binary
Trees (Insertion and Traversing)
Linked Implementation of Binary Trees
18 (Insertion, Traversing, Searching and
deletion in Binary Trees)
Linked Implementation of Binary Trees
19
Continued:
10 Binary Search Tree: Mathematical
20
Properties and its implementation
Height Balance Trees: AVL Tree: Insertion
21
in AVL
11
22 Deletion Operation in AVL
Heaps (MinHeap and MaxHeap) Heaps as
23
Priority Queues
12
24 Heap continued: (Min-Max Heap, Deaps)
Introduction to graph and
related terminology
25 Representation of Graphs
13 Elementary Graph Operations, DFS, BFS
26 Spanning Trees Connectivity in Graphs
27 Hashing and Overflow Handling
14 28 Hashing continued…
Introduction to Sorting types and
Techniques, Logical and Algorithmic
29 Implementation of Bubble, Insertion,
15
Selection, Merge, and Quick Sort

69 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
Lectur ion for
Week Topic SourceBook
e Learning
Activities
30 Sorting Continued…
Balanced Search Trees:
Theoretical Comprehension of
Insertion/Deletion Operations in
31
16 Balanced-Search Trees; 2-3:Tree
insertion
Balanced Search Trees cont…: 2-3 Tree
32
Deletion
Final Exam

70 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code CC-311

Course Title Operating Systems

Theory Lab
Credit Hours
3 1

Lecture Duration 90 minutes (1.5 Hours), 2 lectures per week, 3 hours lab session per week

Semester 5

Courses Knowledge
Pre-requisites
Data Structures and Algorithms

Follow Up Courses System Programming

Course Learning Outcomes (CLOs)

CLO No Course Learning Outcome Bloom Taxonomy

Acquire the basic knowledge of computer organization

CLO-1 computer architecture and assembly language. C2 (Understand)

Understand the concepts of basic computer organization,

CLO-2 architecture, and assembly language techniques C2 (Understand)

Solve the problems related to computer organization and

CLO-3 assembly language C3 (Apply)

Aims and 1. To understand the internals of operating system and practically access
its services to have a clear understanding of the working of OS Kernel
Objectives

71 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• Understand the characteristics of different structures of the Operating

Systems and identify the core functions of the Operating Systems
(Understand)
• Analyze and evaluate the algorithms of the core functions of the
Learning Outcomes Operating Systems and explain the major performance issues with
regard to the core functions (Evaluate)
• Demonstrate the knowledge in applying system software and tools
available in modern operating systems (Demonstrate)

Operating systems basics, system calls, process concept and scheduling,

inter-process communication, multithreaded programming, multithreading
models, threading issues, process scheduling algorithms, thread scheduling,
multiple-processor scheduling, synchronization, critical section,
synchronization hardware, synchronization problems, deadlocks, detecting
and recovering from deadlocks, memory management, swapping,
contiguous memory allocation, segmentation & paging, virtual memory
Syllabus management, demand paging, thrashing, memory-mapped files, file
systems, file concept, directory and disk structure, directory
implementation, free space management, disk structure and scheduling,
swap space management, system protection, virtual machines, operating
system security

Section 1:
- Introduction
- Intro to Linux Environment
- Program v/s Process
- Process Management
Section 2:
- I/O Redirection and IPC
- Thread Management
Contents
Section 3:
- Introduction to Synchronization
- S/W-based and H/W-based CSP Solutions
- Synchronization using Semaphore
- Synchronization using Monitor
- Deadlocks
Section 4:
- Memory
- Paging

72 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

- Virtual Memory
Section 5:
- Disk Geometry and Partitioning
- Disk Formatting and File System Monitoring
- File-System Architecture
- File Permissions
• Lectures
Teaching-learning • Case Studies
Strategies • Project
• Assignments
Assignments Types and Number with calendar

Sr. # Elements Weightage Details

1 Formative 25% It is continuous assessment. It includes:

Assessment classroom participation, attendance,
assignments and presentations,
homework, attitude and behavior,
hands-on-activities, short tests, quizzes
etc.

Assessment and 2 Midterm 35% It takes place at the mid-point of the

Examinations Assessment semester.

3 Final 40% It takes place at the end of the semester.

Assessment It is mostly in the form of a test, but
owing to the nature of the course the
teacher may assess their students based
on term paper, research proposal
development, field work and report
writing etc.

A. Operating System Concepts, by Galvin, Gagne, 10th Edition

Textbooks
Silberschatz, Published in 2019, ISBN- 978-1-118-06333-0

73 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

B. Modern Operating Systems, by Andrew S. Tanenbaum, 4th edition,

Published in 2016, ISBN- 9789332575776
Reference
C. Operating Systems, Internals and Design Principles, by William Stallings,
Material/Suggested 9th edition,Published in 2017, ISBN-13: 978-0134670959
Readings
D. Dr. Muhammad Arif Butt, OS -Video Lectures:
https://www.youtube.com/c/LearnWithArif/playlists

Notes

74 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Detailed Lecture wise plan

Recommendat
SourceBook ion for
Week Lecture Topic
(Ch#) Learning
Activities
1 1 Introduction to course, pre-requisite,
policies, tools, and grading system. What is
an Operating System (OS) and why it is
needed to manage h/w? Operating System
Text A-Ch1
services, interrupts, traps and signals. Dual
mode operations and protection
mechanism. Types of operating systems
and computing environments
2 Introduction to virtualization and
hypervisors. Installing Linux (Ubuntu, Kali,
CentOS) on Virtualbox. Introduction to
Linux command line interface, Linux File
Text A-Ch1
Hierarchy Standard and basic shell
commands. Linux system call interface.
Compiling a C program on Linux command
line interface
2 3 Editors used in Linux (vim, peco, nano).
Shell commands (wc, sort, uniq, grep, cut,
paste, comm, comp, diff, whereis, which,
locate, find, tar, gzip, gunzip). Program on
disk and its components. Viewing contents
of a program file. Process in memory and Handouts
its components (stack, heap and PCB).
Command line arguments and
environment variables. Viewing contents
of a running program using readelf and
objdump
4 CPU and I/O bound processes. Process
state models. Five, six and seven state
process models. Process scheduling
queues. Long term, medium term and
short term schedulers. Concept of
Text A-Ch2
process/context switch. Process creation
and termination. Shell commands related
to process management. Fork, wait and
exit system calls. Interrupt, trap and system
calls. Process resource limits.

75 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
SourceBook ion for
Week Lecture Topic
(Ch#) Learning
Activities
3 5 Discussion on working of a Linux shell and
the concept of how an internal and
external command executes. Running
programs in the background and Text A-Ch3
foreground. Switching programs to
different states. Basic commands related
to process states like ps, fg, bg and top.
6 The open, read, write and close paradigm Lab:
in Linux. The concept of PPFDT. The
connection of an opened file from process
PPFDT to System Wide File Table, to I-node Handouts
table and finally to disk blocks. Cooperating
Processes. Taxonomy of Inter-process
Communication
4 7 I/O Redirection, UNIX IPC tools. Using
Text A-Ch2
pipes, FIFOs and signals in Linux
8 Concurrent and parallel programming. Lab:
Introduction to threads. Multi-threading.
Merits and demerits of threads. User level Text A-Ch4
vs Kernel level threads. Threading models.
Programming using Pthread library.
5 9 Process scheduler and Dispatcher.
Preemptive vs non-preemptive scheduling.
CPU and IO bursts. CPU scheduling and Text A Ch6
scheduling criteria, FCFS, SJF, SRTF, and
Priority scheduling.
10 Round Robin, Virtual Round Robin, Multi
level Queue Scheduling and Multi level
Text A-Ch6
Feed- back queue scheduling, Rotating
Stair-case Dead line scheduler,

76 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
SourceBook ion for
Week Lecture Topic
(Ch#) Learning
Activities
6 11 Rotating Stair-case dead line scheduler,
UNIX SVR3 scheduling algorithm. Changing
process priorities using nice, renice
commands. Changing nice value of running
processes and executing a program with a
Handouts
nice value other than the default. The
concept of hard and soft CPU affinity in
Linux. Displaying and changing the
scheduling parameters of Linux processes
using schedtool
12 Introduction to synchronization,
Concurrency Control, Race Condition,
Critical Section Problem. Concept of atomic
Text A-Ch5
operation. General format of a CS problem
solution. Characteristics of a good CSP
solution.
7 13 Software Based Solutions to CSP: Dekker
solution, Peterson solution, and Leslie
Text A-Ch5
Lamport’s Bakery algorithm. Concept of
busy waiting.
14 H/W based solutions to CSP: Disabling of
interrupts, TSL and swap instructions.
Thread synchronization using
Text A-Ch5
pthread_mutex_t variable and
pthread_mutex_lock() and
pthread_mutex_unlock() library calls
8 15 Introduction to semaphores. Binary and
counting semaphores. Achieving mutual
exclusion using semaphores. Achieving
serialization using semaphores. Solution to
Text A-Ch5
Standard Synchronization problems using
semaphores, Producer Consumer, Dining
Philosopher, Reader writer, Sleeping
Barber, Smokers problem
16 Limitations of semaphores, Introduction
to Monitors, Condition variables, Hoare
Text A-Ch5
and Mesa monitors. Solution to standard
synchronization problems using monitors.

77 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
SourceBook ion for
Week Lecture Topic
(Ch#) Learning
Activities
9 17 Introduction to Dead locks, Four necessary
and sufficient conditions for Dead Locks,
Text A-Ch7
Resource allocation graph, Dead lock
handling methods, Dead lock prevention
18 Dead Lock Avoidance. Bankers and Safety
Algorithm.
Text A-Ch7
Dead Lock Detection and Recovery
Algorithms
10 19 Memory management, address binding
and linking, Logical vs Physical addresses,
Dynamic loading, Dynamic linking and
Text A-Ch8
shared libraries. Overlays, swapping.
Introduction to contagious memory
allocation
20 MFT and MVT, Placement algorithms,
Internal and External fragmentation, Text A-Ch8
Buddy partitioning scheme.
11 21 Introduction to paging, Page Table,
Address translation in paging, Paging Text A-Ch8
parameters for Intel and PDP11
22 Implementing page table in cache,
memory and CPU registers, Structure of
Page Tables (Hierarchical, Inverted and
Text A-Ch9
Hashed Page tables). Introduction to
Segmentation, address translation in
segmentation.
12 23 Introduction to paged segmentation,
address translation in a paged
Text A-Ch9
segmentation. Address translation in Intel
80386 (Real and protected mode)
24 Virtual Memory, Background, Demand
Paging, Performance of Demand Paging,
Text A-Ch9
Page Replacement algorithms (FIFO,
Optimal, LRU, LFU, MFU, Buffering)
13 25 Copy on Write protocol and vfork() system
call, Allocation Of Frames, Thrashing,
Resident Set Management, Working Set Text A-Ch9
Model, Page fault frequency, memory
mapped files.

78 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
SourceBook ion for
Week Lecture Topic
(Ch#) Learning
Activities
26 Hard Disk Geometry: Spinning and Solid
state disk. Working of spinning disk and its
interfaces (IDE, ATA, SATA, SCSI, SAS). The
concept of Logical Block Addressing and its
mapping on CHS address.
Text A-Ch10
Hard Disk Partitions: Partitioning a hard
disk. Different types of partition tables,
MBR and GPT. Linux tools used for
partitioning a hard disk like fdisk, gdisk,
parted, gparted, cfdisk, sfdisk
14 27 Disk Formatting: Concept of a file system
and the basic functionalities that every file
system should offer. Comparison of
different file systems like ext2/3/4,
reiserfs, hpfs, minix, ntfs, vfat, xfs and zfs.
Use of Linux tools like mkfs, mke2fs,
mkntfs, mkfs.fat, mkfs.minix to put a file
system on a partition Text A-Ch11
File System Mounting: Introduction to the
concept of file system mounting. Linux
configuration files related to file system
mounting. Linux commands like mount,
umount, lsblk, blkid. Maintaining integrity
of file system using Linux commands like
fsck, e2fsck, fsck.fat, fsck.nfs

79 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
SourceBook ion for
Week Lecture Topic
(Ch#) Learning
Activities
28 File System Architecture: Schematic view
of a standard UNIX file system. Describe
the contents of boot block, super block,
inode block, and data blocks. Discuss In-
memory and on-disk structures used by a
file system. Describes what actually
happens behind the curtain when a user
creates, accesses and deletes a file and
how Linux keep track of opened files by a Text A-Ch12
process. Use of Linux commands like df, du,
lsof, fuser, and tune2fs to perform these
tasks
Hard and Soft Links: Discuss the use of
hard and soft links on all UNIX based
systems. Differences between hard and
soft links. Use of Linux command ln to
create hard and soft links
15 29 File Permissions: Discuss the use of
standard file permissions. How to change
the existing file permissions on a file using
symbolic and octal way. Use of chmod and
chown commands. Setting the default file
permissions on a newly created file using
Text A-C14
the umask command
Special File Permissions: Concept and use
of Saved SUID bit on files. Concept and use
of Saved SGID bit on files and directories.
Concept and use of Sticky bit on files and
directories.

80 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
SourceBook ion for
Week Lecture Topic
(Ch#) Learning
Activities
30 Access Control Lists: Discuss the security
on files using Access Control List. Concept
of Discretionary Access control and
Mendatory Access control. How to set ACLs
on files. A discussion on default ACLs or
ACLs on directories
Device Files: Seven File Types in Linux and Handouts
the concept of device files. Describes the
contents of /dev/ directory. Describes
Major and minor numbers and shows how
you can create your own device files.
Important /dev/ directory files like zero,
null, full, random, urandom and ttys
16 31 Terminal Attributes: Overview of Terminal
Devices and a comparison between disk
and terminal files. Examine current
attributes of terminal driver on a Linux
machine and changing them using stty
command. Overview of Canonical and Non-
canonical mode of terminal drivers.
Time Management in Linux operating
Handouts
system
Managing services using systemd:
Introduction to Linux system daemon.
Overview of to systemd unit files, specially
Target Unit Files and Service Unit Files.
Shell commands to manage services using
systemctl. Writing/running a basic service
of your own
32 Log Files: Logging mechanism in Linux
Booting process of a Linux system: A
discussion on five phases of Linux
Operating system: BIOS / UEFI Text A-Ch18
Initialization, Master Boot Record, Boot
Loader, Kernel Initialization, init or systemd
Process

81 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS data science

Course Code CC-303

Course Title Software Engineering

Theory Lab
Credit Hours
3 0

Lecture Duration 90 minutes (1.5 Hours), 2 lectures per week

Semester 4

Courses Knowledge
Pre-requisites
Nil Nil

Follow Up Courses

Upon completion of this course, the student will be able to:

Aims and 1. Understanding Grasp modeling concepts with emphasis on
performance analysis.
Objectives
2. Planning of software
3. Designing Software
Course Learning Outcomes (CLOs):
CLO No Course Learning Outcome Bloom Taxonomy
Describe various software engineering processes and
CLO-1 activates techniques for the design of digital C1 (Describe)
electronic circuits
Apply the system modeling techniques to model a
CLO-2 C3 (Apply)
medium size software systems
Apply software quality assurance and testing
CLO-3 C4 (Apply)
principles to medium size software systems
Discuss key principles and common methods for
CLO-4 software project management such as scheduling, C2 (Discuss)
size estimation, cost estimation and risk analysis
At the end of the course, you should be able to:
Learning Outcomes
• Describe various software engineering processes and activates

82 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• Apply the system modeling techniques to model a medium size software

systems
• Apply software quality assurance and testing principles to medium size
software systems
• Discuss key principles and common methods for software project
management such as scheduling, size estimation, cost estimation and risk
analysis

1. Describe various software engineering processes and activates

1.1. Nature of Software
1.2. Overview of Software Engineering
1.3. Professional software development
2. Software engineering practice
2.1. Software process structure
2.2. Software process models
2.3. Agile software Development
2.4. Agile process models
2.5. Agile development techniques
3. Requirements engineering process

Contents 3.1. Functional requirements

3.2. Non-functional requirements
4. Model driven engineering
4.1. Context models
4.2. Interaction models
4.3. Structural models
4.4. Behavioral models
5. Architectural design
5.1. Design and implementation
6. UML diagrams
6.1. Design patterns
6.2. Software testing and quality assurance

83 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

6.3. Software evolution

6.4. Project management
6.5. Project planning
7. Configuration management
7.1. Software Process improvement

• Interactive class session

Teaching-learning • Hands on practices in class

Strategies • Brainstorming and Group discussion sessions

• Paper based written assignments 3

Assignments • Project 2
• Quiz 4

Sr. # Elements Weightage Details

1 Formative 25% It is continuous assessment. It

includes: classroom participation,
Assessment
attendance, assignments and
presentations, homework, attitude
and behavior, hands-on-activities,
Assessment and short tests, quizzes etc.
Examinations 2 Midterm 35% It takes place at the mid-point of the
semester.
Assessment

3 Final 40% It takes place at the end of the

semester. It is mostly in the form of a
Assessment
test, but owing to the nature of the
course the teacher may assess their
students based on term paper.
Textbooks & • Software Engineering, Sommerville I., 10th Edition, Pearson Inc., 2014

84 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Reference material • Software Engineering, A Practitioner’s Approach, Pressman R. S.& Maxim

B. R., 8th Edition, McGraw-Hill, 2015.

• The instructor reserves the right to modify the grading scheme/marks

Notes division and course outline during the semester.

85 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code CC-214

Course Title Computer Networks

Theory Lab
Credit Hours
3 1

90 minutes (1.5 Hours), 2 lectures per week, 3 hours lab session per
Lecture Duration
week

Semester 6

Courses Knowledge
Pre-requisites
None

Follow Up Courses

Course Learning Outcomes (CLOs)

CLO No Course Learning Outcome Bloom Taxonomy

Describe the key terminologies and technologies of

CLO-1 C2 (Describe)
computer networks
Explain the services and functions provided by each layer in
CLO-2 C2 (Explain)
the Internet protocol stack.
Identify various internetworking devices and protocols and
CLO-3 C4 (Identify)
their functions in a networking
Analyze working and performance of key technologies,
CLO-4 C4 (Analyze)
algorithms and protocols
CLO-5 Build Computer Network on various Topologies C3 (Build)
The course will cover computer networks in a top down manner
Aims and Objectives
starting from the application layer to data link layer. The course will
be

86 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

taught in the Internet perspective and will therefore cover the layers
of

the TCP/IP suite.

After the completion of this course, students will be able to:

1. Understand the fundamental concepts of networking.

2. Know the working of each layer in TCP/IP suite.
3. Identify the challenges involved in data flow and error control.
4. understand the working of internet.

5. CLO-1: Describe the key terminologies and technologies of

computer networks
6. CLO-2: Explain the services and functions provided by each layer
in the Internet protocol stack.
Learning Outcomes 7. CLO-3: Identify various internetworking devices and protocols
and their functions in a networking
8. CLO-4: Analyze working and performance of key technologies,
algorithms and protocols
9. CLO-5: Build Computer Network on various Topologies
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, wireless networks, MAC
addressing, networking devices, network layer protocols, IPv4 and IPv6,
Syllabus
IP addressing, sub netting, CIDR, routing protocols, transport layer
protocols, ports and sockets, connection establishment, flow and
congestion control, application layer protocols, latest trends in computer
networks.

I. Introduction
i. Overview of the Internet
ii. Overview of Networking Protocols
Contents iii. Network Edge
iv. Network Core
v. Protocol Layers / Service Model
vi. Physical Media
vii. Some History of the Internet

87 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

viii. General Networking Example

II. Application Layer
i. Principles of Networking Applications
ii. Web and HTTP
iii. FTP
iv. Email
v. DNS
vi. Peer-to-Peer (P2P)
III. Transport Layer
i. Transport Layer Services
ii. Multiplexing and Demultiplexing
iii. Connectionless Transport: UDP
iv. Principles of Reliable Data Transport
v. Connection-Oriented Transport: TCP
vi. Principles of Congestion Control
vii. TCP Congestion Control
IV. Network Layer
i. Virtual Circuits and Datagram Networks
ii. Inside a Router
iii. Details of the Internet Protocol (IP)
iv. IP Subnetting
v. Routing Algorithms
vi. Link State
vii. Distance Vector
viii. Hierarchical Routing
V. Link Layer
i. Error Detection and Correction
ii. Multiple Access Protocols
iii. Local Area Networks
iv. Multiprotocol Label Switching (MPLS))
v. Data Center Networking

The course will be based on the following teaching and learning

activities:
Teaching-learning Lectures covering the theoretical part using PowerPoint
presentations
Strategies
Case studies
Review questions

Assignments Total 4 Assignment

88 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Sr. # Elements Weightage Details

1 Formative 25% Assignments, Presentations, Quizzes.

Assessment and Assessment

Examinations 2 Midterm 35% Mid Term exam of 90 Minutes in 9th

Assessment week of the semester.

3 Final 40% End Term exam of 120-180 minutes at

Assessment the end of semester.

Textbooks • Kurose, J. F., & Ross, K. W. (2021). Computer networking: A top-

down approach featuring the Internet. Boston: Addison-Wesley.
• Tanenbaum, A. S. (2013. Computer networks. Upper Saddle River,
Reference
N.J: Prentice Hall PTR.
Material/Suggested • Stallings, W. (2014). Data and computer communications. Upper
Readings Saddle River, N.J: Prentice Hall.
• Forouzan, B. A., Coombs, C. A., & Fegan, S. C. (2012). Data
communications and networking. Boston: McGraw-Hill.

Notes • Power Point slides with reading material from book.

Detailed Lecture wise plan

Source Recommendation
Week Lecture Topic Book for Learning
(Ch#) Activities
What Is the Internet?
A Nuts-and-Bolts Description
1 Ch-01
A Services Description
What Is a Protocol?
The Network Edge
1 Access Networks
Physical Media
2 The Network Core Ch-01
Packet Switching
Circuit Switching
A Network of Networks

89 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Source Recommendation
Week Lecture Topic Book for Learning
(Ch#) Activities
Delay, Loss, and Throughput in Packet-
Switched Networks
Overview of Delay in Packet-Switched
Networks
Queuing Delay and Packet Loss
3 End-to-End Delay Ch-01
Throughput in Computer Networks
Protocol Layers and Their Service Models
Layered Architecture
Encapsulation
2
Networks Under Attack
History of Computer Networking and the
Internet
The Development of Packet Switching:
1961–1972
4 Proprietary Networks and Internetworking: Ch-01
Assignment-1
1972–1980
A Proliferation of Networks: 1980–1990
The Internet Explosion: The 1990s
The New Millennium
Principles of Network Applications
5 Network Application Architectures Ch-02 Quiz-1
Processes Communicating
3 Transport Services Available to Applications
Transport Services Provided by the Internet
6 Ch-02
Application-Layer Protocols
Network Applications
The Web and HTTP
Overview of HTTP
Non-Persistent and Persistent Connections
4 7 HTTP Message Format Ch-02
User-Server Interaction: Cookies
Web Caching
The Conditional GET

90 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Source Recommendation
Week Lecture Topic Book for Learning
(Ch#) Activities
File Transfer: FTP
FTP Commands and Replies
Electronic Mail in the Internet
8 SMTP Ch-02
Comparison with HTTP
Mail Message Format
Mail Access Protocols
DNS—The Internet’s Directory Service
Services Provided by DNS
9 Ch-02
Overview of How DNS Works
DNS Records and Messages
Peer-to-Peer Applications
5 P2P File Distribution
Distributed Hash Tables (DHTs)
10 Socket Programming: Creating Network Ch-02
Assignment-2
Applications
Socket Programming with UDP
Socket Programming with TCP
Introduction and Transport-Layer Services
Relationship Between Transport and
Network Layers
11 Ch-03 Quiz-2
Overview of the Transport Layer in the
6 Internet
Multiplexing and Demultiplexing
Connectionless Transport: UDP
12 UDP Segment Structure Ch-03
UDP Checksum
Principles of Reliable Data Transfer
Building a Reliable Data Transfer Protocol
7 13 Pipelined Reliable Data Transfer Protocols Ch-03
Go-Back-N (GBN)
Selective Repeat (SR)

91 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Source Recommendation
Week Lecture Topic Book for Learning
(Ch#) Activities
Connection-Oriented Transport: TCP
The TCP Connection
TCP Segment Structure
14 Round-Trip Time Estimation and Timeout Ch-03
Reliable Data Transfer
Flow Control
TCP Connection Management
Principles of Congestion Control
The Causes and the Costs of Congestion
15 Approaches to Congestion Control Ch-03
8 Network-Assisted Congestion-
Control
TCP Congestion Control
16 Ch-03
Fairness
The Network Layer Introduction
Forwarding and Routing
Network Service Models
17 Ch-04
Virtual Circuit and Datagram Networks Assignment-3
Virtual-Circuit Networks
Datagram Networks
9
What’s Inside a Router?
Input Processing
Switching
18 Ch-04 Quiz-3
Output Processing
Where Does Queuing Occur?
The Routing Control Plane
The Internet Protocol (IP): Forwarding and
Addressing in the Internet
Datagram Format
10 19 Ch-04
IPv4 Addressing, Subnetting, CIDR
Internet Control Message Protocol (ICMP)
IPv6

92 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Source Recommendation
Week Lecture Topic Book for Learning
(Ch#) Activities
Routing Algorithms
The Link-State (LS) Routing Algorithm
20 Ch-04
The Distance-Vector (DV) Routing Algorithm
Hierarchical Routing
Routing in the Internet
Intra-AS Routing in the Internet: RIP
21 Ch-04
Intra-AS Routing in the Internet: OSPF
11 Inter-AS Routing: BGP
Broadcast and Multicast Routing
22 Broadcast Routing Algorithms Ch-04
Multicast
Introduction to the Link Layer
23 The Services Provided by the Link Layer Ch-05
Assignment-4
Where Is the Link Layer Implemented?
12 Error-Detection and -Correction Techniques
Parity Checks
24 Ch-05 Quiz-4
Check summing Methods
Cyclic Redundancy Check (CRC)
Multiple Access Links and Protocols
25 Ch-05
Channel Partitioning Protocols
Random Access Protocols
13
Taking-Turns Protocols
26 Ch-05
DOCSIS: The Link-Layer Protocol for Cable
Internet Access
Link-Layer Addressing and ARP
27 Ethernet Ch-05
Link-Layer Switches
14
Virtual Local Area Networks (VLANs)
28 Link Virtualization: A Network as a Link Layer Ch-05
Multiprotocol Label Switching (MPLS)
29 Data Center Networking Ch-05
A Day in the Life of a Web Page Request
15
30 DHCP, UDP, IP, and Ethernet Ch-05
DNS and ARP

93 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Source Recommendation
Week Lecture Topic Book for Learning
(Ch#) Activities
Intra-Domain Routing to the DNS Server
16 31 Ch-05
Web Client-Server Interaction: TCP and HTTP
32 Final Q & Answer session

Program BS Data Science

Course Code CC-308

Course Title Information Security

Theory Lab
Credit Hours
3 0

Lecture Duration 90 minutes (1.5 Hours), 2 lectures per week

Semester 8

Courses Knowledge
Pre-requisites
None Nil

Follow Up Courses Nil

Course Learning Outcomes (CLOs)

CLO No Course Learning Outcome Bloom Taxonomy

Explain key concepts of information security such as
CLO-1 design principles, cryptography, risk management, and C2 (Explain)
ethics
Discuss legal, ethical, and professional issues in
CLO-2 A2 (Discuss)
information security
Apply various security and risk management tools for
CLO-3 C3 (Apply)
achieving information security and privacy
Identify appropriate techniques to tackle and solve
CLO-4 C4 (Identify)
problems in the discipline of information security

94 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

1. In this course students learn basics of information security, in

both management aspect and technical aspect.
2. Students understand of various types of security incidents and
Aims and Objectives
attacks, and learn methods to prevent, detect and react incidents
and attacks. Students will also learn basics of application of
cryptography which are one of the key technologies to implement
security functions.
• CLO-1: Explain key concepts of information security such as
design principles, cryptography, risk management, and ethics
• CLO-2: Discuss legal, ethical, and professional issues in
information security
Learning Outcomes • CLO-3: Apply various security and risk management tools for
achieving information security and privacy
• CLO-4: Identify appropriate techniques to tackle and solve
problems in the discipline of information security

I. 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,
Syllabus 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.
II. Computer Security Concepts
i. Threats, Attacks, and Assets
ii. Security Functional Requirements
iii. Fundamental Security Design Principles
iv. Attack Surfaces and Attack Trees
v. Computer Security Strategy
vi. Standards
Contents III. Cryptographic Tools
i. Confidentiality with Symmetric Encryption
ii. Message Authentication and Hash Functions
iii. Public-Key Encryption
iv. Digital Signatures and Key Management
v. Random and Pseudorandom Numbers
vi. Practical Application: Encryption of Stored Data

95 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

IV. User Authentication

i. Digital User Authentication Principles
ii. Password-Based Authentication
iii. Token-Based Authentication
iv. Biometric Authentication
v. Remote User Authentication
vi. Security Issues for User Authentication
vii. Practical Application: An Iris Biometric System

V. Access Control
i. Access Control Principles
ii. Subjects, Objects, and Access Rights
iii. Discretionary Access Control
iv. Example: UNIX File Access Control
v. Role-Based Access Control
vi. Attribute-Based Access Control
vii. Identity, Credential, and Access Management
viii. Trust Frameworks

VI. Database and Data Centre Security

i. The Need for Database Security
ii. Database Management Systems
iii. Relational Databases
iv. SQL Injection Attacks
v. Database Access Control
vi. Inference
vii. Database Encryption
viii. Data Center Security

VII. Malicious Software

i. Types of Malicious Software
ii. Advanced Persistent Threat
iii. Propagation — Infected Content - Viruses
iv. Propagation — Vulnerability Exploit - Worms
v. Propagation — Social Engineering — SPAM E-Mail, Trojans
vi. Payload — System Corruption
vii. Payload — Attack Agent — Zombie, Bots
viii. Payload — Information Theft — Keyloggers, Phishing,
Spyware
ix. Payload — Stealthing — Backdoors, Rootkits
x. Countermeasures

96 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

VIII. Denial-of-Service Attacks

i. Denial-of-Service Attacks
ii. Flooding Attacks
iii. Distributed Denial-of-Service Attacks
iv. Application-Based Bandwidth Attacks
v. Reflector and Amplifier Attacks
vi. Defenses Against Denial-of-Service Attacks
vii. Responding to a Denial-of-Service Attack

IX. Intrusion Detection

i. Intruders
ii. Intrusion Detection
iii. Analysis Approaches
iv. Host-Based Intrusion Detection
v. Network-Based Intrusion Detection
vi. Distributed or Hybrid Intrusion Detection
vii. Intrusion Detection Exchange Format
viii. Honeypots

X. Firewalls and Intrusion Prevention Systems

i. The Need for Firewalls
ii. Firewall Characteristics and Access Policy
iii. Types of Firewalls
iv. Firewall Basing
v. Firewall Location and Configurations
vi. Intrusion Prevention Systems

XI. IT Security Management and Risk Assessment

i. IT Security Management
ii. Organizational Context and Security Policy
iii. Security Risk Assessment
iv. Detailed Security Risk Analysis

XII. Legal and Ethical Aspects

i. Cybercrime and Computer Crime
ii. Intellectual Property
iii. Privacy
iv. Ethical Issues
Teaching-learning
The course will be based on the following teaching and learning
Strategies activities:

97 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• Lectures covering the theoretical part using PowerPoint

presentations
• Case studies
• Review questions

Assignments Total 4 Assignment

Sr. # Elements Weightage Details

1 Formative 25% Assignments, Presentations, Quizzes.

Assessment and Assessment

Examinations 2 Midterm 35% Mid Term exam of 90 Minutes in 9th

Assessment week of the semester.

3 Final 40% End Term exam of 120-180 minutes at

Assessment the end of semester.
• Computer Security: Principles and Practice, 3rd edition by William
Textbooks Stallings

• Whitman, M. E., & Mattord, H. J. (2019). Principles of information

Reference security.
Material/Suggested • Gollmann, D. (2011. Computer security. Chichester: Wiley.
• Easttom, W., & Safari, an O'Reilly Media Company. (2011).
Readings Computer Security Fundamentals, Second Edition.
• Gordon, A. (2015). Official (ISC)2 Guide to the CISSP CBK, Fourth
Edition. Hoboken: CRC Press.

Notes • Power Point slides with reading material from book.

98 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Detailed Lecture wise plan

Source Recommendation
Week Lecture Topic Book for Learning
(Ch#) Activities
Computer Security Concepts
1 Threats, Attacks, and Assets Ch-01
Security Functional Requirements
1
Fundamental Security Design Principles
2 Attack Surfaces and Attack Trees Ch-01
Computer Security Strategy
Cryptographic Tools Ch-02
Confidentiality with Symmetric Encryption
3
Message Authentication and Hash Functions
2
Public-Key Encryption Ch-02
4 Digital Signatures and Key Management

Random and Pseudorandom Numbers

5 Practical Application: Encryption of Stored Ch-02
Data
3
User Authentication Ch-03
6 Electronic User Authentication Principles
Assignment-1
Password-Based Authentication
Token-Based Authentication Ch-03
7 Biometric Authentication Quiz-1
Remote User Authentication
4
Security Issues for User Authentication Ch-03
8 Practical Application: An Iris Biometric
System
Case Study: Security Problems for ATM Ch-03
5 9
Systems

99 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Source Recommendation
Week Lecture Topic Book for Learning
(Ch#) Activities
Access Control Ch-04
Access Control Principles
Subjects, Objects, and Access Rights
10
Discretionary Access Control
Example: UNIX File Access Control

Role-Based Access Control Ch-04

Attribute-Based Access Control
11 Identity, Credential, and Access
6 Management
Trust Frameworks
Ch-04
12 Case Study: RBAC System for a Bank

Database and Cloud Security

The Need for Database Security
13 Ch-05
Database Management Systems Assignment-2
7
Relational Databases Ch-05
14 SQL Injection Attacks Quiz-2

Database Access Control Ch-05

15 Inference
8 Database Encryption
Cloud Computing Ch-05
16
Cloud Security Risks and Countermeasures
Data Protection in the Cloud
17 Ch-05
Cloud Security as a Service
9 Malicious Software
18 Types of Malicious Software (Malware) Ch-06
Advanced Persistent Threat
Propagation—Infected Content—Viruses Ch-06
10 19 Propagation—Vulnerability Exploit—Worms
Propagation—Social Engineering—Spam E-
Mail, Trojans

100 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Source Recommendation
Week Lecture Topic Book for Learning
(Ch#) Activities
Payload—System Corruption Ch-06
20
Payload—Attack Agent—Zombie, Bots
Payload—Information Theft—Keyloggers, Ch-06
Phishing, Spyware
21
Payload—Stealthing—Backdoors, Rootkits
11 Countermeasures
Denial-of-Service Attacks Ch-07
22 Flooding Attacks

Distributed Denial-of-Service Attacks

23 Application-Based Bandwidth Attacks Ch-07
12 Reflector and Amplifier Attacks
Defenses Against Denial-of-Service Attacks Ch-07
24
Responding to a Denial-of-Service Attack
Intrusion Detection Ch-08
Intruders
25
Intrusion Detection Assignment-3
Analysis Approaches
13
Host-Based Intrusion Detection
Network-Based Intrusion Detection
26 Ch-08 Quiz-3
Distributed or Hybrid Intrusion Detection

Intrusion Detection Exchange Format Ch-08

27 Honeypots
Intrusion Detection, Example System: Snort
14
Firewalls and Intrusion Prevention Systems Ch-09
28 The Need for Firewalls
Firewall Characteristics and Access Policy

101 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Source Recommendation
Week Lecture Topic Book for Learning
(Ch#) Activities
Types of Firewalls Ch-09
Firewall Basing
Firewall Location and Configurations
29
Intrusion Prevention Systems Assignment-4
Example: Unified Threat Management
Products
15
IT Security Management and Risk
Assessment
IT Security Management
30 Organizational Context and Security Ch-14 Quiz-4
Policy
Security Risk Assessment
Detailed Security Risk Analysis
Legal and Ethical Aspects Ch-19
31 Cybercrime and Computer Crime
Security policies, Policy formation and
enforcement
16 Cybercrime, law and ethics in information Ch-19
security, Privacy and anonymity of data.
32 Intellectual Property
Privacy
Ethical Issues

102 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code CC-110

Course Title Digital Logic Design

Theory Lab
Credit Hours
3 1

Lecture Duration 90 minutes (1.5 Hours), 2 lectures per week, 3 hours lab session per week

Semester 2

Courses Knowledge
Pre-requisites

Follow Up Courses Computer Organization and Assembly Language

Course Learning Outcomes (CLOs)

CLO No Course Learning Outcome Bloom Taxonomy
Acquire knowledge related to the concepts, tools and -
CLO-1 C2 (Understand)
techniques for the design of digital electronic circuits
Demonstrate the skills to design and analyze both
CLO-2 combinational and sequential circuits using a variety of C2 (Understand)
techniques.
Apply the acquired knowledge to simulate and implement
CLO-3 C3 (Apply)
small-scale digital circuits
Understand the relationship between abstract logic
CLO-4 C2 (Understand)
characterizations and practical electrical implementations.
Aims and 1. Get the theoretical and the practical knowledge of the fundamental
Objectives circuitry of the computers.

Student will have knowledge of

Learning
Outcomes:
• Number Systems and Boolean Algebra

103 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• Combinational Circuits
• Sequential Circuits
• Registers and Memory elements
• Lab experience of ICS

Number Systems, Logic Gates, Boolean Algebra, Combination logic circuits

and designs, Simplification Methods (K-Map, Quinn Mc-Cluskey method),
Flip Flops and Latches, Asynchronous and Synchronous circuits, Counters,
Syllabus Shift Registers, Counters, Triggered devices & its types. Binary Arithmetic
and Arithmetic Circuits, Memory Elements, State Machines. Introduction
Programmable Logic Devices (CPLD, FPGA) Lab Assignments using tools such
as Verilog HDL/VHDL, MultiSim
1. Number Systems,
2. Logic Gates,
3. Boolean Algebra,
4. Combination logic circuits and designs,
5. Simplification Methods (K-Map, Quinn Mc-Cluskey method),
6. Flip Flops and Latches,
7. Asynchronous and Synchronous circuits,
Contents 8. Counters,
9. Shift Registers,
10. Counters, Triggered devices & its types.
11. Binary Arithmetic and Arithmetic Circuits,
12. Memory Elements,
13. State Machines.
14. Introduction Programmable Logic Devices (CPLD, FPGA) Lab
Assignments using tools such as Verilog HDL/VHDL, MultiSim
Teaching-learning The students will be given all round knowledge of the subject oral/on white
Strategies board/assignments/sudden quizzes during class rooms only.

Assignments Assignments will be assigned throughout the course.

Sr. # Elements Weightage Details

1 Formative 25% It is continuous assessment. It includes:

Assessment and
Assessment classroom participation, attendance,
Examinations
assignments and presentations,
homework, attitude and behavior,

104 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

hands-on-activities, short tests, quizzes

etc.

2 Midterm 35% It takes place at the mid-point of the

Assessment semester.

3 Final 40% It takes place at the end of the

Assessment semester. It is mostly in the form of a
test, but owing to the nature of the
course the teacher may assess their
students based on term paper, research
proposal development, field work and
report writing etc.

1. Digital Fundamentals by Floyd, 11/e.

Textbooks
2. Fundamental of Digital Logic with Verilog Design, Stephen Brown, 2/e
Reference
Material/Suggested All reference Material/readings will be provided during lectures as per
Readings the class performance and their interest in the degree program overall.

Notes Students will take their own notes during class.

105 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code CC-210

Course Title Computer Organization and Assembly Language Programming

Theory Lab
Credit Hours
3 1

Lecture Duration 90 minutes (1.5 Hours), 2 lectures per week, 3 hours lab session per week

Semester 4

Courses Knowledge

Pre-requisites • Strong grip on Number system

Digital Logic Design • Strong back ground of
Combinational and Sequential
circuits
Follow Up Courses Computer Architecture

Course Learning Outcomes (CLOs)

CLO No Course Learning Outcome Bloom Taxonomy

Acquire the basic knowledge of computer organization

CLO-1 C2 (Understand)
computer architecture and assembly language.
Understand the concepts of basic computer organization,
CLO-2 C2 (Understand)
architecture, and assembly language techniques
Solve the problems related to computer organization and
CLO-3 C3 (Apply)
assembly language
1. Students will understand as to how a microprocessor is designed
starting from a basic NAND gate to a full-blown computer system
2. Students will learn to write Hardware Description Language of
Aims and various components of a computer system
Objectives 3. Students will learn the different ways of interfacing I/O devices with
computer
4. Students will learn to design the ISA, machine and assembly
language of a microprocessor

106 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

5. Students will understand the organization of the Intel processors,

and be able to write basic programs for x86-64 Assembly Language

• Students will understand, design and write the HDL of all the
components of a Von-Neumann based computer. Understand the
basic concept of computer organization, will design its assembly,
machine language and will write its assembler in C, other than
Learning Outcomes
writing some basic assembly programs for that designed computer
(Understand, Apply, Demonstrate)
• Students will have a strong grip of x86-64 assembly language and
the tool chain involved (Apply)
Part-I: The pre-mid part of the course deals with design of a complete
computer system and writing its HDL.
Syllabus
Part-II: The prost-mid part of the course deals with a detailed discussion on
evolution of Intel processors, its programming models, its assembly
language and programming tool chain
Section-1:
- HDL for Combinational Circuits
- HDL for Sequential Circuits
- Data Storage in computer system
Section-2:
- Design and HDL of computer memory
- Instruction Set Architecture
- Design of hardware and writing HDL for Hack Computer
- Interfacing I/O devices with Hack Computer
Section-3:
- Design of Machine Language of Hack Computer
Contents - Design of Assembly Language of Hack Computer
- Design of Data Path (Buses) for Hack Computer
- Design and Code of Hack Assembler
Section-4:
- History and Evolution of Intel Microprocessors
- Concept of pipelining and improving processor performance
- Programming Model of x86-64 processor
- NASM and x86-64 assembly
- Debugging with GNU debugger (gdb)
Section-5:
- Data transfer instructions
- Memory addressing modes
- X86-64 Logical and Bit shifting operations

107 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

- Control Transfer Instructions

- Function Calling Convention and Function Stack Frames
Section-6:
- Mixing C with Assembly programs
- Getting user input
- Programming with Arrays and Strings
- Floating Point Instructions
- Computer performance and parallel processing hardware
- Combinational & Sequential Circuits
• Lectures
Teaching-learning • Case Studies
Strategies • Project
• Assignments
Assignments Types and Number with calendar

Sr. # Elements Weightage Details

1 Formative 25% It is continuous assessment. It includes:

Assessment classroom participation, attendance,
assignments and presentations,
homework, attitude and behavior,
hands-on-activities, short tests, quizzes
etc.

Assessment and 2 Midterm 35% It takes place at the mid-point of the

Examinations Assessment semester.

3 Final 40% It takes place at the end of the semester.

Assessment It is mostly in the form of a test, but
owing to the nature of the course the
teacher may assess their students based
on term paper, research proposal
development, field work and report
writing etc.

108 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

A. The Elements of Computing Systems, Building a modern computer, by

Noam Nisan and Shimon Schocken, 2nd Ed, Published in 2020, ISBN-
Textbooks 13: 978-0262640688
B. X86_64 Assembly Language Programming with Ubuntu, by Ed.
Jorgensen, January 2020
C. Introduction to Computing Systems: from bits and gates to C and
beyond, by Yale Patt and Sanjay Patel, 3rd Ed, Published in 2020, ISBN13:
Reference
9781260150537
Material/Suggested D. X86_64 Assembly Language Programming with Ubuntu, by Ed.
Jorgensen, January 2020 X86_64 Assembly Language Programming with
Readings
Ubuntu, by Ed. Jorgensen, January 2020
E. Dr. Muhammad Arif Butt, COAL -Video Lectures:
https://www.youtube.com/c/LearnWithArif/playlists

Notes

109 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Detailed Lecture wise plan

Recommendat
SourceBook ion for
Week Lecture Topic
(Ch#) Learning
Activities
1 1 Introduction to Course: Computer
Organization and Assembly Language
Programming and a discussion on the
course matrix. The course will be having
two parts in the first half of the course we
will be designing and writing the HDL of a
full-blown computer, will design its
machine and assembly language, will write
programs and execute those programs on
the designed h/w architecture. At the end Text A-Ch1
of the first half of the course, we will also
design and write an Assembler (in C) for the
designed computer. The second half of the
course will deal with the assembly of the
all-time famous x86-64 architecture. The
links from where the e-books, tools, code
snippets, and lecture slides, and other misc
resources can be downloaded are
mentioned.
2 HDL for Combinational Circuits – I: Review Lab:
of Boolean logic and gates. Introduction to
Hardware Description Languages. Design
and code of And, Or, Not gates using the
universal NAND gate. Downloading and
installing Hardware Simulator and
interactive chip testing on this simulator.
Designing Xor chip and performing script
based testing of Xor chip on h/w simulator.
Text A-Ch1
HDL for Combinational Circuits – II: Design
and HDL code for XOR chip, using And, OR,
Not gate chips. A demo of Verification of
XOR chip using interactive chip testing in
the h/w simulator. A brief overview of
script-based chip testing. Writing script for
testing of the designed XOR chip. A
discussion on key players involved in a
hardware construction project.

110 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
SourceBook ion for
Week Lecture Topic
(Ch#) Learning
Activities
2 3 HDL for Combinational Circuits – III:
Design and HDL code for some standard
combinational circuits like Encoder,
Decoders, Multiplexers, and De-
Multiplexer chips. A demo of Verification /
Testing of these standard combinational
chips using interactive chip testing in the
h/w simulator.
HDL for Combinational Circuits – IV: Text A-Ch1
Design and HDL code for multi-bit gates.
The concept of buses and the design of
chips having buses as input. Design and
code of And16, Or16, Not16, and Mux16
chips having 16-bits inputs. Design and
code of And4way16 and similar chips
having four inputs with each input of 16
bits
4 Data Storage – I: Data Representation in Lab:
Computers, Unsigned, and Signed
Numbers, Sign magnitude representation
and its limitations, 1s Complement
representation and its limitations, 2s
Complement representation, Comparisons
Ref C-Ch2
and pros and cons of each, Ranges and
different Storage Sizes, Overflow in
Unsigned and Signed Numbers, How the
Hardware Detect an Overflow, Concept of
Sign Extension, Encoding Characters and
Strings (ASCII and Unicode)
3 5 Data Storage – II: Encoding Real Numbers,
Fixed Point Representation, Floating Point
Representations (IEEE-754), Storage
Ref C-Ch2
layout, Conversion Examples, Range and
Precision, Arithmetic Operations, Overflow
and Underflow, IEEE-754 Special Values

111 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
SourceBook ion for
Week Lecture Topic
(Ch#) Learning
Activities
6 Design of ALU - I: Review of HDL for Lab:
Combinational Circuits, Designing a single
bit Logic Unit Writing HDL for
Combinational Arithmetic Circuits like Half
Adder, Full Adder, Full Subtractor, 16-bit
Binary Adder (Add16 chip), 16-bit
Incrementer (Inc16 chip), Demo of above Text A-Ch2
chips on H/W Simulator
Design of ALU - II: Components of a
Computer System, Design of ALU, The Hack
ALU, The Hack ALU Operations, Design of
Hack ALU, HDL of Hack ALU, Verifying the
ALU chip on H/W Simulator
4 7 Design of Sequential Circuits: Why
Sequential Circuits? Understanding Time in
Circuits, Combinational vs Sequential
Circuits, Flip Flops, D flip Flop, SR Flip Flop,
JK Flip Flop, T Flip Flop Text A Ch3
Design of Registers: What are Registers,
Design of 1-bit Register, HDL for 1-bit
Register, Design of 16-bit Register, HDL for
16-bit Register
8 Design of Memory: Concept of Memory Lab:
Hierarchy, Multi-Byte Read/Write, Design
of Random Access Memory, Read/Write
Logic of RAM, API of a RAM Chip, HDL of 8
Words RAM, HDL of 64 Words RAM, HDL of
512 Words RAM, HDL of 4K Words RAM,
HDL of 16K Words RAM
Text A-Ch3
Design of Counters: Overview of Hack
Computer Components, Overview of
Counters, Why do we need Counter for our
Hack Computer, Concept of Program
Counter, Counter Simulation, Design and
Implementation of PC for Hack Computer,
Demo on H/W Simulator
5 9 ISA-I: Overview of Computer System,
Universality of Computer System, Turing
Ref A Ch3
Machine, Von Neumann Architecture,
Instruction Set Architecture (ISA)

112 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
SourceBook ion for
Week Lecture Topic
(Ch#) Learning
Activities
10 ISA-II: Five Dimensions of ISA, Class of ISA,
Types and Sizes of Operands, Operations
(including control flow instructions), Text A-Ch3
Memory Addressing Models and
Addressing Modes, Encoding an ISA
6 11 Hack Machine Language – I: Hack
Computer Machine Language, Review of
h/w of Hack Computer, Software of Hack Text A Ch4
Computer, A Instruction, C Instruction,
Examples
12 Hack Machine Language – II: Review of
Hack Symbolic Machine Instructions, A
Instruction, C Instruction, Binary Code
Format of Hack Computer Instruction,
Text A-Ch4
Encoding of 16 bit A-Instruction, Encoding
of 16 bit C-Instruction, Examples, A
Complete Hack Program: Assembly
Language
7 13 Interfacing I/O Devices: How to interface
I/O devices with computer, Interfacing
Screen with Hack computer, Demo of built-
Text A Ch 5
in Screen chip on h/w Simulator, Interfacing
Keyboard with Hack computer, Demo of
built-in Keyboard chip on h/w Simulator
14 Hack Assembly Programming – I: Review
of Hack Computer Assembly Instructions,
Hack Assembly Programs, A Hello World in
Hack assembly, CPU Emulator, Demo,
Program Termination
Text A-Ch4
Hack Assembly Programming – II: Recap
previous lecture, Symbols in Hack
Assembly Language, Built-in Symbols, Label
Symbols, Variable Symbols, Branching,
Iteration

113 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
SourceBook ion for
Week Lecture Topic
(Ch#) Learning
Activities
8 15 Hack Assembly Programming – III: Review
of Hack Assembly Programs, Pointers and
Arrays, Input / Output Instructions,
Text A-Ch4
Debugging, Review of Hack Assembly
Programs, Pointers and Arrays, Input /
Output Instructions, Debugging
16 Data path of Hack CPU-I: Von Neumann
Architecture, Flow of Information inside
Computers, Buses, Data Bus, Address Bus,
Control Bus, Fetch Execute Cycle, Fetch
Execute Clash, Harvard Architecture
Text A-Ch5
Data path of Hack CPU-II: Review of Hack
Computer Architecture, Hack CPU
Interface, Hack CPU Implementation,
Input/output and Operations of Hack ALU,
Control Logic of Hack CPU
9 17 Design of Hack Computer: Recap of Hack
Computer Architecture, Implementation of
Hack CPU Chip (CPU.hdl), Implementation
of Hack Memory Chip (Memory.hdl),
RAM16 chip (RAM16K.hdl), Screen chip Text A-Ch5
(Screen.hdl), Keyboard chip
(Keyboard.hdl), Implementation of Hack
ROM Chip (ROM32K.hdl), Implementation
of Hack Computer Chip (Computer.hdl)
18 Design of Hack Assembler: What is an
Assembler? How an Assembler works?
Hack Machine Language Specification,
Demo of Built-in Hack Assembler, Design of
Hack Assembler (w/o Symbols), Design of
Text A-Ch6
Hack Assembler (with Symbols), Hack
Assembler Implementation in C/C ,
Executing Hack Machine Code, Hack
Computer Chip in h/w Simulator, CPU
Emulator

114 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
SourceBook ion for
Week Lecture Topic
(Ch#) Learning
Activities
10 19 History and Evolution of Intel
Microprocessors: Intel 4004 (1971), Intel
8008, Intel 8080, Intel 8086 (x86), Intel
80286, Intel 80386, Intel 80486, Intel
80586 (Pentium P5), Intel 80686 (Pentium
P6), Intel Core (2006)
Intel Nehalam (2008), Intel Sandy Bridge,
Intel Ivy Bridge, Intel Haswell, Intel
Broadwell, Intel Sky Lake, Intel Kaby Lake,
Text B-Ch1
Intel Coffee Lake, Intel Coffee Lake Refresh,
Intel Comet Lake (2019)
On Improving Processors Performance:
CPU Performance Equation, Single Cycle vs
Multi Cycle CPU Architecture, Pipelined
CPU Architecture, Pipeline Stages, Even vs
Uneven pipelined stages, Pipelined
Hazards, Solutions of Pipeline Hazards,
CISC vs RISC Architecture
20 Programming Model of x86 Architecture:
Layout of memory models (flat,
segmented) and register set file of Intel
Text B-Ch2
8080, 80386, x86-64. Logical to physical
address translation for segmented
memory model.
11 21 Hello World in x86-64 Assembly: Overview
of microprocessor families and their
corresponding assembly languages. Tool
chain and programming environment for
x86-64 assembly programming. Running
Text B-Ch4
the first hello world assembly program.
Structure of x86-64 Assembly Program: A
discussion on the x86-64 assembly
language instruction format and the overall
structure of assembly

115 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
SourceBook ion for
Week Lecture Topic
(Ch#) Learning
Activities
22 Debugging C-Program with gdb: A review
of C-compilation process. What is a
debugger? Why use gdb? How to compile,
load and run a program inside gdb and get
information about the running process.
Getting help inside gdb, setting break
points, watch points, stepping through the
Text B-Ch5
code, examining and modifying variables,
convenience variables and setting
conditional break points.
Data Types and Endianness in x86-64:
Usage of different data types and special
tokens in NASM. Practically understand
about the endianness of a machine
12 23 Data Transfer Instructions and Process
Stack: Usage of different move instructions
like mov, movzx, movsx, lea and xchg. A
discussion on the working of process stack
and the push and pop instructions.
Text B-Ch8
Memory Addressing Modes: Theoretical
concepts and pros and cons of addressing
modes used by different processors.
Addressing modes used by x86-64 like
Base-Index-Sale-Displacement
24 Arithmetic Instructions Part-I: A recap of
x86-64 register set and the programming
tool chain. Summary of major categories of
x86-64 instructions. A practical demo on
the use of add, adc, sub, sbb, inc, dec, neg,
cmp, clc, stc, and cmc. A discussion on how
the flags are effected after these arithmetic
instructions Text B-Ch7
Arithmetic Instructions Part-II: A recap of
x86-64 register set and the programming
tool chain. Summary of major categories
off x86-64 instructions. A practical demo on
the use of mul, div, imul, idiv instructions. A
discussion on how the flags are effected
after these arithmetic instructions

116 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
SourceBook ion for
Week Lecture Topic
(Ch#) Learning
Activities
13 25 Logical Operations: A recap of x86-64
register set and the programming tool
chain. Summary of major categories of x86-
64 instructions. A practical demo on the
use of and, or, not, xor, and test
instructions. A discussion on how the flags
are effected after these logical
instructions.
Text B-Ch7
Bit-Shifting Operations: A recap of x86-64
register set and the programming tool
chain. Summary of major categories of x86-
64 instructions. A practical demo on the
use of shl, sal, shr, sar, rol, ror, rcl, and rcr
instructions. A discussion on how the flags
are effected after these logical
instructions.
26 Control Instructions - I: A discussion on
control of flow of execution of a program
and how to change it. Description of
unconditional jump instruction with a
demonstration of example programs.
Discussion on signed and unsigned
conditional jump instructions with
demonstration of example programs.
Text B-Ch7
Translating if…else code too assembly
language.
Control Instructions - II: A Recap of
previous session. Translating high level
repetition structure (for, while, ….) to its
corresponding x86 assembly code using
conditional jump instructions as well as
using x86 loop instructions.

117 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
SourceBook ion for
Week Lecture Topic
(Ch#) Learning
Activities
14 27 GDB with PEDA Plugin: A recap of gdb
command line and text user interface
mode. Downloading, installing, and
configuring Python Exploit Development
Assistance (PEDA) plugin to enhance the
firepower of gdb. Debugging the x86-64
assembly programs using gdb with PEDA
and a brief intro of using this plugin for
reverse engineering and exploit
Text B-
development
Ch9,12
Functions in Assembly Language – I: What
are functions? Why they are used in
programming languages? Syntax of
defining an assembly function in NASM and
MASM. Understanding the working of x86-
64 call and ret instruction. The usage of
process run-time stack in function call. The
concept and requirement of caller-saved
and callee-saved registers

118 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
SourceBook ion for
Week Lecture Topic
(Ch#) Learning
Activities
28 Functions in Assembly Language – II:
Recap of functions in assembly language
and use of call and ret instructions. How
different operating systems allow x86-64
assembly programmers to pass and return
values to and from functions. Designing an
assembly function to display a single digit
and a multi-digit decimal number on
screen. Writing, assembling, linking and
executing multi-file assembly programs on
x86-64.
Function Calling Convention and FSF: Text B-
Recap of assembly language functions. Ch9,12
Understanding function calling in high-
level languages like C and C . The concept
of Function Stack Frame (FSF) or Activation
Record used to store data associated with
a high-level function on the process run
time stack. The x86-64 procedure prolog
and procedure epilog for creating and
removing FFSF from the stack. A
demonstration of stack-based buffer
overflow vulnerability and concept of
exploiting it.
15 29 Mixing C with x86-64 Assembly: Recap of
pushing and popping FSF to and from the
process run time stack in high level
languages. Calling C-Library functions from
within an assembly program. Doing the
reverse, i.e., Calling assembly functions
from within a C program.
Text B-
Getting User Input: User input via system
Ch13,16
calls, library calls, and command line
arguments. What are command line
arguments and why we use them in high
level languages as well as in assembly
programming? Converting the string input
received via command line to integer for
further processing.

119 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
SourceBook ion for
Week Lecture Topic
(Ch#) Learning
Activities
30 Arrays: Array address computation (pointer
arithmetic) based on its types (bytes,
words, double words and quad-words),
General pattern for memory references,
allocation arrays using malloc, processing
arrays, filling with random numbers, Text B-
printing array elements Ch13,16
String: Understanding C-strings in
assembly, x86 string instructions to store
strings in memory, load strings from
memory, comparing strings, and scanning
strings for substrings
16 31 Floating Point Instructions: 8087 floating
point instructions that use stack of 80 bit
floating point registers (ST0, ST1, …). Intel
Core iseries floating point instructions that
work with Streaming SIMD Extensions
(SSE) 128-bit registers (xmm0, xmm1, …).
The concept of Advanced Vector
Extensions (AVX) that use 256-bit registers
(ymm0, ymm1, …)
Data movement instructions (movss, Text B-Ch18
movsd)
Arithmetic instructions (addss, addsd,
subss, subsd, mulss, mulsd, divss, divsd)
Integer / floating point conversion
instructions (cvtss2sd, cvtsd2ss, cvtss2si,
cvtsi2ss, cvtsd2si, cvtsi2sd)
Floating point control instructions
(ucomiss, ucomisd)
Floating point calling convention
32 Computer Performance and Parallel
Text B-Ch19
Processing Hardware:.

120 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code CC-310

Course Title Artificial Intelligence

Theory Lab
Credit Hours
3 1

Lecture Duration 90 minutes (1.5 Hours), 2 lectures per week, 3 hours lab session per week

Semester 4

Courses Knowledge

Pre-requisites Basic knowledge of Programming

Nil and Data Structures would be
helpful

Follow Up Courses Introduction to Data Science

Course Learning Outcomes (CLOs)

CLO No Course Learning Outcome Bloom Taxonomy

Understand the fundamental constructs of Python
CLO-1 C2 (Understand)
programming language.
Understand key concepts in the field of artificial
CLO-2 C2 (Understand)
intelligence
Implement artificial intelligence techniques and case
CLO-3 C3 (Apply)
studies
1. This course aims to introduce students to the exciting and diverse
field of Artificial Intelligence (AI).
Aims and
2. To provide coverage of fundamental concepts of symbolic
Objectives
manipulations, pattern matching, knowledge representation, and
decision making.

121 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

3. The objective of this course is to equip students with the basic

problem-solving techniques used in AI so that they are able to apply
that knowledge to the real-world problems.

• Understanding key concepts in the field of AI

• Understanding the fundamental constructs of AI programming
Learning Outcomes
languages, e.g. Prolog, LISP etc.
• Implementing AI techniques to solve real-world problems

An Introduction to Artificial Intelligence and its applications towards

Knowledge Based Systems; Introduction to Reasoning and Knowledge
Representation, Problem Solving by Searching (Informed searching,
Uninformed searching, Heuristics, Local searching, Min-max algorithm,
Alpha beta pruning, Game-playing); Case Studies: General Problem

Syllabus Solver, Eliza, Student, Macsyma; Learning from examples; Natural

Language Processing; Recent trends in AI and applications of AI
algorithms. Lisp & Prolog programming languages will be used to
explore and illustrate various issues and techniques in Artificial
Intelligence.

Unit 1: Introduction

1.1 Discussion on the concepts of Intelligence and AI

1.2 History of AI
1.3 Strong Vs Weak AI, Strong Vs Weak method problems

Contents solving
1.4 Reasoning and knowledge representation
1.5 Physical Symbol System Hypothesis
Unit 2: Problem Solving by Searching

2.1 Uninformed search

122 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

2.2 Informed search

2.3 Local search heuristics
2.4 Game playing: Minimax algorithm, alpha-beta pruning
Unit 3: Reasoning in AI systems

3.1 Introduction to logic and reasoning in AI

3.2 Recap of Propositional and Predicate Calculi
3.3 Representation in formal logic
3.4 Automated reasoning
3.5 Resolution theorem proving
Unit 4: Knowledge Based Systems:

4.1 Various types of knowledge-based systems (KBS)

4.2 Architecture of rule based Expert Systems
4.3 Case Studies: General Problem Solver, Eliza, Student etc.
Unit 5: Natural Language Processing

5.1 Introduction
5.2 Phases of linguistic analysis
5.3 NLP system
Unit 6: Learning in AI systems:

6.1 Genetic Models of learning

6.2 Symbolic vs Connectionist learning in AI
6.3 Artificial Neural networks:
6.3.1 Perceptrons
6.3.2 Multilayer Perceptrons
6.3.3 Deep Neural Networks

123 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• Multimedia presentations involving interaction from students

Teaching-learning
• Hands on exercises for concept reinforcement
Strategies
• Coding in laboratory

There would be 4 to 5 programming assignments (2 pre and 2-3 post

Assignments
midterm)

Sr. # Elements Weightage Details

1 Formative 25% It is continuous assessment. It includes:

Assessment classroom participation, attendance,
assignments and presentations,
homework, attitude and behavior,
hands-on-activities, short tests, quizzes
etc.

Assessment and 2 Midterm 35% It takes place at the mid-point of the

Examinations Assessment semester.

3 Final 40% It takes place at the end of the

Assessment semester. It is mostly in the form of a
test, but owing to the nature of the
course the teacher may assess their
students based on term paper, research
proposal development, field work and
report writing etc.

Luger, G. F. (2009). Artificial Intelligence- Structures & Strategies for

Complex Problem Solving. (6th Edition). Pearson Education, Inc.
Textbooks
ISBN-13: 978-0-321-54589-3

124 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• Russell, S., Norvig, P. (2015). Artificial Intelligence. A Modern

Approach (3rd Edition). Pearson Education, Inc.

ISBN-13: 978-0136042594
Reference
• Norvig, P. (1992). Paradigms of Artificial Intelligence Programming:
Material/Suggested
Case studies in Common Lisp. Morgan Kaufman Publishers, Inc.
Readings
ISBN-13: 978-1558601918
• Bratko, I. (2011). Prolog: Programming for Artificial Intelligence.
(4th Edition). Pearson Education, Canada. ISBN-13: 978-0321417466

• Academic integrity is expected of all students. Plagiarism or

cheating in any assessment will result in at least an F grade in the
course, and possibly more severe penalties

Notes • There is no makeup for a missed sessional grading instruments like

quizzes, assignments, and homework
• The instructor reserves the right to modify the grading
scheme/marks division and course outline during the semester

125 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Detailed Lecture wise plan

Recommendat
Source
Wee Lectur ion for
Topic Book
k e Learning
(Ch#)
Activities
1 1 Introduction: definition, concept of intelligence; Ch#1
attributes of intelligence; History of AI
2 Schools of thought, methods of problem solving; Reading-1
reasoning and representation; physical symbol
system hypothesis
2 3 Problem solving via search: uniformed search Ch#3
4 Heuristic search techniques Ch#4
3 5 Properties of heuristics Quiz-1
6 Heuristics in game playing; minimax algorithm;
alpha-beta technique
4 7 Reasoning in AI systems: introduction to logical Ch#2 Assignment-1;
reasoning; recap of propositional and predicate Reading-2
calculus
8 Representation in formal logic; unification
algorithm
5 9 Automated reasoning; resolution theorem Ch#14
proving
10 Examples of resolution theorem proving
6 11 Introduction to logic programming. Horn clauses Quiz-2
12 Prolog as an example logic programming system Handout
s
7 13 Knowledge based systems: types, architecture of Ch#8 Reading-3
rule-based expert systems
14 Expert system shells Assignment-2
8 15 Case studies: GPS, Eliza Handout
s
16 Midterm review
Midterm Exam
9 17 Natural Language Processing: Introduction; Ch#15 Reading-4
phases of linguistic analysis
18 NLP system overview
10 19 Genetic Models of learning: Introduction; Ch#12 Reading-5
Genetic Algorithm (GA)
20 Representation, fitness function, selection
techniques

126 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
Source
Wee Lectur ion for
Topic Book
k e Learning
(Ch#)
Activities
11 21 Genetic operators, examples and Quiz-3
implementation of GA
22 Symbolic VS connectionist learning; Ch#10 Assignment-3
12 23 Naïve Bayes classification Handout
s
24 Decision Trees: ID3 algorithm; C 4.5 algorithm Handout Reading-6
s
13 25 Inductive bias of decision tree learning; examples
and implementation
26 Connectionist paradigm of learning: Neuron and Ch#11
Neural Networks; Artificial Neural Networks
14 27 Perceptron networks; delta rule; linear Reading-7
separability problem
28 Multilayer perceptrons; generalized delta rule
15 29 Backpropagation algorithm Assignment-4
30 Issues and enhancements of backpropagation Handout Quiz-4
algorithm s
16 31 Deep neural networks Handout
s
32 Final term review
Final Exam

127 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS DS

Course Code CC-313

Course Title Analysis of Algorithms

Theory Lab
Credit Hours
3 0

Lecture Duration 90 minutes (1.5 Hours), 2 lectures per week

Semester 5

Courses Knowledge
Pre-requisites
Data Structures and Algorithms Nil

Follow Up Courses Nil

Course Learning Outcomes (CLOs)

Bloom
CLO No Course Learning Outcome
Taxonomy
Explain what is meant by “best”, “expected”, and “worst” case
CLO-1 C2
behavior of an algorithm
Identify the characteristics of data and/or other conditions or
CLO-2 C3
assumptions that lead to different behaviors.
Determine informally the time and space complexity of simple
CLO-3 C3
algorithms
CLO-4 List and contrast standard complexity classes C4
Use big O, Omega, Theta notation formally to give asymptotic
CLO-5 C3
upper bounds on time and space complexity of algorithms
Use of the strategies(brute-force, greedy, divide-and- conquer, and
CLO-6 C3
dynamic programming) to solve an appropriate problem
Solve problems using graph algorithms, including single- source and
CLO-7 all-pairs shortest paths, and at least one minimum spanning tree C3
algorithm
CLO-8 Trace and/or implement a string-matching algorithm C3

128 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

1. Students can explain what is meant by “best”, “expected”, and

“worst” case behavior of an algorithm
2. Students can determine informally the time and space complexity
of simple algorithms.

Aims and 3. Students can use of the strategies (brute-force, greedy, divide-and-

Objectives conquer, and dynamic programming) to solve an appropriate

problem
4. Students can solve problems using graph algorithms, including
single-source and all-pairs shortest paths, and at least one
minimum spanning tree algorithm

• Students can explain what is meant by “best”, “expected”, and

“worst” case behavior of an algorithm
• Students can determine informally the time and space complexity
of simple algorithms.
• Students can use of the strategies (brute-force, greedy, divide-and-

Learning Outcomes conquer, and dynamic programming) to solve an appropriate

problem

Students can solve problems using graph algorithms, including

single-source and all-pairs shortest paths, and at least one
minimum spanning tree algorithm
• Students can trace and/or implement a string-matching algorithm

Introduction; Role of algorithms in computing, Analysis on nature of input

and size of input Asymptotic notations; Big-O, Big Ω, Big Θ, little-o, little-ω,
Sorting Algorithm analysis, loop invariants, Recursion and recurrence
Syllabus
relations; Algorithm Design Techniques, Brute Force Approach, Divide-and-
conquer approach; Merge, Quick Sort, Greedy approach; Dynamic
programming; Elements of Dynamic Programming, Search trees; Heaps;

129 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Hashing; Graph algorithms, shortest paths, sparse graphs, String matching;

Introduction to complexity classes

1. Introduction
2. Role of algorithms in computing
3. Analysis on nature of input and size of input Asymptotic notations; Big-
O, Big Ω, Big Θ, little-o, little-ω
4. Sorting Algorithm analysis
5. Loop invariants
6. Recursion and recurrence relations
7. Algorithm Design Techniques
7.1. Brute Force Approach,
7.2. Divide-and-conquer approach
7.2.1. Merge, Quick Sort,
Contents
7.3. Greedy approach
7.4. Dynamic programming
7.4.1. Elements of Dynamic Programming
8. Search trees
9. Heaps
10. Hashing
11. Graph algorithms
11.1. shortest paths,
11.2. sparse graphs,
12. String matching
13. Introduction to complexity classes

• Interactive class session

Teaching-learning
• Hands on practices in class
Strategies
• Brainstorming and Group discussion sessions

Assignments • Paper based written assignments 6

130 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Sr. # Elements Weightage Details

1 Formative 25% It is continuous assessment. It includes

Assessment classroom participation, attendance,
assignments and presentations,
homework, attitude and behavior,
hands-on-activities, short tests, quizzes
etc.

Assessment and 2 Midterm 35% It takes place at the mid-point of the

Examinations Assessment semester.

3 Final 40% It takes place at the end of the

Assessment semester. It is mostly in the form of a
test, but owing to the nature of the
course the teacher may assess their
students based on term paper, research
proposal development, field work and
report writing etc.

• Introduction to Algorithms (3rd edition) by Thomas H. Corman,

Charles E. Leiserson, Ronald L. Rivest and Clifford Stein
• Algorithm Design, (1st edition, 2013/2014), Jon Kleinberg, Eva
Textbooks
Tardos
• Algorithms, (4th edition, 2011), Robert Sedgewick, Kevin Wayne

• Handout provided by the teacher.

Reference
• PowerPoint Presentations
Material/Suggested
• Various books Chapters / Notes
Readings
• Internet resources

131 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• Academic integrity is expected of all students. Plagiarism or

cheating in any assessment will result in at least an F grade in the
course, and possibly more severe penalties.
• You bear all the responsibility for protecting your assignments from
plagiarism. If anyone else submits your assignment or uses your
code in his/her assignment, you will be considered equally
Notes
responsible.
• The instructor reserves the right to modify the grading
scheme/marks division and course outline during the semester.
• There is no makeup for a missed sessional grading instruments like
quizzes, assignments, and homework’s.

132 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code DD-409

Course Title Parallel and Distributed Computing

Theory Lab
Credit Hours
2 1

Lecture Duration 60 minutes (1 Hours), 2 lectures per week, 3 hours lab session per week

Semester 7

Courses Knowledge

Pre-requisites Data Structures and Algorithms,

Operating Systems

Follow Up Courses

Course Learning Outcomes (CLOs)

CLO No Course Learning Outcome Bloom Taxonomy

CLO-1 Learn about parallel and distributed computers. C2 (Understand)
Write portable programs for parallel or distributed
CLO-2 architectures using Message-Passing Interface (MPI) C2 (Understand)
library
Analyze complex problems with shared memory
CLO-3 C4 (Analyze)
programming with openMP.
Aims and 1. Students will learn the parallel execution of the code parts. They will
Objectives design the logic of the code so they parallel execution is possible.

After the theory and lab, the student and code the programs to exploit
Learning
parallel architecture of the multicore computers and distributed
Outcomes:
computing environment.

133 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Asynchronous/synchronous computation/communication, concurrency

control, fault tolerance, GPU architecture and programming, heterogeneity,
interconnection topologies, load balancing, memory consistency model,
memory hierarchies, Message passing interface (MPI), MIMD/SIMD,
multithreaded programming, parallel algorithms & architectures, parallel
Syllabus I/O, performance analysis and tuning, power, programming models (data
parallel, task parallel, process-centric, shared/distributed memory),
scalability and performance studies, scheduling, storage systems,
synchronization, and tools (Cuda, Swift, Globus, Condor, Amazon AWS,
OpenStack, Cilk, gdb, threads, MPICH, OpenMP, Hadoop, FUSE).

1. Asynchronous/synchronous computation/communication,
2. Concurrency control, fault tolerance,
3. GPU architecture and programming,
4. Heterogeneity, interconnection topologies, load balancing, memory
consistency model,
5. Memory hierarchies,
Contents 6. Message passing interface (MPI), MIMD/SIMD, multithreaded
programming, parallel algorithms & architectures, parallel I/O
7. Performance analysis and tuning, power, programming models (data
parallel, task parallel, process-centric, shared/distributed memory),
scalability and performance studies, scheduling, storage systems,
8. Synchronization, and tools (Cuda, Swift, Globus, Condor, Amazon AWS,
OpenStack, Cilk, gdb, threads, MPICH, OpenMP, Hadoop, FUSE).
Teaching-learning The students will be given all round knowledge of the subject oral/on white
Strategies board/assignments/sudden quizzes during class rooms only.

Assignments Assignments will be assigned throughout the course.

Sr. # Elements Weightage Details

1 Formative 25% It is continuous assessment. It includes:

Assessment classroom participation, attendance,
Assessment and
assignments and presentations,
Examinations
homework, attitude and behavior,
hands-on-activities, short tests, quizzes
etc.

134 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

2 Midterm 35% It takes place at the mid-point of the

Assessment semester.

3 Final 40% It takes place at the end of the

Assessment semester. It is mostly in the form of a
test, but owing to the nature of the
course the teacher may assess their
students based on term paper, research
proposal development, field work and
report writing etc.

• Distributed Systems: Principles and Paradigms, A. S. Tanenbaum

and M. V. Steen, Prentice Hall, 2nd Edition, 2007
Textbooks
• Distributed and Cloud Computing: Clusters, Grids, Clouds, and the
Future Internet, K Hwang, J Dongarra and GC. C. Fox, Elsevier, 1st Ed.
Reference
Material/Suggested All reference Material/readings will be provided during lectures as per
Readings the class performance and their interest in the degree program overall.

Notes Students will take their own notes during class.

135 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code DD-223

Course Title Advance Statistics

Theory Lab
Credit Hours
3 0

Lecture Duration 90 minutes (1.5 Hours), 2 lectures per week

Semester 4

Courses Knowledge
Pre-requisites
Probability and Statistics

Follow Up Courses

Course Learning Outcomes (CLOs)

CLO No Course Learning Outcome Bloom Taxonomy

CLO-1 Apply preprocessing techniques on any given raw data. C3 (Apply)
Select and apply proper data mining algorithm to discover
CLO-2 C3 (Apply)
interesting patterns.
Analyze and extract patterns to solve problems and point
CLO-3 C4 (Analyze)
out how to deploy solution
Evaluate systematically supervised, semi supervised and
CLO-4 unsupervised models and algorithms with respect to their C4 (Analyze)
accuracy
Aims and o Students will learn advanced statistical techniques to analyze
Objectives the data to the next level.

Learning
Students will become sufficiently confident to analyze data
Outcomes:

Introduction to Statistics, Use of Statistics in Data Science, Experimental

Syllabus
Design, Statistical Techniques for Forecasting, Interpolation/ Extrapolation,

136 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Introduction to Probability, Conditional Probability, Prior and Posterior

Probability, Random number generation (RNG), Techniques for RNG,
Correlation analysis, Chi Square Dependency tests, Diversity Index, Data
Distributions Multivariate Distributions, Error estimation, Confidence
Intervals, Linear transformations, Gradient Descent and Coordinate
Descent, Likelihood inference, Revision of linear regression and likelihood
inference, Fitting algorithms for nonlinear models and related diagnostics,
Generalized linear model; exponential families; variance and link functions,
Proportion and binary responses; logistic regression, Count data and Poisson
responses; log-linear models, Overdispersion and quasi-likelihood;
estimating functions, Mixed models, random effects, generalized additive
models and penalized regression; Introduction to SPSS, Probability/
Correlation analysis/ Dependency tests/ Regression in SPSS.
1. Introduction to Statistics, Use of Statistics in Data Science,
2. Experimental Design, Statistical Techniques for Forecasting,
3. Interpolation/ Extrapolation, Introduction to Probability, Conditional
Probability, Prior and Posterior Probability,
4. Random number generation (RNG), Techniques for RNG, Correlation
analysis,
5. Chi Square Dependency tests, Diversity Index, Data Distributions
Multivariate Distributions, Error estimation, Confidence Intervals,
6. Linear transformations, Gradient Descent and Coordinate Descent,
Likelihood inference, Revision of linear regression and likelihood
Contents inference,
7. Fitting algorithms for nonlinear models and related diagnostics,
Generalized linear model; exponential families; variance and link
functions,
8. Proportion and binary responses; logistic regression, Count data and
Poisson responses; log-linear models, Overdispersion and quasi-
likelihood; estimating functions,
9. Mixed models, random effects, generalized additive models and
penalized regression;
10. Introduction to SPSS, Probability/ Correlation analysis/ Dependency
tests/ Regression in SPSS.
Teaching-learning The students will be given all round knowledge of the subject oral/on white
Strategies board/assignments/sudden quizzes during class rooms only.

Assignments Assignments will be assigned throughout the course.

Sr. # Elements Weightage Details

137 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

1 Formative 25% It is continuous assessment. It includes:

Assessment classroom participation, attendance,
assignments and presentations,
homework, attitude and behavior,
hands-on-activities, short tests, quizzes
etc.

2 Midterm 35% It takes place at the mid-point of the

Assessment and
Assessment semester.
Examinations
3 Final 40% It takes place at the end of the
Assessment semester. It is mostly in the form of a
test, but owing to the nature of the
course the teacher may assess their
students based on term paper, research
proposal development, field work and
report writing etc.

1. Probability and Statistics for Computer Scientists, 2nd Edition, Michael

Baron.
Textbooks
2. Probability for Computer Scientists, online Edition, David Forsyth
3. Discovering Statistics using SPSS for Windows, Andy Field
Reference
Material/Suggested All reference Material/readings will be provided during lectures as per
Readings the class performance and their interest in the degree program overall.

Notes Students will take their own notes during class.

138 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code DD-221

Course Title Introduction to Data Science

Theory Lab
Credit Hours
2 1

Lecture Duration 90 minutes (1 Hours), 2 lectures per week, 3 hours lab session per week

Semester 5

Courses Knowledge
Pre-requisites
Nil

Follow Up Courses Data Mining, Data Warehousing and Business Intelligence

Course Learning Outcomes (CLOs)

CLO No Course Learning Outcome Bloom Taxonomy

Describe what Data Science is and the skill sets needed to
CLO-1 C2 (Understand)
be a data scientist.
CLO-2 Apply EDA and the Data Science process in a case study. C3 (Apply)
Comprehend the fundamental constructs of Python
CLO-3 C2 (Understand)
programming language.
Apply basic machine learning algorithms to solve real
CLO-4 C3 (Apply)
world problems of moderate complexity.
1. Data Science is the study of the generalizable extraction of
knowledge from data.

Aims and 2. Being a data scientist requires an integrated skill set spanning

Objectives mathematics, statistics, machine learning, databases and other

branches of computer science along with a good understanding of
the craft of problem formulation to engineer effective solutions.

139 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

3. The aim of this course is to: Introduce students to this rapidly

growing field and equip them with some of its basic principles and
tools as well as its general mindset.
4. Explain the significance of exploratory data analysis in data science.
Identify common approaches used for Feature Generation as well
as Feature Selection, and finally discuss the Ethical and Privacy
issues.
5. Programming language Python has been proposed for the practical
work of this course.

• Describe what Data Science is and the skill sets needed to be a data
scientist.
• Apply EDA and the Data Science process in a case study.

Learning Outcomes • Comprehend the fundamental constructs of Python programming

language.
• Apply basic machine learning algorithms to solve real world
problems of moderate complexity.

Introduction: What is Data Science? Big Data and Data Science hype,
Datafication, Current landscape of perspectives, Skill sets needed;
Statistical Inference: Populations and samples, Statistical modeling,
probability distributions, fitting a model, Intro to Python; Exploratory Data
Analysis and the Data Science Process; Basic Machine Learning Algorithms:
Syllabus Linear Regression, k-Nearest Neighbors (k-NN), k-means, Naive Bayes;
Feature Generation and Feature Selection; Dimensionality Reduction:
Singular Value Decomposition, Principal Component Analysis; Mining
Social-Network Graphs: Social networks as graphs, Clustering of graphs,
Direct discovery of communities in graphs, Partitioning of graphs,
Neighborhood properties in graphs; Data Visualization: Basic principles,

140 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

ideas and tools for data visualization; Data Science and Ethical Issues:
Discussions on privacy, security, ethics, Next-generation data scientists.

1. Introduction: What is Data Science? Big Data and Data Science

hype, Datafication, Current landscape of perspectives, Skill sets
needed;
2. Statistical Inference: Populations and samples, Statistical modeling,
probability distributions, fitting a model;
3. Intro to Python;
4. Exploratory Data Analysis and the Data Science Process;
5. Basic Machine Learning Algorithms: Linear Regression, k-Nearest
Neighbors (k-NN), k-means, Naive Bayes;

Contents 6. Feature Generation and Feature Selection;

7. Dimensionality Reduction: Singular Value Decomposition, Principal
Component Analysis;
8. Mining Social-Network Graphs: Social networks as graphs,
Clustering of graphs, Direct discovery of communities in graphs,
Partitioning of graphs, Neighborhood properties in graphs;
9. Data Visualization: Basic principles, ideas and tools for data
visualization;
10. Data Science and Ethical Issues: Discussions on privacy, security,
ethics, Next-generation data scientists.

• Interactive class session

Teaching-learning • Hands on practices in class

Strategies • Brainstorming and Group discussion sessions

• Coding in LABS

• Paper based written assignments 4

Assignments
• Coding assignments in Python 6

Sr. # Elements Weightage Details

141 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

1 Formative 25% It is continuous assessment. It includes:

Assessment classroom participation, attendance,
assignments and presentations,
homework, attitude and behavior,
hands-on-activities, short tests, quizzes
etc.

2 Midterm 35% It takes place at the mid-point of the

Assessment and
Assessment semester.
Examinations
3 Final 40% It takes place at the end of the
Assessment semester. It is mostly in the form of a
test, but owing to the nature of the
course the teacher may assess their
students based on term paper, research
proposal development, field work and
report writing etc.

• An Introduction to Data Science, Jeffrey S. Saltz, Jeffrey M. Stanton,

SAGE Publications, 2017.
Textbooks • Python for everybody: Exploring data using Python 3, Severance,
C.R., CreateSpace Independent Pub Platform. 2016.

• Foundations of data science, Blum, A., Hopcroft, J., & Kannan, R.,
Vorabversion eines Lehrbuchs, 2016.
Reference • Doing Data Science, Straight Talk from the Frontline, Cathy O'Neil
Material/Suggested and Rachel Schutt, O'Reilly. 2014.
Readings • Data Science and Big Data Analytics: Discovering, Analyzing,
Visualizing and Presenting Data, EMC Education Services, John
Wiley & Sons, 2015.

142 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• Academic integrity is expected of all students. Plagiarism or

cheating in any assessment will result in at least an F grade in the
course, and possibly more severe penalties.
• You bear all the responsibility for protecting your assignments from
plagiarism. If anyone else submits your assignment or uses your
code in his/her assignment, you will be considered equally
responsible.
• The instructor reserves the right to modify the grading
scheme/marks division and course outline during the semester.
Notes
• Introductory knowledge of using the computers is assumed for this
course. All code written in quizzes, assignments, homework’s, and
exams must be in JavaScript. Code must be intelligently
documented (commented). Undocumented code may not be given
any credit.
• The IDE use is not allowed, Notepad++ has to be used for coding.
• There is no makeup for a missed sessional grading instruments like
quizzes, assignments, and homework’s.

143 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code DD-322

Course Title Data Mining and Machine Learning

Theory Lab
Credit Hours
2 1

Lecture Duration 60 minutes (1 Hours), 2 lectures per week, and 3 hours Lab work

Semester 6

Courses Knowledge

Pre-requisites DS-201 Advance Statistics,

Nil
DS-302 Introduction to Data Science

Follow Up Courses Nil

Course Learning Outcomes (CLOs)

CLO No Course Learning Outcome Bloom Taxonomy

CLO-1 Apply preprocessing techniques on any given raw data. C3 (Apply)
Select and apply proper data mining algorithm to discover
CLO-2 C3 (Apply)
interesting patterns.
Analyze and extract patterns to solve problems and point
CLO-3 C4 (Analyze)
out how to deploy solution
Evaluate systematically supervised, semi supervised and
CLO-4 unsupervised models and algorithms with respect to their C4 (Analyze)
accuracy
1. The purpose of this course is to expand on the student’s
understanding and awareness of the concepts of data mining
Aims and
basics, techniques, and application.
Objectives
2. The course aims to introduce the concepts of data pre-processing
and Summary Statistics.

144 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

3. The objective of this course is to teach students the concepts of

Frequent Item Set Generation, Associations and Correlations
measures, Classification, Prediction, and Clustering algorithms, to
apply to practical problem solving.

• Apply preprocessing techniques on any given raw data.

• Select and apply proper data mining algorithm to discover
interesting patterns

Learning Outcomes • Analyze and extract patterns to solve problems and point out how
to deploy solution
• Evaluate systematically supervised, semi supervised and
unsupervised models and algorithms with respect to their accuracy

Introduction to data mining and basic concepts, Pre-Processing

Techniques & Summary Statistics, Association Rule mining using Apriori
Algorithm and Frequent Pattern Trees, Introduction to Classification
Types, Supervised Classification (Decision trees, Naïve Bayes
Syllabus Classification, K-Nearest Neighbors, Support Vector Machines etc.),
Unsupervised Classification (K Means, K Median, Hierarchical and
Divisive Clustering, Kohonen Self Organizing maps), outlier & anomaly
detection, Web and Social Network Mining, Data Mining Trends and
Research Frontiers. Implementing concepts using Python

Unit 1: Introduction

1.1 What is Data Mining

1.2 What kinds of data can be mined

Contents 1.3 What kind of patterns can be mined

1.4 Summary statistics
Unit 2: Data Pre-processing

2.1 Data Cleaning

145 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

2.2 Data Integration

2.3 Data Reduction
2.4 Data Transformation
2.5 Data Discretization
Unit 3: Mining Frequent Patterns and Associations Rules
3.1 Apriori algorithm
3.2 Generating association rules from frequent itemsets
3.3 Frequent pattern growth for finding frequent itemsets
Unit 4: Classification

4.1 Basics and types

4.2 Supervised classification
4.3 Supervised classification models: Decision Trees, Naïve
Bayes, Model evaluation and selection
4.4 Techniques to improve model performance
Unit 5: Clustering

5.1 What is Clustering

5.2 Cluster Analysis
5.3 Partitioning methods (k-means, k-mediods)
5.4 Hierarchical methods
Unit 6: Outlier and anomaly detection

6.1 What are outliers and how they affect data

6.2 Outlier analysis

6.3 Outlier detection methods

Unit 7: Recent Trends

7.1 Web and Social Network Mining

146 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

7.2 Research frontiers

• Multimedia presentations involving interactive sessions with

Teaching-learning students

Strategies • Hands on exercises for concept reinforcement

• Coding in laboratory

There would be 4 programming assignments (equally divided between pre

Assignments
and post midterm)

Sr. # Elements Weightage Details

1 Formative 25% It is continuous assessment. It includes:

Assessment classroom participation, attendance,
assignments and presentations,
homework, attitude and behavior,
hands-on-activities, short tests, quizzes
etc.

Assessment and 2 Midterm 35% It takes place at the mid-point of the

Examinations Assessment semester.

3 Final 40% It takes place at the end of the

Assessment semester. It is mostly in the form of a
test, but owing to the nature of the
course the teacher may assess their
students based on term paper, research
proposal development, field work and
report writing etc.

Han, J., Kamber, M., Pei, J. (2011). Data Mining: Concepts and

Textbooks Techniques. (3rd Edition). Morgan Kaufmann Publishers.

ISBN 978-0-12-381479-1

147 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• Tan, P., Steinbach, M., Karpatne, A., Kumar V. (2019). Introduction

to Data Mining (2nd Edition). New York: Pearson Education, Inc.

ISBN-13: 9780133128901
• Aggarwal, C. C. (2015). Data Mining: The Textbook. Springer
Reference International Publishing. ISBN-13: 978-3319141411
Material/Suggested • Hand, D., Mannila, H., Smyth, P. (2001). Principles of Data Mining.
Readings MIT Press. ISBN-13: 978-0262082907

• Pattern Recognition & Machine Learning, 1st Edition, Chris Bishop

• Machine Learning: A Probabilistic Perspective, 1st Edition, Kevin R

Murphy

• Applied Machine Learning, online Edition, David Forsyth

• Academic integrity is expected of all students. Plagiarism or

cheating in any assessment will result in at least an F grade in the
course, and possibly more severe penalties

Notes • There is no makeup for a missed sessional grading instruments like

quizzes, assignments, and homework
• The instructor reserves the right to modify the grading
scheme/marks division and course outline during the semester

148 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Detailed Lecture wise plan

Sourc Recommendat
Wee Lectur e ion for
Topic
k e Book Learning
(Ch#) Activities
1 1 Introduction Ch#1
2 Getting to know the data Ch#2
2 3 Statistical descriptors of data Reading-1
4 Data visualization; similarity measures Quiz-1
3 5 Data Pre-processing: cleaning, integration Ch#3
6 Data reduction
4 7 Data Transformation and discretization Assignment-1
8 Mining frequent patterns: basics, market basket Ch#6
analysis
5 9 Frequent itemsets, closed itemsets, association Reading-2
rules; Mining frequent itemsets
10 Apriori algorithm, improving the efficiency of apriori
algorithm
6 11 Pattern growth approach to mining frequent
itemsets; FP-tree
12 FP-growth algorithm
7 13 Mining frequent itemsets for vertical data format Assignment-2
14 Mining closed and max pattens
8 15 Pattern evaluation methods Quiz-2
16 Midterm review
Midterm Exam
9 17 Classification: introduction, types Ch#8 Reading-3
18 Supervised classification: Decision tree induction
algorithm
10 19 Attribute selection metrics
20 Tree pruning, scalability issues Assignment-3
11 21 Bayes classification: Naïve Bayes
22 Model evaluation and selection
12 23 Techniques to improve model performance Reading-4
24 Clustering: basics, cluster analysis Ch#10 Quiz-3
13 25 Partitioning methods: K-means algorithm
26 K-medoids algorithm Reading-5
14 27 Hierarchical clustering methods
28 Outiers and its types Ch#12 Assignment-4
15 29 Outlier analysis Quiz-4
30 Outlier detection methods
16 31 Recent trends Ch#13 Reading-6

149 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Sourc Recommendat
Wee Lectur e ion for
Topic
k e Book Learning
(Ch#) Activities
32 Final term review
Final Exam

150 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS data science

Course Code DD-321

Course Title Data Warehousing and Business Intelligence

Theory Lab
Credit Hours
2 1

Lecture Duration 60 minutes (1 Hours), 2 lectures per week

Semester 5

Courses Knowledge
Pre-requisites
Introduction to Data Science Nil

Follow Up Courses Big Data Analytics

Course Learning Outcomes (CLOs)

CLO No Course Learning Outcome Bloom Taxonomy

Demonstrate an appreciation of the role that Data Warehouses
CLO-1 and Business Intelligence play in enhancing the decision- C2 (Understand)
making process.
Demonstrate an understanding of the fundamental concepts of
CLO-2 the Star and the Snowflake Schema; learn how to design the C2 (Understand)
schema of a DW based on these two models.
Understand the architecture of DW Systems and be able to
CLO-3 C3 (Apply)
specify the advantages and potential problem areas
Use Analytic SQL to aggregate, analyze and report, and model
CLO-4 C3 (Apply)
data.
Upon completion of this course, the student will be able to:
Aims and 1. Grasp modeling of data warehouse
2. Design Data Warehouse
Objectives
3. Implement Data Warehouse and BI
•
Learning Outcomes At the end of the course, you should be able to:

151 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• Demonstrate an appreciation of the role that Data Warehouses and

Business Intelligence play in enhancing the decision-making process
• Demonstrate an understanding of the fundamental concepts of the Star
and the Snowflake Schema; learn how to design the schema of a DW
based on these two models.
• Understand the architecture of DW Systems and be able to specify the
advantages and potential problem areas
• Use Analytic SQL to aggregate, analyze and report, and model data.
1. Introduction to Data Warehouse and Business Intelligence
1.1. Necessities of BI
1.2. Essentials of Business Intelligence
1.3. DW Life Cycle
1.4. Basic Architecture
2. DW Architecture in SQL Server
2.1. Logical Model
2.2. Indexes
2.3. Physical Model
2.4. Optimizations
3. OLAP Operations

Contents 3.1. Queries

3.2. Query Optimization
4. Building the DW
4.1. Data visualization
4.2. Reporting based on Data Warehouse
4.3. Reporting using SSAS
4.4. Reporting using Tableau
5. Data visualization
5.1. Reporting with visualization
5.2. Reporting based on Cube
5.3. Reports management
6. Dashboard management

152 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

6.1. PowerBI Dashboard

6.2. Dashboard Enrichment
7. Business Intelligence Tools.

• Interactive class session

Teaching-learning • Hands on practices in class

Strategies • Brainstorming and Group discussion sessions

• Paper based written assignments 3

Assignments • Project 2
• Quiz 4

Sr. # Elements Weightage Details

1 Formative 25% It is continuous assessment. It

includes: classroom participation,
Assessment
attendance, assignments and
presentations, homework, attitude
and behavior, hands-on-activities,
Assessment and short tests, quizzes etc.
Examinations 2 Midterm 35% It takes place at the mid-point of the
semester.
Assessment

3 Final 40% It takes place at the end of the

semester. It is mostly in the form of a
Assessment
test, but owing to the nature of the
course the teacher may assess their
students based on term paper.
• W. H. Inmon, “Building the Data Warehouse”, Wiley-India Edition.
• 2. Ralph Kimball, “The Data Warehouse Toolkit – Practical Techniques for
Textbooks &
Building Dimensional Data Warehouse,” John Wiley & Sons, Inc.
Reference material • 3. Matteo Golfarelli, Stefano Rizzi, “Data Warehouse Design - Modern
Principles and Methodologies”, McGraw Hill Publisher

153 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• The instructor reserves the right to modify the grading scheme/marks

Notes division and course outline during the semester.

154 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS DS

Course Code DD-222

Course Title Data Visualization & Graphics

Theory Lab
Credit Hours
2 1

Lecture Duration 60 minutes (1 Hours), 2 lectures per week, 3 hours lab session per week

Semester 5

Courses Knowledge
Pre-requisites
Nil

Follow Up Courses Nill

Course Learning Outcomes (CLOs)

CLO No Course Learning Outcome Bloom Taxonomy

Provides knowledge about importance, necessity, and
CLO-1 justification of performing exploratory data analysis and C2 (Understand)
visualization
Introduce various type of charts along with their
CLO-2 alternatives solution to show same data from versatile C2 (Understand)
aspects.
Improving the competency of the students to analyze
CLO-3 different problems and select the most appropriate C3 (Apply)
solution.
Use of R, various recent tools, and technologies to develop
CLO-4 hands-on skills for exploratory data analysis and C3 (Apply)
visualization.
1. Provides knowledge about importance, necessity, and justification

Aims and of performing exploratory data analysis and visualization

Objectives 2. Introduce various type of charts along with their alternatives

solution to show same data from versatile aspects

155 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

3. Improving the competency of the students to analyze different

problems and select the most appropriate solution
4. Use of Python, various recent tools, and technologies to develop
hands-on skills for exploratory data analysis and visualization

• Provides knowledge about importance, necessity, and justification

of performing exploratory data analysis and visualization
• Introduce various type of charts along with their alternatives
solution to show same data from versatile aspects
Learning Outcomes
• Improving the competency of the students to analyze different
problems and select the most appropriate solution
• Use of Python, various recent tools, and technologies to develop
hands-on skills for exploratory data analysis and visualization

Introduction of Exploratory Data Analysis and Visualization, Building Blocks

and Basic Operations; Types of Exploratory Graphs, single and multi-
dimensional summaries, five number summary, box plots, histogram, bar
plot and others; Distributions, their representation using histograms,
outliers, variance; Probability Mass Functions and their visualization;
Syllabus Cumulative distribution functions, percentile-based statistics, random
numbers; Modelling distributions, exponential, normal, lognormal, pareto;
Probability density functions, kernel density estimation; Relationship
between variables, scatter plots, correlation, covariance; Estimation and
Hypothesis Testing; Clustering using K-means and Hierarchical; Time series
and survival analysis; Implementing concepts with Python

1. Introduction of Exploratory Data Analysis and Visualization,

2. Building Blocks and Basic Operations;

Contents 3. Types of Exploratory Graphs

4. Single and multi-dimensional summaries,
5. Five number summary

156 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

5.1. box plots,

5.2. histogram,
5.3. bar plot and others;
6. Distributions, their representation using histograms,
7. Outliers, variance;
8. Probability Mass Functions and their visualization;
9. Cumulative distribution functions,
10. Percentile-based statistics,
11. Random numbers;
12. Modelling distributions,
12.1. Exponential,
12.2. Normal,
12.3. Lognormal,
12.4. Pareto.
13. Probability density functions,
14. Kernel density estimation;
15. Relationship between variables,
15.1. Scatter plots,
15.2. Correlation,
15.3. Covariance;
15.4. Estimation and Hypothesis Testing;
15.5. Clustering using K-means and Hierarchical;
15.6. Time series and survival analysis
15.7. Implementing concepts with Python

• Interactive class session

Teaching-learning
• Hands on practices in class
Strategies
• Brainstorming and Group discussion sessions

Assignments • Programming Assignments 8

157 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Sr. # Elements Weightage Details

1 Formative 25% It is continuous assessment. It includes

Assessment classroom participation, attendance,
assignments and presentations,
homework, attitude and behavior,
hands-on-activities, short tests, quizzes
etc.

Assessment and 2 Midterm 35% It takes place at the mid-point of the

Examinations Assessment semester.

3 Final 40% It takes place at the end of the

Assessment semester. It is mostly in the form of a
test, but owing to the nature of the
course the teacher may assess their
students based on term paper, research
proposal development, field work and
report writing etc.

• Interactive Data Visualization with Python: Present your data as an

effective and compelling story, 2nd Edition, Abha Belorkar, Sharath
Textbooks Chandra Guntuku, Shubhangi Hora, Anshu Kumar
• Data Visualization in Python, Daniel Nielson

• Handout provided by the teacher.

Reference • PowerPoint Presentations
Material/Suggested • Various books Chapters / Notes
Readings • Internet resources

158 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• Academic integrity is expected of all students. Plagiarism or

cheating in any assessment will result in at least an F grade in the
course, and possibly more severe penalties.
• You bear all the responsibility for protecting your assignments from
plagiarism. If anyone else submits your assignment or uses your
code in his/her assignment, you will be considered equally
Notes
responsible.
• The instructor reserves the right to modify the grading
scheme/marks division and course outline during the semester.
• There is no makeup for a missed sessional grading instruments like
quizzes, assignments, and homework’s.

159 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code ED-421

Course Title Big Data Analytics

Theory Lab
Credit Hours
2 1

Lecture Duration 60 minutes (1 Hours) 2 lectures per week, 3 hours Lab per week

Semester 7

Courses Knowledge

Basic statistics and

Pre-requisites
programming knowledge is
required

Follow Up Courses

Course Learning Outcomes (CLOs)

CLO No Course Learning Outcome Bloom Taxonomy

Understand the fundamental concepts of Big Data and its
CLO-1 C2 (Understand)
programming paradigm.
Hadoop/MapReduce Programming, Framework, and
CLO-2 C3 (Apply)
Ecosystem
CLO-3 Apache Spark Programming C3 (Apply)
1. The main goal of this course is to help students learn, understand,
and practice applications for big data analytics and machine
learning approach.
Objectives
2. Students will get hands-on experience in applying big data
technologies and machine learning techniques to industry
applications.

160 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• Ability to identify the characteristics of datasets

• Ability to select and implement machine learning techniques for
different type of applications
• Solve problems associated with batch learning and online
Learning Outcomes learning, and the big data characteristics such as high
dimensionality, dynamically growing data and in particular
scalability issues
• Ability to integrate machine learning libraries with modern
technologies like hadoop and mapreduce.

1. Introduction to Big Data Analytics

1.1 Concept, History, and Trends

2. Big Data Platforms

2.1 Hadoop, Spark, and NoSQL Stores

3. Data Store & Processing using Hadoop

3.1 Introduction to MapReduce

3.2 Programming Hadoop

4. Big Data Storage and Analytics

Contents 4.1 HDFS

4.2 NoSQL databases

5. Big Data Analytics using ML Algorithms

5.1 Introduction to Predictive Analytics

5.2 Machine Learning Algorithm Types

5.3 Big Data and ML

6. Recommendation Systems

6.1 Introduction

6.2 Type of Recommendation System

161 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

6.3 Recommendation Systems using Big

7. Supervised and Unsupervised Learning

7.1 Introduction to Supervise Learning

7.2 Supervised Learning Algorithms

7.3 Introduction to Unsupervised Learning

7.4 Unsupervised Learning Algorithms

7.5 Cases Studies for Supervised and Unsupervised Learning

8. Linked Big Data: Graph Computing and Graph Analytics
9. Big Data Visualization
10. Dimensionality Reduction in Big Data
11. Big Data Applications in Healthcare, IoT, and Smart Cities

11.1 Case Studies for Big Data in different Industries

12. Research topics in Big Data Analytics

• Interactive class session

Teaching-learning
• Hands on assignments and tutorials
Strategies
• Group project

Assignments • Practical Assignments 5

Sr. # Elements Weightage Details

1 Formative 25% It is continuous assessment. It

Assessment includes: classroom participation,
Assessment and
attendance, assignments and
Examinations
presentations, homework, attitude
and behavior, hands-on-activities,
short tests, quizzes etc.

162 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

2 Midterm 35% It takes place at the mid-point of

Assessment the semester.

3 Final 40% It takes place at the end of the

Assessment semester. It is mostly in the form
of a test, but owing to the nature
of the course the teacher may
assess their students based on
term paper, research proposal
development, field work and
report writing etc.

• Leskovec, J., Rajaraman, A., & Ullman, J. D. (2020). Mining of

massive data sets. Cambridge university press.
Reference
• White, T. (2012). Hadoop: The definitive guide. O'Reilly Media,
Material/Suggested
Inc.
Readings
• Lin, J., & Dyer, C. (2010). Data-intensive text processing with
MapReduce. Synthesis Lectures on Human Language
Technologies, 3(1), 1-177.

• Academic integrity is expected of all students. Plagiarism or

cheating in any assessment will result in at least an F grade in the
course, and possibly more severe penalties.
• You bear all the responsibility for protecting your assignments

Notes from plagiarism. If anyone else submits your assignment or uses

your code in his/her assignment, you will be considered equally
responsible.
• The instructor reserves the right to modify the grading
scheme/marks division and course outline during the semester.

163 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• There is no makeup for a missed sessional grading instruments

like quizzes, assignments, and homework’s.

164 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Detailed Lecture wise plan

Recommendation
SourceBook
Week Lecture Topic for Learning
(Ch#)
Activities
1 1 Introduction to Big Data Analytics
2 Concept, History, and Trends Assignment

2 3 Big Data Platforms

4 Hadoop, Spark, and NoSQL Stores Quiz

3 5 Data Store & Processing using

Hadoop
6 Introduction to MapReduce
4 7 Programming Hadoop Assignment

8 Big Data Storage and Analytics

5 9 HDFS Quiz

10 NoSQL databases
6 11 Big Data Analytics using ML Assignment

Algorithms
12 Introduction to Predictive Analytics
7 13 Machine Learning Algorithm Types
14 Big Data and ML Assignment

8 15 Introduction to Recommendation
Systems
16 Type of Recommendation System
Midterm Exams
9 17 Recommendation Systems using Big Quiz

Data

165 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendation
SourceBook
Week Lecture Topic for Learning
(Ch#)
Activities
18 Importance of Supervised and
Unsupervised Learning
10 19 Introduction to Supervise Learning
20 Supervised Learning Algorithms
11 21 Introduction to Unsupervised
Learning
22 Unsupervised Learning Algorithms Assignment

12 23 Cases Studies for Supervised and

Unsupervised Learning
24 Linked Big Data: Graph Computing Quiz

and Graph Analytics

13 25 Big Data Visualization
26 Dimensionality Reduction in Big
Data
14 27 Big Data Applications in Healthcare,
IoT, and Smart Cities
28 Big Data Applications in Healthcare, Quiz

IoT, and Smart Cities (Cont.)

15 29 Case Studies for Big Data in different
Industries
30 Research topics in Big Data
Analytics

166 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendation
SourceBook
Week Lecture Topic for Learning
(Ch#)
Activities
16 31 Research topics in Big Data Research Papers
Reading
Analytics (Cont.)
32 Research topics in Big Data Research Papers
Reading
Analytics (Cont.)
Final Exam

167 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code MS-251

Course Title Probability and Statistics

Theory Lab
Credit Hours
3 Cr Hrs 0

Lecture Duration 90 minutes (1.5 Hours), 2 lectures per week

Semester 2

Courses Knowledge
Pre-requisites

Follow Up Courses Advanced Statistics

Course Learning Outcomes (CLOs)

CLO No Course Learning Outcome Bloom Taxonomy

Acquire knowledge related to the concepts, tools and

CLO-1 techniques for the design of digital electronic C2 (Understand)
circuits
1. Students will get a strong foundation of probability and statistics.
2. Students will get in depth knowledge of how to do statistical analysis
and apply them in real life scenario.
Aims and Objectives 3. Students should be able to apply the learned concepts in MATLAB.
4. After the completion of this course students should be able to conduct
research based surveys. It is expected from a student to submit a paper
in a conference or journal based on their project.
Learning Outcomes •

Topics: Introduction to Statistics, Pure Probability, Random Variables (Discrete

Syllabus and Continuous, Joint Random Variables), Probability Distribution (Discrete
and Continuous, Binomial, Hypergeometric, Poisson, Normal distributions.),

168 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Sampling, Sampling Distributions (for mean large and small sample, difference
between means for large and small samples, proportions, t distribution),
Estimation point and confidence interval estimation (mean for large and small
sample, difference between mean for large and small samples, proportions),
Hypothesis Testing (for mean, difference between mean, proportion,
independence of variables). Three sigma rule, law of large numbers,
Simulation and application of all learned the concepts in MATLAB.

BOOK(A):
Chapter 1: Introduction to Statistics and Data Analysis
1.3 Measures of location
1.4 Measures of variability
Chapter 3: Concept of a Random Variable and Discrete Probability
Distributions
3.1 Concepts of random variable
3.2 Discrete probability distributions
Chapter 5: Some Discrete Probability Distributions
5.3 Hypergeometric distribution
5.4 Negative binomial and geometric distribution
Contents
5.5 Poisson distribution and the Poisson process
Chapter 6: Some Continuous Probability Distributions
6.1 Continuous uniform distribution
6.2 Normal distribution
6.3 Areas under the normal curve
6.4 Application of the normal distribution
6.5 Normal approximation to the normal
Chapter 8: Fundamental Sampling Distribution and Data Description
8.1 Hypergeometric distribution
8.2 Negative binomial and geometric distribution
8.3 Poisson distribution and the Poisson process

169 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

8.4 Sampling distribution of mean and central limit theorem

Chapter 9: One- and Two- Sample Estimation Problems
9.1 Introduction
9.2 Statistical inference
9.3 Classical methods of estimation
Chapter 10: One- and Two- Sample Tests of Hypothesis
10.1 Statistical hypothesis
10.2 Testing a statistical hypothesis
10.4 Single sample
10.5 Two samples
10.8 One sample
10.9 Two samples
BOOK(B):
Chapter 1: Basic Concepts:
• Course introduction
• Probability
• probability experiment
• outcome, trial
• sample space
• random
• equally likely
• event
• simple event
• compound event
• classical probability
• probability rules

Chapter 2: Sample Spaces:

• Impossible event

170 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• Unlikely event
• 50-50 event
• Likely event
• Certain event
• Complement of an event
• Frequency distributions
• Empirical probability
• Sample, population
• Law of large numbers
• Subjective probability
• Tree diagrams
• Tables

Chapter 3: The Addition Rules:

• Addition rules
• Mutually exclusive event
• Not mutually exclusive event
• Addition Rule I
• Addition Rule II

Chapter 4: The Multiplication:

• The multiplication rules
• Independent events
• Dependent events
• Multiplication Rule I
• Multiplication Rule II
• Conditional probability
• Alternative approach of calculating conditional probability

Chapter 7: The Binomial Distribution

171 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• Binomial distribution
• Binomial experiment
• Mean
• Standard deviation
• Variance of binomial distribution
• Calculating probabilities using formula
• Tables

Chapter 8: Other Probability Distribution

• Hypergeometric distribution
• Hypergeometric experiment
• Mean
• Standard deviation
• Variance of hypergeometric distribution
• Calculating probabilities using formula
• Table

MATLAB. Relationship to the binomial distribution.

Chapter 1:

Teaching-learning
•
Strategies

Assignments Types and Number with calendar

Sr. # Elements Weightage Details

Assessment and 1 Formative 25% It is continuous assessment. It includes:

Examinations Assessment classroom participation, attendance,
assignments and presentations, homework,

172 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

attitude and behavior, hands-on-activities,

short tests, quizzes etc.

2 Midterm 35% It takes place at the mid-point of the

Assessment semester.

3 Final 40% It takes place at the end of the semester. It

Assessment is mostly in the form of a test, but owing to
the nature of the course the teacher may
assess their students based on term paper,
research proposal development, field work
and report writing etc.

A. R.E. Walpole, R.H. Myers and S.L Myers, “Probability and Statistics for
Engineers and Scientists’’, Prentice Hall, 9th Edition

B. Allan G. Bluman, “Probability Demystified’’, McGraw-Hill Professional, 1st

Edition (January 27, 2005)
Textbooks

C. Larry J. Stephens, “Advanced Statistics Demystified’’, McGraw-Hill

Professional, 1st Edition (June 1, 2004)

R1. Valerie M. Sue and Lois A. Ritter, “Conducting Online Surveys’’,

SAGE Publications, Inc, 2nd Edition (November 23, 2011)

Reference R2. Vivek Bhaskaran and Jennifer LeClaire, “Online Surveys For
Dummies’’, For Dummies, 1st Edition (June 15, 2010)
Material/Suggested
R3. David McMahon, “MATLAB Demystified’’, McGraw-Hill
Readings Professional, 1st Edition (April 6, 2007)

R4. Timothy A. Davis Kermit Sigmon, “MATLAB® Primer’’, CRC

Press, 8th Edition (August 18, 2010)

• MATLAB
Notes • Slides for each topic

173 | P a g e
Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

174 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Detailed Lecture wise plan

Recommen
Wee Lectur Sourcebook dation for
Topic
k e (Ch#) Learning
Activities
1 1 Course introduction, probability, probability B. Chapter 1:
experiment, outcome, trial, sample space, Basic
random, equally likely, event, simple event, concepts
compound event, classical probability, and
probability rules
2 Impossible event, unlikely event, 50-50 event, B. Chapter 2:
likely event, certain event, complement of an Sample
event, frequency distributions, empirical Spaces
probability, sample, population, law of large
numbers, subjective probability, tree diagrams,
and tables
2 3 Addition rules, mutually exclusive event, not B. Chapter 3:
mutually exclusive event, addition Rule I, and The Addition
addition Rule II Rules
MATLAB: Introduction to MATLAB, command R4. Chapter 1:
window and basic arithmetic Getting
Started
R4. Chapter 2:
The MATLAB
Desktop
R4. Chapter 3:
Matrices and
Matrix
Operations
4 The multiplication rules, independent events, B. Chapter 4:
dependent events, Multiplication Rule I, and The
Multiplication Rule II Multiplication
MATLAB: Referencing individual entries, Rules
relational operators, logical operators, R4. Chapter 3:
simulation of coin tosses, simulation of the sum Matrices and
of two fair dice Matrix
Operations
3 5 Conditional probability, alternative approach of B. Chapter 4: Assign-1
calculating conditional probability. The
Multiplication
Rules

175 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommen
Wee Lectur Sourcebook dation for
Topic
k e (Ch#) Learning
Activities
6 Concepts of random variable, probability A. Chapter 3: Quiz#1
distribution, discrete probability distributions, Concept of a
Random
properties of discrete probability distributions,
Variable and
types of discrete probability distributions.
Discrete
Probability
Distributions
B. Chapter 7:
The Binomial
Distribution
B. Chapter 1,
2, 3, and 4
4 7 Binomial distribution, binomial experiment, B. Chapter 7:
mean, standard deviation, and variance of The Binomial
binomial distribution Distribution
8 Binomial distribution: calculating probabilities B. Chapter 7:
using formula, tables, and MATLAB. binomial The Binomial
Distribution
approximation to Gaussian distribution.
A. Chapter 5.2
MATLAB: binopdf
5 9 Hypergeometric distribution, hypergeometric B. Chapter 8:
experiment, mean, standard deviation, and Other
variance of hypergeometric distribution. Probability
Distribution
A. Chapter 5.3
10 Hypergeometric distribution: calculating B. Chapter 8: Quiz#2
probabilities using formula, table, and MATLAB. Other
Relationship to the binomial distribution. Probability
Distributions
A. Chapter 5.3
6 11 Binomial approximation to hypergeometric
distribution.

MATLAB: hygepdf(x, N, k, n). The 68-95-99.7

rule - or three-sigma rule, or empirical rule.
12 A. Chapter 5.3 A. Chapter 5.5

7 13 Mean, standard deviation, and variance of the A. Chapter 5.5

Poisson distribution

176 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommen
Wee Lectur Sourcebook dation for
Topic
k e (Ch#) Learning
Activities
14 Nature of the Poisson probability function, A. Chapter 5.5 Assign-2
binomial distribution approximation to Poisson R1-Reading
Material
distribution.
8 15 Tutorial on conducting research based surveys. R1 Quiz#3

16 Some continuous probability distributions: A. Chapter 6.1

continuous uniform distribution, pdf, mean, and
variance
MATLAB: unifpdf

Mid Term Examination

9 17 Some continuous probability distributions: A. Chapter 6.2 Project
Normal distribution, pdf, properties of the proposal
normal distribution, mean, and variance submission
deadline
18 Normal curves with different combination of A. Chapter 6.3
values of mean and standard deviation
Areas under the normal curve, standard normal
distribution.
10 19 Using the normal curve in reverse A. Chapter 6.3

20 Applications of the normal distribution A. Chapter 6.4 Project

questionnai
re
submission
deadline

11 21 Normal approximation to binomial distribution A. Chapter 6.5

Matlab: normpdf
22 Measures of location: the sample mean and A-Chapter 1.3 Assign-3
median

177 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommen
Wee Lectur Sourcebook dation for
Topic
k e (Ch#) Learning
Activities
12 23 Other measures of locations: trimmed means A-Chapter 1.4 Project data
Measures of variability: sample range and collection
sample standard deviation, units for standard deadline
deviation and variance, which variability
measure is more important?
24 Fundamental sampling distributions and data A-Chapter 1.4 Quiz#4
descriptions: random sampling, populations and
samples
.
13 25 Some important statistics: location measures of A-Chapter
a sample: the sample mean, median, and mode. 8.1-8.2
Variability measures of a sample: the sample
variance, standard deviation, And range
26 Sampling distributions: inference about the A-Chapter 8.3
population from sample information A-Chapter 8.4
Sampling distribution of means and the central
limit theorem
14 27 One- and Two-Sample Estimation Problems: A-Chapter 9.1,
Statistical Inference, Classical Methods of 9.2, 9.3
Estimation, Unbiased Estimator, Variance of a
Point Estimator, Interval Estimation
28 Single sample: estimating the mean, confidence A-Chapter 9.4, Quiz#5
interval on μ, σ2 known, one-sided confidence 9.5
bounds, one-sided confidence bounds on μ, σ2
known, the case of σ unknown, confidence
interval on μ, σ2 known, concept of a large-
sample confidence interval, standard error of a
point estimate

178 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommen
Wee Lectur Sourcebook dation for
Topic
k e (Ch#) Learning
Activities
15 29 One- and two-sample tests of hypotheses: A-Chapter Assign-4
statistical hypotheses: general concepts, the 10.1, 10.2
role of probability in hypothesis testing, the null
and alternative hypotheses, testing a statistical
hypothesis, the test statistic, the probability of a
type I error, the probability of a type II error,
one- and two-tailed tests, how are the null and
alternative hypotheses chosen?, single sample:
tests concerning a single mean, tests on a single
mean (variance known), tests on a single
sample (variance unknown) is based on normal
distribution and estimation

30 Two samples: tests on two means: unknown but A-Chapter Quiz#6

equal variances, two-sample 10.4, 10.5
pooled t-test A-Chapter
One sample: test on a single proportion 10.8
Two samples: tests on two proportions A-Chapter
10.9
16 31 Project submission deadline and presentation
32 group member.

179 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS data science

Course Code GE-162

Course Title Calculus and Analytical Geometry

Theory Lab
Credit Hours
3 0

Lecture
90 minutes (1.5 Hours), 2 lectures per week
Duration

Semester 3

Courses Knowledge
Pre-requisites
Nil Nil

Follow Up
Differential Equations
Courses

1. Students should be able to work with functions represented in a variety

of Ways: graphical, numerical, analytical, or verbal. They should
understand the Connections among these representations.
Aims and 2. Students should understand the meaning of the derivative in terms of a
rate of change and local linear approximation and should be able to use
Objectives
derivatives to solve a variety of problems.
3. Students should understand the meaning of the definite integral both as
a limit of Riemann sums and as the net accumulation of a rate of change
and should be able to use integrals to solve a variety of problems

180 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

At the end of the course, you should be able to:

• Use a variety of methods in solving real-life, practical, technical, and

theoretical problems.
Learning • Select and use an appropriate problem-solving strategy.
Outcomes • Explain the limit process and that calculus centers around this concept.
• Identify the two classical problems that were solved by the discovery of
calculus, The tangent problem and the area problem.
• Describe the two main branches of calculus, Differential calculus and
Integral calculus.

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,
Syllabus 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.

1. Limits and continuity

1.1. An intuitive approach to limits
1.2. Two sided limits and one sided limit.
1.3. Techniques of computing limits
1.4. Limits at infinity
1.5. Limit discussed more rigorously
1.6. Introduction to continuity
1.7. Techniques of checking continuity
Contents 1.8. Continuity
1.8.1. Trigonometric function
1.8.2. Inverse Trigonometric function
1.9. Limits and continuity of trigonometric functions
1.10. Exponential and Logarithmic functions
1.11. Applications of continuity
1.12. Examples of applications
2. The Derivative
2.1. Differential calculus

181 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

2.1.1. Motivation of derivatives

2.1.2. Tangent line
2.2. Geometrical and Physical meaning of derivatives
2.2.1. Derivative of a function
2.2.2. Rules of differentiation
2.2.3. Differentiation by parts
2.3. Concept and idea of differentiation
2.4. Differentiation by part
2.4.1. Techniques of differentiation
2.4.2. Derivative of trigonometric functions
2.5. Product and quotient rule
2.6. Inverse Trigonometric function
2.7. Application of derivatives as rates of change,
2.8. Derivatives of trigonometric functions
2.9. The chain rule
3. Topics in Differentiation
3.1. Implicit differentiation
3.2.

3.3. Derivatives of logarithmic functions

3.4. Implicit differentiation
3.5. Derivatives of logarithmic functions.
3.6. Derivatives of exponential and inverse trigonometric function
3.7. Local linear approximation,
3.8. Differentials
3.8.1. L’hospital rules
3.8.2. Indeterminate form
4. The derivative in Graphing and application
4.1. Analysis of functions
4.1.1. Increasing function
4.1.2. Decreasing Functions
4.2. Relative extrema
4.3. Graphing a function
4.3.1. Concavity
4.3.2. Rational functions
4.3.3. Cusps
4.3.4. Vertical tangents
4.4. Relative extrema
4.4.1. Absolute maxima
4.4.2. Absolute minima
4.4.3. Applied Maximum and minimum problem
4.4.4. Mean value theorem
4.4.5. Mean value theorem

182 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

4.4.6. Roll’s theorem

5. Integration
5.1. What is integration
5.1.1. An overview of area problems
5.2. The indefinite integrals
5.2.1. Integration by substitution
5.2.2. Area as a limit
5.3. The definite integral
5.3.1. Riemann sums and Definite Integrals,
5.3.2. The fundamental theorem of calculus
5.3.3. The definite integral by substitution
5.3.4. Transcendental functions integral
5.3.5. An overview of integration methods
5.3.6. Integration by parts
5.3.7. Integration Trigonometric Functions
5.4. Principal of integral evaluation
5.4.1. An overview of integration methods
5.4.2. Integration by parts
5.4.3. Integration Trigonometric Functions
5.4.4. Trigonometric substitution
5.4.5. Integration by partial fractions
5.4.6. Area between two curves
6. Three dimensional spaces
6.1. Parametric equations of line
6.2. Evaluation of parametric equations of lines
6.3. Planes in 3D space
6.4. Distance between planes
6.5. Distance between line and plane
6.6. Planes in 3D space
6.7. Distance between planes
6.8. Distance between line and plane
6.9. Planes in 3D space
6.9.1. Distance between planes
6.9.2. Distance between line and plane
7. Partial differentiation
7.1. Partial derivative concepts
8. Multiple integrals
8.1. Multiple integral concepts
9. Mathematical modeling with differential equations
9.1. Modeling with differential equations
9.2. Types of differential equations

183 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Teaching- • Hands on practices in class

learning • Brainstorming and Group discussion sessions on applications of the
Strategies topics.

• Paper based written assignments 6

Assignments
• Paper based Quiz 10

Sr. # Elements Weightage Details

1 Formative 25% It is continuous assessment.

classroom participation, attendance,
Assessment
assignments and presentations,
homework, attitude and behavior,
Assessment hands-on-activities, short tests,
and quizzes etc.

Examinations 2 Midterm 35% It takes place at the mid-point of the

semester.
Assessment

3 Final Assessment 40% It takes place at the end of the

semester. It is mostly in the form of a
test, but owing to the nature of the
course the teacher may assess their
students based on term paper.

Textbooks A. Thomas, G. B., Finney, R. L., Weir, M. D., & Giordano, F. R. (2003). Thomas'
calculus. Reading: Addison-Wesley.
B: Anton, H., & Nicoletti, G. (1988). Calculus (Vol. 10). New York: Wiley.
Reference C: Zill, D. G. (2016). Differential equations with boundary-value problems.
Material Cengage Learning.
D: Online Material: www.mathworld.com

184 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• The instructor reserves the right to modify the grading scheme/marks

division and course outline during the semester.
Notes
• Instructor can change the order of topics to provide ease to students to
understand.

185 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code MS-252

Course Title Linear Algebra

Theory Lab
Credit Hours
3 0

Lecture Duration 90 minutes (1.5 Hours), 2 lectures per week

Semester 3

Courses Knowledge
Pre-requisites
Nil Nil

Follow Up Courses Nil

1. Comprehend vector spaces (subspaces).

2. Understand fundamental properties of matrices including inverse
matrices, eigenvalues and linear transformations.

Aims and 3. Be able to solve linear systems of equations.

Objectives 4. Have an insight into the applicability of linear algebra.

5. Apply linear algebra concepts to model, solve, and analyze real-
world situations.
6. Students should be able to apply the learned concepts in MATLAB.

• After the completion of this course students should get the right

Learning Outcomes background to study follow-up courses e.g., computer vision, image
processing, machine learning and data science.

Linear Equations, Matrix Algebra, Vector Space, Eigenvalues and

Syllabus
Eigenvectors , Orthogonality and Least Square, and Quadratic forms

186 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Topics:
Chapter 1: Linear Equations in Linear Algebra:
1.1 Systems of Linear Equations
1.2 Row Reduction and Echelon Forms
1.3 Vector Equations
1.4 The Matrix Equation Ax = b
1.5 Solution Sets of Linear Systems
1.6 Applications of Linear Systems
1.7 Linear Independence
1.8 Introduction to Linear Transformations
1.9 The Matrix of a Linear Transformation
1.10 Linear Models in Business, Science, and Engineering
Chapter 2: Matrix Algebra:
2.1 Matrix Operations

Contents 2.2 The Inverse of a Matrix

2.3 Characterizations of Invertible Matrices
2.4 Partitioned Matrices
2.5 Matrix Factorizations
2.6 Applications to Computer Graphics
2.7 Subspaces of ℝ𝑛
2.8 Dimension and Rank
Chapter 3: Determinants:
3.1 Introduction to Determinants
3.2 Properties of Determinants
3.3 Cramer’s Rule
3.4 Volume
3.5 Linear Transformations
Chapter 4: Vector Spaces:
4.1 Vector Spaces and Subspaces

187 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

4.2 Null Spaces

4.3 Column Spaces, and Linear Transformations
4.4 Linearly Independent Sets; Bases, Coordinate Systems
4.5 The Dimension of a Vector Space
4.6 Rank
4.7 Change of Basis
Chapter 5: Eigenvalues and Eigenvectors:
5.1 Eigenvectors and Eigenvalues
5.2 The Characteristic Equation
5.3 Diagonalization
5.4 Eigenvectors and Linear Transformations
5.5 Complex Eigenvalues
5.6 Discrete Dynamical Systems
Chapter 6: Orthogonality and Least Squares
6.1 Inner Product, Length, and Orthogonality
6.2 Orthogonal Sets
6.3 Orthogonal Projections
6.4 The Gram–Schmidt Process
6.5 Least-Squares Problems
6.6 Applications to Linear Models
6.7 Inner Product Spaces
6.8 Applications of Inner Product Spaces
Chapter 7: Symmetric Matrices and Quadratic Forms:
7.1 Diagonalization of Symmetric Matrices
7.2 Quadratic Forms
7.3 Constrained Optimization
7.4 The Singular Value Decomposition
7.5 Applications to Image Processing and Statistics
Chapter 8: The Geometry of Vector Spaces:

188 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

8.1 Affine Combinations

8.2 Affine Independence
8.3 Convex Combinations
8.4 Hyper planes
Chapter 9: Optimization:
9.1 Matrix Games
9.2 Linear Programming—Geometric Method
9.3 Linear Programming—Simplex Method, Duality.

• Late submissions will not be accepted.

• Assignments should be turned in at the start of the class.
Assignments
• Zero credit for turning in questions other than the assigned
questions.

Sr. Elements Weightage Details

#

1 • Assignments 25% There will be a graded quiz and

• Quizzes assignments. The class
• Class participation will be framed so
Assessment and
Participation as to test the concepts involved
Examinations
in the lectures.

2 Midterm 35% It takes place at the mid-point of

Assessment the semester.

3 Final Assessment 40% It takes place at the end of the

semester.
1. Linear Algebra and Its Applications by David C. Lay, Steven R. Lay,
Textbooks Judi J. McDonald, 5th Edition, 2015, ISBN-13: 978-0321982384, ISBN-
10: 032198238X
Reference 1. Introduction to Linear Algebra by Gilbert Strang, Fifth Edition, 2016,
Material/Suggested ISBN-13: 978-0980232776, ISBN-10: 0980232775

Readings

189 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

2. Elementary Linear Algebra by Howard Anton, 10th Edition, 2013,

ISBN-13: 978-0470458211, ISBN-10: 0470458216

3. Coding the Matrix: Linear Algebra through Applications to Computer

Science by Philip N. Klein, 1st Edition, 2013, ISBN-13: 978-
0615880990, ISBN-10: 0615880991

4. Linear Algebra Labs with MATLAB by David Hill and David Zitarelli,
3rd Edition, 2003, ISBN-13: 978-0131432741, ISBN-10: 0131432745

190 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Detailed Lecture wise plan

Week Lecture Topic Source Recommendat
No. No. Book-Chapter ions for
No. (Sections Learning
/ Pages) Activities
(Mention
Assignments,
Test, Quizzes,
Practical, Case
Study,
Projects, Lab
Work or
Reading
Assignments)
1 1 Linear Equations in Linear Algebra Text. Ch1(1.1 Books Reading
• Systems of Linear Equations to 1.2)
• Row Reduction and Echelon Forms Ref. 2 Ch1
2 Linear Equations in Linear Algebra Text. Ch1(1.3 Books Reading
• Vector Equations to 1.4)
• The Matrix Equation Ax = b Ref. 1 Ch1
Ref. 2 Ch1
2 3 Linear Equations in Linear Algebra Text. Ch1(1.5 Books
• Solution Sets of Linear Systems to 1.6) Readings
• Applications of Linear Systems Ref. 1 Ch2
Ref. 2 Ch1
4 Linear Equations in Linear Algebra Text. Ch1(1.5 Quiz#1
• Solution Sets of Linear Systems to 1.6) Books
• Applications of Linear Systems Ref. 1 Ch2 Readings
Ref. 2 Ch1
3 5 Lab 1. Matrices in MATLAB Ref. 4 Ch1 Books
• Getting Data into MATLAB (1.1) Readings
• Hilbert matrix
• Dot product vs. cross product in MATALB
6 Linear Equations in Linear Algebra Text. Ch1(1.7)
• Linear Independence Ref. 1 Ch3
4 7 Linear Equations in Linear Algebra Text. Ch1(1.7) Books
• Introduction to Linear Transformations Ref. 1 Ch8 Readings
Ref. 2 Ch8

191 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

8 Linear Equations in Linear Algebra Text. Ch1(1.8) Books

• Introduction to Linear Transformations Ref. 1 Ch8 Readings
Ref. 2 Ch8
5 9 Lab 2. Linear System Ref. 4 Ch1
• Row Operations Using MATLAB (1.1) Books
• Visualizing Row Operations Readings
• Symbolic Row Operations
10 Linear Equations in Linear Algebra Text. Ch1(1.8 Assignment#1
• Introduction to Linear Transformations to 1.9) Quiz#2
• The Matrix of a Linear Transformation, Books
Linear Models in Business, Science, and Readings
Engineering
6 11 Matrix Algebra Text. Ch2 Books
• Matrix Operations (2.1) Readings

12 Matrix Algebra Text. Ch4 (2.2 Books

• The Inverse of a Matrix to 2.3) Readings
• Characterizations of Invertible Matrices Ref. 1 Ch1
Ref. 2 Ch1
7 13 Matrix Algebra Text. Ch4 Books
• Partitioned Matrices (2.4) Readings

14 Matrix Algebra Text. Ch4 Assignment#2

• Matrix Factorizations (2.5, 2.7) Quiz#3
Books
Readings
8 15 Matrix Algebra Text. Ch4 Books
• Applications to Computer Graphics (2.5, 2.7) Readings
16 Lab 3. Matrix Operations Ref.4 Books
Lab 4. Homogeneous Systems, Echelon Lab 3 Sections Readings
Forms, and Inverses (3.1, 3.2)
• Matrix Algebra Lab 4 Sections
• Generating Matrices (4.1, 4.2, 4.3)
• Display Formats
• Homogeneous Systems
• Reduced Row Echelon Form
• Inverses

192 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

MID TERM
Vector Spaces:
• Vector Spaces and Subspaces Text. Ch4 (4.1
• Null Spaces to 4.2) Books
17
Ref. 2 Ch3 Readings
9 • Column Spaces
Ref. 3 Ch3
• Linear Transformations
Midterm paper show
18

Vector Spaces: Text. Ch4 (4.3

• Linearly Independent Sets and 4.4) Books
19
• Bases Ref. 2 Ch3 Readings
• Coordinate Systems Ref. 3 Ch3

10
Vector Spaces:
• Paper Show Text. Ch4 (4.5
• The Dimension of a Vector Space to 4.7) Books
20
Ref. 2 Ch3 Readings
• Rank
Ref. 3 Ch3
• Change of Basis

Eigenvalues and Eigenvectors:

• Eigenvectors and Eigenvalues Text. Ch5 (5.1 Books
to 5.3) Readings
21 • The Characteristic Equation
Ref. 1 Ch6 Assignment#3
• Diagonalization Ref. 2 Ch3 Quiz#4
Ref. 3 Ch12
11

Eigenvalues and Eigenvectors: Text. Ch5 (5.4

• Eigenvectors and Linear Transformations to 5.6)
Books
22 Ref. 1 Ch6
• Complex Eigenvalues Readings
Ref. 2 Ch3
• Discrete Dynamical Systems Ref. 3 Ch12
Orthogonality and Least Squares:
• Inner Product
Text. Ch6 (6.1
• Length and Orthogonality
to 6.3) Books
12 23 • Orthogonal Sets Ref. 1 Ch1 Readings
• Orthogonal Projections Ref. 2 Ch6

193 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Orthogonality and Least Squares:

• The Gram–Schmidt Process
Text. Ch6 (6.4
• Least-Squares Problems to 6.8) Books
24
• Applications to Linear Models Ref. 1 Ch4 Readings
• Inner Product Spaces Ref. 2 Ch6
• Applications of Inner Product Spaces
Symmetric Matrices and Quadratic Forms:
• Diagonalization of Symmetric Matrices Books
Text. Ch7 (7.1
Readings
25 • Quadratic Forms to 7.3)
Assignment#4
• Constrained Optimization Ref. 1 Ch6
Quiz#5
Ref. 2 Ch7

13
Symmetric Matrices and Quadratic Forms: Text. Ch7
• The Singular Value Decomposition (7.4.to 7.5)
Books
26 Ref. 1 Ch7
• Applications to Image Processing and Readings
Ref. 2 Ch9
Statistics. Ref. 3 Ch11

Symmetric Matrices and Quadratic Forms: Text. Ch7

• The Singular Value Decomposition (7.4.to 7.5)
Books
27 Ref. 1 Ch7
• Applications to Image Processing and Readings
Ref. 2 Ch9
Statistics. Ref. 3 Ch11
14 The Geometry of Vector Spaces:
• Affine Combinations Text. Ch8
• Affine Independence Books
28 (8.1.to 8.4)
Readings
• Convex Combinations Ref. 2 Ch10
• Hyperplanes
Optimization:
• Matrix Games, Text. Ch9
29 • Linear Programming—Geometric (9.1.to 9.2) Books
Method Ref. 2 Ch10 Readings
15 Ref. 3 Ch13

Optimization: Text. Ch9

• Linear Programming—Simplex Method Books
30 (9.3.to 9.4)
Readings
• Duality Ref. 3 Ch13

194 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Lab 5. A Vector Space Example:

• Experimenting with Vector Space
Ref.4
Properties Lab 5 Sections
• Linear Combinations Quiz#6
31 (5.1)
• Span Lab 6 Sections
• Linear Independence/Dependence (6.1 to 6.4)
16 • Basis

Lab 6. Inner Product Spaces: Ref.4

• The Standard Inner Product Lab 9 Sections
• Length and Distance Books
32 (9.1, 9.2), Lab
Readings
• Orthogonal Bases 10 Sections
• The Gram-Schmidt Process (10.1, 10.3)

FINAL TERM

195 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code GE-190

Course Title Functional English

Theory Lab
Credit Hours
03 0

Lecture Duration 90 minutes (1.5 Hours), 2 lectures per week

Semester 1st

Courses Knowledge

Before the commencement of this course

students must possess the following skills:

• At hand with the primary concepts of

Pre-requisites Grammar and its usage.
None • Basic understanding of Word Templates for
Assignment documentation
• Familiarization and practical experience of
Microsoft Word, Microsoft PowerPoint

Follow Up Courses Communication and Presentation Skills

Course Learning Outcomes (CLOs)

Bloom
CLO No Course Learning Outcome
Taxonomy
CLO-1 Understand and use basic English grammar and vocabulary. C-1
CLO-2 Write clear and concise emails and business correspondence. C-2
Develop effective speaking and presentation skills for professional
CLO-3 C-3
settings.
1. The basic philosophy behind English Composition &
Aims and Objectives
Comprehension is to allow students to daily spend time writing

196 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

for real purposes about things that interest them. Students can
experiment with a variety of writing genres. English, spelling,
handwriting and other mechanics can be taught within English
Composition & Comprehension. Students learn the craft of
writing through practice, conferring, and studying the craft of
creative and fundamental writings.
2. English has opened for us several doors of knowledge for it is the
lingua franca of the world and also the language of Science,
Technology, Commerce and Diplomacy. The main objective of this
course is to enhance English language skills of the students and
develop their critical thinking.

• Cultivating in the students the love for reading, and developing

their oral and silent reading skills; also training students on
critical reading and thinking.
• Developing the students' four basic skills (listening, speaking,
reading and writing).
• Helping the students to expand their vocabulary and learn new
vocabulary in context.
Learning Outcomes
• Introducing new grammatical structures and special difficulties
and helping the students to understand and learn them.
• Familiarizing the students with different writing styles and
different text genres.
• Developing the students' writing and paraphrasing skills through
writing summaries and short compositions about the topics.

Parts of Speech, Grammar and types of Grammar; Sentence Errors,

Syllabus
Paragraph and Essay Writing, Descriptive Essays Persuasive Essay,

197 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Comparison and Contrast Essays, Narrative Essays, Dialogue Writing,

Short Story Writing, Review Writing and Letter Writing.

1. Language and its Basic Unit

2. Sentence
3. Grammar and types of Grammar
4. Difference between British English and American English
5. Parts of Speech:
5.1. Noun
5.2. Pronoun
5.3. Adjective
5.4. Verb
5.5. Adverb
5.6. Punctuation
5.7. Conjunction
5.8. Interjection

Contents 6. Passage Comprehension

7. Tenses and Translation
8. Correction
9. Change of Voice
10. Change of Narration
11. Paragraph writing
12. Essay Writing
12.1. Descriptive Essay
12.2. Narrative Essay
12.3. Comparison and contrast Essay
12.4. Persuasive Essay
13. Dialogue Writing
14. Story Writing
15. Application Writing

198 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

16. Letter Writing

17. Summary writing
18. Review Writing

• Interactive class session

Teaching-learning
• Hands on practices of English Language Mechanisms in class
Strategies
• Brainstorming and Group discussion sessions on topics

Assignments Paper based written assignments 8

Sr. # Elements Weightage Details

1 Formative 25% It is continuous assessment. It

Assessment includes: classroom participation,
attendance, assignments and
presentations, homework, attitude
and behavior, hands-on-activities,
short tests, quizzes etc.

Assessment and 2 Midterm 35% It takes place at the mid-point of the

Examinations Assessment semester.

3 Final 40% It takes place at the end of the

Assessment semester. It is mostly in the form of a
test, but owing to the nature of the
course the teacher may assess their
students based on term paper,
research proposal development, field
work and report writing etc.

1. College Writing Skills with Readings, by John Langan, McGraw-Hill,

Textbooks
5th Edition.

199 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

2. A Textbook of English Prose and Structure by Arif Khattak, et al, GIKI

Institute, 2000

1. P. C. Wren & H. Martin “High School English Grammar &

Composition”
Reference 2. Colin W. Davis & Andrew J. Watts New Expressway For English 1
(New Edition)
Material/Suggested 3. Diana Hacker. A Writer’s Reference
Readings 4. Sadat Ali Shah. Exploring The World Of English
5. A. J. Thomson and A. V. Martinet. Practical English Grammar
6. Handout provided by the teacher.
7. Web Links: www.owl.english.purdue.edu

• Academic integrity is expected of all students.

• Plagiarism or cheating in any assessment will result in at least an
Notes F grade in the course, and possibly more severe penalties.
• Always be brief and to the point

200 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Detailed Lecture wise plan

Source
Wee Lectur Recommendation for
Topic Book
k e Learning Activities
(Ch#)
1 1 • Introduction to the Subject
• Language and its Basic Unit
• Distribution of course
• Sentence outline
A(1) -
• Sentence Structure • Worksheets
• Types of Sentences Hando
uts
• Lexicons

2 • Grammar and types of Grammar Hando Worksheets

uts
3 • The Noun
• Types of Nouns A(3) Worksheets
• Correction related to Noun Assignment # 1
2
4 • Pronoun
• Types of Pronouns Worksheets
A(4)
• Correction related to pronoun

5 • Adjective
• Types of Adjectives A(5) Worksheets
• Articles / Determiners etc.
• Royal Oder and Order of Adjective Hando
• Correction Related to Adjective uts

3
6 • Verb
• Types of Verbs A(6) Worksheets
• Correction Related to Verb
• Auxiliary / Lexical verbs Hando Assignment # 2
• Modal helping Verb uts

7 • Adverb
• Types of Adverbs A(7) Quiz # 1
• Correction related to Adverb

201 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Source
Wee Lectur Recommendation for
Topic Book
k e Learning Activities
(Ch#)
4 8 • Punctuation
• Types of Punctuation A(8) Worksheets
• Correction related to Punctuation

9 • Preposition
5 • Types of Prepositions Worksheets
• Correction Related to Preposition
A(9) Assignment # 3

10 • Conjunction
• Types of conjunction A(10) Worksheets
• Correction related to conjunction
11 • Interjection
• Types of Interjection A(11) Worksheets
• Correction related to Interjection
6 12 • Grammatical Terms
• Gerunds, Worksheets
A(12)
Quiz # 2

13 • Phrases, clauses and sentences; linking

7 phrases, transitions, coherence and unity. A(13) Worksheets
14 • Phrases, clauses and sentences; linking
phrases, transitions, coherence and unity. A(14) Worksheets
15 • Passage comprehension B(9) Assignment # 4
Hando
8 uts
16 • Change of Voice Hando Worksheets
• Basic rules uts
17 • Change of Voice Hando Worksheets
uts
9 18 • Change of Narration Hando Worksheets
• Basic Rules uts
19 • Change of Narration Hando Worksheets
• Interrogative sentences uts
10 20 • Change of Norriton Hando Worksheets
• Exclamatory, Optative sentences uts

202 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Source
Wee Lectur Recommendation for
Topic Book
k e Learning Activities
(Ch#)
21 • Paragraph Writing B(10) Assignment # 5
Hando
11 uts
22 • Descriptive Essay B(11) Class Task on the topic:
Hando Descriptive Essay
uts
23 • Comparison and contrast Essay B(12) Class Task on the topic:
Hando Comparison and contrast
12 uts Essay
24 • Narrative Essay B(13) Class Task on the topic:
Hando Narrative Essay
uts
25 • Persuasive Essay B(14) Class Task on the topic:
Hando Persuasive Essay
uts
Assignment # 6

13

26 • Dialogue Writing B(15) Class Task on the topic:

Dialogue Writing
27 • Application writing
Class Task on the topic:
B(5) Application writing
Quiz # 3
14 28 • Story writing
Class Task on the topic:
Story writing
B(6)
Assignment # 7

29 o Informal Letters
B(20) Class Task on the topic:
Hando Informal Letters
uts Quiz # 4

203 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Source
Wee Lectur Recommendation for
Topic Book
k e Learning Activities
(Ch#)
15 30 • Summary Writing B(3) Class Task on the topic:
Hando Summary Writing
uts Assignment # 8

31 • Review Writing Hando Class Task on the topic:

uts Review Writing
16 32 • Preparation of Final Exam Revisio Revision / Best Wishes
n

204 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code GE-199

Course Title Expository Writing

Theory Lab
Credit Hours
3 0

Lecture Duration 90 minutes (1.5 Hours), 2 lectures per week

Semester 1

Courses Knowledge

Strong knowledge of English

Pre-requisites
English Composition & Comprehension Grammar and Various Writing
Mechanisms

Follow Up Courses Technical and Business Writing

1. This course (Communication and Presentation Skills) is designed to

provide students with the practical skills and knowledge of
Communication necessary to express themselves clearly, with
confidence and power, in a variety of writing and speaking
situations.
Aims and
Objectives 2. Students will be taught presentation techniques; how to plan and
structure an effective presentation; how to develop ideas; effective
delivery methods; and how to overcome anxiety, fear and
nervousness when making a presentation.

• Students will be able to document their data and sources according

Learning Outcomes to the requirements of the business communication

• To understand the essential points in preparing an oral presentation

205 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• To understand the key elements of delivery of messages in oral

presentations
• To appreciate the nature of PowerPoint as a way of presenting the
world
• To develop more effective presentation skills
• Parts of formal Letters and its layouts and standard layout

Principles of writing good English, Words, sentence and Paragraphs,

Communication Components, Verbal and Non Verbal Communication, The
Syllabus
Writing Process, 7Cs, Presentation, Memo, Business Letters, Minutes and
Business Proposals

1. Principles of Writing good English (revision)

2. What is Communication and Business Communication?
3. Components of Communication
4. The Writing Process:
5. Basic Principles of Business Communications: 7Cs of
Communications:
5.1. Completeness
5.2. Correctness
5.3. Conciseness
Contents
5.4. Courtesy
5.5. Clarity
5.6. Concreteness
5.7. Consideration
6. Verbal and Non-Verbal Communication
7. Business Letter Writing
8. Memo Writing
9. Conducting Meetings and taking Minutes.
10. Presentation skills

206 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

11. Use of Audio-Visual Aids

12. Job Interview
13. Reading Skills
14. Listening Skills

• Interactive class session

• Hands on practices of English Language Mechanisms in class

Teaching-learning • Brainstorming and Group discussion sessions on topics

Strategies • Expertise in professional messages

• Presentation (Preparation and Practice)
• Mock interviews

Assignments Paper based written assignments 8

Sr. # Elements Weightage Details

1 Formative 25% It is continuous assessment. It includes:

Assessment classroom participation, attendance,
assignments and presentations,
homework, attitude and behavior,
hands-on-activities, short tests, quizzes

Assessment and etc.

Examinations 2 Midterm 35% It takes place at the mid-point of the

Assessment semester.

3 Final 40% It takes place at the end of the

Assessment semester. It is mostly in the form of a
test, but owing to the nature of the
course the teacher may assess their
students based on term paper, research

207 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

proposal development, field work and

report writing etc.

1. Practical Business English, Collen Vawdrey, 1993, ISBN =

0256192740
2. Effective Communication Skills: The Foundations for Change, John
Textbooks
Nielsen, 2008, ISBN = 1453506748
3. Various Web links

Reference
Material/Suggested 1. Effective Business Communications 7th Edition by Herta A Murphy
Readings 2. Business Communication Today, 14th edition by Courtland L
Bovee and John Thill

• Academic integrity is expected of all students.

• Plagiarism or cheating in any assessment will result in at least an F
Notes grade in the course, and possibly more severe penalties.
• Always be brief and to the point

208 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Detailed Lecture wise plan

Recommendat
Wee Lectur SourceBook ion for
Topic
k e (Ch#) Learning
Activities
1 1. Overview of the Course Contents Distribution of
2. Discussion of the Course course outline
3. Revision of English Rules and Writings
Mechanics
1 2 1. What is Communication? A(1)
2. What Is Business Communication?
3. What are different types of
Communication

3 1. Communication 2.0 B(1) Assignment-1

2. Communication 360° A(1)
3. Verbal Communication
• Written Communication
• Oral Communication
2 4 • Non-Verbal communication
1. Effect of Non-Verbal Mock Exercise
Communication on: A(2) of Different
Elements of
1.1. Written Message
Non Verbal
1.2. Physical Appearance Communicatio
1.3. Surroundings n

5 2. Facial Expressions A(2) Mock Exercise

3. Kinesics of Different
4. Proxemics Elements of
Non Verbal
3 Communicatio
n
6 5. Haptics A(2) Mock Exercise
6. Time of Different
7. Space Elements of
8. Paralinguistics Non Verbal
Communicatio
n

209 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
Wee Lectur SourceBook ion for
Topic
k e (Ch#) Learning
Activities
7 The Writing Process A(3) Quiz # 1
1. Pre-Writing /Five Planning Steps
1.1. Decide your Purpose Class practice
1.2. Analyze/Anticipate of Pre
your Audience Writing and
1.3. Choose your ideas its steps
1.4. Select your Data
4 1.5. Organize your
Message

8 2. Drafting A(3) Class practice

3. Editing of Drafting
4. Proofreading and Editing
5. Revising
6. Publishing
9 Basic Principles of Effective Communication A(4) Worksheet
Concept of 7Cs
1. Completeness Class practice
2. Correctness of Basic
Principles of
Effective
Communicatio
n

5 10 A(4) Worksheet

3. Conciseness Class practice

4. Courtesy of Basic
5. Clarity Principles of
6. Concreteness Effective
7. Consideration Communicatio
n

210 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
Wee Lectur SourceBook ion for
Topic
k e (Ch#) Learning
Activities
11 What is Memo? A(5) Assignment-2
How to Write a Memo?
What is Circular Message Class practice
of Memo
Writing on
different
6 topics
12 Parts of a Business Letter A(6) Quiz # 2
1. Standard Parts of a Business Letter
Class practice
of Memo
Writing on
different
topics
13 2. Optional Parts of a Letter A(6)
3. Format / Layout of a Business Letter Handouts of Class practice
Layout of Memo
samples Writing on
different
7 topics
14 Types of Various Letters A(7) Class practice
1. Inquiry Letter Handouts of of Memo
2. Reply of Inquiry Letter Sample text Writing on
different
topics
15 3. Credit request Letter A(7) Assignment-3
4. Reply of a credit Request Letter Handouts of
Sample text) Class practice
of Memo
Writing on
different
8 topics
16 5. Order Letter A(7) Assignment-4
6. New Orders Class practice
7. Old Orders of Memo
Writing on
8. Acknowledgment Letter
different
topics

211 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
Wee Lectur SourceBook ion for
Topic
k e (Ch#) Learning
Activities
17 9. Complaint Letter Assignment-5
10. Reply of Complaint Letter A(7)
Class practice
Hand outs of Memo
Writing on
different
topics
9 18 11. Thank You Letter A(8) Quiz# 3
12. Dunning Letter
Class practice
of Memo
Writing on
different topics
19 What is Visual Aids? A(9)
What is Visual Aids Media?
10 20 Meeting Minutes A(10)
How to take meeting minutes: Assignment-6
1. Before meeting
2. During meeting
3. After meeting
21 What is Oral Presentation? A(11)
Preparation of Oral Presentation:
1. Before Presentation
2. During Presentation
3. After Presentation
11 22 Methods of Oral Presentation A(12)
1. Read from Manuscript Quiz# 4
2. Read form Memory
23 3. Extemporaneous Speech A(12)
4. Impromptu Speech
12 24 Reading Skills B(12)
Types of Readings

25 1. Listening Skills B(12)

2. Types of Listening

13 26 Barriers to listening B(13)

How to overcome barriers to listening

212 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
Wee Lectur SourceBook ion for
Topic
k e (Ch#) Learning
Activities
27 What are different Communication Barriers? B(13)
How to overcome Communication Barriers? Assignment-7

14 28 what is group? A(20)

Types of groups?

29 What is meeting? A(20) Assignment-8

Types of meetings
15 30 What is job interview A(21) Mock Exercise
Types of job interview
31 Preparation of interview A(21) Mock Exercise
Before interview
16 During interview
After interview
3 Revision Hand outs

213 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code MS-254

Course Title Technical and Business Writing

Theory Lab
Credit Hours
03 00

Lecture Duration 90 minutes (1.5 Hours), 2 lectures per week

Semester 7th

Courses Knowledge

Before the commencement of this

course students must possess
following skills:
• At hand with the primary
concepts of communication and
its process in the business
world.
• Basics of Business Writing
Pre-requisites Communication and Presentation Mechanics
Skills • Preparation of Professional
Documents
• Fundamental knowledge of
Tenses and English structure of
sentences
• Basic understanding of MS
Word Templates for business
documentation
•
Follow Up Courses No Any

Aims and If you effectively complete readings, practice exercises, workshops and
assignments this course should:
Objectives

214 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

1. provide you with the confidence to use written communication in

your work and personal experience in and beyond college.
2. acquaint you with the concept of a writer-reader relationship and
identify the need for active participation from both writer and
reader.
3. teach you the skills needed to successfully communicate in a
modern world through written materials.
4. learn to identify and select many types of writing frequently
required in a variety of careers.
5. determine your purposes/objectives and develop skill in composing
and revising on the computer documents with formats and
language appropriate for those purposes.
6. demonstrate in your writing the effective communication
principles encouraged by professional writers.
7. achieve a greater awareness of the importance of selecting and
integrating graphics with written communication.

The core of this course can be summarized in the following four skills
area:

• Research Skills (using primary and library research to discover and

employ information)
Learning Outcomes
• Correspondence Skills (learning the generic conventions of each)
• Promotional Writing Skills (may or may not use primary research; to
disseminate information; to inform and persuade public audiences
that organizations communicate with)
• Visual Communication Skills (may appear as separate assignments
or as components of other assignments)

Organizing information and generation solution: brainstorming,

Syllabus
organizing material, construction of the formal outline. Document
design: document structure, preamble, summaries, Abstracts, table

215 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

of contents, footnotes, glossaries, cross referencing, plagiarism,

citation and bibliography, glossaries, index, appendices, typesetting
systems Overview of technical reporting, Leaflets, brochures,
handbooks and magazines. Visual Communication and Visual Aids
Media. Business Communication and Ethical Issues: Business
Communication and Technological Context: Business
Communication and Legal Issues: Individual and National Cultural
Variables ; Job Interview, Job Application, Different types of Reports
and Proposals

1. Overview of technical reporting, use of library and information

gathering, administering questionnaires, reviewing the gathered
information.
2. Organizing information and generation solution: brainstorming,
organizing material, construction of the formal outline.
document design: document structure, preamble, summaries,
3. Abstracts, table of contents, footnote, glossaries, cross referencing,
plagiarism, citation and bibliography, glossaries, index, appendices,
typesetting systems.

Contents 4. Visual Communication and Visual Aids Media

5. Business Communication and Ethical Issues
6. Business Communication and Technological Context
7. Business Communication and Legal Issues
8. Individual and National Cultural Variables
9. Job Interview
10. Job Application
11. Follow up interview

12. Different types of Reports

216 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

1. Progress Reports
2. Conference Report
3. Informational Reports.
4. Analyzing a Case
5. Writing a Case Report
6. Discussing a Case Study
7. Presenting a Case Study

13. Leaflets, brochures, handbooks, magazines, articles, research

papers, feasibility reports, project reports, technical research
reports,

• Interactive class session

Teaching-learning
• Hands on practices in class
Strategies
• Brainstorming and Group discussion sessions

Paper based written assignments 8

Assignments
Class tasks

Sr. # Elements Weightage Details

1 Formative 25% It is continuous assessment. It includes:

Assessment classroom participation, attendance,
assignments and presentations,
Assessment and
homework, attitude and behavior,
Examinations
hands-on-activities, short tests, quizzes
etc.

2 Midterm 35% It takes place at the mid-point of the

Assessment semester.

217 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

3 Final 40% It takes place at the end of the semester.

Assessment It is mostly in the form of a test, but
owing to the nature of the course the
teacher may assess their students based
on term paper, research proposal
development, field work and report
writing etc.

1. Technical Report Writing, by Pauley and Riordan, Houghton

Mifflin Company, 8th
Edition.
Textbooks 2. Effective Technical Communication by Ashraf Rizvi, Tata
McGraw-Hill.

Reference
Material/Suggested 4. Effective Business Communications, 7th Edition by Herta A Murphy
5. Business Communication Today, 14th edition by Courtland L Bovee
Readings and John Thill

• Academic integrity is expected of all students.

• Plagiarism or cheating in any assessment will result in at least an F
Notes grade in the course, and possibly more severe penalties.
• Be Brief and to the point

218 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Detailed Lecture wise plan

Recommendat
Source
Wee Lectur ion for
Topic Book
k e Learning
(Ch#)
Activities
1 Introduction to the Subject Distribution of
1 Course outline
2 Concepts of Communication (Revision)
3 Overview of technical reporting, use of A(17)
Assignment #
library and information gathering, 1
administering questionnaires, reviewing
the gathered information.
2

4 Overview of Leaflets, brochures, A(17)

Class Task
handbooks, magazines, articles, research
papers

5 Abstracts, table of contents, footnotes, A(17) Quiz # 1

Class Task
glossaries, cross referencing, plagiarism,
citation and bibliography, glossaries,
index, appendices, typesetting systems.

3 6 Analyzing a Case B(7)

Handouts Class Task

7 Writing a Case Report B(7) Assignment #

Handouts 2
4 8 A(18) Class Task
Discussing a Case Study Handouts

9 Presenting a Case Study A(18) Class Task

Handouts
5 10 A(18) Quiz # 2
A formal Case and its written analysis
Handouts

219 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
Source
Wee Lectur ion for
Topic Book
k e Learning
(Ch#)
Activities
11 Conversion of a written report into an oral A(18) Class Task
presentation Handouts
6 12 What is Report? B(18)
Types of report
Short report
Long report
13 Parts of a report A(19) Class Task
Handouts
7 14 Conference report A(19) Assignment #
B(8) 3

Handouts
8 15 Analytical report A(19) Assignment #
B(8) 4
Class Task
16 Informational report Handouts Class Task
17 Progress report B(15) Class Task
A(20)
Handouts
9 18 Feasibility Report A(19) Assignment #
B(10) 5
19 What is RFP? A(18)
What is business Proposal B(15) Quiz # 3
Handouts
10 20 Business Proposal A(20)
B(15) Class Task
Handouts
21 Sales Proposal B(14) Assignment #
11 Handouts 6

22 Visual Communication and Visual Aids Media B(15) Quiz # 4

23 Business Communication and Ethical Issues B(12)
12
24 Business Communication and Technological B(13)
Context
25 Business Communication and Legal Issues B(14)
13 26 Individual and National Cultural Variables B(16)

220 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
Source
Wee Lectur ion for
Topic Book
k e Learning
(Ch#)
Activities
27 Job application letters A(14)
Assignment #
14 7
Class Task
28 Types of Résumés A(20)

29 Résumés A(20) Assignment #

8
15 Class Task
30 Job Interviews A(20) Mock
Exercise
31 Follow up on interviews A(20) Mock Exercise
16
32 Revision Hand
outs

221 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code GE-168

Course Title Ideology and Constitution of Pakistan

Theory Lab
Credit Hours
2 0

Lecture Duration 60 minutes (1 Hours), 2 lectures per week

Semester 1

Courses Knowledge
Pre-requisites

Follow Up Courses

1. To teach the students about the objectives, freedom and various

Aims and
governments in Pakistan, along with its leaders, culture, geography
Objectives
and other aspects.

Learning Students get comprehensive know how of History, Geography, Politics,

Outcomes: Leaders and different aspects related to our homeland Pakistan.

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;
Syllabus
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.
1. Historical background of Pakistan:
2. Muslim society in Indo-Pakistan, the movement led by the societies, the
Contents
downfall of Islamic society, the establishment of British Raj- Causes and
consequences.

222 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

3. Political evolution of Muslims in the twentieth century: Sir Syed Ahmed

Khan;
4. Muslim League; Nehru; Allama Iqbal:
5. Independence Movement; Lahore Resolution;
6. Pakistan culture and society,
7. Constitutional and Administrative issues, Pakistan and its geo-political
dimension, Pakistan and International Affairs, Pakistan and the
challenges ahead.
Teaching-learning The students will be given all round knowledge of the subject oral/on white
Strategies board/assignments/sudden quizzes during class rooms only.

Assignments Assignments will be assigned throughout the course.

Sr. # Elements Weightage Details

1 Formative 25% It is continuous assessment. It includes:

Assessment classroom participation, attendance,
assignments and presentations,
homework, attitude and behavior,
hands-on-activities, short tests, quizzes
etc.

Assessment and 2 Midterm 35% It takes place at the mid-point of the

Examinations Assessment semester.

3 Final 40% It takes place at the end of the semester.

Assessment It is mostly in the form of a test, but
owing to the nature of the course the
teacher may assess their students based
on term paper, research proposal
development, field work and report
writing etc.

1. The Emergence of Pakistan, Chaudary M., 1967

Textbooks 2. The making of Pakistan, Aziz. 1976
3. A Short History of Pakistan, I. H. Qureshi, ed., Karachi, 1988

223 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Reference
Material/Suggested All reference Material/readings will be provided during lectures as per
Readings the class performance and their interest in the degree program overall.

Notes Students will take their own notes during class.

224 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code GE-163

Course Title Islamic Studies

Theory Lab
Credit Hours
02 0

Lecture Duration 60 minutes (1 Hours), 2 lectures per week

Semester 2

Courses Knowledge
Pre-requisites

Follow Up Courses

Course Learning Outcomes (CLOs)

CLO No Course Learning Outcome Bloom Taxonomy

CLO-1 To further enhance the knowledge of Islam. C3 (Apply)
CLO-2 To understand the basic concept of Islam and Quran Pak. C2 (Understand)
To understand the concept of Haqooq ul ibad in the light
CLO-3 C2 (Understand)
of Quran.
To know the importance of Islamic concept about other
CLO-4 C2 (Understand)
religions.
Aims and
1. To teach students about Islam
Objectives

Students will learn

1. Basic Themes of Quran,
Learning 2. Introduction to Sciences of Hadith,
Outcomes: 3. Introduction to Islamic Jurisprudence,
4. Primary & Secondary Sources of Islamic Law,
5. Makken & Madnian life of the Prophet,
6. Islamic Economic System,

225 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

7. Political theories,
8. Social System of Islam

Basic Themes of Quran, Introduction to Sciences of Hadith, Introduction to

Islamic Jurisprudence, Primary & Secondary Sources of Islamic Law, Makken
Syllabus
& Madnian life of the Prophet, Islamic Economic System, Political theories,
Social System of Islam
1. Basic Themes of Quran,
2. Introduction to Sciences of Hadith,
3. Introduction to Islamic Jurisprudence,
4. Primary & Secondary Sources of Islamic Law,
Contents
5. Makken & Madnian life of the Prophet,
6. Islamic Economic System,
7. Political theories,
8. Social System of Islam
Teaching-learning The students will be given all round knowledge of the subject oral/on white
Strategies board/assignments/sudden quizzes during class rooms only.

Assignments Assignments will be assigned throughout the course.

Sr. # Elements Weightage Details

1 Formative 25% It is continuous assessment. It includes:

Assessment classroom participation, attendance,
assignments and presentations,
homework, attitude and behavior,
hands-on-activities, short tests, quizzes
Assessment and
etc.
Examinations
2 Midterm 35% It takes place at the mid-point of the
Assessment semester.

3 Final 40% It takes place at the end of the

Assessment semester. It is mostly in the form of a
test, but owing to the nature of the
course the teacher may assess their

226 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

students based on term paper, research

proposal development, field work and
report writing etc.

1. Introduction to Islam by Dr Hamidullah, Papular Library Publishers

Lahore
2. Principles of Islamic Jurisprudence by Ahmad Hassan, Islamic Research
Textbooks
Institute, IIUI
3. Muslim Jurisprudence and the Quranic Law of Crimes, By Mir Waliullah,
Islamic Books Services
Reference
Material/Suggested All reference Material/readings will be provided during lectures as per
Readings the class performance and their interest in the degree program overall.

Notes Students will take their own notes during class.

227 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code GE-362

Course Title Entrepreneurship

Theory Lab
Credit Hours
03 0

Lecture Duration 90 minutes (1.5 Hours), 2 lectures per week

Semester

Courses Knowledge
Pre-requisites

Follow Up Courses

Aims and
1. To teach students about fundamentals of Entrepreneurship
Objectives

Learning
Students will the fundamentals of Entrepreneurship
Outcomes:

Intro to entrepreneurship, Historical perspective of entrepreneurship, The

four dimensions of venture creation, Competing models of
entrepreneurship, Effectual vs. causal logic of entrepreneurship,
Entrepreneurial thinking versus managerial thinking, Effectuation model of
entrepreneurship, Principles of effectual entrepreneurship, Idea vs.
opportunity, Essential qualities of an opportunity, Ways to ‘find’ a business
Syllabus opportunity, Window of opportunity, Role of feasibility analysis in
developing successful business ideas, Characteristics of attractive industries
for start---ups, Financial and commercial merit of the business idea, The
venture opportunity profile, Opportunities found vs. Opportunities created,
The model of opportunity ‘creation’, The ‘curry in a hurry’ principle, Value
Innovation: A new mantra of value creation, The Strategy Canvas, Four---
actions framework, Business Idea Presentations: Groups will present and

228 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

submit their Business Concept Statements according to the format

prescribed by the instructor.
1. Intro to entrepreneurship,
2. Historical perspective of entrepreneurship,
3. The four dimensions of venture creation, Competing models of
entrepreneurship,
4. Effectual vs. causal logic of entrepreneurship, Entrepreneurial thinking
versus managerial thinking, Effectuation model of entrepreneurship,
5. Principles of effectual entrepreneurship, Idea vs. opportunity, Essential
qualities of an opportunity, Ways to ‘find’ a business opportunity,
Window of opportunity,
Contents
6. Role of feasibility analysis in developing successful business ideas,
Characteristics of attractive industries for start---ups, Financial and
commercial merit of the business idea,
7. The venture opportunity profile, Opportunities found vs. Opportunities
created, The model of opportunity ‘creation’, The ‘curry in a hurry’
principle, Value Innovation: A new mantra of value creation,
8. The Strategy Canvas, Four---actions framework, Business Idea
9. Presentations: Groups will present and submit their Business Concept
10. Statements according to the format prescribed by the instructor.
Teaching-learning The students will be given all round knowledge of the subject oral/on white
Strategies board/assignments/sudden quizzes during class rooms only.

Assignments Assignments will be assigned throughout the course.

Sr. # Elements Weightage Details

1 Formative 25% It is continuous assessment. It includes:

Assessment classroom participation, attendance,
assignments and presentations,
Assessment and
homework, attitude and behavior,
Examinations
hands-on-activities, short tests, quizzes
etc.

2 Midterm 35% It takes place at the mid-point of the

Assessment semester.

229 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

3 Final 40% It takes place at the end of the semester.

Assessment It is mostly in the form of a test, but
owing to the nature of the course the
teacher may assess their students based
on term paper, research proposal
development, field work and report
writing etc.

• B. R. Barringer, and R. D. Ireland, Entrepreneurship: Successfully

Launching New Ventures, 3rd Edition, Prentice Hall, 2009, ISBN:
Textbooks 0138158088.
• J. Timmons, S. Spinelli, New Venture Creation – Entrepreneurship
for 21st Century, 8th Edition, McGraw-Hill, 2008, ISBN: 0071276327.
Reference
Material/Suggested All reference Material/readings will be provided during lectures as per
Readings the class performance and their interest in the degree program overall.

Notes Students will take their own notes during class.

230 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code GE-402

Course Title Professional Practices

Theory Lab
Credit Hours
03 0

Lecture Duration 90 minutes (1.5 Hours), 2 lectures per week

Semester

Courses Knowledge
Pre-requisites

Follow Up Courses

Course Learning Outcomes (CLOs)

Bloom
CLO No Course Learning Outcome
Taxonomy
Identify the content of religious, national, or international
CLO-1 A-2
law dealing with professional ethics
Apply the knowledge of ethics in their personal and
CLO-2 A-3
professional life.
Gain the ability to enhance key factors of interpersonal
relations, to follow and implement the acquired knowledge
CLO-3 A-4
of ethical skills in given situations by controlling his/her
temperament.
Aims and
1. To teach students various Professional Practices.
Objectives

Learning
Students will various Professional Practices.
Outcomes:

Computing Profession, Computing Ethics, Philosophy of Ethics. The

Syllabus Structure of Organizations, Finance and Accounting, Anatomy of a
Software House, Computer Contracts, Intellectual Property Rights, The

231 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Framework of Employee Relations Law and Changing Management

Practices, Human Resource Management and IT, Health and Safety at
Work, Software Liability, Liability and Practice, Computer Misuse and the
Criminal Law, Regulation and Control of Personal Information. Overview of
the British Computer Society Code of Conduct, IEEE Code of Ethics, ACM
Code of Ethics and Professional Conduct, ACM/IEEE Software Engineering
Code of Ethics and Professional Practice. Accountability and Auditing, Social
Application of Ethics.
1. Computing Profession, Computing Ethics, Philosophy of Ethics. The
Structure of Organizations,
2. Finance and Accounting, Anatomy of a Software House,
3. Computer Contracts, Intellectual Property Rights, The Framework of
Employee Relations Law and Changing Management Practices,
4. Human Resource Management and IT, Health and Safety at Work,
Contents Software Liability, Liability and Practice,
5. Computer Misuse and the
6. Criminal Law, Regulation and Control of Personal Information. Overview
of the British Computer Society Code of Conduct,
7. IEEE Code of Ethics, ACM Code of Ethics and Professional Conduct,
ACM/IEEE Software Engineering Code of Ethics and Professional
Practice. Accountability and Auditing, Social Application of Ethics.
Teaching-learning The students will be given all round knowledge of the subject oral/on white
Strategies board/assignments/sudden quizzes during class rooms only.

Assignments Assignments will be assigned throughout the course.

Sr. # Elements Weightage Details

1 Formative 25% It is continuous assessment. It includes:

Assessment classroom participation, attendance,
assignments and presentations,
Assessment and
homework, attitude and behavior,
Examinations
hands-on-activities, short tests, quizzes
etc.

2 Midterm 35% It takes place at the mid-point of the

Assessment semester.

232 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

3 Final 40% It takes place at the end of the

Assessment semester. It is mostly in the form of a
test, but owing to the nature of the
course the teacher may assess their
students based on term paper, research
proposal development, field work and
report writing etc.

• Professional Issues in Software Engineering by Frank Bott, Allison

Coleman, Jack Eaton and Diane Rowland, CRC Press; 3rd Edition (2000).
ISBN-10: 0748409513
• Computer Ethics by Deborah G. Johnson, Pearson; 4th Edition
(January 3, 2009). ISBN-10: 0131112414
Textbooks
• A Gift of Fire: Social, Legal, and Ethical Issues for Computing and the
Internet (3rd Edition) by Sara Baase, Prentice Hall; 3rd Edition (2008). ISBN-
10: 0136008488
• Applied Professional Ethics by Gregory R. Beabout, University Press
of America (1993). ISBN-10: 0819193747.
Reference
Material/Suggested All reference Material/readings will be provided during lectures as per
Readings the class performance and their interest in the degree program overall.

Notes Students will take their own notes during class.

233 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code ED-333

Course Title Theory of Automata and Formal Languages

Credit Hours Theory Lab

03 0

Lecture Duration 90 minutes (1.5 Hours), 2 lectures per week

Semester 8

Pre-requisites Courses Knowledge

Nil

Follow Up Courses Compiler Construction, Concepts and comparison of PLs

Course Learning Outcomes (CLOs)

CLO No Course Learning Outcome Bloom Taxonomy

Explain and manipulate the different concepts in automata
CLO-1 theory and formal languages such as formal proofs, C2 (Understand)
automata, regular expressions, Turing machines etc.
Prove properties of languages, grammars and automata
CLO-2 C2 (Understand)
with rigorously formal mathematical methods.
CLO-3 Design of automata, RE and CFG. C6 (Design)
CLO-4 Transform between equivalent NFAs, DFAs and Res. C3 (Apply)
CLO-5 Define Turing machines performing simple tasks. C2 (Understand)
Differentiate and manipulate formal descriptions of
languages, automata and grammars with focus on regular
CLO-6 C3 (Apply)
and context-free languages, finite automata and regular
expressions.

234 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

The following are instructional aims and objectives of the course; they are
by no means complete, but they characterize the kind of understanding that
I hope students will develop over the quarter.

At the end of the course students should:

Aims and 1. Be able to prepare/analyze Programming Language specifications.

Objectives 2. Be able to work in the areas like Language design and Natural
Language Processing etc.
3. Be able to decide what sort of rules may be included in Programming
Languages and how these rules are enforced by language processors
like compilers and interpreters.

A student who has passed this course shall be able to

1. Understand and manipulate formal descriptions of languages,

automata and grammars with focus on Regular and Context Free

Learning Languages, Finite State Automata and Regular Expressions.

Outcomes: 2. Apply rigorously formal mathematical methods to prove properties

of languages, grammars and automata.

3. Apply the knowledge for designing and implementing the

Programming Languages.

This course introduces the fundamentals of Programming Language Theory,

Regular Expressions, and Grammars. Deterministic and non-deterministic
Syllabus automata, their limitations and alternates like pushdown automata.
Different computing models are also discussed such as Automata and Turing
Machines with emphasis on their applicability to practical problem domains.
15. Fundamentals of Programming Language Theory
16. Regular Expressions
17. Grammars
Contents 18. Deterministic and non-deterministic automata
19. Their limitations and alternates like pushdown automata.
20. Different computing models
21. Automata

235 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

22. Turing Machines

23. Emphasis on their applicability to practical problem domains.
Teaching-learning The students will be given all round knowledge of the subject oral/on white
Strategies board/assignments/sudden quizzes during class rooms only.

Assignments Assignments will be assigned throughout the course.

Assessment and Sr. # Elements Weightage Details

Examinations

1 Formative 25% It is continuous assessment. It includes:

Assessment classroom participation, attendance,
assignments and presentations,
homework, attitude and behavior,
hands-on-activities, short tests, quizzes
etc.

2 Midterm 35% It takes place at the mid-point of the

Assessment semester.

3 Final 40% It takes place at the end of the

Assessment semester. It is mostly in the form of a
test, but owing to the nature of the
course the teacher may assess their
students based on term paper, research
proposal development, field work and
report writing etc.

Textbooks Introduction to Computer Theory, by Daniel I. Cohen, John Wiley & Sons

Reference
All reference Material/readings will be provided during lectures as per
Material/Suggested
the class performance and their interest in the degree program overall.
Readings

236 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Notes Students will take their own notes during class.

237 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Detailed Lecture wise plan

Unit Sub-Topic Readings Activities

1 Introduction of class and subject

Language, string, valid string, character

2 Chapter # 1
set
Definitions of various language related
3 Chapter # 2,3 Yes
terms, Recursive Definition
4
Regular expressions, Regular languages Chapter # 4 Yes
5

6 Finite Automata and its types, Transition

Graph, Generalized Transition Graph, F.A. Chapter # 5,6,8 Yes
7 with output

8
Kleene’s Theorem, Regular Languages Chapter # 7,10 Yes
9
Chapter #
10 Context Free Grammars
13,14
Chapter #
11 Various grammatical formats Yes
15,16
12 Push Down Automata and its types Chapter # 17

13 PDA with N-stacks/Post Machine Chapter # 25

14 Turing Machine Chapter # 24 Yes

The Chomsky Hierarchy, Review and
15 Chapter # 30
Revision

238 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS data science

Course Code ED-343

Course Title Advance Database Management Systems

Theory Lab
Credit Hours
3 0

Lecture Duration 90 minutes (1.5 Hours), 2 lectures per week

Semester 7

Courses Knowledge
Pre-requisites
Database Systems Nil

Follow Up Courses

Course Learning Outcomes (CLOs)

CLO No Course Learning Outcome Bloom Taxonomy

Understanding advance data models, technologies and
CLO-1 C2 (Understand)
approaches for building distributed database systems.
Applying the models and approaches in order to become
CLO-2 enabled to select and apply appropriate methods for a particular C3 (Apply)
case.
To develop a database solution for a given scenario/ challenging
CLO-3 C3 (Apply)
problem in the domain of distributed database systems.
Upon completion of this course, the student will be able to:
Aims and
1. Grasp theory and science of database systems
Objectives 2. Design distributed databases
3. Write structured queries
At the end of the course, you should be able to:
• Understanding advance data models, technologies and approaches for
Learning Outcomes building distributed database systems
• Applying the models and approaches in order to become enabled to
select and apply appropriate methods for a particular case

239 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• To develop a database solution for a given scenario/ challenging problem

in the domain of distributed database systems.
1. Background
1.1. Introduction to advance data models
1.2. Object relational introduction
1.3. Object oriented introduction
1.4. File organization
2. Transaction and batch processing
2.1. Transaction
2.2. Concurrency
2.3. Recovery and backup
3. Database Management System
3.1. Transactional processing
3.2. Concurrency control techniques
3.3. Recovery techniques

Contents 3.4. Query processing

3.5. Query optimization
4. Database Programming
4.1. PL/SQL
4.2. T-SQL
4.3. Similar technology)
5. Integrity and security
5.1. Integrity
5.2. Security
6. Database Administration
6.1. Role management
6.2. Managing database access
6.3. Views
7. Physical database design and tuning

240 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

7.1. Distributed database systems

8. Emerging research trends in database systems,
8.1. MONGO DB
8.2. NO SQL
8.3. Or similar technologies

• Interactive class session

Teaching-learning • Hands on practices in class

Strategies • Brainstorming and Group discussion sessions

• Paper based written assignments 3

Assignments • Project 2
• Quiz 4

Sr. # Elements Weightage Details

1 Formative 25% It is continuous assessment. It

includes: classroom participation,
Assessment
attendance, assignments and
presentations, homework, attitude
and behavior, hands-on-activities,
Assessment and short tests, quizzes etc.
Examinations 2 Midterm 35% It takes place at the mid-point of the
semester.
Assessment

3 Final 40% It takes place at the end of the

semester. It is mostly in the form of a
Assessment
test, but owing to the nature of the
course the teacher may assess their
students based on term paper.
• Database Systems: A Practical Approach to Design, Implementation, and
Management, 6th Edition by Thomas Connolly and Carolyn Begg
Textbooks &
• 2. Database Management Systems, 3rd Edition by Raghu Ramakrishnan,
Reference material Johannes Gehrke
• 3. Database System Concepts, 6th Edition by Avi Silberschatz, Henry F.
Korth and S. Sudarshan.

241 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• 4. Database Systems: The Complete Book, 2nd Edition by Hector Garcia-

Molina, Jeffrey D. Ullman, Jennifer Widom

• The instructor reserves the right to modify the grading scheme/marks

Notes division and course outline during the semester.

242 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code ED-344

Course Title Machine Learning

Theory Lab
Credit Hours
2 1

Lecture Duration 60 minutes (1Hours), 2 lectures per week, 3 hours lab session per week

Semester 6

Courses Knowledge

Basic experience with programming

Pre-requisites is required. Knowledge of Linear
Nil
Algebra, Probability and Statistics,
and Calculus would be helpful.

Follow Up Courses Deep Learning

Course Learning Outcomes (CLOs)

CLO No Course Learning Outcome Bloom Taxonomy

Describe basic machine learning concepts, theories and
CLO-1 C1 (Knowledge)
applications.
Apply supervised learning techniques to solve classification
CLO-2 C3 (Apply)
problems of moderate complexity.
Apply unsupervised learning techniques to solve clustering
CLO-3 C3 (Apply)
problems of moderate complexity.
Apply reinforcement learning algorithms to environments
CLO-4 C3 (Apply)
with complex dynamics.
Develop a reasonable size project using suitable machine
CLO-5 C6 (Create)
learning technique to solve complex problems.

243 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

1. This course aims to introduce students to the basics of machine

learning
2. The general objective is to make students understand a range of

Aims and various machine learning algorithms along with their strengths and

Objectives weaknesses.
3. The course aims to make students able to apply machine learning
algorithms to solve problems in Data Science of moderate
complexity.

• Students should be able to describe basic machine learning

concepts, theories and applications
• Students should be able to apply supervised/unsupervised learning
techniques to solve classification/clustering problems of moderate

Learning Outcomes complexity

• Students should be able to apply reinforcement learning algorithms
to environments with complex dynamics
• Students should be able to develop a reasonable size project using
suitable machine learning technique

Introduction to machine learning; concept learning: General-to-specific

ordering of hypotheses, Version spaces, Candidate elimination
algorithm; Supervised Learning: Decision trees, Naive Bayes, Artificial
Neural Networks, Support Vector Machines, Overfitting, noisy data, and
pruning, Measuring Classifier Accuracy; Linear and Logistic regression;
Syllabus
Unsupervised Learning: Hierarchical Agglomerative Clustering. k-means
partitional clustering; Self-Organizing Maps (SOM) k-Nearest-neighbor
algorithm; Semi-supervised learning with EM using labeled and
unlabeled data; Reinforcement Learning: Hidden Markov models, Monte
Carlo inference Exploration vs. Exploitation Trade-off, Markov Decision

244 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Processes; Ensemble Learning: Using committees of multiple

hypotheses. Bagging, boosting.

Unit 1: Introduction

1.1 Machine learning

1.2 Concept learning
1.3 General to specific ordering of hypotheses
1.4 Introduction to version space
1.5 Candidate elimination algorithm
Unit 2: Supervised Learning

2.1 Introduction
2.2 Decision Trees
2.3 Naïve Bayes and its types
2.4 Artificial Neural Networks
2.5 Support Vector Machines
Contents 2.6 Linear and Logistic regression
Unit 3: Unsupervised Learning

3.1 Introduction
3.2 Partition and hierarchical clustering methods
3.3 Self-Organizing maps
Unit 4: Semi-supervised Learning

4.1 Introduction
4.2 Expectation maximization (EM)
Unit 5: Reinforcement Learning

5.1 Introduction
5.2 Hidden Markov Models
5.3 Monte Carlo inference

245 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

5.4 Exploration vs exploitation trade-off, MDP

Unit 6: Ensemble Learning

6.1 Introduction
6.2 Using committees of multiple hypotheses
6.3 Bagging, Boosting

• Multimedia presentations involving interaction from students

Teaching-learning
• Hands on exercises for concept reinforcement
Strategies
• Coding in laboratory

There would be 4-5 programming assignments (2 pre and 2-3 post

midterm)
Assignments

Sr. # Elements Weightage Details

1 Formative 25% It is continuous assessment. It includes

Assessment classroom participation, attendance,
assignments and presentations,
homework, attitude and behavior,
hands-on-activities, short tests, quizzes
Assessment and
etc.
Examinations
2 Midterm 35% It takes place at the mid-point of the
Assessment semester.

3 Final 40% It takes place at the end of the

Assessment semester. It is mostly in the form of a
test, but owing to the nature of the
course the teacher may assess their

246 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

students based on term paper, research

proposal development, field work and
report writing etc.

Mitchell, T. M. (1997). Machine Learning. (1st Edition). McGraw-Hill

Textbooks
Education. ISBN-13: 978-0070428072

Reference • Murphy, K. P. (2012). Machine Learning: A Probabilistic Perspective.

Material/Suggested MIT Press. ISBN-13: 978-0262018029
Readings • Bishop, C. M. (2006). Pattern Recognition and Machine Learning.
New York: Springer-Verlag. ISBN-13: 978-0387310732

• Academic integrity is expected of all students. Plagiarism or

cheating in any assessment will result in at least an F grade in the
course, and possibly more severe penalties

Notes • There is no makeup for a missed sessional grading instruments like

quizzes, assignments, and homework
• The instructor reserves the right to modify the grading
scheme/marks division and course outline during the semester

247 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Detailed Lecture wise plan

Recommendat
Source
Wee Lectur ion for
Topic Book
k e Learning
(Ch#)
Activities
1 1 Introduction: types; well-posed ML problems Ch#1 Reading-1
2 Concept Learning: introduction, a concept learning Ch#2
task, concept learning as search; general to
specific ordering of hypotheses; finding a
maximally specific hypothesis
2 3 Version Spaces: basics, If-then-eliminate algorithm Reading-2
4 Candidate elimination algorithm
3 5 Inductive bias, effect on hypothesis space Quiz-1
6 Supervised Learning: introduction; Decision Tree Ch#3
learning
4 7 Selecting best attribute, extracting rules from
learned decision trees
8 Issues in decision tree learning Assignment-1
5 9 Bayesian approach to classification: MAP, Naïve Ch#6
Bayes assumption
10 Naïve Bayes classifier
6 11 Artificial Neural Networks: Perceptrons Ch#4 Quiz-2
12 Multilayer Perceptron networks and the
backpropagation algorithm
7 13 Issues in MLP training; performance Reading-3
enhancements for backpropagation algorithm
14 Kernel methods: Support Vector Machines Handout Assignment-2
s
8 15 SVM training; kernel functions, Issues in multiclass Handout
problems s
16 Midterm review
Midterm Exam
9 17 Linear models for regression and classification Handout Assignment-3
s
18 Linear regression
10 19 Logistic regression Handout Reading-4
s
20 Logistic regression (contd.)
11 21 Unsupervised learning: basics Quiz-3
22 Clustering methods: partition based; K-means Handout
algorithm s

248 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
Source
Wee Lectur ion for
Topic Book
k e Learning
(Ch#)
Activities
12 23 Hierarchical clustering; agglomerative vs divisive Assignment-4
methods
24 Hierarchical clustering (contd.)
13 25 Self-organizing maps (SOMs) Handout Reading-5
s
26 Semi supervised learning; basics; applications Handout
s
14 27 Expectation maximization algorithm Reading-6
28 Reinforcement Learning: introduction Ch#13 Quiz-4
15 29 HMMs; Monte Carlo inference
30 Exploration vs exploitation trade-off; Q-Learning Assignment-5
16 31 Ensemble Learning: Committees; Boosting; Handout
Bagging s
32 Final term review
Final Exam

249 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code ED-321

Course Title Deep Learning

Theory Lab
Credit Hours
3 Nil

Lecture Duration 90 minutes (1.5 Hours), 2 lectures per week

Semester 8

Courses Knowledge
Pre-requisites
Nil Nil

Follow Up Courses NilL

Course Learning Outcomes (CLOs)

CLO No Course Learning Outcome Bloom Taxonomy

CLO-1 Apply deep learning algorithms to real-world problems C3 (Apply)
Analyze results from deep learning to select appropriate
CLO-2 C4 (Analyze)
solutions
Code the novel neural network architectures from scratch
CLO-3 and evaluating the performance on application specific C3 (Apply)
standard benchmarks
1. Understand the Deep Learning concepts
2. Apply deep learning algorithms to real-world problems

Aims and 3. Analyze results from deep learning to select appropriate solutions

Objectives 4. Code the novel neural network architectures from scratch and
evaluating the performance on application specific standard
benchmarks

Learning Outcomes • Understand the Deep Learning concepts

250 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• Apply deep learning algorithms to real-world problems

• Analyze results from deep learning to select appropriate solutions
• Code the novel neural network architectures from scratch and
evaluating the performance on application specific standard
benchmarks

Basics of deep learning, learning networks, Shallow vs. Deep learning etc.;
Machine learning theory – training and test sets, evaluation, etc. Theory of
Generalization; Multi-layer perceptrons, error back-propagation; Deep
convolutional networks, Computational complexity of feed forward and
deep convolutional neural networks; Unsupervised deep learning including
Syllabus auto-encoders; Deep belief networks; Restricted Boltzman Machines; Deep
Recurrent Neural Networks (BPTT, LSTM, etc.); GPU programming for deep
learning CuDNN; Generative adversarial networks (GANs); Sparse coding
and auto-encoders; Data augmentation, elastic distortions, data
normalization; Mitigating overfitting with dropout, batch normalization,
dropconnect; Novel architectures, ResNet, GoogleNet, etc

1. Basics of deep learning,

2. Learning networks,
3. Shallow vs. Deep learning etc.
4. Machine learning theory
4.1. training and test sets,
4.2. evaluation, etc.
Contents
5. Theory of Generalization
6. Multi-layer perceptrons,
7. Error back-propagation
8. Deep convolutional networks,
8.1. Computational complexity of feed forward and deep
convolutional neural networks

251 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

9. Unsupervised deep learning including auto-encoders

10. Deep belief networks
11. Restricted Boltzman Machines
12. Deep Recurrent Neural Networks (BPTT, LSTM, etc.)
13. GPU programming for deep learning CuDNN
14. Generative adversarial networks (GANs)
15. Sparse coding and auto-encoders
16. Data augmentation,
17. Elastic distortions
18. Data normalization
19. Mitigating overfitting with dropout
20. Batch normalization,
21. Dropconnect
22. Novel architectures,
23. ResNet,
24. GoogleNet, etc

• Interactive class session

Teaching-learning
• Hands on practices in class
Strategies
• Brainstorming and Group discussion sessions

• Paper based written assignments 2

Assignments
• Programming Assignments 6

Sr. # Elements Weightage Details

1 Formative 25% It is continuous assessment. It includes

Assessment classroom participation, attendance,
Assessment and
assignments and presentations,
Examinations
homework, attitude and behavior,
hands-on-activities, short tests, quizzes
etc.

252 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

2 Midterm 35% It takes place at the mid-point of the

Assessment semester.

3 Final 40% It takes place at the end of the

Assessment semester. It is mostly in the form of a
test, but owing to the nature of the
course the teacher may assess their
students based on term paper, research
proposal development, field work and
report writing etc.

• Deep Learning by Ian Goodfellow, Yoshua Bengio, Aaron Courville

( http://www.deeplearningbook.org/)
Textbooks • Deep learning with python by Francoise Chollet, ISBN-10:
9781617294433, 2017

• Handout provided by the teacher.

Reference • PowerPoint Presentations
Material/Suggested • Various books Chapters / Notes
Readings • Internet resources

• Academic integrity is expected of all students. Plagiarism or

cheating in any assessment will result in at least an F grade in the
course, and possibly more severe penalties.
• You bear all the responsibility for protecting your assignments from

Notes plagiarism. If anyone else submits your assignment or uses your

code in his/her assignment, you will be considered equally
responsible.
• The instructor reserves the right to modify the grading
scheme/marks division and course outline during the semester.

253 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• There is no makeup for a missed sessional grading instruments like

quizzes, assignments, and homework’s.

254 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code ED-345

Course Title Artificial Neural Network

Theory Lab
Credit Hours
2 1

Lecture Duration 60 minutes (1 Hours), 2 lectures per week, 3 hours lab session per week

Semester 7

Courses Knowledge
Pre-requisites
Machine Learning Nil

Follow Up Courses Deep Learning

Course Learning Outcomes (CLOs)

CLO No Course Learning Outcome Bloom Taxonomy

Understand the fundamentals of neural networks in
CLO-1 C2 (Understand)
AI.
CLO-2 Explain how simple ANNs can be designed. C2 (Understand)
CLO-3 Apply ANN for complex problems. C3 (Apply)
1. Understand the fundamentals of neural networks in AI

Aims and 2. Explain how simple ANNs can be designed.

Objectives 3. Apply ANN for classification Problems

4. Differentiate between different Networks and their learning laws

• Understand the fundamentals of neural networks in AI

• Explain how simple ANNs can be designed.
Learning Outcomes
• Apply ANN for classification Problems
• Differentiate between different Networks and their learning laws

255 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Introduction and history of neural networks, Basic architecture of neural

networks, Perceptron and Adaline (Minimum Error Learning) for
classification, Gradient descent (Delta) rule, Hebbian, Neo-Hebbian and
Differential Hebbian Learning, Drive Reinforcement Theory, Kohonen Self
Syllabus
Organizing Maps, Associative memory, Bi-directional associative memory
(BAM), Energy surfaces, The Boltzmann machines, Backpropagation
Networks, Feedforward Networks; Introduction to Deep learning and its
architecture

1. Introduction and history of neural networks,

2. Basic architecture of neural networks,
3. Perceptron and Adaline (Minimum Error Learning) for classification,
4. Gradient descent (Delta) rule,
5. Hebbian, Neo-Hebbian and Differential Hebbian Learning,
6. Drive Reinforcement Theory,
7. Kohonen Self Organizing Maps,
Contents
8. Associative memory,
9. Bi-directional associative memory (BAM),
10. Energy surfaces,
11. The Boltzmann machines,
12. Backpropagation Networks,
13. Feedforward Networks;
14. Introduction to Deep learning and its architecture

• Interactive class session

Teaching-learning
• Hands on practices in class
Strategies
• Brainstorming and Group discussion sessions

• Paper based written assignments 4

Assignments
• Programming Assignments 6

Sr. # Elements Weightage Details

256 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

1 Formative 25% It is continuous assessment. It includes

Assessment classroom participation, attendance,
assignments and presentations,
homework, attitude and behavior,
hands-on-activities, short tests, quizzes
etc.

2 Midterm 35% It takes place at the mid-point of the

Assessment and
Assessment semester.
Examinations
3 Final 40% It takes place at the end of the
Assessment semester. It is mostly in the form of a
test, but owing to the nature of the
course the teacher may assess their
students based on term paper, research
proposal development, field work and
report writing etc.

• Neural Network Design, 2nd Edition, Martin T. Hagan, Howard, B.

Demuth, Mark Hudson Beale and Orlando De Jesus, Publisher:
Martin Hagan; 2 edition (September 1, 2014), ISBN-10: 0971732116
• An Introduction to Neural Networks, James A Anderson, Publisher:
Textbooks
A Bradford Book (March 16, 1995), ISBN-10: 0262011441
• Fundamentals of Artificial Neural Networks, Mohammad Hassoun,
Publisher: A Bradford Book (January 1, 2003), ISBN-10: 0262514672

• Handout provided by the teacher.

Reference • PowerPoint Presentations
Material/Suggested • Various books Chapters / Notes
Readings • Internet resources

257 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• Academic integrity is expected of all students. Plagiarism or

cheating in any assessment will result in at least an F grade in the
course, and possibly more severe penalties.
• You bear all the responsibility for protecting your assignments from
plagiarism. If anyone else submits your assignment or uses your
code in his/her assignment, you will be considered equally
Notes
responsible.
• The instructor reserves the right to modify the grading
scheme/marks division and course outline during the semester.
• There is no makeup for a missed sessional grading instruments like
quizzes, assignments, and homework’s.

258 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS data science

Course Code DS-3XX

Course Title Business Process Management

Theory Lab
Credit Hours
3 0

Lecture Duration 90 minutes (1.5 Hours), 2 lectures per week

Semester 7

Courses Knowledge
Pre-requisites
Nil

Follow Up Courses

Upon completion of this course, the student will be able to:

Aims and
Objectives 1. Use business process modeling tools
2. Design and model business processes
3. Perform process mining
At the end of the course, you should be able to:
• Use Design and model business processes Explain the model
Learning Outcomes classification at different levels.
•

1. Introduction and background

1.1. Process identification
1.2. Overview of modeling

Contents 1.3. BPM lifecycle

1.4. Definition of process architecture
1.5. Process selection
2. Essentials of process modeling

259 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

2.1. Branching and merging

2.2. Business objects
2.3. Resources
2.4. Process decomposition
2.5. Process model reuse
3. Advanced process modeling
3.1. Rework and repetition
3.2. Handling events
3.3. Handling exceptions
3.4. Business rules
4. Process discovery
4.1. Process discovery methods
4.2. Process modeling method
4.3. Process model quality assurance
5. Qualitative process analysis
5.1. Value added analysis
5.2. Waste analysis
5.3. Stakeholder analysis and issue documentation
5.4. Root cause analysis
6. Process redesign
6.1. Transactional methods
6.2. Transformational methods
7. Process monitoring
7.1. Context of monitoring
7.2. Process performance dashboards
7.3. Introduction to mining

• Interactive class session

Teaching-learning
• Hands on practices in class
Strategies
• Brainstorming and Group discussion sessions

260 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• Paper based written assignments 3

Assignments • Project 2
• Quiz 4

Sr. # Elements Weightage Details

1 Formative 25% It is continuous assessment. It

includes: classroom participation,
Assessment
attendance, assignments and
presentations, homework, attitude
and behavior, hands-on-activities,
Assessment and short tests, quizzes etc.
Examinations 2 Midterm 35% It takes place at the mid-point of the
semester.
Assessment

3 Final 40% It takes place at the end of the

semester. It is mostly in the form of a
Assessment
test, but owing to the nature of the
course the teacher may assess their
students based on term paper.
• Marlon Dumas, Marcello La Rosa, Jan Mendling, Hajo Reijers.
Fundamentals of Business process Management. Springer, 2nd Edition,
Textbooks &
2017
Reference material • Mathias Weske. Business Process Management: Concepts, Languages,
Architectures. Springer, 2015.

• The instructor reserves the right to modify the grading scheme/marks

Notes division and course outline during the semester.

261 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code DS-4XX

Course Title Cloud Computing

Theory Lab
Credit Hours
3 0

Lecture Duration 90 minutes (1.5 Hours) 2 lectures per week

Semester 7

Courses Knowledge
Pre-requisites
Nil Nil

Follow Up Courses

1. Cloud computing is attractive for individuals users as well as for the

businesses. It provides on-demand computation and storage
resources, which is attractive for a large number of users, mainly
due to pay-per-usage charging model.
Objectives
2. This course will introduce topics, tools, and technologies of

3. cloud computing to the students. The course would also expose

students to the essential tools and technologies used in Cloud
Computing.

• Understand of cloud computing

• Hands-on experience using cloud resources
Learning Outcomes
• Have knowledge of cloud technologies
• Understand distributed systems concepts

Syllabus The syllabus of the course covers

262 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Introduction to Cloud Computing, AWS Services, EC2 handson,Introduction

to Scraping, Selenium, Python Scrapy, Introduction to Virtualization,
Introduction to Big Data, Introduction to NoSQL technologies (MongoDB and
DynamoDB), MapReduce/Hadoop, Apache Spark, Serverless Computing,
Introduction to Blockchain, Autoscaling Cloud Applications, Consistency in
Distributed Systems, Fault Tolerance in Distributed Systems, Fault Tolerance
in Distributed Systems,

1. Introduction to Cloud Computing

1.1 Definition and History of Cloud Computing

1.2 Service Models

1.3 Deployment Models

2. AWS Services, EC2 hands-on

2.1 S3

2.2 EC2

2.3 RDS

2.4 Dynamo DB
Contents
3. Introduction to Scraping, Selenium, Python Scrapy

3.1 Introduction to Scraping

3.2 Using Python for Scrapping

4. Virtualization

4.1 Introduction to Virtualization

4.2 Host Viruatlization

4.3 Paravirtualization

4.4 Hardware Virtualization

4.5 Introduction to Containers

263 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

5. Big Data

5.1 Introduction to Big Data and its Characteristics

5.2 Big Data Processing Models

5.3 Big Data Analytics Types and Uses

6. NoSQL technologies

6.1 MongoDB

6.2 DynamoDB

6.3 RADIS
7. Batch Processing using MapReduce/Hadoop
8. Stream Processing using Apache Spark
9. Serverless Computing
10. Introduction to Blockchain
11. Autoscaling Cloud Applications
12. Consistency in Distributed Systems,
13. Fault Tolerance in Distributed Systems,
14. Fault Tolerance in Distributed Systems

• Interactive class session

Teaching-learning
• Hands on assignments and tutorials
Strategies
• Group project

Assignments • Practical Assignments 5

Sr. # Elements Weightage Details

1 Formative 25% It is continuous assessment. It

Assessment and
Assessment includes: classroom participation,
Examinations
attendance, assignments and
presentations, homework, attitude

264 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

and behavior, hands-on-activities,

short tests, quizzes etc.

2 Midterm 35% It takes place at the mid-point of

Assessment the semester.

3 Final 40% It takes place at the end of the

Assessment semester. It is mostly in the form of
a test, but owing to the nature of
the course the teacher may assess
their students based on term
paper, research proposal
development, field work and report
writing etc.

• Jothy Rosenberg and Arthur Mateos; The Cloud at Your Service;

Textbooks
Manning Publications. ISBN: 1935182528

• Paul Zikopoulos and Chris Eaton; Understanding Big Data: Analytics

for Enterprise Class Hadoop and Streaming Data; McGraw-Hill. ISBN:
Reference
0071790535
Material/Suggested
• Kyle Banker, Peter Bakkum, Shaun Verch, Douglas Garrett, and Tim
Readings
Hawkins; MongoDB in Action, Second Edition.
• Clinton W. Brownley; Foundations for Analytics with Python from
Non- Programmer to Hacker.

265 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• Academic integrity is expected of all students. Plagiarism or

cheating in any assessment will result in at least an F grade in the
course, and possibly more severe penalties.
• You bear all the responsibility for protecting your assignments from
plagiarism. If anyone else submits your assignment or uses your
code in his/her assignment, you will be considered equally
Notes
responsible.
• The instructor reserves the right to modify the grading
scheme/marks division and course outline during the semester.
• There is no makeup for a missed sessional grading instruments like
quizzes, assignments, and homework’s.

266 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Detailed Lecture wise plan

Recommendation
SourceBook
Week Lecture Topic for Learning
(Ch#)
Activities
1 1 Introduction To Cloud Computing
2 Introduction To Cloud Computing Assignment

(Cont.)
2 3 Introduction To Big Data
4 Introduction To Big Data (Cont.) Quiz

3 5 Virtualization
6 Containerization/Dockers
4 7 Fundamental concepts of Assignment

Distributed Systems
8 Fundamental concepts of
Distributed Systems (Cont.)
5 9 Fundamental concepts of Quiz

Distributed Systems (Cont.)

10 Fundamental concepts of
Distributed Systems (Cont.)
6 11 MapReduce Quiz

12 MapReduce Programming and Case

Studies
7 13 Scalable Web Application in The
Cloud
14 Scalable Web Application in The Assignment

Cloud (Cont.)

267 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendation
SourceBook
Week Lecture Topic for Learning
(Ch#)
Activities
8 15 Big Data Processing Methods and
Techniques
16 Apache Kafka: Distributed
Messaging Systems
Midterm Exams
9 17 Data Analytics Using Python Quiz

18 Data Analytics Using Python (Cont.)

10 19 Introduction to Apache Spark
20 Using Apache Spark Solving Real
Problems: Case Studie
11 21 Introduction to NoSQL Databases
22 MongoDB and Apache Cassandra Assignment

12 23 RADIS
24 Big Data Transformation Methods
13 25 Big Data Transformation Methods Assignment

(Cont.)
26 Predictive Analytics: Applied
Machine Learning
14 27 Practical Considerations in Cloud
Computing
28 Future of the Cloud Computing and Quiz

Big Data
15 29 Introduction to Blockchain

268 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendation
SourceBook
Week Lecture Topic for Learning
(Ch#)
Activities
30 Recent advancements in Cloud
Computing
16 31 Research Topics in Cloud Research Papers

Computing
32 Research Topics in Cloud Research Papers

Computing
Final Exam

269 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code ED-441

Course Title Visual Programming

Theory
Credit Hours
3

Lecture Duration 90 minutes (1.5 Hours), 2 lectures per week

Semester 5

Courses Knowledge

• Practical experience and

proficiency with C/C++ or
Java.
• Good concepts and
Pre-requisites knowledge of OOP and
Object Oriented Programming
Design Principles.
• Basic knowledge about
server and client side
processing architecture.

Follow Up Courses NA

1. Understanding of Visual C# Programming

2. Understanding of Programming in C# .NET

Objectives 3. Understanding Microsoft .NET architecture.

4. Understanding and developing Software Development using
Microsoft Platform/Technologies.

270 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

5. To have solid working experience C# programming language

6. To be efficient in developing desktop and web applications using
Microsoft .NET framework and class library

• Student should be able to design desktop and web applications.

• Student should be able to understand the visual programming.
• Student can develop real time software.
Learning Outcomes
• Student should have practical knowledge of developing applications
using N-Tier Architecture, Service Oriented Architecture, Loosely
Coupled Systems, MVC Architecture and Single Page Applications.

Introduction to Course, Overview of Visual Programming C#, Microsoft

technology history, Intro to .net and its architecture, Concept of MSIL, CLR,
CLS, CTS, HelloWorld Program, compilation through command line using csc
compiler,.NET Managed and Unmanaged Code, Assembly file Concept, Type
of Assembly (exe, dll).Global Assembly Cache, Assembly manifest , input
from command line, Input from Console. Creation of Assembly file(dll, exe)
using csc compiler., Introduction to C#, Data Types, value Types, Reference
Types, Control Structures, Loops, foreach loop, C# Class structure and Access
specifiers(Public, private), Object creation, Concept of Namespaces, ref and
Syllabus var keyword, Boxing and Un-Boxing, Using out and dynamic keywords,
params modifier, Object Initializers ,Optional Arguments, Named
Arguments, Namespace Aliasing-Tier Architecture Concept, use of Data
access, business objects, business logic and presentation layer in N-Tier.
Implementation of N-Tier, Introduction to ADO.Net, Connected .Net Data
Providers(Connection, Command, DataReader), Generics, Collections (List,
Dictionary),Sql Injection, parameterized queries. Delegate, Introduction to
WPF, XAML Basics, Multicast delegates, Anonymous Methods, Lambda
Expression, WPF layout Concept, StackPanel, Element Binding, Events, Dock
and Grid Layout, Dependency and attach Properties, Introduction to

271 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Disconnected Model, Usage of Data Set, Data Adapter and Command

Builder in disconnected Model. Data Binding, Simple and Complex Data
Binding, , List and Grids, Microsoft Reports, HTML, Introduction to java
script, data types, variables, functions, Debugging js using Firebug, DOM
Tree., Introduction to the Browser’s Object (BOM), Events, Event Flow,
Event Capturing vs Event bubbling, Query selector API,Introduction to
Jquery, Selecting and Filtering, Event, Manipulating Contents and
Attributes, Jquery Effects, Manipulating CSS, AJAX, Introducing LINQ, LINQ
to Objects, Query Syntax,LINQ to Sql, Projection, Filtering and Join In Linq
Queries, Method Syntax, Extension Methods, Lambda Expression,
Introduction to ASP.NET MVC, MVC Application Structure, Controllers
overview, Action Methods, parameterized action methods, Introduction to
Razor Syntax, Code Expressions, , Code Blocks, Implicit Vs Explicit Code
Expression, Views, ViewData and ViewBag, Strongly Typed Views,View
Models, Layouts, ViewStart, partial Views, Model, Model Binding,
Introduction to ADO.NET Entity Framework, The Entity Data Model, CSDL:
The Conceptual Schema, SSDL: The Store Schema, MSL: The Mappings,Eager
vs Lazy Loading, POCO Classes, DBContext API, Querying Entity Data Models,
LINQ to Entities, Projection, Navigation, Joins in queries, Modifying Entities
and Saving Changes, Forms, Get Vs Post, Html Helpers, Form, Input Helpers,
Strongly Typed Helpers, Templated Helpers, Helpers and Model State, Data
Annotations, Client + Server Side Validation, Validation and Model Binding,
Validation and Model State, Building Loosely Coupled Components,
Introduction to dependency Injection, Constructor Injection, D.I using
NInject., Dependency Inject in MVC, Introduction to Repository Pattern.
Introduction to Service Oriented Architecture, WSDL, Service Contract, Data
Contract, XML, Example: Car Rental Service, WCF Bindings, ABC of WCF,
Restful Services, Consuming rest services (CRUD operations) using Jquery
AJAX and JSON., Introduction to Web API, Example of Web API using CRUD

272 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Example, MVC Memebership, Authorization and Security, Asp.Net Identity,

MVC Routing, Deployment of Web Application, Profiling of application,
Onion Architecture, Introduction, Advantages of Onion Architecture, Onion
Architecture Layers, Single-page application, Introduction to Blazor Tutorial
- Build your first Blazor application

1. Introduction to Visual Programming

2. Introduction to C#
3. Microsoft technology history, Intro to .net and its architecture,
3.1. Concept of MSIL, CLR, CLS, CTS, HelloWorld
4. .NET Managed and Unmanaged Code
5. Intro to C#
5.1. Classes data types, Access specifiers
5.2. Boxing unboxing, namespace
6. N-tier Architecture
7. ADO.Net

Contents 8. SQL Injection

9. Delegates
10. WPF, Desktop application development
11. HTML, Javscript, CSS
12. Jquery
13. LINQ to SQL
14. ASP.NET MVC
15. Razor syntax
16. Web APIs
17. Onion Architecture
18. Single page applications

Teaching-learning • Interactive class session

Strategies • Hands on practices in class

273 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• Brainstorming and Group discussion sessions

• Coding in LABS

Assignments Coding Assignments 6

Sr. # Elements Weightage Details

1 Formative 25% It is continuous assessment. It includes:

Assessment classroom participation, attendance,
assignments and presentations,
homework, attitude and behavior,
hands-on-activities, short tests, quizzes
etc.

Assessment and 2 Midterm 35% It takes place at the mid-point of the

Examinations Assessment semester.

3 Final 40% It takes place at the end of the semester.

Assessment It is mostly in the form of a test, but
owing to the nature of the course the
teacher may assess their students based
on term paper, research proposal
development, field work and report
writing etc.

A. Schildt, H. (2010). C# 4.0: The complete reference. Tata McGraw-Hill

Education.
B. Freeman, A., & Sanderson, S. (2013). Pro Asp. net Mvc 4 (Vol. 832).
Apress.
C. Galloway, J., Haack, P., Wilson, B., & Allen, K. S. (2012). Professional
Textbooks ASP. NET MVC 4. John Wiley & Sons.
D. Lerman, J. (2010). Programming Entity Framework: Building Data
Centric Apps with the ADO. NET Entity Framework. " O'Reilly Media,
Inc.".
E. LINQ in Action by MANNING
F. Wilton, P. (2004). Beginning JavaScript. John Wiley & Sons.

274 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

G. York, R. (2011). Beginning JavaScript and CSS development with jQuery.

John Wiley & Sons.
H. Cibraro, P., Claeys, K., Cozzolino, F., & Grabner, J. (2010). Professional
WCF 4: Windows communication foundation with. NET 4. John Wiley &
Sons.
I. MacDonald, M. (2012). Pro WPF 4.5 in VB. Apress.
J. Team, W. A. (2001). Professional ADO .NET.
K. Galloway, J., Haack, P., Wilson, B., & Allen, K. S. (2012). Professional
ASP. NET MVC 4. John Wiley & Sons.
• R1. Handouts
Reference • R2. Deitel, P., & Deitel, H. (2017). Visual C# how to program.
Pearson.
Material/Suggested
• R3. Microsoft Visual C# 2013 Step by Step (Step by Step Developer),
Readings Sharp, J., 1st Edition (2013), Microsoft Press.
• R4. http://www.asp.net/web-api
• R5. http://www.msdn.com

275 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Detailed Lecture wise plan

Recomm
endatio
Wee Lectur Source Book n for
Topic
k e (Ch#) Learning
Activitie
s
1 1 Introduction to Course, Overview of Visual R1: Reading
Programming, Microsoft Visual C#, Microsoft Material
technology history, Intro to .net and its A-Chap 1 pg(3-8)
architecture, Concept of MSIL, CLR, CLS, CTS, A-Chap 2 pg(11-
HelloWorld Program, compilation through 23)
command line using csc compiler R2

2 .NET Managed and Unmanaged Code, R1-( Reading

Assembly file Concept, Type of Assembly (exe, Material)
dll).Global Assembly Cache, Assembly manifest A-Chap 1 pg(8-9)
, input from command line, Input from A-Chapter 2 pg
Console. Creation of Assembly file(dll, exe) (13- pg-28)
using csc compiler.
2 3 Introduction to C#, Data Types, value Types, A-Chap 3, Chap 5,
Reference Types, Control Structures, Loops, Chap 6 pg (111- Quiz#1
foreach loop, C# Class structure and Access 131), Chap 8 pg
specifiers(Public, private), Object creation, (167-174),Chap
Concept of Namespaces, ref and var keyword 16 pg (449-463 )
4 Boxing and Un-Boxing, Using out and dynamic A-Chap 11 pg 315
keywords, params modifier, Object A-Chap 6 Pg 132-
Initializers ,Optional Arguments, Named 135,Chap 3
Arguments, Namespace Aliasing pg(51) ,Chap– 8
pg (167-210)
3 5 N-Tier Architecture Concept, use of Data R1 Quiz#2
access, business objects, business logic and Assign-
presentation layer in N-Tier. Implementation 1
of N-Tier
6 Introduction to ADO.Net, Connected .Net Data J- pre chapter
Providers(Connection, Command, DataReader), content pg(1-
Generics, Collections (List, Dictionary) 6),chap 1(7-40),
Chap 2 pg(45-60)

276 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recomm
endatio
Wee Lectur Source Book n for
Topic
k e (Ch#) Learning
Activitie
s
4 7 Sql Injection, parameterized queries. Delegate, R1
Introduction to WPF, XAML Basics K-chap 7 pg(137-
187)
I-chap 3 pg(43-
73)

8 Multicast delegates, Anonymous Methods, A-Chap15 pg(411-

Lambda Expression, WPF layout Concept, 445) Quiz#3
StackPanel, Element Binding
5 9 Events, Dock and Grid Layout, Dependency and A-Chap15 pg(411-
attach Properties, Introduction to 445)
Disconnected Model J- Chap 9 pg(317-
365)
10 Usage of Data Set, Data Adapter and Command R1,W2, Quiz#4
Builder in disconnected Model. Data Binding, J-Chap 6 pg(207- Assign-
Simple and Complex Data Binding, , List and 235) 2
Grids, Microsoft Reports J-Chap 9 pg(317-
365)
6 11 Html, Introduction to java script,data types, J-chap 13 pg(455)
variables, functions, Debugging js using F-Chap1
Firebug, DOM Tree.
12 Introduction to the Browser’s Object (BOM), K-chap 8 (pg 189)
Events, Event Flow, Event Capturing vs Event F-Chap12 Quiz#5
bubbling, Query selector API
7 13 Introduction to Jquery, Selecting and Filtering, K-chap 8(pg 189)
Event, Manipulating Contents and Attributes G-Chap1-4
14 Jquery Effects, Manipulating CSS, AJAX, K-chap 8(pg 189)
Introducing LINQ, LINQ to Objects, Query A-chap 19(pg
Syntax 565)
G-Chap7-8
8 15 LINQ to Sql, Projection, Filtering and Join In Linq A-chap 19(pg Quiz#6
Queries, Method Syntax 565)
E-Chap1, E-Chap3
16 Extension Methods, Lambda Expression, A-chap 19(pg Assign-
Revision 597) 3
I-chap 2

277 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recomm
endatio
Wee Lectur Source Book n for
Topic
k e (Ch#) Learning
Activitie
s
9 17 Introduction to ASP.NET MVC, MVC Application I-chap 1,2(pg Quiz#7
Structure, Controllers overview, Action 3,15)
Methods, parameterized action methods K-chap 1(pg 1)
18 Introduction to Razor Syntax, Code I-chap 5 (pg 101)
Expressions, , Code Blocks, Implicit Vs Explicit I-chap 8(pg 201)
Code Expression, Views, ViewData and I-chap 18(pg 485)
ViewBag, Strongly Typed Views,View Models K-chap3 (pg 47)
10 19 Layouts, ViewStart, partial Views, Model, I-chap 5 (pg 101)
Model Binding, Introduction to ADO.NET Entity K-chap3 (pg 47)
Framework, The Entity Data Model, CSDL: The I-chap 2 (pg 15)
Conceptual Schema, SSDL: The Store Schema,
MSL: The Mappings
20 Eager vs Lazy Loading, POCO Classes, I-Chap 8 (pg 201)
DBContext API, Querying Entity Data Models, K-chap 4 (pg 71) Assign-
LINQ to Entities, Projection, Navigation, Joins in 4
queries, Modifying Entities and Saving Changes
11 21 Forms, Get Vs Post, Html Helpers, Form, Input K-chap 5 (pg 95)
Helpers, Strongly Typed Helpers, Templated Quiz#8
Helpers, Helpers and Model State
22 Data Annotations, Client + Server Side K-chap 6 (pg 119)
Validation, Validation and Model Binding,
Validation and Model State
12 23 Building Loosely Coupled Components, K-chap 16(pg 423)
Introduction to dependency Injection, I-chap 3(pg 47)
Constructor Injection, D.I using NInject. K-chap 12(pg
297)
24 Dependency Inject in MVC, Introduction to I-chap 3(pg 47)
Repository Pattern. K-chap 12(pg 297)

13 25 Introduction to Service Oriented Architecture, K-chap 11 (pg Quiz#9

WSDL, Service Contract, Data Contract, XML, 279)
Example: Car Rental Service J-chap 13(455)
I chap 1(pg 6)
26 WCF Bindings, ABC of WCF, Restful Services, H-chap 4(pg 103)
Consuming rest services (CRUD operations) H-chap 1(pg 1)
using Jquery AJAX and JSON. H-chap 2(pg 33) Assign-
J-chap 15(pg 551) 5

278 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recomm
endatio
Wee Lectur Source Book n for
Topic
k e (Ch#) Learning
Activitie
s
14 27 Introduction to Web API, Example of Web API K-chap 11(279)
using CRUD Example H-chap 4(pg 103) Quiz#1
J-chap 15(pg 551) 0
I-chap 12(pg 303)
I-chap 09(pg 229)
28 MVC Memebership, Authorization and K-chap 7(pg 137)
Security, Asp.Net Identity I-chap 11(pg 283)
15 29 MVC Routing, Deployment of Web Application, K-chap 11(279)
Profiling of application K-chap 7(pg 137)
K-chap 16 (pg
423)
I-chap 24 (pg 657)
I-chap 26 (pg 699)
30 Onion Architecture, Introduction, Advantages R1
of Onion Architecture, Onion Architecture
Layers
16 31 Single-page application, Introduction to Blazor R1
Tutorial - Build your first Blazor application
32 Blazor (con.) R1

279 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code ED-323

Course Title Web Technologies

Theory Lab
Credit Hours
2 1

Lecture Duration 60 minutes (1 Hours), 2 lectures per week, 3 hours lab session per week

Semester 5

Courses Knowledge
Pre-requisites
Nil Nil

Follow Up Courses Nil

1. The course of Web Technologies is particularly designed to give

students a broad understanding of a structured methodology
which is utilized in software engineering to Web development
projects.
2. The course addresses the concepts, methods, technologies, and
techniques of developing Web sites that collect, organize and

Aims and expose information resources.

Objectives 3. This course introduces students to the discipline of Web

Technologies including the methods and techniques used in web-
based system development.
4. In contrast to traditional software engineering, Web
Technologies methods and techniques must incorporate unique
aspects of the problem domain such as: document-oriented
delivery, fine-grained lifecycles, user-centric development,

280 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

client-server legacy system integration and diverse end user skill

levels.
5. This course draws upon previous programming and computing
experience to develop practical web development and
maintenance skills.
6. This course is intended for students with knowledge of both
Internet communication concepts and an introductory
programming knowledge.

• On successful completion of the course students will be able to:

1. Develop a web application using server-side programming

languages and components.
Learning Outcomes 2. Apply the Web Technologies methodologies for Web application
development
3. Develop a component-based web solution and use UML diagrams
to describe such a solution.
4. Identify and discuss the security risk of a Web application.

• Introduction
• Working on Presentation Tier
• Display web contents (HTML)
• Styling web content (CSS)
• Controlling Behavior of Content (JavaScript)
• Design pattern in JavaScript

Syllabus • Composite pattern (jQuery)

• MVC (AngularJS)
• Component based (React)
• Working on Logical tier/ Application tier
• Dynamic Server pages (JSP)
• Java Servlets
• CURD operations in Java

281 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• MVC Design pattern using Spring Framework

• ORM using Hibernate

1. Design methodologies to support web-based software systems

2. Deployment and maintenance models for web-based software

systems
Contents
3. Server-side programming and web application frameworks

4. System security for web-based software systems

5. Techniques to support mobile devices

• Interactive class session

Teaching-learning • Hands on practices in class

Strategies • Brainstorming and Group discussion sessions

• Coding in LABS

Assignments • Paper based written assignments 8

Sr. # Elements Weightage Details

1 Formative 25% It is continuous assessment. It includes:

Assessment classroom participation, attendance,
assignments and presentations,
homework, attitude and behavior, short

Assessment and tests, quizzes etc.

Examinations 2 Midterm 35% It takes place at the mid-point of the

Assessment semester.

3 Final 40% It takes place at the end of the semester.

Assessment It is mostly in the form of a test, but
owing to the nature of the course the
teacher may assess their students based

282 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

on term paper, research proposal

development, field work and report
writing etc.

Textbooks

• Handout provided by the teacher.

Reference
• PowerPoint Presentations
Material/Suggested
• Various books Chapters / Notes
Readings
• Internet resources

• Academic integrity is expected of all students. Plagiarism or cheating

in any assessment will result in at least an F grade in the course, and
possibly more severe penalties.
• You bear all the responsibility for protecting your assignments from
plagiarism. If anyone else submits your assignment or uses your code
Notes in his/her assignment, you will be considered equally responsible.
• The instructor reserves the right to modify the grading
scheme/marks division and course outline during the semester.
• There is no makeup for a missed sessional grading instruments like
quizzes, assignments, and homework’s.

283 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Detailed Lecture wise plan

Sourc Recommendat
Wee Lectur e ion for
Topic
k e Book Learning
(Ch#) Activities
1 1 Introduction
2 Introduction
2 3 Working on Presentation Tier
4 Display web contents (HTML)
3 5 Display web contents (HTML)
6 Display web contents (HTML)
4 7 Display web contents (HTML)
8 Styling web content (CSS)
5 9 Styling web content (CSS)
10 Styling web content (CSS)
6 11 Styling web content (CSS)
12 Controlling Behavior of Content (JavaScript)
7 13 Controlling Behavior of Content (JavaScript)
14 Controlling Behavior of Content (JavaScript)
8 15 Controlling Behavior of Content (JavaScript)
16 Design pattern in JavaScript
Midterm Exams
9 17 Composite pattern (jQuery)
18 Composite pattern (jQuery)
10 19 MVC (AngularJS)
20 MVC (AngularJS)
11 21 Component based (React)
22 Component based (React)
12 23 Working on Logical tier/ Application tier
24 Dynamic Server pages (JSP)
13 25 Java Servlets
26 Java Servlets
14 27 CURD operations in Java
28 CURD operations in Java
15 29 MVC Design pattern using Spring Framework
30 MVC Design pattern using Spring Framework
16 31 ORM using Hibernate
32 ORM using Hibernate
Final Exam

284 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code ED-442

Course Title Systems Programming

Theory Lab
Credit Hours
3

Lecture Duration 90 minutes (1.5 Hours), 2 lectures per week

Semester

Courses Knowledge
Pre-requisites
Operating Systems

Follow Up Courses 7

1. To understand how different services of an operating system works,

Aims and and write different OS services of your own.
2. Understand the working of OS Kernel, write its patches and compile
Objectives the Kernel source and install it on bare hardware

• Students will be able to understand the working of operating system

services
Learning Outcomes • Students will be able to write programs to use different OS APIs to
access those services and write OS utility programs using them
• Students will be able to write their own system services and add
system calls inside the Kernel code

Syllabus

Module-1 (Preparing your toolbox):

- Introduction
- C-Compilation A system programmer perspective
Contents - Working of linkers and Creating your own libraries
- UNIX make utility
- GNU autotools and Cmake
- Overview of versioning systems-git

285 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

- Exit Handlers
- Process Stack behind the curtain
- Process Heap behind the curtain
Module-2 (File, Information and Time Management):
- UNIX more utility
- File system Architecture
- File management in UNIX
- Design and code of UNIX ls utility
- Design and code of UNIX who utility
- Programming the Terminals
Module-3 (Process Management and Scheduling):
- Process Management
- Design and code of Daemon Service
- Process Scheduling Algorithms
- Design and code of UNIX shell
- Thread Management
Module-4 (Inter-Process Communication):
- Overview of UNIX IPC and Signals on the Shell
- Design and Code of Signal Handlers
- Programming UNIX pipes
- Programming UNIX named pipes
- Message Queues
- Programming with Shared Memory
- Memory Mappings
Module-5 (Thread Management and Synchronization):
- Synchronization among Threads
Module-6 (Network Programming):
- Programming with POSIX semaphores
- Overview of TCP/IP Architecture and Services
- Socket Programming
Module-7 (Network Security):
- Vulnerabilities and exploits
- Desiggning and injhecting Shell Code
- Exploiting Buffer Overflow Vulnerability
• Lectures
Teaching-learning • Case Studies
Strategies • Project
• Assignments
Assignments Types and Number with calendar

Sr. # Elements Weightage Details

286 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

1 Formative 25% It is continuous assessment. It includes:

Assessment classroom participation, attendance,
assignments and presentations,
homework, attitude and behavior,
hands-on-activities, short tests, quizzes
etc.

2 Midterm 35% It takes place at the mid-point of the

Assessment and
Assessment semester.
Examinations
3 Final 40% It takes place at the end of the semester.
Assessment It is mostly in the form of a test, but
owing to the nature of the course the
teacher may assess their students based
on term paper, research proposal
development, field work and report
writing etc.

E. Advanced programming in the UNIX environment, by W. Richard

Stevens; Stephen A. Rago, 4th edition, ISBN-13:9780321637734
Textbooks

Reference F. The Linux Programming Interface, by Michael Kerrisk, 2nd Edition, ISBN-
13: 978-1593272203
Material/Suggested
Readings
G. Dr. Muhammad Arif Butt, System Programming - Video Lectures:
https://www.youtube.com/c/LearnWithArif/playlists

Notes

287 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Detailed Lecture wise plan

Recommendat
SourceBook ion for
Week Lecture Topic
(Ch#) Learning
Activities
1 1 Module-1 (Preparing your toolbox):
Discussion on Course Matrix. Application vs
Text A-Ch1
system programming perspective. How
system calls work (Behind the curtain)
2 C-Compilation process from system
programmer perspective. Making a system
call with and without wrapper. Making a
system call from within Assembly program. Text A-Ch1
(Tools used are gcc, gdb, readelf, objdump,
nasm)

2 3 Linking and loading a process (Behind the

curtain). Load time and run time dynamic
linking. Structure of ELF file format.
Merging re-locatable object files into
executable. What is relocation. Symbol
(global, external, local) resolution. Strong
and weak symbols. Linker symbol rules for Text A-Ch2
multiple strong and weak symbols.
Creating and using your own static libraries.
Creating and using your own dynamic
libraries or shared objects. (Tools used are
nm, ar, ranlib)

4 Introduction to make utility, how make

works, Makefile rules and targets. Using
your own and built-in macros in a Makefile.
Writing and calling multiple make files for a
program. Comparison between binary and
open source software packages.
Downloading and installing open source
Text A-Ch2
software. Packaging your own software
using GNU autotools (autoconf and
automake). Packaging your own software
using cmake utility. Writing your own man
pages. (Tools used are make, autoconf,
automake, cmake, cpack)

288 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
SourceBook ion for
Week Lecture Topic
(Ch#) Learning
Activities
3 5 Local version control systems (SCCS, RCS).
Centralized version control systems (CVS,
SVN). Distributed version control systems
(git, bitkeeper, darcs, mercurial) Overview
of git. Downloading and installing git. Basic
git workflow and its configuration.
Initializing git repository, Adding, editing,
deleting and renaming files, and viewing
commit log. Ignoring files in git and
undoing changes.
Handouts
Overview of git branches. Creating,
renaming, deleting and comparing
branches. Overview of merging branches.
The concept of fast forward and real merge.
Handling merge conflicts. Concept of
remote repositories and creating one on
bitbucket. Pushing a local repo to
bitbucket. Cloning an existing repo from
bitbucket

6 How a C program starts and terminates. Lab:

Normal vs abnormal termination.
Registering exit handlers using atexit() and
on_exit() functions. Querying process
resource limits and changing them on the Text A-Ch7
shell. Getting and setting process resource
limits from within a C program using
getrlimit() and setrlimit() functions.

4 7 Memory layout of a C program. Use of

command line arguments and environment
variables in C programs. A discussion on
layout of process stack and how it grows
Text A Ch7
and shrinks. Stack buffer overflow problem.
Doing a non-local goto using longjmp() and
setjmp()

289 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
SourceBook ion for
Week Lecture Topic
(Ch#) Learning
Activities
8 Allocating using and freeing memory on Lab:
heap. Layout of heap and heap allocators.
Role of system calls brk() and sbrk() in
management of heap. Common
programming errors related to heap Text A-Ch7
management. Tools and libraries for malloc
debugging like splint, electric-fence, and
valgrind

5 9 Module-2 (File, Information and Time

Management):
Hard disk partitioning, formatting and
mounting. Internal structure of UNIX file
system (Disk, partitions, boot block, super
block, inode block). Connection to an open
Ref A Ch3
file via PPFDT. Universal I/O model (open-
read-write-close paradigm). Kernel
Buffering of file I/O and Buffering in the
stdio library. Misc important file and
directory related system calls

10 Different techniques of I/O redirection.

Use of fcntl() system call to duplicate a file
descriptor, get/set file descriptor flags in
Text A-Ch3
PPFDT, get/set file status flags in SWFT, and
achieving locks on files.

6 11 Directory management in C Programs.

Working of UNIX ls utility. How it works?
Can we design ls utility of our own? Ref A Ch4
Design and code of ls utility

12 Design and code of uname and who utility

Handout

290 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
SourceBook ion for
Week Lecture Topic
(Ch#) Learning
Activities
7 13 Module-3 (Process Management and
Scheduling):
Process Identifiers: getpid(), getppid(),
getuid(),setuid(), getgid(),setgid(),
geteuid(),seteuid(), getegid(), setegid(). Text A Ch 6
Process creation using fork(), vfork(),
clone(). Copy on Write Semantics. Orphan
and Zombie process

14 Process trees, chains and fans. Monitoring

Child Processes by accessing termination
status of the child process using wait(),
waitpid(), waitid(), wait3(), wait4() and Text A Ch 7
WIFEXITED(), WEXITSTATUS(),
WIFSIGNALED() and WTERMSIG() macros

8 15 Six exec family functions execl(), execle(),

execlp(), execv(),execve(), execvp()
Process Groups, Process Sessions, and
concept of Controlling Terminals
Impact of fork and exec on different Text A Ch 8
process attributes. Writing your own
system() function and use it to create a
shell utility

9 16 Overview of daemon processes in Linux.

Writing your own daemon process
programatically. Introduction to systemd
(replacement of SysV init daemon).
Controlling daemons using systemctl utility.
Writing long lived process and managing it Text A Ch 13
using systemctl.
Design and Code your own daemon using
systemd.
Design and code of Shell utility (SPVL-22)

291 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
SourceBook ion for
Week Lecture Topic
(Ch#) Learning
Activities
17 Different ways to achieve concurrency.
Conventional Concurrent Servers and their
Problems. Thread implementation models.
Linux implementation of POSIX threads
(LinuxThreads and NPTL). Thread creation
and termination, joining threads, passing
implicit data types to thread function, and
passing structures to thread function.
Returning and receiving data from a thread Text A-Ch11
function. Creating Thread arrays on stack,
and creating thread arrays on heap. Thread
attributes (detachstate, stackaddr,
stacksize, priority, inheritsched). Changing
the default attributes of a thread. Threads
and signals. Threads and fork(). Thread
cancellation.

10 18 Module-4 (Inter-Process Communication):

Introduction to Linux Inter-Process
communication tools. Overview of
Standard and Real time Signals. Signal
handling on Bash shell using kill and top Text A Ch 10
utilities. Sending signals using kill, raise,
abort, pause, alarm, sleep, usleep,
nanosleep functions

19 Ignoring and handling signals using signal()

system call. Avoiding race conditions using
signal mask and sigprocmask() system call.
Limitations of signal() system call. Ignoring
and handling signals using sigaction()
Text A-Ch10
system call. Scheduling future actions using
interval timers getitimer(), setitimer().
Facts about standard I/O and redirection.
I/O redirection using dup() and dup2()

292 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
SourceBook ion for
Week Lecture Topic
(Ch#) Learning
Activities
11 20 Use of pipes on the shell and in a C program
using the pipe() system call. How to use a
pipe for IPC among related processes for
unidirectional communication. The
Text A Ch 15
concept of using two pipes for bidirectional
communication. A C program that simulate
the shell command man ls | grep ls | wc

21 Communication between unrelated

processes using FIFOS .Use of named pipes
or FIFOs in a C program using the mkfifo()
and mknod() system call. How to use a
named pipe for IPC among un-related
processes for unidirectional Text A Ch 15
communication. The concept of using two
named pipes for bidirectional
communication. A simple client server
application using FIFO.

12 22 Module-5 (Thread Management and

Synchronization):
Overview of synchronization. The concept
of race condition and critical section
problems. The concept of direct and
indirect data sharing among threads,
Ref A
threads safety and reentrant functions.
Chapter 11
Introduction to mutex, locking, unlocking
and destroying a mutex object. Mutex
attributes and mutex types. Introduction to
condition variable. The concept of thread
cancellation is introduced.

293 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
SourceBook ion for
Week Lecture Topic
(Ch#) Learning
Activities
23 Module-6 (Network Programming):
Introduction to TCP/IP Programming
Paradigm. Configuring some basic servers
like telnet, dhcp, ssh, and ftp. Introduction
to Socket, TLI, MacTCP and winsock Text A Ch 16
Application Programming Interfaces.
Introduction to TCP and UDP Client-Server
Communication using BSD Socket API

13 24 Flow chart showing TCP and UDP based

client server application using socket(),
bind(), listen(), connect(), accept(), write(),
send(), sendto(), read(), recv(), recvfrom(),
and close().Three way connection
establishment and four way connection Text A Ch 16
termination.The related system calls for
creating and managing the
sockets.</br>Writing a helloworld tcp
client server application

25 Proof of these concepts with example

codes of echo and daytime clients and
servers. Some important lookup functions
like gethostbyname() and getservbyname() Text A Ch 16
with examples.Host vs NW Byte order
(htons(), ntohs(), htonl(), ntohl()).

14 26 Introduction to Datagram Sockets by

giving an overview of how datagram
sockets work. The system call graph of
Internet domain UDP Client and server. The
related system calls for creating and
managing the sockets. Proof of these
Text A Ch 16
concepts with example codes of echo,
daytime and time clients and servers. Look
up functions (gethostbyname(),
getservbyname(),
Design and code of a web server

294 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
SourceBook ion for
Week Lecture Topic
(Ch#) Learning
Activities
27 Module-7 (Network Security):
Overview of Cyber Security. Overview of
buffer overflow. A classic stack based buffer
overflow. How a stack based buffer
overflow be exploited? Exploit mitigation
Handouts
techniques. The architecture of x86_64, its
assembly and function calling convention.
Installing and using PEDA. Changing the
control of flow of execution in PEDA.

15 28 Overview of shell code. Writing your own

shell code and using it in a stand alone C-
program. Getting shell code from Internet
Handouts
archives and using them in a stand alone C-
program.

29 Writing your shell codes using pwn tools

and using them in stand alone C-program.
Writing your shell codes using msfvenom Handouts
and using them in stand alone C-program

16 30 Finding vulnerabilities in executables.

Crafting an input string to vulnerable
programs to shift the control of flow of
execution to some other part in the code
section. Injecting shell code via input string
and transferring control of flow to it.
Injecting shell code via environment
Handouts
variables and transferring control of flow to
it. Issues of exploiting vulnerable programs
inside and outside gdb. Exploiting a
vulnerable echo server executing on a
remote machine and creating a tcp bind
shell and a reverse tcp shell.

295 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code ED-443

Course Title Project Management & Quality Assurance

Theory Lab
Credit Hours
3 0

Lecture Duration 90 minutes (1.5 Hours), 2 lectures per week

Semester 8

Courses Knowledge
Pre-requisites
Software Engineering

Follow Up Courses

1. This course is aimed at introducing the primary important concepts

of project management related to managing software development
projects.
Aims and
2. They will also get familiar with the different activities involved in
Objectives Software Project Management.
3. Further, they will also come to know how to successfully plan and
implement a software project management activity, and to
complete a specific project in time with the available budget.
• CLO-1: Explain principles of the project lifecycle and how to identify
opportunities to work with learners on relevant and appropriate
project scenarios to share this understanding
• CLO-2: Critically evaluate and discuss the issues around project
Learning Outcomes management and its application in the real world with course
participants and learners
• CLO-3: Choose project management techniques for IT projects to
initiate, plan, execute and evaluate a project and work in teams to
create a project plan for a project scenario that includes key tasks,
critical path, dependencies and a realistic timeline.

296 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• CLO-4: Present strategies for gaining confidence in managing

projects through simple project planning examples.

I. Introduction to Software Project Management, Project

Management concepts, Project Management Tools, PMI‘s
Knowledge areas, PMI Framework, PMI Process Groups.
Understanding Organizations. Project Planning, Project Evaluation,
Selection of an Appropriate Approach in Project, Software Effort
Syllabus
Estimation, Activity Planning, Risk Management, Evaluating the
Risks to the Schedule, Risk Control, Configuration Management and
Maintenance, Environment for Configuration Control, Resource
Allocation, Monitoring & Control, Review and Evaluation,
Challenges of Outsourcing in Project Management
1. Introduction to software project management
2. Project evaluation and program management
3. An overview of project planning
4. Selection of an appropriate project approach
5. Software effort estimation
6. Activity planning
Contents 7. Risk management
8. Resource allocation
9. Monitoring and control
10. Managing contracts
11. Managing people in software environments
12. Working in teams
13. Software quality

The course will be based on the following teaching and learning activities:
Lectures covering the theoretical part using PowerPoint
Teaching-learning
presentations
Strategies Case studies
Review questions

Assignments Total 4 Assignment

Sr. # Elements Weightage Details

Assessment and
Examinations 1 Formative 25% Assignments, Presentations, Quizzes.
Assessment

297 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

2 Midterm 35% Mid Term exam of 90 Minutes in 9th

Assessment week of the semester.

3 Final 40% End Term exam of 120-180 minutes at

Assessment the end of semester.
• Software Project Management, Bob Hughes and Mike Cotterell,
Textbooks McGraw-Hill Education;

• Project Management Institute., & Project Management Institute,.

(2013). A guide to the project management body of knowledge
Reference (PMBOK Guide).
Material/Suggested • Chemuturi, M., Cagley, T., & Safari, an O'Reilly Media Company.
(2010). Mastering Software Project Management.
Readings • Wysocki, R. K. (2019). Effective Project Management: Traditional,
Agile, Extreme. Newark: John Wiley & Sons, Incorporated.
• Stellman, A., & Greene, J. (2008). Applied software project
management. Sebastopol, CA: O'Reilly.

Notes • Power Point slides with reading material from book.

298 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Detailed Lecture wise plan

Source Recommendation
Week Lecture Topic Book for Learning
(Ch#) Activities
Project Management concepts,
Project Management Tools,
1 PMI‘s Knowledge areas, PMBOK
PMI Framework,
PMI Process Groups.
Introduction to software project
management
1 Why is software project management
important?
What is a project?
2 Software projects versus other types of Ch-01
project
Contract management and technical project
management
Activities covered by software project
management
Plans, methods and methodologies
Some ways of categorizing software projects
Stakeholders
Setting objectives
3 Ch-01
The business case
Project success and failure
What is management?
2
Management control
Project evaluation and program
management
A business case
4 Project portfolio management Ch-02
Assignment-1
Evaluation of individual projects
Cost-benefit evaluation techniques

299 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Source Recommendation
Week Lecture Topic Book for Learning
(Ch#) Activities
Risk evaluation
Program management
Managing the allocation of resources within
programs
Strategic program management
5 Ch-02 Quiz-1
Creating a program
Aids to program management
Some reservations about program
management
Benefits management
3
An overview of project planning
Introduction to Step Wise project
planning
Select project
6 Identify project scope and objectives Ch-03
Identify project infrastructure
Analyses project characteristics
Identify project products and activities

Estimate effort for each activity

Identify activity risks
7 Allocate resources Ch-03
Review/publicize plan
Execute plan/lower levels of planning
4 Selection of an appropriate project
approach
Build or buy?
8 Ch-04
Choosing methodologies and technologies
Choice of process models
Structure versus speed of delivery
The waterfall model
5 9 The spiral model Ch-04
Software prototyping

300 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Source Recommendation
Week Lecture Topic Book for Learning
(Ch#) Activities
Other ways of categorizing prototypes
Incremental delivery
10 Agile methods Ch-04
Assignment-2
Atern/Dynamic Systems Development
Method
Extreme programming (XP)
Managing iterative processes
11 Ch-04 Quiz-2
Selecting the most appropriate process
model
Software effort estimation
6 Where are estimates done?
Problems with over- and under-estimates
12 The basis for software estimating Ch-05
Software effort estimation techniques
Bottom-up estimating

The top-down approach and parametric

models
Expert judgement
Estimating by analogy
13 Albrecht function point analysis Ch-05
Function points Mark II
COSMIC full function points
COCOMO 13: a parametric productivity
7 model
Activity planning
The objectives of activity planning
When to plan
14 Project schedules Ch-06
Projects and activities
Sequencing and scheduling activities

301 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Source Recommendation
Week Lecture Topic Book for Learning
(Ch#) Activities
Network planning models
Formulating a network model
Adding the time dimension
15 Ch-06
The forward pass
The backward pass
8 Identifying the critical path
Activity float
Shortening the project duration
16 Ch-06
Identifying critical activities
Activity-on-arrow networks
Risk
Risk management
17 Categories of risk Ch-07
A framework for dealing with risk

9
Risk identification Ch-07
Risk assessment
18 Risk planning
Assignment-3
Risk management
Evaluating risks to the schedule
Applying the PERT technique Ch-07
19 Monte Carlo simulation Quiz-3
Critical chain concepts
10 Resource allocation
The nature of resources
20 Ch-08
Identifying resource requirements
Scheduling resources
Creating critical paths
Counting the cost
Being specific
11 21 Ch-08
Publishing the resource schedule
Cost schedules
The scheduling sequence

302 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Source Recommendation
Week Lecture Topic Book for Learning
(Ch#) Activities
Monitoring and control
Creating the framework
22 Collecting the data Ch-09
Visualizing progress
Cost monitoring
Earned value analysis
23 Prioritizing monitoring Ch-09
Getting the project back to target
12 Change control
Managing contracts
24 Types of contract Ch-10
Stages in contract placement
Typical terms of a contract
25 Contract management Ch-10
Acceptance
Managing people in software environments Ch-11
13
Understanding behavior
26 Organization behavior: a background
Assignment-4
Selecting the right person for the job
Instruction in the best methods
Motivation Ch-11
The Oldham-Hackman job characteristics
model
27 Quiz-4
Stress
Health and safety
14 Some ethical and professional concern
Working in teams Ch-12
Becoming a team
28 Decision making
Organizational structures
Coordination dependencies

303 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Source Recommendation
Week Lecture Topic Book for Learning
(Ch#) Activities
Dispersed and virtual teams Ch-12
Communication genres
29
Communication plans
Leadership
15 Ch-13
Software quality
The place of software quality in project
30 planning
The importance of software quality

Defining software quality Ch-13

ISO 9126
16 31 Product versus process quality management
Quality management systems
Process capability models
Techniques to help enhance software quality Ch-13
32 Testing
Quality plans

304 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code MD-001

Course Title Math Deficiency I

Theory Lab
Credit Hours
3 0

Lecture Duration 90 minutes (1.5 Hours), 2 lectures per week

Semester 1

Courses Knowledge
Pre-requisites
Nil Nil

Follow Up Courses

1. Understand the basic concept of Complex numbers and its

arithmetic properties
2. Learn about the idea of sequence and series, and their properties
3. Learn about Permutations and Combinations, Basic Probability
4. Understand the basic concept of Limits of functions, and its
properties
Aims and
5. Understand the basic concept of continuity and discontinuity of
Objectives
functions, and their properties
6. Understand the concept of derivatives, formulas and properties
related to derivative
7. Under the concept of Increase, Decrease, Concavity, Relative
Extrema, Absolute Maxima and Minima
8. Understand the Basic definitions of definite and indefinite Integrals,

305 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

9. Learn about the Fundamental Theorem of Calculus

10. Learn how to Evaluate Definite Integrals by Substitution
11. Learn how to Evaluate the integral of Logarithmic and Other
Functions

• Students can understand what a computing problem is.

• Students can formally define a computing problem.
• Students can solve simple to moderate level computing problems.

(Students can develop an I-P-O chart for a specific programming

problem. Develop an algorithm to solve a specific programming
problem by using pseudo-code or flowcharting. Use sequence,
Learning Outcomes selection, and repetition structures to solve a problem. Apply the
appropriate design for a specific program. Apply modular designs
for programs, including sending arguments and returning values.
Implement data validation, internal and external documentation in
a program. Use objects and methods to solve problems in an
object-oriented programming environment. Incorporate object-
oriented tools within a program.)

Defining Set, various types of set representation and operations, Relation

and function, Graphical transformation of one and two dimensional
functions, Properties of functions, composition and inverses of functions,
domain and range of the functions, Maximum and minimum values of
functions, increasing and decreasing functions, zeros and intercept of
Syllabus functions, piecewise functions, continuity and Discontinuity of functions,
Polynomials and rational functions, Polynomial long division and Synthetic
division, Solution of rational functions, Absolute valued function,
properties of absolute valued functions, Asymptotes (Horizontal, vertical
and oblique), Exponential functions and their properties, Logs functions
and their properties, Systems of Two Equations and Two Unknowns,

306 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Systems of Three Equations and Three Unknowns, Matrix Algebra (Add,

subtract and multiply matrices), Row Operations and Row Echelon Forms,
Augmented Matrices, Determinant of Matrices ( 2 x 2 and higher order
matrices), Cramer’s Rule, Inverse Matrices, Series and Sequences,
Trigonometry, Angles in Radians and Degrees, Right Triangle Trigonometry,
Law of Cosines & Sines, Area of Triangle, Graphs of Other Trigonometric
Functions , Graphs of Inverse Trigonometric Functions, Basic Trigonometric
Identities (Pythagorean, Sum and Difference, Double, Half, and Power
Reducing), Trigonometric Equations, General Form of a Conic, Parabolas,
Circles, Ellipses, Hyperbolas, Degenerate Conics, Polar and Parametric
Equations, Polar and Rectangular Coordinates.

1. Sets
1.1. Defining Set,
1. various types of set representation and operations,
2. Relation and function,
2.1. Graphical transformation of one and two dimensional functions,
2.2. Properties of functions,
2.3. composition and inverses of functions
2.4. Domain and range of the functions
2.5. Maximum and minimum values of functions
2.6. Increasing and decreasing functions
2.7. Zeros and intercept of functions
2.8. Piecewise functions
2.9. Continuity and Discontinuity of functions,
Contents 3. Polynomials and rational functions
3.1. Polynomial long division and Synthetic division,
3.2. Solution of rational functions,
3.3. Absolute valued function,
3.4. properties of absolute valued functions,
3.5. Asymptotes (Horizontal, vertical and oblique),
3.6. Exponential functions and their properties,
3.7. Logs functions and their properties,
4. System of equations
4.1. Systems of Two Equations and Two Unknowns,
4.2. Systems of Three Equations and Three Unknowns,
5. Matrix Algebra (Add, subtract and multiply matrices),
5.1. Row Operations and Row Echelon Forms,
5.2. Augmented Matrices, Determinant of Matrices ( 2 x 2 and higher

307 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

order matrices),
5.3. Cramer’s Rule,
5.4. Inverse Matrices,
6. Series and Sequences,
7. Trigonometry,
7.1. Angles in Radians and Degrees,
7.2. Right Triangle Trigonometry,
7.3. Law of Cosines & Sines,
7.4. Area of Triangle,
7.5. Basic Trigonometric Identities (Pythagorean, Sum and Difference,
Double, Half, and Power Reducing),
8. Graphs of Other Trigonometric Functions,
8.1. Graphs of Inverse Trigonometric Functions,
8.2. Trigonometric Equations,
9. General Form of a Conic,
9.1. Parabolas,
9.1.1. Circles, Ellipses, Hyperbolas,
9.1.2. Degenerate Conics,
9.1.3. Polar and Parametric Equations,
10. Polar and Rectangular Coordinates.
• Interactive class session
Teaching-learning
• Hands on practices in class
Strategies
• Brainstorming and Group discussion sessions

Assignments • Paper based written assignments

Sr. # Elements Weightage Details

1 Formative 25% It is continuous

Assessment assessment. It includes:
classroom participation,
Assessment and attendance, assignments
Examinations and presentations,
homework, attitude and
behavior, hands-on-
activities, short tests,
quizzes etc.

308 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

2 Midterm Assessment 35% It takes place at the mid-

point of the semester.

3 Final Assessment 40% It takes place at the end of

the semester. It is mostly
in the form of a test, but
owing to the nature of the
course the teacher may
assess their students based
on term paper, research
proposal development,
field work and report
writing etc.

• Textbook of Algebra and Trigonometry Class XI is published by

Punjab Textbook Board (PTB) Lahore, Pakistan.
Textbooks • Calculus and Analytic Geometry, MATHEMATICS 12
(Mathematics FSc Part 2 or HSSC-II), Punjab Text Book Board
Lahore, Pakistan
• Gilbert, S. S., B. C. Andy and B. Andrew, B. 2005. Linear Algebra and
Its Applications. 4th Ed. Thomson Brooks/Cole, Belmont, CA, USA.
• Chung, S. K. 2014. Understanding basic calculus. Create Space
Independent Publishing Platform, 173-175.
Reference • Howard, Anton, Irl Bivens, Stephen Davis, Calculus, 10th Ed,2011,
Material/Suggested John Wiley & Sons, Inc. (1318 Pages)
• https://www.maa.org/sites/default/files/images/upload_library/4
Readings 6/Pengelley_projects/Project-5/set_theory_project.pdf (An
introduction to Elementary Set Theory by Guram Bezhanshvili and
Eachan Landreth)
• Howard Anton and Chris Rorres. Elementary linear Algebra, Wiley;
10th edition (April 12, 2010)
• http://mecmath.net/trig/Trigonometry.pdf (Trigonometry Michael
Corral)
• Academic integrity is expected of all students. Plagiarism or

Notes cheating in any assessment will result in at least an F grade in the

course, and possibly more severe penalties.

309 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

• You bear all the responsibility for protecting your assignments from
plagiarism. If anyone else submits your assignment or uses your
code in his/her assignment, you will be considered equally
responsible.
• The instructor reserves the right to modify the grading
scheme/marks division and course outline during the semester.
• Introductory knowledge of using the computers is assumed for this
course. All code written in quizzes, assignments, homework’s, and
exams must be in JavaScript. Code must be intelligently
documented (commented). Undocumented code may not be given
any credit.
• The IDE use is not allowed, Notepad++ has to be used for coding.
• There is no makeup for a missed sessional grading instruments like
quizzes, assignments, and homework’s.

310 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Detailed Lecture wise plan

Recommendat
Sourc
Wee Lectur ion for
Topic eBook
k e Learning
(Ch#)
Activities
1 1 Introduction to Sets: R4
Sets, subset relation, equality relation, set
operations, set identities, Venn Diagrams, power
sets.
2 Russell’s paradox, Cartesian products, relations, R4 Assign-1
functions, one-to-one correspondences, functions
equality, set equivalence.
2 3 Cardinality of set, cardinal numbers, finite and R4,
infinite sets, countable sets, uncountable sets, R3(1) Quiz#1
independent and dependent variables in functions.
4 Graphs of functions, vertical line test, the absolute R3(4)
value function and its properties.
3 5 Piecewise defined functions, domains and ranges, R3(6) Assign-2
the effect of algebraic operations on domain,
domain and ranges in applied problems, issues of
scale and units.
6 Arithmetic operations on functions, composition of R3(15 Quiz#2
functions, translations, reflections, stretches and )
compressions, symmetry, even and odd functions.
4 7 Polynomials, rational functions, algebraic functions, R3(32,
inverse functions, a method for finding inverse 38)
function, existence of inverse functions, graphs of
inverse functions, restricting domains for invertibility.
8 Exponential and logarithmic functions, solving R3(52
equations involving exponentials and logarithms, )
change of base formula for logarithms, logarithmic
scales in science and engineering, exponential and
logarithmic growth.
5 9 A brief review of polynomials, the remainder R3(A2
theorem, the factor theorem, synthetic division, 7)
using one factor to find other factors, methods for
finding roots.
10 Matrices: R5(1.1 Assign-3
Linear equations, linear system with 2 and 3 )
unknowns, consistent and inconsistent systems,
augmented matrix, elementary row operations.

311 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
Sourc
Wee Lectur ion for
Topic eBook
k e Learning
(Ch#)
Activities
6 11 Row echelon and reduced row echelon forms, R5(1.2 Quiz#3
Gaussian elimination, Gauss-Jordan elimination, free )
variables, one/two etc. parameter family of solution,
homogenous linear systems, trivial and non-trivial
solutions.
12 Formal definition of a matrix, operations on R5(1.3
matrices, matrix product as linear combinations, )
transpose of a matrix, trace of a matrix.
7 13 Properties of matrix arithmetic, Inverse of a matrix, R5(1.4
singular and invertible matrices, inverse of 2 × 2 )
matrix, solution of a system of 2 equations in 2
unknowns by matrix inversion.
14 Method to find inverse of matrix by row operations, R5(1.5 Assign-4
matrices those are not invertible, analyzing , 2.1)
homogeneous systems, definition of determinants
as a mapping, minors, cofactors, determinants by
cofactor expansion, useful techniques to evaluate
2 × 2 and 3 × 3 determinants.
8 15 Evaluating determinants by row reduction, properties R5(2.2 Quiz#4
of determinants. , 2.3)
16 Adjoint of a matrix, inverse of a matrix by adjoint R5(2.3
method, Cramer’s rule )
9 17 Trigonometry: R6(1)
Angles, types of triangles, Pythagorean theorem,
Pythagorean triple, Euclid’s formula to generate
Pythagorean triples.
18 Trigonometric functions of an acute angle, R6(7)
cofunction theorem, solving right angled triangles,
applications of right angle triangles.
10 19 Trigonometric functions of any angle, rotation and R6(24 Assign-5
reflections of angles, general triangles, the law of )
sines.
20 The law of cosines, the law of tangents, the area of a R6(44 Quiz#5
triangle, Heron’s formula. )
11 21 Circumscribed and inscribed circles, basic R6(59
trigonometric identities, sum and difference )
formulas, double angle and half angle formulas.
22 Other identities, radians and degree, arc length, area R6(82
of a sector. )

312 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
Sourc
Wee Lectur ion for
Topic eBook
k e Learning
(Ch#)
Activities
12 23 Graphing the trigonometric functions, properties of R6(10 Assign-6
graphs of trigonometric functions, domains, ranges, 3)
periodicity.

24 Inverse trigonometric functions, their domains and R6(12 Quiz#6

ranges, one-to-one correspondences, graphs of 0)
inverse trigonometric functions.
13 25 Solving trigonometric equations, Polar Coordinates, R6(12
relationship between polar and rectangular 9)
coordinates. R3(70
5)
26 Graphs in polar coordinates, symmetry tests, family R3(70
of circles, family of rose curves, family of cardioids 7)
and limaçons, family of spirals.
14 27 Conic sections; definitions of parabola, ellipse, and R3(73 Assign-7
hyperbolas; directrix, focus (foci, plural), vertex and 0)
axis of symmetry, equations of parabolas in standard
position, a technique for sketching parabolas.
28 Equations of ellipses in standard position, a R3(73 Quiz#7
technique for sketching ellipses. 4)
15 29 Equations of hyperbolas in standard position, R3(73
conjugate axis, asymptotes of hyperbolas, a 7)
technique for sketching hyperbolas.
30 Translated conics, Reflection properties of the R3(74
conics, application of the conic sections. 0)
16 31 Rotation of axes; second degree equations, rotation R3(74 Assign-8
of axes, eliminating the cross-product term. 8)
32 Conic sections in polar coordinates R3(75 Quiz#8
4)

313 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Program BS Data Science

Course Code MS-002

Course Title Math Deficiency II

Theory Lab
Credit Hours
3 0

Lecture Duration 90 minutes (1.5 Hours), 2 lectures per week

Semester 2

Courses Knowledge
Pre-requisites
Nil Nil

Follow Up Courses

1. Understand the basic concept of Complex numbers and its

arithmetic properties
2. Learn about the idea of sequence and series, and their properties
3. Learn about Permutations and Combinations, Basic Probability
4. Understand the basic concept of Limits of functions, and its
properties

Aims and 5. Understand the basic concept of continuity and discontinuity of

Objectives functions, and their properties

6. Understand the concept of derivatives, formulas and properties
related to derivative
7. Under the concept of Increase, Decrease, Concavity, Relative
Extrema, Absolute Maxima and Minima
8. Understand the Basic definitions of definite and indefinite Integrals,
9. Learn about the Fundamental Theorem of Calculus

314 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

10. Learn how to Evaluate Definite Integrals by Substitution

11. Learn how to Evaluate the integral of Logarithmic and Other
Functions

• Students can understand what a computing problem is.

• Students can formally define a computing problem.
• Students can solve simple to moderate level computing problems.

(Students can develop an I-P-O chart for a specific programming

problem. Develop an algorithm to solve a specific programming
problem by using pseudo-code or flowcharting. Use sequence,
Learning Outcomes selection, and repetition structures to solve a problem. Apply the
appropriate design for a specific program. Apply modular designs
for programs, including sending arguments and returning values.
Implement data validation, internal and external documentation in
a program. Use objects and methods to solve problems in an
object-oriented programming environment. Incorporate object-
oriented tools within a program.)

Complex Numbers, Arithmetic with Complex Numbers (Add, subtract,

multiply and divide complex numbers), Trigonometric Polar Form of
Complex Numbers, De Moivre’s Theorem and nth Roots, Recursion,
Arithmetic and Geometric Sequences, Sigma Notation, Arithmetic Series,
Geometric Series (Sum infinite and finite geometric series and categorize
geometric series), Counting with Permutations and Combinations, Basic
Syllabus
Probability, Binomial Theorem, Limit Notation, Graphs to Find Limits,
Tables to Find Limits, Substitution to Find Limits, Rationalization to Find
Limits, One Sided Limits and Continuity, Instantaneous Rate of Change,
Tangent Lines and Rates of Change, The Derivative Function, Introduction
to Techniques of Differentiation, The Product and Quotient Rules,
Derivatives of Trigonometric Functions, The Chain Rule, Derivatives of

315 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Logarithmic Functions, Derivatives of Exponential and Inverse

Trigonometric Functions, Increase, Decrease, and Concavity, Relative
Extrema, Absolute Maxima and Minima, An Overview of the Area Problem,
Area Under a Curve, The Indefinite Integral, Integration by Substitution,
The Definition of Area as a Limit; Sigma Notation, The Definite Integral.

1. Complex Numbers,
1.1. Arithmetic with Complex Numbers (Add, subtract, multiply and
divide complex numbers),
1.2. Trigonometric Polar Form of Complex Numbers,
1.3. De Moivre’s Theorem and nth Roots,
2. Recursion
2.1. Arithmetic and Geometric Sequences,
2.2. Sigma Notation,
2.3. Arithmetic Series,
2.4. Geometric Series (Sum infinite and finite geometric series and
categorize geometric series),
3. Counting
Contents
3.1. Permutations
3.2. Combinations,
4. Basic Probability,
5. Binomial Theorem,
6. Limit Notation,
6.1. Graphs to Find Limits,
6.2. Tables to Find Limits,
6.3. Substitution to Find Limits,
6.4. Rationalization to Find Limits,
6.5. One Sided Limits and Continuity
7. Instantaneous Rate of Change,
7.1. Tangent Lines and Rates of Change

316 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

8. The Derivative Function,

8.1. Introduction to Techniques of Differentiation,
8.2. The Product and Quotient Rules,
8.3. Derivatives of Trigonometric Functions,
8.4. The Chain Rule,
8.5. Derivatives of Logarithmic Functions,
8.6. Derivatives of Exponential and Inverse
8.7. Trigonometric Functions,
9. Increase, Decrease, and Concavity,
9.1. Relative Extrema,
9.2. Absolute Maxima and Minima,
10. An Overview of the Area Problem,
10.1. Area Under a Curve,
10.2. The Indefinite Integral,
10.3. Integration by Substitution,
10.4. Sigma Notation,
11. The Definite Integral.
11.1. The Definition of Area as a Limit;

• Interactive class session

Teaching-learning
• Hands on practices in class
Strategies
• Brainstorming and Group discussion sessions

Assignments • Paper based written assignments

Sr. # Elements Weightage Details

1 Formative 25% It is continuous assessment. It includes:

Assessment and
Assessment classroom participation, attendance,
Examinations
assignments and presentations,
homework, attitude and behavior,

317 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

hands-on-activities, short tests, quizzes

etc.

2 Midterm 35% It takes place at the mid-point of the

Assessment semester.

3 Final 40% It takes place at the end of the semester.

Assessment It is mostly in the form of a test, but
owing to the nature of the course the
teacher may assess their students based
on term paper, research proposal
development, field work and report
writing etc.

• Textbook of Algebra and Trigonometry Class XI is published by

Punjab Textbook Board (PTB) Lahore, Pakistan.
Textbooks • Calculus and Analytic Geometry, MATHEMATICS 12 (Mathematics
FSc Part 2 or HSSC-II), Punjab Text Book Board Lahore

• Mark J. Christensen, Computing for Calculus, 1st Edition, Academic

Press, (1st January 1981), 240pages, ISBN: 9781483271088.
Reference
• Lay, L. D. 2015. Probability and Statistics for Engineering and the
Material/Suggested
Sciences, 9th Ed. Cengage Learning, Boston, MA, USA.
Readings
• Howard, Anton, Irl Bivens, Stephen Davis, Calculus, 10th Ed, 2011,
John Wiley & Sons, Inc. (1318 Pages)

• Academic integrity is expected of all students. Plagiarism or

cheating in any assessment will result in at least an F grade in the

Notes course, and possibly more severe penalties.

• You bear all the responsibility for protecting your assignments from
plagiarism. If anyone else submits your assignment or uses your

318 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

code in his/her assignment, you will be considered equally

responsible.
• The instructor reserves the right to modify the grading
scheme/marks division and course outline during the semester.
• Introductory knowledge of using the computers is assumed for this
course. All code written in quizzes, assignments, homework’s, and
exams must be in JavaScript. Code must be intelligently
documented (commented). Undocumented code may not be given
any credit.
• The IDE use is not allowed, Notepad++ has to be used for coding.
• There is no makeup for a missed sessional grading instruments like
quizzes, assignments, and homework’s.

319 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Detailed Lecture wise plan

Recommendat
Sourc
Wee Lectur ion for
Topic eBook
k e Learning
(Ch#)
Activities
1 1 Straight Lines: A(18)
Inclination of straight line, slope of lines, slope-
intercept form of a line, two points form of a line.
2 Intercept form of lines, normal form of lines, A(17) Assign-1
intersection of lines. Problem involving application of
straight lines.
2 3 Complex Numbers: A(17)
Real number system, complex number system. The Quiz#1
complex plane. Addition, multiplication of complex
numbers. Properties of complex numbers. Inverse of
a complex number.
4 The modulus and conjugate of complex numbers. The A(17)
argument of a complex number. The modulus-
argument form of a complex number.
3 5 Multiplication and De Moivre’s Theorem. Taking A(17) Assign-2
powers of a complex number.
6 Functions of a complex variable, the complex B(7) Quiz#2
exponential function. Complex trigonometric
function. Complex nth roots of a complex number.
4 7 Permutations, Combinations and Binomial B(7)
Theorem:
Counting principal and factorial, permutations,
combinations, probability.
8 Sequences. Sequences defined recursively. A(18)
Arithmetic progression (A.P.). Common difference.
General Term of A.P.
5 9 Geometric sequence. Common ratio. General term A(18)
of a G.P. (Geometric progression).
10 Series. Sum of arithmetic and geometric series A(18) Assign-3
involving finite terms. Sum of a convergent
geometric series. Harmonic sequences.
6 11 Limits: A(18) Quiz#3
Limits an intuitive approach, one sided limit, two
sided limits, sampling pitfalls, infinite limits, vertical
asymptotes.

320 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
Sourc
Wee Lectur ion for
Topic eBook
k e Learning
(Ch#)
Activities
12 Computing limits: B(18)
Some basic limits, limits of polynomials and rational
functions as x approaches a, limits involving radicals,
limits of piecewise functions.
7 13 Limits at infinity: A(19)
Horizontal asymptotes, limits of rational functions B(8)
when x approaches infinity, a quick method to
evaluate a rational function when x approaches
infinity, end behavior of trigonometric, logarithmic,
exponential functions.
14 Continuity of trigonometric, exponential and inverse Q Assign-4
functions, obtaining limits by squeezing.
8 15 Derivatives: A(19) Quiz#4
Tangent lines and rate of change, slopes, definition of B(8)
derivative function, differentiability, the relationship
between differentiability and continuity.
16 Introduction to techniques of differentiation, Hand
derivative of a constant, derivatives of power outs
functions, derivative of a constant times a function,
derivatives of sum and differences, higher
derivatives.
9 17 The product and quotient rules, derivatives of B(15)
trigonometric functions, the chain rule. A(20)

18 Implicit differentiation: A(19)

Functions defined explicitly and implicitly. B(10)
Differentiability of functions defined implicitly.
Derivatives of logarithmic functions. Logarithmic
differentiation. Derivatives of real powers of x.
10 19 Derivatives of exponential and inverse trigonometric A(18) Assign-5
functions. Increasing or decreasing functions are B(15)
one-to-one. Related rates. Local linear
approximation.
20 The derivative in graphing and applications: A(20) Quiz#5
Increasing and decreasing functions. Concavity. B(15)
Inflection points. Logistic curves. Analysis of
functions.

321 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
Sourc
Wee Lectur ion for
Topic eBook
k e Learning
(Ch#)
Activities
11 21 Critical points. Relative maxima and relative minima. B(14)
First derivative test and second derivative test.
Geometric implications of multiplicity. Analysis of
polynomials.
22 Absolute maxima and absolute minima. Applied B(15)
maximum and minimum problems.
12 23 Rolle’s theorem. Mean Value theorem. Velocity B(12) Assign-6
interpretation of Mean Value Theorem.
Consequences of Mean Value Theorem. The
constant difference theorem.

24 Integration: B(12) Quiz#6

An overview of area problem. The rectangle problem
of finding areas. The anti-derivative method for
finding areas.
13 25 The indefinite integral. Integration formulas. B(12)
Properties of indefinite integrals. Integration from
the view point of differential equations. Slope fields.

26 Integration by substitution. Easy to recognize B(15)

substitutions. Less apparent substitutions.
Integration using Computer Algebra Systems (CAS).
14 27 The definition of area as limit. Sigma notation. The B(14) Assign-7
Fundamental Theorem of Calculus. The relationship
between definite and indefinite integrals.
Differentiation and integration are inverse
processes.
28 Evaluating definite integral by substitution. Area A(20) Quiz#7
between curves.
15 29 Product rule and integration by parts. Guidelines for A(20)
integration by parts. Repeated integration by parts.
A tabular method for repeated integration by parts.
Integration by parts for definite integrals.
30 Reduction formulas. Integration of trigonometric A(20)
functions. Wallis sine and cosine formulas.
16 31 Trigonometric substitutions. Integral involving ax 2 + A(20) Assign-8
bx + c. Integration of rational functions by partial
fractions. Integrating improper rational functions.
Improper integrals.

322 | P a g e
 Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

Recommendat
Sourc
Wee Lectur ion for
Topic eBook
k e Learning
(Ch#)
Activities
32 Taylors and Maclaurin Series. Approximations of Hand Quiz#8
functions in the vicinity of x=a. outs

323 | P a g e
Curriculum, Model Study Plan, and Course Syllabi, for BS Data Science

324 | P a g e