Faculty of Computing

REF: NCBA/BWP/CS/BOS/56
Dated: 01-02-2024

Curriculum Note
In last BOS minute held on 04/01/2024 the committee has decided to prepare the curriculum of
all computing discipline. The computing faculty had prepared the curriculum of following
departments:
1. ADP/BS in Computer Science
2. ADP/BS in Software Engineering
3. ADP/BS in Artificial Intelligence
4. ADP/BS in Data Science
5. ADP/BS in Cyber Security
6. ADPBS in Information Technology
7. BS (5 Semester) in Computer Science
8. MPhil in Computer Science

______________________

Mr. Ali Asghar

HOD, Computer Science
NCBA&E
Sub-Campus Bahawalpur
 Curriculum of Undergraduate
and Graduate Degree
Program
Computing Discipline

National College of Business Administration & Economics

Bahawalpur Campus
 Curriculum of Computing Discipline Committee

Prof. Dr Aslam Adeeb Pro-Rector

Mr. Ali Asghar Head of Department

Dr. Nasir Jalal Member

Dr. Asad Ali Member

Ms. Tehmina Naz Member

Ms. Zunaira Ahmed Member

Mr. Aqib Ali Member

Dr. Rizwan Ali Shah Expert

Dr. Khalid Mehmood Expert

Dr. Gullam Gilani Expert

Ms. Fatima tu Zahra Research Coordinator

1. Introduction
Back in 1994 NCBA&E was founded as a private institute. Practicing excellence in
teaching, learning and a close partnership with industry, its commitment and hard work
earned a well reputed place in the aspects of management studies. In 1997 Computer
science was introduced as a practicing discipline and in 2002 finally the college got the
charter from the Government of the Punjab. This was in recognition of the never ending
excellence and dedication for improvement by the college administration.

1.1 University Mission Statement

Consistent with our vision, NCBA&E provides educational programs and services that
promote student’s achievement and life-long learning to meet the needs of our diverse
community.
NCBA&E, a doctoral institution offers educational opportunities for students at both the
graduate and undergraduate levels by blending the best of scholarly and professional
pursuits. As a research university with a strong research culture, our goals to develop and
transmit knowledge, wisdom and creativity, to foster intellectual and personal growth and
prepare out students for productive career and meaningful lives.

1.2 Department of Computer Science

1.2.1 Vision
To Inculcate principles of Intellectual curiosity, innovation, and integrity, Computer
Science department offers students proper knowledge-based work environment for
advancement of their prospects as contributor to society. Aspiring the development of youth
in the field of Computer Science.

1.2.2 Excellence in Teaching

Provide students with knowledge and skills about market needs through innovative and rigorous
courses. Our facilities are state-of-the-art for we have constantly been investing in new
technology to ensure that our technological capability matches the cutting-edge approach
of our teaching.

1.2.3Excellence in Research
Department of Computer Science also producing excellent research publications.

1.3 Improving Critical Thinking Skills in Students

Encourage students to use critical and creative thinking skills to solve problems related to
contemporary issues in the financial market.
1.3.1 Application of Computer Science
Computer Science program is a skilled based degree which is beneficial for the students as well
as market. We trained students in area of software development, Artificial intelligence, Machine
learning, Robotics, Data science and analytic, Cyber security, Internet of things, computer
networks and systems.

1.3.2 Embracing Values of BS (Computer Science)

Promote skills which are required in modern era.

1.4 Department of Computer Science is running the following programs:

a) MPhil Computer Science
b) BS Computer Science
c) ADP Computer Science
d) BS Information Technology
e) ADP Information Technology
f) BS Artificial Intelligence
g) ADP Artificial Intelligence
h) BS Data Science
i) ADP Data Science
j) BS Cyber Security
k) ADP Cyber Security
l) BS Software Engineering
m) ADP Software Engineering

1.4.1 Program Selected

National College and Business Administration & Economics Bahawalpur has selected the BS
(Computer Science) for Self-Assessment Report (SAR) for the semester fall 2023, under the
directives of HEC. The program serve as a platform for education in Computer Science Field. It
is designed on the HEC’s recommended guidelines.

1.5 PROGRAM MISSION, OBJECTIVES AND OUTCOMES

In 1994 NCBA&E was founded as a private institute. Practicing excellence in teaching,
learning and a close partnership with industry, its commitment and hard work earned a
well reputed place in the aspects of management studies. In 1997 Computer science was
introduced as a practicing discipline and in 2002 finally the college got the charter from
the Government of the Punjab. This was in recognition of the never ending excellence
and dedication for improvement by the college administration .
1.5.1 University Mission Statement
Consistent with our vision, NCBA&E provides educational programs and services that
promote student’s achievement and life-long learning to meet the needs of our diverse
community.
NCBA&E, a doctoral institution offers educational opportunities for students at both the
graduate and undergraduate levels by blending the best of scholarly and professional
pursuits. As a research university with a strong research culture, our goals to develop and
transmit knowledge, wisdom and creativity, to foster intellectual and personal growth and
prepare out students for productive career and meaningful lives.
2.1 Program Selected
NCBA & E Bahawalpur has selected the BS of Computer Science program for Self-Assessment
Report (SAR) for the year 2023 under the directives of HEC.
2.1.1 Program Evaluation
The program is being evaluated based on 8 criterion and 31 standards as given in the Self-
Assessment Manual provided by Higher Education Commission (HEC).
2.1.2 Program Mission Statement
 The program strives to provide a solid foundation in computer science knowledge,
including programming, algorithms, data structures, software engineering, computer
architecture, databases, operating systems, and other core areas. It aims to develop
students' analytical, problem-solving, and critical thinking skills.
 Many BS CS programs emphasize research and encourage students to explore new
technologies and advancements in the field. They may provide opportunities for students
to engage in research projects, collaborate with faculty, and contribute to the
development of innovative solutions.
 The program focuses on equipping students with practical skills that are in demand in the
industry. This may include hands-on experience with programming languages, software
development methodologies, and tools commonly used in the field. It may also involve
internships or co-op placements to gain real-world experience.
 A BS CS program often emphasizes ethical and responsible practices in computing. It
aims to develop students' understanding of the societal impact of technology and the
importance of considering ethical implications, security, privacy, and legal aspects in
their work.
 The field of computer science is constantly evolving, and a BS CS program aims to instill
a commitment to lifelong learning in students. It prepares them to adapt to new
technologies, stay updated with the latest developments, and continue their education
beyond the undergraduate level if desired.
2.1.3 Program Objectives
 The program aims to equip students with a strong foundation in computer science
concepts, theories, and practical skills. This includes proficiency in programming
languages, algorithms, data structures, databases, computer architecture, software
engineering principles, networking, and other core areas of computer science.
 The BSCS program seeks to develop students' analytical, problem-solving, and critical
thinking abilities. Students should be able to analyze complex problems, break them
down into manageable components, and apply appropriate computational techniques to
devise effective solutions.
 BSCS programs recognize the importance of teamwork and effective communication in
the field of computer science. The objective is to develop students' ability to work
collaboratively in groups, communicate technical concepts clearly and concisely, and
engage in effective professional communication.
 BSCS programs emphasize the importance of ethical and responsible practices in
computing. The objective is to cultivate students' understanding of ethical considerations,
privacy, security, and legal aspects of computer science. Students should be aware of the
potential impact of their work on society and adhere to professional standards.
  The program aims to foster students' adaptability and a commitment to lifelong learning.
Graduates should be prepared to keep up with advancements in technology, learn new
programming languages or tools, and adapt to evolving industry trends throughout their
careers.
2.1.4 Program Outcomes
 Graduates should possess a strong foundation in computer science principles, theories,
and practical skills. They should demonstrate proficiency in programming languages,
data structures, algorithms, computer architecture, databases, software engineering,
networking, and other core areas of computer science.
 Graduates should be able to analyze complex problems, break them down into
manageable components, and apply appropriate computational techniques to develop
effective solutions. They should demonstrate proficiency in problem-solving strategies
and have the ability to think critically and creatively in solving computational challenges.
 Graduates should be capable of developing software systems using sound engineering
principles and methodologies. They should understand the software development life
cycle, requirements analysis, design, implementation, testing, and maintenance of
software solutions. They should be able to develop reliable, scalable, and maintainable
software applications.
 Graduates should possess the skills to analyze and manipulate data effectively. They
should be proficient in database design, querying, and management, as well as have an
understanding of data mining, data visualization, and data-driven decision-making
techniques.
 Graduates should be able to work effectively in team environments and collaborate with
others to accomplish common goals. They should possess strong communication skills,
including the ability to articulate technical concepts clearly and concisely, present their
work, and engage in professional communication within the field of computer science.

Ethical and Professional Responsibility: Graduates should demonstrate an understanding of

ethical considerations, privacy, security, and legal aspects in the field of computer science. They
should adhere to professional standards and exhibit responsible and ethical behavior in their
work.

Adaptability and Lifelong Learning: Graduates should have the ability to adapt to new
technologies, programming languages, and tools as the field of computer science evolves. They
should be committed to lifelong learning, staying updated with the latest advancements in the
field, and continuously expanding their knowledge and skills.
2.1.5 How each objective is aligned with program, college and institution mission
statements.
MPhil program objectives are defined in the light of program and university mission statements
that require the output to be able to comprehend knowledge of the software development,
software related companies and IT environment. Students will develop a basic and strategic level
understanding of the key functions of programming. Students will be able to think critically and
make decisions, both individually and as part of teams and groups, using tools such as
written/oral communication, technology, problem and case analysis, integrated modules, and live
consulting opportunities. Students will be able to contribute to the existing knowledge for further
research and professional purposes.
2.1.6 Outline the main elements of the strategic plan to achieve the program mission and
objectives

Main Elements of Strategic Plan for CS

Strategic plan for Program BSCS defines the overall layout of the areas/elements that are
included in the program to educate students to BS level. These elements prepare students through
theory and research work. These elements are Program Contents, Program Delivery
Methodology and Program Output Evaluation. The learning outcomes of each program are
properly defined and facilitate the achievement of defined learning outcomes. Internal structure
and process exists for design and review of the curriculum e.g., program teams or knowledge
unit. Detailed outlines of the program are available and course objectives and learning outcomes
are defined in each outline. Reference and teaching material are regularly updated and revised.
2.1.6.1 Program Contents
BS program is comprised of 135 credit hours.
2.1.6.2 Program Delivery Methodology
Program delivery methodology includes lectures, presentations, tutorials, assignments, latest
research trends and research paper.
2.1.7 Program Output Evaluation
Program output is measured through regular examinations, assignments, projects, and final year
project. Faculty of program is assessed by a standardized and detailed annual evaluation report
(AER) has been formulated, which must be filled by the faculty members and moderated by the
HoD, Dean, Director and then marked by Rector, as per NCBA & E policy.
Table 1 Outcomes versus objectives

Sr # Objective Outcomes
To provide a high-quality education in Graduates should possess a strong
computer science that equips students with foundation in computer science principles,
a strong foundation in core concepts, theories, and practical skills. They should
1 theories, and practical skills necessary for a demonstrate proficiency in programming
successful career in the field. languages, data structures, algorithms,
computer architecture, databases, software
engineering, networking, and other core
areas of computer science.
2 To foster an environment that promotes Graduates should be able to analyze
effective collaboration, teamwork, and complex problems, break them down into
communication skills, recognizing the manageable components, and apply
importance of working in interdisciplinary appropriate computational techniques to
teams and effectively conveying ideas and develop effective solutions. They should
technical concepts to diverse audiences. demonstrate proficiency in problem-
solving strategies and have the ability to
think critically and creatively in solving
 computational challenges.
To cultivate analytical thinking, problem- Graduate should be capable of developing
solving abilities, and logical reasoning software systems using sound engineering
skills in students, enabling them to tackle principles and methodologies. They should
complex challenges and develop innovative understand the software development life
3 solutions using computer science cycle, requirements analysis, design,
principles. implementation, testing, and maintenance
of software solutions. They should be able
to develop reliable, scalable, and
maintainable software applications.
To instill a strong sense of ethics, integrity, Graduate should possess the skills to
and social responsibility in students, analyze and manipulate data effectively.
emphasizing the ethical considerations and They should be proficient in database
4 implications of computer science in both design, querying, and management, as well
professional and societal contexts as have an understanding of data mining,
data visualization, and data-driven
decision-making techniques.
To promote a culture of lifelong learning, Graduate should be able to work
encouraging students to stay updated with effectively in team environments and
the latest advancements in computer collaborate with others to accomplish
science, pursue continuous professional common goals. They should possess strong
5 development, and adapt to the evolving communication skills, including the ability
technology landscape throughout their to articulate technical concepts clearly and
careers concisely, present their work, and engage
in professional communication within the
field of computer science.

2.2 Main Elements of Strategic Plan for IT

Strategic plan for Program BSIT defines the overall layout of the areas/elements that are
included in the program to educate students to BS level. These elements prepare students through
theory and research work. These elements are Program Contents, Program Delivery
Methodology and Program Output Evaluation. The learning outcomes of each program are
properly defined and facilitate the achievement of defined learning outcomes. Internal structure
and process exists for design and review of the curriculum e.g., program teams or knowledge
unit. Detailed outlines of the program are available and course objectives and learning outcomes
are defined in each outline. Reference and teaching material are regularly updated and revised.
2.2.1 Program Contents
BS program is comprised of 132-135 credit hours.
2.2.2 Program Delivery Methodology
Program delivery methodology includes lectures, presentations, tutorials, assignments, latest
research trends and research paper.
2.2.3 Program Output Evaluation
Program output is measured through regular examinations, assignments, projects, and final year
project. Faculty of program is assessed by a standardized and detailed annual evaluation report
(AER) has been formulated, which must be filled by the faculty members and moderated by the
HoD, Dean, Director and then marked by Rector, as per NCBA & E policy.
Provide for each objective how it was measured, when it was measured and improvements
identified and made.
Table 2 Outcomes versus objectives

Sr # Objective Outcomes
To provide a high-quality education in Graduates should possess a strong
computer science that equips students with foundation in computer science principles,
a strong foundation in core concepts, theories, and practical skills. They should
1 theories, and practical skills necessary for a demonstrate proficiency in programming
successful career in the field. languages, data structures, algorithms,
computer architecture, databases, software
engineering, networking, and other core
areas of computer science.
To foster an environment that promotes Graduates should be able to analyze
effective collaboration, teamwork, and complex problems, break them down into
communication skills, recognizing the manageable components, and apply
importance of working in interdisciplinary appropriate computational techniques to
2 teams and effectively conveying ideas and develop effective solutions. They should
technical concepts to diverse audiences. demonstrate proficiency in problem-
solving strategies and have the ability to
think critically and creatively in solving
computational challenges.
To cultivate analytical thinking, problem- Graduate should be capable of developing
solving abilities, and logical reasoning software systems using sound engineering
skills in students, enabling them to tackle principles and methodologies. They should
complex challenges and develop innovative understand the software development life
3 solutions using computer science cycle, requirements analysis, design,
principles. implementation, testing, and maintenance
of software solutions. They should be able
to develop reliable, scalable, and
maintainable software applications.
To instill a strong sense of ethics, integrity, Graduate should possess the skills to
and social responsibility in students, analyze and manipulate data effectively.
emphasizing the ethical considerations and They should be proficient in database
4 implications of computer science in both design, querying, and management, as well
professional and societal contexts as have an understanding of data mining,
data visualization, and data-driven
decision-making techniques.
To promote a culture of lifelong learning, Graduate should be able to work
encouraging students to stay updated with effectively in team environments and
the latest advancements in computer collaborate with others to accomplish
science, pursue continuous professional common goals. They should possess strong
5 development, and adapt to the evolving communication skills, including the ability
technology landscape throughout their to articulate technical concepts clearly and
careers concisely, present their work, and engage
in professional communication within the
field of computer science.
3. University Policies
The program has a well-defined admission criterion, which include evaluation of student’s marks
at different levels and admission test results.
The admission is done twice a year, in Fall/Spring semesters.
Students who have completed the 12 years with 50% marks in the Masters 12 years education are
eligible to appear in the admission test of the program. Admission is granted strictly on the basis
of academic record and admission test.
Students from accredited universities are eligible to transfer their credits to NCBA&E
Bahawalpur Campus. Students have to submit complete course curriculum and internal
evaluation certificate of each subject from his/her previous institution duly signed by Dean/Head
of Department/Principal. Student’s applications in this regard are dealt on case-to-case basis.
Prescribed admission forms are available from the office of the student affairs. Online
application form may also be downloaded from the university website www.ncbae.edu.pk.
Applications are received after the appearance of advertisement in the national press.

3.1 Entrance Examination

Entry test is held at NCBA & E. No admission will be given without entry test.

3.1.1 Selection Procedure

Matric 10%
F.Sc. 40%
Admission Test 50%

3.1.2 Documents Submitted After Admission

A candidate, who is eligible for admission, must submit attested copies of the following
documents along with the application form and the Deposit slip:
 SSC or equivalent foreign qualification certificate
 HSSC or an equivalent foreign qualification certificate
 Bachelor degree
 Master’s degree
 National Identity Card of the candidate
 National Identity Card of Father/Guardian
 Recent photographs of the applicant

3.2 Monitoring of students’ progress

 After the completion of the admission process, the student's name is forwarded to the
registration office for enrollment in the specific program, and a registration number is
assigned. The registration procedure outlined below is strictly adhered to at the beginning
of each semester:
 The admitted student will be registered at NCBA&E Bahawalpur Campus.
 Students who meet all the requirements are included in the merit list.
 The merit list is displayed on the university's main notice board, and students are
informed through telephone calls during the week.
  Once admission is secured and registration is completed, students are notified of their
class schedule. The dates for classes are announced on the notice board.
 Students who have not registered as mentioned above will not be permitted to attend
classes.
 A student is allowed to enroll for a maximum of 18 credit hours in a semester.
 No registration or changes to courses will be permitted after three weeks from the start of
the semester.
 Students are evaluated through assignments, sessional assessments, mid-term
examinations, and final examinations at the end of each semester.
 Only qualified students from each semester are eligible to progress to the next semester.

3.3 Delivery of course material

 To ensure effective teaching and delivery of course material that emphasizes active
learning and achieves course learning outcomes, the following process and procedures
are implemented:
 Course Design: The Course is carefully designed to align with the course learning
outcomes. The content, structure, and sequencing of topics are determined to promote
active learning and engagement among students.
 Student-Centered Teaching Methods: Teaching methods that foster active learning are
employed, such as discussions, group activities, case studies, problem-solving exercises,
and hands-on experiments. These methods encourage students to actively participate,
think critically, and apply concepts.
 Use of Technology and Resources: Technology tools and resources are integrated into
the teaching process to enhance student engagement and facilitate, include multimedia
presentations
 Assessment Strategies: Assessment methods are designed to evaluate student
understanding and achievement of course learning outcomes. These may include quizzes,
assignments, projects, presentations, and examinations. The assessments are aligned with
the active learning approach and promote higher-order thinking skills.
 Feedback and Reflection: Regular feedback is provided to students to guide their
learning and improve their performance. This can be in the form of individual feedback
on assignments, class discussions, and constructive feedback during group activities.
Opportunities for self-reflection are also encouraged, allowing students to evaluate their
own progress and identify areas for improvement.
 Continuous Evaluation: The process and procedures used for teaching and delivery of
course material are periodically evaluated to assess their effectiveness in meeting the
learning objectives. This evaluation may involve student feedback surveys, classroom
observations, peer evaluations, and analysis of student performance data.
 Process Improvement: The evaluation results are carefully analyzed and used to identify
areas of improvement. Based on the findings, adjustments and enhancements are made to
the teaching methods, course content, and assessment strategies. This ensures that the
process remains dynamic and responsive to the evolving needs of students.
3.4 Teaching and Learning Methods
Teaching and learning methods:
Lectures, written assignments ,practical lab ,presentations

Course Policies:
As most of the students are not familiar with online learning system you need to make and
convey your policy guidelines of the followings;

 Attendance policy ( Minimum 70% attendance is must )

 Submission of assignment ( Submission of assignments will be on time late
submission will less your marks)
 Extra credit (make-up class can be taken if syllabus is not covered in the pre mention
hours)
 Deadline extensions ( Deadline extensions can be made in assignments and
presentation in case student suffer from serious emergency )
 Reporting illness
 Cheating and plagiarism
 Expected classroom behaviors

Learning hours
Activity Hours allocated

Online contact 35
Individual study 25
Directed reading 20
Assignments 30
Total hours 110

Assignments:
Questions/Assignments/Tasks for Assessment

NO. Assessment activity Length Marks

required Allocated
Formative assessment

F-1 Tutor assessment of individual student through 10

active participation in discussion, questioning,
reflection on others’ questions, raising questions,
Argumentation etc.
F-2 Presentation(one before and one after midterm) 500-5000 5x2=10
words
F-3 Long assignments to individual and groups 500-1000 10
words
Summative Assessment

S-1 Quiz & surprise test (1 before & 1 after mid-term) 10

S-2 Mid-term 25
 It can be in traditional form such as Objective
questions, Short answer questions & Open-ended
question.
S-3 Final Term 35
It can also be in the form of long assignments
Total 100

4. Semester wised course planning

4.1 Program: BS Artificial Intelligence
Total Courses 40-45 Duration 4 Years
Total Credit Hours 135 Total semesters 8
Semester duration 16-18 Weeks Course Load Per Semester 15-18 Credit Hours
Compulsory 30 Major 75
Minor 12 Allied 12
Project 6

Course Credit
Sr# Title of Course Domain
Code Hours
Semester-1
1 Islamic Studies 02
2 Arts and Humanities 02
3 Natural Sciences 03 (2+1)
4 Ideology and Constitution of Pakistan 02
5 Programming Fundamental 04(3+1)
6 Discrete Structure 3
Semester-2
1 Civics and Community Engagement 02
2 Applications of Information and Communication Technologies (ICT) 03 (2+1)
3 English 03
4 Social Sciences 02
5 Calculus & Analytical Geometry Allied 03
6 Object Oriented Programming 04 (3+1)
Semester-3
1 Quantitative Reasoning-1 03
2 Expository Writing 03
3 Database Systems 04 (3+1)
4 Data Structures & Algorithms 04 (3+1)
5 Speech Processing 3
Semester-4
1 Quantitative Reasoning-1 03
2 Expository Writing 02
3 Artificial Intelligence 04 (3+1)
4 Computing Vision 03(2+1)
5 Minor 1 03
6 Allied 2 3
Semester-5
1 Programming for Artificial Intelligence 03 (2+1)
2 Digital Logic Design 04 (3+1)
3 Computer Networks 04 (3+1)
4 Computer Organization & Assembly Language 04 (3+1)
5 Information Security 03(2+1)
Semester-6
1 Allied 3 03
2 Operating Systems 04 (3+1)
3 Artificial Neural Networks 04 (3+1)
4 Natural Language Processing 03 (2+1)
5 Analysis of Algorithms 03
Semester-7
1 Machine Learning 03 (2+1)
2 Minor 2 03
3 Allied 4 03
4 Minor 3 03
5 Knowledge representation and reasoning 03
 6 Final Year Project-I 03 (0+3)
Semester-8
1 Software Engineering 03
2 Minor 4 03 (2+1)
3 Reinforcements Learning 03
4 Fuzzy System 03
5 Final Year Project-II 03 (0+3)

4.1.1 List of Major Courses

Sr. Code Pre-Reqs, Course Name Credit hours

1 Programming Fundamentals 04(3+1)
2 Discrete Structure 3
3 Programming Fund. Object Oriented Programming 04 (3+1)
4 Database Systems 04 (3+1)
5 OOP Data Structures & Algorithms 04 (3+1)
6 Speech Processing 3
7 Artificial Intelligence 04 (3+1)
8 Computing Vision 03(2+1)
9 Computer Application 03
10 Programming for Artificial Intelligence 03 (2+1)
11 Digital Logic Design 04 (3+1)
12 Computer Networks 04 (3+1)
13 DLD Computer Organization & Assembly Language 04 (3+1)
14 Information Security 03(2+!)
15 Operating Systems 04 (3+1)
16 Artificial Neural Networks 04 (3+1)
17 Natural Language Processing 03 (2+1)
18 DS Analysis of Algorithms 03
19 Machine Learning 03 (2+1)
20 Theory of Automata & Formal Languages 03
21 Reinforcements Learning 03
22 Fuzzy System 03

4.1.2 List of Minor

Sr. Minor Courses Credit Hours
Digital Forensics 3
Information Assurance 3
1 Cyber Security
Network Security 3
Malware Analysis 3
Introduction to Data Science 3
Big Data Analytics 3
2 Data Science
Text Mining 3
Data Visualization 3
Software Design & Architecture 3
Software Construction 3
3 Software Engineering
Formal Methods in SE 3
Software Re-Engineering 3

4.1.3 List of Allied Subject

Sr. Allied Subjects Course Name Credit hours
Business Mathematics 3
Calculus & Analytical Geometry 3
Numerical Analysis 3
Operational Research 3
1 (Mathematics)
Linear Algebra 3
Mathematical Method 3
Graph Theory 3
Optimization Theory 3
Introduction to Management 3
Financial Management 3
Economics 3
Quality Management 3
2
(Management Science) Entrepreneurship and SMEs Management 3
Ecommerce 3
Introduction to Statistics 3
Professional Practices 3
Functional English 3
Communication Skills 3
Technical Writing Skill 3
3
(English) Writing and Presentation Skill 3
Business Communication 3
Report Writing 3

4.2 Program: BS Computer Science

Total Courses 40-45 Duration 4 Years
Total Credit Hours 135-144 Total semesters 8
Semester duration 16-18 Weeks Course Load Per Semester 15-18 Credit Hours
Compulsory 30 Major Cr. Hrs 75
Minor 12 Allied Cr. Hrs 12
Project 6

Course Credit
Sr# Title of Course Domain
Code Hours
Semester-1
1 Islamic Studies 02
2 Arts and Humanities 02
3 Natural Sciences 03 (2+1)
4 Ideology and Constitution of Pakistan 02
5 Programming Fundamental 04(3+1)
6 Calculus and Analytical Geometry 3
Semester-2
1 Civics and Community Engagement 02
2 Applications of Information and Communication Technologies (ICT) 03 (2+1)
3 English 03
4 Social Sciences 02
5 Object Oriented Programming 04(2+2)
6 Data Structure and Algorithm 04(3+1)
Semester-3
1 Quantitative Reasoning-1 03
2 Expository Writing 03
3 Database System 03 (2+1)
4 Human Computer Interaction 03
5 Digital Logical Design 03 (2+1)
6 Software Engineering 03
Semester-4
1 Quantitative Reasoning-1 03
2 Expository Writing 02
3 Database System 04(3+1)
4 Human Computer Interaction 04(3+1)
5 Digital Logical Design 04 (3+1)
6 Software Engineering 03
Semester-5
1 Allied 2 03
2 Artificial Intelligent 04(3+1)
3 Web Engineering 04(3+1)
4 Minor 1 03
5 Theory of Automata 03
Semester-6
1 Design and Analysis of Algorithm 03 (2+1)
2 Compiler Construction 03
3 Allied 3 03
4 Visual Programming 03 (2+1)
5 Mobile Application Development 03 (2+1)
Semester-7
1 Software Project Management 03
2 Minor 3 03
3 Computer Graphics 03 (2+1)
4 Allied 4 03
5 Data Mining 03
6 Project-I 03
 Semester-8
1 Machine Learning 03
2 Minor 4 03
3 Cloud Computing 03
4 Information Security 03
5 Project-II 03

4.2.1 List of Major Courses in Computer Science

Credit
Sr. Code Pre-Reqs Course Name
hours
1 Programming Fundamental 04(3+1)
2 Programming Fundamental Object Oriented Programming 04(2+2)
3 Object Oriented Programming Data Structure and Algorithm 04(3+1)
4 Database System 03 (2+1)
5 Operating System 03 (2+1)
6 Digital Logical Design 03 (2+1)
7 Software Engineering 03
8 Digital Logical Design Computer Organization and Assembly 04(3+1)
9 Computer Network 04(3+1)
10 Human Computer Interaction 03
11 Artificial Intelligent 04(3+1)
12 Web Engineering 04(3+1)
13 Cyber Security 03
14 Theory of Automata 03
15 Data Structure and Algorithm Design and Analysis of Algorithm 03 (2+1)
16 Compiler Construction 03
17 Visual Programming 03 (2+1)
18 Mobile Application Development 03 (2+1)
19 Software Project Management 3
20 Cryptography 3
21 Computer Graphics 3
22 Data Mining 3

4.2.2 List of Minor/ Elective

Sr. Minor Courses Credit Hours
Artificial Neural Network 3
Natural Language Processing 3
1 Artificial Intelligence
Reinforcement Learning 3
Deep Learning 3
Digital Forensics 3
Information Assurance 3
2 Cyber Security
Network Security 3
Malware Analysis 3
Introduction to Data Science 3
Big Data Analytics 3
3 Data Science
Text Mining 3
Data Visualization 3
4 Software Engineering Software Design & Architecture 3
Software Construction 3
Formal Methods in SE 3
 Software Re-Engineering 3

4.2.3 List of Allied Subjects

Sr. Allied Subjects Course Name Credit hours
Business Mathematics 3
Calculus & Analytical Geometry 3
Numerical Analysis 3
Operational Research 3
1 (Mathematics)
Linear Algebra 3
Mathematical Method 3
Graph Theory 3
Optimization Theory 3
Introduction to Management 3
Financial Management 3
Economics 3
Quality Management 3
2
(Management Science) Entrepreneurship and SMEs Management 3
Ecommerce 3
Introduction to Statistics 3
Professional Practices 3
Functional English 3
Communication Skills 3
Technical Writing Skill 3
3
(English) Writing and Presentation Skill 3
Business Communication 3
Report Writing 3

4.3 Program: BS Cyber Security

Total Courses 40-45 Duration 4 Years
Total Credit Hours 135 Total semesters 8
Semester duration 16-18 Weeks Course Load Per Semester 15-18 Credit Hours
Compulsory 30 Major 75
Minor 12 Allied 12
Project 6

Course Credit
Sr# Title of Course Domain
Code Hours
Semester-1
1 Islamic Studies 02
2 Arts and Humanities 02
3 Natural Sciences 03 (2+1)
4 Ideology and Constitution of Pakistan 02
5 Programming Fundamental 04(3+1)
6 Discrete Structure 3
Semester-2
1 Civics and Community Engagement 02
2 Applications of Information and Communication Technologies (ICT) 03 (2+1)
3 English 03
4 Social Sciences 02
5 Object Oriented Programming 04(2+2)
6 Calculus & Analytical Geometry (Allied 1) 3
Semester-3
1 Quantitative Reasoning-1 03
2 Expository Writing 03
3 Database Systems 04 (3+1)
4 Data Structures & Algorithms 04 (3+1)
5 Compiler Construction 3
Semester-4
1 Quantitative Reasoning-1 03
2 Expository Writing 02
3 Information Security 03
4 Introduction to Cyber Security 03 (2+1)
5 Cyber Law & Cyber Crime (Cyber Warfare) 03
6 Allied 2 3
Semester-5
1 Artificial Intelligence Min 04 (3+1)
2 Digital Logic Design 04 (3+1)
3 Computer Networks 04 (3+1)
4 Computer Organization & Assembly Language 04 (3+1)
Semester-6
1 Allied 3 03
2 Operating Systems 04 (3+1)
3 Digital Forensics 03 (2+1)
4 Information Assurance 03
5 Analysis of Algorithms 03
6 Minor 2 3
Semester-7
1 Minor 3 03
2 Secure Software Design and Development 03
3 Vulnerability Assessment & Reverse Engineering 03
4 Network Security 03
5 Allied 4 03
6 Final Year Project-I 03
 Semester-8
1 Wireless and Mobile Security 03
2 Minor 4 03
3 Malware Analysis 03
4 Cryptography 03
5 Final Year Project-II 03

4.3.1 List of Major Courses

Sr. Code Pre-Reqs Course Name Credit hours
1 Programming Fundamentals 04(3+1)
2 Discrete Structure 03
3 Programming Funda. Object Oriented Programming 04 (3+1)
4 Database Systems 04 (3+1)
5 OOP Data Structures & Algorithms 04 (3+1)
6 Compiler Construction 03
7 Information Security 03
8 Introduction to Cyber Security 03 (2+1)
9 Cyber Law & Cyber Crime (Cyber Warfare) 03
10 Artificial Intelligence 04 (3+1)
11 Digital Logic Design 04 (3+1)
12 Computer Networks 04 (3+1)
13 Digital Logic Design Computer Organization & Assembly Language 04 (3+1)
14 Operating Systems 04 (3+1)
15 Digital Forensics 03 (2+1)
16 Information Assurance 03
17 DS Analysis of Algorithms 03
18 Human Computer Interaction 03
19 Theory of Automata 03
20 Secure Software Design and Development 03
21 Vulnerability Assessment & Reverse Engineering 03

4.3.2 List of Minor Subject

Sr. Minor Courses Credit Hours
Artificial Neural Network 3
Natural Language Processing 3
1 Artificial Intelligence
Reinforcement Learning 3
Deep Learning 3
Introduction to Data Science 3
Big Data Analytics 3
2 Data Science
Text Mining 3
Data Visualization 3
Software Design & Architecture 3
Software Construction 3
3 Software Engineering
Formal Methods in SE 3
Software Re-Engineering 3

4.3.3 List of Allied Subjects

Sr. Allied Subjects Course Name Credit hours
 Business Mathematics 3
Calculus & Analytical Geometry 3
Numerical Analysis 3
Operational Research 3
1 (Mathematics)
Linear Algebra 3
Mathematical Method 3
Graph Theory 3
Optimization Theory 3
Introduction to Management 3
Financial Management 3
Economics 3
Quality Management 3
2
(Management Science) Entrepreneurship and SMEs Management 3
Ecommerce 3
Introduction to Statistics 3
Professional Practices 3
Functional English 3
Communication Skills 3
Technical Writing Skill 3
3
(English) Writing and Presentation Skill 3
Business Communication 3
Report Writing 3

4.4 Program: BS Data Science

Total Courses 40-45 Duration 4 Years
Total Credit Hours 137 Total semesters 8
Semester duration 16-18 Weeks Course Load Per Semester 15-18 Credit Hours
Compulsory 30 Major 75
Minor 12 Allied 12
Project 6

Course Credit
Sr# Title of Course Domain
Code Hours
Semester-1
1 Islamic Studies 02
2 Arts and Humanities 02
3 Natural Sciences 03 (2+1)
4 Ideology and Constitution of Pakistan 02
5 Programming Fundamental 04(3+1)
6 Discrete Structure 3
Semester-2
1 Civics and Community Engagement 02
2 Applications of Information and Communication Technologies (ICT) 03 (2+1)
3 English 03
4 Social Sciences 02
5 Object Oriented Programming 04(2+2)
6 Calculus & Analytical Geometry (Allied 1) 3
Semester-3
1 Quantitative Reasoning-1 03
2 Expository Writing 03
3 Database Systems 04 (3+1)
4 Data Structures & Algorithms 04 (3+1)
5 Compiler Construction 3
Semester-4
1 Quantitative Reasoning-1 03
2 Expository Writing 02
3 Information Security 03
4 Introduction to Data Science 03
5 Data Mining 03 (2+1)
6 Allied 2 3
Semester-5
1 Artificial Intelligence 04 (3+1)
2 Digital Logic Design 04 (3+1)
3 Computer Networks 04 (3+1)
4 Computer Organization & Assembly Language 04 (3+1)
Semester-6
1 Minor 1 03
2 Operating Systems 04 (3+1)
3 Allied 3 03
4 Data Visualization 03
5 Analysis of Algorithms 03
6 Human Computer Interaction 3
Semester-7
1 Data Warehousing & Business Intelligence 03
2 Big Data Analytics 03
3 Minor 2 03
4 Allied 4 03
 5 Minor 3 03
6 Final Year Project-I 03
Semester-8
1 Software Engineering 03
2 Minor 4 03
3 Topics in Data Science 03
4 Theory of Automata 03
5 Final Year Project-II 03

4.4.1 List of Major Courses

Sr. Code Pre-Reqs Course Name Credit hours
1 Programming Fundamental 04(3+1)
2 Discrete Structure 3
3 Programming Fundam. Object Oriented Programming 04 (3+1)
4 OOP Data Structures & Algorithms 04 (3+1)
5 Database Systems 3
6 Information Security 03
7 Introduction to Data Science 03
8 Data Mining 03 (2+1)
9 Artificial Intelligence 3
10 Digital Logic Design 04 (3+1)
11 Computer Networks 04 (3+1)
12 Digital Logic Design Computer Organization & Assembly Language 04 (3+1)
13 Data Visualization 03
14 DS Analysis of Algorithms 03
15 Human Computer Interaction 3
16 Data Warehousing & Business Intelligence 03
17 Big Data Analytics 03
18 Machine Learning 03
19 Operating System 04 (3 + 1)
20 Software Project Management 03
21 Text Mining 03
22 Topics in Data Science 03

4.4.2 List of Minor Courses

Sr. Minor Courses Credit Hours
Artificial Neural Network 3
Natural Language Processing 3
1 Artificial Intelligence
Reinforcement Learning 3
Deep Learning 3
Digital Forensics 3
Information Assurance 3
2 Cyber Security
Network Security 3
Malware Analysis 3
Software Design & Architecture 3
Software Construction 3
3 Software Engineering
Formal Methods in SE 3
Software Re-Engineering 3
4.4.3 List of Allied Subjects
 Sr. Allied Subjects Course Name Credit hours
Business Mathematics 3
Discrete Mathematics 3
Numerical Analysis 3
Operational Research 3
1 (Mathematics)
Linear Algebra 3
Mathematical Method 3
Graph Theory 3
Optimization Theory 3
Introduction to Management 3
Financial Management 3
Economics 3
Quality Management 3
2
(Management Science) Entrepreneurship and SMEs Management 3
Ecommerce 3
Introduction to Statistics 3
Professional Practices 3
Functional English 3
Communication Skills 3
Technical Writing Skill 3
3
(English) Writing and Presentation Skill 3
Business Communication 3
Report Writing 3

4.5 Program: BS Information Technology

Total Courses 40-45 Duration 4 Years
Total Credit Hours 136-145 Total semesters 8
Semester duration 16-18 Weeks Course Load Per Semester 15-18 Credit Hours
Compulsory 30 Major 75
Minor 12 Allied 12
Project 6

Course Credit
Sr# Title of Course Domain
Code Hours
Semester-1
1 Islamic Studies 02
2 Arts and Humanities 02
3 Natural Sciences 03 (2+1)
4 Ideology and Constitution of Pakistan 02
5 Programming Fundamental 04(3+1)
6 Calculus and Analytical Geometry Allied 3
Semester-2
1 Civics and Community Engagement 02
2 Applications of Information and Communication Technologies (ICT) 03 (2+1)
3 English 03
4 Social Sciences 02
5 Object Oriented Programming 04(2+2)
6 Data Structure and Algorithm 04(2+2)
Semester-3
1 Quantitative Reasoning-1 03
2 Expository Writing 03
3 Database System 03
4 Operating System 03
5 Digital Logical Design 03
6 Web Technologies 03
Semester-4
1 Quantitative Reasoning-1 03
2 Expository Writing 02
3 Computer Organization and Assembly 04(3+1)
4 Computer Network 04(3+1)
5 Human Computer Interaction 03
Semester-5
1 System Network Administration 04(3+1)
2 Virtual System and Services 04(3+1)
3 Allied 2 03
4 Database Administration and Management 04(3+1)
5 Theory of Automata 3
Semester-6
1 Design and Analysis of Algorithm 03
2 Minor 1 03
3 Minor 2 03
4 Information Technologies Infrastructure 03
5 Multimedia Systems 03
6 Data Mining 03
Semester-7
1 Software Project Management 03
2 Minor 3 03
3 Modeling and Simulation 03
 4 Allied 3 03
5 Software Requirement Engineering 03
6 Project-I 03
Semester-8
1 Enterprise System 03
2 Allied 4 03
3 IT-Project Management 03
4 Minor 4 03
5 Project-II 03

4.5.1 List of Major Courses

Sr. Code Pre-Reqs. Course Name Credit hours
1 Programming Fundamental 04(3+1)
2 Programming Fundamental Object Oriented Programming 04(3+1)
3 Object Oriented Programming Data Structure and Algorithm 04(3+1)
4 Database System 03
5 Operating System 03
6 Digital Logical Design 03
7 Web Technologies 03
8 Digital Logical Design Computer Organization and Assembly 04(3+1)
9 Computer Network 04(3+1)
10 Human Computer Interaction 03
11 System Network Administration 04(3+1)
12 Virtual System and Services 04(3+1)
13 Software Requirement Engineering 03
14 Database Administration and Management 04(3+1)
15 Theory of Automata 3
16 Software Project Management 03
17 Machine Learning 03
18 Modeling and Simulation 03
19 Enterprise System 03
20 Telecommunication 03
21 IT-Project Management 03
22 Information Security 03

4.5.2 List of Specializations Courses

Sr. Minor Courses Credit Hours
Artificial Neural Network 3
Natural Language Processing 3
1 Artificial Intelligence
Reinforcement Learning 3
Deep Learning 3
Digital Forensics 3
Information Assurance 3
2 Cyber Security
Network Security 3
Malware Analysis 3
Introduction to Data Science 3
Big Data Analytics 3
3 Data Science
Text Mining 3
Data Visualization 3
4 Software Engineering Software Design & Architecture 3
 Software Construction 3
Formal Methods in SE 3
Software Re-Engineering 3

4.5.3 List of Minor Courses

Sr. Minor Subjects Course Name Credit hours
Business Mathematics 3
Discrete Mathematics 3
Numerical Analysis 3
Operational Research 3
1 (Mathematics)
Linear Algebra 3
Mathematical Method 3
Graph Theory 3
Optimization Theory 3
Introduction to Management 3
Financial Management 3
Economics 3
Quality Management 3
2
(Management Science) Entrepreneurship and SMEs Management 3
Ecommerce 3
Introduction to Statistics 3
Professional Practices 3
Functional English 3
Communication Skills 3
Technical Writing Skill 3
3
(English) Writing and Presentation Skill 3
Business Communication 3
Report Writing 3

4.6 Program: BS Software Engineering

Total Courses 40-45 Duration 4 Years
Total Credit Hours 135 Total semesters 8
Semester duration 16-18 Weeks Course Load Per Semester 15-18 Credit Hours
Compulsory 30 Major 75
Minor 12 Allied 12
Project 6

Course Credit
Sr# Title of Course Domain
Code Hours
Semester-1
1 Islamic Studies 02
2 Arts and Humanities 02
3 Natural Sciences 03 (2+1)
4 Ideology and Constitution of Pakistan 02
5 Programming Fundamental 04(3+1)
6 Discrete Structures 3
Semester-2
1 Civics and Community Engagement 02
2 Applications of Information and Communication Technologies (ICT) 03 (2+1)
3 English 03
4 Social Sciences 02
5 Object Oriented Programming 04(2+2)
6 Calculus & Analytical Geometry Allied 3
Semester-3
1 Quantitative Reasoning-1 03
2 Expository Writing 03
3 Database Systems 04 (3+1)
4 Data Structures & Algorithms 04 (3+1)
5 Compiler Construction 3
Semester-4
1 Quantitative Reasoning-1 03
2 Expository Writing 02
3 Design and Analysis of Algorithm 03
4 Software Engineering 03
5 Computer Networks 04 (3+1)
6 Information Security 3
Semester-5
1 Software Requirements Engineering 03
2 Simulation and Modeling 03
3 Minor 1 03
4 Business Process Engineering 03
5 Formal Methods in Software Engineering 03
6 Human Resource Management 03
Semester-6
1 Software Design & Architecture 03 (2+1)
2 Operating Systems 04 (3+1)
3 Minor 2 03
4 Allied 2 03
5 Web Engineering 03
6 Human Computer Interaction 03
Semester-7
1 Software Construction & Development 03 (2+1)
2 Formal Methods in Software Engineering 03 (2+1)
 3 Minor 3 03
4 Allied 3 03
5 Allied 4 03
6 Final Year Project-I 03 (0+3)
Semester-8
1 Minor 4 03
2 Business Process Engineering 03
3 Stochastic Processes 03
4 Final Year Project-II 03 (0+3)

4.6.1 List of Major Courses

Sr. Code Pre-Reqs. Course Name Credit hours
1 Programming Fundamental 04(3+1)
2 Discrete Structures 3
3 Programming Fundamen. Object Oriented Programming 04 (3+1)
4 Database Systems 04 (3+1)
5 Data Structures & Algorithms 04 (3+1)
6 Compiler Construction 3
7 OOP Design and Analysis of Algorithm 03
8 Software Engineering 03
9 Computer Networks 04 (3+1)
10 Information Security 3
11 Software Requirements Engineering 03
12 Simulation and Modeling 03
13 Data Mining 03
14 Business Process Engineering 03
15 Formal Methods in Software Engineering 03
16 Software Design & Architecture 03 (2+1)
17 Operating Systems 04 (3+1)
18 Web Engineering 03
19 Human Computer Interaction 3
20 Software Construction & Development 03 (2+1)
21 Formal Methods in Software Engineering 03 (2+1)
22 Data Science 03

4.6.2 List of Minor Subjects

Sr. Minor Courses Credit Hours
Artificial Neural Network 3
Natural Language Processing 3
1 Artificial Intelligence
Reinforcement Learning 3
Deep Learning 3
Digital Forensics 3
Information Assurance 3
2 Cyber Security
Network Security 3
Malware Analysis 3
Introduction to Data Science 3
Big Data Analytics 3
3 Data Science
Text Mining 3
Data Visualization 3
4.6.3 List of Allied Subjects
Sr. Allied Subjects Course Name Credit hours
Business Mathematics 3
Discrete Mathematics 3
Numerical Analysis 3
Operational Research 3
1 (Mathematics)
Linear Algebra 3
Mathematical Method 3
Graph Theory 3
Optimization Theory 3
Introduction to Management 3
Financial Management 3
Economics 3
Quality Management 3
2
(Management Science) Entrepreneurship and SMEs Management 3
Ecommerce 3
Introduction to Statistics 3
Professional Practices 3
Functional English 3
Communication Skills 3
Technical Writing Skill 3
3
(English) Writing and Presentation Skill 3
Business Communication 3
Report Writing 3

4.7 Program: BS Computer Science 5 Semester

Total Courses 22-25 Duration 2 Years
 Total Credit Hours 60-72 Total semesters 4
Semester duration 16-18 Weeks Course Load Per Semester 15-18 Credit Hours
Allied Cr. Hrs 12 Major Cr. Hrs 42
Minor 12 Project 6

Course Credit
Sr# Title of Course Domain
Code Hours
Zero Semester
1 Calculus-I 03
2 Object Oriented Programming 03
3 Programming Fundamental 03
4 Data Structure and Algorithm 03
5 Software Engineering 03
6 Operating System 03
Semester-5
1 Digital Logic Design 03
2 Database System 03
3 Multimedia Systems 04(3+1)
4 Programming & Problem Solving 04(3+1)
5 Computer Network & Communication 04(3+1)
Semester-6
1 Design and Analysis of Algorithm 03
2 Compiler Construction 03
3 Theory of Automata 03
4 Visual Programming 03
5 Allied 1 03
6 Distributed System 03
Semester-7
1 Software Project Management 03
2 Cryptography 03
3 Allied 2 03
4 Allied 3 03
5 Minor 1 03
6 Minor 2 03
Semester-8
1 Minor 3 03
2 Human Computer Interaction 03
3 Minor 4 03
4 Allied 4 03
5 Project 06

4.7.1 List of Major Courses

Sr. Code Pre-Reqs. Course Name Credit hours
1 Digital Logic Design 03
2 Database System 03
3 Multimedia Systems 04(3+1)
4 Programming & Problem Solving 04(3+1)
5 Computer Network & Communication 04(3+1)
6 Design and Analysis of Algorithm 03
7 Compiler Construction 03
8 Theory of Automata 03
 9 Visual Programming 03
10 Distributed System 03
11 Software Project Management 03
12 Cryptography 03
13 Computer Graphics 03
14 Web Engineering 03
15 Machine Learning 03
16 Human Computer Interaction 03
17 Cloud Computing 03

4.7.2 List of Specializations

Sr. Course Name Credit hours
1 Data Mining 3
2 Information Security 3
3 Machine Learning 3
4 Cloud Computing 3
5 Visual Programming 3
6 Mobile Application Development 3
7 Software Project Management 3
8 Human Computer Interaction 3
9 Cryptography 3

4.7.3 List of Minor Courses

Sr. Minor Subjects Course Name Credit hours
Business Mathematics 3
Calculus & Analytical Geometry 3
Numerical Analysis 3
Operational Research 3
1 (Mathematics)
Linear Algebra 3
Mathematical Method 3
Graph Theory 3
Optimization Theory 3
Introduction to Management 3
Financial Management 3
Economics 3
Quality Management 3
2
(Management Science) Entrepreneurship and SMEs Management 3
Ecommerce 3
Introduction to Statistics 3
Professional Practices 3
Functional English 3
Communication Skills 3
Technical Writing Skill 3
3
(English) Writing and Presentation Skill 3
Business Communication 3
Report Writing 3

4.8 Program: MPhil Computer Science

 Total Courses 9-11 Duration 2 Years
Total Credit Hours 31 Total semesters 4
Semester duration 16-18 Weeks Course Load Per Semester 9 Credit Hours

Course Credit
Sr# Title of Course Domain
Code Hours
Semester-1
1 Adv. Operating Systems Major 03
2 Adv. Research Methodology Major 03
3 Adv. Network Security Elective 03
Semester-2
1 Advanced Analysis of Algorithms Major 03
2 Research Workshop Major 01
3 Adv. Computer Architecture Major 03
Semester-3
1 Adv. Data Mining Elective 03
2 Cloud Computing Elective 03
3 Adv. Theory of Automata Major 03
Semester-4 (Course Work)
1 Theory of Programming Language Elective 03
2 Project 03
Semester-4 (Research Work)
1 Thesis 06

4.8.1 List of Elective Courses

Sr. Course Name Credit hours

1 Theory of Programming Language 3
2 Cloud Computing 3
3 Adv. Data Mining 3
4 Adv. Network Security 3

4.8.2 List areas of Specializations

Sr. Area of Specializations Course Name Credit hours

Advance Cryptography 3
Cyber Intelligence 3
1 Information Security
Digital forensic and incident response 3
Network Security 3
Swarm Intelligence 3
Artificial Neural Network 3
2 Artificial Intelligence
Fuzzy System 3
Deep Learning 3
Bioinformatics 3
Natural Language Processing 3
3 Data Science
Deep Reinforcement Learning 3
Adv. Computer Vision 3
Reliability Engineering 3
Complex Network 3
4 Software Engineering
Software Quality Assurance 3
Agent Based Modeling 3
4.8.3 List of Deficiency Subjects

Sr. Course Name Pre-Reqs Credit hours

1 Theory of Automata 3
2 Analysis of Algorithm DS 3
3 Programming Fundamental 3
4 Operating System 3
5 Computer Organization & Assembly Language DLD 3

5. Courses discussion Workflow

5.1 ADP Programs
Associate Degree (AD) Computing program is a two years degree which covers important aspect
of the computing discipline. The duration of the Associate Degree is two years with an option to
upgrade it to a full-fledged bachelor’s degree program. Important features of the AD programs
are as follows;
 Associate Degree Computing comprises of 04 semesters / 02 years duration. AD
Computing may only be offered under semester system.
 Semester duration is 18 weeks, including two weeks for examinations and results
 The minimum credits for award of Associate Degree Computing is 72 Credit Hours.
 Normal load per semester will be five to six courses and maximum up to 8 courses under
special circumstances as per the university/DAI rules and regulations.
 Courses will be described through Credit Hours (CrHr) system.
 1 (one) Theory CrHr is equivalent to 1 (one) contact hour per week in a normal semester
of 15/16 weeks teaching so a 3 CrHr course means 45 contact hours for the whole
semester.
 1 Lab CrHr is equivalent to 3 contact hours per week for 15/16 weeks
 Summer/Wintersemester of shorter can also be offered (if required), however,
Summer/winter semester is mainly offered to cover deficiency courses.
5.1.1 Eligibility Criteria for AD Computing
 Minimum 50% marks in Intermediate/12 years schooling/A- Level (HSSC) or Equivalent
with Mathematics are required for admission in Associate Degree Computing.
*Equivalency certificate by IBCC will be required in case of education from some other
country or system.
 The students who have not studied Mathematics at intermediate level have to pass
deficiency courses of Mathematics (06 credits) in first two semesters.
 A minimum 2.0 CGPA (Cumulative Grade Point Average) on a scale of 4.0 is required
for award of AD Computing degree.
 The candidates with AD Computing Degrees are eligible for admission in 5th Semester
of BS Computing Programs. Such students shall complete the deficiency courses of
General Education (if any) during 5th to 8th Semester.
 The candidates who acquired ADP Computing Degrees prior to the admission criteria (as
stated above) are also eligible for admission in 5th Semester of BS Computing Programs.
Such students shall complete the deficiency courses of General Education (if any) during
5th to 8th Semester.
5.2 BS Computer Science
5.3 BS Information Technology
5.4 M.Phil Computer Science
6. Future scope of Subjects

The future scope of computer science is vast and promising, as technology continues to advance
and permeate every aspect of our lives. Here are some key areas where the subjects play a crucial
role in the future:
Sr.# Subject Name Future Scope
1 Programing Fundamental Artificial Intelligence (AI) and Machine Learning
(ML):
 Programming is at the core of AI and ML
development. As these fields evolve, there
will be an increasing demand for
programmers who understand the
fundamentals of algorithms, data structures,
and logic to create intelligent systems.
Internet of Things (IoT):
 As the number of connected devices
continues to rise, the ability to program these
devices becomes crucial. Understanding
programming fundamentals allows developers
to create applications that communicate with
and control IoT devices.
Cybersecurity:
 With the increasing frequency and complexity
of cyber threats, the need for skilled
programmers in cybersecurity is on the rise.
Programming fundamentals are essential for
creating secure software, detecting
vulnerabilities, and implementing effective
security measures.
Quantum Computing:
 As quantum computing advances, there will
be a growing demand for programmers who
can work with quantum languages and
algorithms. Understanding the principles of
programming will be crucial for harnessing
the power of quantum computers.
2 Introduction to Computer and Emerging Technologies Awareness:
Technologies  The subject introduces students to emerging
technologies such as artificial intelligence,
blockchain, augmented reality, and more.
This awareness is crucial for individuals to
adapt to technological advancements and
explore career opportunities in these fields.
Ethics in Technology:
 The ethical implications of technology are
 gaining attention. An introduction to
computer and technologies often includes
discussions on ethical considerations, privacy
concerns, and responsible use of technology.
Internet and Networking Basics:
 Understanding the fundamentals of the
internet and computer networks is crucial in a
connected world. This knowledge is
applicable across various disciplines and
industries.
Problem-Solving Skills:
 Introduction to Computer and Technologies
often emphasizes problem-solving skills,
logical thinking, and algorithmic reasoning.
These skills are valuable in various
professions, not just in computer science.
Cross-Disciplinary Applications:
 The knowledge gained in an introductory
course can be applied in various fields.
Understanding how technology intersects
with disciplines such as healthcare, business,
education, and more opens up diverse career
paths.
3 Object Oriented Software Development Practices:
Programming  OOP is a key methodology in modern
software development. The future will see a
continued emphasis on modular and reusable
code, making OOP skills crucial for
developers.
Industry Standard:
 OOP is an industry standard in software
development. Companies across various
domains prefer developers with strong OOP
skills as it facilitates the creation of robust
and scalable applications.
Frameworks and Libraries:
 Many popular programming languages, such
as Java, C++, Python, and C#, rely heavily on
OOP principles. Learning OOP is essential
for effectively using frameworks and libraries
built upon these languages.
Mobile App Development:
 OOP is widely used in mobile app
development. Platforms like Android (using
Java or Kotlin) and iOS (using Swift or
Objective-C) heavily leverage OOP
 principles. As mobile applications continue to
evolve, OOP skills will remain relevant.
Game Development:
 OOP is widely employed in the gaming
industry. Game development frameworks and
engines often use OOP principles for building
interactive and complex game systems. As the
gaming industry grows, OOP skills will be in
demand.
4 Data Structure and Algorithm Core Competency in Computer Science:
 Data structures and algorithms are
fundamental to computer science. A strong
understanding of these concepts is likely to
remain a core competency for computer
scientists and software engineers.
Competitive Programming and Coding
Interviews:
 The demand for competitive programmers
and candidates who excel in coding
interviews is expected to grow. Companies,
especially in the technology sector, assess
candidates based on their problem-solving
skills, which often involve applying data
structures and algorithms.
Big Data and Data Science:
 In the era of big data, understanding how to
organize and process large volumes of data is
essential. Data structures and algorithms play
a vital role in developing algorithms for data
analysis, data mining, and predictive
modeling.
Software Development Practices:
 DSA skills are vital in creating high-
performance and scalable software.
Understanding how to choose the right data
structures and algorithms for specific tasks
contributes to the development of robust and
efficient applications
5 Data Base System Big Data Management:
 With the exponential growth of data, the
management of large and diverse datasets
becomes more challenging. Database systems
play a crucial role in handling big data,
providing efficient storage, retrieval, and
analysis capabilities
Data Warehousing and Business Intelligence:
  Database systems are central to data
warehousing and business intelligence
solutions. As organizations strive to derive
insights from their data, the demand for
professionals skilled in designing and
managing robust database systems for BI
applications is expected to grow.
Cloud Database Services:
 The adoption of cloud computing continues to
rise, leading to an increased demand for
cloud-based database services. Understanding
how to design, deploy, and manage databases
in cloud environments is becoming essential
for database professionals.
NoSQL and New Database Models:
 The landscape of database systems is
evolving with the emergence of NoSQL
databases and other alternative database
models. Professionals with knowledge of
various database types (relational, NoSQL,
graph databases, etc.) will be well-positioned
to address diverse data management needs.
6 Operating System Edge Computing:
 As edge computing gains prominence,
operating systems will play a crucial role in
managing and optimizing resources at the
edge. Operating systems that can efficiently
handle decentralized processing and storage
will be in demand.
Real-time Systems:
 Operating systems that can support real-time
processing are essential in applications such
as autonomous vehicles, industrial
automation, and robotics. Future OS
developments may focus on improving real-
time capabilities and responsiveness.
Security and Privacy:
 Operating systems will need to place a greater
emphasis on security and privacy features.
With the rising number of cyber threats,
future OS developments may include
enhanced security measures, encryption, and
privacy controls.
Containerization and Virtualization:
 Containerization and virtualization
technologies, such as Docker and Kubernetes,
 rely on underlying operating systems. Future
OS developments may optimize support for
these technologies, providing better
performance, isolation, and resource
management.
Energy-Efficient Computing:
 Operating systems will play a role in
optimizing energy consumption, particularly
in battery-powered devices and data centers.
Future OS developments may include features
for power management and energy-efficient
scheduling.
7 Digital & Logic Design Digital Systems and Computer Architecture:
 Understanding digital and logic design is
fundamental to computer architecture. As the
demand for more powerful and efficient
computing systems grows, professionals with
expertise in designing and optimizing digital
systems will be in demand.
Embedded Systems:
 Embedded systems, found in a wide range of
devices from smartphones to IoT devices,
require efficient digital design for their
microcontrollers and processors. As the
Internet of Things (IoT) expands, expertise in
digital and logic design will be crucial.
FPGA and ASIC Design:
 Field-Programmable Gate Arrays (FPGAs)
and Application-Specific Integrated Circuits
(ASICs) are widely used in various industries
for custom hardware implementations.
Knowledge of digital and logic design is
essential for engineers working on FPGA and
ASIC designs.
Digital Signal Processing (DSP):
 In applications such as audio processing,
image processing, and telecommunications,
digital signal processing relies heavily on
digital and logic design principles. As
technology advances, DSP will continue to be
a critical aspect of various systems.
Robotics and Automation:
 Robotics and automation systems require
sophisticated control circuits and processors,
often designed using digital and logic design
principles. As industries increasingly adopt
 automation, professionals with expertise in
these areas will be in demand.
VLSI (Very Large Scale Integration) Design:
 VLSI design involves packing millions of
transistors on a single chip. Digital and logic
design principles are fundamental to VLSI
design, and as semiconductor technology
advances, there will be a need for engineers
with expertise in designing complex
integrated circuits.
8 Software Engineering Agile and DevOps Practices:
 Agile methodologies and DevOps practices
are becoming integral to software
development. Future software engineers will
need to be adept at working in agile
environments, collaborating cross-
functionally, and integrating DevOps
practices for continuous delivery and
deployment.
Microservices Architecture:
 Microservices architecture is gaining
popularity for building modular and scalable
applications. Future software engineers will
need to understand how to design, implement,
and manage microservices-based systems for
flexibility and maintainability.
Containerization and Orchestration:
 Containerization technologies like Docker
and orchestration tools like Kubernetes are
crucial for deploying and managing
applications. Future software engineers will
work with containerized environments,
ensuring seamless deployment and scaling of
applications.
Ethical and Responsible Software Development:
 With an increasing focus on ethical
considerations in technology, future software
engineers will need to address ethical
challenges related to bias in algorithms,
privacy concerns, and the responsible use of
emerging technologies.
9 Computer Organization & Processor Architecture and Design:
Assembly Language  Understanding computer organization is
crucial for designing and optimizing
processor architectures. Future developments
in processor technologies will require
 engineers with expertise in computer
organization to enhance performance, energy
efficiency, and scalability.
Hardware-Software Co-Design:
 Computer organization principles are
essential for hardware-software co-design,
where hardware and software components are
optimized together for performance and
efficiency. Future developments will involve
close collaboration between hardware and
software engineers to achieve better system
performance.
FPGA (Field-Programmable Gate Array)
Programming:
 Computer organization concepts are applied
in programming FPGAs for various
applications. Future developments in FPGAs
will involve utilizing these devices for custom
hardware acceleration and specialized
processing tasks.
Advanced Memory Architectures:
 With the increasing demand for faster and
more efficient memory systems, knowledge
of computer organization is crucial. Future
developments will involve innovations in
memory architectures to meet the growing
requirements of computing systems.
Custom Hardware Accelerators:
 Computer organization knowledge is essential
for designing custom hardware accelerators,
which are increasingly used to enhance the
performance of specific tasks. Future
developments will involve creating
specialized hardware for accelerating
artificial intelligence, machine learning, and
other compute-intensive workloads.
10 Human Computer Interaction Natural Language Processing (NLP) and
Conversational Interfaces:
 Advancements in NLP and conversational
interfaces will enhance the way humans
interact with computers. Voice-based
assistants and chatbots are becoming
increasingly sophisticated, and future HCI
may involve more seamless and context-
aware conversations, making technology
more accessible to a broader range of users.
 Gesture and Emotion Recognition:
 HCI is expected to incorporate more
advanced gesture recognition technologies
that can interpret human movements and
expressions accurately. This could lead to
more natural and expressive interactions with
devices, particularly in scenarios where touch
or voice may not be suitable.
Brain-Computer Interfaces (BCI):
 The development of BCI holds the potential
for direct communication between the human
brain and computers. Future HCI may involve
thought-controlled interfaces, opening up new
possibilities for individuals with mobility
impairments and enabling more efficient and
personalized interactions.
 Wearable Technology and IoT Integration:
Wearable devices and the Internet of Things
(IoT) are likely to play a significant role in
HCI. The integration of sensors into clothing,
accessories, and everyday objects can
enhance user experiences by providing
context-aware information, personalized
feedback, and health monitoring.
11 Computer Network 5G and Beyond:
 The rollout and widespread adoption of 5G
networks will significantly impact the future
of communication. Beyond 5G, research and
development are already underway for the
next generation of wireless communication
technologies. These advancements will bring
higher data speeds, reduced latency, and
improved connectivity, enabling a wide range
of applications, including IoT, augmented
reality, and autonomous systems.
Edge Computing:
 Edge computing involves processing data
closer to the source of generation, reducing
latency and enhancing real-time applications.
Future computer networks will evolve to
support edge computing architectures,
enabling efficient and low-latency processing
for applications such as IoT devices,
autonomous vehicles, and smart cities.
Software-Defined Networking (SDN):
 SDN is an architectural approach that
 separates the control plane from the data
plane, providing more flexibility and
programmability in network management.
The future scope of computer networks
includes further advancements in SDN,
leading to more intelligent, adaptive, and
programmable networks that can dynamically
respond to changing demands.
Quantum Networking:
 Quantum networking involves leveraging the
principles of quantum mechanics for secure
communication. While still in the early stages
of development, the future may see
advancements in quantum key distribution
and quantum communication protocols,
providing a new level of security for
networked systems.
Blockchain for Networking:
 Blockchain technology is gaining attention
for its potential application in networking,
particularly for securing transactions,
enhancing trust, and ensuring transparency. In
the future, blockchain may be integrated into
network architectures to provide
decentralized and secure communication.
12 Artificial Intelligence Advanced Machine Learning Models:
 Ongoing research in machine learning is
expected to result in more advanced models
that can handle complex tasks with greater
accuracy. Deep learning architectures,
reinforcement learning algorithms, and other
sophisticated approaches will enable AI
systems to understand and interpret data in
more nuanced ways.
Explainable AI (XAI):
 As AI systems become more complex and
influential, there is a growing emphasis on
creating models that are explainable and
interpretable. The future of AI involves
developing methods to make AI decisions
more transparent and understandable,
addressing concerns related to bias,
accountability, and trust.
AI for Healthcare:
 AI is poised to play a significant role in
healthcare, with applications in diagnostics,
 personalized medicine, drug discovery, and
patient care. Predictive analytics and AI-
driven insights will contribute to more
accurate disease diagnosis, treatment
planning, and healthcare management.
Autonomous Systems:
 Autonomous vehicles, drones, and robots are
areas where AI is expected to have a
substantial impact. Advancements in AI
algorithms, sensor technologies, and robotics
will lead to more sophisticated autonomous
systems capable of navigating complex
environments and performing diverse tasks.
Natural Language Processing (NLP):
 NLP is evolving rapidly, and future AI
systems are expected to have improved
language understanding and generation
capabilities. Conversational AI, chatbots, and
language translation applications will become
more sophisticated, enabling more natural and
context-aware interactions.
AI in Finance and Business:
 AI will continue to transform the financial
and business sectors, with applications in
fraud detection, risk management, customer
service, and decision-making. Predictive
analytics and AI-driven insights will
contribute to more efficient and data-driven
financial strategies.
AI Ethics and Bias Mitigation:
 Ethical considerations in AI development will
be a critical focus in the future. Efforts to
mitigate biases, ensure fairness, and establish
ethical guidelines for AI systems will become
increasingly important. This includes
addressing issues related to bias in training
data and algorithmic decision-making.
Edge AI:
 Edge AI involves processing AI algorithms
on edge devices, reducing the need for
constant data transfer to centralized servers.
This approach enhances real-time processing,
lowers latency, and contributes to more
efficient AI applications in IoT devices, smart
cities, and decentralized systems.
13 Cyber Security Zero Trust Architecture:
 The future of cybersecurity involves a shift
towards Zero Trust Architecture, where trust
is never assumed, and verification is required
from everyone trying to access resources in
the network. This approach enhances security
by adopting a more granular and continuous
authentication process.
AI and Machine Learning in Threat Detection:
 AI and machine learning will play a crucial
role in improving threat detection and
response capabilities. Advanced algorithms
can analyze vast amounts of data to identify
patterns, anomalies, and potential security
threats in real time, enabling faster and more
effective cybersecurity measures.
Quantum-Safe Cryptography:
 With the advent of quantum computing, there
is a need for quantum-safe cryptography to
protect against potential threats to current
cryptographic systems. The future of
cybersecurity involves developing and
implementing cryptographic algorithms that
remain secure in the era of quantum
computing.
Cloud Security and CASB (Cloud Access Security
Broker):
 As organizations increasingly migrate to
cloud environments, the future of
cybersecurity will focus on ensuring the
security of cloud-based data and applications.
CASBs will play a crucial role in providing
visibility, access control, and data protection
in cloud environments.
Human-Centric Security:
 Recognizing the role of human factors in
cybersecurity, future strategies will prioritize
user education, awareness, and training.
Human-centric security aims to reduce the
risk of social engineering attacks, phishing,
and other tactics that exploit human behavior.
Biometric Authentication and Multi-Factor
Authentication (MFA):
 The future of cybersecurity involves an
emphasis on stronger authentication
mechanisms. Biometric authentication, such
 as fingerprint and facial recognition, and the
widespread adoption of multi-factor
authentication will enhance access control
and protect against unauthorized access.
Supply Chain Security:
 Cybersecurity efforts will extend beyond
individual organizations to secure the entire
supply chain. This involves ensuring the
security of software, hardware, and services
provided by third-party vendors to prevent
compromises that could impact the overall
security posture.
Regulatory Compliance and Privacy:
 As cybersecurity threats continue to evolve,
regulations and compliance requirements will
also evolve. Future efforts will focus on
adapting to regulatory changes, ensuring
compliance with privacy laws, and protecting
sensitive data to maintain trust and legal
adherence.
Incident Response and Cyber Resilience:
 Cyber resilience will be a key focus in the
future, emphasizing the ability to prepare for,
respond to, and recover from cyber threats.
Organizations will invest in incident response
plans, cyber insurance, and continuous
improvement of cybersecurity measures to
enhance overall resilience.
14 Theory of Automata Bio-Inspired Computing:
 As researchers explore computing paradigms
inspired by biological systems, such as DNA
computing and cellular automata, the Theory
of Automata will play a role in developing
formal models for these unconventional
computational approaches. This includes
understanding the computational power of
bio-inspired systems and their relationship
with classical models.
 Automata for Data Science and Machine
Learning: The application of automata
theory in data science and machine learning is
an emerging area. Finite automata and formal
languages can be used to model and analyze
sequences, patterns, and structures in data.
This can lead to the development of novel
approaches for data analysis, pattern
 recognition, and automated decision-making.
Automata in Cybersecurity:
 Automata theory has practical applications in
the field of cybersecurity. Modeling security
protocols, intrusion detection systems, and
threat analysis using formal languages and
automata provides a systematic way to reason
about security properties. Future
developments may include more sophisticated
automata models for dynamic and evolving
cyber threats.
Blockchain and Smart Contracts:
 With the rise of blockchain technology, the
Theory of Automata can be applied to model
and analyze smart contracts. Automata-based
formal verification techniques can be
employed to ensure the correctness and
security of smart contract implementations,
contributing to the reliability of decentralized
applications (DApps).
Automata in Artificial Intelligence:
 Automata theory has connections with the
study of formal languages and grammars,
which are relevant to natural language
processing and understanding. Future
applications may involve the use of automata-
based approaches in developing algorithms
for language understanding, sentiment
analysis, and conversational agents.
Complex Systems and Emergent Behavior:
 The Theory of Automata can contribute to
understanding complex systems and emergent
behavior in various domains, including social
networks, biological systems, and ecological
models. Automata models may be adapted to
capture and simulate the dynamics of systems
with decentralized, interacting components.
Robotic Process Automation (RPA):
 In the realm of automation and robotics,
formal models based on automata theory can
be employed to describe and analyze the
behavior of robotic systems. This includes
developing formal languages to specify tasks
and behaviors for robots, contributing to the
field of Robotic Process Automation (RPA).
Automata and IoT (Internet of Things):
  As the number of connected devices in IoT
grows, automata theory can be used to model
and analyze the behavior of interacting
devices. This includes formal languages to
specify communication protocols, ensuring
the reliability and security of IoT systems.

15 Analysis of Algorithm Blockchain and Distributed Ledger Technologies:

 With the growing interest in blockchain and
distributed ledger technologies, the analysis
of algorithms will be crucial in designing
consensus algorithms, smart contract
execution, and cryptographic protocols.
Research in this area will focus on improving
the efficiency and security of distributed
systems.
Robotic Algorithms:
 As robotics and autonomous systems become
more prevalent, the analysis of algorithms
will be essential for designing algorithms that
control and coordinate robotic behavior. This
includes motion planning, pathfinding, and
optimization algorithms for tasks ranging
from industrial automation to autonomous
vehicles.
Biologically Inspired Algorithms:
 The analysis of algorithms will extend to
biologically inspired algorithms, such as
genetic algorithms, swarm intelligence, and
neural-inspired algorithms. Understanding the
efficiency and adaptability of these
algorithms will be crucial for applications in
optimization, search, and problem-solving.
Dynamic and Adaptive Algorithms:
 The future scope of algorithm analysis will
involve addressing challenges posed by
dynamic and adaptive systems. Algorithms
that can adapt to changing environments,
evolving data, and dynamic input patterns
will be crucial for real-time decision-making
and responsive systems.
Ethical Considerations and Algorithmic Bias:
 The analysis of algorithms will need to
consider ethical implications and address
algorithmic bias. Future research will focus
on developing algorithms that are fair,
 transparent, and accountable, ensuring that
algorithms do not perpetuate or amplify
existing biases.
16 Compiler Construction Programming Language Evolution:
 As programming languages continue to
evolve, compiler construction will adapt to
support new language features, paradigms,
and optimizations. The development of
domain-specific languages and languages
targeting specific platforms will influence the
design and construction of specialized
compilers.
Parallel and Distributed Computing:
 With the increasing emphasis on parallel and
distributed computing, the future of compiler
construction will involve optimizing
compilers for multi-core architectures, GPUs,
and distributed systems. Research will focus
on automatic parallelization, efficient thread
management, and load balancing for
enhanced performance.
Quantum Computing Compilation:
 The advent of quantum computing introduces
new challenges and opportunities for
compiler construction. Compilers for
quantum languages must address the unique
characteristics of quantum algorithms,
quantum gates, and quantum circuits. The
future scope involves developing compilers
that optimize quantum programs for different
quantum architectures.
Compiler Support for AI Accelerators:
 The integration of artificial intelligence (AI)
accelerators, such as GPUs and TPUs, in
modern computing systems requires
specialized compiler support. Future compiler
construction efforts will focus on optimizing
code for AI accelerators, improving the
efficiency of neural network inference, and
leveraging hardware accelerators for AI
workloads.
Energy-Efficient Compilation:
 Energy efficiency is a critical concern in
modern computing. Future compilers will
need to optimize code not only for
performance but also for energy consumption.
 Research in compiler construction will
explore techniques for generating power-
efficient code and minimizing the energy
footprint of applications.
Domain-Specific Compilation:
 The future of compiler construction involves
catering to specific application domains.
Domain-specific languages (DSLs) are
gaining popularity in areas such as finance,
healthcare, and scientific computing.
Specialized compilers for DSLs will be
developed to address the unique requirements
of these domains, providing better
performance and expressiveness.
Compiler-Assisted Security:
 Compiler construction will play a role in
enhancing software security. Future compilers
may incorporate security-focused
optimizations, perform static analysis for
vulnerability detection, and implement
techniques to mitigate security threats such as
buffer overflows and code injection attacks.
Adaptive and Self-Optimizing Compilers:
 The future scope includes the development of
adaptive and self-optimizing compilers that
can dynamically adjust compilation strategies
based on runtime feedback. These compilers
will analyze program behavior during
execution and apply optimizations to improve
performance in real-time.
17 Mobile Application Artificial Intelligence (AI) and Machine Learning
(ML):
 AI and ML will play a significant role in the
future of mobile applications. Intelligent
chatbots, personalized recommendations, and
enhanced predictive capabilities will be
integrated into various applications. AI-driven
features will improve user engagement,
efficiency, and overall user experience.
Edge Computing for Mobile Apps:
 Edge computing will enable mobile
applications to process data closer to the
source, reducing latency and enhancing real-
time capabilities. This is particularly crucial
for applications requiring quick responses,
such as gaming, navigation, and critical
 business processes.
Progressive Web Apps (PWAs):
 The adoption of Progressive Web Apps will
likely increase in the future. PWAs combine
the best features of websites and native
mobile applications, providing a more
responsive and app-like experience. They
offer offline functionality, push notifications,
and improved performance without requiring
installation.
Voice and Natural Language Processing (NLP):
 Voice-based interactions and NLP will
become more sophisticated in mobile
applications. Virtual assistants and voice-
activated commands will play a larger role in
hands-free interactions. Applications will
utilize advanced NLP algorithms for more
accurate language understanding and context-
aware responses.
Blockchain Integration:
 Blockchain technology will find applications
in mobile apps, particularly in areas such as
secure transactions, identity verification, and
decentralized applications (DApps).
Blockchain integration can enhance security,
transparency, and trust in various mobile
applications.
Biometric Authentication and Security:
 The future of mobile applications involves an
increased focus on biometric authentication
methods, including facial recognition,
fingerprint scanning, and voice recognition.
Biometric security measures will contribute to
improved user authentication and data
protection.
Health and Wellness Apps:
 The demand for health and wellness
applications will continue to grow. Mobile
apps will play a significant role in fitness
tracking, telemedicine, mental health support,
and overall well-being. Integration with
wearables and health monitoring devices will
enhance the capabilities of these applications.
Personalization and User Experience:
 Personalization will remain a key trend in
mobile applications. Apps will leverage user
 data, preferences, and behavior to deliver
highly personalized content,
recommendations, and experiences. Enhanced
user interfaces and intuitive designs will
contribute to a more engaging user
experience.
Cybersecurity Measures:
 As mobile applications handle sensitive user
data, the future will see an increased
emphasis on cybersecurity. Application
developers will implement robust security
measures, including encryption, secure
authentication methods, and regular security
updates, to protect user information and
maintain trust.
18 Visual Programming Low-Code and No-Code Development:
 Visual programming aligns with the growing
trend of low-code and no-code development
platforms. These platforms empower users
with varying levels of technical expertise to
create applications using visual interfaces,
reducing the need for extensive manual
coding. The future will likely witness the
widespread adoption of such tools, enabling
faster application development and increasing
accessibility for non-programmers.
Graphical User Interface (GUI) Development:
 Visual programming will continue to play a
crucial role in GUI development. Drag-and-
drop interfaces, visual design tools, and
interactive editors will become more
sophisticated, allowing developers to create
visually appealing and user-friendly
interfaces with greater ease.
Data Visualization and Analytics:
 In the realm of data science and analytics,
visual programming will be instrumental in
creating tools for data visualization and
analysis. Users will be able to design visual
workflows, manipulate data through graphical
representations, and create interactive
dashboards without delving deeply into code.
Augmented Reality (AR) and Virtual Reality (VR)
Programming:
 As AR and VR technologies advance, visual
programming will extend its reach to these
 domains. Developers working on AR/VR
applications will leverage visual
programming tools to create immersive
experiences, design 3D environments, and
implement interactive elements without
extensive manual coding.
Educational Programming for Beginners:
 Visual programming environments serve as
excellent educational tools, especially for
beginners and those learning to code. The
future will likely see an expansion of
educational platforms that use visual
programming to teach programming concepts,
making it more accessible and engaging for
students of all ages.
Internet of Things (IoT) Application
Development:
 Visual programming will be integral to IoT
application development. Developers working
on IoT projects will use visual tools to design
and connect devices, set up data flows, and
create automation rules, simplifying the
development process for IoT applications.
Collaborative Development Environments:
 Visual programming supports collaborative
development by providing a more visual and
interactive representation of code logic.
Future tools may enhance collaborative
features, allowing multiple developers to
work on visual projects simultaneously,
fostering better teamwork and
communication.
19 SPM Focus on Cybersecurity in Project Management:
 The increasing importance of cybersecurity
will impact software project management
practices. Project managers will need to
incorporate cybersecurity measures into
project plans, ensuring that security
considerations are integrated from the
beginning and that projects adhere to relevant
security standards.
Sustainability and Green Project Management:
 Sustainable and environmentally conscious
project management practices will gain
prominence. Organizations will prioritize
green project management, considering the
 environmental impact of software
development processes, data centers, and
overall project lifecycle. This may include
assessing and reducing the carbon footprint of
software projects.
Continuous Learning and Certification:
 Project managers will be expected to adapt to
evolving methodologies, technologies, and
industry best practices. Continuous learning
and professional certifications will be crucial
for staying current in the field. Project
managers may pursue certifications in Agile,
DevOps, and other relevant disciplines to
enhance their skills.
Risk Management and Resilience:
 The future of software project management
will place a greater emphasis on risk
management and project resilience. Project
managers will need to proactively identify
and address risks, build resilience into project
plans, and develop contingency strategies to
navigate uncertainties and disruptions
effectively.
Emphasis on Soft Skills:
 The importance of soft skills in project
management will continue to grow. Effective
communication, leadership, and interpersonal
skills will be critical for project managers to
navigate complex team dynamics, stakeholder
relationships, and diverse project
environments.
Customizable Project Management Tools:
 The future will likely see an increase in
customizable and modular project
management tools. Organizations may
demand tools that can be tailored to their
specific project management methodologies,
workflows, and reporting requirements,
allowing for greater flexibility and
adaptability.
20 Cryptography Homomorphic Encryption:
 Homomorphic encryption allows computation
on encrypted data without decrypting it. This
capability is crucial for secure and private
data processing in cloud computing and other
distributed systems. The future of
 cryptography involves advancing
homomorphic encryption techniques to make
them more efficient and practical for
widespread adoption.
Zero-Knowledge Proofs:
 Zero-knowledge proofs enable one party to
prove the validity of a statement without
revealing any information about the statement
itself. This concept is particularly valuable for
privacy-preserving transactions and identity
verification. Future developments in zero-
knowledge proofs, such as zk-SNARKs
(Zero-Knowledge Succinct Non-Interactive
Arguments of Knowledge), will find
applications in blockchain, digital currencies,
and authentication protocols.
Fully Homomorphic Encryption:
 Fully homomorphic encryption (FHE) allows
not only computation on encrypted data but
also the ability to perform any computation
on encrypted data. While FHE is
computationally intensive, ongoing research
aims to improve its efficiency and
practicality. The future may see increased
adoption of FHE for secure data processing in
various domains.
Multi-Party Computation (MPC):
 MPC enables multiple parties to jointly
compute a function over their inputs while
keeping those inputs private. The future of
cryptography involves enhancing and
expanding MPC techniques for secure
collaborative computations, enabling
organizations to collaborate on data analysis
without sharing sensitive information.
Cryptography in IoT and Edge Computing:
 As the Internet of Things (IoT) and edge
computing ecosystems grow, the demand for
lightweight and efficient cryptographic
protocols will increase. Future cryptography
will focus on developing algorithms that are
well-suited for resource-constrained devices,
ensuring secure communication and data
integrity in IoT and edge computing
environments.
Privacy-Preserving Technologies:
  Privacy-preserving technologies, including
differential privacy and secure multi-party
computation, will play a crucial role in
protecting individuals' privacy in data-driven
applications. The future will see the
integration of privacy-preserving techniques
into various systems, including data analytics,
machine learning, and healthcare
applications.
Blockchain and Cryptocurrencies:
 Cryptography is at the core of blockchain
technology and cryptocurrencies. Future
developments may include improvements in
cryptographic primitives, consensus
algorithms, and privacy-enhancing techniques
for blockchain networks. Innovations in
cryptographic solutions will contribute to the
security and scalability of blockchain-based
systems.
Cryptography for Authentication and Identity
Management:
 Identity management and authentication
systems will benefit from advancements in
cryptography. Future cryptographic
techniques will aim to enhance secure and
user-friendly methods of authentication, such
as passwordless authentication, biometrics,
and secure key management.
Quantum Key Distribution (QKD):
 With the rise of quantum computing threats,
quantum key distribution provides a method
for secure key exchange using the principles
of quantum mechanics. The future of
cryptography will explore the practical
implementation and integration of QKD for
secure communication channels, particularly
in critical infrastructure and sensitive
communication networks.
21 Computer Graphic Real-Time Ray Tracing and Rendering:
 The future of computer graphics involves
advancements in real-time ray tracing and
rendering techniques. As hardware
capabilities continue to improve, real-time
rendering with realistic lighting, reflections,
and shadows will become more prevalent in
applications such as video games, virtual
 reality (VR), and architectural visualization.
Immersive Technologies:
 The integration of computer graphics with
immersive technologies, including virtual
reality (VR) and augmented reality (AR), will
be a key focus. Enhanced graphics and
realistic simulations will contribute to more
immersive virtual experiences, impacting
industries such as gaming, education,
healthcare, and training simulations.
Generative Adversarial Networks (GANs) in
Graphics:
 Generative Adversarial Networks (GANs) are
being increasingly utilized in computer
graphics for tasks such as image generation,
style transfer, and content creation. The future
scope involves the refinement and application
of GANs for generating high-quality, realistic
graphics and visual content.
Machine Learning in Graphics Processing:
 Machine learning algorithms will play a
significant role in optimizing graphics
processing tasks. AI-driven techniques can
improve rendering efficiency, enhance image
quality, and enable intelligent features in
graphics applications. This includes
applications in denoising, upscaling, and
content-aware image manipulation.
Global Illumination and Lighting Simulation:
 Advancements in global illumination
algorithms will lead to more accurate and
realistic lighting simulations in computer
graphics. The future will see improved
techniques for simulating indirect lighting,
subsurface scattering, and dynamic lighting
scenarios, contributing to enhanced visual
fidelity in digital environments.
Digital Twins and Simulation:
 Computer graphics will be instrumental in the
development of digital twins and simulation
environments. Industries such as
manufacturing, urban planning, and
healthcare will leverage realistic 3D
simulations for prototyping, testing, and
training, facilitating better decision-making
and problem-solving.
 Holography and Light-field Displays:
 Future computer graphics may explore
holography and light-field displays to create
more realistic 3D visualizations. These
technologies have the potential to
revolutionize how we perceive and interact
with digital content, offering depth and
perspective beyond traditional displays.
Interactive and Adaptive Graphics:
 The future of computer graphics involves the
creation of interactive and adaptive graphics
that respond to user input, preferences, and
contextual information. This includes
personalized user interfaces, dynamic
visualizations, and graphics that adapt to
different devices and screen sizes.
22 Data Mining Big Data Analytics:
 As the volume, velocity, and variety of data
continue to increase, the future of data mining
will be closely tied to big data analytics.
Advanced data mining techniques will be
essential for extracting meaningful patterns
and insights from massive datasets, enabling
organizations to make data-driven decisions.
Machine Learning Integration:
 Machine learning algorithms play a crucial
role in data mining, and their integration will
deepen in the future. Advanced machine
learning models, such as deep learning,
reinforcement learning, and ensemble
methods, will enhance the accuracy and
efficiency of data mining processes,
especially in complex and high-dimensional
datasets.
Explainable AI in Data Mining:
 The interpretability of machine learning
models is gaining importance. In data mining,
there will be a focus on developing
explainable AI models that provide clear
explanations of how decisions are made. This
is crucial for building trust in automated
decision-making systems across various
domains.
Predictive Analytics for Business Intelligence:
 Data mining will continue to play a
significant role in predictive analytics,
 providing insights for business intelligence.
Organizations will leverage predictive models
to forecast trends, customer behavior, and
market dynamics, enabling proactive
decision-making and strategic planning.
Privacy-Preserving Data Mining:
 With growing concerns about data privacy,
the future of data mining will involve the
development of techniques for privacy-
preserving data mining. This includes
methods such as differential privacy and
federated learning, ensuring that valuable
insights can be derived without compromising
individual privacy.
Streaming Data Mining:
 The real-time analysis of streaming data will
be a crucial aspect of the future of data
mining. As data is generated continuously
from various sources, data mining algorithms
will need to adapt to process and extract
insights from data streams in real-time,
supporting applications in finance, healthcare,
and IoT.
Graph and Network Data Mining:
 The analysis of graph-structured and network
data will become more prominent. Data
mining techniques will evolve to uncover
patterns and relationships in complex
networks, such as social networks, biological
networks, and transportation networks,
contributing to fields like social network
analysis and bioinformatics.
Integration with Natural Language Processing
(NLP):
 The integration of data mining with natural
language processing will enable the extraction
of insights from unstructured textual data.
Sentiment analysis, text mining, and
information extraction will benefit from the
synergy between data mining and NLP,
supporting applications in customer feedback
analysis and content summarization.
Geospatial Data Mining:
 With the proliferation of geospatial data from
various sources, including GPS devices and
satellite imagery, data mining will extend its
 scope to geospatial analytics. This involves
extracting patterns and knowledge from
spatial data, benefiting applications in urban
planning, environmental monitoring, and
location-based services.
Healthcare Data Mining:
 The healthcare sector will witness increased
utilization of data mining for extracting
insights from electronic health records,
medical imaging data, and patient histories.
Predictive modeling, disease prediction, and
personalized medicine will be areas of focus,
contributing to improved patient care and
outcomes.
Fraud Detection and Cybersecurity:
 Data mining will continue to play a vital role
in fraud detection and cybersecurity.
Advanced anomaly detection algorithms and
pattern recognition techniques will be
employed to identify unusual patterns in data,
mitigating risks and enhancing the security of
financial transactions and digital systems.
Ethical and Responsible Data Mining:
 Ethical considerations will play a significant
role in the future of data mining. There will
be a growing emphasis on responsible data
mining practices, including transparency,
fairness, and bias mitigation. Ethical
frameworks and guidelines will be developed
to ensure the responsible use of data mining
technologies.
23 Information Security IoT Security:
 The proliferation of Internet of Things (IoT)
devices introduces a vast attack surface.
Information security will focus on securing
IoT ecosystems, implementing device
authentication, encryption, and access
controls. Efforts will be made to prevent IoT
devices from becoming potential entry points
for cyberattacks.
Ransomware and Cyber Resilience:
 Ransomware attacks continue to be a
significant threat. Future information security
strategies will emphasize cyber resilience,
including regular backups, incident response
planning, and employee training. Proactive
 measures will be taken to detect, mitigate, and
recover from ransomware attacks.
Security Automation and Orchestration:
 The future will see increased adoption of
security automation and orchestration to
streamline and enhance incident response
processes. Automated tools will help
organizations respond to security incidents
more rapidly, reducing the impact of cyber
threats.
Regulatory Compliance and Privacy Laws:
 Compliance with evolving data protection and
privacy regulations will be a top priority.
Information security measures will align with
regulations such as GDPR, CCPA, and others,
ensuring that organizations handle and protect
sensitive data in accordance with legal
requirements.
Human-Centric Security:
 Recognizing the role of human factors in
cybersecurity, future information security
efforts will focus on human-centric security.
This includes user awareness training,
behavioral analysis, and strategies to mitigate
social engineering attacks, emphasizing the
importance of creating a security-aware
culture.
Threat Intelligence Sharing:
 Collaboration and information sharing among
organizations, industries, and governments
will play a crucial role in combating cyber
threats. Future information security efforts
will involve the exchange of threat
intelligence to better understand and respond
to emerging cyber threats collectively.
24 Data Science Data Privacy and Ethics:
 Data privacy and ethical considerations will
continue to be critical aspects of data science.
Future endeavors will involve implementing
privacy-preserving techniques, complying
with regulations such as GDPR, and
developing ethical frameworks for
responsible data usage.
Blockchain and Data Science Integration:
 Blockchain technology will find applications
in data science, particularly in enhancing data
 security, provenance, and transparency.
Integration with blockchain can address
concerns related to data integrity and
facilitate secure and traceable data sharing.
Personalized and Context-Aware Models:
 Data science will focus on developing
personalized and context-aware models that
adapt to individual user preferences and
changing environments. Personalization
algorithms will play a crucial role in
recommendation systems, user interfaces, and
content delivery across various platforms.
Data Science for Healthcare and Precision
Medicine:
 In healthcare, data science will continue to
advance precision medicine by analyzing
large-scale genomics, clinical, and patient
data. Predictive models and personalized
treatment plans will be developed to improve
patient outcomes and healthcare delivery.
Cross-Disciplinary Collaboration:
 The future of data science involves increased
collaboration across disciplines. Data
scientists will work closely with domain
experts, business analysts, and professionals
from various fields to develop solutions that
address specific industry challenges and drive
innovation.
Continuous Learning and Development:
 Data science professionals will need to
engage in continuous learning to stay abreast
of evolving technologies, methodologies, and
domain-specific knowledge. Ongoing
education and upskilling will be crucial for
adapting to the rapidly changing landscape of
data science.
Quantum Computing and Advanced Algorithms:
 As quantum computing technologies mature,
data science will explore their potential for
solving complex problems and optimizing
algorithms. Quantum machine learning and
quantum-enhanced optimization techniques
may become integral parts of advanced data
science applications.
Robust Data Governance and Quality Assurance:
 Future data science efforts will place a strong
 emphasis on data governance and quality
assurance. Organizations will implement
robust data governance frameworks to ensure
the accuracy, reliability, and ethical use of
data throughout the entire data lifecycle.
25 Machine Learning Advancements in Deep Learning:
 Deep learning, a subset of machine learning,
involves neural networks with multiple
layers. The future will see continuous
advancements in deep learning techniques,
leading to improved model architectures,
training methods, and applications in image
recognition, natural language processing, and
other complex tasks.
Transfer Learning and Pre-trained Models:
 Transfer learning, where models trained on
one task are adapted to new tasks, will gain
prominence. Pre-trained models and transfer
learning approaches will enable faster
development of ML solutions for specific
domains, reducing the need for extensive
labeled datasets.
Explainable AI (XAI):
 The importance of understanding and
interpreting machine learning models will
lead to increased focus on explainable AI.
Future machine learning systems will
prioritize transparency, allowing users to
comprehend how models make decisions,
enhancing trust and accountability.
Automated Machine Learning (AutoML):
 Automated Machine Learning (AutoML)
tools will become more sophisticated,
automating the end-to-end process of model
development, from data preprocessing to
model selection and hyperparameter tuning.
This will democratize machine learning,
making it more accessible to individuals with
varying levels of expertise.
Federated Learning:
 Federated learning, where models are trained
across decentralized devices or servers, will
gain traction. This approach enhances privacy
by keeping data localized, making it suitable
for applications in edge computing, IoT, and
scenarios where data cannot be centralized.
AI in Edge Computing:
 The integration of machine learning with
edge computing devices will become more
prevalent. Machine learning models will be
deployed directly on edge devices, enabling
real-time processing and decision-making
without the need for continuous data
transmission to centralized servers.
Responsible AI and Ethics:
 The future of machine learning involves a
heightened focus on responsible AI practices
and ethical considerations. Efforts will be
made to address issues related to bias,
fairness, accountability, and the societal
impact of machine learning applications.
Natural Language Processing (NLP)
Advancements:
 Natural language processing will continue to
evolve, with advancements in understanding
context, sentiment analysis, and language
generation. Improved NLP models will
contribute to more sophisticated chatbots,
language translation, and content
summarization.
Machine Learning for Drug Discovery and
Healthcare:
 Machine learning applications in drug
discovery and healthcare will expand,
facilitating the identification of potential drug
candidates, personalized medicine, and the
development of predictive models for disease
diagnosis and prognosis.
Robotic Process Automation (RPA) with ML:
 Robotic Process Automation (RPA) will be
enhanced with machine learning capabilities.
Intelligent automation systems will leverage
ML to adapt and optimize processes,
improving efficiency and decision-making in
business operations.
Quantum Machine Learning:
 The emergence of quantum computing will
influence machine learning. Quantum
machine learning algorithms will be explored
for solving complex problems, optimizing
large datasets, and improving the efficiency
of certain machine learning tasks.
 AI in Cybersecurity:
 The integration of machine learning into
cybersecurity will continue to grow. ML
algorithms will be used for anomaly
detection, threat analysis, and the
identification of patterns indicative of
cyberattacks, enhancing overall cybersecurity
measures.
Personalized and Context-Aware
Recommendations:
 Machine learning algorithms will advance in
providing more personalized and context-
aware recommendations. This will be
particularly evident in applications such as e-
commerce, content streaming, and
personalized user experiences across digital
platforms.
Human-AI Collaboration:
 The future of machine learning involves
closer collaboration between humans and AI
systems. Augmented intelligence, where
machine learning supports human decision-
making, will be emphasized in various
domains, including healthcare, finance, and
creative endeavors.
26 Cloud Computing Cloud-Native Development Practices:
 Cloud-native development practices,
including microservices architecture and
continuous integration/continuous
deployment (CI/CD) pipelines, will become
standard. Cloud platforms will support and
facilitate the development of scalable and
resilient applications following cloud-native
principles.
Zero Trust Security Models:
 Security in the cloud will adopt zero-trust
principles, where every user and device is
treated as untrusted, regardless of their
location or network. Cloud platforms will
implement advanced security measures,
including identity and access management
(IAM), encryption, and threat detection, to
ensure data protection in dynamic
environments.
Blockchain and Distributed Ledger Technologies:
 Cloud providers will explore the integration
 of blockchain and distributed ledger
technologies to enhance trust, transparency,
and security. Blockchain-as-a-Service (BaaS)
offerings on cloud platforms will enable
organizations to develop, deploy, and manage
blockchain applications.
Sustainable and Green Cloud Computing:
 Cloud providers will place a stronger
emphasis on sustainability and green
computing practices. Future cloud services
will prioritize energy efficiency, resource
optimization, and environmentally conscious
data center designs to minimize the
environmental impact of cloud computing.
5G and Cloud Synergy:
 The rollout of 5G networks will complement
cloud computing by providing high-speed,
low-latency connectivity. Cloud services will
be leveraged for scalable and distributed 5G
applications, enabling new possibilities for
augmented reality, virtual reality, and IoT use
cases.
Data Management and Analytics Services:
 Cloud platforms will continue to evolve their
data management and analytics services.
Organizations will leverage cloud-based data
lakes, analytics tools, and machine learning
services for deriving actionable insights from
vast datasets.
Compliance and Regulatory Capabilities:
 Cloud providers will enhance compliance and
regulatory capabilities to address the diverse
requirements of different industries and
regions. Cloud services will include features
to help organizations meet specific data
protection, privacy, and industry-specific
regulations.
Collaborative Cloud Ecosystems:
 Cloud ecosystems will become more
collaborative, fostering partnerships and
integrations between cloud providers,
software vendors, and industry-specific
service providers. Open standards and
interoperability will be key drivers in creating
seamless and collaborative cloud
environments.
 Focus on User Experience and Developer
Productivity:
 Cloud providers will prioritize user
experience and developer productivity.
Improvements in user interfaces, developer
tools, and documentation will make it easier
for organizations to adopt and make the most
of cloud services.
Continuous Innovation and Evolution:
 Cloud computing will continue to be a
dynamic and rapidly evolving field. Cloud
providers will invest in continuous
innovation, introducing new services,
features, and technologies to address
emerging challenges and meet the evolving
needs of businesses and users.
27 Multimedia System Augmented and Virtual Reality Integration:
 The integration of multimedia systems with
augmented reality (AR) and virtual reality
(VR) technologies will be a significant focus.
Future multimedia systems will aim to
provide immersive and interactive
experiences, ranging from gaming and
entertainment to applications in education,
training, and virtual collaboration.
Interactive and Dynamic Content:
 Multimedia systems will continue to evolve
towards creating more interactive and
dynamic content. This includes the
development of responsive multimedia
applications, interactive websites, and user
interfaces that adapt to user behavior and
preferences.
360-Degree and Spatial Audio:
 Advancements in spatial audio technologies
will enhance the auditory experience in
multimedia systems. Future applications will
incorporate 360-degree audio to create a more
immersive sound environment, particularly in
VR and AR applications.
Personalization and User-Centric Design:
 Future multimedia systems will prioritize
personalization and user-centric design.
Adaptive algorithms and user profiling will
be employed to tailor multimedia content
based on individual preferences, creating a
 more personalized and engaging user
experience.
Multimodal Human-Computer Interaction:
 The future scope involves the integration of
multimodal interaction techniques. This
includes combining speech recognition,
gesture control, touch interfaces, and other
modalities to create natural and intuitive ways
for users to interact with multimedia systems.
Artificial Intelligence in Multimedia Processing:
 Artificial intelligence (AI) and machine
learning (ML) will play a crucial role in
multimedia processing. Future systems will
leverage AI algorithms for tasks such as
content recommendation, image and video
analysis, and semantic understanding to
enhance the overall multimedia experience.
Blockchain for Content Security and Ownership:
 The use of blockchain technology in
multimedia systems will address issues
related to content security, ownership, and
digital rights management. Blockchain can
provide transparent and secure mechanisms
for managing multimedia assets, particularly
in content distribution and licensing.
Real-Time Communication and Collaboration:
 Multimedia systems will evolve to support
real-time communication and collaboration
features. This includes applications for video
conferencing, collaborative editing of
multimedia content, and virtual team
environments that leverage multimedia for
effective communication.
Cross-Platform and Device Compatibility:
 Future multimedia systems will prioritize
cross-platform compatibility and seamless
integration across devices. Technologies like
Progressive Web Apps (PWAs) and
responsive design principles will be employed
to ensure a consistent multimedia experience
across various platforms and devices.
Emergence of 5G for Multimedia Streaming:
 The rollout of 5G networks will impact
multimedia systems, particularly in terms of
high-speed data transfer and low-latency
communication. This will contribute to
 improved multimedia streaming experiences,
especially for high-definition video content
and real-time applications.
E-Learning and Educational Multimedia:
 The future scope of multimedia systems
includes a significant focus on e-learning and
educational applications. Multimedia will
play a vital role in creating engaging
educational content, virtual classrooms, and
interactive learning environments.
Medical and Healthcare Multimedia Applications:
 Multimedia systems will find applications in
the medical and healthcare sectors. This
includes medical imaging, virtual simulations
for training healthcare professionals, and the
development of multimedia content for
patient education and rehabilitation.
28 Simulation Industry-Specific Simulations:
 Future simulations will be increasingly
tailored to specific industries, including
manufacturing, healthcare, aerospace, energy,
and transportation. Industry-specific
simulations will help optimize processes,
enhance safety measures, and improve overall
operational efficiency.
Digital Twin Technology:
 Digital twin technology, where a virtual
representation of a physical system or process
is created, will gain prominence. Future
simulations will incorporate digital twins to
enable real-time monitoring, analysis, and
optimization of physical assets and systems,
contributing to the concept of Industry 4.0.
Augmented and Virtual Reality Integration:
 The integration of augmented reality (AR)
and virtual reality (VR) into simulations will
provide more immersive and realistic
experiences. Simulations will leverage AR
and VR technologies for training, design
validation, and interactive visualization of
complex systems.
Simulation in Healthcare:
 Simulations will play a vital role in healthcare
education, training, and patient care. Virtual
patient simulations, surgical training
simulations, and medical scenario simulations
 will contribute to improved healthcare
outcomes, skill development, and patient
safety.
Autonomous Systems and Robotics Simulation:
 Simulation will be crucial for the
development and testing of autonomous
systems and robotics. This includes
simulating the behavior of autonomous
vehicles, drones, robotic arms, and other
intelligent systems to ensure safety,
reliability, and optimal performance.
Climate Modeling and Environmental
Simulations:
 Given the increasing focus on climate change
and environmental sustainability, simulations
will be employed for climate modeling,
environmental impact assessments, and
ecosystem simulations. These simulations
will aid in understanding complex
environmental processes and predicting the
impact of human activities.
Simulation for Disaster Preparedness:
 Simulations will be used to model and
simulate natural disasters, pandemics, and
emergency response scenarios. This includes
training for first responders, evaluating
evacuation strategies, and assessing the
resilience of critical infrastructure in the face
of unforeseen events.
Serious Games for Education and Training:
 Serious games, which combine elements of
entertainment with educational content, will
be increasingly used for training and
education. Simulations in the form of serious
games will provide engaging learning
experiences, particularly in areas such as
professional development, military training,
and skill enhancement.
Simulations for Urban Planning and Smart Cities:
 Urban planning and smart city initiatives will
benefit from simulations that model urban
infrastructure, traffic flow, energy
consumption, and public services.
Simulations will assist in optimizing city
planning, evaluating the impact of urban
interventions, and creating more sustainable
 and efficient urban environments.
Multi-Agent Simulation:
 Multi-agent simulations, where multiple
agents interact within a virtual environment,
will be employed to study complex social,
economic, and organizational systems. These
simulations will contribute to understanding
emergent behaviors, decision-making
processes, and the dynamics of
interconnected systems.
29 Enterprise System Cloud-Based Enterprise Systems:
 The adoption of cloud computing in
enterprise systems will continue to grow.
Cloud-based ERP solutions offer scalability,
flexibility, and cost-effectiveness.
Organizations will increasingly migrate from
on-premises systems to cloud-based solutions,
facilitating remote access, collaboration, and
seamless updates.
Integration with Emerging Technologies:
 Enterprise systems will integrate with
emerging technologies such as artificial
intelligence (AI), machine learning (ML), and
the Internet of Things (IoT). This integration
will enhance automation, predictive analytics,
and the ability to derive actionable insights
from large datasets, improving decision-
making processes.
Modular and Scalable Architecture:
 Future enterprise systems will adopt modular
and scalable architectures to accommodate
changing business requirements. This allows
organizations to add or remove modules
based on specific needs, making the system
more adaptable to evolving business
processes.
Enhanced User Experience (UX) and User
Interfaces (UI):
 Enterprise systems will prioritize user
experience and user interfaces to enhance
usability and user adoption. Intuitive
interfaces, personalized dashboards, and
mobile-friendly designs will contribute to a
more seamless and user-friendly interaction
with the system.
Blockchain Integration for Supply Chain and
Security:
 The integration of blockchain technology into
enterprise systems will enhance transparency
and security, particularly in supply chain
management. Blockchain can be used to trace
and verify the authenticity of products,
streamline transactions, and secure sensitive
data within the enterprise ecosystem.
Advanced Analytics for Business Intelligence:
 Enterprise systems will leverage advanced
analytics tools for business intelligence and
reporting. Predictive analytics, data
visualization, and real-time reporting
capabilities will empower organizations to
make informed decisions and gain actionable
insights from their data.
Focus on Cybersecurity and Data Privacy:
 With the increasing threat landscape,
cybersecurity and data privacy will be
paramount in enterprise systems. Future
systems will implement robust security
measures, encryption protocols, and
compliance with data protection regulations
to safeguard sensitive information.
Mobile-First and Remote Work Support:
 The future of enterprise systems involves a
mobile-first approach, accommodating the
growing trend of remote work. Systems will
be designed to facilitate access from mobile
devices, ensuring that employees can perform
key tasks and access information regardless
of their location.
Artificial Intelligence for Intelligent Automation:
 AI will play a significant role in intelligent
automation within enterprise systems. This
includes automating routine tasks, optimizing
workflows, and enabling cognitive
capabilities such as natural language
processing for improved user interactions.
Interconnected Ecosystems and Integration
Platforms:
 Enterprise systems will increasingly be part
of interconnected business ecosystems.
Integration platforms and APIs (Application
Programming Interfaces) will enable seamless
communication and data exchange between
 different enterprise applications, third-party
services, and external partners.
Sustainable Enterprise Systems:
 Sustainability will be a focus in enterprise
systems, with organizations seeking solutions
that contribute to environmental and social
responsibility. This includes features for
tracking and managing environmental
impacts, resource efficiency, and supporting
sustainable business practices.
Agile and DevOps Methodologies:
 The adoption of agile and DevOps
methodologies will shape the development,
deployment, and maintenance of enterprise
systems. Continuous integration, continuous
delivery, and iterative development practices
will enhance system agility and
responsiveness to changing business needs.
Personalized Customer Relationship Management
(CRM):
 Enterprise systems, especially in the context
of CRM, will focus on personalization. AI-
driven CRM capabilities will enable
organizations to deliver personalized
customer experiences, anticipate customer
needs, and enhance customer satisfaction.
Compliance and Regulatory Features:
 Enterprise systems will include features to
ensure compliance with industry-specific
regulations and standards. These features will
help organizations navigate complex
regulatory landscapes and mitigate risks
associated with non-compliance.
Robotic Process Automation (RPA) Integration:
 Robotic Process Automation will be
integrated into enterprise systems to automate
repetitive and rule-based tasks. RPA can
enhance efficiency, reduce errors, and free up
human resources for more strategic and
value-added activities.
30 IT Project Management Agile and Hybrid Project Management:
 The future of IT Project Management lies in
the continued dominance of Agile
methodologies and the adoption of hybrid
project management approaches.
Organizations will increasingly combine
 Agile principles with traditional project
management methods to balance adaptability
and structure, ensuring better responsiveness
to changing requirements.
Digital Transformation Projects:
 IT Project Management will play a critical
role in managing digital transformation
initiatives. As organizations undergo digital
transformations, project managers will need
to navigate complex projects involving the
implementation of new technologies, process
redesign, and organizational change.
AI and Automation in Project Management:
 The integration of artificial intelligence (AI)
and automation tools will impact IT Project
Management. AI will assist project managers
in decision-making, risk analysis, and
resource optimization. Automation tools will
streamline repetitive tasks, allowing project
managers to focus on strategic aspects of
project delivery.
Data-driven Decision Making:
 Data analytics and business intelligence will
contribute to data-driven decision-making in
IT Project Management. Project managers
will leverage data insights to monitor project
performance, identify trends, and make
informed decisions, contributing to more
successful project outcomes.
Remote and Global Project Teams:
 The future of IT Project Management
involves managing remote and globally
distributed project teams. Project managers
will need to adapt to virtual collaboration
tools, address cultural differences, and
implement effective communication strategies
to ensure project success in diverse and
dispersed work environments.
Cybersecurity Project Management:
 As cybersecurity becomes a top priority for
organizations, project managers will play a
crucial role in overseeing cybersecurity
projects. This includes implementing security
measures, managing compliance with
regulations, and ensuring the protection of
sensitive information.
Blockchain Project Management:
 The adoption of blockchain technology will
introduce new challenges and opportunities
for IT Project Management. Project managers
will oversee the implementation of
blockchain projects, ensuring transparency,
security, and successful integration with
existing systems.
Sustainable Project Management:
 Sustainable and eco-friendly project
management practices will gain prominence.
IT projects will incorporate sustainability
considerations, including energy efficiency,
responsible sourcing of materials, and the
reduction of environmental impact associated
with technology implementations.
DevOps and Continuous Delivery:
 DevOps practices and continuous delivery
methodologies will continue to shape IT
Project Management. Project managers will
need to align development and operations
teams, promote collaboration, and integrate
automated testing and deployment practices
to achieve faster and more reliable project
delivery.
Project Management as a Service (PMaaS):
 The emergence of Project Management as a
Service (PMaaS) will offer organizations the
flexibility to access project management
expertise and tools on a subscription basis.
This trend will enable scalability and cost-
effectiveness in managing projects.
Customer-Centric Project Management:
 Customer-centric project management
approaches will gain emphasis. Project
managers will focus on understanding and
meeting customer expectations, ensuring that
IT projects align with business goals and
deliver value to end-users.
Resilience and Risk Management:
 IT Project Management will increasingly
focus on resilience and risk management.
Project managers will need to proactively
identify, assess, and mitigate risks,
considering factors such as cybersecurity
threats, geopolitical uncertainties, and
 unforeseen disruptions.
Soft Skills and Leadership:
 Soft skills, including effective
communication, leadership, and stakeholder
management, will be crucial for IT project
managers. Leadership qualities will be
essential for guiding teams through
challenges, fostering collaboration, and
ensuring project success.

Course Code:
Title: Advance Algorithm Analysis
Credit Rating: 3
Level: MS/M.Phil.
Delivery: Face To Face
Pre-requisites:
Pre-Reading
Material:
This is a post-graduate level course. This course is designed to
provide students with an understanding of the principles and
techniques used in the design and analysis of algorithms. The course
is primarily theoretical and does not require programming, but it does
require understanding of the notion of a mathematical proof and
some knowledge of elementary discrete mathematics. We will
Core Text:
discuss and analyze a variety of data structures and algorithms
chosen for their importance and their illustration of fundamental
concepts. We will emphasize analyzing the worst-case running time
of an algorithm as a function of input size. We will also spend some
time exploring the boundary between feasible computations, taken to
be those doable in polynomial time, and infeasible computations
 To understand and implement Divide and Conquer strategy
 To understand the concepts of Dynamic programming
Objectives  To understand the concepts of Greedy Algorithm
 To understand and explain basics of Complexity theory
At the end of this course, you should be able to:
 Analyze the worst-case running time of an algorithm as a function of input size
 Solve Recurrence relations
 Understand and implement Divide and Conquer strategy
 Understand the concepts of Dynamic programming
 Understand the concepts of Greedy Algorithm
 Understand and explain basics of Complexity theory

Key Transferable Skills

 Understanding of the principles and techniques used in the design and analysis
of algorithms.
 Importance and working of variety of data structures and algorithms
 concepts of Dynamic programming

Session Topics
NO
1 Introduction
2 The Role of Algorithms in Computing
3 Insertion sort
4 Analyzing algorithms & Designing algorithms
5 Growth of Functions
 Asymptotic notation
 Standard notations and common functions
6 Growth of Functions
 Asymptotic notation
 Standard notations and common functions (Continued)
7 Divide-and-Conquer
8 Revision
9 MID TERM
10 Heapsort
11 Quicksort
12 Sorting in Linear Time
13 Binary Search Trees
14 Dynamic Programming
15 Dynamic Programming
16 Presentations and Submission of Final Assignment
17 Revision
18 Final Term

Reference Materials:
 Introduction to Algorithms Third Edition By
 Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Clifford Stein
Course Code:
Title: Advance Computer Architecture
Credit Rating: 3
Level: MS/M.Phil.
Delivery: Face To Face
Pre-requisites:
Pre-Reading
Material:
This is a post-graduate level course. This course will provide the
students with an understanding of the various levels of studying
computer architecture, with emphasis on instruction set level and
Core Text: register transfer level. This course prepares the students to use basic
combinational and sequential building blocks to design larger
structures like Arithmetic Logic Units, memory subsystems, I/O
subsystems etc.
 Understand Instruction Set Architecture design and
Central Processing Units of the RISC (Reduced
Instruction Set Computers) and the CISC (Complex
Objectives: Instruction Set Computers) type
 Describe the behavior and structure of a computer
using RTL (Register transfer language)
 Explain Pipelining and instruction level Parallels

Intended Learning Outcomes:

Upon successful completion of the course the students would be able to:
 Understand Instruction Set Architecture design and Central Processing Units of
the RISC (Reduced Instruction Set Computers) and the CISC (Complex
Instruction Set Computers) type
 Describe the behavior and structure of a computer using RTL (Register transfer
 language)
 Explain Pipelining and instruction level Parallelism
 Explain the I/O sub systems
 Understand Magnetic disk drives
 Explain the memory module of computer
 Understand Number Systems and Radix Conversion

Key Transferable Skills

 This course prepares the students to use basic combinational and sequential building
blocks to design larger structures like Arithmetic Logic Units, memory subsystems,
I/O subsystems

Session Topics
NO
1 Introduction
2 Introduction
 Organization and Architecture
3 Introduction
 Structure and Function
4 Computer Evolution and Performance
 A Brief History of Computers
 Designing for Performance
 Multicore, MICs, and GPGPUs
5 Computer Evolution and Performance
 The Evolution of the Intel x86 Architecture
 Embedded Systems and the ARM
 Performance Assessment
6 A Top-Level View of Computer Function and Interconnection
 Computer Components
 Computer Function
 Interconnection Structures
7 A Top-Level View of Computer Function and Interconnection
 Bus Interconnection
 Point-To-Point Interconnect
 PCI Express
 8 Revision
9 MID TERM
10 Internal Memory
 Semiconductor Main Memory
 Error Correction
 Advanced DRAM Organization
11 External Memory
 Magnetic Disk
 RAID
 Solid State Drives
 Optical Memory
 Magnetic Tape
12 Number Systems
 The Decimal System
 Positional Number Systems
 The Binary System
13 Number Systems
 Converting Between Binary and Decimal
 Hexadecimal Notation
14 Digital Logic
 Boolean Algebra
 Gates
15 Digital Logic
 Combinational Circuits
 Sequential Circuit
 Programmable Logic Devices
16 Presentations and Submission of Final Assignment
17 Revision
18 Final Term

Reference Materials:
 Computer Organization and Architecture, Designing For Performance, Ninth Edition
by William Stallings
Course Code:
Title: Artificial Intelligence
Credit Rating: 3
Level: BS
Delivery: Face To Face
Pre-requisites: Data Structures and Algorithms
Pre-Reading
Slides
Material:
Core Text: None
 Overview of main AI topics
 Wide spectrum of subjects (rather than just a few in detail)
Methodology and tools for problem solving
Objectives:  Outlook at AI research
 Propaedeutic to applications and advanced courses in problem
solving, decision systems, planning, robotics, data mining,
collective intelligence, etc

Intended Learning Outcomes:

1. Describe what Data Science is and the skill sets needed to be a data scientist.
2. Apply EDA and the Data Science process in a case study.
3. Comprehend the fundamental constructs of Python programming language.
4. Apply basic machine learning algorithms to solve real world problems of moderate
complexity.

Key Transferable Skills

 Learn about principles of data science, like statistics, mathematics, and computer
science.
 Discuss the technical skills necessary for working with data, including programming
languages.
  Apply the algorithms for solving problems.
 Learn how to explore and visualize data effectively.

Curriculum Contents:
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: 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, ideas and tools for data
visualization; Data Science and Ethical Issues: Discussions on privacy, security, ethics, Next-
generation data scientists.
Session Topics
NO
1 Introduction
 What is data Science
 Big Data
 Data Science Hype
2 Datafication
 Current landscape of perspectives
 Skill sets needed
3 Statistical Inference
 Populations
 samples
 Assignment-1
4 Statistical modeling
 probability distributions
 fitting a model
 Intro to Python
5 Exploratory Data Analysis
 The Data Science Process
 Assignment-2
6 Basic Machine Learning Algorithms
 Linear Regression
 k-Nearest Neighbors (k-NN)
 Quiz-1
7 Basic Machine Learning Algorithms
 k-means
 Naive Bayes
 Presentation-1
8 Revision
9 MID TERM
 10 Feature Generation and Feature Selection
11 Dimensionality Reduction
 Singular Value Decomposition
 Principal Component Analysis
 Assignment-3
12 Mining Social-Network Graphs
 Social networks as graphs
 Clustering of graphs
 Direct discovery of communities in graphs
 Partitioning of graphs
 Neighborhood properties in graphs
13 Data Visualization
 Basic principles
 Ideas and tools for data visualization
14 CFGs and PDA
 Nondeterministic PDA
 PDA corresponding to CFG
 CFG corresponding to PDA
15 Data Science and Ethical Issues
 Discussions on privacy
 security
 ethics
 Next-generation data scientists
 Quiz-2
16 Presentation-2
17 Revision
18 Final Term
Reference Materials:
 Foundations of data science, Blum, A., Hopcroft, J., & Kannan, R., Vorabversion
eines Lehrbuchs, 2016.
 An Introduction to Data Science, Jeffrey S. Saltz, Jeffrey M. Stanton, SAGE
Publications, 2017.
 Python for everybody: Exploring data using Python 3, Severance, C.R., CreateSpace
Independent Pub Platform. 2016.
 Doing Data Science, Straight Talk from the Frontline, Cathy O'Neil and Rachel
Schutt, O'Reilly. 2014.
 Data Science and Big Data Analytics: Discovering, Analyzing, Visualizing and
Presenting Data, EMC Education Services, John Wiley & Sons, 2015.
Course Code:
Title: Calculus II
Credit Rating: 03
Level: BS
Delivery: Face To Face
Tutor/s: Ms. Ayesha Afzal
Pre-requisites: None
Pre-Reading
Slides, Board
Material:
Core Text: None
 To provide foundation on functions of two and three variables
and using calculus to analyze the geometry of curves and
surfaces.
 To primarily concerned with developing the student’s
Objectives: understanding of the concepts of calculus and providing
experience with its methods and applications.
 To emphasizes a multi representational approach to calculus,
with concepts, results and problems being expressed
geometrically, numerically, analytically and verbally.

Intended Learning Outcomes:

1. Students should be able to work with functions represented in a variety of ways:
graphical, numerical, or verbal. They should understand the connections among
these representations.
2. Students should understand the meaning of the partial derivative in terms of a rate
of change and local linear approximation and should be able to use 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.
4. Students should understand the relationship between the derivative and the definite
integral as expressed in both parts of the Fundamental Theorem of Calculus.
Key Transferable Skills
 Students should be able to model a written description of a physical situation with a
function, a differential equation, or an integral.
 Students should be able to use technology to help solve problems, experiment,
interpret results, and verify conclusions.
 Students should be able to determine the reasonableness of solutions, including sign,
size, relative accuracy, and units of measurement.
 Students should develop an appreciation of calculus as a coherent body of knowledge
and as a human accomplishment.

Curriculum Contents:
Function of several variables, Domain and ranges, Limits for function of two variables,
Continuity for two variables, Partial derivatives, The chain rule for function of two variables,
Double and triple integrals, Double integral over general regions, Triple integral over general
regions, Limit by substitution, Extreme values of function, Absolute extreme values, Local
extreme values, Increasing and decreasing functions, First derivative test for local extrema,
Point of inflection, Second derivative test for local extrema, Directional Derivatives in the
plane, Properties of Directional Derivatives, Gradients, The Tangent Plane and Normal lines

Session Topics
NO
1  Function of several variables
 Domain and ranges
2  Limits for function of two variables
 Continuity for two variables
3  Partial derivatives
 The chain rule for function of two variables
 Assignment-1
4  Double and triple integrals
5  Double integral over general regions
 Assignment-2
6  Triple integral over general regions
 Quiz-1
7  Limit by substitution
 Presentation-1
8 Revision
9 MID TERM

10  Extreme values of function

 Absolute extreme values
11  Local extreme values
 Increasing and decreasing functions
 Assignment-3
12  First derivative test for local extrema
  Point of inflection
13  Second derivative test for local extrema
14  Directional Derivatives in the plane
 Properties of Directional Derivatives
 Quiz-2
15  Gradients
 The Tangent Plane and Normal lines
16 Presentation-2
17 Revision
18 Final Term
Reference Materials:
 Calculus and Analytical Geometry, Swokowski Olinick. Pence. 1994. 6th edition.
 Calculus, 7 th edition.2002. John Wiley and Sons.
 Calculus, William, E. Boyce Richard, C. Diprima. John Wiley & Sons.
 Calculus and Analytical Geometry 10th edition. Thomas, F. John Wiley and Sons.
Course Code:
Title: Calculus and Analytic Geometry
Credit Rating: 03
Level: BS
Delivery: Face To Face
Pre-requisites: None
Pre-Reading
Slides, Board
Material:
Core Text: None
 To introduce students the fundamental concepts of limit,
continuity, differential and integral calculus of functions of
one variable.
 To primarily concerned with developing the students’
understanding of the concepts of calculus and providing
Objectives:
experience with its methods and applications.
 To emphasizes a multi representational approach to calculus,
with concepts, results and problems being expressed
geometrically, numerically, analytically and verbally.

Intended Learning Outcomes:

1. Students should be able to work with functions represented in a variety of ways:
graphical, numerical, or verbal. They should understand the connections among
these representations.
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 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.
4. Students should understand the relationship between the derivative and the definite
integral as expressed in both parts of the Fundamental Theorem of Calculus

Key Transferable Skills

 Students should be able to model a written description of a physical situation with a
function, a differential equation, or an integral.
 Students should be able to use technology to help solve problems, experiment,
interpret results, and verify conclusions.
 Students should be able to determine the reasonableness of solutions, including sign,
 size, relative accuracy, and units of measurement.
 Students should develop an appreciation of calculus as a coherent body of knowledge
and as a human accomplishment.

Curriculum Contents:
Functions, Piecewise-Defined Functions, Increasing and decreasing functions, Even and Odd
functions, Common Functions, Composite Functions, Limit of a Function and Limit Laws,
Limit of polynomials and Limit of trigonometric functions, Limit by substitution, Continuity,
Derivative as Slope of Tangent to a Curve and as Rate of Change, Applications, Derivative by
definition, Derivative by techniques, Applications of derivatives, Derivative of trigonometric
functions, Derivative by chain rule and applications

Session Topics
NO
1 Functions
2 Piecewise-Defined Functions, Increasing and decreasing functions, Even and
Odd functions
3 Common Functions
Assignment-1
4 Composite Functions
5 Limit of a Function and Limit Laws
Assignment-2
6 Limit of polynomials and Limit of trigonometric functions
Quiz-1
7 Limit by substitution
Presentation-1
8 Revision
9 MID TERM

10 Continuity
11 Derivative as Slope of Tangent to a Curve and as Rate of Change, Applications
Assignment-3
12 Derivative by definition, Derivative by techniques
13 Applications of derivatives
14 Derivative of trigonometric functions
Quiz-2
15 Derivative by chain rule and applications
16 Presentation-2
17 Revision
18 Final Term
Reference Materials:
 Calculus and Analytical Geometry, Swokowski Olinick. Pence. 1994. 6th edition.
 Calculus, 7 th edition.2002. John Wiley and Sons.
 Calculus, William, E. Boyce .Richard, C. Diprima. John Wiley & Sons.
 Calculus and Analytical Geometry 10th edition. Thomas, F. John Wiley and Sons

Course Code:
Title: Cloud Computing
Credit Rating: 03
Level: MCS
Delivery: Face To Face
Pre-requisites: None
Pre-Reading
Basic knowledge of computer science and networking concepts.
Material:
Core Text: None
 To Understand the fundamental concepts, principles, and
historical evolution of cloud computing.
 To Differentiate between Infrastructure as a Service (IaaS),
Platform as a Service (PaaS), and Software as a Service
Objectives: (SaaS), and evaluate use cases for each.
 To apply cloud computing knowledge to solve real-world IT
problems and make informed decisions about cloud adoption
and management.

Intended Learning Outcomes:

1. Define and explain the concept of cloud computing, its historical evolution, and its
impact on modern IT infrastructure.
2. Differentiate between Infrastructure as a Service (IaaS), Platform as a Service (PaaS),
and Software as a Service (SaaS), and provide examples of each.
3. Apply cloud computing knowledge to solve real-world IT problems, make informed
decisions, and troubleshoot cloud-related issues.

Key Transferable Skills

 Students learn to analyze complex IT problems, identify issues, and develop effective
solutions, which can be applied to a variety of technical challenges. Students learn to
adapt to new technologies, tools, and trends, making them versatile professionals in a
rapidly evolving industry.

Curriculum Contents:
Datacenter Architectures, Cloud Stack , Technology Trends, Consistency, Availability,
Partitions, Cluster File Systems, Data-flow Computation Frameworks, Key-Value Store and
Interactive Query Systems, Big Data in the Clouds, Geographic distributed Storage,
Programming Languages for the Cloud, Dbases in the Cloud, In-Memory Frameworks,
Google file system, Hadoop file system, Map Reduce, OSes and Clouds Networking:
topologies, Networking: Traffic Management, Networking: Transport Protocol
Improvements, Security, Scheduling and Resource Management in clouds, Software Level
Agreements.

Session Topics
NO
1 Introduction to Cloud Computing
 Definition and Concepts
 Historical Evolution
 Advantages and Disadvantages
 Service Models (IaaS, PaaS, SaaS)
 Deployment Models (Public, Private, Hybrid, Community)

2 Cloud Infrastructure
 Virtualization and Hypervisors
 Data Centers and Server Farms
 Cloud Resource Allocation and Management
 Scalability and Elasticity
 Cloud Service Providers (e.g., AWS, Azure, Google Cloud)
3 Cloud Storage and Databases
 Cloud Storage Services (e.g., Amazon S3)
 Cloud Databases (e.g., AWS RDS, Azure SQL Database)
 Data Backup and Recovery in the Cloud
 Data Security and Compliance in Cloud Storage
Assignment-1
4 Virtual Machines in the Cloud
 Virtual Machines (VMs) in Cloud
 Creating and Managing VMs
 Orchestration and Scaling
5 Virtual Machines in the Cloud
 Orchestration and Scaling
 Containerization (Docker, Kubernetes)
 Server less Computing (AWS Lambda)
Assignment-2
6 Cloud Networking
 Networking Fundamentals in Cloud
 Virtual Private Cloud (VPC)
 Load Balancing and Content Delivery
Quiz-1
7 Cloud Networking
 Load Balancing and Content Delivery
 Network Security in Cloud (Firewalls, Security Groups)
 Hybrid Cloud Networking

8 Revision
9 MID TERM

10 Cloud Security
 Cloud Security Challenges
 Identity and Access Management (IAM)
 Encryption and Key Management
 Compliance and Auditing
 Best Practices for Securing Cloud Resources
11 Cloud Application Development
 Developing Applications for the Cloud
 Serverless Computing and FaaS
 Microservices Architecture
 DevOps and CI/CD Pipelines in Cloud
 Cloud-native Development Tools
12 Cloud Cost Management
 Cloud Cost Models
 Cost Estimation and Monitoring
 Cost Optimization Strategies
 Billing and Pricing Models
 Budgeting and Governance
13 Cloud Migration and Management
 Strategies for Cloud Migration
 Managing Cloud Resources
 Cloud Resource Monitoring and Optimization
 Disaster Recovery in the Cloud
14 Emerging Trends and Future of Cloud Computing
 Edge Computing
 Quantum Computing and Cloud
15 Emerging Trends and Future of Cloud Computing
 Artificial Intelligence and Machine Learning in Cloud
 IoT and Cloud Integration
Quiz-2
16 Presentation
17 Revision
18 Final Term
Reference Materials:
 Handbook of Cloud Computing, BorkoFurht. Springer (2010) or Latest Edition
 Cloud Computing: SaaS, PaaS, IaaS, Virtualization, Business Models, Mobile,
Security, and More, Kris Jamsa Jones & Bartlett Publishers,(2012) or Latest Edition
 Cloud Computing and SOA: Convergence in your enterprise, David Linthicum (2009),
Addison Wesley (Latest Edition).
 Distributed File Systems: Hadoop, Lustre, Google File System, Andrew File System,
Off system, Distributed File System”, Ceph. General books LLC. (2010) or Latest
Edition.
 Map Reduce Design Patterns, Donald Miner and Adam Shook. O’ Reillyand Sons,
(2012) or Latest Edition
 "Cloud Computing: Concepts, Technology & Architecture" by Thomas Erl, Ricardo
Puttini, and Zaigham Mahmood

Course Code:
Title: Communication & Presentation Skill
Credit Rating: 03
Level: BS
Delivery: Face To Face
Pre-requisites: None
Pre-Reading
Slides
Material:
Core Text: None
 To acquire knowledge & awareness of effective
communication
 To communicate effectively (Verbally & Non-Verbally)
Objectives:
 To learn skills & techniques for effective presentation
technically
 To learn communication techniques and style

Intended Learning Outcomes:

Students who successfully complete the course units and assignments will be able to do the
following:
1. Use appropriate, effective communication and presentation skills across setting,
purpose and audience confidently
2. Communicate fluently
3. Communicate vocally (written, using digital media, visual, using logos and non-
verbally using body language, gestures, pitch and tone)
4. Professionally will be able to apply for job and promotion by demonstrating good
 communication skills
5. Personally, improve relationship by helping to understand others and to be understood

Key Transferable Skills

 Interpersonal communication skills
 Interactive communication skills
 Presentation styles & techniques

Session Topics
NO
1  Introduction to Communication Skills
2  Types of communication skills
 Communication Process
 Barriers in Communication
3  7c's of Effective Communication
4  Four Ways of Communication
5  Importance of Body Language in Communication Skill
6  Written communication
 Types of Written Communications
 (Creative Writing Activity)
7  Quiz
8 Revision
9 MID TERM

10  Resume writing, CV Writing & Bio Data

 Difference between cv & resume
11  Presentation Skills; Presentation Designing
12  Effective presentation skills; Presentation Development
13  Presentation techniques (Technology & Visual Presentation)
14  Role of effective communication for professional growth
15  Listening Skills
16  Presentations
17 Revision
18 Final Term
Reference Materials:
 Foundations of data science, Blum, A., Hopcroft, J., & Kannan, R., Vorabversion
eines Lehrbuchs, 2016.
 An Introduction to Data Science, Jeffrey S. Saltz, Jeffrey M. Stanton, SAGE
Publications, 2017.
 Python for everybody: Exploring data using Python 3, Severance, C.R., CreateSpace
Independent Pub Platform. 2016.
 Doing Data Science, Straight Talk from the Frontline, Cathy O'Neil and Rachel
Schutt, O'Reilly. 2014.
 Data Science and Big Data Analytics: Discovering, Analyzing, Visualizing and
 Presenting Data, EMC Education Services, John Wiley & Sons, 2015.

Course Code:
Title: Compiler Construction
Credit Rating: 03
Level: BS
Delivery: Face To Face
Pre-requisites: None
Pre-Reading
Material:
Core Text: None
 To understand the basic techniques used in compiler
construction such as lexical analysis, top-down, bottom-up
parsing, context-sensitive analysis, and intermediate code
generation
 To understand the basic data structures used in compiler
Objectives:
construction such as abstract syntax trees, symbol tables,
three-address code, and stack machines
 To design and implement a compiler using a software
engineering approach 4. Use generators (e.g. Lex and Yacc)

Intended Learning Outcomes:

1. To teach students the basic concepts of compilers, their components and how they
work together
2. To get lexical analyzer and syntax analyzer implemented of any programming
language
3. will have the knowledge of the significant details of a number of important techniques
commonly used
4. The language features raise challenges for compiler builders are also introduce in this
course.
Key Transferable Skills
 Students should understand the overall structure of a compiler, and will have the
knowledge of the significant details of a number of important techniques commonly
used in compiler and different phases of compiler.

Curriculum Contents:
Introduction to interpreter and compiler. Compiler techniques and methodology; Organization
of compilers; Lexical and syntax analysis; Parsing techniques. Types of parsers, top-down
parsing, bottom-up parsing, Type checking, Semantic analyser, Object code generation and
optimization, detection and recovery from errors

Session Topics
NO
1 Overview of Compilers, Compilation Process, Phases of Compiler, Cousins of
compiler
2 Overview and Role of Lexical Analyzer, Tokens, Lexemes, Patterns,
Specification of tokens, recognition of tokens
3 Finite automata, NFA, DFA, Conversion from a regular expression to an NFA,
NFA problems, NFA & DFA Comparison, Design of a Lexical Analyzer.
4 Overview, Symbol Table organization, Classification of the symbol table,
symbol table operations, working, implementation.
5 Role of Parser, Context-Free grammars, writing a grammar, Types of Parsing,
Top-down parsing, Bottom-up parsing
6 Backtracking, Recursive Descent parsing, problems with RD parsing,
Predictive parsing, Transition diagrams for predictive parsers, Non-Recursive
Predictive Parsing
7 Practical Examples and Parser Generators
8 Overview of Type Checking, specification of a simple type checker,
Equivalence of type expressions

 Revisions

9 MID TERM

10 Type conversions, type rules, type constructors, Overloading of functions and

operators, polymorphic functions
11 A simple type checker generator
12 Intermediate languages, declarations, Three address code instructions, and their
representations
13 Intermediate Code Generator examples
14 Overview, the principal sources of code optimization, optimization of basic
blocks, loops, code improvement transformations.
15 Role of a code generator, Issues in the design of a code generator, Runtime
storage management, simple code generator
16 Detection of syntax errors by compilers and their recovery mechanism
17 Overview of principles of programming languages. Criteria for selecting
 programming languages, Representing concurrency and analyzing concurrent
designs
18 Final Term

Reference Materials:
 Compilers: Principles, Techniques, and Tools, A. V. Aho, R. Sethi and J. D. Ullman,
Addison-Wesley, 2nd ed., 2006
 Modern Compiler Design, D. Grune, H. E. Bal, C. J. H. Jacobs, K. G. Langendoen,
John Wiley, 2003.
 Modern Compiler Implementation in C, A. W. Appel, M. Ginsburg, Cambridge
University Press, 2004.

Course Code:
Title: Computer Architecture and Assembly Language
Credit Rating: 03
Level: BS
Delivery: Face to face
Pre-Requisites None
Teaching Lectures, Written Assignments, Project, Report Writing
Methodology
Course Assessment Midterm exam, Final Exam, Assignments
Reference Materials
Pre-Reading Slides
Material
Core Text None
 To provide the students with an understanding of the various
levels of studying computer architecture, with emphasis on
Aims: instruction set level and register transfer level.
 To prepares the students to use basic combinational and
sequential building blocks to design larger structures like
Arithmetic Logic Units, memory subsystems, I/O subsystems
etc.

Intended Learning Outcomes:

1. Understand Instruction Set Architecture design and Central Processing Units of the
RISC (Reduced Instruction Set Computers) and the CISC (Complex Instruction Set
Computers) type
2. Describe the behavior and structure of a computer using RTL (Register transfer
language)
3. Explain Pipelining and instruction level Parallelism
4. Explain the I/O sub systems
5. Understand Magnetic disk drives
 6. Explain the memory module of computer
7. Understand Number Systems and Radix Conversion

Key transferable Skill

 Explain the memory module of computer
 Understand Number Systems and Radix Conversion
 Explain Pipelining and instruction level Parallelism
 Explain the I/O sub systems
 Understand Magnetic disk drives

Curriculum Contents:
Introduction to computer systems: Information is bits + context, programs are translated by other
programs into different forms, it pays to understand how compilation systems work, processors read and
interpret instructions stored in memory, caches matter, storage devices form a hierarchy, the operating
system manages the hardware, systems communicate with other systems using networks; Representing
and manipulating information: information storage, integer representations, integer arithmetic, floating
point; Machine-level representation of programs: a historical perspective, program encodings, data
formats, accessing information, arithmetic and logical operations, control, procedures, array allocation
and access, heterogeneous data structures, putting it together: understanding pointers, life in the real
world: using the gdb debugger, outof-bounds memory references and buffer overflow, x86-64: extending
ia32 to 64 bits, machine-level representations of floating-point programs; Processor architecture: the Y86
instruction set architecture, logic design and the Hardware Control Language (HCL), sequential Y86
implementations, general principles of pipelining, pipelined Y86 implementations.

Session Topics
1 Introduction to the Course
• Basic function unit of the computer
• Basic I/O
2 Bus Organization
• Operational concepts of a computer
• Software (system/Application)
• Caching
• Performance
3 Fetch and Execute
• Registers
• Memory locations and addresses
• Addressing Modes
4 Continue with Addressing Modes
• Indexing and Arrays
• Stack
• Basic I/O
• Programmed I/O
• Memory Mapped I/O
5 Interrupts
• Interrupt driven I/O
 • Interrupt Request
• Interrupt Service Routine
• Enabling and Disabling Interrupts
6 Memory
• Types of Memory
• Memory Hierarchy
• Cache Memory
• Virtual Memory
7
Presentation and Revision
8 Mid-Term Exam

9 Pipelined Processors
• Pipelining concepts and benefits
• Hazards in pipelined processors: data hazards, control hazards
10 Virtual Memory and Paging
• Address translation and page tables
• Page replacement algorithms
11 Input/Output Systems
• I/O interfaces and devices
• Polling, interrupts, DMA in I/O operations
12 Secondary Storage Devices
• Hard disk drives, SSDs, optical drives
• File systems and storage management
13 Multiprocessor Architectures
• Symmetric Multiprocessing (SMP)
• Interconnection networks: buses, crossbars
14 Multicore Processors
• Advantages of multicore architectures
• Programming models for parallel processing
15 Pipelined Processors (Advanced)
• Data hazards: forwarding, stalling
• Control hazards: branch prediction, delay slots
16 Final -Term Exam
Reading Material
 Computer Organization and Embedded System By C Hamacher………6th Edition 2012
 Structured Computer Organization By Andrew S Tanenbaum 5th Edition
Course Code:
Title: Computer Graphics
Credit Rating: 03
Level: BS
Delivery: Face to face
Pre-Requisites None
Teaching Lectures, Written Assignments, Project, Report Writing
Methodology
Course Assessment Midterm exam, Final Exam, Assignments
Reference Materials
Pre-Reading Slides
Material
Core Text None
 To learn basic principles and theories behind computer graphics,
including pixel representation, color models, and geometric
Aims: transformations.
 To explore the hardware components involved in generating and
displaying computer graphics, including GPUs, display devices,
and input devices like graphics tablets.
 To explore advanced topics such as ray tracing, texture mapping,
and global illumination to create photorealistic images and scenes.

Intended Learning Outcomes:

1. Comprehend the structure of modern computer graphics systems
2. Explain the basic principles of implementing computer graphics fundamentals
3. Compare key algorithms for modeling and rendering graphical data
4. Develop design and problem-solving skills with applications to computer graphics
5. Construct interactive computer graphics programs using OpenGL

Key Transferable Skills:

 Creating graphics requires precision and attention to detail. Students learn to spot errors,
artifacts, and inconsistencies in their work, enhancing their overall attention to detail.
 Students explore the ethical aspects of graphics, such as image manipulation and
 representation in media. They develop critical thinking about the ethical implications of
their work.
 Computer graphics is a dynamic field. Students develop the ability to independently
research and learn about new techniques, tools, and trends.

Curriculum Contents:
Fundamental Concepts: forward and backward rendering (i.e., ray-casting and rasterization),
applications of computer graphics: including game engines, cad, visualization, virtual reality,
polygonal representation, basic radiometry, similar triangles, and projection model, use of standard
graphics APIs (see HCI GUI construction); basic rendering: rendering in nature, i.e., the emission
and scattering of light and its relation to numerical integration, affine and coordinate system
transformations, ray tracing, visibility and occlusion, including solutions to this problem such as
depth buffering, painter’s algorithm, and ray tracing, the forward and backward rendering equation,
simple triangle rasterization, rendering with a shader-based API, texture mapping, including
minification and magnification (e.g., trilinear MIP-mapping), application of spatial data structures to
rendering, sampling and anti-aliasing, scene graphs and the graphics pipeline; geometric modeling:
basic geometric.
Sessio Topics
n
1 Introduction to Computer
 History
 Graphics Application
 User Interface
 Simulations
 Interdisciplinary
2 Text and Graphics Modes
 Resolution
 Colors IN VGA
 Line Drawing Techniques
 Circle Drawing Techniques
3 Ellipse and Other Curves
 Algorithm
 Hyperbola
 Filled Area Primitives 1
 Filled Area Primitives 11
 Polygon
4 Mathematical Fundamental’s
 Matrices and Simple Matrix Operations
 2D Transformations 1
 3D Magnitude and Direction
 Homogeneous Coordinates
5 Graphics System
 Videos Display Devices
 Clipping 1
 Clipping 11
6 3-D Concepts
 3D Model and Lighting Effects
 3-D Transformations-I
 3-D Transformations-II
7 Quiz and Revision

8 Mid-Term Exam

9 Triangles and Planes

 Textured Triangle
 Clamping Color Values
 Scaling Color Values by Intensity
Negative Color and Dark Lights
10 Mathematics of Lightning and Shading
 Light Types and Shading Models
 Parallel Lights (or Directional Lights)
The Brute Force Approach
11 Traditional 3D Hardware-Accelerated Lighting Models
 Ambient Light
 Diffuse Light
The Phong’s Specular Light Equation
12 Introduction to OpenGL
 Main purpose of OpenGL
 Physically Based Illumination
Refraction
13 OpenGL Programming II
 glMatrixMode
 glLoadIdentity
 Parametric Equations of a Curve
Parametric Equations of a Curve
14 The Tangent Vector
 Bezier Curves
 A Geometric Construction
Building Polygonal Models of Surfaces
15 Revisions and Presentations
16 Final -Term Exam
Course Code:
Title: Computer Networks and communication
Credit Rating: 4 (3+1)
Level: BSCS
Delivery: Face To Face
Pre-requisites: None
Pre-Reading Intro to System hardware software LAN MAN WAN and basic
Material: terminologies of networks.
Core Text: N/A
 To provide students with a solid foundation in the fundamental
concepts of computer networking, including protocols,
topologies, and network models.
 To familiarize students with the various hardware and software
components of computer networks, such as routers, switches,
firewalls, and operating systems.
 To teach students how to design and implement network
infrastructures, taking into consideration scalability, security,
Objectives: and performance requirements.
 To explore security threats and best practices for securing
computer networks, including encryption, access control, and
intrusion detection.
 To introduce students to commonly used networking protocols
such as TCP/IP, HTTP, DNS, and DHCP, and their roles in data
communication.
 To cover wireless network technologies, including Wi-Fi,
cellular networks, and their configurations.

Intended Learning Outcomes:

1. Upon successful completion of a computer network and communication course,
students should be able to:
2. Evaluate different network architectures and choose the appropriate one based on
specific requirements.
3. Plan, design, and configure computer networks, considering factors like scalability,
redundancy, and security.
4. Identify and resolve common network problems using diagnostic tools and techniques.
5. Apply security measures to protect data and infrastructure, including firewalls,
encryption, and access controls.
6. Explain the functions and interactions of key network protocols and their role in data
 transmission.
7. Administer network services such as DNS, DHCP, and web hosting.
8. Configure and secure wireless networks, including Wi-Fi and cellular networks.

Key Transferable Skills

 Learned while pursuing a computer networking career includes working with
Microsoft Windows, Linux and UNIX operating systems. Valuable skills also include
knowing how computers work, how to build computer systems, techniques needed to
install computer components and protocol used in upgrading systems
 Proficiency in troubleshooting network issues and solving communication problems
equips you with strong problem-solving skills that can be applied to various contexts.
This ability to analyze and resolve issues is valuable in any job.
 Understanding network protocols, hardware, and software gives you a technical
foundation that can be applied across different industries and technologies. It
demonstrates your adaptability to new systems and tools
 In a globalized world, understanding how networks connect people and systems
worldwide can enhance your global awareness and cross-cultural communication
skills.

Curriculum Contents:
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, 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. Virtual private network (VPN s), Wireless and Mobile Networking,
Wireless network topologies Mobile network and cellular commutation, Mobile device
management and security.

Session Topics
NO
1 Introduction to Computer Networks
 Definition and importance of computer networks
 Network classifications (LAN, WAN, MAN)
 Network topologies and models (client-server, peer-to-peer)
2 Network Architecture and OSI Model
 OSI model layers and their functions
 TCP/IP protocol su Network Architecture and OSI Model
 OSI model layers and their functions
 TCP/IP protocol suite
 Comparison of OSI and TCP/IP models
 Comparison of OSI and TCP/IP models
3 Physical Layer
 Transmission media (copper, fiber, wireless)
 Signal encoding and modulation
  Error detection and correction
4 Data Link Layer
 Framing and addressing
 Error detection and correction at the data link layer
 Ethernet and LAN technologies
5 Network Layer
 IP addressing and sub netting
 Routing algorithms and protocols (e.g., RIP, OSPF)
 Internet Control Message Protocol (ICMP)
Assignment-1
6 Transport Layer
 Introduction to transport layer protocols (TCP and UDP)
 Flow control and error handling
 Socket programming
Quiz-1
7 Application Layer
 Common application layer protocols (HTTP, FTP, SMTP)
 DNS (Domain Name System)
 Network services and applications

8 Revision
9 MID TERM

10 Network Security
 Threats and vulnerabilities in computer networks
 Cryptography and encryption
 Network security protocols (e.g., SSL/TLS, IPsec)

11 Wireless and Mobile Networks
 Wireless communication principles
 Mobile IP
 4G and 5G networks
12 Network Management and Troubleshooting
 Network monitoring and management tools
 Troubleshooting network issues
 Network performance optimization
13 Emerging Network Technologies
 Virtualization and cloud computing
 Software-Defined Networking (SDN)
 Internet of Things (IoT) and its impact on networks
 Assignment 2
14 Network Security
 Network security fundamental
 cryptography and encryption
 Virtual private network (VPN s)
15 Quiz-2
 16 Presentation
17 Revision
18 Final Term

Reference Materials:

1. Computer Networking: A Top-Down Approach Featuring the Internet, 6th edition by James
F. Kurose and Keith W. Ross
2. Computer Networks, 5th Edition by Andrew S. Tanenbaum
3. Data and Computer Communications, 10th Edition by William Stallings
4. Data Communication and Computer Networks, 5th Edition by Behrouz A. Forouzan
Course Code:
Title: Computer Organization & Assembly Language Lab
Credit Rating: 03 (2+1)
Level: BS
Delivery: Practical
Pre-requisites: None
Pre-Reading
Slides, Computer
Material:
Core Text: None
 To introduced students to the basic concept and issues in
managing the hardware.
 To understand how compilation systems work.
 To enable them to prepare a program by using assembly
Objective:
language.
 To comprehend the structure of machine-level representations
of floating-point programs.

Intended Learning Outcomes:

 Acquire the basic knowledge of computer organization, computer architecture and
assembly language.
 Analyze techniques for user centered design for a medium sized software.
 Understand the concepts of basic computer organization, architecture, and assembly
language techniques.
 Solve the problems related to computer organization and assembly language.

Key Transferable Skills

 Command on Irvine_6th_Edition_VS2012.
 Learning about the structure of machine-level representations.
 Solve the problems related to computer organization and assembly language.
 Learning the usability of a software in Low Level language.
Curriculum Contents:
Introduction to computer systems: Information is bits + context, programs are translated by
other programs into different forms, it pays to understand how compilation systems work,
processors read and interpret instructions stored in memory, caches matter, storage devices
form a hierarchy, the operating system manages the hardware, systems communicate with
other systems using networks; Representing and manipulating information: information
storage, integer representations, integer arithmetic, floating point; Machine-level
representation of programs: a historical perspective, program encodings, data formats,
accessing information, arithmetic and logical operations, control, procedures, array allocation
and access, heterogeneous data structures, putting it together: understanding pointers, life in
the real world: using the gdb debugger, out-of-bounds memory references and buffer
overflow, x86-64: extending ia32 to 64 bits, machine-level representations of floating-point
programs; Processor architecture: the Y86 instruction set architecture, logic design and the
Hardware Control Language (HCL), sequential Y86 implementations, general principles of
pipelining, pipelined Y86 implementations

Session Topics
NO
1 Basic introduction to Compiler
2 Basic knowledge ─ ENVIORNMENT SETUP (Irvine_6th_Edition_VS2012)
3 ASSEMBLY ─ BASIC SYNTAX
4 ASSEMBLY ─ MEMORY SEGMENTS, REGISTERS,
5 ASSEMBLY ─ SYSTEM CALLS, ADDRESSING MODES
6 ASSEMBLY ─ VARIABLES, CONSTANTS
7 ASSEMBLY ─ ARITHMETIC INSTRUCTIONS
8 Revision
9 MID TERM

10 ASSEMBLY ─ ARITHMETIC INSTRUCTIONS

11 ASSEMBLY ─ CONDITIONS, LOOPS, NUMBERS
12 ASSEMBLY ─ STRINGS, ARRAYS, PROCEDURES
13 ASSEMBLY ─ RECURSION, MACROS, FILE MANAGEMENT, MEMORY
MANAGEMENT
14 Project-1
15 Project-2
16 Project Presentation
17 Revision
18 Final Term

Reference Materials:
 Computer Systems: A Programmer's Perspective, 3/E (CS:APP3e), Randal E. Bryant and
David R.O' Hallaron, Carnegie Mellon University
 Robert Britton, MIPS Assembly Language Programming, Latest Edition
 Computer System Architecture, M. Morris Mano, Latest Edition
 Assembly Language Programming for Intel- Computer, Latest Edition
Course Code:
Title: Cryptography
Credit Rating: 03
Level: BS
Delivery: Face To Face
Pre-requisites: Information Security
Pre-Reading
Slides
Material:
Core Text: None
 To introduced students to the basic concept and issues in
computer world.
 To identify the symmetric key, asymmetric key algorithm and
hash function.
 To explain cryptography, encryption and there related
Objectives: algorithms.
 To apply various risk management tools for achieving the
hybrid cryptography algorithm.
 To understand the concepts and standards related to wireless
security, IoT and Cloud security.

Intended Learning Outcomes:

1. Analyze techniques and Corporation of Computer Society.
2. Explain context of symmetric key, asymmetric key algorithm and hash function.
3. Apply the hybrid cryptography algorithm.
4. Analyze techniques and Corporation of Computer Society in IoT and Cloud security.

Key Transferable Skills

 Explain key concepts of Cryptography and its tools.
 Discuss symmetric and asymmetric techniques.
 Apply encryption algorithm such as AES, XOR etc.
 Learning about steganography.
 Command on wireless and IoT security algorithm and tools.

Curriculum Contents:
Elementary number theory: Prime numbers, Factoring, Modular arithmetic, Fermat’s &
Euler’s theorems, gcd, Euclid’s algorithm, Discrete logarithm problem Public key encryption:
Public key crypto systems, RSA algorithm, Elliptic Curve cryptography Hash digests:
Properties of cryptographic hash functions, Merkle Damgard construction, md family, sha
family, Digital signatures, sha3 Block ciphers: Block cipher principles, Feistel networks, S
boxes and P boxes, Block cipher modes of operation, DES, 3DES, AES Interactive Proofs,
Zero-Knowledge Proofs, Zero-Knowledge Proofs of Knowledge, Non-Interactive Zero-
Knowledge Proofs, Secure Protocols, Two-Party Secure Computation, Multiparty Secure
Computation, Chosen Cipher text Security
Session Topics
NO
1 Cryptography
 Symmetric Key Algorithms
 Asymmetric Key Algorithms
 Unkeyed Algorithms (e.g. Hash Function)
2 Private key crypto systems
 Advanced encryption standard
 Data encryption standard
 DES, 3DES
 XOR
3 Public key crypto systems
 Diffie-Hellman key exchange
 RSA
 Elliptic curve cryptography
 DSA
 Assignment-1
4 Unkeyed Algorithm
 HMAC
 SHA family
 SHA-3
 SHA-128
 SHA-256
5 Encryption Techniques
 Full Encryption
 Selective Encryption
 Transparent Encryption
 Assignment-2
6 Steganography
 Text Steganography
 Image Steganography
 Audio and Video Steganography
 Network Steganography
 Quiz-1
7 Presentation
8 Revision
9 MID TERM
 10 Block cipher principles
 Feistel networks
 S boxes
 P boxes
 Block cipher modes of operation
11 Cloud & IoT security
 Authentication
 Device authorization
 Two-Factor Authentication
 Data Encryption
12 Firewall and Protocol
 Packet-filtering firewall
 Circuit-level gateways
 Application-level gateways (a.k.a. proxy firewalls)
 Software firewalls
 Hardware firewalls
 Cloud firewalls
13 Digital Signature
 Two-Party Secure Computation
 Multiparty Secure Computation
 Chosen Cipher text Security
14 Social engineering
 Investing, Hooking, Attacking, Exiting
 Usability engineering
 Baiting, Scareware, Pretexting, Phishing, Vishing and Smishing
15 Planning and policy
Quiz-2
16 Presentation
17 Revision
18 Final Term

Reference Materials:
 The course materials will consist of research papers related to each topic.
 Corporate Computer Society by Randall J.Boyle, 3rd Edition
Course Code:
Title: Cyber Security
Credit Rating: 03
Level: BS
Delivery: Face To Face
Pre-requisites: None
Pre-Reading
Slides
Material:
Core Text: None
 To introduced students to the basic concept and issues in
computer world.
 To apply various risk management tools for achieving the
privacy and security.
Objectives:  To identify the malicious software techniques and learn anti-
malicious softwares.
 To understand the concepts and standards related to the
discipline of Information System.

Intended Learning Outcomes:

1. Explain context of Security and different measures for evaluation.
2. Apply Security+ Guide to Network Security Fundamentals.
3. Analyze techniques and Corporation of Computer Society.

Key Transferable Skills

 Explain key concepts of Cyber security such as design principles, cryptography, risk
management, and ethics
 Discuss legal, ethical, and professional issues in Cyber security.
 Apply various security and risk management tools for achieving Cyber security and
privacy.
 Identify appropriate techniques to tackle and solve problems in the discipline of Cyber
security.

Curriculum Contents:
Basic security concepts, Information security terminology, Malware classifications, Types of
malware. Server side web applications attacks. Cross-site scripting, SQL Injection, Cross-site
request forgery, Planning and policy, Network protocols and service models. Transport layer
security, Network layer security, Wireless security, Cloud & IoT security.

Session Topics
NO
1 Basic security concepts:
  Security
 Information security
 Cyber Security
 Differentiate between Information and Cyber Security.
 Information security terminology
2 Malware analysis
 Malware classifications
 Types of Malware
 Viruses, Worms, trojans, and ransomware
 Bots or botnets, adware, spyware, rootkits, fileless malware, and
malvertising.
3 Computer attacks
 Server side web applications attacks
 Hardware attacks
 password attack,
 phishing attack
 SQL injection attack
 Assignment-1
4 Network protocols and service models
 ARP, CSLIP, HDLC, IEEE. 802.3, PPP, X-25, SLIP, ATM, SDLS and
PLIP
 Transmission Control Protocol (TCP) Internet Protocol (IP) User
Datagram Protocol (UDP) Post office Protocol (POP)
5 Cryptography
 Symmetric Key Algorithms
 Asymmetric Key Algorithms
 Unkeyed Algorithms (e.g. Hash Function)
 Assignment-2
6 Encryption Techniques
 Full Encryption
 Selective Encryption
 Transparent Encryption
 Quiz-1
7 Presentation
8 Revision
9 MID TERM

10 Social engineering
 Investing, Hooking, Attacking, Exiting
 Usability engineering
 Baiting, Scareware, Pretexting, Phishing, Vishing and Smishing
11 Steganography
 Text Steganography
 Image Steganography
 Audio and Video Steganography
  Network Steganography
12 Firewall
 Packet-filtering firewall
 Circuit-level gateways
 Application-level gateways (a.k.a. proxy firewalls)
 Software firewalls
 Hardware firewalls
 Cloud firewalls
13 Wireless security
 Wired Equivalent Privacy (WEP)
 Wi-Fi Protected Access (WPA)
 Wi-Fi Protected Access 2 (WPA 2)
 Wi-Fi Protected Access 3 (WPA 3)
14 Cloud & IoT security
 Authentication
 Device authorization
 Two-Factor Authentication
 Data Encryption
15 Planning and policy
Quiz-2
16 Presentation
17 Revision
18 Final Term

Reference Materials:
 Security+ Guide to Network Security Fundamentals by Mark Ciampa, 4th Edition
 Corporate Computer Society by Randall J.Boyle, 3rd Edition
Course Code:
Title: Data Communication
Credit Rating: 03
Level: BS
Delivery: Face to face
Pre-Requisites: None
Pre-Reading Material Slides
Core Text None
 To foster a comprehensive grasp of data communication
principles, protocols, and technologies among students.
Aims:  To connect theoretical concepts to practical applications, enabling
students to design, analyze, and troubleshoot communication
networks effectively.
 To develop strong communication skills to elucidate intricate
concepts, facilitate discussions, and prepare students for effective
collaboration in the field.
Intended Learning Outcomes:
1. Define data communications, name uses of data communications, and list the basic
components of a communications system.
2. Describe other pieces of hardware and software which make networks more efficient,
faster, more secure, easier to use, able to transmit several simultaneous messages, and
able to interconnect with other networks.
3. Learn the basic technical concepts of data communications.
Key Transferable Skills:
 Cultivate the ability to analyze complex communication protocols and network configurations,
fostering strong problem-solving skills applicable to various technical challenges.
 Develop clear and concise communication skills to explain intricate data communication
concepts and share findings with technical and non-technical audiences.

Curriculum Contents:
This course gives you the overview about, What Data Communication actually is? What tools and
techniques you will use to send your data from one place to another. Similarly, all about the
techniques, devices and concepts of data sending and receiving activities will be covered in this
course.
Session Topics
1 Introduction to Data Communication
 Brief History of Communication
 Data Communication System
 Key Data Communication Terminology
 Networks and Why we need Them?
 Communication Tasks
 Protocols
2 Network Models
 LAYERED TASKS
  Sender, Receiver , Carrier, Hierarchy
 THE OSI MODEL
 LAYERS IN THE OSI MODEL
 TCP/IP PROTOCOL SUITE
 ADDRESSING
3 Data and Signals
 ANALOG AND DIGITAL
 Analog and Digital Data
 Analog and Digital Signals
 Periodic and Nonperiodic Signals
4 Data and Signals
 DIGITAL SIGNALS
 Bit Rate
 Bit Length
 Digital Signal as a Composite Analog Signal
 Application Layer
5 DATA RATE LIMITS
 Noiseless Channel: Nyquist Bit Rate
 Noisy Channel: Shannon Capacity
 Using Both Limits
Assignment 01
6 Digital Transmission
 Line Coding
 Line Coding Schemes
 Block Coding
 Scrambling
7 Analog-to Analog Conversion
 Pulse Code Modulation (PCM)
 Delta Modulation (DM)
Revisions and Presentations
8 Mid-Term Exam

9 Analog Transmission
 Aspects of Digital-to-Analog Conversion
 Amplitude Shift Keying
 Frequency Shift Keying
 Phase Shift Keying
 Quadrature Amplitude Modulation
10 Transmission Media
 GUIDED MEDIA
Twisted-Pair Cable
Coaxial Cable
Fiber-Optic Cable
 UN-GUIDED MEDIA
Radio Waves
Microwaves
 Infrared
11 Wired LANs: Ethernet
 IEEE STANDARDS
 STANDARD ETHERNET
 CHANGES IN THE STANDARD
 FAST ETHERNET
 GIGABIT ETHERNET
12 Wireless LANs
 IEEE 802.11
 MAC layers in IEEE 802.11 standard
 CSMA/CA flowchart
 Addressing mechanisms
 BLUETOOTH
13 Data Link Control
 Line Disciplin
 Flow Control

 Hamming Code
Assignment 02
14 Error Control
 Data Link Protocols
 Asynchronous Protocols
 Synchronous Protocols
15 Revisions and Quiz
16 Final Term Exam

Course Code:
Title: Data Mining
Credit Rating: 03
Level:
Delivery: Face to Face
Pre-requisites: Introduction to Database System
Pre-Reading
Material:
Core Text: N/A
 To expand on the student’s understanding and awareness of the
concepts of data mining basics, techniques, and application.
 To introduce the concepts of Data Pre-processing and Summary
Statistics.
Objectives:
 To introduce the concepts of Frequent Item Set Generation,
Associations and Correlations measures.
 To introduce the concepts of Classification, Prediction, and
Clustering algorithms.

Intended Learning Outcomes:

1. Apply preprocessing techniques on any given raw data.
2. Select and apply proper data mining algorithm to discover interesting patterns.
3. Analyze and extract patterns to solve problems and point out how to deploy solution.
4. Evaluate systematically supervised, semi supervised and unsupervised models and
algorithms with respect to their accuracy.
Key Transferable Skills
 Understanding and awareness of the concepts of data mining basics, techniques, and
application.
 Analyzing Data Pre-processing and Summary Statistics.
 Analyzing Frequent Item Set Generation, Associations and Correlations measures.
 Applying Classification, Prediction, and Clustering algorithms.
Curriculum Contents:
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 Bae
Classification, K-Nearest Neighbors, Support Vector Machines etc.), Unsupervised
Classification (K Means, K Median, Hieratical and Divisive Clustering, Kohonan Self
Organizing maps), outlier & anomaly detection, Web and Social Network Mining, Data
Mining Trends and Research Frontiers. Implementing concepts using Python

Session Topics
NO
1 Concepts of Data mining
2 Data Preparation Techniques: outlier and missing data analysis
3 Data Reduction Techniques
4 Learning methods in Data mining
 Assignment 1
5 Statistical Methods in Data Mining
6 Cluster Analysis
 Quiz-1
7 Hierarchal agglomerative and Naïve Bayesian methods
 Presentation-1
8 Revision
9 MID TERM

10 Decision Trees and Decision Rules

11 Association Rules
 Assignment-2
12 Other Soft Computing Approaches in Data Mining
13 Artificial Neural Networks
14 Fuzzy Logic and Fuzzy Set Theory
 Quiz-2
15 Evolutionary algorithms
 Assignment-3
16 Presentation-2
17 Revision
18 Final Term

Reference Materials:
 Jiawei Han & Micheline Kamber, Jian Pei (2011). Data Mining: Concepts and
Techniques, 3rd Edition.
 Pang-Ning Tan, Michael Steinbach, and Vipin Kumar (2005). Introduction to Data
Mining.
 Charu C. Aggarwal (2015). Data Mining: The Textbook
 D. Hand, H. Mannila, P. Smyth (2001). Principles of Data Mining. MIT Press.

Course Code:
Title: Data Science
Credit Rating: 03
Level: BS
Delivery: Face To Face
Tutor/s: Mr. Ali Asghar
Pre-requisites: None
Pre-Reading
Slides
Material:
Core Text: None
 To provide students with a solid understanding of the
foundational concepts and principles underlying data science,
including statistics, mathematics, and computer science.
 To equip students with the technical skills necessary for
working with data, including programming languages (e.g.,
Objectives: Python, R), data manipulation, and database management.
 To teach students how to explore and visualize data
effectively.
 To foster problem-solving skills by presenting real-world data
challenges.

Intended Learning Outcomes:

1. Describe what Data Science is and the skill sets needed to be a data scientist.
2. Apply EDA and the Data Science process in a case study.
3. Comprehend the fundamental constructs of Python programming language.
4. Apply basic machine learning algorithms to solve real world problems of moderate
complexity.

Key Transferable Skills

 Learn about principles of data science, like statistics, mathematics, and computer
science.
 Discuss the technical skills necessary for working with data, including programming
languages.
 Apply the algorithms for solving problems.
 Learn how to explore and visualize data effectively.

Curriculum Contents:
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: 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, ideas and tools for data
visualization; Data Science and Ethical Issues: Discussions on privacy, security, ethics, Next-
generation data scientists.
Session Topics
NO
1 Introduction
 What is data Science
 Big Data
 Data Science Hype
2 Datafication
 Current landscape of perspectives
 Skill sets needed
3 Statistical Inference
 Populations
 samples
 Assignment-1
4 Statistical modeling
 probability distributions
 fitting a model
 Intro to Python
5 Exploratory Data Analysis
 The Data Science Process
 Assignment-2
6 Basic Machine Learning Algorithms
 Linear Regression
 k-Nearest Neighbors (k-NN)
 Quiz-1
7 Basic Machine Learning Algorithms
 k-means
 Naive Bayes
 Presentation-1
8 Revision
9 MID TERM

10 Feature Generation and Feature Selection

11 Dimensionality Reduction
 Singular Value Decomposition
 Principal Component Analysis
 Assignment-3
12 Mining Social-Network Graphs
 Social networks as graphs
 Clustering of graphs
 Direct discovery of communities in graphs
 Partitioning of graphs
 Neighborhood properties in graphs
13 Data Visualization
 Basic principles
 Ideas and tools for data visualization
 14 CFGs and PDA
 Nondeterministic PDA
 PDA corresponding to CFG
 CFG corresponding to PDA
15 Data Science and Ethical Issues
 Discussions on privacy
 security
 ethics
 Next-generation data scientists
 Quiz-2
16 Presentation-2
17 Revision
18 Final Term

Reference Materials:
 Foundations of data science, Blum, A., Hopcroft, J., & Kannan, R., Vorabversion
eines Lehrbuchs, 2016.
 An Introduction to Data Science, Jeffrey S. Saltz, Jeffrey M. Stanton, SAGE
Publications, 2017.
 Python for everybody: Exploring data using Python 3, Severance, C.R., CreateSpace
Independent Pub Platform. 2016.
 Doing Data Science, Straight Talk from the Frontline, Cathy O'Neil and Rachel
Schutt, O'Reilly. 2014.
 Data Science and Big Data Analytics: Discovering, Analyzing, Visualizing and
Presenting Data, EMC Education Services, John Wiley & Sons, 2015.

Course Code:
Title: Data Structure & Algorithm
Credit Rating: 03
Level: BS
Delivery: Face to face
Pre-Requisites: None
Pre-Reading Slides
Material
Core Text None
 To organize and manipulate data and how to design and
analyze algorithms.
Aims:  To study of data structures and algorithms provides students
with the tools to solve complex problems in a systematic and
efficient manner
 To optimize algorithms and data structures to improve
performance and reduce resource consumption.
Intended Learning Outcomes:
1. Should be able to analyze the time and space complexity of different algorithms and
design new algorithms for specific problems.
2. Should be familiar with common data structures such as arrays, linked lists, trees, and
graphs and understand their properties and usage.
3. Understanding of different algorithmic paradigms such as divide and conquer, dynamic
programming, and greedy algorithms.

Key Transferable Skills:

 Problem-solving
 Logical reasoning
 Analytical skills
 Programming skills
 Collaboration
 Attention to detail

Curriculum Contents:
Arrays, linked lists, stacks, queues, and trees, Sorting, searching, and graph algorithms, Heaps,
hash tables, priority queues, and balanced search trees, Dynamic programming, divide and
conquer, and greedy algorithms, Time and space complexity, Big O notation, and worst-case
and average-case analysis ,Real-world applications of data structures and algorithms in fields
such as computer graphics, artificial intelligence, and machine learning.

Session Topics
1 Introduction to Algorithms and Data Structures
 Static Data Structures
 Searching Algorithms
  Sorting Algorithms
 List implementation through Array
2 Dynamic Data Structures (Linear and Non-Linear)
 Linked List (Linear Data Structure)
 Trees, Graphs, Hashing
3 Algorithm Analysis
 Problem Solving
 Space Complexity
 Time Complexity
 Classifying Functions by Their Asymptotic Growth

4 Pseudo Code and Flow Charts

 Pseudo Code
 Basic elements of Pseudo code
 Basic operations of Pseudo code
 Flow Chart
 Symbols used in flow charts
 Examples

5 List
 List Data Structure
 List operations
 List Implementation
 Array
 Linked List
6 Pointer
 Pointer
 Pointer Variables
 Dynamic Memory Allocation
 Functions
 Quiz-1
7 Revisions and Presentations
8 Mid-Term Exam
Introduction to Searching and Recursion
 External and Internal Searching
 Types of Searching
9
 Recursive Definition
 Recursive Algorithms
 Finding a Recursive Solution
10 Insertion Sort
  Insertion Sort Algorithm
 Time Complexity
 Best case
 Average case
 Worst case
Quick Sort
 Quick Sort Algorithm
11  Time Complexity
 Best case
 Average case
 Worst case
Merge Sort

 Merge Sort
 Merge Sort Algorithm
12  Time Complexity
 Best case
 Average case
 Worst case

Selection Sort

 Selection Sort
 Selection Sort Algorithm
13  Time Complexity
 Best case
 Average case
 Worst case

Linked List Traversal

 Inserting into a linked list involves two steps:
 Find the correct location
 Do the work to insert the new value
14
 We can insert into any position
 Front
 End
 Somewhere in the middle
15 Revisions and Presentations
16 Final -Term Exam
Course Code:
Title: Database Administration and Management
Credit Rating: 3
Level: BS
Delivery: Face to Face
Pre-requisites: Database System
Pre-Reading
Intro to database schemas, Normalization, SQL Quires.
Material:
Core Text: N/A
 To be able to understand fundamental database concepts
 To be familiar with Design conceptual, logical and physical
database schemas using different data models
 To identify functional dependencies and resolve database
Objectives:
anomalies by normalizing database tables
 To use Structured Query Language (SQL) for database
definition and manipulation in any DBMS.

Intended Learning Outcomes:

1. Explain fundamental database management concepts.

2. Design conceptual, logical and physical database schemas using different data models.
3. Identify Transactional processing and Concurrency control
4. Use Structured Query Language (SQL) for database definition and manipulation in any
DBMS

Key Transferable Skills

 Basic skills learned while pursuing a Database systems career includes working with
Relational Database, E-R Diagrams, relational Algebra. Valuable skills also include
knowing how SQL (Structured Query Languages) work, how to use SQL Queries
for searching data in database, how to normalize data in database.

Curriculum Contents:
Introduction to advance data models such as object relational, object oriented. File
organizations concepts, Transactional processing and Concurrency control techniques,
Recovery techniques, Query processing and optimization, Database Programming, Integrity
and security, Database Administration, Physical database design and tuning, Distributed
database systems, Emerging research trends in database systems.

Session Topics
NO
1  Basic database concepts, Database architecture, three level schema
architecture
2  Transactional processing and Concurrency control techniques
3  Data independence, relational data model, attributes, schemas, tuples,
domains
 Assignment-1
4  keys of relations, integrity constraints
 5  Relational algebra, selection, projection, Cartesian product, types of
joins
 Assignment-2
6  Recovery techniques, Database Administration
 Quiz-1
7  keys of relations, Integrity and security
 Presentation-1
8 Revision
9 MID TERM

10  Normalization, functional dependencies, normal forms

11  Entity relationship model, entity sets, attributes
 Assignment-3
12  Distributed database systems, Research trends in database systems
13  Structured Query Language (SQL) Joins and sub-queries in SQL
14  Grouping and aggregation in SQL concurrency control
15  Database backup and recovery, indexes, NoSQL systems
 Quiz-2
16 Presentation-2
17 Revision
18 Final Term

Reference Materials:

 Fundamentals of Database Systems, by Ramez Elmasri and Shamkant Navathe,

Addison Wesley, 5th Edition.
 Database System Concepts by Henry F. Korth and Abraham Silberschatz, 4th edition,
McGraw Hill, 2002, ISBN: 0-07-12268-0

Course Code:
Title: Design and analysis of algorithm
Credit Rating: 03
Level: BS
Delivery: Face To Face
Pre-requisites: None
Pre-Reading
Slides
Material:
Core Text: None
  To explain what is meant by “best”, “expected”, and “worst”
case behavior of an algorithm.
 To identify the characteristics of data and/or other conditions
or assumptions that lead to different behaviors.
Objectives:  To determine informally the time and space complexity of
simple algorithms.
 To use big O, Omega, Theta notation formally to give
asymptotic upper bounds on time and space complexity of
algorithms.

Intended Learning Outcomes:

1. Solve problems using graph algorithms, including single-source and all-pairs shortest
paths, and at least one minimum spanning tree algorithm.
2. Use of the strategies (brute-force, greedy, divide-and-conquer, and dynamic
programming) to solve an appropriate problem.
3. Trace and/or implement a string-matching algorithm.
4. List and contrast standard complexity classes
5. Use big O, Omega, Theta notation formally to give asymptotic upper bounds on time
and space complexity of algorithms.
Key Transferable Skills
 Learn about implementation of string matching algorithm.
 Discuss brute-force, greedy, divide-and-conquer, and dynamic programming.
 Apply the algorithms, including single-source and all-pairs shortest paths.
 Learning about “best”, “expected”, and “worst” case behavior of an algorithm.

Curriculum Contents:
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 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; Hashing; Graph
algorithms, shortest paths, sparse graphs, String matching; Introduction to complexity classes
Session Topics
NO
Introduction of algorithm
 Role of algorithms in computing
1
 Analysis on nature of input
 Size of input
Algorithm Design Techniques
 Properties of Algorithm
2
 Sorting
 Asymptotic notations: Big-O, Big Ω, Big Θ, little-o, little-ω
3 Bubble Sort
 Worst complexity
  Average complexity
 Best complexity
 Space complexity
 Method
 Stable
 Class
 Assignment-1
Selection Sort
 Worst complexity
 Average complexity
 Best complexity
4
 Space complexity
 Method
 Stable
 Class
Insertion Sort
 Worst complexity
 Average complexity
 Best complexity
5  Space complexity
 Method
 Stable
 Class
 Assignment-2
Merge Sort
 Worst complexity
 Average complexity
 Best complexity
6  Space complexity
 Method
 Stable
 Class
 Quiz-1
7 Presentation
8 Revision
9
MID TERM

Quick Sort
 Worst complexity
 Average complexity
 Best complexity
10
 Space complexity
 Method
 Stable
 Class
11 Heap Sort
  Worst complexity
 Average complexity
 Best complexity
 Space complexity
 Method
 Stable
 Class
Counting Sort
 Worst complexity
 Average complexity
 Best complexity
12
 Space complexity
 Method
 Stable
 Class
Radix Sort
 Worst complexity
 Average complexity
 Best complexity
13
 Space complexity
 Method
 Stable
 Class
Shortest paths
14  sparse graphs
 String matching
Introduction to complexity classes
15
Quiz-2
16 Presentation
17 Revision
18 Final Term

Reference Materials:
 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 Tardos,
 Algorithms, (4th edition, 2011), Robert Sedgewick, Kevin Wayne
Course Code:
Title: Discrete Structure
Credit Rating: 03
Level: BS
Delivery: Face to face
Pre-Requisites: None
Pre-Reading Slides
Material
Core Text None
 The key concepts of Discrete Structures such as Sets,
Permutations, Relations, Graphs, and Trees etc.
Objective:  Formal logic proofs and/or informal, but rigorous, logical
 reasoning to real problems, such as predicting the behavior of
software or solving problems such as puzzles.
 Various discrete structures and their relevance within the
context of computer science, in the areas of data structures and
algorithms, in particular.
Intended Learning Outcomes:
1. Understand mathematical logic and apply it in problem-solving.
2. Analyze and manipulate functions to solve problems in combinatory and number theory.
3. Understand the basics of graph theory, including graph terminology, types of graphs,
and graph isomorphism.
4. Apply counting principles, including permutations and combinations.

Key Transferable Skills:

 Analytical thinking and problem-solving.
 Logical reasoning and critical thinking.
 Attention to detail and accuracy in calculations.
 Ability to apply mathematical concepts in real-world situations.
 Effective communication of complex ideas and solutions.
Curriculum Contents:

Mathematical reasoning, propositional and predicate logic, rules of inference, proof by

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

Session Topics
1 Introduction to Discrete Structures
 Discrete Vs Continuous
 Applications of discrete mathematics
 Propositional Logic
 Logic of Compound Statements
 Notations
2 Exclusive OR (XOR)
 Logical Equivalences.
 De Morgan’s laws.
 Tautologies and Contradictions.
 Laws of Logic.
  Conditional propositions.
3 Conditional Propositions.
 Negation, Inverse and Converse of the conditional statements.
 Contra positive.
 Bi conditional statements.
 Necessary and Sufficient Conditions.
4 Basic Logic gates
 Circuits using logic gates
 Boolean Algebra
 Adders
 Reductions of circuits
5 NAND and NOR Gates
 Basics of Boolean Algebra
 Decimal and Binary numbers
 Circuits using Half adders
 Parallel Adder Circuits
6 Predicates and Set Notation
 Universal and Existential Statement
 Translating between formal and informal language
 Universal conditional Statements
 Quiz-1
7 Revisions and Presentations

Statements containing “∀ ” and “∃”

8 Mid-Term Exam

 Nested Quantifiers
 Relations
9  Universal Instantiation statement
 Universal Modus Ponens
 Universal Modus Tollens
 Quantified form of Converse and Inverse error
Fundamental Theorem of Arithmetic
 Divisors
 Prime Numbers
10  Division Algorithm
 Greatest common divisors
 Least Common Multiple
 Relative Prime
Floor and Ceiling
 Properties of Floor and Ceiling Functions
11
 Methods of Proof
 Direct Proofs
12 Relation between Contradiction and Contra-positive
  Mod Functions
 Divisibility and Floor
 Mod Congruence
 Indirect Proofs
 Proof by Contra-positive

Why study set Theory

 Sets
 Operations on sets
13
 Memberships
 Notations
 Venn diagrams

Boolean Algebra and Set theory

 Procedural Versions
14
 Properties of Sets
 Empty Set Properties
15 Revisions and Presentations
16 Final -Term Exam

Course Code:
Title: Distributed System
Credit Rating: 3
Level: BS
Delivery: Face to face
Pre-requisites: Operating System
Pre-Reading Per to per model, Clint server model Topologies and physical
Material: models
Core Text: N/A
Objectives:  To grasp the concept of distributed computing and recognize
the differences between distributed and centralized systems.
 To learn how to design systems that can handle increased
loads and users by distributing resources and tasks across
multiple nodes.
 To design systems that are robust in the face of failures,
 ensuring high availability and fault tolerance.
 To optimize the performance of distributed systems by
minimizing latency, bandwidth usage, and resource
consumption.
 To understand the security challenges in distributed systems
and implement mechanisms to protect against threats such as
unauthorized access, data breaches, and denial of service
attacks.

Intended Learning Outcomes:

 Students should be able to design distributed systems by considering factors such as

scalability, reliability, security, and efficiency.
 Understand the principles of scaling distributed systems horizontally and vertically to
accommodate increasing loads.
 Learn techniques for ensuring fault tolerance, including redundancy, failover, and error
handling.
 Develop the skills to implement communication mechanisms like message queues,
sockets, and remote procedure calls (RPC) in a distributed system.
 Be able to optimize the performance of distributed systems by reducing latency,
improving throughput, and managing resource allocation.
 Understand the security challenges in distributed systems and implement security
measures to protect data and resources.

Key Transferable Skills

 Understanding system architecture principles, including micro services, server less, and
containerization, is crucial for designing scalable and fault-tolerant distributed systems.
 A strong understanding of networking concepts, including TCP/IP, HTTP, DNS, load
balancing, and CDN, is necessary to ensure communication and data transfer between
distributed components.
 Understanding security principles like encryption, authentication, authorization, and
vulnerability management is crucial in protecting distributed systems from threats.
 Knowing how to manage concurrent access to shared resources and implement parallel
processing can help optimize performance in distributed systems.

Curriculum Contents:

Introduction to distributed system ,Architectural models ,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 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, Open Stack, Cilk,
gdb, threads, MPICH, Open MP, Hadoop, FUSE).

Session NO Topics
1 Introduction to Distributed Systems
 What are Distributed Systems?
 Characteristics and challenges of distributed systems Architectural
models: client-server, peer-to-peer, and hybrid
 Examples of distributed systems
2 Communication and Networking
 Socket programming
 Remote Procedure Calls (RPC)
 Message Passing
3 Distributed System Models
 Architectural styles: Monolithic, Layered, Micro services
Distributed computing models: Cloud computing, Grid computing,
4 Cluster computing
 Virtualization and containerization
 Assignment 1
5 Distributed System Design
 Principles of distributed system design
 Fault tolerance and reliability consistency and replication
6 Load balancing and scalability
 Case studies in distributed system design
 Quiz 1
7 Distributed Computing and Processing
 Parallel computing and Map Reduce
 Apache Hadoop and Spark
8 MID TERM
9  Stream processing and real-time analytics
10  Case studies in distributed computing
11 Distributed System Security
 Security challenges in distributed systems
 Authentication and authorization
12  Encryption and data privacy
 Assignment 2
13 Distributed service
 Distributed denial of service (DDoS) attacks and mitigation
Amazon AWS, block chain)
 Emerging trends and technologies in distributed systems (e.g., edge
computing, server less computing)
14  Quiz-2
16 Presentation
17 Final term
Reference Materials:

 Distributed Systems: Principles and Paradigms, A. S. Tanenbaum and M. V. Steen,

Prentice Hall, 2nd Edition, 2007
 Distributed and Cloud Computing: Clusters, Grids, Clouds, and the Future Internet, K
Hwang, J Dongarra and GC. C. Fox, Elsevier, 1st Ed.

Course Code:
Title: Composition and Comprehension English
Credit Rating: 03
Level: BS
Delivery: Face To Face
Pre-requisites: None
Pre-Reading
Slides
Material:
Core Text: None
Objectives:  The importance of English language cannot be denied.
 It enriches our thought and culture and provides us with the
most important international vehicle of expression.
 It 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.

Intended Learning Outcomes:

Students who successfully complete the course units and assignments will be able to:
1. Public speaking, Body Language and introduction to power point presentations.
2. Classroom etiquettes, teacher’s expectations and respecting the opposite gender.
3. Grammar.
4. Organizing your writing and sensory perception in descriptive writing.
Technical Writing.

Key Transferable Skills

 Learn about Public speaking, Body Language
 Learn related to Classroom etiquettes, teacher’s expectations and respecting the
opposite gender
5. Learn about Organizing your writing and sensory perception in descriptive writing.
Technical Writing.

Session Topics
NO
1  Grammar Basic
2  Part of Speech
3  Sentence and its types
 Basic Sentence Structure
4  Phrases
5  Clauses
6  Punctuation
7  Quiz
8 Revision
9 MID TERM

10  Language: Definition; History; Features; Difference from animal's

communicative tool
11  Four basic language skills
12  Paragraph Writing & Rules of Paragraph Writing
13  Common Writing Mistakes
14  Learning strategies
15  Creative Writing Activity
16  Vocabulary Words
17 Revision
18 Final Term
Reference Materials:
 P. C. Wren & H. Martin “High School English Grammar & Composition”
 Colin W. Davis & Andrew J. Watts New Expressway For English 1 (New Edition)
 Diana Hacker. A Writer’s Reference
 Sadat Ali Shah. Exploring The World Of English
 A. J. Thomson and A. V. Martinet. Practical English Grammar

Course Code:
Title: Human Computer Interaction (HCI)
Credit Rating: 03
Level: BS
Delivery: Face to Face
Pre-requisites: None
Pre-Reading
Material:
Core Text:
Objectives:  To introduced students to the basic concept and issues in
interaction and GUI.
 To understand the procedure to designed a well-designed
Graphical User Interface.
 To enable them to prepare an attractive interface which attract
the user.
  To comprehend the structure of modern computer graphics
systems.

Intended Learning Outcomes:

1. Explain context of HCI and different measures for evaluation.
2. Apply the principles of good design for people from the perspective of age and
disabilities.
3. Analyze techniques for user centered design for a medium sized software.
4. Evaluate the usability of a medium size software user interface.

Key Transferable Skills

 Learning about Icon design tools and frameworks
 Command on GUI designing
 Learning the Prototyping tools
 Work with other
 Learning the usability of a software user interface.

Curriculum Contents:
Contexts for HCI, Psychology of usable things, Processes for User-Centered Design, Metrics
and Measures for Evaluation, Usability heuristics and principles of Usability testing, Physical
capabilities, Cognitive and social models for interaction design, Principles of good interaction
design, Accessibility, Principles of GUI, Visual design elements, Data gathering, Task
analysis, Prototyping, Help and user documentation, Internationalization, Usability inspection
methods, Usability testing methods, New Interaction Technologies, Usability in practice,
Visual Design and Typography, Icon Design, Ubiquitous, Augmented and Virtual Reality.

Session Topics
NO
1 Contexts for HCI
 What is Human Computer Interaction?
 Why do you get out of this?
 Why study HCI?
 Seven Stages of Action
2 Old GUIs and Psychology of usable things
 Batch Interface (1945 to 1968)
 Ivan Sutherland 1963
 Douglas Engelbart 1967
 CLIs 1969 to 1983
 GUIs – 1984 to present
3 New Interaction Technologies and Augmented and Virtual Reality
 Auditory Interaction
 Vision Based Interaction
  Multimodal Interaction
 Richard Bolt – 1980
 Ubiquitous Computing
 Augmented reality/ Virtual reality
 Mobile Computing
 Assignment-1
4 Conceptual model of Interaction
 Interface Model
 User Model may be wrong
 Interaction style
 Direct manipulation
 Core Principles of DM
 Comparison three interaction style
5 Prototyping
 Why Prototype?
 Prototype fidelity
 More Dimension of fidelity
 Paper Prototype
 Why Paper?
 Tools for Paper prototyping
 Computer prototype
 More detail mockups
 Prototyping tools
 Assignment-2
6 Interaction Design and Usability
 Why bother with Usability
 What is Interaction designing
 Quiz-1
7 Presentation-1
8 Revision
9 MID TERM

10 Usability heuristics and principles of Usability testing

 How to do Heuristics Evaluation
 Hint for better Heuristic Evaluation
 Evaluating Prototype
11 Cognitive and social models for interaction design
 Cognitive Walkthroughs
 The 3 Questions
 Card Sorting
 Card Sorting Analysis
12 Metrics and Measures for Evaluation-I
 Predictive Evaluation
 GOMS
 Components of GOMS
 Assignment-3
 13 Metrics and Measures for Evaluation-II
 Keystroke Level Model (KLM)
 KLM Analysis
 Estimated Operator Times
14 Icon Design
 Design Icon from various tools
 Assignment-4
15 Quiz-2
16 Presentation-2
17 Revision
18 Final Term

Reference Materials:
 Designing the User Interface: Strategies for Effective Human-Computer Interaction,
Ben Shneiderman and Catherine Plaisant, 6th Ed, Pearson Inc, 2016.
 Designing Interactive Systems: A Comprehensive Guide to HCI, UX and Interaction
Design, Benyon, D. 3rd Ed., Pearson. 2013
 About Face: The Essentials of Interaction Design, Alan Cooper, Robert Reimann,
David Cronin, Christopher Noessel, 4th Ed, Wiley, 2014

Course Code:
Title: Introduction to Communication Technologies
Credit Rating: 4 (3-1)
Level: BS
Delivery: Face to Face
Pre-requisites: None
Pre-Reading
None
Material:
Core Text: None
 To understanding the Concept and tools of Computer
 To understand the role of ICT in different fields
Objectives:  To understand to apply ICT platforms and tools for
different purposes to address basic needs in different
domains of daily, academic and professional.

Intended Learning Outcomes:

 Explain the fundamental concept, components, and scope of ICT.
 Identify uses of various ICT platforms and tools for different purposes.
 Apply ICT platforms and tools for different purposes to address basic
 needs in different domains of daily, academic and professional life.
 Understand the ethical and legal considerations in use of ICT and tools .

Key Transferable Skills

 Students should be able to learn how to use the computer technologies.
 Discuss the pros and cons of these technologies.

Curriculum Contents:
Brief history of Computer, Four Stages of History, Computer Elements, Processor, Memory,
Hardware, Software, Application Software its uses and Limitations, System Software its Importance
and its Types, Types of Computer (Super, Mainframe, Mini and Micro Computer), Introduction to
CBIS (Computer Based Information System), Methods of Input and Processing, Class2. Organizing
Computer Facility, Centralized Computing Facility, Distributed Computing Facility, Decentralized
Computing Facility, Input Devices. Keyboard and its Types, Terminal (Dump, Smart, Intelligent),
Dedicated Data Entry, SDA (Source Data Automation), Pointing Devices, Voice Input, Output
Devices. Soft- Hard Copies, Monitors and its Types, Printers and its Types, Plotters, Computer Virus
and its Forms, Storage Units, Primary and Secondary Memories, RAM and its Types, Cache, Hard
Disks, Working of Hard Disk, Diskettes, RAID, Optical Disk Storages (DVD, CD ROM), Magnetic
Types, Backup System, Data Communications, Data Communication Model, Data Transmission,
Digital and Analog Transmission, Modems, Asynchronous and Synchronous Transmission, Simplex.
Half Duplex, Full Duplex Transmission, Communications, Medias (Cables, Wireless), Protocols,
Network Topologies (Star, Bus, Ring), LAN, LAN, Internet, A Brief History, Birthplace of ARPA
Net, Web Link, Browser, Internet Services provider and Online Services Providers, Function and
Features of Browser, Search Engines, Some Common Services available on Internet.
Session Topics
NO
Introduction to ICT
 Component of ICT
1
 Scope of ICT
 Emerging technologies and future trends
Basic ICT productivity tools
 Search engines
 Formal communication tools
2  Google workspace
 Cloud storage
 Video conferencing
 Social media applications
ICT in education
 Working with learning management system
3  Source of online education courses
 Interactive multimedia and virtual classroom
 Assignment-1
ICT in health and well-being
4  Health and fitness tracking devices and applications
 Telemedicine’s and online health consultations
5 Personal finance and shopping
  Online banking and financial management
 Ecommerce platforms
 Assignment-2
Digital Citizenship and online Etiquette
 Digital Identity and online reputation
6  Netiquette and respectful online communication
 Cyberbullying and online harassment
 Quiz-1
Ethical considerations in use of ICT platforms and tools
7  Intellectual property and copyright
 Content accuracy and integrity
8 Revision
MID TERM
9
Concept of Networking
 Advantages and disadvantages of networking.
10
 Types of networks
 Current trends
Storage Units
 Primary and Secondary Memories,
 RAM and its Types, Cache,
11  Hard Disks, Working of Hard Disk, Diskettes,
 RAID, Optical Disk Storages (DVD, CD ROM),
 Magnetic Types, Backup System
 Quiz-2
Data Communications
 Data Communication Model,
 Data Transmission,
12  Digital and Analog Transmission,
 Modems, Asynchronous and Synchronous Transmission,
 Simplex. Half Duplex, Full Duplex Transmission,
 Communications, Medias (Cables, Wireless),
Word Processing MS-Word
13  Menus: Creating and saving documents, Viewing, Editing, Formatting
 Navigating, Previewing and Printing, Margins and Breaks,
Word Processing MS-Word
 Character and Fonts, Formatting Paragraph,
14
 Header and Footer, Page Numbers and Footnotes,
 Creation of Tables and use of Tools.
Spreadsheet Microsoft Excel
 Concept of Spreadsheet.
 Copying, formatting and isolating Assumptions
15
 Spreadsheet in decision-making.
 Graphs and Charts.
 List and Data management
16 Microsoft Power Point
  Creating, opening and saving presentation.
 Working in different Views.
 Adding and formatting text and paragraphs.
 Making notes Pages and handouts
17 Revision
18 Final Term
Reference Materials:
 Computer Applications in Business Management, Fazal Ahmed 2016
 Exploring Microsoft Office 2016 - Volume 1, MaryAnne Poatsy, Cynthia Krebs, Amy
Rutledge – 2016
 Charles S. Parker, Understanding Computers: Today and Tomorrow, Course
Technology, 25 Thomson Place, Boston, Massachusetts 02210, USA 2.
 Livesley, Robert Kenneth. An introduction to automatic digital computers. Cambridge
University Press, 2017.
 Zawacki-Richter, Olaf, and Colin Latchem. "Exploring four decades of research in
Computers & Education." Computers & Education 122 (2018): 136-152.
 Sinha, Pradeep K., and Priti Sinha. Computer fundamentals. BPB publications, 2010.
 Goel, Anita. Computer fundamentals. Pearson Education India, 2010.

Course Code:
Title: IT Infrastructure
Credit Rating: 3
Level: BS
Delivery: Face to Face
Pre-requisites: None
Pre-Reading
None
Material:
Core Text: N/A
 To develop a comprehensive knowledge of the functionality of
networking hardware;
 To acquire the skills to solve business problems that require IT
Objectives: solutions
 To develop the competency to investigate inter-organization
and intra-organization communications problems and propose
a viable technology solution

Intended Learning Outcomes:

1. Analyze a business problem and propose an IT enabled solution.
2. Explain the principles underlying layered systems architecture and their application to
both computers and networks.
3. Distinguish the core elements of an IT infrastructure solution, such as clients, servers,
other network devices, wired and wireless network links, systems software, and
 specialized security devices.
4. Examine the principles underlying operating systems and virtual networks and propose
a network operating system given a business scenario.
5. Use practical examples to demonstrate how protocols are used to enable
communication between computing devices connected to each other.
6. Configure an IT infrastructure solution for a small organization, including a network
based on standard technology components, servers, security devices, and several
different types of computing clients.
7. Apply the core concepts underlying IP networks to solve simple network design
problems, including IP subnetting.
8. Illustrate the role of the emergent cloud computing & IoT technologies in business
today.
9. Write about the opportunities that virtual computing service provision models, such as
Virtual Machines and Virtual Networks, create for organizations

Key Transferable Skills

 Basics of IT infrastructure how IT infrastructure components (servers, datacenters,
operating systems) are organized into infrastructure solutions in different
organizational environments. To create an virtual environment (virtual machines,
virtual network) in an organization .

Curriculum Contents:
Definition of IT Infrastructure, Non-functional Attributes, Availability Concepts, Sources of
Unavailability, Availability Patterns. Performance. Security Concepts. Data centres. Servers:
Availability, Performance, Security. Networking: Building Blocks, Availability, Performance,
Security. Storage: Availability, Performance, Security. Virtualization: Availability,
Performance, Security. Operating Systems: Building Blocks, Implementing Various OSs, OS
availability, OS Performance, OS Security. End User Devises: Building Blocks, Device
Availability, Performance, Security. IT Infrastructure Management. Service Delivery
Processes. Service Support Processes. Ethics, Trends, organizational and technical issues
related to IT infrastructure.

Session Topics
NO
1  Definition of IT Infrastructure, Non-functional Attributes
2  Availability Concepts, Sources of Unavailability, Availability Patterns.
Performance. Security Concepts
3  Data centers
 Assignment-1
4  Servers: Availability, Performance, Security
5  Virtualization: Availability, Performance, Security
 Assignment-2
6  Virtualization: Availability, Performance, Security
 Quiz-1
 7  Presentation-1
8 Revision
9 MID TERM

10  Operating Systems: Building Blocks, Implementing Various OS

11  OS availability, OS Performance, OS Security
 Assignment-3
12  End User Devises: Building Blocks, Device Availability
13  End User Devises: Performance, Security
14  IT Infrastructure Management. Service Delivery Processes. Service
15  Ethics, Trends, organizational and technical issues related to IT infra
 Quiz-2
16 Presentation-2
17 Revision
18 Final Term

Reference Materials:
 IT Infrastructure Architecture: Infrastructure building blocks and concepts by Sjaak
Laan, Lulu.com (November 5, 2011). ISBN-10: 1447881281
 IT Infrastructure and its Management by Prof Phalguni Gupta, Tata McGraw Hill
Education Private Limited (October 6, 2009). ISBN-10: 0070699798
 IT Architecture for Dummies by Kalani Kirk Hausman and Susan Cook, For
Dummies; 1st Edition (November 9, 2010). ISBN-10: 0470554231
Course Code:
Title: Language Programming
Credit Rating: 03 (2+1)
Level: BS
Delivery: Practical
Pre-requisites: None
Pre-Reading
Slides, Computer
Material:
Core Text: None
 To introduced students to the basic concept and issues in
managing the hardware.
 To understand how compilation systems work.
 To enable them to prepare a program by using Python
Objective:
language.
 To comprehend the structure of machine-level representations
of floating-point programs.

Intended Learning Outcomes:

 Acquire the basic knowledge of language such as python.
 Analyze techniques for user centered design for a medium sized software.
 Understand the concepts of basic python language techniques.
 Solve the problems related to computer world.
Key Transferable Skills
 Command on PyCharm.
 Learning about the structure of representations in python.
 Solve the problems related to programming.
 Learning the usability of a software in High Level language.

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

Session Topics
NO
1 Introduction to Python Programming
 Introduction to Python as a programming language
 Installation and setup of Python environment
 Basics of Python syntax and variables
 Introduction to problem-solving with Python
2 Data Types and Variables in Python
 Numeric data types (integers, floats)
 String data type and string manipulation
 Boolean data type and logical operations
 Variables and variable assignment
3 Data Structures in Python
 Lists and list operations in Python
 Tuples and tuple operations
 Dictionaries and dictionary operations
 Sets and set operations
 Assignment 1
4 Control Flow and Loops in Python
 Conditional statements (if, elif, else)
 Iterative statements (for and while loops)
Loop control statements (break, continue)
5 Python Operators and Expressions
 Arithmetic operators
 Comparison operators
 Logical operators
 Assignment operators
6 Object-Oriented Programming in Python
  Introduction to object-oriented programming concepts
 Classes, objects, and methods in Python
 Inheritance and polymorphism in Python
 Quiz-1: Object-oriented programming concepts in Python
7 Modules and Libraries in Python
 Importing and using built-in Python modules
 Introduction to external libraries (NumPy, Pandas, Matplotlib, Seaborn)
 Exploring NumPy for numerical computations
 Introduction to Pandas for data manipulation
 Assignment-2
8 Revision
9 MID TERM
10 Introduction to Data Analysis with Pandas
 Data manipulation with Pandas Data Frames
 Handling missing data
 Data aggregation and grouping
 Introduction to data visualization with Matplotlib and Seaborn
11 Introduction to Machine Learning with scikit-learn
 Overview of machine learning concepts
 Supervised learning and unsupervised learning
 Regression and classification algorithms
 Evaluation metrics in machine learning
12 Image Processing with OpenCV
 Introduction to computer vision and OpenCV library
 Image manipulation and filtering
 Object detection and tracking using OpenCV
 Assignment-3: Implement an image processing task with OpenCV
13  Introduction to scikit-learn for Machine Learning
 Feature scaling and normalization
 Model selection and evaluation
 Cross-validation and hyperparameter tuning
 Introduction to ensemble methods (random forests, gradient boosting)
 Assignment-4
14 Advanced Topics in Python
 Introduction to online algorithms and their applications
 Introduction to parallel and distributed algorithms
 Introduction to advanced data structures in Python
 Quiz-2: Advanced topics in Python programming
15 Advanced Topics
 Online algorithms
 Quantum algorithms
 Parallel and distributed algorithms
 Advanced data structures
 Quiz-3
16 Final Project Presentation
 Students present their final projects related to programming and
 problem-solving with Python
17 Revision
18 Final Term

Reference Materials:
 Computer Systems: Basic Concept of Python, Randal E. Bryant and David R.O' Hallaron,
Carnegie Mellon University
 Robert Britton, Introduction to Python, Latest Edition

Course Code:
Title: Machine Learning
Credit Rating: 3
Level: MS/M.Phil.
Delivery: Face To Face
Pre-requisites:
Pre-Reading
Material:
Machine learning (ML) studies the design and development of
algorithms that learn from the data and improve their performance
through experience. ML refers to a set of methods and that help
computers to learn, optimize and adapt on their own. ML has been
employed to devise algorithms for diverse applications including
object detection or identification in computer vision, sentiment
Core Text:
analysis of speaker or writer, detection of disease and planning of
therapy in healthcare, product recommendation in e-commerce,
learning strategies for playing games, recommending movies to
customers, speech recognition systems, fraudulent transaction
detection or loan application approval in banking sector,to name a
few
Objectives:  To provide a thorough introduction to ML methods
 To build mathematical foundations of ML and provide an
appreciation for its applications
 To provide experience in the implementation and
evaluation of ML algorithms
  To develop research interest in the theory and
application of ML

Intended Learning Outcomes:

1. Understand and recognize a machine learning problem
2. Formulate and execute solutions to the machine learning problems
3. Understand the core theoretical concepts serve as foundations of ML algorithms
4. Understand the trade-offs among model complexity, data size, and model performance
for different algorithms
5. Apply and interpret information theoretic and probabilistic machine learning methods
on real-world datasets
Key Transferable Skills
 Understanding and recognition of machine learning problems.
 Formulation and execution solutions to the machine learning problems.
 Identification researchable areas in ML.
Curriculum Contents:
Session Topics
NO
Introduction
Introduction of Course
1 Discussion of Course Content/ Material
Study Scheme
Discussion of Course Outline
2 Introduction of Machine Learning
3 Applications of Machine Learning
Classifier Performance Evaluation: Confusion Matrix Sensitivity, Specificity,
4
Precision Trade-offs,
Multi-class Classification, Evaluation, Micro, Macro Averaging, Regression:
5
Linear Regression, Polynomial Regression, Overfitting
6 Supervised Learning-I
7 Supervised Learning
8 Revision
9 MID TERM
10 Unsupervised Learning
11 Reinforcement Learning
12 Hard SVM, Soft SVM, Kernel Trick
13 Neural Network (Lecture-I)
14 Neural Network (Lecture-II)
15 Neural Network (Lecture-III)
16 Presentations and Submission of Final Assignment
17 Revision
18 Final Term
Reference Materials:
1. Pattern Recognition and Machine Learning, Christopher M. Bishop – CB
2. Machine Learning: a Probabilistic Perspective, Kevin Murphy – KM
3. Machine Learning, Tom Mitchell – TM
4. The Elements of Statistical Learning: Data mining, Inference, and Prediction, by
Hastie, Tibshirani, Friedman – HTF
5. Information Theory, Inference, and Learning Algorithms, David Mackay – DM4.
6. Research Papers.

Course Code:
Title: Mobile Application Development Lab
Credit Rating: 3(2+1)
Level: BS
Delivery: Face to Face
Pre-requisites: Object Oriented Programming
 Professional Android application development, Reto Meier,
Wrox Programmer to Programmer, 2015.
Pre-Reading  iOS Programming: The Big Nerd Ranch Guide, Conway, J.,
Material: Hillegass, A., &Keur, C.,5th Edition, 2014.
 Android Programming: The Big Nerd Ranch Guides, Phillips, B.
& Hardy, B., 2ndEdition, 2014.
Core Text: N/A
Objectives:  To facilitate the graduates with the ability to visualize, gather
information, articulate, analyze, solve complex problems, and
make decisions. These are essential to address the challenges of
complex and computation intensive problems increasing their
productivity.
 To facilitate the graduates with the technical skills that prepare
them for immediate employment and pursue certification
providing a deeper understanding of the technology in advanced
areas of computer science and related fields, thus encouraging to
pursue higher education and research based on their interest.
 To facilitate the graduates with the soft skills that include
fulfilling the mission, setting goals, showing self-confidence by
communicating effectively, having a positive attitude, get
 involved in team-work, being a leader, managing their career and
their life.
 To facilitate the graduates with the knowledge of professional
and ethical responsibilities by paying attention to grooming,
being conservative with style, following dress codes, safety
codes, and adapting themselves to technological advancements.

Intended Learning Outcomes:

1. Fundamentals and critical knowledge of the Computer System:- Able to Understand
the working principles of the computer System and its components , Apply the
knowledge to build, asses, and analyze the software and hardware aspects of it .
2. The comprehensive and Applicative knowledge of Software Development:
Comprehensive skills of Programming Languages, Software process models,
methodologies, and able to plan, develop, test, analyze, and manage the software and
hardware intensive systems in heterogeneous platforms individually or working in
teams.
3. Applications of Computing Domain & Research: Able to use the professional,
managerial, interdisciplinary skill set, and domain specific tools in development
processes, identify the research gaps, and provide innovative solutions to them.
Key Transferable Skills
 Building a high quality user interface (UI)
Curriculum Contents:
Installation of Android studio. Development Of Hello World Application Create an
application that takes the name from a text box and shows hello message along with
the name entered in text box, when the user clicks the OK button Create a screen that
has input boxes for User Name, Password, Address, Gender (radio buttons for male
and female), Age (numeric), Date of Birth (Date Picket), State (Spinner) and a Submit
button. On clicking the submit button, print all the data below the Submit Button (use
any layout) Design an android application to create page using Intent and one Button
and pass the Values from one Activity to second Activity Design an android
application Send SMS using Intent Create an android application using Fragments
Design an android application Using Radio buttons Design an android application for
menu. Create a user registration application that stores the Mobiles Application
Development Platform; HTML5 for Mobiles;
1 Installation of Android studio

2-3 Development Of Hello World Application Create an application that

takes the name from a text box and shows hello message along with
the name entered in text box, Calling Built-in

4 When the user clicks the OK button Create a screen that has input boxes
for User Name
5-6 Password, Address, Gender (radio buttons for male and female), Age
(numeric), Date of Birth (Date Picket), State (Spinner) and a Submit
button.
 7 Mid-term-exam
8-9 Print all the data below the Submit Button (use any layout) Design an
android application to
10- Create page using Intent and one Button and pass the Values from one
11 Activity to second

12- Activity Design an android application Send SMS using Intent Create
13 an android application using Fragments Design an android
application Using Radio buttons Design an android application for
menu.

14- Create a user registration application that stores the Mobiles

15 Application Development Platform; HTML5 for Mobiles;
16 Final-term project :

Course Code:
Title: Mobile Application Development
Credit Rating: 03
Level: BS
Delivery: Face to Face
Pre-requisites: Object Oriented Programming
 Professional Android application development, Reto Meier,
Wrox Programmer toProgrammer, 2015.
Pre-Reading  iOS Programming: The Big Nerd Ranch Guide, Conway, J.,
Material: Hillegass, A., &Keur, C.,5th Edition, 2014.
 Android Programming: The Big Nerd Ranch Guides, Phillips, B.
& Hardy, B., 2ndEdition, 2014.
Core Text: N/A
 To involves creating software applications that run on mobile
devices such as smartphones and tablets.
 To create responsive and user-friendly interfaces that consider
the limitations and unique features of mobile devices.
Objectives:  To develop focus on optimizing the app's speed, responsiveness,
and resource usage to provide a seamless user experience.
 To involves implementing encryption, secure authentication
mechanisms, and following best practices for data storage and
transmission

Intended Learning Outcomes:

Students who successfully complete the course unit and assignments will be able to:
1. Discuss different architectures & framework for Mobile Application development.
2. Develop mobile applications using current software development environments.
3. Compare the different performance tradeoffs in mobile application development.
Key Transferable Skills
Curriculum Contents:
The contents will cover the required information, knowledge and skills needed to be learned
by students during this course. It will be divided into 14 sessions and each session requires
further division to exactly know what to teach in each session. In course planning what
knowledge and skills to be transferred in each session be outlined below.

Session Topics
NO
1  Mobiles Application Development Platform; HTML5 for Mobiles
2  Android OS:Architecture, Framework and Application Development;
iOS: Architecture, Framework;
3  Application Development with Windows Mobile; Eclipse; Fragments
 Assignment-1
4  Calling Built-in Applications using Intents;Displaying Notifications;
Components of a Screen; Adapting to Display Orientation
5  Managing Changes to Screen Orientation; Utilizing the ActionBar;
Creating the User Interface
 Assignment-2
6  Listening for UI Notifications; Views
 Quiz-1
7  User Preferences
 Presentation-1
8 Revision
9 MID TERM

10  Persisting Data; Sharing Data

11  Sending SMS Messages; Getting Feedback
 Assignment-3
12  Sending Email; Displaying Maps; Consuming Web Services Using
HTTP; Web Services: Accessingand Creating
13  Threading; Publishing, Android Applications; Deployment on App
Stores
14  Mobile Programming Languages; Challenges with Mobility and
Wireless Communication
15  Location-aware Applications; Performance/Power Tradeoffs
 Quiz-2
16  Mobile Platform Constraints; Emerging Technologies
 Presentation-2
17 Revision
18 Final Term
Material
 Professional Android application development, Reto Meier, Wrox Programmer
toProgrammer, 2015.
 iOS Programming: The Big Nerd Ranch Guide, Conway, J., Hillegass, A., &Keur,
C.,5th Edition, 2014.
 Android Programming: The Big Nerd Ranch Guides, Phillips, B. & Hardy, B.,
2ndEdition, 2014.

Course Code:
Title: Operating system
Credit Rating: 3+1
Level: BS
Delivery: Face To Face
Pre-requisites:
Pre-Reading
Material:
Core Text: N/A
 To efficiently manage hardware resources such as CPU,
memory, disk space, and peripherals to ensure fair and optimal
allocation for various processes and users.
 To protect the system and its data from unauthorized access,
malware, and other security threats. This involves user
authentication, access control, and data encryption.
 To handle input and output operations efficiently, ensuring
Objectives: data is transferred between software and hardware devices
seamlessly.
 To provide user interfaces (CLI or GUI) to interact with the
computer system, making it accessible to users.
 To optimize system performance by scheduling processes,
managing memory efficiently, and minimizing resource
wastage.

Intended Learning Outcomes:

On successful completion of the course students will be able to

1. Students should be able to explain the key components of an operating system, such as
the kernel, file system, device drivers, and user interfaces.
2. Learners should be capable of managing system resources effectively, including CPU
scheduling, memory allocation, and I/O operations.
3. Students should understand OS-level security mechanisms like access control,
authentication, and encryption to protect the system from threats.
4. Students should be able to implement efficient input and output operations, including
device management and file handling.
5. Understanding how to design and develop user interfaces, whether command-line or
graphical, should be a learning outcome.
6. Learners should be capable of analyzing system performance and applying
optimization techniques to enhance it.

Key Transferable Skills

 Operating systems often encounter issues such as crashes, conflicts, and resource
allocation problems. Being able to diagnose and resolve these issues requires strong
problem-solving skills.
 Understanding the ins and outs of an operating system, including its file systems,
drivers, and configuration settings, is fundamental. This knowledge can be transferred
to working with different operating systems.
 Many operating systems offer command-line interfaces (e.g., Power Shell in Windows,
Bash in Unix/Linux). Proficiency in using the command line is a valuable skill that can
be applied across various platforms.
 Knowing how to allocate and manage system resources such as CPU, memory, and
storage efficiently is essential. These skills are crucial for optimizing system
performance.
 Operating systems are a primary target for security threats. Understanding security
principles, access control, and best practices for securing an OS is valuable in any IT
role.

Curriculum Contents:
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, distributed system,
deadlocks, detecting and recovering from deadlocks, memory management, swapping,
contiguous memory allocation, segmentation & paging, virtual memory 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

Session Topics
NO
1 Introduction to Operating Systems:
 What is an operating system?
 Functions and goals of an operating system.
 Historical perspective on operating systems.
2 Operating System Structures:
 Monolithic, layered, microkernel architectures.
 System calls and APIs.
3 Kernel mode vs. user mode.
 Deadlock
 Assignment-1
4 Process Management:
 Processes and threads.
 Process states and transitions
5 Process control blocks (PCB).
 Process scheduling algorithms
6 Memory Management:
 Address spaces and memory hierarchy.
 Virtual memory and paging.
 Quiz-1
7 Page replacement algorithms.
 Memory allocation strategies.
8 Revision
9 MID TERM

10 File Systems:
 File system organization and structure.
 File operations and file attributes.
 File system implementation
 Disk management and storage
11 Input/output Systems:
 Device management and I/O subsystems.
 I/O scheduling.
 Interrupts and DMA.
 Buffering and caching.
12 Synchronization and Concurrency:
 Critical sections and race conditions.
 Semaphores and condition variables.
 Deadlocks and deadlock prevention/avoidance.
 Interposes communication (IPC).
13 Security and Protection:
 Access control and authentication.
 Security threats and vulnerabilities.
 Security policies and mechanisms.
 Encryption and authentication protocols.
 Assignment 2
14 Distributed Operating Systems:
  Distributed system architectures.
 Distributed file systems.
 Distributed process management.
 Distributed synchronization and communication.
15 Quiz-2
16 Presentation
17 Revision
18 Final Term
Reference Materials:
 Operating Systems Concepts, 9th edition by Abraham Silberschatz
 Modern Operating Systems, 4th edition by Andrew S. Tanenbaum
 Operating Systems, Internals and Design Principles, 9th edition by William Stallings

Course Code:
Title: Parallel and distributed computing
Credit Rating: 03
Level: BS
Delivery: Face To Face
Pre-requisites: None
Pre-Reading
Slides
Material:
Core Text: None
 To learn about parallel and distributed computers.
 To write portable programs for parallel or distributed
architectures using Message-Passing Interface (MPI) library
Objectives:  To analytical modelling and performance of parallel
programs.
 To analyze complex problems with shared memory
programming with openMP

Intended Learning Outcomes:

1. Develop an understanding of various basic concepts associated with parallel
computing environments.
2. Understand the effects that issues of synchronization, latency and bandwidth have on
the efficiency and effectiveness of parallel computing applications.
3. Gain experience in a number of different parallel computing paradigms including
memory passing, memory sharing, data-parallel and other approaches.
4. Earn experience in designing and testing parallel computing solutions to programming
problems.
5. Develop improved communication and collaborative skills.
Key Transferable Skills
 Teaching topics related to High Performance Computing (HPC), including many
topics in Parallel and Distributed Computing (PDC), is most effective when students
have opportunities for hands-on learning.
 The common approach is to provide students with access to a platform on which they
can develop and/or execute applications so as to achieve various Student Learning
Objectives (SLOs).

Curriculum Contents:

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 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, Open Stack, Cilk, gdb, threads, MPICH, Open MP, Hadoop, FUSE).

Session Topics
NO
1  Asynchronous/synchronous computation/communication
2  Concurrency control, fault tolerance
3  GPU architecture and programming, heterogeneity
 Assignment-1
4  interconnection topologies, load balancing
5  Memory consistency model
 Assignment-2
6  Memory hierarchies, Message passing interface (MPI)
 Quiz-1
7  MIMD/SIMD, multithreaded programming
 Presentation-1
8 Revision
9 MID TERM

10  Parallel algorithms & architectures

11  Performance analysis and tuning
 Assignment-3
12  Programming models (data parallel)
13  Task parallel shared/distributed memory
14  Scalability and performance studies, scheduling, storage systems
15  Synchronization, and tools (Cuda, Swift, Globus, Condor, Amazon
AWS, Open Stack, Cilk, gdb, threads, MPICH, Open MP, Hadoop,
FUSE
 Quiz-2
 16 Presentation-2
17 Revision
18 Final Term
Reference Materials:
 Distributed Systems: Principles and Paradigms, A. S. Tanenbaum and M. V. Steen,
Prentice Hall, 2nd Edition, 2007
 Distributed and Cloud Computing: Clusters, Grids, Clouds, and the Future Internet, K
Hwang, J Dongarra and GC. C. Fox, Elsevier, 1st Ed.

Course Code:
Title: Programming Fundamental
Credit Rating: 03
Level: BSCS
Delivery: Face To Face
Pre-requisites:
Pre-Reading
Material:
Core Text: None
 Students have a solid grasp of programming fundamental
concepts, including the role of programming in solving
problems and its importance.
 Students will develop a keen understanding of foundational
programming concepts in C++, encompassing data types,
control structures, functions, and classes. They will acquire
proficiency in implementing these fundamentals to create
efficient and functional programs, mastering essential skills
Objectives:
crucial for effective problem-solving and software
development in C++.
 Students will become acquainted with various problem-
solving approaches to programming using C++. They'll
develop the skills to practically implement these strategies in
C++ to tackle practical, real-world programming tasks and
scenarios.

Intended Learning Outcomes:

On successful completion of the course, students will be able to
1. Students will exhibit a solid grasp of C++ basics, covering variables, control
structures, functions, and classes, enabling them to create structured programs
 proficiently.
2. Students will analyze and enhance program efficiency in C++ by comprehending
time and space complexities and employing techniques to optimize code
performance.
3. Applying problem-solving strategies unique to C++, students will solve real-world
programming challenges, emphasizing code readability and efficiency while
utilizing modular design and debugging approaches.

Key Transferable Skills

 Students will develop the ability to critically assess algorithmic choices in C++,
considering factors like efficiency, accuracy, and suitability for specific programming
scenarios. This skill is pivotal in making informed decisions during software
development across various applications.
 Analyzing the time and space intricacies of programming in C++ nurtures students'
analytical acumen, enabling them to break down complex systems and processes. This
skill facilitates a comprehensive examination and optimization of programming
elements, fostering a deeper understanding of intricate procedures and systems.

Curriculum Contents:
Introduction to problem-solving, A brief review of Von-Neumann architecture, Introduction
to programming, Role of compiler and linker, Introduction to algorithms, Basic data types and
variables, Input/output constructs, arithmetic, comparison and logical operators, Conditional
statements, and execution flow for conditional statements, repetitive statements and execution
flow for repetitive statements, Lists and their memory organization, multi-dimensional lists,
Introduction to modular programming, Function definition and calling, stack rolling and
unrolling, String and string operations, Pointers/references, Static and dynamic memory
allocation, File I/O operations
Session Topics
NO
1 Introduction
 Introduction to problem-solving,
 Flowchart, Pseudocode, Syntax and Semantics
 A brief review of Von-Neumann architecture
2 Introduction to Programming
 Overview and types of Programming Languages
 Basics of Programming Logic using C++
 Comments and Variables
 Role of compiler and linker
3 Introduction to Algorithms
 Algorithm Basics and Analysis
 Algorithm Design Strategies

4 Types of Algorithms and Applications

 Algorithms: Sorting, Searching, Recursion
 Applications of Algorithms
Assignment-1
5 Foundations of C++ Programming
 Understanding Data Types
 Handling Input/Output and Operators
 Working with Conditional Statements
 Control Flow and Repetitive Statements in C++
Quiz-1
6 Function Definition and Invocation
 Basics of Function Declaration and Definitions in C++
 Parameters and Return Types in Functions
 Scope of Variables within Functions
7 Presentation-1
8 Revision
9 MID TERM

10 Understanding Strings and Pointers

 String Basics and Manipulation
 String Operations and Functions
 Pointers/References
11 Introduction to Lists
 Definition and Overview of Lists as a Data Structure
 Characteristics and Advantages of Lists in Programming
 Sequential vs. Linked Memory Allocation for Lists
12 Multi-dimensional Lists
 Conceptualizing Multi-dimensional Lists in Programming
 Implementation and Usage of 2D and 3D Lists
 Multi-dimensional List
13 Modular Programming Fundamentals
 Understanding Modular Design and Its Advantages
 Modular Programming vs. Monolithic Approaches
14 Encapsulation and Abstraction Principles
 Levels of Abstraction
 Data Hiding
15 Advanced Topics
 Static and dynamic memory allocation
 File I/O operations
Quiz-2
16 Presentation-2
17 Revision
18 Final Term
Reference Materials:
 Programming in C++ by Richard L. Halterman
 Object-Oriented Programming in C++ by Robert Lafore
 Programming: Principles and Practice Using C++ by Bjarne Stroustrup

Course Code:
Title: Programming & Problem Solving
Credit Rating: 03
Level: MCS
Delivery: Face To Face
Pre-requisites: Programming Fundamentals
Pre-Reading Hands-on practice is crucial to reinforce your understanding of
Material: Python.
Core Text: None
 To develop a solid understanding of Python as a programming
language.
 To gain familiarity with Python syntax and basic
programming concepts.
 To acquire problem-solving skills using Python.
Objectives:
 To develop a solid foundation in Python programming, data
analysis, machine learning, and computer vision, equipping
them with essential skills for various domains and
empowering them to tackle complex real-world challenges.

Intended Learning Outcomes:

On successful completion of the course students will be able to
1. Demonstrate mastery of Python as a programming language, including its syntax,
semantics, and standard libraries.
 2. Apply Python syntax fluently, utilizing loops, conditionals, and comprehensions to
manipulate data and control program flow.
3. Understand and effectively use fundamental programming concepts such as
variables, data types, control flow, and functions in Python.
4. Utilize key libraries and modules in Python, including numpy, pandas, matplotlib,
seaborn, scikit-learn, TensorFlow, and OpenCV, for data analysis, visualization,
machine learning, and computer vision tasks.
5. Apply problem-solving techniques using Python, including decomposition, pattern
recognition, and algorithmic thinking, to tackle complex real-world problems.
6. Demonstrate proficiency in debugging techniques and error handling, ensuring
code correctness and reliability in Python programs.

Key Transferable Skills

 Computational Thinking: Develop a systematic and analytical approach to problem-
solving, leveraging Python and its libraries to tackle diverse computational challenges.
 Algorithmic Design: Acquire the ability to design and implement efficient algorithms
and data structures using Python, optimizing performance and scalability.
 Data Analysis and Visualization: Gain proficiency in using libraries such as numpy,
pandas, and matplotlib to analyze and visualize data, enabling data-driven decision-
making.
 Machine Learning: Develop skills in utilizing libraries like scikit-learn and
TensorFlow for machine learning tasks, including data preprocessing, model training,
and evaluation.
 Computer Vision: Gain familiarity with OpenCV for computer vision tasks, such as
image and video processing, object detection, and image recognition.
 Collaboration and Communication: Enhance interpersonal and teamwork skills by
effectively communicating and collaborating with others on Python projects involving
data analysis, machine learning, and computer vision.
 Adaptability and Lifelong Learning: Develop a growth mindset, staying updated with
new libraries, frameworks, and techniques in the Python ecosystem, enabling
adaptability and continuous learning in a fast-paced technological landscape.

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

Session Topics
NO
1 Introduction to Python Programming
 Introduction to Python as a programming language
  Installation and setup of Python environment
 Basics of Python syntax and variables
 Introduction to problem-solving with Python
2 Data Types and Variables in Python
 Numeric data types (integers, floats)
 String data type and string manipulation
 Boolean data type and logical operations
 Variables and variable assignment
3 Data Structures in Python
 Lists and list operations in Python
 Tuples and tuple operations
 Dictionaries and dictionary operations
 Sets and set operations
Assignment 1
4 Control Flow and Loops in Python
 Conditional statements (if, elif, else)
 Iterative statements (for and while loops)
 Loop control statements (break, continue)
5 Python Operators and Expressions
 Arithmetic operators
 Comparison operators
 Logical operators
 Assignment operators
6 Object-Oriented Programming in Python
 Introduction to object-oriented programming concepts
 Classes, objects, and methods in Python
 Inheritance and polymorphism in Python
 Quiz-1: Object-oriented programming concepts in Python
7 Modules and Libraries in Python
 Importing and using built-in Python modules
 Introduction to external libraries (NumPy, Pandas, Matplotlib, Seaborn)
 Exploring NumPy for numerical computations
 Introduction to Pandas for data manipulation
 Assignment-2
8 Revision
9 MID TERM

10 Introduction to Data Analysis with Pandas

 Data manipulation with Pandas Data Frames
 Handling missing data
 Data aggregation and grouping
 Introduction to data visualization with Matplotlib and Seaborn
11 Introduction to Machine Learning with scikit-learn
 Overview of machine learning concepts
 Supervised learning and unsupervised learning
 Regression and classification algorithms
  Evaluation metrics in machine learning
12 Image Processing with OpenCV
 Introduction to computer vision and OpenCV library
 Image manipulation and filtering
 Object detection and tracking using OpenCV
 Assignment-3: Implement an image processing task with OpenCV
13  Introduction to scikit-learn for Machine Learning
 Feature scaling and normalization
 Model selection and evaluation
 Cross-validation and hyperparameter tuning
 Introduction to ensemble methods (random forests, gradient boosting)
 Assignment-4
14 Advanced Topics in Python
 Introduction to online algorithms and their applications
 Introduction to parallel and distributed algorithms
 Introduction to advanced data structures in Python
 Quiz-2: Advanced topics in Python programming
15 Advanced Topics
 Online algorithms
 Quantum algorithms
 Parallel and distributed algorithms
 Advanced data structures
Quiz-3
16 Final Project Presentation
 Students present their final projects related to programming and
problem-solving with Python
17 Revision
18 Final Term

Reference Materials:
 Starting out with Python, 4th Edition, Tony Gaddis.
 Starting out with Programming Logic & Degins, 4th Edition, Tony Gaddis,
 The C Programming Language, 2nd Edition by Brian W. Kernighan, Dennis M.
Ritchie Object Oriented Programming in C++ by Robert Lafore
 Introduction to Computation and Programming Using Python: With Application to
Understanding Data, 2nd Edition by Guttag, John
 Practice of Computing Using Python, 3rd Edition by William Punch & Richard
Enbody
 C How to Program, 7th Edition by Paul Deitel & Harvey Deitel
 Problem Solving and Program Design in C++, 7th Edition by Jeri R. Hanly & Elliot B.
Koffman
Course Code:
Title: Research Workshop
Credit Rating: 03
Level: BS
Delivery: Face To Face
Pre-requisites: None
Pre-Reading
Slides
Material:
Core Text: None
 To develop a thesis proposal.
Objectives:  To develop skills of critical analysis through a process which
facilitates peer review of research proposals.

Intended Learning Outcomes:

1. Make relevance of research to his/her professional practice
2. Read and critique a range of research articles and a research thesis
3. Learn essential skills to prepare a synopsis
4. Conduct small-scale research and recommend a practical solution to the problem
5. Evaluate the process of research and make a judgment on the quality of the research

Key Transferable Skills

 Learning skills about the conceptual framework of research.
 Learning skills in Preparing a research proposal
 Learning skills to Prepare research methodology
 Work with others
  Problem-solving through inquiry

Curriculum Contents:
The course will introduce students to the essential knowledge needed in order to appreciate
the field of research, critically read research articles, prepare a research proposal and conduct
a small-scale inquiry.
Session Topics
NO
1 Introduction and interaction
Why do we conduct Research?
2 Introduction of research (Continue)
Introduction of different research based softwares.
Installation of different softwares and Preperation Research environment
3 Joy of Research ( Need and Attributes)
4 The research process and components of a research proposal P-I ( Research
Questions)
5 The research process and components of a research proposal P-II (Literature
Review)
6 The research process and components of a research proposal P-II (Literature
Review) Continue
7 Writing a Research Proposal (Chapter No 1)
8 Revision
9 MID TERM

10 Writing a Research Proposal (Chapter No 2)

11 Writing a Research Proposal (Chapter No 3)
From design to implementation (Comprehensive Discussion of P.S to
Methodology)
12 Research Problems
Experiences
Limitations
13 Research ethics-I
14 Discussion of draft thesis proposals
15 Synopsis Presentation & Discussion
16 Synopsis Presentation & Discussion
17 Revision
18 Final Term
Course Code:
Title: Software Project Management
Credit Rating: 03
Level: BS
Delivery: Face To Face
Pre-requisites: None
Pre-Reading
Slides
Material:
Core Text: None
 To capable of taking full responsibility for medium to large-
sized projects.
 To fully aware of, and competent to use, the current
Objectives:
methodologies, techniques and tools required for effective
project management

Intended Learning Outcomes:

1. Understand software life cycle

2. Learn best international practices of software development
3. Undoubtedly, improve software quality
4. Manage software development
5. Deliver timely software projects
6. Align strategic goals
7. Develop a project delivery mindset

Key Transferable Skills

  Students should also be able to:
 Make estimates for project resources
 Calculate and create a Gantt Chart
 Calculate and create a CPM network
 Plan and monitor a project
 Issue a tender
 Write a contract
Curriculum Contents:
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 to an
Appropriate Approach in Project, Software Effort 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
Project Management

Session Topics
NO
1  Introduction to Software Project Management
2  Project Management concepts, Project Management Tools
3  PMI Framework, PMI Process Groups. Understanding Organizations
 Assignment-1
4  Project Planning, Project Evaluation
5  Selection to an Appropriate Approach in Project
 Assignment-2
6  Software Effort Estimation
 Quiz-1
7  Presentation-1
8 Revision
9 MID TERM

10  Activity Planning. Risk Management

11  Evaluating the Risks to the Schedule, Risk Control
 Assignment-3
12  Configuration Management and Maintenance
13  Qui Environment for Configuration Control
14  Allocation, Monitoring & Control, Review and Evaluation
15  Challenges of Outsourcing Project Management
 Quiz-2
16 Presentation-2
17 Revision
18 Final Term
Reference Materials:
 A Guide to the Project Management Body of Knowledge. 5th Edition (PMBOK
Guides),
 Mastering Software Project Management: Best Practices, Tools and Techniques,
Murali K. Chemuturi and Thomas M. Cagley Jr., J. Ross Publishing, 2010
 Effective Project Management: Traditional, Agile, Extreme, Robert K. Wysocki,
Wiley: 6th Edition, 2011

Course Code:
Title: Software Quality Engineering
Credit Rating: 3
Level: BS
Delivery: Face to face
Pre-requisites: None
Pre-Reading
Material:
Core Text: N/A
 Define and comprehend fundamental concepts related to
software quality engineering.
 Understand the principles of functional and non-functional
testing.
Objectives:  Understand the benefits and challenges of test automation
 Understand how to assess and improve the performance of
software applications.
 Understand the importance of communication in the context of
software quality.

Intended Learning Outcomes:

On successful completion of the course students will be able to:
 Apply various testing techniques to identify and verify software defects.
 Implement quality assurance processes within a software development project.
 Demonstrate proficiency in using automation tools for testing purposes.
 Conduct performance and security testing to ensure software reliability.
Collaborate with development teams to enhance software quality.

Key Transferable Skills

 Develop the ability to analyze software requirements and identify potential areas of
 improvement.
 Enhance problem-solving skills by identifying and resolving defects in software.
 Improve communication skills to convey testing results and collaborate with cross-
functional teams.
 Develop the ability to adapt to evolving software development methodologies and
technologies.

Curriculum Contents:
Software Quality, Software Quality Attributes, Quality Engineering., Testing: Concepts,
Issues, and Techniques, Software testing lifecycle., Testing Scopes., Testing Approaches.,
Testing Concepts., Test Planning Process, Introduction to testing process, Requirement of
software test planning, Testing documentation, Reporting and historical data recording.,
Software testing techniques, Testing philosophies , Testing strategies, Model based testing,
Software testing techniques, Testing using models, Domain and combinatorial testing, Unit
and integration testing, Acceptance testing, Test automation, Slicing, Software reliability
models and engineering, Introduction, Exponential model., Reliability growth models,
Modeling process, Software inspections, Software reviews, Inspection checks and metrics,
Quality Models, Models for quality assessment, Product quality metrics, Quality
Measurements, In-Process metrics for software testing, In-Process quality management,
Effort/outcome models, System testing, Introduction to sub-system testing, From functional to
system aspects of testing, System testing, Introduction to system testing, Scenarios
development, System testing, Use-cases for testing, Specification-based testing, Open issues
on software testing

Session Topics
NO
1 Software Quality
 Software Quality Attributes
 Quality Engineering
2 Testing
 Concepts, Issues
 And Techniques, Software testing lifecycle
 Testing Scopes
3 Testing Approaches
 Testing Concepts
 Test Planning Process
 Introduction to testing process
 Requirement of software test planning
4 Testing documentation
 Reporting and historical data recording
 Software testing techniques
 Testing philosophies
 Assignment 1
5 Testing strategies
 Model based testing
 Software testing techniques
 6 Testing using models
 Domain and combinatorial testing
7 Unit and integration testing
 Acceptance testing
8 Test automation, Slicing
 Software reliability models and engineering,
9 MID TERM

10 Introduction
 Exponential model
 Reliability growth models
 Modeling process
 Software inspections
 Software reviews, Inspection checks and metrics
11 Quality Models, Models for quality assessment
 Product quality metrics, Quality Measurements
 In-Process metrics for software testing
 In-Process quality management
12 Effort/outcome models
 System testing
 Introduction to sub-system testing
 From functional to system aspects of testing
13 Introduction to sub-system testing
 From functional to system aspects of testing
 System testing
 Assignment 2
14 Introduction to system testing
 Scenarios development
 System testing
15 Use-cases for testing
 Specification-based testing
 Open issues on software testing
16 Presentation
17 Revision
18 Final Term

Reference Material
 Paul Jorgensen, Software Testing, A Craftsman's Approach, 4th Ed. CRC Press,
 Taylor and Francis Group, 2015
 Bernard Homes, Fundamentals of Software Testing, ISTE, Wiley, 2012
 Software Engineering, “Ian Sommerville, 9th Edition, Addison Wesley, 2011
Course Code:
Title: Software Engineering
Credit Rating: 3
Level: BS
Delivery: Face to face
Pre-requisites: None
Pre-Reading
Material:
Core Text: N/A
 Demonstrate proficiency in one or more programming
languages. Write clean, maintainable, and efficient code.
Debug and troubleshoot software effectively.
 Understand software design principles and patterns. Create
modular and scalable software architectures. Make informed
design decisions based on requirements and constraints.
Objectives:  Design and manage databases effectively. Write efficient
database queries and transactions.
 Comprehend the software development lifecycle, including
requirements gathering, design, implementation, testing,
deployment, and maintenance.
 Manage software projects using agile or other project
management methodologies.

Intended Learning Outcomes:

On successful completion of the course students will be able to:
 Students should be able to apply logical and analytical thinking to solve a wide range
of problems.
 Effectively convey complex technical information to different audiences.
 Work collaboratively with team members to achieve project goals. Resolve conflicts
and contribute positively to team dynamics.
 Manage multiple tasks and deadlines efficiently. Prioritize work based on project
 requirements.
 Adhere to ethical standards in software development.

Key Transferable Skills

 Apply logical and analytical thinking to solve a wide range of problems.

 Effectively convey complex technical information to different audiences. Collaborate
with cross-functional teams.
 Work collaboratively with team members to achieve project goals. Resolve conflicts
and contribute positively to team dynamics.
 Adhere to ethical standards in software development. Take responsibility for the
impact of software on society.

Curriculum Contents:
Introduction to Software Engineering, Software Processes, Software process models ,Process
activities , Coping with change , The rational unified process, SDLC(software development
life cycle), Phases ,System Planning, Preliminary Investigation, SWOT Analysis, Agile
software development, Agile methods ,Plan-driven and agile development ,Extreme
programming ,Agile project management ,Scaling agile methods , Requirements engineering,
Functional and non-functional requirements , The software requirements
document ,Requirements specification , Requirements engineering processes , Requirements
elicitation and analysis , Requirements validation , Requirements management, Architectural
design, Design and implementation, Software testing, Component-based software engineering,
Distributed software ,Project management ,Quality management, Embedded software.

Session Topics
NO
1 Introduction to Software Engineering
2 Software Processes
-Software process models
-Process activities
-Coping with change
-The rational unified process
3 SDLC(software development life cycle)
Phases
System Planning
Preliminary Investigation
SWOT Analysis
4 Agile software development
-Agile methods
-Plan-driven and agile development
-Extreme programming
-Agile project management
-Scaling agile methods
 Assignment 1
5 Requirements engineering
-Functional and non-functional requirements
-The software requirements document
-Requirements specification
-Requirements engineering processes
-Requirements elicitation and analysis
-Requirements validation
-Requirements management
6 Architectural design
-Architectural design decisions
-Architectural views
-Architectural patterns
-Application architectures
7 Design and implementation
-Object-oriented design using the UML
-Design patterns
-Implementation issues
-Open source development
8 WebApps Interface Design
9 MID TERM

10 Software testing
-Development testing
-Test-driven development
-Release testing
-User testing
11 , Component-based software engineering
-Components and component models
-processes
-Component composition
12 Distributed software engineering
-Distributed systems issues
-Client–server computing
-Architectural patterns for distributed systems
-Software as a service
13 Project management
-Risk management
-Managing people
-Teamwork
Assignment 2
14 Quality management
-Software quality
-Software standards
-Reviews and inspections
-Software measurement and metrics
 15 Embedded software
-Embedded systems design
-Architectural patterns
-Timing analysis
-Real-time operating systems
16 Presentation
17 Revision
18 Final Term

Reference Materials:
 Introduction to Software Engineering" by Ronald J. Leach - A textbook that provides
an introduction to the fundamental concepts of software engineering, suitable for
beginners in the field.
 Software Engineering: Modern Approaches" by Eric J. Braude - A comprehensive
textbook that covers software engineering principles, methodologies, and tools, with a
focus on modern approaches.
Course Code:
Title: System network and administrator
Credit Rating: 03
Level: BS
Delivery: Face To Face
Pre-requisites: None
Pre-Reading
Slides
Material:
Core Text: None
 To understand the ethical issues of working as a Network
Administrator
 To understand network security issues
 To be familiar with common network operating systems
(NOSs) used by network servers
 To understand directories, directories services, and their uses
in a network environment, particularly X.500, LDAP and
Objectives:
their derivatives
 To design and implement a Novell Directory Services (NDS)
installation
 To design and implement a Microsoft Active Directory (AD)
installation
 To work as a basic Network Administrator with NDS
 To work as a basic Network Administrator with AD

Intended Learning Outcomes:

1. Design and configure peer-to-peer networks to share resources;
2. Analyze requirements and design network architecture for a given scenario;
3. Design and configure IP addressing schemes for a given scenario;
4. Design and configure a client-server network and required network services for a
given scenario;
5. Evaluate and critique a design for a systems and network solution.
Key Transferable Skills
 Expertise hands in troubleshooting of Computer hardware related problems such like
UPS, SMPS, Printer and Drivers.
 Managing and Maintaining the Servers, PC’s, Routers and Switches.
 Configuring, Managing and Maintaining Networking Equipments.
 Network processing, centralized and distributive network connection
 Installing, configuring and administering network technologies
 Installed and configured workstations for IP/IPX based LAN

Curriculum Contents:
Introduction To System Administration. SA Components. Server Environment (Microsoft and
Linux). Reliable Products, Server Hardware Costing, Maintenance Contracts and Spare Parts,
Maintaining Data Integrity, Client Server OS Configuration, Providing Remote Console
Access. Comparative Analysis of OS: Important Attributes, Key Features, Pros and Cons.
Linux Installation and Verification, Configuring Local Services and Managing Basic System
Issues. Administer Users and Groups. Software Management. Managing Network Services
and Network Monitoring Tools. Boot Management and Process Management. IP Tables and
Filtering. Securing Network Traffic. Advanced File Systems and Logs. Bash Shell Scripting.
Configuring Servers (FTP, NFS, Samba, DHCP, DNS and Apache).

Session Topics
NO
1  Introduction to System Administration
2  SA Components. Server Environment (Microsoft and Linux).
3  Reliable Products, Server Hardware Costing
 Assignment-1
4  integer arithmetic, floating point
5  Maintenance Contracts and Spare Parts, Maintaining Data Integrity
 Assignment-2
6  Client Server OS Configuration, Providing Remote Console Access
 Quiz-1
7  Comparative Analysis of OS: Important Attributes, Key Features, Pros
and Cons
 Presentation-1
8 Revision
9 MID TERM

10  Linux Installation and Verification

11  Configuring Local Services and Managing Basic System Issues
 Assignment-3
12  Administer Users and Groups. Software Management. Managing
 Network Services and Network Monitoring Tools
13  Boot Management and Process Management
14  IP Tables and Filtering
15  Securing Network Traffic. Advanced File Systems and Logs
 Quiz-2
16  Bash Shell Scripting. Configuring Servers (FTP, NFS, Samba, DHCP,
DNS and Apache)
Presentation-2
17 Revision
18 Final Term

Reference Materials:
 The Practice of System and Network Administration, Second Edition by Thomas
Limoncelli, Christina Hogan and Strata Chalup, Addison-Wesley Professional; 2nd
Edition (2007). ISBN-10: 0321492668
 Red Hat Enterprise Linux 6 Bible: Administering Enterprise Linux Systems by
William vonHagen, 2011
 Studyguide for Practice of System and Network Administration by Thomas A.
Limoncelli, Cram101; 2nd Edition (2011). ISBN-10: 1428851755
 Networking Systems Design and Development by Lee Chao, CRC Press; 1st Edition
(December 21, 2009). ISBN-10: 142009159X (TB2)
Course Code:
Title: System Programming
Credit Rating: 03
Level: BS
Delivery: Face To Face
 Introduction to Programming
Pre-requisites:  Computer Architecture and Assembly Language
Programming
 Barry B. Bery, Intel Micro Processor, 6th Edition. Prentice-
Hall.
Pre-Reading  V.J Mukee, Advanced DOS, 6th Edition. Prentice- Hall.
Material:  Michael Tischer, Bruno Jennrich, PC Intern: The
Encyclopedia of System Programming, 6th Edition. Abacus
Software 1996.
Core Text: None
 To familiarizes with the internal working of different
Objectives: components of PC and control them.

Intended Learning Outcomes:

1. Describe how different components of PC work internally
2. Intercept different interrupts and complete knowledge of TSR programs
3. Analyze internal structure and complete details of different file systems
4. Develop device drivers for different devices
5. Recover data from deleted files
6. Detect and remove different kind of viruses

Key Transferable Skills

 Familiarizes with the internal working of different components of PC and how to
control these components.
 How TSR programs work and how different interrupts are generated and intercepted
 How to develop device drivers for different devices.
Session Topics
NO
1  Introduction to System Programming
2  Interrupt Mechanism
3  Interrupt Vector Table (IVT)
 Assignment-1
4  Use of ISRs for C Library functions
5  Terminate and Stay Resident (TSR) programs
 Assignment-2
6  Interrupt stealing or interrupt hooks
 Quiz-1
7  Timer interrupt
 Presentation-1
8 Revision
9 MID TERM

10  Memory mapped I/O and Isolated I/O

11  The keyboard interrupt
 Assignment-3
12  Reentrant Procedures and Interrupts
13  Disk interrupt
14  Keyboard hook
15  Programmable Interrupt Controller
 Quiz-2
16  Keyboard buffer and The interval timer
 Presentation-2
17 Revision
18 Final Term
Reference Materials:
 Barry B. Bery, Intel Micro Processor, 6th Edition. Prentice- Hall.
 V.J Mukee, Advanced DOS, 6th Edition. Prentice- Hall.
 Michael Tischer, Bruno Jennrich, PC Intern: The Encyclopedia of System
Programming, 6th Edition. Abacus Software 1996.
Course Code:
Title: Technical and Business Writing
Credit Rating: 03
Level: BS
Delivery: Face To Face
Pre-requisites: None
Pre-Reading
Slides
Material:
Core Text: None
 To assist students to understand technical writing
 To explain what professional communication is
Objectives:  To describe the methods of each type of business
communication (e-mail, letters, resume, reports)

Intended Learning Outcomes:

1. Understand and write E-mails, Resume, Letters etc.
2. Understand the difference between professional communication and simple
communication

Key Transferable Skills

 Writing and Communicating professionally

Session Topics
NO
1 Introduction, Technical Writing
2 Use of Appropriate Language: Formal English, Simple Terms, Direct Language,
Action verb
3 Create Text Flow: Coherent Paragraphs, Transitional Words, Sentence variety,
Acronyms and Initialisms
4 Use of Correct Grammar: Parallel Structure, Subject and Verbs, Capitalization,
 That and Which
5 Punctuation: Comma, Colon, Semicolon, Quotation Marks etc.
6 Persuasive Communications: Pompous Vocabulary, Impact on audiences, Persuasive
not Argumentative
7  Presentation-1
8 Revision
9 MID TERM

10 Forms of Communication, Class assignments

11 Email, Resumes, difference b/w C.V. and Resume
12 Letters: Business letter, Resume cover, Thank- You letter after an Interview
13 Report Writing: Format: Salutation, address, subject
14 Report Writing: Body of Report, Signing off
15 Report Writing, Class assignment
16 Presentation-2
17 Revision
18 Final Term
Reference Materials:
 Technical Report Writing, by Pauley and Riordan, Houghton Mifflin Company, 8th
Edition.
 Effective Technical Communication by Ashraf Rizvi, Tata McGraw-Hill
Course Code:
Title: Text Mining
Credit Rating: 03
Level: BS
Delivery: Face to Face
Pre-requisites: None
Pre-Reading
Slides, Notes
Material:
Core Text: None
 To provide students with a fundamental understanding of
what text mining is and its applications in various fields.
 To teach students how to prepare textual data for analysis by
cleaning, tokenizing, stemming, and removing stopwords.
 To enable students to build search engines and retrieval
systems to extract relevant information from large text
Objectives: corpora.
 To teach students the principles and techniques for
categorizing text into predefined classes or topics, including
sentiment analysis and spam detection.
 To provide hands-on experience in analyzing sentiment in
text data to understand customer opinions and emotional tone.

Intended Learning Outcomes:

1. Explain context of mining and its role in various fields.
2. Explain how to prepare textual data for analysis by cleaning, tokenizing, and
stemming.
3. Analyze Corporation and techniques of sentiment analysis and spam detection.
Key Transferable Skills
 Explain key concepts of mining in text, audio, video data.
 Discuss legal, ethical, and professional issues in Mining.
 Apply various tools for achieving mining of data.
 Identify appropriate techniques to tackle and solve problems in the discipline of data
mining.

Curriculum Contents:
Basic Mining concepts, Steps Text Mining Process, Text Pre-Processing, Text managing,
Introduction to python, Data types strings, Bagging vs Boosting. Bitcoin data mining, orange
data mining, data mining vs big data, Data Mining Model, Data mining vs. Data Science, Data
mining vs. Statistics, Data mining vs. Web Mining, Data mining vs, Data Analysis, Visual
and Audio data mining, Birch in data mining, Stemming, Feature Transformation, Data
Selection
Session Topics
NO
1 Introduction to Text Mining
 Types of Text Mining
 Challenges of Implementation
2 Steps Text Mining Process
 Classifications of data
 Types of data
3 Text Pre-Processing
 Text managing
 Assignment-1
4 Introduction to python
 Data types
 String
5 Bagging vs Boosting
 Assignment-2
6 Bitcoin Data Mining
 Orange Data Mining
 Data Mining vs Big Data
 Quiz-1
7 Presentation
8 Revision
9 MID TERM

10 Data Mining Model

 Data mining vs. Data Science
 Data mining vs. Statistics
 Data mining vs. Web Mining
 Data mining vs, Data Analysis
11 Data Mining Model
 Data mining vs, Data Science
 Data mining vs, Visualization
 Data mining vs, Business Intelligences
12 Web Content vs Web Structure vs Web Usage Mining
 Binning in data mining
13 Visual and Audio data mining
 Birch in data mining
 Stemming
  Feature Transformation
 Data Selection
14 Task and Functionalities of data mining
 Ubiquitous and invisible
 Numerosity Reduction
 Entity identification
 Market Basket Analysis
15 Trends
Quiz-2
16 Presentation
17 Revision
18 Final Term
Reference Materials:
 Data+ Text Mining by Mark Ciampa, 4th Edition
 Text Mining by Randall J.Boyle, 3rd Edition
Course Code:
Title: Theory of Automata
Credit Rating: 03
Level: BS
Delivery: Face To Face
Pre-requisites: None
Pre-Reading
Slides
Material:
Core Text: None
 To introduces some fundamental concepts in automata theory
and formal languages including grammar.
 To explain finite automaton, regular expressions, formal
language, pushdown automaton, and Turing machine.
 To form basic models of computation, which are also the
Objectives:
foundation of many branches of computer science, e.g.
compilers, software engineering, concurrent systems, etc.
 To learn about languages, grammars and automata with
rigorously formal mathematical methods.

Intended Learning Outcomes:

1. Explain the different concepts in automata theory and formal languages.
2. Determine solution to simple automata problems.
3. Apply their understanding of key notions through complex problem solving.
4. Transform between equivalent NFAs, DFAs and Res
5. Prove properties of languages, grammars and automata with rigorously formal
mathematical methods.
6. Define Turing machines performing simple tasks.

Key Transferable Skills

 Learn about automated machines
 Discuss formal and informal languages
 Apply the finite automata.
 Learning about new method and language to build a better machine.

Curriculum Contents:
Finite State Models: Language definitions preliminaries, Regular expressions/Regular
languages, Finite automata (FAs), Transition graphs (TGs), NFAs, Kleene’s theorem,
Transducers (automata with output), Pumping lemma and non-regular language Grammars
and PDA: CFGs, Derivations, derivation trees and ambiguity, Simplifying CFLs, Normal
form grammars and parsing, Decidability, Context sensitive languages, grammars and linear
bounded automata (LBA), Chomsky’s hierarchy of grammars Turing Machines Theory:
Turing machines, Post machine, Variations on TM, TM encoding, Universal Turing Machine,
Defining Computers by TMs.

Session Topics
NO
1 Course Introduction + Fundamentals of Automata
 Alphabets
 String and words
 Valid and invalid alphabets
2 Fundamentals of Automata + Recursive Definitions
 Length of string
 Reverse of string
 Palindrome
3 Regular Expressions
 Kleene Star closure
 Plus operator
 Equivalent Regular Expressions
 Assignment-1
4 Languages associated with regular expressions
 Regular languages
 Equivalent Regular Expressions
 Finite languages
5 Finite Automata and their languages
 States (Initial & Final)
 Transition
 Equivalent FAs
 Assignment-2
6 Transition graphs
 Authentication
 Device authorization
 Two-Factor Authentication
 Data Encryption
 Quiz-1
7 Transition graphs & Presentation
8 Revision
9 MID TERM

10 Kleene’s theorem
 Kleene’s Theorem Part I
 Kleene’s Theorem Part II
 Kleene’s Theorem Part III
11 Finite automata with output
 Moore machine
  Mealy machine
 complementing machine
 Incrementing machine
12 Decidability and Context free grammars
 CFG terminologies
 Trees
 Polish Notation
 Ambiguous CFG
 Unambiguous Grammar
 Regular Grammar
 Chomsky Normal Form (CNF)
13 Pushdown automata
 PUSHDOWN STACK or PUSHDOWN STORE
 Non determinism
14 CFGs and PDA
 Nondeterministic PDA
 PDA corresponding to CFG
 CFG corresponding to PDA
15 Turing machines
Quiz-2
16 Presentation
17 Revision
18 Final Term
Reference Materials:
 “Introduction to Automata Theory, Languages, and Computation”, 3rd Edition, John
E. Hopcroft, Jeffery D. Ullman and Rajeev Motwani, Pearson Education 2013.
 “Automata, Computability and Complexity, Theory and Applications”, Elaine A.
Rich, 2013.
 “Introduction to Computer Theory”, 2nd Edition, Daniel I. A. Cohen.
 “A Textbook on Automata Theory”, Nasir S.F.B and P.K. Srimani.
Course Code:
Title: Virtual System and services
Credit Rating: 03
Level: BS
Delivery: Face To Face
Pre-requisites: Virtualization, Hypervisor, Virtual Machine.
Pre-Reading
Slides
Material:
Core Text: None
 To fundamental Virtualization and paravirtualization
concepts
 To be familiar with Virtual Machines;
Objectives:
 To be familiar with Hypervisor and its types;
 To use of virtualization in cloud computing.

Intended Learning Outcomes:

1. Explain fundamental of Virtualization at both hardware and software levels.
2. Explain working of Hyper V3, Xen, VMware.
3. Working of Hypervisor and its types in virtual machines.
4. How virtualization use in cloud computing.

Key Transferable Skills

 Basic skills learned while pursuing a Virtual system and services career includes
working with R Virtualization, Para-virtualization, Virtual Machines, Hypervisor.
Valuable skills also include knowing how Virtual Machines work, how to
use VMware in operating system

Curriculum Contents:
This course will investigate the current state of virtualization in computing systems.
Virtualization at both the hardware and software levels will be examined, with emphasis on
the hypervisor configurations of systems such as Vmware, Zen and Hyper-V. The features
and limitations of virtual environments will be considered, along with several case studies
used to demonstrate the configuration and management of such systems. Para-virtualized
software components will be analyzed and their pros and cons discussed. Processor and
peripheral support for virtualization will also be examined, with a focus on emerging
hardware features and the future of virtualization.

Session Topics
NO
1 Introduction
 Basics of virtualization, benefits of virtualization
2  Hardware virtualization layers, components of hyper V.
3  Server virtualization, understanding the hyper V architecture
 Assignment-1
4  key benefits of using hyper V, working with Hyper V
5  Virtual Machine, the PVM resource manager interface
 Assignment-2
6  Server Virtualization and Networking, Hypervisor and its types
 Quiz-1
7  Hyper V3, VMware, Xen hypervisor
 Presentation-1
8 Revision
9 MID TERM

10  Local desktop virtualization, understanding Window virtual PC and

Window Xp
11  Virtualization Management, key features benefits and scenarios of
VMM
 Assignment-3
12  Cloud computing, private and public, Examining the benefits of cloud
computing
13  Understanding Microsoft cloud computing platform, Additional
resources.
14  Understanding full virtualization, Hardware assisted
15  Paravirtuallization and its pros and cons, the future of virtualization
 Quiz-2
16 Presentation-2
17 Revision
18 Final Term

Reference Materials:
 Handbook of Virtual Environments: Design, Implementation, and Applications
(Human Factors and Ergonomics), Edited by Kay M Stanney, Lawrence Erlbaum
Associates Virtual Reality Technology by GRIGORE
Course Code:
Title: Web Engineering
Credit Rating: 03
Level: BS
Delivery: Face To Face
Pre-requisites: None
Pre-Reading
Slides
Material:
Core Text: None
 To provide a comprehensive understanding of web development.
 To hands-on experience, aim should be to give students hands-on
experience in developing web applications.
Objectives:  To foster problem-solving skills should be to foster problem-
solving skills in the students.
 To keep up-to-date with the latest trends.

Intended Learning Outcomes:

1. Understanding of web development principles.
2. Ability to design and develop web applications.
3. Problem-solving and critical thinking skills.
4. Awareness of web security and ethical considerations.

Key Transferable Skills

 Students should have a strong foundation in programming languages such as HTML, CSS,
JavaScript, and PHP.
 Students should have the ability to solve problems using critical thinking and analytical skills.
 Web development projects offer many opportunities for creativity and innovation.
 Students should learn how to work effectively in a team, communicate their ideas clearly, and
take feedback constructively.

Curriculum Contents:
Overview of the web development landscape, history of the web, and the role of web applications in
modern society. Front-end development: Introduction to HTML, CSS, and JavaScript, and how to
use these technologies to create responsive and dynamic user interfaces.
Back-end development: Introduction to server-side scripting languages like PHP. How to use
databases like MySQL to store and retrieve data.

Session Topics
NO
1 Introduction to Web Application Development
 WWW, HTTP, Hyperlink, URL ,Web Site, Web Page ,Web Brower’s
 Discuss the importance of HTML in web development
 what HTML stands for and what it is used for
 Discuss the structure of an HTML
 Introduce the concept of tags and attributes
2 How to link between pages of your site (internal links)
 How to link to other sites (external)
 How to structure the folders on your web site
 Internal document references
 Link attributes
 Other Type of links
3 Creating tables in HTML
 Table attributes
o Table level attributes
o Row level attributes
o Cell level attributes
 Page lay-out using tables
4 Creating forms in HTML
 Adding form elements
 HTML5 added the following attributes for <input>:
 the following attributes for <form>:
 autocomplete
 novalidate
5 HTML5 enhancements in form
 XHTML
 New attributes to existing form elements
 New form elements in HTML5
 XHTML is the strict form of HTML
6 Introduction to CSS (Cascading Style Sheets)
 Versions of CSS
 Advantages/Disadvantages of CSS
 CSS writing option External style sheet , Internal style sheet ,Inline style
 CSS rules
 Id,s and Classes
7 Controlling text with CSS
 Styling links ,Styling tables , Styling tables
 Revisions and Presentations
8 Revision
9 MID TERM

10 Introduction to JavaScript
 Embedding JavaScript with HTML
 Variables in JavaScript
 JavaScript operators
 JavaScript functions
Looping Statements
11 Dialog boxes in JavaScript
 HTML DOM Elements
 Finding HTML Elements
 Find an element by element
  Find elements by tag
 Find elements by class name
12 PHP overview
 What Can PHP Do?
 PHP constants
 PHP variables
 PHP Strings
 PHP is a Loosely Typed Language
 Basic PHP Syntax
13 Operators in PHP
 Conditional Statements in PHP
 Looping Statements
 Arrays in PHP
14 Database Connective
 Intro to MySQL
 Creating database in MySQL using XAMMP
 Connecting PHP with MySQL
 Inserting data in database
15 Introduction to WordPress
 Overview of WordPress as a content management system
 Setting up a local development environment
 Installing WordPress and configuring basic setting
16 Revisions and Presentations
17 Revision
18 Final Term