Department of

Computer Science and Engineering

Chairman:
Professor
Dr. Syed Md. Galib
PhD (Swinburne University of Technology, Australia)
MSc Engg. (Dalarna University, Sweden)
BSc Engg. (Khulna University, Bangladesh)
Email: [email protected]

List of faculty members:

Associate Professor
Dr. Md. Asif Nashiry
BSc and MSc (IU), PhD (ULeth, Canada)
Email: [email protected]

Dr. Md. Alam Hossain

BSc Engg. MSc Engg. and PhD (IU)
Email: [email protected], [email protected]

Assistant Professor
Md. Ashraful Islam (on study leave)
BSc Engg. and MSc Engg. (IU)
Email: [email protected]

Engr. Md. Kamrul Islam (on study leave)

BSc Engg. (KUET)
Email: [email protected]

Engr. Md. Arif Rahman (on study leave)

BSc and MSc (IUT), OCP DBA
Email: [email protected], [email protected]
Web: www.justarifrahman.com

Nazmul Hossain (on study leave)

BSc Engg. and MSc Engg. in CSE (JUST)
Email: [email protected], [email protected]

Md. Al Amin (on study leave)

BSc and MSc in CSE (IU)
Email: [email protected]

Mohammad Nowsin Amin Sheikh (on study leave)

BSc Engg. and MSc Engg. in CSE (JUST)
Email: [email protected]

Md. Yasir Arafat

BSc Engg. and MSc Engg. in CSE (JUST)
Email: [email protected]

1
Monishanker Halder
BSc Engg. and MSc Engg. in CSE (JUST)
Email: [email protected]

Dr. Md Nasim Adnan

BSc (KU) and MSc (BUET)
PhD (Charles Sturt University, Australia)
Email: [email protected]

Shauli Sarmin Sumi (on study leave)

BSc and MSc (IU)
MSc (UofL, Canada)
Email: [email protected]

Jannatul Ferdush (on study leave)

BSc Engg. and MSc Engg. in CSE (KUET)
Email: [email protected]

Md. Shafiuzzaman
BSc and MSc in Software Engineering (DU)
Email: [email protected]

Atish Kumar Dipongkor

BSc and MSc in Software Engineering (DU)
Email: [email protected]

Lecturer

Romana Rahman Ema

B.Sc. Engg. (CSE), M.Sc. Engg. (CSE)
Email: [email protected]

Mostafijur Rahman Akhond

Bachelor of Information Technology (DU)
Msc in CSE (Kyung Hee University, South Korea)
Email: [email protected]

Mustain Billah
M.Sc. (Engg.) in ICT, B.Sc. (Engg.) in ICT
Email: [email protected]

2
 Jashore University of Science and Technology
Department of Computer Science and Engineering

1.0 Introduction
Department of Computer Science and Engineering (CSE) is one of the oldest department at
Jashore University of Science and Technology, established in 2008. Currently it is offering B.Sc.
(Eng.); MS; PhD Degree. It is the leading educational department in its field which brings together
cross-disciplinary, world class researchers to meet the wide range of challenges faced in the field
of computer science and engineering. The Department mission is to technically sound man power
in the field of computer science and engineering who will be able to lead the nation in the new
era of 4 industrial revolution.
th

3
1.2 Message from Vice-Chancellor
It is my great pleasure to invite you to explore the Jashore University of Science and Technology (JUST)
online through our website. Contribution of science and technology for developing a nation is well
known to all. To meet up the diversified demand of people, information and communication
technology and biological sciences are playing the key role. University is the most suitable place for
education and research. Universities are playing a vital role in building efficient manpower for the
development of the country as well as for the global need. With a view to imparting science and
technology oriented education in Bangladesh, the Jashore University of Science & Technology was
established in 2007 by the Shadhinota Shorok (Independence Road) in Jashore district. The first batch
of students was admitted in 2008-2009 session. The honorable Prime Minister of the People’s
Republic of Bangladesh, Sheikh Hasina, inaugurated the campus of the university on December 27,
2010.

Within a very short period, the JUST already demonstrated its outreach excellence through
establishing linkages with the various government and non-government organizations for research,
extension and developmental activities. Our honorable Prime Minister has already declared the
Vision 2021 for the digitization (advance technology based, economically developed, corruption free)
of the country, Bangladesh. I strongly believe that this university will play a significant role to fulfil
this vision by producing science and technology based efficient manpower and enlightened citizen.
We always adapt the positive changes which is the need of time. Thus, by using this science and
technological knowledge we are motivated to boost up the world’s technology. As the Vice Chancellor
of the Jashore University of Science and Technology, I congratulate all and wish its success in future.

Professor Dr. M. Anwar Hossain

Vice Chancellor
Jashore University of Science and Technology
Jashore, Bangladesh

4
1.3 Message from Chairman
I warmly welcome you to the Department of Computer Science and Engineering (CSE) at Jashore
University of Science and Technology (JUST). JUST started its journey on June 10, 2009 with four
departments among which the department of CSE was the first department. Since then, CSE has been
widely recognized for its excellent research and teaching capabilities. The department provides an
outstanding opportunity to the students to get quality education in Computer Science and
Engineering. The graduates from JUST-CSE are heavily recruited by both academia and industry.
We are very proud of our graduates and their accomplishments; they are highly skilled IT
professionals who pursue successful careers in a wide range of contexts in the competitive global job
market.
To know more about the department and its programs, achievements and research activities, I invite
you to visit rest of our website at www.cse.just.edu.bd . Last but not the least, ours is a growing
family. You are most welcome to be a part of it. The common recruitment procedure is initiated
through public advertisement.

Prof. Dr. Syed Md. Galib

Professor and Chairman
email: [email protected]

5
 BSc in CSE Curriculum(OBE)
Jashore University of Science and Technology
Department of Computer Science and Engineering

Part A- Introduction

Vision of the University

To emerge as an institute of eminence in the fields of engineering, technology business and

management in serving the industry and the nation by empowering students with a high degree
of technical, managerial and practical competence.

Mission of the University

1. To strengthen the theoretical, practical and ethical dimensions of the learning process by
fostering a culture of research and innovation among faculty members and students.
2. To encourage long-term interaction between the academia and industry through the
involvement of the industry in the design of the curriculum and its hands-on
implementation
3. To strengthen and mound students in professional, ethical, social and environmental
dimensions by encouraging participation in co-curricular and extracurricular activities.

Quality Policy

To provide services of the highest quality both curricular and co-curricular; so that our students
can integrate their skills and serve the industry and society equally well at a global level.

Department of Computer Science and Engineering

Vision

Excellence in the state-of-art recent methodologies, techniques and technologies in the field of
Computer Science and Engineering through continuous learning and research.

6
 Mission

M1 Providing world class education in the area of computer science at

undergraduate and postgraduate level.

M2 Enable the graduates to get their way into higher studies and research across
the globe.

M3 Support society by encouraging technology transfer with computers and

software.

Program Education Objectives (PEO)

PEO1 Demonstrate proficiency in problem-solving techniques using the computer.

Exhibit expertise in high-level programming languages which can be applied to

PEO2
become skilled computer professionals.

Show abilities in the analysis of complex problems and the synthesis of solutions
PEO3
to those problems.

PEO4 Demonstrate comprehension of modern software engineering principles.

PEO5 Conduct cutting-edge research in various fields.

Apply ethical and social aspects of modern computing technology to the design,
PEO6
development and usage of computing artifacts.

PEO7 Develop leadership and management capabilities.

Enhance skills and embrace new computing technologies through self-directed

PEO8
professional development and training or education.

7
 Program Learning Outcome (PLO)

An ability to analyze a problem, and identify and define the computing

PLO1
requirements appropriate to its solution

An ability to design, implement, and evaluate a computer-based system, process,

PLO2
component, or program to meet desired needs

PLO3 An ability to function effectively on teams to accomplish a common goal.

An understanding of professional, ethical, legal, security and social issues and

PLO4
responsibilities.

PLO5 An ability to communicate effectively with a range of audiences.

An ability to analyze the local and global impact of computing on individuals,

PLO6
organizations, and on society.

Recognition of the need for and an ability to engage in continuing professional

PLO7
development.

An ability to apply mathematical, physics and chemistry foundations, algorithmic

principles, and electrical, electronics and computer science theory in the
PLO8
modeling and design of computer-based systems in a way that demonstrates
comprehension of the trade-offs involved in.

An ability to apply design and development principles in the construction of

PLO9
software systems of varying complexity.

Generic Skills

8
 GS1 Problem-Solving and Innovation

GS2 Analytical Skill and Creativity

GS3 Teamwork and Leadership

GS4 Research Skill and Awareness

GS5 Adaptation to Tools and Rapid Technological Changes

GS6 Communication and Interpersonal Skills

GS7 Entrepreneurship and Career Management

GS8 Social Responsibility

PEO to Mission Statement Mapping (todo)

PEOs M1 M2 M3

PEO1 3 1 1

PEO2 2 1 3

PEO3 2 2 2

PEO4 3 1 3

PEO5 1 3 3

PEO6 3 3 1

PEO7 1 1 3

9
PEO8 3 2 3

Correlation: 3- High, 2-Medium, 1-Low

10
 Mapping of PEOs to PLOs (todo)

PEOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

PEO1 3 3 3 1 1 1 3 1 3

PEO2 2 2 1 1 1 1 1 3 1

PEO3 2 1 1 1 3 2 2 2 3

PEO4 3 1 1 1 2 3 1 3 1

PEO5 2 2 1 1 1 3 3 1 1

PEO6 3 3 3 1 1 1 3 2 2

PEO7 3 2 3 1 1 2 2 1 1

PEO8 3 1 1 2 1 1 1 3 1

Correlation: 3- High, 2-Medium, 1-Low

11
 Part B- Structure

Structure of the curriculum

A. Duration of the program: 4yr (8 bi-yearly semesters)

B. Minimum credit requirements:

BSc (Eng.) in Computer Science and Engineering Program

The students enrolled under BSc (Hons) in CSE degree must complete their
studies within 4 (four) years of registration to obtain their degree. The minimum credit to
be earned for the degree is 160 (one hundred sixty) along with completion of all core
courses. The minimum CGPA requirement is 2.00 to obtain the degree.

C. Course Distribution
a. General Courses
i. Arts and Humanities
ii. Social Science
iii. Basic science
iv. Business studies
v. Ethics
b. Core courses
i. Major
ii. Minor
c. Elective courses
i. Major
ii. Minor
d. Capstone project/ Thesis/ Internship

D. Curriculum Structure

12
 Fields Credit Hours Percentage

Professional Theoretical Subjects (Computer, Software,

72 44%
Networking, Web etc.)

Professional Laboratory Subjects 32.5 20%

Field Work/Thesis/Project 17 10%

Related Subjects (both Theory and Lab) (EEE, Others) 9 6%

Mathematics 12 7%

Basic Science (Physics and Chemistry) 4 2%

Humanities and Language 5 3%

Business (Theory and Lab) 8.5 5%

Viva Voce 3 2%

Total 163 100%

Semester/Term/Year/Level wise Courses

First Year First Semester

Credit
Marks
Course Course distribution
Total Total
code Title Theory Lab
CT A SEE SE
(T) (Se)
CSE 1101 Introduction to Computer 3 0 3
Programming 20 8 72 0 100
CSE 1102 Introduction to Computer 0 3 1.5
Programming Lab 30 10 0 60 100
CSE 1103 Discrete Mathematics 3 0 3 20 8 72 0 100
EEE 1101 Fundamentals of Electrical and 3 0 3
Electronics 20 8 72 0 100
EEE 1102 Fundamentals of Electrical and 0 3 1.5
Electronics Lab 30 10 0 60 100

13
MATH 3 0 3
1101 Differential and Integral Calculus 20 8 72 0 100
CHEM 2 0 2
1101 Chemistry for Engineers 20 8 72 0 100
ENG 1102 English Language Skill Lab 0 2 1 30 10 0 60 100
HUM 1101 Bangladesh Studies 2 0 2 20 8 72 0 100
Total 16 8 20 210 78 432 180 900

First Year Second Semester

Credit
Marks
Course Course distribution
Total Total
code Title Theory Lab
CT A SEE SE
(T) (Se)
CSE 1201 Data Structures 3 0 3 20 8 72 0 100
CSE 1202 Data Structures Lab 0 3 1.5 30 10 0 60 100
CSE 1203 Digital Logic Design 3 0 3 20 8 72 0 100
CSE 1204 Digital Logic Design Lab 0 3 1.5 30 10 0 60 100
CSE 1206 Engineering Drawing 0 2 1 30 10 0 60 100
EEE 1201 Electronic Devices and Circuits 3 0 3 20 8 72 0 100
EEE 1202 Electronic Devices and Circuits Lab 0 3 1.5 30 10 0 60 100
MATH Differential Calculus and Geometry 3 0 3
1201 30 10 0 60 100
PHY 1201 Physics for Engineers 2 0 2 20 8 72 0 100
CSE 1200 Viva Voce 0 0 1 0 0 0 100 100
Total 14 11 20.5 230 82 288 400 1000

Second Year First Semester

Credit distribution Marks
Course Course
Theory Lab Total Total
code Title CT A SEE SE
(T) (Se)
CSE 2101 Object Oriented Programming 3 0 3 20 8 72 0 100
CSE 2102 Object Oriented Programming Lab 0 3 1.5 30 10 0 60 100
CSE 2103 Algorithm Analysis and Design 3 0 3 20 8 72 0 100
CSE 2104 Algorithm Analysis and Design Lab 0 3 1.5 30 10 0 60 100
CSE 2105 Computer Architecture 3 0 3 20 8 72 0 100
CSE 2107 Numerical Analysis 3 0 3 20 8 72 0 100

14
CSE 2108 Numerical Analysis Lab 0 3 1.5 30 10 0 60 100
HUM 2101 Sociology and Digester 2 0 2
Management 20 8 72 0 100
MATH Matrices, Vectors 2 0 2
2101 20 8 72 0 100
Total 16 9 20.5 210 78 432 180 900

Second Year Second Semester

Credit distribution Marks
Course Course
Theory Lab Total Total
code Title CT A SEE SE
(T) (Se)
CSE 2201 Data Communication 3 0 3 20 8 72 0 100
CSE 2203 Database Management System 3 0 3 20 8 72 0 100
CSE 2204 Database Management System 0 3 1.5
Lab 30 10 0 60 100
CSE 2205 Digital System Design 3 0 3 20 8 72 0 100
CSE 2208 Software Development Project- 1 0 3 1.5 30 10 0 60 100
MATH Probability and Statistics for 3 0 3
2201 Engineers 20 8 72 0 100
MATH Linear Algebra and Fourier 2 0 2
2203 Analysis 20 8 72 0 100
HUM 2201 Business Psychology 2 0 2 20 8 72 0 100
CSE 2200 Viva Voce 0 0 1 0 0 0 100 100
Total 16 6 20 180 68 432 220 900

Third Year First Semester

Credit
Marks
Course Course distribution
Total Total
code Title Theory Lab
CT A SEE SE
(T) (Se)
CSE 3101 Operating System and System 3 0 3
Programming 20 8 72 0 100
CSE 3102 Operating System and System 0 3 1.5
Programming Lab 30 10 0 60 100
CSE 3103 Computer Networks 3 0 3 20 8 72 0 100
CSE 3104 Computer Networks Lab 0 3 1.5 30 10 0 60 100
CSE 3105 Microprocessors and Embedded 3 0 3
Systems 20 8 72 0 100

15
CSE 3106 Assembly Programming and 0 3 1.5
Embedded Systems Lab 20 8 72 0 100
CSE 3107 Software Engineering 3 0 3 20 8 72 0 100
CSE 3108 Software Engineering Lab 0 3 1.5 30 10 0 60 100
CSE 3110 Web Development Lab 0 2 1 30 10 0 60 100
HUM Technology Transfer Policy and 2 0 2
3101 Professional Ethics 20 8 72 0 100
Total 14 15 21 240 88 432 240 1000

Third Year Second Semester

Credit
Marks
Course Course distribution
Total Total
code Title Theory Lab
CT A SEE SE
(T) (Se)
CSE 3201 Artificial Intelligence and Machine 3 0 3
Learning 20 8 72 0 100
CSE 3202 Artificial Intelligence and Machine 0 3 1.5
Learning Lab 30 10 0 60 100
CSE 3203 Compiler Design and Automata 3 0 3
Theory 20 8 72 0 100
CSE 3204 Compiler Design and Automata 0 3 1.5
Theory Lab 30 10 0 60 100
CSE 3205 Peripherals, Interfacing and IoT 3 0 3 20 8 72 0 100
CSE 3206 Peripherals, Interfacing and IoT Lab 0 3 1.5 30 10 0 60 100
CSE 3208 Software Development Project II 0 3 1.5 30 10 0 60 100
MATH Linear Algebra 3 0 3
3201 20 8 72 60 100
BUS 3202 Business Communication and 0 3 1.5
Technical Writing 30 10 0 60 100
CSE 3209 Simulation and Modeling 3 0 3 20 8 72 0 100
AIS 2101 Accounting and Information System 2 0 2 20 8 72 0 100
CSE3200 Viva Voce 0 0 1 0 0 0 100 100
Total 12 15 22.5 230 82 288 460 1200

16
 Fourth Year First Semester
Credit
Marks
Course Course distribution
Total Total
code Title Theory Lab
CT A SEE SE
(T) (Se)
CSE 4101 Computer Graphics and Multimedia 3 0 3 20 8 72 0 100
CSE 4102 Computer Graphics and Multimedia 0 3 1.5
Lab 30 10 0 60 100
CSE 4103 Digital signal and Image Processing 3 0 3 20 8 72 0 100
CSE 4104 Digital signal and Image Processing 0 3 1.5
Lab 30 10 0 60 100
CSE 4105 Computer Security 3 0 3 20 8 72 0 100
CSE XXXX Option-I 3 0 3 20 8 72 60 100
CSE XXXX Option-I Lab 0 3 1.5 30 10 0 60 100
CSE XXXX Option-II 3 0 3 20 8 72 60 100
BUS4101 E-commerce and Management 3 0 3
Information System 20 8 72 60 100
CSE 4000 Thesis/Project 0 0 3 30 10 0 60 100
Total 18 9 25.5 240 88 432 420 1000

Course Credit distribution Marks

Course code Total Total
Title Theory (T) Lab (Se) CT A SEE SE
CSE 4210 Internship 0 0 6 30 10 0 60 100
CSE 4212 Industrial Tour 0 0 1 30 10 0 60 100
CSE 4000 Thesis/Project 0 0 3 30 10 0 60 100
CSE 4200 Viva Voce 0 0 1 0 0 0 100 100
Total 0 0 11 90 30 0 280 400

Elective Courses for Option I and Option I Lab (pairwise)

Credit
Marks
Course Course distribution
Total Total
code Title Theory Lab
CT A SEE SE
(T) (Se)
CSE 4107 Robotics and Mechatronics 3 3 20 8 72 0 100
CSE 4108 Robotics and Mechatronics Lab 0 3 1.5 30 10 0 60 100
CSE 4109 Data Mining and Warehousing 3 3 20 8 72 0 100

17
CSE 4110 Data Mining and Warehousing Lab 0 3 1.5 30 10 0 60 100
CSE 4111 Software Testing and Quality 3 3
Assurance 20 8 72 0 100
CSE 4112 Software Testing and Quality 0 3 1.5
Assurance Lab 30 10 0 60 100
CSE 4113 Digital Forensic science 3 0 3 20 8 72 0 100
CSE 4114 Digital Forensic science Lab 0 3 1.5 30 10 0 60 100
CSE 4115 Software design pattern and 3 0 3
principles 20 8 72 0 100
CSE 4116 Software design pattern and 0 3 1.5
principles 30 10 0 60 100
Total 15 15 22.5 250 90 360 300 1000

Elective Courses for Option II

Credit
Marks
Course Course distribution
Total Total
code Title Theory Lab
CT A SEE SE
(T) (Se)
CSE 4121 Information control and cyber security 3 0 3 20 8 72 0 100
CSE 4123 Fault Tolerant Analysis 3 0 3 20 8 72 0 100
CSE 4125 Introduction to DNA Computing 3 0 3 20 8 72 0 100
CSE 4127 Software Project Management and 3 0 3
Maintenance 20 8 72 0 100
CSE 4129 Distributed System and Cloud 3 0 3
Computing 20 8 72 0 100
CSE 4131 Parallel and vector computing 3 0 3 20 8 72 0 100
CSE 4133 Cryptography 3 0 3 20 8 72 0 100
Total 21 0 21 140 56 504 0 700

18
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Introduction to Computer Programming

Part A- Introduction

I. Course code: CSE1101

II. Credit: 3

1. Course Summary
This is an introductory course on computer programming language. All the basic programming
details ranging from variable declaration to exception handling are covered in this course.
Primarily it is covered in C.

2. Course Objectives
1. Receive a basic knowledge of programming and the ability of reading with understanding
programs.
2. Able to solve basic programming problems using a variety of skills and strategies.
3. Examine working programs to identify their structures and apply appropriate techniques to
create entry-level programs

3. Course Learning Outcomes

1. Devise the primary idea to computer programming languages and their applicability
2. Learn to solve computing problems using programming languages.
3. Design the functions to understand reusability and efficiency
4. Explore the Read and Write operations from different I/O options
5. Utilize different data structures

19
Part B- Lesson Plan

Course Details Learning plan

Timeline Topics /contents Learning Outcomes Mapped Teaching Assessment

CLOs Strategies Strategies

Week 1 Programming, Learn how to begin CLO1 Lecture Quiz

Programming journey into
Language, Compiler, programming
IDE

Week 2 Header File, C Printf Learn C CLO1, Lecture Quiz

and Scanf Functions Programming CLO2 Exercise Assignment
Variables Basics Demonstration Practical
Data Types Exam
Constants
Comments
Operators

Week 3 If Statement in C Apply control CLO1 Lecture Quiz

If Else Statement in C structures Exercise Assignment
If and Else If Ladder Demonstration Practical
Statement Exam
Switch Statement

Week 4, Function In C Apply function and CLO3 Lecture Quiz

5 Introduction with recursion Exercise Assignment
Example Demonstration Practical
Function: Example with Exam
Parameters
Function : Call by
Value
Function : Call by
Reference
Recursion in C

Week 6 For loop Implement loop CLO1 Lecture Quiz

While loop Exercise Assignment
do-while loop Demonstration Practical
Exam

Week 7, Array in C Evaluate array, CLO1, Lecture Quiz

8,9 Array example ( Input string, pointers and CLO2, Exercise Assignment
and Output in an Array memory allocation CLO5 Demonstration Practical
) Exam
2D Array example
Passing array to

20
 function
Pointer to Pointer
Pointer Arithmetic
Dynamic Memory
Allocation Malloc
String in C
C Gets and Puts
Method
C String Function
C Math Function

Week 10 User defined data type: CLO5 Lecture Quiz

structures, unions, Explain user defined Exercise Assignment
enumeration; data types Demonstration Practical
Exam

Week 11 Input and output: CLO4 Lecture Quiz

standard input and Exercise Assignment
Explain input-output
output, formatted input Demonstration Practical
and output Exam

Week File Handling Write Apply file I/O CLO1, Lecture Quiz
12, 13 Data to File CLO4 Exercise Assignment
File Handling Read Demonstration Practical
Data to File Exam
C Preprocessor
Directive with Example

Week 14 Variable length Explain and apply CLO3 Lecture Quiz

argument list; argument list Exercise Assignment
Command line Demonstration Practical
parameters Exam

Part C- Assessment and Evaluations

Assessment Procedures

Assessment Description
Name

Quiz Quizzes are simple class tests with a duration from 20 minutes to 120 minutes. It can be
online or offline, students need to prepare for the quiz based on the instructed syllabus.

Assignment Type of home work assessment, students are given specific tasks and instructed to
complete them within a given period of time.

Practical Mostly related to laboratory works or by implementing in real code in either exercise
book or in programming IDE

21
Exam Each course contains a final exam considering the complete syllabus. It should be a
3hours exam for 72 marks. Students need to answer at most 6 questions. Every question
may include sub questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Test Assignment Quizzes External Participation
Marks (out of 20) (10) (5) (5) in Curricular/Co-
Curricular Activities
Remember 2
Understand 5
Apply 3
Analyze 2
Evaluate 4
Create 4

SEE-Semester End Examination (72 Marks)

Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

Mapping of CLOs to PLOs

CLOs 1. 2. 3. 4. 5. 6. 7. 8. 9.

CLO1 1 1 0 0 0 0 0 1 0

CLO2 1 1 0 0 0 0 0 1 1

CLO3 1 1 0 0 0 0 0 1 1

CLO4 1 1 0 0 0 0 0 1 1

CLO5 1 1 0 0 0 0 0 1 1

22
 Part D- Resources

Textbooks
1. Teach yourself C by Herbert Schildt
2. C: The Complete Reference by Herbert Schildt

Reference Books
1. Computer fundamentals and programming by Reema Thareja
2. C in a Nutshell: The Definitive Reference by Peter Prinz
3. Pointer in C Y. Kanitkar
4. Let us C by Y. Kanitkar
5. The C programming language by Kernighan & Ritchie
Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Introduction to Computer Programming Lab

Part A- Introduction

I. Course code: CSE1102

II. Credit: 1.5

1. Course Summary
This is an introductory course on computer programming language. All the basic programming
details ranging from variable declaration to exception handling are covered in practical lab
sessions in this course. Primarily it is covered in C.

2. Course Objectives
1. Apply the basic knowledge of programming and the ability of reading with understanding
coding materials.
2. Solve basic programming problems using a variety of skills and strategies.
3. Illustrate working programs to identify their structures and apply appropriate techniques to
create entry-level programs

3. Course Learning Outcomes

1. Solve computing problems using programming languages.

2. Design the functions to understand reusability and efficiency
3. Devise the Read and Write operations from different I/O options
4. Implement different data structures

23
Part B- Lesson Plan

Course Details Learning plan

Timeline Topics /contents Learning Outcomes Mapped Teaching Assessment

CLOs Strategies Strategies

Week 1 Programming, Learn how to begin CLO1 Lecture, Class

Programming journey into Demonstration Participation
Language, Compiler, programming
IDE

Week 2 Header File, C Printf Learn C CLO1, Lecture Assignment

and Scanf Functions Programming CLO2 Exercise Practical
Variables Basics Demonstration Exam
Data Types
Constants
Comments
Operators

Week 3 If Statement in C Apply control CLO1 Lecture

If Else Statement in C structures Exercise Assignment
If and Else If Ladder Demonstration Practical
Statement Exam
Switch Statement

Week 4, Function In C Apply function and CLO3 Lecture

5 Introduction with recursion Exercise Assignment
Example Demonstration Practical
Function: Example Exam
with Parameters
Function : Call by
Value
Function : Call by
Reference
Recursion in C

Week 6 For loop Implement loop CLO1 Lecture

While loop Exercise Assignment
do-while loop Demonstration Practical
Exam

Week 7, Array in C Evaluate array, CLO1, Lecture

8,9 Array example ( Input string, pointers and CLO2, Exercise Assignment
and Output in an Array memory allocation CLO5 Demonstration Practical
) Exam

24
 2D Array example
Passing array to
function
Pointer to Pointer
Pointer Arithmetic
Dynamic Memory
Allocation Malloc
String in C
C Gets and Puts
Method
C String Function
C Math Function

Week 10 User defined data type: CLO5 Lecture

structures, unions, Explain user Exercise Assignment
enumeration; defined data types Demonstration Practical
Exam

Week 11 Input and output: CLO4 Lecture

standard input and Explain input- Exercise Assignment
output, formatted input output Demonstration Practical
and output Exam

Week File Handling Write Apply file I/O CLO1, Lecture

12, 13 Data to File CLO4 Exercise Assignment
File Handling Read Demonstration Practical
Data to File Exam
C Preprocessor
Directive with
Example

Week 14 Variable length Explain and apply CLO3 Lecture

argument list; argument list Exercise Assignment
Command line Demonstration Practical
parameters Exam

Part C- Assessment and Evaluations

Assessment Procedures

Assessment Name Description

Attendance(Class Students should regularly attend the classes and actively participate in the
participation) class discussion.

Assignment Type of home work assessment, students are given specific tasks and
instructed to complete them within a given period of time.

25
Practical Mostly related to laboratory works or by implementing in real code in either
exercise book or in programming IDE

Exam Includes set of programming problems to solve within a timeline

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (40 Marks):

Bloom’s Category Test Attendance External Participation
Marks (out of 20) (30) (10) in Curricular/Co-
Curricular Activities
Remember 2
Understand 5
Apply 13
Analyze 2
Evaluate 4
Create 4
SE- Lab Final Exam (60 marks)
Bloom’s Category Test
Remember 5

Understand 10

Apply 25

Analyze 10

Evaluate 5
Create 5

Mapping of CLOs to PLOs

CLOs 1. 2. 3. 4. 5. 6. 7. 8. 9.

CLO1 1 1 0 0 0 0 0 1 0

CLO2 1 1 0 0 0 0 0 1 1

CLO3 1 1 0 0 0 0 0 1 1

26
CLO4 1 1 0 0 0 0 0 1 1

CLO5 1 1 0 0 0 0 0 1 1

Part D- Resources

Textbooks
1. Teach yourself C by Herbert Schildt
2. C: The Complete Reference by Herbert Schildt

Reference Books
1. Computer fundamentals and programming by Reema Thareja
2. C in a Nutshell: The Definitive Reference by Peter Prinz
3. Pointer in C Y. Kanitkar
4. Let us C by Y. Kanitkar
5. The C programming language by Kernighan & Ritchie

27
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Discrete Mathematics

Part A- Introduction

I. Course code: CSE1103

II. Credit: 3

1. Course Summary
One of the fundamental courses of computer science and engineering. Discrete math covers the
logic and their applications which are mapped further into the general mathematics, probability
and graph computation problems.

2. Course Objectives
1. Explain mathematical logic and set theory deeply.
2. Be able to apply number theory, functions and relations.
3. Have an in depth understanding of and be able to construct graphs and trees.

3. Course Learning Outcomes

1. Demonstrate logic and logical operations.

2. Measure proofing procedures
3. Illustrate number principals and their applications
4. Organize graph related terminologies
5. Examine group theory and isomorphism

Part B- Lesson Plan

Course Details Learning plan

Timeline Topics /contents Learning Mapped Teaching Assessment

Outcomes CLOs Strategies Strategies

28
Week 1, Introduction to logic, Describe logic, CLO1, Lecture, Quiz
2 proposition and tatology Identify logical CLO2 Exercise, Assignment
equivalence, Handouts Exam
Apply logical
operations

Week 3 Formal proofs and their Evaluate CLO1, Lecture, Quiz

applications equations CLO2 Exercise Assignment
Exam

Week 4 Predicate and quantifiers, The Convert the CLO1, Lecture, Quiz
Universe of Discourse. Rules natural sentences CLO2 Exercise, Assignment
of Inference: Universal into logical Handouts Exam
Specification & notions
Generalization.

Week 5 Set theory, functions and Examine set and CLO3 Lecture, Quiz
sequences functional Exercise, Assignment
operations Handouts Exam

Week 6 Elements of Number Theory: Apply number CLO3 Lecture, Quiz

Modular Arithmetic, and The theory and Exercise, Assignment
Euclidean Algorithm modular Handouts Exam
arithmetics

Week 7 The basic of counting and Describe counting CLO3 Lecture Quiz
pigeonhole principles, and probability Exercise Assignment
Introduction to discrete Exam
probability

Week 8 Bayes theorem, relations and Find the CLO3 Lecture, Quiz
their properties probability of Exercise, Assignment
complex events Handouts Exam
Discover relations
from sets

Week 9, Introduction to graph and CLO4, Lecture Quiz

Learn graph and
10 related terminologies CLO5 Exercise Assignment
its properties
Exam

Week 11 Paths, Circuits and their CLO5 Lecture Quiz

applications, Euler path & Examine the Exercise Assignment
circuit, Hamilton path and graph Exam
circuit, Dijkstra's algorithm for applications
shortest path

Week Tree and related terminologies Learn tree in CLO4 Lecture Quiz
12 graph Exercise Assignment
Exam

29
Week Tree applications, tree Apply tree in real CLO4, Lecture Quiz
13, 14 traversal, minimum spanning life applications CLO5 Exercise Assignment
tree Exam
Part C- Assessment and Evaluations

Assessment Procedures

Assessment Description
Name

Quiz Quizzes are simple class tests with a duration from 20 minutes to 120 minutes. It can be
online or offline, students need to prepare for the quiz based on the instructed syllabus.

Assignment Type of home work assessment, students are given specific tasks and instructed to
complete them within a given period of time.

Exam Each course contains a final exam considering the complete syllabus. It should be a
3hours exam for 72 marks. Students need to answer at most 6 questions. Every question
may include sub questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):
Bloom’s Category Test Assignment Quizzes External Participation
Marks (out of 20) (10) (5) (5) in Curricular/Co-
Curricular Activities
Remember 2
Understand 2
Apply 5
Analyze 5
Evaluate 5
Create 1

SEE-Semester End Examination (72 Marks)

Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 17
Evaluate 10
Create 5

Mapping of CLOs to PLOs

30
CLOs 1. 2. 3. 4. 5. 6. 7. 8. 9.

CLO1 1 0 0 0 0 0 0 1 0

CLO2 1 0 0 0 0 0 0 1 0

CLO3 1 1 0 0 0 1 0 1 0

CLO4 1 1 0 0 0 0 0 0 0

CLO5 1 1 0 0 0 0 0 0 0

Part D- Resources

Textbooks
1. Discrete Mathematics and its Applicationsby K. H. Rosen
2. Schaum's Outline of Discrete Mathematics

Reference Books
1. Discrete Mathematical Structures for Computer Science by Koleman& Busby
2. Discrete Mathematical Structures with Applications to Computer Science by Trembley &
Manohar

31
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Fundamentals of Electrical and Electronics

Part A- Introduction

II. Course code: EEE1101

III. Credit: 3

2. Course Summary
To be a computer engineer, one needs to study and apply electricity and electromagnetism in
different electrical applications
3. Course Objectives
1. To understand about concept of current, voltage and power.
2. To learn and study of DC network theorems and solve circuits.
3. To know about magnetic circuits and different magnetic theorem.
4. To know about ac fundamentals and solve different ac circuits.

4. Course Learning Outcomes

CLO1) Demonstrate logic and logical operations.

CLO2) Measure proofing procedures
CLO3) Illustrate number principals and their applications
CLO4) Organize graph related terminologies
CLO5) Examine group theory and isomorphism

Part B- Lesson Plan

Course Details Learning plan

Timeline Topics /contents Learning Mapped Teaching Assessment

Outcomes CLOs Strategies Strategies

32
Week 1, Fundamental electrical concepts: Describe logic, CLO1, Lecture, Quiz
2 Different measuring units Identify logical CLO2 Exercise, Assignment
equivalence, Handouts Exam
Apply logical
operations

Week 3 DC voltage, current, resistance Evaluate CLO1, Lecture, Quiz

and power; Series, networks equations CLO2 Exercise Assignment
definitions, mesh and node Exam
circuit analysis, reduction of a
complicated network, conversion
between T and π section.

Week 4 Networks transformations: Convert the CLO1, Lecture, Quiz

Equivalent circuit, Superposition natural CLO2 Exercise, Assignment
theorem, the reciprocity theorem, sentences into Handouts Exam
Thevenin’s theorem, Norton’s logical notions
theorem, Maximum power
transfer theorem.

Week 5 Introduction to magnetic Circuit: Examine set and CLO3 Lecture, Quiz
Transformer working principle, functional Exercise, Assignment
construction, and maintenance, operations Handouts Exam
transformer’s e.m.f equations

Week 6 Transformer regulation and Apply number CLO3 Lecture, Quiz

efficiency, different types of theory and Exercise, Assignment
transformer. modular Handouts Exam
arithmetics

Week 7 Electromagnetic Field: Describe CLO3 Lecture Quiz

Maxwell’s Equation, counting and Exercise Assignment
Electromagnetic wave equation probability Exam
and propagation, Pointing vector,

Week 8 Faraday's laws of Find the CLO3 Lecture, Quiz

electromagnetic induction, probability of Exercise, Assignment
Lenz's Law, Motional e.m.f, complex events Handouts Exam
Eddy current. Self and Mutual Discover
Inductance. relations from
sets

Week 9, Capacitor and Capacitance: CLO4, Lecture Quiz

10 Capacitance, Parallel plate Learn graph and CLO5 Exercise Assignment
capacitor, cylindrical capacitor, its properties Exam
spherical capacitor,

Week 11 capacitors in series & parallel, Examine the CLO5 Lecture Quiz
energy stored in a capacitor, graph Exercise Assignment
transformers. applications Exam

33
Week A.C Circuits: Instantaneous and Learn tree in CLO4 Lecture Quiz
12 r.m.s. values of current, voltage graph Exercise Assignment
and average power, Exam

Week Use of complex quantities in AC Apply tree in CLO4, Lecture Quiz

13, 14 circuits, resonant circuits, Q real life CLO5 Exercise Assignment
value and band width, frequency applications Exam
response.
Part C- Assessment and Evaluations

Assessment Procedures

Assessment Description
Name

Quiz Quizzes are simple class tests with a duration from 20 minutes to 120 minutes. It can be
online or offline, students need to prepare for the quiz based on the instructed syllabus.

Assignment Type of home work assessment, students are given specific tasks and instructed to
complete them within a given period of time.

Exam Each course contains a final exam considering the complete syllabus. It should be a
3hours exam for 72 marks. Students need to answer at most 6 questions. Every question
may include sub questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):
Bloom’s Category Test Assignment Quizzes External Participation
Marks (out of 20) (10) (5) (5) in Curricular/Co-
Curricular Activities
Remember 2
Understand 2
Apply 5
Analyze 5
Evaluate 5
Create 1

SEE-Semester End Examination (72 Marks)

Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 17
Evaluate 10

34
 Create 5

Mapping of CLOs to PLOs

CLOs 2. 3. 4. 5. 6. 7. 8. 9. 10.

CLO1 1 0 0 0 0 0 0 1 0

CLO2 1 0 0 0 0 0 0 1 0

CLO3 1 1 0 0 0 1 0 1 0

CLO4 1 1 0 0 0 0 0 0 0

CLO5 1 1 0 0 0 0 0 0 0

Part D- Resources

Textbooks

1. B.L. Theraja A text book of Electrical Technology, Volume: I.

2. V. K. Mehta Principles of Electrical Engineering and Electronics.
3. G. F. Corcoran Alternating Current Circuits.
4. Corson and Lorrain Introduction to Electromagnetic Field and Waves

35
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Fundamentals of Electrical and Electronics Lab

Part A- Introduction

III. Course code: EEE1102

IV. Credit: 1.5

3. Course Summary
To be a computer engineer, one needs to study and apply electricity and electromagnetism in
different electrical applications
4. Course Objectives
1. To understand about concept of current, voltage and power.
2. To learn and study of DC network theorems and solve circuits.
3. To know about magnetic circuits and different magnetic theorem.
4. To know about ac fundamentals and solve different ac circuits.

5. Course Learning Outcomes

CLO1) Apply logic and logical operations.

CLO2) Apply proofing procedures
CLO3) Examine number principals and their applications
CLO4) Demonstrate graph related terminologies
CLO5) Examine group theory and isomorphism

Part B- Lesson Plan

Course Details Learning plan

Timeline Topics /contents Learning Mapped Teaching Assessment

Outcomes CLOs Strategies Strategies

36
Week 1, Fundamental electrical concepts: Describe logic, CLO1, Lecture, Quiz
2 Different measuring units Identify logical CLO2 Exercise, Assignment
equivalence, Handouts Exam
Apply logical
operations

Week 3 DC voltage, current, resistance Evaluate CLO1, Lecture, Quiz

and power; Series, networks equations CLO2 Exercise Assignment
definitions, mesh and node Exam
circuit analysis, reduction of a
complicated network, conversion
between T and π section.

Week 4 Networks transformations: Convert the CLO1, Lecture, Quiz

Equivalent circuit, Superposition natural CLO2 Exercise, Assignment
theorem, the reciprocity theorem, sentences into Handouts Exam
Thevenin’s theorem, Norton’s logical notions
theorem, Maximum power
transfer theorem.

Week 5 Introduction to magnetic Circuit: Examine set and CLO3 Lecture, Quiz
Transformer working principle, functional Exercise, Assignment
construction, and maintenance, operations Handouts Exam
transformer’s e.m.f equations

Week 6 Transformer regulation and Apply number CLO3 Lecture, Quiz

efficiency, different types of theory and Exercise, Assignment
transformer. modular Handouts Exam
arithmetics

Week 7 Electromagnetic Field: Describe CLO3 Lecture Quiz

Maxwell’s Equation, counting and Exercise Assignment
Electromagnetic wave equation probability Exam
and propagation, Pointing vector,

Week 8 Faraday's laws of Find the CLO3 Lecture, Quiz

electromagnetic induction, probability of Exercise, Assignment
Lenz's Law, Motional e.m.f, complex events Handouts Exam
Eddy current. Self and Mutual Discover
Inductance. relations from
sets

Week 9, Capacitor and Capacitance: CLO4, Lecture Quiz

10 Capacitance, Parallel plate Learn graph and CLO5 Exercise Assignment
capacitor, cylindrical capacitor, its properties Exam
spherical capacitor,

Week 11 capacitors in series & parallel, Examine the CLO5 Lecture Quiz
energy stored in a capacitor, graph Exercise Assignment
transformers. applications Exam

37
Week A.C Circuits: Instantaneous and Learn tree in CLO4 Lecture Quiz
12 r.m.s. values of current, voltage graph Exercise Assignment
and average power, Exam

Week Use of complex quantities in AC Apply tree in CLO4, Lecture Quiz

13, 14 circuits, resonant circuits, Q real life CLO5 Exercise Assignment
value and band width, frequency applications Exam
response.
Part C- Assessment and Evaluations

Assessment Procedures

Assessment Description
Name

Quiz Quizzes are simple class tests with a duration from 20 minutes to 120 minutes. It can be
online or offline, students need to prepare for the quiz based on the instructed syllabus.

Assignment Type of home work assessment, students are given specific tasks and instructed to
complete them within a given period of time.

Exam Each course contains a final exam considering the complete syllabus. It should be a
3hours exam for 72 marks. Students need to answer at most 6 questions. Every question
may include sub questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (40 Marks):

Bloom’s Category Test Attendance External Participation
Marks (out of 20) (30) (10) in Curricular/Co-
Curricular Activities
Remember 2
Understand 5
Apply 13
Analyze 2
Evaluate 4
Create 4

SE- Lab Final Exam (60 marks)

Bloom’s Category Test
Remember 5

Understand 10

38
 Apply 25

Analyze 10

Evaluate 5

Create 5

Mapping of CLOs to PLOs

CLOs 3. 4. 5. 6. 7. 8. 9. 10. 11.

CLO1 1 0 0 0 0 0 0 1 0

CLO2 1 0 0 0 0 0 0 1 0

CLO3 1 1 0 0 0 1 0 1 0

CLO4 1 1 0 0 0 0 0 0 0

CLO5 1 1 0 0 0 0 0 0 0

Part D- Resources

Textbooks

5. B.L. Theraja A text book of Electrical Technology, Volume: I.

6. V. K. Mehta Principles of Electrical Engineering and Electronics.
7. G. F. Corcoran Alternating Current Circuits.
8. Corson and Lorrain Introduction to Electromagnetic Field and Waves

Jashore University of Science and Technology

Faculty of Science and Engineering
Department of Computer Science and Engineering

39
 Course Outline: Differential and Integral Calculus

Part A- Introduction

Course code: MATH 1101

Credit: 3
1. Course Summary
To be a computer Engineer one has to have sound knowledge about function, limit, Derivatives,
applications of differentiation, integrals and application of integration

2. Course Objectives
1. To Learn about various limit problems algebraically and graphically.
2. To Examine and Apply the continuity and differentiability of various types of function.
3. To gain knowledge about Integration and application of Integration.

3. Course Learning Outcomes

CLO1) Learn differential mathematics

CLO2) Measure differential mathematics
CLO3) Illustrate differential mathematics
CLO4) Learn Integral mathematics
CLO5) Measure Integral mathematics

Part B- Lesson Plan

Course Details Learning plan

Timeline Topics /contents Learning Mapped Teaching Assessment

Outcomes CLOs Strategies Strategies

Week 1, Graphing Functions, Describe logic, CLO1, Lecture, Quiz

2 Mathematical Models and Identify logical CLO2 Exercise, Assignment
Commonly used Functions equivalence, Handouts Exam
(Linear, Polynomial, Power), Apply logical
operations

Week 3 Mathematical Models and Evaluate CLO1, Lecture, Quiz

Commonly Used Functions equations CLO2 Exercise Assignment
(Algebraic, Trigonometric, Exam
Exponential, and Logarithmic
Functions),

Week 4 Derivatives and Rate of Change, Convert the CLO1, Lecture, Quiz

40
 Derivatives as Functions, natural CLO2 Exercise, Assignment
sentences into Handouts Exam
logical notions

Week 5 Rates of Change in Natural and Examine set and CLO3 Lecture, Quiz
Social Sciences, Exponential functional Exercise, Assignment
Growth and Decay, Linear operations Handouts Exam
Approximation and Differentials,

Week 6 Finding Minimum and Maximum Apply number CLO3 Lecture, Quiz
Value of Functions and the first theory and Exercise, Assignment
and Second Derivative Tests, modular Handouts Exam
Indeterminate Forms and arithmetics
L'Hospital's Rule, Curve
Sketching.

Week 7 Riemann Sum and Definite Describe CLO3 Lecture Quiz

Integrals, Properties of Integrals, counting and Exercise Assignment
Fundamental Theorem of probability Exam
Calculus, Anti-Derivative and
Indefinite Integral, Net Change
Theorem, Substitution Rule.

Week 8 Theorem of Calculus, Anti- Find the CLO3 Lecture, Quiz

Derivative and Indefinite probability of Exercise, Assignment
Integral, Net Change Theorem, complex events Handouts Exam
Substitution Rule. Discover
relations from
sets

Week 9, Transformations (Scaling, CLO4, Lecture Quiz

10 Reflection, Composition), Learn graph and CLO5 Exercise Assignment
Inverse of Functions, Growth of its properties Exam
Functions.

Week 11 Differentiability of Functions, Examine the CLO5 Lecture Quiz

Rules and Techniques of graph Exercise Assignment
Differentiation. applications Exam

Week Finding Area between Curves, Learn tree in CLO4 Lecture Quiz
12 Volumes, Volumes by graph Exercise Assignment
Cylindrical Shells, Exam

Week Average Value of a Function, Apply tree in CLO4, Lecture Quiz

13, 14 Mean Value Theorem for real life CLO5 Exercise Assignment
Integrals. applications Exam

Part C- Assessment and Evaluations

41
Assessment Procedures

Assessment Description
Name

Quiz Quizzes are simple class tests with a duration from 20 minutes to 120 minutes. It can be
online or offline, students need to prepare for the quiz based on the instructed syllabus.

Assignment Type of home work assessment, students are given specific tasks and instructed to
complete them within a given period of time.

Exam Each course contains a final exam considering the complete syllabus. It should be a
3hours exam for 72 marks. Students need to answer at most 6 questions. Every question
may include sub questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):
Bloom’s Category Marks Test Assignment Quizzes External Participation in
(out of 20) (10) (5) (5) Curricular/Co-Curricular
Activities
Remember 2
Understand 2
Apply 5
Analyze 5
Evaluate 5
Create 1

SEE-Semester End Examination (72 Marks)

Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 17
Evaluate 10
Create 5

Mapping of CLOs to PLOs

CLOs 4. 5. 6. 7. 8. 9. 10. 11. 12.

CLO1 1 0 0 0 0 0 0 1 0

42
CLO2 1 0 0 0 0 0 0 1 0

CLO3 1 1 0 0 0 1 0 1 0

CLO4 1 1 0 0 0 0 0 0 0

CLO5 1 1 0 0 0 0 0 0 0

Part D- Resources

Textbooks
1. Howard Anton Calculus
2. Thomas Finney Calculus and Analytical Geometry
3. E.R. Swokowski Calculus with Analytic Geometry
4. M.R. Spiegel Advanced Calculus
5. S.P. Gordon Calculus and the Computer.

43
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Chemistry for Computer

Part A- Introduction

I. Course code: CHEM1101

II. Credit: 3

1. Course Summary
A computer scientist or engineer may choose to be expert in cheminformatics or
computational chemistry. Therefore, he or she should have a sound knowledge and
deep understanding of chemistry.

2. Course Objectives
1. Know the crystal symmetry.
2. Understand the characteristics of solution.
3. Explain chemical equilibrium.
4. Learn basics of nuclear chemistry.

3. Course Learning Outcomes

CLO1) Apply the fundamental concepts of Chemistry.

CLO2) Design solution for chemical problems.
CLO3) Analyze chemical equilibrium.
CLO4) Apply nuclear chemistry.

Part B- Lesson Plan

Course Details Learning plan

Timeline Topics /contents Learning Mapped Teaching Assessment

Outcomes CLOs Strategies Strategies

Week 1 Different methods for the Learn CLO 1 Lecture, Quiz

determination of structure; chemistry Demonstration, Participation
Structures of the metallic basisc handouts Exam
elements and certain
compounds with three

44
 dimensional lattices; Defects
in solid; Semiconductors:
Structures of Si, Ge, B, N, P,
In. Types of Semiconductor,
Electronic and band theory

Week 2 Type of solutions, Units of Learn CLO 1 Lecture, Quiz

,3 concentration. Solution of gas chemistry handouts Participation
in liquid, basisc Exam

Week 4, Henry's law. Solution of solid Identify and CLO 2 Lecture, Quiz
5, 6 in liquid, solubility curve. explain Demonstration, Participation
Distribution law and its solution handouts Exam
application. Solvent
extraction, Colligative
properties of dilute solution.

Week 7, Law of mass-action, Identify and CLO 2 Lecture, Quiz

8 Chemical equilibrium and explain Demonstration, Participation
Equilibrium Constants, solution handouts Exam
Application of law of mass-
action

Week 9, Homogeneous and Explain CLO 2 Lecture, Quiz

10 Heterogeneous Equilibrium, chemical Demonstration, Participation
Le-Chatelier Principle, equilibrium handouts Exam
Applications of principle of
mobile equilibrium to
reaction of industrial
importance.
Week 11, Radioactivity, Patterns of Explain CLO 3 Lecture, Quiz
12 Nuclear Stability, Nuclear chemical Demonstration Participation
Transmutations, equilibrium Exam

Week 13 Rates of Radioactive Decay, Learn CL03 Lecture, Quiz

Detection of Radioactivity, nuclear CLO 4 Demonstration, Participation
Energy Changes in Nuclear chemistry handouts Exam
Reactions.

Week 14 Nuclear Fission, Nuclear Learn CLO 4 Lecture, Quiz

Fusion, Isotopes, Isobar, nuclear Demonstration Participation
Isomers, Methods of chemistry Exam
Separation of Isotopes,
Applications of
Radioisotopes, Biological

45
 Effects of Radiation.

Part C- Assessment and Evaluations

Assessment Procedures

Assessment Description
Name

Participation Attendance and participate in the class discussion

Quiz Quizzes are simple class tests with a duration from 20 minutes to 120 minutes. It can be
online or offline, students need to prepare for the quiz based on the instructed syllabus.

Exam Each course contains a final exam considering the complete syllabus. It should be a
3hours exam for 72 marks. Students need to answer at most 6 questions. Every question
may include sub questions

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Test Assign Quizzes External Participation in
Marks (out of 20) (10) ment (5) Curricular/Co-Curricular
(5) Activities
Remember 2
Understand 5
Apply 3
Analyze 2
Evaluate 4
Create 4

SEE-Semester End Examination (72 Marks)

Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

Mapping of CLOs to PLOs

46
CLOs 1. 2. 3. 4. 5. 6. 7. 8. 9.

CLO1 1 0 0 0 0 0 0 0 0

CLO2 1 1 1 0 1 0 0 0 1

CLO3 1 1 1 0 1 0 0 0 1

CLO4 1 1 0 0 0 0 0 0 1

Part D- Resources

Textbooks

Authors Book Name

1. G.M. Barrow Physical Chemistry

2. M.M. Haque and M.A.Nawab Principles of Physical Chemistry
3. B. S. Bhal and G. D. Tuli Essential of Physical Chemistry
4. S. Z. Haider Introduction to Modern Inorganic Chemistry
5. R.D. Madan Modern Inorganic Chemistry
6. S. Gilreath Fundamental Concepts of Inorganic Chemistry
7. R. M. Felder and R. W. Rousseau Elementary Principles of Chemical Engineering

47
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: English language Skills Lab

Part A- Introduction

I. Course code: ENG1102

II. Credit: 1

1. Course Summary
To be a global IT expert, a student must have the communication skill in an
international language and English is the most and widely used language. Therefore,
learning Communicative English is a must for a CSE student.

2. Course Objectives
1. Talk about themselves, their families and their weekly schedules.
2. Memorize and use various set phrases for use in all of their classes.
3. Ask questions of other members of the class in English to help carry on a conversation
and to expand on a topic.
4. Identify various parts of an English newspaper and predict the topic of the article based
on the headline.
5. Make a video of themselves and reflect on their improvement over the course of the
semester.
6. Understand the importance of their learning portfolio and demonstrate their knowhow on
how to make one for their courses.

4. Course Learning Outcomes

CLO1) Apply the fundamental concepts of English.

CLO2) Learn basic grammar for engineers.
CLO3) Identify article.
CLO4) Understand the importance of learning portfolio.

48
Part B- Lesson Plan

Course Details Learning plan

Timeline Topics /contents Learning Mapped Teaching Assessment

Outcomes CLOs Strategies Strategies

Week 1 Reading Comprehension, Recognizing CLO 1 Lecture, Quiz

vocabulary building communication Demonstration, Participation
skills(Reading handouts Exam

Week 2 Précis/summarizing, Summarize CLO 1 Lecture, Quiz

,3 development of writing handouts Participation
skill, Exam

Week 4, paragraph development, Paragraph CLO 2 Lecture, Quiz

5, 6 report writing, letter writing Demonstration, Participation
writing (formal/informal), handouts Exam
newspaper article writing.

Week 7, Learn POS CLO 2 Lecture, Quiz

8 Parts of Speech, Subject- Demonstration, Participation
Verb agreement, Articles, handouts Exam

Week 9, Tense form, Phrase & Learn Tense CLO 2 Lecture, Quiz
10 Clause, Making Demonstration, Participation
Questions, Gerund and handouts Exam
Participle,

Week 11, Appropriate preposition, Place CLO 3 Lecture, Quiz

12 Word formation appropriate Demonstration Participation
processes, Verbs & Preposition Exam
adjectives, Using
dictionary,

Week 13 Real life word associated Place CL03 Lecture, Quiz

with science & appropriate CLO 4 Demonstration, Participation
technology, Preposition handouts Exam

Week 14 Places, clothes, foods, Place CLO 4 Lecture, Quiz

shopping, family, appropriate Demonstration Participation
hobbies, health, Preposition Exam
entertainment, transport
and education.

49
Part C- Assessment and Evaluations

Assessment Procedures

Assessment Description
Name

Participation Attendance and participate in the class discussion

Quiz Quizzes are simple class tests with a duration from 20 minutes to 120 minutes. It can be
online or offline, students need to prepare for the quiz based on the instructed syllabus.

Exam Each course contains a final exam considering the complete syllabus. It should be a
3hours exam for 72 marks. Students need to answer at most 6 questions. Every question
may include sub questions

CIE- Continuous Internal Evaluation (40 Marks):

Bloom’s Category Test Attendance External Participation
Marks (out of 20) (30) (10) in Curricular/Co-
Curricular Activities
Remember 2
Understand 5
Apply 13
Analyze 2
Evaluate 4
Create 4
SE- Lab Final Exam (60 marks)
Bloom’s Category Test
Remember 5

Understand 10

Apply 25

Analyze 10

Evaluate 5

Create 5

Mapping of CLOs to PLOs

50
CLOs 2. 3. 4. 5. 6. 7. 8. 9. 10.

CLO1 1 0 0 0 0 0 0 0 0

CLO2 1 1 1 0 1 0 0 0 1

CLO3 1 1 1 0 1 0 0 0 1

CLO4 1 1 0 0 0 0 0 0 1

Part D- Resources

Textbooks

Authors Book Name

1. Wren & Martin High school English Grammar” S. Chand & Company
2. Raymond Murphy Intermediate English Grammar
3. Jones Leo Communicative Grammar Practice
4. John Eastwood Oxford Practice Grammar
5. Sadruddin Ahmed Learning English The Easy Way.

51
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Bangladesh Studies

Part A- Introduction

I. Course code: HUM1101

II. Credit: 2

1. Course Summary
Each and every individual of a country should have adequate knowledge about the
history, culture, economical and sociological aspects of his own country. Bangladesh
Studies will provide students an overall view of the Land and People, Emergence of
Sovereign State, Political Culture and Administration, Natural Resources, Economy
and Sociology of Bangladesh

2. Course Objectives
1. Acquire knowledge about the economy and sociology of Bangladesh.
2. Understand the history and culture of Bangladesh.
3. Gather clear concept about political culture and administration of Bangladesh

3. Course Learning Outcomes

CLO1) Devise the knowledge of Bangladesh

CLO2) Learn the history of Bangladesh
CLO3) Explore the life of Bangobandhu Sheikh Mujibur Rahman
CLO4) Learn the political and cultural administration of Bangladesh.

Part B- Lesson Plan

Course Details Learning plan

Timeline Topics /contents Learning Mapped Teaching Assessment

Outcomes CLOs Strategies Strategies

Week 1 A brief history, Culture, Land and People CLO 1 Lecture, Quiz

52
 Language and Religion of the of Bangladesh Demonstration, Participation
land; Population, handouts Exam

Week 2 Ethnological origin and Land and People CLO 1 Lecture, Quiz
,3 Occupation/Profession of the of Bangladesh handouts Participation
people. Exam

Week 4, Economic factors; Political Knowledge CLO 2 Lecture, Quiz

5, 6 factors: Language movement about Demonstration, Participation
(1952), Six Point Movement Emergence of handouts Exam
(1966), Mass upsurge (1969); Sovereign State
Bangabandhu and of Bangladesh
Independence of Bangladesh
(1971).

Week 7, Introduction to the Knowledge CLO 2 Lecture, Quiz

8 Bangladesh Constitution; about Demonstration, Participation
Forms of Government since Emergence of handouts Exam
independence; Democracy; Sovereign State
Administrative System in of Bangladesh
Bangladesh.

Week 9, Introduction to Bangladesh Knowledge CLO 2 Lecture, Quiz

10 economy, Major economic about Political Demonstration, Participation
Sectors: Agriculture, Culture and handouts Exam
Industry and Services; Role Administration
of Women in national of Bangladesh
economy.

Week 11, Scope, Social evolution and Knowledge CLO 3 Lecture, Quiz
12 techniques of production, about Political Demonstration Participation
Culture and civilization, Culture and Exam
Social structure of Administration
Bangladesh. Population and of Bangladesh
world resources. Oriental and
Occidental societies,
History of Nation’s father

Week 13 Economics of development Knowledge CLO 4 Lecture, Quiz

and planning, basic concept- about Sociology Demonstration, Participation
saving, investment, GNP, of Bangladesh handouts Exam
NNP. Fiscal policy,
monetary policy and trade
policy, some planning tools-
capital output ratio, input
analysis.

Week 14 Industrial revolution. Family Knowledge CLO 4 Lecture, Quiz

- Urbanization and about Sociology Demonstration Participation
industrialization, Urban of Bangladesh Exam
Ecology, Co-operative and

53
 socialist movements, rural
sociology.

Part C- Assessment and Evaluations

Assessment Procedures

Assessment Description
Name

Participation Attendance and participate in the class discussion

Quiz Quizzes are simple class tests with a duration from 20 minutes to 120 minutes. It can be
online or offline, students need to prepare for the quiz based on the instructed syllabus.

Exam Each course contains a final exam considering the complete syllabus. It should be a
3hours exam for 72 marks. Students need to answer at most 6 questions. Every question
may include sub questions

Bloom’s Test (10) Assignment Quizzes External Participation in

Category Marks (5) (5) Curricular/Co-Curricular
(out of 20) Activities
Remember 2
Understand 5
Apply 3
Analyze 2
Evaluate 4
Create 4
CIE- Continuous Internal Evaluation (28 Marks):

SEE-Semester End Examination (72 Marks)

Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

54
Mapping of CLOs to PLOs

CLOs 1. 2. 3. 4. 5. 6. 7. 8. 9.

CLO1 0 0 0 0 0 0 1 0 0

CLO2 0 1 1 0 1 0 1 0 1

CLO3 0 1 1 0 1 0 1 0 1

CLO4 0 1 0 0 0 0 1 0 1

Part D- Resources

Textbooks
1. Banglapedia. National Encyclopedia, Asiatic Society of Bangladesh, Dhaka
2. Bangladesh at the Crossroads. University Press Ltd
3. Bangladesh: A Political History since Independence. London: IB Taurus

55
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Data Structures

Part A- Introduction

I. Course code: CSE 1201

II. Credit: 3

1.Course Summary
To become a successful computer professional, one needs to have in depth knowledge of data
structures to apply them in problem solving and algorithms to analyze different solutions to
problems.

2.Course Objectives

1. Apply different data structures to problem solving

2. Explain different algorithms of solutions to problems.
3. Analyze different problem solutions

3.Course Learning Outcomes

1. Implements basic data structures such as Stacks, Queues, Graph and Trees.
2. Uses Big 'O' notation to express algorithmic running time.
3. Describes and analyzes elementary sorting algorithms such as Selection sort, Bubble
sort, Insertion sort, and Shell sort.
4. Understands and restates the fundamentals of basic data structures.
5. Designs and analyzes simple algorithms.

Part B- Lesson Plan

Course Details Learning plan

Timeline Topics /contents Learning Mapped Teaching Assessment

Outcomes CLOs Strategies Strategies

56
 Stacks, Queues and Recursion: Apply stacks, CLO1 Lecture Quiz
Fundamentals,Different types of queues and Exercise Assignment
stacks and queues: Circular, recursion; Demonstration Practical
Week 1 dequeues etc.; evaluation of Differentiate Exam
Week 2 expressions, multiple stacks and between
Week 3 queues; Recursion: Direct and stacks and
indirect recursion, depth of queues;
recursion; Simulation of Evaluate
Recursion: Removal of Recursion; expressions
Towers of Hanoi. using stacks;
Analyze
recursive
functions;

Elements of Graphs and Trees: Construct CLO1 Lecture Quiz

Week 4 Graph Terminology, Paths and graphs and Exercise Assignment
Week 5 Circuits, Connectedness, Matrix trees; Demonstration Practical
Week 6 Representation of Graph and Differentiate Exam
Isomorphism of graphs. Trees, between
Rooted trees, Path Lengths in graphs and
Rooted Trees. trees

Linked Lists: Construct CLO4 Lecture Quiz

Single linked lists, Linked stacks linked lists; Exercise Assignment
and queues, the storage pool, Apply linked Demonstration Practical
Week 7 polynomial addition, equivalence lists to stacks Exam
Week 8 relations, sparse matrices, doubly and queues;
linked lists and dynamic storage Analyze
management, generalized lists, memory
garbage collection and allocation;
compaction.

Week 9 Extended binary trees: Construct CLO4 Lecture Quiz

Week 10 2-trees, internal and external path and apply Exercise Assignment
lengths, Huffman codes/algorithm; extended Demonstration Practical
Threaded binary trees, binary tree binary trees Exam
representation of trees;
Application of Trees: Set
representation, decision trees,
game trees; Counting binary trees.

Sorting: Apply CLO3 Lecture Quiz

Searching, bubble sort, shell sort, sorting Exercise Assignment
Week 11 insertion sort, selection sort, quick algorithms; Demonstration Practical
Week 12 sort, heap sort, 2-way merge sort, Distinguish Exam
sorting on several keys, practical among
considerations of internal sorting. sorting
searching, hash techniques. algorithms;

57
 Algorithms: Apply CLO2, Lecture Quiz
Techniques for analysis of algorithmic CLO5 Exercise Assignment
algorithms; Algorithmic techniques; Demonstration Practical
Techniques: divide-and-conquer, Analyze Exam
greedy method, dynamic algorithms;
Week 13 programming, backtracking,
Week 14 branch and bound; Flow
algorithms. Topological sorting;
Connected components; spanning
trees; Shortest paths; Algebraic
simplification and
transformations; Lower bound
theory; NP-completeness; NP-
hard and NP-complete problems;
Approximation Algorithms;
Introduction to parallel
algorithms.

Part C- Assessment and Evaluations

Assessment Procedures

Assessment Description
Name

Quiz Quizzes are simple class tests with a duration from 20 minutes to 120 minutes. It can be
online or offline, students need to prepare for the quiz based on the instructed syllabus.

Assignment Type of home work assessment, students are given specific tasks and instructed to
complete them within a given period of time.

Practical Mostly related to laboratory works or by implementing in real code in either exercise
book or in programming IDE

Exam Each course contains a final exam considering the complete syllabus. It should be a
3hours exam for 72 marks. Students need to answer at most 6 questions. Every question
may include sub questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Test (10) Assignm Quizzes External Participation in
Marks (out of 20) ent (5) Curricular/Co-Curricular

58
 (5) Activities
Remember 2
Understand 5
Apply 3
Analyze 2
Evaluate 4
Create 4

SEE-Semester End Examination (72 Marks)

Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

Mapping of CLOs to PLOs

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 1 0 0 0 0 1 0 0 0

CLO2 0 1 0 0 0 0 1 0 0

CLO3 0 0 1 0 0 0 0 1 1

CLO4 0 0 0 1 0 0 0 1 0

CLO5 0 0 0 0 1 0 0 0 1

Part D- Resources

Textbooks

59
 1. Theory and Problem of Data Structures by S. Lipschutz
2. Data Structure by E. Horowitz
Reference Books
1. The Art of Computer Programming, Vol. 1, Fundamental Algorithms by D. E. Knuth
2. The Art of Computer Programming, Vol. 2, Fundamental Algorithms by D. E. Knuth
3. The Art of Computer Programming, Vol. 3, Fundamental Algorithms by D. E. Knuth

60
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Data Structures Lab

Part A- Introduction

I. Course code: CSE 1202

II. Credit: 1.5

1. Course Summary
To become a successful computer professional, one needs to have in depth knowledge of data
structures to apply them in problem solving and algorithms to analyze different solutions to
problems.

2. Course Objectives

1. Apply different data structures to problem solving

2. Explain different algorithms of solutions to problems.
3. Analyze different problem solutions

3. Course Learning Outcomes

CLO1. Implements basic data structures such as Stacks, Queues, Graph and Trees.
CLO2. Uses Big 'O' notation to express algorithmic running time.
CLO3. Describes and analyzes elementary sorting algorithms such as Selection sort,
Bubble sort, Insertion sort, and Shell sort.
CLO4. Understands and restates the fundamentals of basic data structures.
CLO5. Designs and analyzes simple algorithms.

61
Part B- Lesson Plan

Course Details Learning plan

Timeline Topics /contents Learning Mapped Teaching Assessment

Outcomes CLOs Strategies Strategies

Stacks, Queues and Apply stacks, CLO1 Lecture Quiz

Recursion: queues and
Fundamentals,Differen recursion; Exercise Assignment
t types of stacks and Demonstration Practical Exam
queues: Circular, Differentiate
Week 1 dequeues etc.; between stacks and
evaluation of queues;
Week 2
expressions, multiple Evaluate
Week 3 stacks and queues; expressions using
Recursion: Direct and stacks;
indirect recursion,
depth of recursion; Analyze recursive
Simulation of functions;
Recursion: Removal of
Recursion; Towers of
Hanoi.

Elements of Graphs Construct graphs CLO1 Lecture Quiz

and Trees: and trees;
Week 4 Exercise Assignment
Graph Terminology, Differentiate
Week 5 Paths and Circuits, between graphs and Demonstration Practical Exam
Week 6 Connectedness, Matrix trees
Representation of
Graph and
Isomorphism of
graphs. Trees, Rooted
trees, Path Lengths in
Rooted Trees.

Linked Lists: Construct linked CLO4 Lecture Quiz

lists;
Single linked lists, Exercise Assignment
Linked stacks and Apply linked lists
queues, the storage to stacks and Demonstration Practical Exam
Week 7 pool, polynomial queues;
addition, equivalence
Week 8 relations, sparse Analyze memory
matrices, doubly allocation;

62
 linked lists and
dynamic storage
management,
generalized lists,
garbage collection and
compaction.

Week 9 Extended binary Construct and apply CLO4 Lecture Quiz

trees: extended binary
Week 10 trees Exercise Assignment
2-trees, internal and
external path lengths, Demonstration Practical Exam
Huffman
codes/algorithm;
Threaded binary trees,
binary tree
representation of trees;
Application of Trees:
Set representation,
decision trees, game
trees; Counting binary
trees.

Sorting: Apply sorting CLO3 Lecture Quiz

algorithms;
Searching, bubble sort, Exercise Assignment
shell sort, insertion Distinguish among
Week 11 sort, selection sort, sorting algorithms; Demonstration Practical Exam
Week 12 quick sort, heap sort,
2-way merge sort,
sorting on several
keys, practical
considerations of
internal sorting.
searching, hash
techniques.

Algorithms: Apply algorithmic CLO2, Lecture Quiz

techniques; CLO5
Techniques for Exercise Assignment
analysis of algorithms; Analyze
Algorithmic algorithms; Demonstration Practical Exam
Techniques: divide-
and-conquer, greedy
method, dynamic
programming,
Week 13
backtracking, branch
Week 14 and bound; Flow
algorithms.

63
 Topological sorting;
Connected
components; spanning
trees; Shortest paths;
Algebraic
simplification and
transformations;
Lower bound theory;
NP-completeness; NP-
hard and NP-complete
problems;
Approximation
Algorithms;
Introduction to parallel
algorithms.

Part C- Assessment and Evaluations

Assessment Procedures

Assessment Name Description

Quiz Quizzes are simple class tests with a duration from 20 minutes to 120
minutes. It can be online or offline, students need to prepare for the quiz
based on the instructed syllabus.

Assignment Type of home work assessment, students are given specific tasks and
instructed to complete them within a given period of time.

Practical Mostly related to laboratory works or by implementing in real code in

either exercise book or in programming IDE

Exam Each course contains a final exam considering the complete syllabus. It
should be a 3hours exam for 72 marks. Students need to answer at most
6 questions. Every question may include sub questions

64
CIE- Continuous Internal Evaluation (40 Marks):
Bloom’s Category Test Attendance External Participation
Marks (out of 20) (30) (10) in Curricular/Co-
Curricular Activities
Remember 2
Understand 5
Apply 13
Analyze 2
Evaluate 4
Create 4

SE- Lab Final Exam (60 marks)

Bloom’s Category Test
Remember 5

Understand 10

Apply 25

Analyze 10

Evaluate 5

Create 5

Mapping of CLOs to PLOs

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 1 0 0 0 0 1 0 0 0

CLO2 0 1 0 0 0 0 1 0 0

CLO3 0 0 1 0 0 0 0 1 1

CLO4 0 0 0 1 0 0 0 1 0

65
CLO5 0 0 0 0 1 0 0 0 1

Part D- Resources

Textbooks
1. Theory and Problem of Data Structures by S. Lipschutz
2. Data Structure by E. Horowitz
Reference Books
1. The Art of Computer Programming, Vol. 1, Fundamental Algorithms by D. E. Knuth
2. The Art of Computer Programming, Vol. 2, Fundamental Algorithms by D. E. Knuth
3. The Art of Computer Programming, Vol. 3, Fundamental Algorithms by D. E. Knuth

66
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Digital Logic Design

Part A- Introduction

I. Course code: CSE 1203

II. Credit: 3

1. Course Summary
A computer engineer needs to know about number system, logic design and the basic
building blocks used in digital systems, in particular digital computers.

2. Course Objectives

1. To learn about basic concept on number system, universal gates and truth
tables.
2. To know about Boolean function and De-Morgan, canonical forms and
minimization techniques
3. To learn about combinational and sequential circuits and basic flip flops
4. To know about synchronous and asynchronous counters

3. Course Learning Outcomes

CLO1. Identify and explain fundamental concepts of digital logic design including
basic and universal gates, number systems, binary coded systems, basic
components of combinational and sequential circuits
CLO2. Demonstrate the acquired knowledge to apply techniques related to the design
and analysis of digital electronic circuits including Boolean algebra and multi-

67
 variable Karnaugh map methods
CLO3. Analyze small-scale combinational and sequential digital circuits
CLO4. Design small-scale combinational and synchronous sequential digital circuit
using Boolean algebra and K-maps

Part B- Lesson Plan

Course Details Learning plan

Timeline Topics /contents Learning Outcomes Mapped CLOs Teaching Assessment

Strategies Strategies

Week 1 Number systems Explain number CLO1, CLO2 Lecture Quiz

and codes. systems Exercise Assignment
Week 2 Demonstration Practical Exam
Digital logic: Apply De-Morgan
Week 3 Boolean algebra, law for the Boolean
De-Morgan's law, function
Logic gates and
their truth tables. State and explain
De-Morgan

Week 4 Canonical forms, Evaluate canonical CLO1, CLO2 Lecture Quiz

combinational logic forms Exercise Assignment
Week 5 circuits, Demonstration Practical Exam
minimization Apply minimization
Week 6 techniques
techniques.
Explain
combinational logic
circuits

Week 7 Arithmetic and data Determine decoder CLO3, Lecture Quiz

handling logic and encoder function Exercise Assignment
Week 8 circuit, decoders Demonstration Practical Exam
and encoders, Differentiate MUX
Multiplexers and and DEMUX
De-multiplexers. Draw data handling
logic circuit

68
Week 9 Combinational Explain flip flops CLO3, Lecture Quiz
Circuit design, Flip- and race problems Exercise Assignment
Week 10 flops, race around CLO4 Demonstration Practical Exam
problems.

Week 11 Counters: Design synchronous CLO3, Lecture Quiz

Asynchronous and and asynchronous Exercise Assignment
Week 12 Synchronous circuits CLO4 Demonstration Practical Exam
counters and their
applications. Apply state diagram
for logic circuits,
Synchronous and
asynchronous logic State and explain
design: state Mealy and Moore
diagram, Mealy and machine
Moore machine.

Week 13 State minimization Explain state CLO3, CLO4 Lecture Quiz

and assignments. minimization and Exercise Assignment
Week 14 Pulse mode logic, assignments Demonstration Practical Exam
Fundamental mode
logic design. Demonstrate pulse
mode logic and
mode logic design

69
 Part C- Assessment and Evaluations

Assessment Procedures

Assessment Name Description

Quiz Quizzes are simple class tests with a duration from 20 minutes to 120
minutes. It can be online or offline, students need to prepare for the
quiz based on the instructed syllabus.

Assignment Type of home work assessment, students are given specific tasks and
instructed to complete them within a given period of time.

Practical Mostly related to laboratory works or by implementing in real code

in either exercise book or in programming IDE

Exam Each course contains a final exam considering the complete syllabus.
It should be a 3hours exam for 72 marks. Students need to answer at
most 6 questions. Every question may include sub questions

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Test Assignment Quizzes External Participation in
Marks (out of 20) (10) (5) (5) Curricular/Co-Curricular
Activities
Remember 2
Understand 5
Apply 3
Analyze 2
Evaluate 4
Create 4

SEE-Semester End Examination (72 Marks)

Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

70
Mapping of CLOs to PLOs

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 1 0 0 0 0 1 0 0 0

CLO2 0 1 0 0 0 0 1 0 0

CLO3 0 0 1 0 0 0 0 1 1

CLO4 0 0 0 1 0 0 0 1 0

Part D- Resources

Textbooks
1. Digital logic and Computer Design by M. Morris Mano
2. Digital System Analysis by Tocci
Reference Books
1. Principles of Electronic by D. E. Knuth
2. Electronic Devices and Circuit Theory by R.L. Boylestad

71
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Digital Logic Design Lab

Part A- Introduction

III. Course code: CSE 1204

IV. Credit: 1.5

4. Course Summary
A computer engineer needs to know about number system, logic design and the basic
building blocks used in digital systems, in particular digital computers.

5. Course Objectives

1. To learn about basic concept on number system, universal gates and truth
tables.
2. To know about Boolean function and De-Morgan, canonical forms and
minimization techniques
3. To learn about combinational and sequential circuits and basic flip flops
4. To know about synchronous and asynchronous counters

6. Course Learning Outcomes

CLO1. Apply and explain fundamental concepts of digital logic design including
basic and universal gates, number systems, binary coded systems, basic
components of combinational and sequential circuits
CLO2. Implement the acquired knowledge to apply techniques related to the design
and analysis of digital electronic circuits including Boolean algebra and multi-

72
 variable Karnaugh map methods
CLO3. Analyze small-scale combinational and sequential digital circuits
CLO4. Design small-scale combinational and synchronous sequential digital circuit
using Boolean algebra and K-maps

art B- Lesson Plan

Course Details Learning plan

Timeline Topics /contents Learning Outcomes Mapped CLOs Teaching Assessment

Strategies Strategies

Week 1 Number systems Explain number systems CLO1, CLO2 Lecture Quiz
and codes. Exercise Assignment
Week 2 Apply De-Morgan law for the Demonstration Practical
Digital logic: Boolean function Exam
Week 3 Boolean algebra,
De-Morgan's law, State and explain De-Morgan
Logic gates and
their truth tables.

Week 4 Canonical forms, Evaluate canonical forms CLO1, CLO2 Lecture Quiz
combinational Exercise Assignment
Week 5 logic circuits, Apply minimization techniques Demonstration Practical
Week 6 minimization Explain combinational logic Exam
techniques. circuits

Week 7 Arithmetic and Determine decoder and encoder CLO3, Lecture Quiz
data handling logic function Exercise Assignment
Week 8 circuit, decoders Demonstration Practical
and encoders, Differentiate MUX and Exam
Multiplexers and DEMUX
De-multiplexers. Draw data handling logic circuit

73
Week 9 Combinational Explain flip flops and race CLO3, Lecture Quiz
Circuit design, problems Exercise Assignment
Week 10 Flip-flops, race CLO4 Demonstration Practical
around problems. Exam

Week 11 Counters: Design synchronous and CLO3, Lecture Quiz

Asynchronous and asynchronous circuits Exercise Assignment
Week 12 Synchronous CLO4 Demonstration Practical
counters and their Apply state diagram for logic Exam
applications. circuits,

Synchronous and State and explain Mealy and

asynchronous Moore machine
logic design: state
diagram, Mealy
and Moore
machine.

Week 13 State minimization Explain state minimization and CLO3, CLO4 Lecture Quiz
and assignments. assignments Exercise Assignment
Week 14 Pulse mode logic, Demonstration Practical
Fundamental Demonstrate pulse mode logic Exam
mode logic design. and mode logic design

74
 Part C- Assessment and Evaluations

Assessment Procedures

Assessment Name Description

Quiz Quizzes are simple class tests with a duration from 20 minutes to
120 minutes. It can be online or offline, students need to prepare
for the quiz based on the instructed syllabus.

Assignment Type of home work assessment, students are given specific tasks
and instructed to complete them within a given period of time.

Practical Mostly related to laboratory works or by implementing in real

code in either exercise book or in programming IDE

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3hours exam for 72 marks. Students need
to answer at most 6 questions. Every question may include sub
questions

CIE- Continuous Internal Evaluation (40 Marks):

Bloom’s Category Marks Test Attendance External Participation in
(out of 20) (30) (10) Curricular/Co-Curricular
Activities
Remember 2
Understand 5
Apply 13
Analyze 2
Evaluate 4
Create 4

SE- Lab Final Exam (60 marks)

Bloom’s Category Test
Remember 5

Understand 10

Apply 25

75
Analyze 10

Evaluate 5

Create 5

Mapping of CLOs to PLOs

CLOs PLO10 PLO11 PLO12 PLO13 PLO14 PLO15 PLO16 PLO17 PLO18

CLO1 1 0 0 0 0 1 0 0 0

CLO2 0 1 0 0 0 0 1 0 0

CLO3 0 0 1 0 0 0 0 1 1

CLO4 0 0 0 1 0 0 0 1 0

Part D- Resources

Textbooks
3. Digital logic and Computer Design by M. Morris Mano
4. Digital System Analysis by Tocci
Reference Books
3. Principles of Electronic by D. E. Knuth
4. Electronic Devices and Circuit Theory by R.L. Boylestad

76
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Engineering Drawing

Part A- Introduction

V. Course code: CSE 1206

VI. Credit: 1

7. Course Summary
Capability of computer aided design and drawing is essential for an engineer in order to
be able to design objects using some drawing software..

8. Course Objectives

1. Understand scaling of drawing different objects.

2. Recognize objects from different views.
3. Design structures using drawing software

9. Course Learning Outcomes

CLO5. Ability to read basic engineering drawing.

CLO6. Ability to draw basic drawing objects on standard drawing sheets.
CLO7. Apply engineering drawing skills using Auto CAD tool.
CLO8. Respond as instructed while working in groups.

77
 Part B- Lesson Plan

Course Details Learning plan

Timeline Topics /contents Learning Mapped CLOs Teaching Assessment

Outcomes Strategies Strategies

Week 1- Familiarization with Apply scales CLO1 Lecture Quiz

different logic gates Exercise Assignment
Week 6 and flip-flops. Identify views CLO4 Demonstration Practical
Exam

Week 7- Missing line, Find out missing CLO2 Lecture Quiz

Auxiliary view, lines. Exercise Assignment
Week 10 Detail and assembly CLO4 Demonstration Practical
drawing. Apply auxiliary Exam
view and assembly
drawing

Week 11- Flip-flops, Design objects CLO3, Lecture Quiz

Sequential circuit, using CAD. Exercise Assignment
Week 14 Counter, CLO4 Demonstration Practical
Combinational Exam
Circuit.

78
 Part C- Assessment and Evaluations

Assessment Procedures

Assessment Name Description

Quiz Quizzes are simple class tests with a duration from 20 minutes to
120 minutes. It can be online or offline, students need to prepare for
the quiz based on the instructed syllabus.

Assignment Type of home work assessment, students are given specific tasks
and instructed to complete them within a given period of time.

Practical Mostly related to laboratory works or by implementing in real code

in either exercise book or in programming IDE

Exam Includes set of programming problems to solve within a timeline

CIE- Continuous Internal Evaluation (40 Marks):

Bloom’s Category Test Attendance External Participation
Marks (out of 20) (30) (10) in Curricular/Co-
Curricular Activities
Remember 2
Understand 5
Apply 13
Analyze 2
Evaluate 4
Create 4
SE- Lab Final Exam (60 marks)
Bloom’s Category Test
Remember 5

Understand 10

Apply 25

Analyze 10

Evaluate 5

Create 5

79
Mapping of CLOs to PLOs

CLOs PLO19 PLO20 PLO21 PLO22 PLO23 PLO24 PLO25 PLO26 PLO27

CLO1 1 0 0 0 0 1 0 0 0

CLO2 0 1 0 0 0 0 1 0 0

CLO3 0 0 1 0 0 0 0 1 1

CLO4 0 0 0 1 0 0 0 1 0

Part D- Resources

Textbooks
5. Mastering AutoCAD 2008 and AutoCAD LT 2008 by Wiley
6. Computer Aided Design and manufacturing by M. Groover and E. Zimmers
Reference Books
5. CAD/CAM Robotics and Factories of the Future by S. Narayanan
6. Computer Aided Manufacturing by TienChien Chang

80
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering
Course Outline: Electronic Devices and Circuits

Part A- Introduction

I. Course code: EEE 1201

II. Credit: 3

1. Course Summary
To learn basic concepts about semiconductor physics.
To know about formation of semiconductor diodes, transistors, field effect transistors, Oscillators and
their working principle.
To know about power electronics devices and its operation.
A computer engineer needs to know about number system, logic design and the basic
building blocks used in digital systems, in particular digital computers.

2. Course Objectives

1. To learn basic concepts about semiconductor physics.

2. To know about formation of semiconductor diodes, transistors, field effect
transistors, Oscillators and their working principle.
3. To know about power electronics devices and its operation.

3. Course Learning Outcomes

CLO1. learn basic concepts about semiconductor physics

CLO2. Know about formation of semiconductor diodes, transistors
CLO3. know about power electronics devices and its operation
CLO4. Apply amplifier in different circuits

81
 Part B- Lesson Plan

Course Details Learning plan

Timeline Topics /contents Learning Outcomes Mapped CLOs Teaching Assessment

Strategies Strategies

Week 1 Theory of Define and discuss CLO1, CLO2 Lecture Quiz

Semiconductors: semiconductor Exercise Assignment
Week 2 physics and Demonstration Practical Exam
Electronic
Week 3 structure of the semiconductors.
elements,
crystalline and
amorphous solids,
different types of
crystal, band
theory of solids,
structure of
silicon and
germanium.

Week 4 Intrinsic and Define and discuss CLO1, CLO2 Lecture Quiz
Extrinsic semiconductor Exercise Assignment
Week 5 Semiconductors: Demonstration Practical Exam
physics and
Week 6 N and P type semiconductors.
semiconductor,
carrier densities,
generation and
recombination of
excess carriers,
carrier life time,
continuity equation.

Week 7 Diode circuits: The Define diods CLO3, Lecture Quiz

PN junction, Exercise Assignment
Week 8 biasing and V-I Demonstration Practical Exam
characteristics of
diodes, rectifier
concept, half wave
and full wave
rectifiers, Zener

82
 diode and voltage
regulators.

Week 9 Bipolar Draw and describe CLO3, Lecture Quiz

transistor: diode clipping and Exercise Assignment
Week 10 Junction clamping circuits. CLO4 Demonstration Practical Exam
transistors,
principles of
operation, biasing,
characteristics in
different
configurations (CE,
CB & CC), DC and
AC load line,
transistor
equivalent circuits.
Gain and
impedance,
Analysis of small
signal low
frequency transistor
amplifier by using h
-parameters.

Week 11 Field effect Define and explain CLO3, Lecture Quiz

transistor: Operational Exercise Assignment
Week 12 Construction of Amplifiers and FET CLO4 Demonstration Practical Exam
JFET, its
parameters, biasing,
characteristics and
principles of
operation, different
types of MOSFET
and its operation
and characteristics.
Amplifier: Voltage
and current
amplifiers of
different
configurations, RC
coupled amplifier,
operational
amplifiers
(OPAMPS), linear
applications of

83
 OPAMPS, gain,
input and output
impedance.

Week 13 Capacitor and Classify Oscillators. CLO3, CLO4 Lecture Quiz

Capacitance: Exercise Assignment
Week 14 Capacitance, Demonstration Practical Exam
Parallel plate
capacitor,
cylindrical
capacitor, spherical
capacitor,
capacitors in series
& parallel, energy
stored in a
capacitor,
transformers.

84
 Part C- Assessment and Evaluations

Assessment Procedures

Assessment Name Description

Quiz Quizzes are simple class tests with a duration from 20 minutes to
120 minutes. It can be online or offline, students need to prepare
for the quiz based on the instructed syllabus.

Assignment Type of home work assessment, students are given specific tasks
and instructed to complete them within a given period of time.

Practical Mostly related to laboratory works or by implementing in real

code in either exercise book or in programming IDE

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3hours exam for 72 marks. Students need
to answer at most 6 questions. Every question may include sub
questions

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Test Assignment Quizzes External Participation in
Marks (out of 20) (10) (5) (5) Curricular/Co-Curricular
Activities
Remember 2
Understand 5
Apply 3
Analyze 2
Evaluate 4
Create 4
SEE-Semester End Examination (72 Marks)
Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

85
Mapping of CLOs to PLOs

CLOs PLO28 PLO29 PLO30 PLO31 PLO32 PLO33 PLO34 PLO35 PLO36

CLO1 1 0 0 0 0 1 0 0 0

CLO2 0 1 0 0 0 0 1 0 0

CLO3 0 0 1 0 0 0 0 1 1

CLO4 0 0 0 1 0 0 0 1 0

Part D- Resources

Textbooks
1. Basic Electronics (Solid State).
2. Electronic Devices and Circuit Theory.
Reference Books
1. Hand Book of Electronics.
2. Electronic Devices and Circuits.

86
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering
Course Outline: Electronic Devices and Circuits Lab

Part A- Introduction

I. Course code: EEE 1202

II. Credit: 1.5

1. Course Summary
To learn basic concepts about semiconductor physics.
To know about formation of semiconductor diodes, transistors, field effect transistors, Oscillators and
their working principle.
To know about power electronics devices and its operation.
A computer engineer needs to know about number system, logic design and the basic
building blocks used in digital systems, in particular digital computers.

2. Course Objectives

1. To learn basic concepts about semiconductor physics.

2. To know about formation of semiconductor diodes, transistors, field effect
transistors, Oscillators and their working principle.
3. To know about power electronics devices and its operation.

3. Course Learning Outcomes

CLO1. Implement basic concepts about semiconductor physics

CLO2. Demonstrate about formation of semiconductor diodes, transistors
CLO3. Apply about power electronics devices and its operation
CLO4. Apply amplifier in different circuits

87
Part B- Lesson Plan

Course Details Learning plan

Timeline Topics /contents Learning Mapped Teaching Assessment

Outcomes CLOs Strategies Strategies

Week 1 Theory of Semiconductors: Define and CLO1, Lecture Quiz

Electronic structure of the discuss CLO2 Exercise Assignment
Week 2 semiconducto Demonstration Practical
elements, crystalline and
Week 3 amorphous solids, different r physics and Exam
types of crystal, band theory of semiconducto
rs.
solids, structure of silicon and
germanium.

Week 4 Intrinsic and Extrinsic Define and CLO1, Lecture Quiz

Semiconductors: N and P type discuss CLO2 Exercise Assignment
Week 5 semiconductor, carrier densities, Demonstration Practical
semiconducto
Week 6 generation and recombination of r physics and Exam
excess carriers, carrier life time, semiconducto
continuity equation. rs.

Week 7 Diode circuits: The PN junction, Define diods CLO3, Lecture Quiz
biasing and V-I characteristics of Exercise Assignment
Week 8 diodes, rectifier concept, half wave Demonstration Practical
and full wave rectifiers, Zener Exam
diode and voltage regulators.

Week 9 Bipolar transistor: Junction Draw and CLO3, Lecture Quiz

transistors, principles of describe Exercise Assignment
Week 10 operation, biasing, characteristics diode CLO4 Demonstration Practical
in different configurations (CE, CB clipping and Exam
& CC), DC and AC load line, clamping
transistor equivalent circuits. Gain circuits.
and impedance, Analysis of small
signal low frequency transistor
amplifier by using h -parameters.

88
 Week 11 Field effect transistor: Define and CLO3, Lecture Quiz
Construction of JFET, its explain Exercise Assignment
Week 12 parameters, biasing, characteristics Operational CLO4 Demonstration Practical
and principles of operation, Amplifiers Exam
different types of MOSFET and its and FET
operation and characteristics.
Amplifier: Voltage and current
amplifiers of different
configurations, RC coupled
amplifier, operational amplifiers
(OPAMPS), linear applications of
OPAMPS, gain, input and output
impedance.

Week 13 Capacitor and Capacitance: Classify CLO3, Lecture Quiz

Capacitance, Parallel plate Oscillators. CLO4 Exercise Assignment
Week 14 capacitor, cylindrical capacitor, Demonstration Practical
spherical capacitor, capacitors in Exam
series & parallel, energy stored in a
capacitor, transformers.

Part C- Assessment and Evaluations

Assessment Procedures

Assessment Name Description

Quiz Quizzes are simple class tests with a duration from 20 minutes to
120 minutes. It can be online or offline, students need to prepare
for the quiz based on the instructed syllabus.

Assignment Type of home work assessment, students are given specific tasks
and instructed to complete them within a given period of time.

Practical Mostly related to laboratory works or by implementing in real

code in either exercise book or in programming IDE

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3hours exam for 72 marks. Students need
to answer at most 6 questions. Every question may include sub
questions

CIE- Continuous Internal Evaluation (40 Marks):

89
Bloom’s Category Test Attendance External Participation
Marks (out of 20) (30) (10) in Curricular/Co-
Curricular Activities
Remember 2
Understand 5
Apply 13
Analyze 2
Evaluate 4
Create 4
SE- Lab Final Exam (60 marks)
Bloom’s Category Test
Remember 5

Understand 10
Apply 25

Analyze 10

Evaluate 5

Create 5

Mapping of CLOs to PLOs

CLOs PLO37 PLO38 PLO39 PLO40 PLO41 PLO42 PLO43 PLO44 PLO45

CLO1 1 0 0 0 0 1 0 0 0

CLO2 0 1 0 0 0 0 1 0 0

CLO3 0 0 1 0 0 0 0 1 1

CLO4 0 0 0 1 0 0 0 1 0

Part D- Resources

Textbooks
1. Basic Electronics (Solid State).

90
 2. Electronic Devices and Circuit Theory.
Reference Books
1. Hand Book of Electronics.
2. Electronic Devices and Circuits.

91
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering

Differential Equations and Geometry

Course Code: MATH 1201 Credit: 3.0
Exam Hours : 03 SEE Marks : 72
CIE Marks : 28

Course Learning Outcomes: After the successful completion of the course, students will be able to:

CLO1 Understand and explain formation and classification of differential

equation.
CLO2 Explain basic concepts of first order and first degree differential equation.
CLO3 Understand and explain basic concepts higher order differential equation
and their solution process.
CLO4 Learn and explain coordinates system, transformations of coordinates.
CLO5 Understand and explain straight lines, pair of straight lines.
CLO6 Explain and expand General Equation of Second Degree.
CLO7 Learn and determine Circles, System of circles, Tangent, Normal.

S Course Content Hrs CLOs

N
1. Definitions and classifications of differential 6 CLO1
equations, problems and solutions, Formation of
differential equation, Existence and uniqueness
theorem (Statement and application only).
2. Separable and homogeneous equations, Exact 6 CLO2
equation, Integrating factor, Equations made
exact by integrating factor, First order linear
equation, Bernoulli equation, Riccati equation.
3. First order higher degree equations-solvable for 6 CLO3
x, y and p, Clairaut's equation, Singular
solutions, Orthogonal and oblique trajectories.
Higher order linear homogeneous equation with
constant coefficients, Reduction of order, Basic
theorems, Linear non-homogeneous equation
with constant coefficients, Method of
undetermined coefficients.
4. Co-ordinates: Coordinates system, 5 CLO4
Transformations of coordinates

92
 5. Transformations: Change of axes, Translation, 6 CLO5
Invariants, Analyzing an equation using a
rotation (identify and sketch).
6. Straight Lines: Straight lines, Pair of straight 3 CLO5
lines.
7. General Equation of Second Degree: Reduction 4 CLO6
to standard form and Identification of conics.
8. Circles: Circles, System of circles, Tangent, 3 CLO7
Normal.

Recommended References:
Anton, H., Bivens, I. and Davis, S. : Calculus
Das and Mukherjee : Differential Calculus
Thomson & Finne. : Calculus
Swokowski. E. W : Calculus
Shanti Narayan : Differential Calculus

ASSESSMENT PATTERN
CIE- Continuous Internal Evaluation (28Marks)
Bloom’s Category Tests Assignments Quizzes External Participation in
Marks (out of 20) (10) (05) (05) Curricular/Co-Curricular
Activities(08)
Remember 05
Understand 03
Apply 04 8
Analyze 03
Evaluate 03
Create 02

SEE- Semester End Examination (72 Marks)

Bloom’s Category Test
Remember 15
Understand 15
Apply 15
Analyze 15
Evaluate 10
Create 02

93
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Physics for Engineer

Part A- Introduction

I. Course code: PHY 1201

II. Credit: 2

1. Course Summary
Someone wants to develop his/her career as a computer engineer needs to know the basic theories
and principles of physics to generate problem solving, analytical, mathematical and solution finding
skills; this course will equip him/her with the concepts of Kinetic Theory of Gases, Heat and
Thermodynamics, Simple Harmonic Motion, Wave Motion, Sound Waves, Acoustics and
Electrostatics.

2. Course Objectives

1. Apply the concepts, ideas and methods of Physics required to solve problems in
engineering studies.
2. Acquire knowledge about different laws and models of Physics, which will develop
analytical capabilities among them.
3. Apply the laws and skills in higher studies or research areas.
4. Understand the origins in thermodynamics, electronics and Acoustics.
5. Explain everyday things happening around us.

3. Course Learning Outcomes

CLO1. Apply the concepts, ideas and methods of Physics

CLO2. Apply the laws and skills in higher studies
CLO3. Acquire knowledge about different laws and models of Physics
CLO4. Explain everyday things happening around us

94
Part B- Lesson Plan

Course Details Learning plan

Timeline Topics /contents Learning Mapped Teaching Assessment

Outcomes CLOs Strategies Strategies

Week 1 Kinetic theory of gases: Define CLO1, Lecture Quiz

Deduction of gas law, Principle critical CLO2 Exercise Assignment
Week 2 of equipartition of energy, constants Demonstration Practical
Week 3 Equation of state – Andrew’s Exam
Experiment, Vander Waals
equation, Critical Constants,
Transmission of heat –
conduction, convection and
radiation.

Week 4 Heat and Thermodynamics: 1st Explain work CLO1, Lecture Quiz
law of Thermodynamics, done by CLO2 Exercise Assignment
Week 5 Internal energy, Specific heats expanding Demonstration Practical
Week 6 of gases, Work done by gas Exam
expanding gas, Elasticity of a
perfect gas, 2nd law of
thermodynamics, Carnot’s
cycle, Efficiency of heat
engines, Absolute scale of
temperature, Entropy and its
physical concepts, Maxwell’s
thermodynamic relations,
Statistical Mechanics

Week 7 Simple Harmonic Motion: Draw the CLO3, Lecture Quiz

Simple harmonic motion, mismatch Exercise Assignment
Week 8 Combination of S.H.M. and between Demonstration Practical
Lissajous figures, Damped Damped Exam
Oscillations, Forced Oscillation
oscillations, Resonance, and Forced
Vibrations of membranes and Oscillation
columns.
Electrostatics
Charge and matter, Coulomb’s
Law, The electric field, Gauss’s
Law, Electrical potential,
Capacitance and Resistance,
Ohmic and Non ohmic material,

95
 Variation of resistance with
temperature.

Week 9 Wave motion: Travelling List the types CLO3, Lecture Quiz
waves, Principle of of velocity CLO4 Exercise Assignment
Week 10 superposition, wave velocity, play role in Demonstration Practical
Group velocity, Phase velocity, wave motion Exam
Power and intensity in wave and interpret
motion, Interference, diffraction each with
and transmission of waves, respective
Standing Waves. example

Week 11 Sound waves: Audible, Differentiate CLO3, Lecture Quiz

Ultrasonic, Infrasonic and between CLO4 Exercise Assignment
Week 12 Supersonic waves, Propagation Ohmic and Demonstration Practical
and speed of longitudinal Non Ohmic Exam
waves, Travelling longitudinal material
waves, Standing longitudinal
waves, Vibrating systems and
sources of sound, Beats, The
Doppler’s effect

Week 13 Acoustics: Re-vibration, Noise Explain state CLO3, Lecture Quiz

insulation and reduction, minimization CLO4 Exercise Assignment
Week 14 Compound absorption, sound and Demonstration Practical
distribution, Room acoustics, assignments Exam
Recording. Demonstrate
pulse mode
logic and
mode logic
design

96
 Part C- Assessment and Evaluations

Assessment Procedures

Assessment Name Description

Quiz Quizzes are simple class tests with a duration from 20 minutes to
120 minutes. It can be online or offline, students need to prepare
for the quiz based on the instructed syllabus.

Assignment Type of home work assessment, students are given specific tasks
and instructed to complete them within a given period of time.

Practical Mostly related to laboratory works or by implementing in real

code in either exercise book or in programming IDE

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3hours exam for 72 marks. Students need
to answer at most 6 questions. Every question may include sub
questions

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Test Assignment Quizzes External Participation
Marks (out of 20) (10) (5) (5) in Curricular/Co-
Curricular Activities
Remember 2
Understand 5
Apply 3
Analyze 2
Evaluate 4
Create 4

SEE-Semester End Examination (72 Marks)

Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

97
Mapping of CLOs to PLOs

CLOs PLO46 PLO47 PLO48 PLO49 PLO50 PLO51 PLO52 PLO53 PLO54

CLO1 1 0 0 0 0 1 0 0 0

CLO2 0 1 0 0 0 0 1 0 0

CLO3 0 0 1 0 0 0 0 1 1

CLO4 0 0 0 1 0 0 0 1 0

Part D- Resources

Textbooks
1. Equilibrium Thermodynamics by Adkins
2. Waves and Oscillations by Brijlal
3. Fundamentals of physics by Halliday and Rensick

98
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering
Course Outline: Object Oriented Programming
Part A- Introduction
I. Course code: CSE 2101

II. Credit: 3

1.Course Summary

This course introduces the concepts of object-oriented programming to students with a background
in the procedure oriented paradigm. The course begins with a brief review of control structures and
data types with emphasis on structured data types and array processing. It then moves on to
introduce the object-oriented programming paradigm, focusing on the definition and use of classes
along with the fundamentals of object-oriented concepts such as polymorphism, inheritance, data
hiding etc. Besides, Template functions and classes; Multi-threaded Programming, abstract
classes, function overloading and overriding will be discussed elaborately as well.

2.Course Objectives
1.The primary aim of the module is to enable the students to tackle complex programming
problems, making good use of the object-oriented programming paradigm to simplify the design
and implementation process.
2.Students should be able to design and implement programs for complex problems, making good
use of the features of the language.
3.Teaches students how to design, develop and program computer systems using an object oriented
programming language such as C++, Java.
Familiarizes students with the tools that streamline object-oriented development.

3.Course Learning Outcomes

CLO1.Understand the basic object oriented paradigm of programming before learning how to use
objects and class in the context of programming.
CLO2.Analyze the structure of the new paradigm that helps the students to understand its
activities in a logical way that follows a bottom-up process.
CLO3.Remember every single detail such as writing code in a particular language, steps to
execute them, translate them for error detection etc.
CLO4.Apply the already learnt things to properly implement the program on various real life
problems and learn the correlations between coding and real time solutions.
CLO5. Evaluate numerous possible ways to solve a problem and find the best way using the
concepts of object oriented programming.

99
Part B- Lesson Plan
Course Topics /contents Learning Outcomes Mapped Teaching Assessment
Details CLOs Strategies Strategies
Learning
plan
Timeline
Week 1 Philosophy of Object -Details on Object CLO1, Lecture Quiz
Oriented oriented CLO2
Programming programming, many
(OOP), features of features and concepts
OOP, advantages of and superiority over
OOP over structured structural/ procedural
programming programming.

Week 2 Classes and Objects -Integrating object CLO1, Lecture, Quiz,

and class in the CLO2, Exercise Assignment,
structure of this new CLO3 Demonstr Exam
programming system, ation
how to properly call
them and where to use
them

Week 3, 4 Constructors, -Discuss about CLO3 Lecture, Quiz,

destructors and copy constructor, copy Exercise Assignment,E
constructors, array constructor and Demonstr xam
of objects, object destructor ation
references, Single -demonstrate these
Multidimensional features by integrating
Arrays. them in the code.
-demonstrating array
of objects and how to
refer them in the code,
Apply single and
multidimensional
array in development

100
Week 5, 6 Function -discuss on function CLO3 Lecture, Quiz,
overloading, overloading and Exercise Assignment,
operator overloading operator overloading Demonstr Exam
and type conversion that are extensively ation
of objects. used in OOP.
-discussion on how
operator overloading
is used to convert
object types.

Week 7, 8 Inheritance -discussion on all CLO4 Lecture, Quiz,

kinds of inheritances, Exercise Assignment,
their usage, Demonstr Exam
implementing them to ation
solve problems
-learning single and
multiple inheritance.
-involve students to
solve expressions.

Week 9, Polymorphism, -discussion and CLO4, Lecture, Quiz

10 virtual function run analyzing different CLO5 Exercise Assignment,
time type types of Demonstr Exam
identification, polymorphism, virtual ation
exception handling function/function
overriding.

Week 11 template functions -understanding CLO2, Lecture Quiz,

and classes, function and template CLO3 Exercise Assignment,
namespace, standard function and class Demonstr Exam
template library -understanding ation
container, algorithm,
iterators

Week 12 String manipulation Create string CLO4 Lecture, Quiz,

Manipulate string Exercise Assignment,
operation, Demonstr Exam
Create string ation
processing algorithm

101
Week 13, Introduction to Create GUI, CLO4, Lecture Quiz
14 graphical user Apply mouse and CLO5 Exercise Assignment
interface; handling keyboard event, Demonstr Exam
mouse and keyboard Define thread, ation
events, Design multithreaded
Multi-Threading; program
Client Server
programming

Part C- Assessment and Evaluations

Assessment Procedures
Assessment Name Description

Quiz Quizzes are simple class tests with a duration from 20 minutes to
120 minutes. It can be online or offline, students need to prepare for
the quiz based on the instructed syllabus.

Assignment Type of home work assessment, students are given specific tasks
and instructed to complete them within a given period of time.

Attendance Student’s participation in the class lecture, quiz and exam.

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3 hours exam for 72 marks. Students need
to answer at most 6 questions. Every question may include sub
questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Marks (out Test Assignment Quizzes External Participation in

of 20) (10) (5) (5) Curricular/Co-Curricular
Activities
Remember 2
Understand 5
Apply 3
Analyze 2
Evaluate 4
Create 4

102
SEE-Semester End Examination (72 Marks)
Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12
Mapping of CLOs to PLOs
CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 1 1 1 0 0 0 0 1 0

CLO2 1 1 1 0 0 0 0 1 0

CLO3 1 1 1 0 0 0 0 1 1

CLO4 1 1 1 0 0 0 0 1 1

CLO5 1 1 1 0 0 0 0 1 1

Part D- Resources
Textbooks
1. Balagurusamy: Object Oriented Programming with C++
2. Bhushan Trivedi: Programming with ANCI C++
3. Y. D. Liang: Introduction to Java Programming, Comprehensive: International Edition
Reference Books
1. Bjarne Stroustrup: The C++ Programming Language
2. Ashok N. Kamthane: Object-Oriented Programming with ANCI and Turbo C++
3. H. M. Deitel& P. J. Deitel: Java™ How to Program
Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering
Course Outline: Object Oriented Programming Lab
Part A- Introduction
I.Course code: CSE 2102

II.Credit: 1.5

1.Course Summary

103
 This course introduces the concepts of object-oriented programming to students with a
background in the procedure oriented paradigm. The course begins with a brief review of
control structures and data types with emphasis on structured data types and array processing.
It then moves on to introduce the object-oriented programming paradigm, focusing on the
definition and use of classes along with the fundamentals of object-oriented concepts such as
polymorphism, inheritance, data hiding etc. Besides, Template functions and classes; Multi-
threaded Programming, abstract classes, function overloading and overriding will be discussed
elaborately as well.

2.Course Objectives

1.The primary aim of the module is to enable the students to tackle complex programming
problems, making good use of the object-oriented programming paradigm to simplify the
design and implementation process.
2.Students should be able to design and implement programs for complex problems, making
good use of the features of the language.
3.Teaches students how to design, develop and program computer systems using an object
oriented programming language such as C++, Java.
Familiarizes students with the tools that streamline object-oriented development.

3.Course Learning Outcomes

CLO1.Understand the basic object oriented paradigm of programming before learning how
to use objects and class in the context of programming.
CLO2. Analyze and apply the structure of the new paradigm that helps the students to
understand its activities in a logical way that follows a bottom-up process.
CLO3.Remember every single detail such as writing code in a particular language, steps to
execute them, translate them for error detection and implementation.
CLO4.Apply the already learnt things to properly implement the program on various real
life problems and learn the correlations between coding and real time solutions.
CLO5 Evaluate numerous possible ways to solve a problem and find the best way using
the concepts of object oriented programming.

Part B- Lesson Plan

Course Details Learning plan
Timeline Topics /contents Learning Outcomes Mapped Teaching Assessment
CLOs Strategies Strategies

104
Week 1 Philosophy of Object -Details on Object CLO1, Lecture Quiz,
Oriented oriented CLO2 Assignment
Programming (OOP), programming, many
features of OOP, features and concepts
advantages of OOP and superiority over
over structured structural/ procedural
programming programming.

Week 2 Classes and Objects -Integrating object CLO1, Lecture, Quiz,

and class in the CLO2, Exercise Practical,
structure of this new CLO3 Demonstr Exam
programming ation
system, how to
properly call them
and where to use
them
Week 3, 4 Constructors, -Discuss about CLO3 Lecture, Quiz,
destructors and copy constructor, copy Exercise Assignment,
constructors, array of constructor and Demonstr Practical,
objects, object destructor ation Exam
references, Single -demonstrate these
Multidimensional features by
Arrays. integrating them in
the code.
-demonstrating array
of objects and how to
refer them in the
code,
Apply single and
multidimensional
array in development

Week 5, 6 Function overloading, -discuss on function CLO3 Lecture, Quiz,

operator overloading overloading and Exercise Practical,
and type conversion operator overloading Demonstr Assignment,
of objects. that are extensively ation Exam
used in OOP.
-discussion on how
operator overloading
is used to convert
object types.

105
Week 7, 8 Inheritance -discussion on all CLO4 Lecture, Assignment,
kinds of inheritances, Exercise Practical,
their usage, Demonstr Exam
implementing them ation
to solve problems
-learning single and
multiple inheritance.
-involve students to
solve expressions.

Week 9, Polymorphism, -discussion and CLO4, Lecture, Practical,

10 virtual function run analyzing different CLO5 Exercise Assignment
time type types of Demonstr Exam
identification, polymorphism, ation
exception handling virtual
function/function
overriding.

Week 11 Template functions -understanding CLO2, Lecture Quiz,

and classes, function and CLO3 Exercise Practical,
namespace, standard template function Demonstr Exam
template library and class ation
-understanding
container, algorithm,
iterators
Week 12 String manipulation Create string CLO4 Lecture, Quiz,
Manipulate string Exercise Practical,
operation, Demonstr Exam
Create string ation
processing algorithm

Week 13, Introduction to Create GUI, CLO4, Lecture Quiz,

14 graphical user Apply mouse and CLO5 Exercise Practical,
interface; handling keyboard event, Demonstr Assignment
mouse and keyboard Define thread, ation Exam
events, Design multithreaded
Multi-Threading; program
Client Server
programming

Part C- Assessment and Evaluations

106
Assessment Procedures
Assessment Name Description

Quiz Quizzes are simple class tests with duration from 20 minutes to
120 minutes. It can be online or offline, students need to prepare
for the quiz based on the instructed syllabus.

Practical Mostly related to laboratory works or by implementing in real

code in either exercise book or in programming IDE.

Attendance Student’s participation in the class lecture, quiz and exam.

Assignment Type of home work assessment, students are given specific tasks
and instructed to complete them within a given period of time.

Exam Includes set of programming problems to solve within a timeline

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (40 Marks):

Bloom’s Category Marks (out Test (30) Attendance External Participation in

of 20) (10) Curricular/Co-Curricular
Activities
Remember 2
Understand 5
Apply 13
Analyze 2
Evaluate 4
Create 4

SE- Lab Final Exam (60 marks)

Bloom’s Category Test
Remember 5
Understand 10
Apply 25
Analyze 10
Evaluate 5
Create 5

Mapping of CLOs to PLOs

107
CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 1 1 1 0 0 0 0 1 0

CLO2 1 1 1 0 0 0 0 1 0

CLO3 1 1 1 0 0 0 0 1 1

CLO4 1 1 1 0 0 0 0 1 1

CLO5 1 1 1 0 0 0 0 1 1

Part D- Resources
Textbooks
1. Balagurusamy: Object Oriented Programming with C++
2. Bhushan Trivedi: Programming with ANCI C++
3. Y. D. Liang: Introduction to Java Programming, Comprehensive: International Edition
Reference Books
1. Bjarne Stroustrup: The C++ Programming Language
2. Ashok N. Kamthane: Object-Oriented Programming with ANCI and Turbo C++
3. H. M. Deitel& P. J. Deitel: Java™ How to Program.

Jashore University of Science and Technology

Faculty of Science and Engineering
Department of Computer Science and Engineering
Course Outline: Data Communication
Part A- Introduction
I. Course code: CSE 2103
II. Credit: 3

1. Course Summary

This course introduces some basic concepts, models, techniques etc. used in data communication.
A computer science engineer needs to know the communication model, different network layer,
transmission medium and technique used in digital communication system to fulfill his CSE
degree.

2. Course Objectives

1. Build an understanding of the fundamental concepts of Data communication.

2. Learn how computer network hardware and software operate.
3. Investigate the fundamental issues driving network design.
4. Learn about dominant network technologies.

108
 3. Course Learning Outcomes

CLO1. Learn about the basic knowledge of data communication systems

CLO2. Able to understand about various layered model used in data communication

Timelin Topics /contents Learning Outcomes Mappe Teachin Assessme

e d g nt
CLOs Strategie Strategies
s

Week 1 Data Communication, Learn about data CLO1, Lecture Essay

Fundamental characteristics, Communication model, CLO4, Short
Components, Data network CLO5 Question
representation, Data Flow, standards and
Network and its criteria, organizations,
point-to-point and multipoint different protocol
connection, different layers
topologies, Network Models,
Protocols and standards

Week 2 Different tasks in network Learn about Network CLO1, Lecture Quiz
model, peer-to-peer Model, Tasks, ISO, CLO2, Assignme
communication, OSI Model, TCP/IP CLO4 nt
characteristics and usage area Protocol Essay
of different layers in OSI Short
model, fundamental Question
properties of different layers
of TCP/IP protocol, physical,
logical and port address.

Week Analog and digital data and Learn about physical CLO1, Lecture Quiz
3,4 signal, period, frequency, layer and media, CLO2, Exercise Assignme
phase, wavelength, time and Illustrate Analog and CLO3 Demonst nt
frequency domain, digital data and ration Essay
bandwidth, transmission of signal, transmission Short
digital signal, attenuation, technique and its Question
distortion, noise, SNR, impairments, Data
Nyquist bit rate, Shannon’s rate limit for both
capacity performance noisy and noiseless
parameters. channel.

Week 5, Line coding techniques NRZ, Learn various Digital CLO3 Lecture Quiz
6 RZ, Manchester, and transmission Exercise Essay
differential Manchester techniques. Short

109
 encoding, AMI, Block Question
coding, analog to digital
conversion based on PCM,
delta modulation, etc.

Week 7 ASK, FSK, PSK, QPSK, Learn various Analog CLO3 Lecture Quiz
QAM encodings, AM, transmission Exercise Essay
PM,FM, etc. techniques. Short
Question

Week 8, Synchronous and Discuss and CLO3 Lecture Assignme

9 asynchronous data characterize different Exercise nt
transmission techniques, data transmission and Essay
FDM, international FDM multiplexing Short
carrier standards, techniques. Question
synchronous TDM,
international TDM carrier
standards, statistical time
division multiplexing

Week Frequency hopping spread CLO3 Lecture Assignme

10 spectrum, direct sequence Discuss and Exercise nt
spread spectrum, code characterize different Essay
division multiple access. spread spectrum Short
techniques. Question

Week Characteristics and CLO5 Lecture Assignme

11, 12 applications of various types Exercise nt
Discuss and
of guided medium, Essay
characterize different
Characteristics and Short
transmission medium,
applications of wireless Question
wireless transmission
transmission-terrestrial and
technique, Compute
satellite microwave, radio
path loss, learn to
waves, propagation
distinguish slow and
mechanism, free space
fast fading, Able to
propagation, land
define inter symbol
propagation, path loss, slow
interference and
fading, fast fading, delay
VSAT
spread, inter symbol
interference, VSAT

110
Week Error Detection and Learn abouterror CLO1, Lecture Assignme
13 Correction; parity check, detection and CLO3 Exercise nt
CRC, forward error correction methods, Demonst Essay
correction technique, linear forward and backward ration Short
block code, hamming code, detection, checksum Question
etc.

Week Random access, ALOHA, Discusswireless CLO3, Lecture Assignme

14 Pure ALOHA, CSMA, channel, multiple CLO4 Exercise nt
CSMA/CD, CSMA/CA, access protocol, Demonst Essay
Controlled access, random access and ration Short
reservation, token passing, controlled access Question
polling, poll function, protocol
Channelization protocols,
FDMA, TDMA and CDMA
technology
CLO3. Explore different methods and techniques used in data transfer
CLO4. Learn about various Protocols and their packet format
CLO5. Understand the uses and effectiveness of various transmission medium

Part B- Lesson Plan

Course Details Learning plan
Part C- Assessment and Evaluations
Assessment Procedures
Assessment Name Description

Quiz, Short questions and These are simple class tests with duration from 10 minutes to 90
Essay minutes. It can be online or offline, students need to prepare for the
quiz based on the instructed syllabus.

Assignment Type of homework assessment, students are given specific tasks

and instructed to complete them within a given period of time.

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3hours exam for 72 marks. Students need to
answer at most 6 questions. Every question may include sub
questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):
Bloom’s Category Marks (out Test Assignment Quizzes External Participation in
of 20) (10) (5) (5) Curricular/Co-
Curricular Activities
Remember 2

111
Understand 5
Apply 3
Analyze 2
Evaluate 4
Create 4

SEE-Semester End Examination (72 Marks)

Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

Mapping of CLOs to PLOs

Part D- Resources
Textbooks
1. Data Communications and networking by Behrouz A. Forouzan.
2. Data and Computer Communication by William Stallings.
Reference Books
1. Data Communication by Hajkins.
2. Data Communication by Taub.

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 1 1 0 0 0 0 0 1 0

CLO2 1 1 0 0 0 0 0 1 1

CLO3 1 1 0 0 0 0 0 1 1

CLO4 1 1 0 0 0 0 0 1 1

CLO5 1 1 0 0 0 0 0 1 1

112
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Computer Organization and Architecture

Part A- Introduction

I. Course code: CSE 2105

II. Credit: 3

1. Course Summary
To be a computer engineer one needs to know architectural design, organizational
design and computer family and also to learn the performance factors..

2. Course Objectives
1. To learn the distinguished features of computer architecture, organization and family.

3. Course Learning Outcomes

CLO1. Describe hardware and software

CLO2. Explain stored computer concept
CLO3. Describe of memory organization and design
CLO4. Describe the cache memory system
CLO5. Describe DRAM and SRAM
CLO6. Describe Error Detecting and Correcting Codes
CLO7. Describe External Memory

Part B- Lesson Plan

Course Details Learning plan

Timelin Topics /contents Learning Mapped Teaching Assessm

e Outcomes CLOs Strategies ent
Strategi
es

113
Week 1 A Brief History of Describe the CLO 1 Lecture, Quiz
Computers, Designing details on handouts Participa
for Performance, hardware and tion
Contemporary hard software Exam
and software
description

Week 2 Computer Functions, Describe details CLO 2 Lecture, Quiz

,3 Instruction Fetch and on stored handouts Participa
Execute, Interrupts, computer concept, tion
I/O Function, Vonn I/O Function and Exam
Neumann Machine, Program
example of how stored execution
program and data concepts
executes together

Week 4, Memory Hierarchy Describe details CLO 3 Lecture, Quiz

5 and Characteristics of of the hierarchy of handouts Participa
Memory Systems. memory systems, tion
their Exam
characteristics and
organization

Week 6, Cache Memory Discuss different CLO 4 Lecture, Quiz

7, 8 Principles, Elements aspects of cache handouts Participa
of Cache Design, memory tion
Cache Addresses, Exam
Cache Size, Mapping
Function, Replacement
Algorithms, Write
Policy, Line Size,
Number of Caches

Week 9, Organization of Discuss details on CLO 5 Lecture, Quiz

10 DRAM and SRAM, different topics handouts Participa
Types of ROM, Chip related to DRAM tion
Logic and SRAM Exam
Chip Packaging,
Module Organization

Week Describe Hard Failure, Describe Error CLO 6 Lecture, Quiz

11, 12 Soft Failure, Error Detecting and handouts Participa
correcting codes such Correcting Codes tion
as Hamming Code. Exam

114
Week Magnetic Read and Describe different CLO 7 Lecture, Quiz
13, 14 Write Mechanisms, characteristics of handouts Participa
Data Organization and external memory tion
Formatting, Physical Exam
Characteristics, Disk
Performance
Parameters, Different
Raid Levels

Part C- Assessment and Evaluations

Assessment Procedures

Assessment Name Description

Participation Attendance and participate in the class discussion

Quiz Quizzes are simple class tests with a duration from 20 minutes to
120 minutes. It can be online or offline, students need to prepare
for the quiz based on the instructed syllabus.

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3hours exam for 72 marks. Students need
to answer at most 6 questions. Every question may include sub
questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Marks (out of Test Assignment Quizzes External Participation in
20) (10) (5) (5) Curricular/Co-Curricular
Activities
Remember 2
Understand 5
Apply 3
Analyze 2
Evaluate 4
Create 4

SEE-Semester End Examination (72 Marks)

Bloom’s Category Test
Remember 05
Understand 15
Apply 20

115
Analyze 10
Evaluate 10
Create 12

Mapping of CLOs to PLOs

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 1 0 0 0 0 0 0 1 0

CLO2 1 0 0 0 0 0 0 1 0

CLO3 1 0 0 0 0 0 0 1 0

CLO4 1 0 0 0 0 0 0 1 0

CLO5 1 0 0 0 0 0 0 1 0

CLO6 1 0 0 0 0 0 0 1 0

CLO7 1 0 0 0 0 0 0 1 0

Part D- Resources
Textbooks
1. COMPUTER ORGANIZATION. AND ARCHITECTURE. DESIGNING FOR
PERFORMANCE: EIGHTH EDITION by William Stallings.
2. Computer Organization and Design: the Hardware/Software Interface: Third Edition by
David A Patterson and John L. Hennessy

Reference Books
1. Computer Architecture and Organization by John Hayes

Other resources (Slides)

Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Numerical Analysis

Part A- Introduction

I. Course code: CSE2107

II. Credit: 3

116
 1. Course Summary
The goal of the course is to provide the students with a strong background on
numerical approximation strategies and a basic knowledge on the theory that
supports numerical algorithms.

2. Course Objectives
1. Use numerical methods for solving a problem
2. Locate and use good mathematical software,
3. Get the accuracy you need from the computer,
4. Assess the reliability of the numerical results, and
5. Determine the effect of round off error or loss of significance.

3. Course Learning Outcomes

CLO1. Recall the algebraic and transcendental equations

CLO2. Illustrate the Eigenvalue and Eigen matrix
CLO3. Identify the roots using algorithms
CLO4. Devise the matrix calculation algorithms
CLO5. Examine the integration problems
CLO6. Demonstrate the differential equations

Part B- Lesson Plan

Course Details Learning plan

Timeline Topics /contents Learning Mapped Teaching Assess

Outcomes CLOs Strategies ment
Strateg
ies

Week 1 Numerical Solution of Explain the CLO 1 Lecture, Quiz

Algebraic & Solution of Demonstration, Participa
Transcendental algebraic and handouts tion
Equations: Bisection, transcendental Exam
False Position, equations
Newton-Raphson, and
Secant Method.

117
Week 2 ,3 Simultaneous Linear Compute the CLO 1 Lecture, Quiz
Non-Homogeneous solution of handouts Participa
Algebraic Equations: Simultaneous tion
Gauss Elimination, Linear Non- Exam
Gauss Jordan, Gauss Homogeneous
Jacobi, and Gauss Algebraic
Seidel Method. Equations

Week 4, 5, EigenValues and Calculate Eigen CLO 2 Lecture, Quiz

6 EigenVectors: Values and Demonstration, Participa
Introduction and Eigen Vectors handouts tion
concept of value and Exam
eigenvector,
Estimation of the size
of Eigenvalues.

Week 7, 8 Interpolation: Newton Discuss CLO 3 Lecture, Quiz

Forward, Newton different Demonstration, Participa
Backward, Gauss's Interpolation handouts tion
Forward, Gauss's method Exam
Backward, Stirling
Interpolation, Bessel's
Interpolation, and
Laplace-Everett's
Interpolation Formula,
Maxima-Minima of
Tabulated Function.

Week 9, Numerical Compute CLO 3 Lecture, Quiz

10 Differentiation: Numerical Demonstration, Participa
Newton's Forward and Differentiation handouts tion
Newton's Backward Exam
Difference Formula to
Compute the
Derivatives,
Difference Formula to
Compute the
Derivatives, Maxima-
Minima of Tabulated
Function.

118
Week 11, Numerical Integration: Compute CLO4 Lecture, Quiz
12 Newton-Cotes, Integration CLO5 Demonstration Participa
Trapezoidal, tion
Simpson's One-Third, Exam
Simpson's Three-Eight
Formula to Compute
Integration. Numerical
Double Integration.

Week 13, Numerical Solution of Explain the CLO4 Lecture, Quiz

14 Ordinary Differential solution of CLO6 Demonstration, Participa
Equations: Taylor ordinary handouts tion
Series, Taylor Series differential Exam
Method for equations
Simultaneous First-
Order and Second-
Order Differential
Equations, Picard's
Method of Successive
approximation.
Euler's, Modified
Euler's, and Improved
Euler's Method.
Runge-Kutta Methods
for Simultaneous First
order, Second order,
Third order, and
Fourth order
Differential Equations.
Predictor-Corrector
Method.
Part C- Assessment and Evaluations

Assessment Procedures

Assessment Name Description

Participation Attendance and participate in the class discussion

Quiz Quizzes are simple class tests with a duration from 20 minutes to
120 minutes. It can be online or offline, students need to prepare
for the quiz based on the instructed syllabus.

119
Exam Each course contains a final exam considering the complete
syllabus. It should be a 3hours exam for 72 marks. Students need
to answer at most 6 questions. Every question may include sub
questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):
Bloom’s Category Marks (out of Test Assignment Quizzes External Participation in
20) (10) (5) (5) Curricular/Co-
Curricular Activities
Remember 2
Understand 5
Apply 3
Analyze 2
Evaluate 4
Create 4

SEE-Semester End Examination (72 Marks)

Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

Mapping of CLOs to PLOs

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 0 0 0 0 0 0 0 1 0

CLO2 0 0 0 0 0 0 0 1 0

CLO3 0 1 0 0 0 0 0 1 0

CLO4 0 1 0 0 0 0 0 1 0

CLO5 0 1 0 0 0 0 0 1 0

CLO6 0 1 0 0 0 0 0 1 0

120
Part D- Resources

Textbooks
1. Numerical Methods for Engineers by Canale at el.
2. Numerical Methods for Scientists and Engineers by Richard Hamming

Reference Books
1. Interpolation by J.F. Steffensen
2. Numerical Methods by Santosh Gupta

Other resources (Slides)

Jashore University of Science and Technology

Faculty of Science and Engineering
Department of Computer Science and Engineering
Course Outline: Numerical Analysis Lab

Part A- Introduction

I. Course code: CSE2108

II. Credit: 1.5

1. Course Summary
The goal of the course is to provide the students with a strong background on
numerical approximation strategies and a basic knowledge on the theory that
supports numerical algorithms.

2. Course Objectives
1. Use numerical methods for solving a problem
2. Locate and use good mathematical software,
3. Get the accuracy you need from the computer,
4. Assess the reliability of the numerical results, and
5. Determine the effect of round off error or loss of significance.

3. Course Learning Outcomes

121
 CLO1. Recall the algebraic and transcendental equations
CLO2. Illustrate the Eigenvalue and Eigen matrix
CLO3. Identify the roots using algorithms
CLO4. Devise the matrix calculation algorithms
CLO5. Examine the integration problems
CLO6. Demonstrate the differential equations

Part B- Lesson Plan

Course Details Learning plan

Timeli Topics /contents Learning Map Teaching Strategies Asses

ne Outcomes ped sment
CLO Strate
s gies

Week Numerical Solution of Explain the CLO Lecture, Quiz

1 Algebraic & Solution of 1 Demonstration, handouts Partici
Transcendental algebraic and pation
Equations: Bisection, transcendenta Exam
False Position, l equations
Newton-Raphson, and
Secant Method.

Week Simultaneous Linear Compute the CLO Lecture, Quiz

2 ,3 Non-Homogeneous solution of 1 handouts Partici
Algebraic Equations: Simultaneous pation
Gauss Elimination, Linear Non- Exam
Gauss Jordan, Gauss Homogeneou
Jacobi, and Gauss s Algebraic
Seidel Method. Equations

Week EigenValues and Calculate CLO Lecture, Quiz

4, 5, 6 EigenVectors: Eigen Values 2 Demonstration, handouts Partici
Introduction and and Eigen pation
concept of value and Vectors Exam
eigenvector,
Estimation of the size
of Eigenvalues.

122
Week Interpolation: Newton Discuss CLO Lecture, Quiz
7, 8 Forward, Newton different 3 Demonstration, handouts Partici
Backward, Gauss's Interpolation pation
Forward, Gauss's method Exam
Backward, Stirling
Interpolation, Bessel's
Interpolation, and
Laplace-Everett's
Interpolation Formula,
Maxima-Minima of
Tabulated Function.

Week Numerical Compute CLO Lecture, Quiz

9, 10 Differentiation: Numerical 3 Demonstration, handouts Partici
Newton's Forward and Differentiatio pation
Newton's Backward n Exam
Difference Formula to
Compute the
Derivatives,
Difference Formula to
Compute the
Derivatives, Maxima-
Minima of Tabulated
Function.

Week Numerical Integration: Compute CLO Lecture, Quiz

11, 12 Newton-Cotes, Integration 4 Demonstration Partici
Trapezoidal, CLO pation
Simpson's One-Third, 5 Exam
Simpson's Three-Eight
Formula to Compute
Integration. Numerical
Double Integration.

123
Week Numerical Solution of Explain the CLO Lecture, Quiz
13, 14 Ordinary Differential solution of 4 Demonstration, handouts Partici
Equations: Taylor ordinary CLO pation
Series, Taylor Series differential 6 Exam
Method for equations
Simultaneous First-
Order and Second-
Order Differential
Equations, Picard's
Method of Successive
approximation. Euler's,
Modified Euler's, and
Improved Euler's
Method. Runge-Kutta
Methods for
Simultaneous First
order, Second order,
Third order, and
Fourth order
Differential Equations.
Predictor-Corrector
Method.

Part C- Assessment and Evaluations

Assessment Procedures

Assessment Name Description

Participation Attendance and participate in the class discussion

Quiz Quizzes are simple class tests with duration from 20

minutes to 120 minutes. It can be online or offline, students
need to prepare for the quiz based on the instructed
syllabus.

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3hours exam for 72 marks. Students
need to answer at most 6 questions. Every question may
include sub questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (40 Marks):

124
Bloom’s Category Marks (out of Test Attendance External Participation in
20) (30) (10) Curricular/Co-Curricular
Activities
Remember 2
Understand 5
Apply 13
Analyze 2
Evaluate 4
Create 4

SE- Lab Final Exam (60 marks)

Bloom’s Category Test

Remember 5
Understand 10
Apply 25
Analyze 10
Evaluate 5
Create 5

Mapping of CLOs to PLOs

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 0 0 0 0 0 0 0 1 0

CLO2 0 0 0 0 0 0 0 1 0

CLO3 0 1 0 0 0 0 0 1 0

CLO4 0 1 0 0 0 0 0 1 0

CLO5 0 1 0 0 0 0 0 1 0

CLO6 0 1 0 0 0 0 0 1 0

Part D- Resources

Textbooks
1. Numerical Methods for Engineers by Canale at el.
2. Numerical Methods for Scientists and Engineers by Richard Hamming

Reference Books
1. Interpolation by J.F. Steffensen

125
 2. Numerical Methods by Santosh Gupta

Other resources (Slides)

Jashore University of Science and Technology

Faculty of Science and Engineering
Department of Computer Science and Engineering
Course Outline: Business Studies for Engineers
Part A- Introduction
I.Course code: BUS 2101

II.Credit: 2

1.Course Summary

An introduction to the business and management aspects of the engineering profession,

project management, prioritization of resource allocation, intellectual property protection,
management of technical projects, and product/production management.

3. Course Objectives
In this course, student will work in groups to learn about strategy, marketing, finance, project
management and people management and will practice writing concise persuasive analyses
and action plans and verbally defending their ideas. After completing this course, student will
be prepared to be a working professional like engineer, manager, entrepreneur or other
professional over the years.

3.Course Learning Outcomes

126
CLO1.To understand the microeconomics and macroeconomics ideas related to engineering
CLO2.To understand demand and supply nature, costing pattern of business firms
CLO3.To understand market structure, investment structure, and national income
CLO4.To understand the basic accounting concepts, debit and credit formula, trial balance
CLO5.To understand the journal posting, ledger posting, preparation for financial sheet
CLO6. To understand voucher, laws, special journal, purchase journal, sales journal etc

Part B- Lesson Plan

Course Details Learning plan

Timelin Topics /contents Learning Outcomes Mapped Teaching Assessm
e CLOs Strategies ent
Strategie
s
Week 1, Basic accounting Explain accounting CLO1 Lecture, Quiz,
2 principles, Cash principles, CLO2 Exercise Assignm
book, Trial Balance, Apply cash book, trial Demonstrat ent,
Balance Sheet, Bank balance, balance sheet, ion Exam
Reconciliation reconciliation
statement statement
Week 3, Cost Accounts and Define and explain cost CLO3, Lecture, Quiz,
4 objectives; Elements accounts, CLO4 Exercise Assignm
of a costs; Direct Apply direct cost and Demonstrat ent,
cost, Overhead overhead allocation ion Exam
allocation.

Week 5, Preparation of a cost Prepare a cost sheet, CLO3 Lecture, Quiz,

6 sheet, Computation Compute breakeven CLO4 Exercise Assignm
of breakeven point. point Demonstrat ent,
Standard Costing. job Define, explain and ion Exam
order costing, compare different
Process costing, Cost costing.
Variance.

127
Week 7, Administration, Define and explain CLO4, Lecture, Quiz,
8 Management and administration, CLO5 Exercise Assignm
organization. management, Demonstrat ent,
Authority and organization, authority, ion Exam
responsibility. responsibility and
Scientific scientific management,
management. Compare different
Organization types of training,
structure, Evaluate and rate jobs
organization chart.
Span of control.
Selection and
recruitment of
employees; training
and its types,
promotion, wage
system and incentive;
job-evaluation and
merit rating. Plant
layout, layout of
physical facilities.
Week 9, Transportation and Define and explain CLO5, Lecture, Quiz,
10 storage. Material material handling, CLO6 Exercise Assignm
handling, maintenance, Demonstrat ent,
Maintenance, production control, ion Exam
Maintenance policy. Analyze purchasing
Production control in procedures,
intermittent and Identify factors
continuous affecting inventory
manufacturing build-up, economic lot
industry, functions of size and reorder point.
production control.
Purchasing
procedures:
Inventory- need and
methods of control,
Factors affecting
inventory building-
up. Economic lot size
and reorder point.

128
Week Compare laws and Law of contract: CLO6 Lecture, Quiz,
11, 12 acts Elements of a valid Exercise Assignm
contract, consideration, Demonstrat ent
party’s component to ion Exam
contract. Sale of goods,
hire and purchase.
Negotiable instrument
Act. Patent right and
validity. Industrial laws
in Bangladesh:
factories Act, Industrial
Relation Ordinance,
Workmen’s
compensation act.

Week Accounting Systems -Manual and CLO6 Lecture Quiz,

13, 14 and Special Ledgers computerized Exercise Assignm
accounting systems and Demonstrat ent,
their effectiveness ion Exam
-Voucher system;
General ledgers and
subsidiary ledgers
-Special journals –
advantages of special
journals, Cash receipts
journal; Sales journals;
Purchase journal; Cash
payments journal and
general journal.

Part C- Assessment and Evaluations

Assessment Procedures
Assessment Name Description

Quiz Quizzes are simple class tests with a duration from 20 minutes to
120 minutes. It can be online or offline, students need to prepare
for the quiz based on the instructed syllabus.

129
Assignment Type of home work assessment, students are given specific tasks
and instructed to complete them within a given period of time.

Attendance Student’s participation in the class lecture, quiz and exam.

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3hours exam for 72 marks. Students need
to answer at most 6 questions. Every question may include sub
questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Test Assignment Quizzes External Participation in

Marks (out of 20) (10) (5) (5) Curricular/Co-Curricular
Activities
Remember 2
Understand 5
Apply 3
Analyze 2
Evaluate 4
Create 4

SEE-Semester End Examination (72 Marks)

Bloom’s Category Test

Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12
Mapping of CLOs to PLOs
CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 1 1 1 1 0 1 0 0 0

130
CLO2 1 1 1 1 0 1 0 0 0

CLO3 1 1 1 1 0 1 1 0 0

CLO4 1 1 1 1 0 1 1 0 0

CLO5 1 1 1 1 0 1 1 0 0

CLO6 1 1 1 1 0 1 0 0 0

Part D- Resources
Textbooks
1. Pyle and White “Principle of Accounting”
2. Pyle and Larson “Principle of Accounting”
3. Herold Koontz “Management”
4.W. H. Newman “Administrative Action”
5.Terry &Frankin “Principle of Management”

Reference Books
1. Dewett, K.K. (2005). Modern Economic Theory, 21st revised edition, S. Chand & Co. Ltd.,
New Delhi.
2. Samuelson, P.A. and Nordhaus, W. (2005). Economics, 18th edition, Tata McGraw-Hill, New
Delhi.
3. Stiglitz, J.E. (2006). Principles of Micro Economics, 4th edition, W.W. Norton & Company
Ltd., London
4. Hermanson, R.H., Edwards, J.D. and Maher, M.W.W. (1989). Accounting Principles, 4th
edition, IRWIN, Illinois.
5. Horngren, C.T. and Harrison Jr., W.T. (1992). Accounting, 2nd edition, Prentice-Hall Inc.,
New Jersey.

131
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering
Course Outline: Sociology and Disaster Management
Part A- Introduction
I.Course code: HUM 2101

II.Credit: 2

1.Course Summary

This course provides students with an outline of the field of sociology. This course critically and
scientifically examines the social forces and processes that shape our personalities, institutions,
culture, and society. This course is the conception of democracy as a system of governance that
inspires power and responsibility in citizens and sociology as a means to understand how society
operates and influence it. This course considers general concepts used to interpret government as
well as develop a familiarity with the various institutions, political groups, beliefs, and ideas that
constitute government. In this course students will learn the basic concepts of the field of Gender,
Socialism, Capitalism, Feudalism, Human Civilization, Cultural Lag, Family, Marriage, Crime,
deviance, juvenile delinquency disaster management etc.

2.Course Objectives

The main objective of this course is to get students familiar with the process and formula of the
sociological imagination to a variety of contemporary social phenomena. The objective also
includes explaining or justifying various government structures and procedures, and the political
effects of these structures and procedures

3.Course Learning Outcomes

132
CLO1.Understand sociological terms, theoretical approaches to social phenomena and issues
of government and politics.
CLO2. Remember government, sociology, gender, socialism, capitalism, feudalism, human
civilization, cultural lag, family, marriage, crime, deviance, juvenile delinquency.
CLO3.Analyze different administrative and social factors and social change in historical and
contemporary society.
CLO4.Apply sociological issues in real life or professional field in case of research.
CLO5.Analyze specific sociological topics and utilizing the major theoretical models that are
appropriate for a specific topic including disaster management.
CLO6.Evaluate and compare the use of sociological theories and concepts to analyze critically
current and historical events, impact of disaster in real life.

Part B- Lesson Plan

Course Details Learning plan

Timelin Topics /contents Learning Outcomes Mapped Teaching Assessm
e CLOs Strategies ent
Strategie
s
Week 1 Introduction to basic - Functions, organs, CLO1 Lecture, Quiz,
concept of government and forms of Exercise Assignm
and politics modern state and Demonstrat ent,
government ion
-discuss about the
citizenship;
socialism,
capitalism,
feudalism, political
importance of
feudalism.
Week 2 Basic key terms of -students will CLO1, Lecture, Quiz,
government and develop knowledge CLO3 Exercise Assignm
contemporary issues. about contemporary Demonstrat ent,
issues of ion Exam
government

133
Week 3, Administrative functions students will learn CLO3 Lecture, Quiz,
4 and various tiers of about Exercise Assignm
government and administrative Demonstrat ent,
international politics. functions. ion Exam
-Learn about
Bangladesh issues
-How operates
administrative
functions of
developed countries
functions
Week 5, Significance of -definition and CLO2 Lecture, Quiz,
6 Sociology, Social description of Exercise Assignm
structure of Bangladesh sociology Demonstrat ent,
-Know about the ion Exam
terms of sociology
-Learn about social
structure

Week 7, Social research methods -students will CLO4 Lecture, Quiz,

8 and key sociology terms understand about Exercise Assignm
social research and Demonstrat ent,
its methods. ion Exam
-Learn about
society,
community,
association,
institution, group
-allocate an
assignment to
develop social
research

134
Week 9, Cultural content and -understand CLO5 Lecture, Quiz,
10 growth of capitalism and material and non- Exercise Assignm
development of material issues, Demonstrat ent
civilization. cultural lag and ion Exam
civilization.
-To learn about
growth of
capitalism
-analyze the
features and
consequences of
socialism
.

Week Understand family, -understand about CLO5 Lecture Quiz,

11, 12 marriage issues, family, how to CLO6 Exercise Assignm
industrial society and forms and turn into Demonstrat ent,
development of industrial society. ion Exam
urbanization. -understand
Various issues of disaster marriage
management -Industrial issues
-Organizational
factors

Week Develop the concept of -Understand CLO6 Lecture Quiz,

13, 14 population and development Exercise Assignm
migration, youth issues matters and social Demonstrat ent,
and how technological change issues. ion Exam
factors affect in life -Understand
Impact of disaster population and
management in real life emigrational issues.
-To leran crime
isssues and youth
unrest factors.
-To understand
technological
factors on social
life.

135
Part C- Assessment and Evaluations
Assessment Procedures
Assessment Name Description

Quiz Quizzes are simple class tests with a duration from 20

minutes to 120 minutes. It can be online or offline,
students need to prepare for the quiz based on the
instructed syllabus.
Assignment Type of home work assessment, students are given
specific tasks and instructed to complete them within a
given period of time.
Attendance Student’s participation in the class lecture, quiz and
exam.

Exam Each course contains a final exam considering the

complete syllabus. It should be a 3hours exam for 72
marks. Students need to answer at most 6 questions.
Every question may include sub questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Marks (out of Test Assignment Quizzes External Participation

20) (10) (5) (5) in Curricular/Co-
Curricular Activities
Remember 2
Understand 5
Apply 3
Analyze 2
Evaluate 4
Create 4

SEE-Semester End Examination (72 Marks)

Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10

136
Evaluate 10
Create 12

Mapping of CLOs to PLOs

CLOs PLO10 PLO11 PLO12 PLO13 PLO14 PLO15 PLO16 PLO17 PLO18

CLO1 1 1 1 0 0 0 0 0 0

CLO2 1 1 1 0 1 1 1 0 0

CLO3 1 1 1 1 0 1 1 0 0

CLO4 1 1 1 0 0 1 0 0 0

CLO5 1 1 1 1 0 1 0 0 0

CLO6 1 1 1 1 0 1 0 0 0
Part D- Resources
Textbooks
1. Turner. J.H. (ed) 2006. Handbook of Sociology
2. Turner, M. and Hulme, D : Governance, administration and development
3.
REFERENCE BOOKS:
1. Lake and Rothchild, Ed : The International Spread of Ethnic Conflict: Fear, Diffusion,
and Escalation
2. Giddnes, Anthony. 1984. The Constitution of Society
3. Turner, M. and Hulme, D. (1997) Governance, administration and development, London:
Macmillan .
4. Allan, Kenneth D. 2006. Contemporary Social and Sociological Theory.
Gouldner, Alvin. 1972. The Coming Crisis of Western Sociology
Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering
Course Outline: Software Development Project I
Part A- Introduction
III. Course code: CSE 2110
IV. Credit: 1.5

4. Course Summary

This course gives students experience designing, implementing, testing, and debugging large
programs. This C#.net /ASP.net/PHP/Java Programming Knowledge is valuable to both
beginners and advanced developers that already have experience in developing applications
software. Students will also get advanced programming experience in C#.net

137
/ASP.net/PHP/Java; covering topics such as inheritance, multithreading, networking,
database programming, and web development.

5. Course Objectives

 Will be able to understand how programming solve real life problems using computer
 Learn to develop software projects that support organization’s strategic goals
 Match organizational needs to the most effective software development model
 Plan and manage projects at each stage of the software development life cycle
(SDLC)
 Create project plans that address real-world management challenges
 Develop the skills for tracking and controlling software deliverable

6. Course Learning Outcomes

CLO1. Able to independently design programs

CLO2. Learn to produce professional-quality code
CLO3. Implement large programs
CLO4. Design and execute tests to identify software bugs
CLO5. Repair software bugs, redesigning and refactoring code when necessary
CLO6. Utilize, analyze, and critique code written by others

Part B- Lesson Plan

Course Details Learning plan
Timeline Topics Learning Outcomes Mapped Teaching Assessment
/contents CLOs Strategies Strategies

Week 1 Introduction Get the idea of the CLO1, Lecture, Quiz, Short
to Software course, Have real life CLO2 Demonstra question,
Project, knowledge of program tion, Problem
Program execution and the main Practical solving
execution, difference between IDE example
Difference and compiler, Learn how
between IDE to run a program without
and Compiler, using any IDE
Programming
from scratch

Week 2 Programming Learn how programming CLO1, Lecture, Quiz, Short

and Problem- will help you in times of CLO2, Demonstra question,
Solving building real life CLO3 tion, Problem
common software, Learn how to Practical solving
sense, solve real life problem example
Concepts of using computer , Gain the
IDEs philosophy of
(Microsoft programming

138
 Visual Studio,
Phpstorm,
Eclipse etc.),
Giving view
to software
project

Week 3 Programming Learn how programming CLO1, Problem- Group

and Problem- will help you in times of CLO2, based Exercise,
Solving building real life CLO3 Learning, Observation,
common software, Learn how to Demonstra Inventories
sense, solve real life problem tion,
Building the using computer, Gain the Project
base, OOP philosophy of /Assignme
review programming nt

Week 4 To Apply OOP Data Types, Type CLO2, Problem- Group

Knowledge Conversion, Boxing & CLO3, based Exercise,
Unboxing, Conditional CLO4 Learning, Observation,
Statements, Looping, Demonstra Inventories
Methods in C#, tion,
Properties, Arrays, Project
Indexers, Structures, /Assignme
Enumerations nt

Week 5 To Apply Garbage Collector, Stack CLO2, Problem- Group

OOP and Heap, System. GC CLO3, based Exercise,
Knowledge Class Understand the CLO4, Learning, Observation,
major qualities of a Good CLO5, Demonstra Inventories
Software, Encapsulation, CLO6 tion,
Inheritance, Project
Polymorphism, Class and /Assignme
Object Constructors, nt
Dynamic types, Optional
parameters, Names
&optional arguments,
Covariant generic type
parameters, Destructors,
Method overloading
Method overriding,
Early binding, Late
Binding, Abstract
Classes, Abstract
Methods, Interfaces,
Multiple Inheritance,

139
 Generic classes, Static
classes, Static
constructors, Object
initialize

Week 6 To Apply System Defined CLO2, Problem- Group

OOP Exceptions, Custom CLO3, based Exercise,
Knowledge Exceptions, Try, Catch, CLO4, Learning, Observation,
Finally, Throwing CLO5, Demonstra Inventories
exceptions, Function CLO6 tion,
Pointers, Multi cast Project
delegates, File Handling /Assignme
System. IO namespace, nt
File stream, Stream
Reader, Stream writer,
File info, Directory info,
Drive Info

Week To Apply Developing CLO2, Problem- Group

7,8 .NET Microsoft.NET CLO3, based Exercise,
Knowledge Applications for CLO4, Learning, Observation,
Windows (Visual CLO5, Demonstra Inventories
C#.NET) CLO6 tion,
Creating a Form Project
Adding Controls to /Assignme
a Form nt
Creating an
Inherited Form
Organizing
Controls on a Form
Creating MDI
Application
Working with Controls
Creating an Event
Handler for Control
Using Windows
Forms Controls
Using Dialog Boxes
Application
Adding Controls at
Run Time
Creating Menus
Validating User
Input
Using Data in Windows
Forms Applications

140
 Adding ADO.NET
Objects to and
Configuring
ADO.NET Objects
in a Windows
Forms Application
Accessing and
Modifying Data by
Using DataSets
Binding Data to
Controls
Overview of XML
Web Services
Persisting Data

Week 9 To Apply Developing CLO2, Problem- Group

.NET Microsoft.NET CLO3, based Exercise,
Knowledge Applications for CLO4, Learning, Observation,
Windows (Visual CLO5, Demonstra Inventories
C#.NET) CLO6 tion,
Printing and Reporting Project
in Windows Forms /Assignme
Applications Lessons nt
Printing From a
Windows Forms
Application
Using the Print
Preview, Page Setup,
and Print Dialogs
Constructing Print
Document Content by
Using GDI+
Creating Reports by
Using Crystal Reports
Deploying
Windows Forms
Applications
.NET Assemblies

Week 10 To Apply Introduction to LINQ CLO3, Problem- Group

.NET and ADO.NET Entity CLO4, based Exercise,
Knowledge Framework. CLO5, Learning, Observation,
LINQ expressions Using CLO6 Demonstra Inventories
via extension methods, tion,
Filtering, Sorting, Project
Aggregation, Skip and /Assignme

141
 Take operators, Joins, nt
Query, Lambda
expressions.
Data Projection
Single result value,
Existing types,
Anonymous
types,Grouping

Week To Apply ASP.NET CLO3, Proble Group

11, 12, .NET INTRODUCTION CLO4, m- Exercise,
13 Knowledge Difference Between CLO5, based Observation,
ASP and ASP.NET CLO6 Learnin Inventories
,Architecture g,
Inline Technique & Demon
Code-Behind stration
Technique,CodeRend ,
er Blocks Project
Server Controls ,Page /Assign
Basics, Page ment
lifecycle, Post back
Request
View State,
Directives
PROGRAMMING
WITH SERVER
CONTROLS
Web Server Controls
Basic Web Controls,
List Controls, Data
Controls,Adv
Controls, User
Controls, Master Page
and Content Page.
Validation Controls
Understanding
Validation
Client or Server Site
Validation
Required Filed
Validator
Rang Validator,
Regular Expression
Validator, Compare
Validator, Custom
Validator

142
Validator Summary.
CONTENT
Developing
Microsoft.NET
Applications for
Web (ASP.NET
using C#.NET)
STATE
MANAGEMENT
WITH ASP.NET
Context, View
State,Cookie State
Session State,
Session Tracking
Application Object,
Session and
Application Events
ADO.NET AND
ASP.NET
Working with Data
Controls, GridView,
-Inserting, Updating,
Deleting,-Sorting in
Data Grid
-Paging in Data Grid,
DataSourceControls,
Dataset,DetailsView
FormView,DataList,
Repeater Control,
Crystal Reports
ADO.NET
PROGRAMMING
Architecture,
DataReaders and
DataSets, Command
Object
Transaction
Programming
Procedure Execution
Data Adapter and
Data Set, Data
Tables, Data
Relation,Data Views
Updating Datase

143
Part C- Assessment and Evaluations
Assessment Procedures
Assessment Name Description

Quiz, Short questions These are simple class tests with duration from 10 minutes
to 90 minutes. It can be online or offline, students need to
prepare for the quiz based on the instructed syllabus.

Assignment Type of homework assessment, students are given specific

tasks and instructed to complete them within a given
period of time.

Implementation This part is the main development part of the project

where students will use different Programming languages
and tools to develop software.

Report and Viva Students have to prepare a document including all the
requirements, tools, methodologies, coding samples,
output scenario snapshots and raw data used in projects
and have to submit that in a proper format. Also, Students
have to face a viva where he/she have to answer questions
regarding the developments of the project.

Mapping of CLOs to Assessment

Mapping of CLOs to Assessment
CIE- Continuous Internal Evaluation (40 Marks):

Bloom’s Category Marks (out of 20) Test Attendance External Participation in

(30) (10) Curricular/Co-Curricular
Activities
Remember 2
Understand 5
Apply 13
Analyze 2
Evaluate 4
Create 4

SE- Lab Final Exam (60 marks)

Bloom’s Category Test
Remember 5
Understand 10
Apply 25
Analyze 10
Evaluate 5

144
Create 5

Mapping of CLOs to PLOs

CLOs PLO10 PLO11 PLO12 PLO13 PLO14 PLO15 PLO16 PLO17 PLO18

CLO1 1 1 0 0 0 0 0 1 0

CLO2 1 1 0 0 0 0 0 1 1

CLO3 1 1 0 0 0 0 0 1 1

CLO4 1 1 0 0 0 0 0 1 1

CLO5 1 1 0 0 0 0 0 1 1

CLO6 1 1 0 0 0 0 0 1 1

Part D- Resources
Textbooks
3. Online resources: w3schools.com, stackoverflow.com, codeforces.com etc.
4. Online tutorial from udemy, youtube.com etc.

Jashore University of Science and Technology

Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Algorithm Analysis and Design

Part A- Introduction
I.Course code: CSE 2201

II.Credit: 3

1.Course Summary

Algorithm analysis and design provide the theoretical backbone of computer science and are a
must in the daily work of the successful programmer. This course applies design and analysis
techniques to numeric and nonnumeric algorithms which act on data structures. Design is
emphasized so that the student will be able to develop new algorithms. Analysis of
algorithms is concerned with the resources an algorithm must use to reach a solution.

145
2.Course Objectives

1. The goal of this course is to provide a solid background in the design and analysis of the
major classes of algorithms.
2. To become familiar with the tools and techniques necessary to propose practical
algorithmic solutions to real-world problems which still allow strong theoretical bounds on
time and space usage.
3. To introduce a broad variety of important and useful algorithms and data structures in
different areas of applications and to concentrate on fundamental algorithms.
4. At the end of the course students will be able to develop their own versions for a
given computational task and to compare and contrast their performance.

3.Course Learning Outcomes

CLO1. Understand theoretical and mathematical structures, concepts of computer

algorithms
CLO2. Analyze the time complexity, space complexity, asymptotic performance of
algorithms, worst, average and best-cases of algorithms. .
CLO3. Demonstrate numerous algorithm design strategies including divide and
conquer, greedy method, dynamic programming, backtracking, finding shortest paths,
traversing salesmen, and implementing those algorithms.
CLO4. Illustrate and analyze various search and graph algorithms, graph coloring,
branch and bound algorithms, Hamiltonian cycle.
CLO5. Evaluate decision problems, the concept of P = NP, NP completeness and
Cook’s theorem.

Part B- Lesson Plan

Course Details Learning plan

Timelin Topics /contents Learning Outcomes Mapped Teaching Assess

e CLOs Strategies ment
Strategi
es
Week 1 algorithms, Discuss about the CLO1 Lecture Quiz
basic notations of basic structure of
algorithms, fundamental algorithms,
analysis of algorithms, notations of
criteria of algorithms algorithms, proof
techniques

146
Week 2 fundamental analysis of Solving the CLO1, Lecture, Quiz,
complexity, different problems of CLO2 Exercise Assign
asymptotic notation, asymptotic Demonstrat ment,
efficiency notation, Apply ion Exam
worst case best case and asymptotic notation
average case analysis to represent
algorithm
complexity
Week 3 Elementary Data Searching strategy CLO3 Lecture, Quiz,
Structures using divide and Exercise Assign
Divide and Conquer conquer, different Demonstrat ment,
algorithms types of sorting ion Exam
merge sort algorithms with
heap sort example
maxmin algorithm
quick sort

Week 4, Greedy algorithms, Discuss about CLO3 Lecture, Quiz,

5 Knapsack Problem, greedy method Exercise Assign
Job Sequencing with control abstraction, Demonstrat ment,
deadlines, discuss about the ion Exam
MST algorithms with
Kruskal’s algorithms, example,
Prim’s algorithms Demonstrate how
to find MST using
Prims and Kruskals
algorithm.

Week 6, Dynamic Programming, Discuss about the CLO3 Lecture, Quiz,

7 Matrix Chain Dynamic Exercise Assign
Multiplication, Programming Demonstrat ment,
Optimal Binary search basics, ion Exam
tree, Solve the
Multistage Graph, multistage graph
Bellman Ford Algorithm algorithm for
showing the
application of DP

147
Week 8, Huffman Code Solve Huffman CLO3 Lecture, Quiz,
9 Shortest path problem, code and shortest Exercise Assign
Floyd’s Algorithm, path problem, Demonstrat ment
Sequence Alignment the process of ion Exam
Backtracking sequence
N Queen Problem, alignment,
State Space tree understand the
concept of
backtracking,
Understand about
the 4-queen
problem and state
space tree.

Week Travelling salesman understand sum-of CLO3, Lecture Quiz,

10, 11 Problem, subset method, CLO4 Exercise Assign
Branch and Bound, learn planar graph, Demonstrat ment,
Sum of subset problem, graph coloring, ion Exam
Hamiltonian cycle, Hamiltonian cycle.
planar graph, graph Understand branch
coloring, and bound work,

Week Traversal and search Understand how CLO4 Lecture, Quiz,

12 techniques, traversal techniques Exercise Assign
BFS, work, Demonstrat ment,
DFS analyze the BFS ion Exam
and DFS for graph

Week NP-Completeness, P and NP (Cook's CLO5 Lecture, Quiz,

13, 14 Cook’s theorem theorem),examples Exercise Assign
NP- Complete problem of NP-complete Demonstrat ment,
problems; ion Exam
approximate
algorithms for NP-
hard problems or
polynomial
algorithms for sub
problems of NP-
hard problems

148
Part C- Assessment and Evaluations
Assessment Procedures
Assessment Name Description

Quiz Quizzes are simple class tests with a duration from 20 minutes
to 120 minutes. It can be online or offline, students need to
prepare for the quiz based on the instructed syllabus.

Assignment Type of home work assessment, students are given specific

tasks and instructed to complete them within a given period of
time.
Attendance Student’s participation in the class lecture, quiz and exam.

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3hours exam for 72 marks. Students
need to answer at most 6 questions. Every question may
include sub questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Marks (out Test Assignment Quizzes External Participation

of 20) (10) (5) (5) in Curricular/Co-
Curricular Activities
Remember 2
Understand 5
Apply 3
Analyze 2
Evaluate 4
Create 4

SEE-Semester End Examination (72 Marks)

Bloom’s Category Test

Remember 05
Understand 15

149
Apply 20

Analyze 10
Evaluate 10

Create 12

Mapping of CLOs to PLOs

CLOs PLO19 PLO20 PLO21 PLO22 PLO23 PLO24 PLO25 PLO26 PLO27

CLO1 1 1 1 0 0 0 0 1 0

CLO2 1 1 1 0 0 0 0 1 1

CLO3 1 1 1 0 0 0 0 1 0

CLO4 1 1 1 0 0 0 0 1 1

CLO5 1 1 1 0 0 0 0 1 0

Part D- Resources
Textbooks
1. Horowitz, Sahni, Rajasekaran: Fundamentals of Computer Algorithms
2. Thomas H. Cormen, Charles E. Leiserson and Ronald L. Rivest: Introduction to
Algorithms
Reference Books
1. Aho, Hopcroft and Ullman: The design and Analysis of Computer Algorithms
2. Sara Baase: Computer Algorithms: Introduction to Design and Analysis
3. D. E. Knuth: The Art of Computer Programming, Vol. 1, Fundamental Algorithms.
Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Algorithm Analysis and Design Lab

Part A- Introduction
I.Course code: CSE 2202

II.Credit: 1.5

1.Course Summary

150
 Algorithm analysis and design provide the theoretical backbone of computer science and are a must
in the daily work of the successful programmer. This course applies design and analysis
techniques to numeric and nonnumeric algorithms which act on data structures. Design is
emphasized so that the student will be able to develop new algorithms. Analysis of
algorithms is concerned with the resources an algorithm must use to reach a solution.

2.Course Objectives

1. The goal of this course is to provide a solid background in the design and analysis of the
major classes of algorithms.
2. To become familiar with the tools and techniques necessary to propose practical
algorithmic solutions to real-world problems which still allow strong theoretical bounds on
time and space usage.
3. To introduce a broad variety of important and useful algorithms and data structures in
different areas of applications and to concentrate on fundamental algorithms.
4. At the end of the course students will be able to develop their own versions for a given
computational task and to compare and contrast their performance.

3.Course Learning Outcomes

CLO1. Understand theoretical and mathematical structures, concepts of computer

algorithms
CLO2. Analyze the time complexity, space complexity, asymptotic performance of
algorithms, worst, average and best-cases of algorithms. .
CLO3.Demonstrate and implement numerous algorithm design strategies including divide and
conquer, greedy method, dynamic programming, backtracking, finding shortest paths,
traversing salesmen, and implementing those algorithms.
CLO4. Illustrate and apply various search and graph algorithms, graph coloring, branch
and bound algorithms, Hamiltonian cycle.
CLO5. Evaluate decision problems, the concept of P = NP, NP completeness and
Cook’s theorem.

Part B- Lesson Plan

Course Details Learning plan

Timelin Topics /contents Learning Outcomes Mapped Teaching Assessme

e CLOs Strategies nt
Strategies

151
Week 1 algorithms, Discuss about the CLO1 Lecture Quiz
basic notations of basic structure of
algorithms, fundamental algorithms,
analysis of algorithms, notations of
criteria of algorithms algorithms, proof
techniques
Week 2 fundamental analysis of Solving the CLO1, Lecture, Quiz,
complexity, different problems of CLO2 Exercise Assignme
asymptotic notation, asymptotic Demonstrat nt,
efficiency notation, Apply ion Exam
worst case best case and asymptotic notation
average case analysis to represent
algorithm
complexity
Week 3 Elementary Data Searching strategy CLO3 Lecture, Practical,
Structures using divide and Exercise Assignme
Divide and Conquer conquer, different Demonstrat nt,
algorithms types of sorting ion Exam
merge sort algorithms with
heap sort example
maxmin algorithm
quick sort

Week 4, Greedy algorithms, Discuss about CLO3 Lecture, Practical,

5 Knapsack Problem, greedy method Exercise Assignme
Job Sequencing with control abstraction, Demonstrat nt,
deadlines, discuss about the ion Exam
MST algorithms with
Kruskal’s algorithms, example,
Prim’s algorithms Demonstrate how
to find MST using
Prims and Kruskals
algorithm.

152
Week 6, Dynamic Programming, Discuss about the CLO3 Lecture, Practical,
7 Matrix Chain Dynamic Exercise Assignme
Multiplication, Programming Demonstrat nt,
Optimal Binary search basics, ion Exam
tree, Solve the
Multistage Graph, multistage graph
Bellman Ford Algorithm algorithm for
showing the
application of DP

Week 8, Huffman Code Solve Huffman CLO3 Lecture, Quiz,

9 Shortest path problem, code and shortest Exercise Practical,
Floyd’s Algorithm, path problem, Demonstrat Assignme
Sequence Alignment the process of ion nt
Backtracking sequence Exam
N Queen Problem, alignment,
State Space tree understand the
concept of
backtracking,
Understand about
the 4-queen
problem and state
space tree.

Week Travelling salesman understand sum-of CLO3, Lecture Quiz,

10, 11 Problem, subset method, CLO4 Exercise Practical,
Branch and Bound, learn planar graph, Demonstrat Assignme
Sum of subset problem, graph coloring, ion nt,
Hamiltonian cycle, Hamiltonian cycle. Exam
planar graph, graph Understand branch
coloring, and bound work,

Week Traversal and search Understand how CLO4 Lecture, Quiz,

12 techniques, traversal techniques Exercise Practical,
BFS, work, Demonstrat Assignme
DFS analyze the BFS ion nt,
and DFS for graph Exam

153
Week NP-Completeness, P and NP (Cook's CLO5 Lecture, Quiz,
13, 14 Cook’s theorem theorem),examples Exercise Practical,
NP- Complete problem of NP-complete Demonstrat Assignme
problems; ion nt,
approximate Exam
algorithms for NP-
hard problems or
polynomial
algorithms for sub
problems of NP-
hard problems

Part C- Assessment and Evaluations

Assessment Procedures
Assessment Name Description

Quiz Quizzes are simple class tests with duration from 20

minutes to 120 minutes. It can be online or offline, students
need to prepare for the quiz based on the instructed
syllabus.
Assignment Type of home work assessment, students are given specific
tasks and instructed to complete them within a given period
of time.
Attendance Student’s participation in the class lecture, quiz and exam.

Practical Mostly related to laboratory works or by implementing in

real code in either exercise book or in programming IDE

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3hours exam for 72 marks. Students
need to answer at most 6 questions. Every question may
include sub questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (40 Marks):

Bloom’s Category Marks (out of 20) Test Attendance External Participation in

(30) (10) Curricular/Co-Curricular
Activities
Remember 2
Understand 5

154
Apply 13
Analyze 2
Evaluate 4
Create 4

SE- Lab Final Exam (60 marks)

Bloom’s Category Test

Remember 5
Understand 10
Apply 25
Analyze 10
Evaluate 5
Create 5

Mapping of CLOs to PLOs

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 1 1 1 0 0 0 0 1 0

CLO2 1 1 1 0 0 0 0 1 1

CLO3 1 1 1 0 0 0 0 1 0

CLO4 1 1 1 0 0 0 0 1 1

CLO5 1 1 1 0 0 0 0 1 0

Part D- Resources
Textbooks
1. Horowitz, Sahni, Rajasekaran: Fundamentals of Computer Algorithms
2. Thomas H. Cormen, Charles E. Leiserson and Ronald L. Rivest: Introduction to
Algorithms
Reference Books
1. Aho, Hopcroft and Ullman: The design and Analysis of Computer Algorithms
2. Sara Baase: Computer Algorithms: Introduction to Design and Analysis
3. D. E. Knuth: The Art of Computer Programming, Vol. 1, Fundamental Algorithms.
Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Database Management System

Part A- Introduction

155
 I. Course code: CSE 2203
II. Credit: 3

1. Course Summary
A computer engineer needs to know the fundamentals of database architecture,
database management systems, and database systems, principles and methodologies
of database design, and techniques for database application development.

2. Course Objectives
1. An understanding of the needs for and uses of database management systems in
business;
2. An understanding of the context, phases and techniques for designing and building
database information systems in business;
3. An understanding of the components of a computerized database information system
(application)
4. An ability to correctly use the techniques, components and tools of a typical database
management system -- such as Access 2000 or Oracle 8i -- to build a comprehensive
database information system (application);
5. An ability to design a correct, new database information system for a business
functional area and implement the design in either Access 2000 or Oracle 8i;
6. An introductory understanding of some advanced topics in database management, e.g.,
object-relational databases and design, distributed databases, database administration
(security, backup and restore, tuning) and data warehousing.

3. Course Learning Outcomes

CLO1. Database Concepts

CLO2. Relational Data Model
CLO3. Functional Dependency and Normal Forms
CLO4. Relational Calculus
CLO5. Relational Database Design
CLO6. Entity-Relationship (ER) approach
CLO7. Transformation of the ER model to SQL

Part B- Lesson Plan

Course Details Learning plan

156
Timeline Topics /contents Learning Outcomes Mapped Teaching Assess
CLOs Strategies ment
Strateg
ies

Week 1 Files and Define Database CLO 1 Lecture, Quiz

Databases, Explain advantage of handouts Particip
Database Database over file ation
Management system Exam
systems, Data Describe different data Assign
models model ment

Week 2 ,3 Relations, Explain Relational Data CLO 2 Lecture, Quiz

Domains, model handouts Particip
Attributes and Apply RDM in DB ation
Tuple design Exam
Describe different types Assign
of attribute ment

Week 4, 5 Anomalies, Evaluate anomalies in CLO 3 Lecture, Quiz

Functional DB design handouts Particip
Dependency, Identify different normal ation
First, Second and form Exam
third normal Apply normalization in Assign
forms, Boyce- DB design ment
Codd Normal Convert one normal
form form to another normal

Week 6, 7, 8 Relational Understanding the CLO 4 Lecture, Quiz

Calculus Based concept of SQL handouts Particip
Languages: SQL, ation
Relational Exam
algebra and Set Assign
operations ment

Week 9, 10 Relational design Explain decomposition CLO 5 Lecture, Quiz

criteria, Lossless and synthesis algorithm handouts Particip
decomposition, Define lossless ation
decomposition decomposition Exam
algorithms, Assign
synthesis ment
algorithms

157
Week 11, 12 The ER model Define entity CLO 6 Lecture, Quiz
and its Relationship, handouts Particip
constructs, ER relationship set. ation
modeling in Apply E-R approach to Exam
logical database DB design Assign
design. ment

Week 13, 14 Transformation Explain transformation CLO 7 Lecture, Quiz

of the ER model of ER model to SQL handouts Particip
to SQL ation
Exam

Part C- Assessment and Evaluations

Assessment Procedures

Assessment Name Description

Participation Attendance and participate in the class discussion

Quiz Quizzes are simple class tests with a duration from 20

minutes to 120 minutes. It can be online or offline, students
need to prepare for the quiz based on the instructed
syllabus.

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3hours exam for 72 marks. Students
need to answer at most 6 questions. Every question may
include sub questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Marks (out of Test Assignment Quizzes External Participation

20) (10) (5) (5) in Curricular/Co-
Curricular Activities
Remember 2
Understand 5
Apply 3
Analyze 2
Evaluate 4
Create 4

158
SEE-Semester End Examination (72 Marks)

Bloom’s Category Test

Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12
Mapping of CLOs to PLOs

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 1 0 0 0 0 0 0 1 0

CLO2 1 0 0 0 0 0 0 1 0

CLO3 1 0 0 0 0 0 0 1 0

CLO4 1 0 0 0 0 0 0 1 0

CLO5 1 0 0 0 0 0 0 1 0

CLO6 1 0 0 0 0 0 0 1 0

CLO7 1 0 0 0 0 0 0 1 0

Part D- Resources

Textbooks
1. Database System Concepts by Korth and Silverchatz
2. Principle of Database Systems by O. William

Reference Books
1. Relational Database Management System by Jeffrey Ullman

Other resources (Slides)

159
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Database Management System Lab

Part A- Introduction

I. Course code: CSE 2204

II. Credit: 1.5

1. Course Summary
A computer engineer needs to know the fundamentals of database architecture,
database management systems, and database systems, principles and methodologies
of database design, and techniques for database application development.

2. Course Objectives
1. An understanding of the needs for and uses of database management systems in
business;
2. An understanding of the context, phases and techniques for designing and building
database information systems in business;
3. An understanding of the components of a computerized database information system
(application)
4. An ability to correctly use the techniques, components and tools of a typical database
management system -- such as Access 2000 or Oracle 8i -- to build a comprehensive
database information system (application);
5. An ability to design a correct, new database information system for a business
functional area and implement the design in either Access 2000 or Oracle 8i;
6. An introductory understanding of some advanced topics in database management, e.g.,
object-relational databases and design, distributed databases, database administration
(security, backup and restore, tuning) and data warehousing.

3. Course Learning Outcomes

CLO1. Database Concepts

CLO2. Relational Data Model
CLO3. Functional Dependency and Normal Forms
CLO4. Relational Calculus
CLO5. Relational Database Design
CLO6. Entity-Relationship (ER) approach
CLO7. Transformation of the ER model to SQL

160
Part B- Lesson Plan

Course Details Learning plan

Timeline Topics /contents Learning Mappe Teaching Assessment

Outcomes d Strategies Strategies
CLOs

Week 1 Files and Define Database CLO 1 Lecture, Quiz

Databases, Explain advantage handouts Participation
Database of Database over Exam
Management file system Assignment
systems, Data Describe different
models data model

Week 2 Relations, Explain CLO 2 Lecture, Quiz

,3 Domains, Relational Data handouts Participation
Attributes and model Exam
Tuple Apply RDM in Assignment
DB design
Describe different
types of attribute

Week 4, Anomalies, Evaluate CLO 3 Lecture, Quiz

5 Functional anomalies in DB handouts Participation
Dependency, design Exam
First, Second and Identify different Assignment
third normal normal form
forms, Boyce- Apply
Codd Normal normalization in
form DB design
Convert one
normal form to
another normal

Week 6, Relational Understanding the CLO 4 Lecture, Quiz

7, 8 Calculus Based concept of SQL handouts Participation
Languages: SQL, Exam
Relational algebra Assignment
and Set operations

161
Week 9, Relational design Explain CLO 5 Lecture, Quiz
10 criteria, Lossless decomposition handouts Participation
decomposition, and synthesis Exam
decomposition algorithm Assignment
algorithms, Define lossless
synthesis decomposition
algorithms

Week 11, The ER model and Define entity CLO 6 Lecture, Quiz
12 its constructs, ER Relationship, handouts Participation
modeling in relationship set. Exam
logical database Apply E-R Assignment
design. approach to DB
design

Week 13, Transformation of Explain CLO 7 Lecture, Quiz

14 the ER model to transformation of handouts Participation
SQL ER model to SQL Exam

Part C- Assessment and Evaluations

Assessment Procedures

Assessment Name Description

Participation Attendance and participate in the class discussion

Quiz Quizzes are simple class tests with duration from 20

minutes to 120 minutes. It can be online or offline, students
need to prepare for the quiz based on the instructed
syllabus.

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3hours exam for 72 marks. Students
need to answer at most 6 questions. Every question may
include sub questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (40 Marks):

Bloom’s Category Marks (out Test Attendance External Participation in

of 20) (30) (10) Curricular/Co-Curricular
Activities
Remember 2
Understand 5

162
Apply 13
Analyze 2
Evaluate 4
Create 4

SE- Lab Final Exam (60 marks)

Bloom’s Category Test

Remember 5
Understand 10
Apply 25
Analyze 10
Evaluate 5
Create 5

Mapping of CLOs to PLOs

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 1 0 0 0 0 0 0 1 0

CLO2 1 0 0 0 0 0 0 1 0

CLO3 1 0 0 0 0 0 0 1 0

CLO4 1 0 0 0 0 0 0 1 0

CLO5 1 0 0 0 0 0 0 1 0

CLO6 1 0 0 0 0 0 0 1 0

CLO7 1 0 0 0 0 0 0 1 0

Part D- Resources

Textbooks
1. Database System Concepts by Korth and Silverchatz
2. Principle of Database Systems by O. William

Reference Books
1. Relational Database Management System by Jeffrey Ullman

Other resources (Slides)

Jashore University of Science and Technology

Faculty of Science and Engineering
Department of Computer Science and Engineering
Course Outline: Software Engineering

163
Part A- Introduction
I.Course code: CSE 2207

II.Credit: 3

1.Course Summary

Software Engineering is a specified field in which the technique of building a

sustainable and robust software system is learned. Knowledge about the process and
nature of software is necessary to have a basic understanding of software. The process
of building software which describes the step by step work like customer
communication, planning the project, cost estimation, building design, coding and
employing the software are the building blocks of the course. Communicating with
customers is the initial and most important part of requirement gathering. The Object
Oriented Design paradigm is used so that making the software and testing and
debugging can be done efficiently. Different testing tools and sustainability
measurement is necessary to measure the performance of the software. At the end of
each chapter, the assignment or report is compulsory to make students involved to use
knowledge of this course to think about practical software systems and make use of
the process and testing techniques to build real life problem oriented software.

2.Course Objectives

1.The main objective of this course is to get students familiar with the process and
formula of making a successful sustainable industry oriented software.
2.The objective also includes the testing process and making students capable of
measuring software performance.
3.Learn metrics for managing quality assurance.
4.Understand capabilities of test tools.
5.Establish a testing group and manage the whole testing project.
6.Clearly and correctly report the software defectives
7.Asses the software product correctly

3.Course Learning Outcomes

164
 CLO1.Understand Software, its nature and characteristics, SDLC, principles of
Software Engineering
CLO2. Remember modularity, abstraction in design, rigor and formality.
CLO3.Analyze different software engineering processes and have the capability to
select the best process in accordance with given criteria.
CLO4.Apply different OOP design paradigms like use case diagram, sequence
diagram, ER diagram and data flow diagram.
CLO5.Analyze testing techniques like unit testing and system testing to measure
performance of software systems in different environments.
CLO6.Evaluate and compare the cost and manpower needed to build a sustainable
software system.

Part B- Lesson Plan

Course Details Learning plan
Timeline Topics /contents Learning Outcomes Mapped Teaching Assessment
CLOs Strategies Strategies

Week 1 Introduction to -know about software, CLO1 Lecture Quiz

software software engineering
engineering. and generic process
framework
-know about realities
and myths that exist in
the software
engineering industry.
Week 2, 3 Presentation on -students will CLO1, Lecture, Quiz,
SDLC, software understand SDLC CLO3 Exercise Assignment,
engineering steps, principles Demonstr Exam
principles. followed in software ation
engineering and
framework activity.

165
Week 4, 5 Software -students will learn CLO3 Lecture, Quiz,
Engineering process about different Exercise Assignment,
models description. software engineering Demonstr Exam
process models. ation
-Learn about waterfall
model, incremental
process model,
prototyping model,
spiral model,
component based
development and
unified process model.
-how computers
interact and handle
connected input and
output devices.
Week 6, 7 Agile Development, -definition and CLO2 Lecture, Quiz,
Rigor and formality, description of agility. Exercise Assignment,
modularity, -Rigor and formality Demonstra Exam
abstraction, definition. tion
instrumentality in -Modularity
design description.
Cohesion and
coupling description.

166
Week 8, 9 OOP design -students will CLO4 Lecture, Quiz,
paradigms understand about OOP Exercise Assignment,
design paradigms and Demonstr Exam
UML diagrams. ation
-Learn about use case
diagrams, sequence
diagrams, data flow
diagrams, ER
diagrams, and
component diagrams.
-Learn to draw class
diagrams, object
diagrams, activity
diagrams, state
diagrams, and
communication
diagrams.
-allocate an
assignment to prepare
diagrams for a project.

Week 10, Requirement -understand CLO5 Lecture, Quiz,

11 gathering and techniques of Exercise Assignment,
Testing techniques successful Demonstra Exam
communication with tion
customers and get
requirements of
software specification.
-understand testing
techniques.
-analyze black box
and white box testing,
difference between
them.
- testing criteria
-Understand six
sigmas of SQA.

167
Week 12, Testing strategies -understand about CLO6 Lecture, Quiz,
13 different testing Exercise Assignment,
strategies. Demonstra Exam
-understand unit tion
testing and system
testing.
-analyze smoke
testing, alpha testing,
beta testing,
integration testing,
validation testing,
performance testing,
stress testing, recovery
testing, security
testing.
Week 14 cost estimation -discussion on Delphi CLO6 Lecture, Quiz,
technique, COCOMO Exercise Assignment,
model, Halstead’s Demonstra Exam
software science. tion
-work: calculating cost
of a real time project.

Part C- Assessment and Evaluations

Assessment Procedures
Mapping of CLOs to Assessment
CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Marks Test (10) Assignment Quizzes External

(out of 20) (5) (5) Participation in
Curricular/Co-
Curricular Activities
Remember 2
Understand 5
Apply 3
Analyze 2
Evaluate 4
Create 4

SEE-Semester End Examination (72 Marks)

168
Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

Mapping of CLOs to PLOs

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 1 1 1 0 0 0 0 1 1

CLO2 1 1 1 0 0 0 0 1 0

CLO3 1 1 1 0 0 0 0 1 0

CLO4 1 1 1 0 0 0 0 1 1

CLO5 1 1 1 0 0 0 0 1 1

CLO6 1 1 1 0 0 0 0 1 1

Part D- Resources
Textbooks
1. R. S. Pressman: Software Engineering: A Practitioner's Approach 3rd Ed.
2. Ian Sommerville: Software engineering
3. Ohezzi, M. Jazayeri and D. Mandrioli: Fundamentals of Software Engineering
Reference Books
1. Reifer :Software Management 5/e
2. Thayer : Software Engineering Project Management 2/e
3. Wilson: Software Architecture: Prospective on an Emerging Discipline
4. R. Wirfs Brock et. al.: Designing Object-oriented Software

169
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering
Course Outline: Mobile Application Development Lab
Part A- Introduction
I.Course code: CSE 2210

II.Credit: 1.5

1.Course Summary

Computer Engineers should be competent in mobile app and game development. This
development Knowledge is valuable to both beginners and advanced developers that
already have experience in developing mobile apps.

2.Course Objectives

1. Create and populate mobile applications and games.

2. Students should be able to design and implement programs for complex problems,
making good use of the features of the language.
3. Teaches students how to design, develop and program computer systems using an
object oriented programming language such as C++, Java, C#, android to develop
application and games.

3.Course Learning Outcomes

170
 CLO1. Analyze and apply the structure of the new paradigm that helps the students to
understand its activities in a logical way that follows a bottom-up process.
CLO2.Remember every single detail such as writing code in a particular language,
steps to execute them, translate them for error detection and implementation.
CLO3.Apply the already learnt things to properly implement the program on various
real life problems and learn the correlations between coding and real time solutions.
CLO4. Evaluate numerous possible ways to solve a problem and find the best way for
developing games and applications.

Part B- Lesson Plan

Course Details Learning plan
Timeline Topics /contents Learning Outcomes Mapped Teaching Assessme
CLOs Strategies nt
Strategies
Week 1, 2 To Apply OOP Getting started with CLO1 Lecture, Quiz,
Knowledge for Android and iOS CLO2 Exercise Assignme
Android and/or Demonstr nt,
iOS app ation Practical
development

Week 3, 4, Create UI for Building simple User CLO2, Lecture, Quiz,

5 Android and/or Interface CLO3 Exercise Practical,
iOS app Demonstr Exam
ation

Week 6, 7, To apply Handling files in CLO3, Lecture, Quiz,

8 knowledge of Android and iOS CLO4 Exercise Assignme
handling files in Demonstr nt,
Android and iOS ation Practical,
Exam

171
Week 9, To apply .NET Developing CLO3, Lecture, Quiz,
10 knowledge Microsoft.NET CLO4 Exercise Assignme
Applications for Demonstr nt,
Windows (Visual ation Practical,
C#.NET) Exam

Reporting in Windows
Forms

Application

Preview, Page

Dialogs

Document Content
by Using GDI+

by Using Crystal
Reports

Windows Forms
Applications
.NET Assemblies
Week 11, Create mid-level Course Project CLO3, Lecture, Quiz,
12, 13 14 application in CLO4 Exercise Practical,
Android and/or Demonstr Assignme
iOS ation nt,
Exam

Part C- Assessment and Evaluations

Assessment Procedures

Assessment Name Description

Quiz Quizzes are simple class tests with duration from 20 minutes to
120 minutes. It can be online or offline, students need to prepare
for the quiz based on the instructed syllabus.

172
Practical Mostly related to laboratory works or by implementing in real
code in either exercise book or in programming IDE.

Attendance Student’s participation in the class lecture, quiz and exam.

Assignment Type of home work assessment, students are given specific tasks
and instructed to complete them within a given period of time.

Exam Includes set of programming problems to solve within a timeline

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (40 Marks):

Bloom’s Category Marks (out Test (30) Attendance External Participation in

of 20) (10) Curricular/Co-Curricular
Activities
Remember 2
Understand 5
Apply 13
Analyze 2
Evaluate 4
Create 4

SE- Lab Final Exam (60 marks)

Bloom’s Category Test

Remember 5
Understand 10
Apply 25
Analyze 10
Evaluate 5
Create 5

Mapping of CLOs to PLOs

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

173
CLO1 1 1 0 0 0 0 0 1 0

CLO2 1 1 0 0 0 0 0 1 1

CLO3 1 1 0 0 0 0 0 1 1

CLO4 1 1 0 0 0 0 0 1 1

Part D- Resources
1. W3school.com
2. Online tutorial

Jashore University of Science and Technology

Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Probability and Statistics for Engineers

Part A- Introduction

I. Course code: MATH 2201

II. Credit: 3

1. Course Summary
This is an introductory course on statistics and probability. All the basic methods of statistics
and probability will be covered in this course.

2. Course Objectives
1. Receive a basic knowledge of statistics and probability
2. Able to solve basic statistics and probability related problems using a variety of skills and
strategies.
3. Able to analyze data and find insights

3. Course Learning Outcomes

CLO1. Devise the primary idea to statistics and probability

CLO2. Learn to solve statistics and probability related problems using programming
languages.
CLO3. Design the experiment to understand real life problem
CLO4. Explore different theories of statistics and probability
CLO5. Utilize different Statistical Methods

174
Part B- Lesson Plan

Course Details Learning plan

Timeline Topics Learning Outcomes Mapped Teaching Assessment

/contents CLOs Strategies Strategies

Week 1 Preliminaries Getting familiar with CLO1 Lecture Quiz

different concepts

Week 2, 3 Measures of Arithmetic Mean, CLO1, Lecture Quiz

Central Geometric Mean, CLO2 Exercise Assignment
Tendency Harmonic Mean, Median, Demonstrati Practical
Mode, Weighted mean on Exam

Week 4, 5, Measures of Range, Standard CLO3 Lecture Quiz

6 Dispersion Deviation, Mean Exercise Assignment
Deviation, Quartile Demonstrati Practical
Deviation, Variance, on Exam
Moments, Skewness and
Kurtosis

Week 7, 8 Correlation Linear Correlation - Its CLO1 Lecture Quiz

Theory measures and Exercise Assignment
significance, Rank Demonstrati Practical
Correlation on Exam

Week 9, 10 Regression Linear and non-linear CLO1, Lecture Quiz

Analysis regression, Least-square CLO2, Exercise Assignment
method of curve fittings CLO5 Demonstrati Practical
on Exam

Week 10, Probability CLO5 Lecture Quiz

Elementary concepts,
11 Exercise Assignment
Laws of probability,
Demonstrati Practical
Conditional Probability
on Exam
and Bay’s theorem,
Random variables

Week 12, Probability CLO4 Lecture Quiz

Binomial distribution,
13, 14 Distributions Exercise Assignment
Poisson distribution and
Demonstrati Practical
Normal distribution
on Exam

175
Part C- Assessment and Evaluations

Assessment Procedures

Assessment Name Description

Quiz Quizzes are simple class tests with a duration from 20 minutes
to 120 minutes. It can be online or offline, students need to
prepare for the quiz based on the instructed syllabus.

Assignment Type of home work assessment, students are given specific

tasks and instructed to complete them within a given period of
time.

Practical Mostly related to laboratory works or by implementing in real

code in either exercise book or in programming IDE

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3hours exam for 72 marks. Students
need to answer at most 6 questions. Every question may
include sub questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Marks (out of 20) Test Assignment Qui External Participation
(10) (5) zze in Curricular/Co-
s Curricular Activities
(5)
Remember 2
Understand 5
Apply 3
Analyze 2
Evaluate 4
Create 4

SEE-Semester End Examination (72 Marks)

Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

176
Mapping of CLOs to PLOs

CLOs PLO10 PLO11 PLO12 PLO13 PLO14 PLO15 PLO16 PLO17 PLO18

CLO1 1 1 0 0 0 0 0 1 0

CLO2 1 1 0 0 0 0 0 1 1

CLO3 1 1 0 0 0 0 0 1 1

CLO4 1 1 0 0 0 0 0 1 1

CLO5 1 1 0 0 0 0 0 1 1

Part D- Resources

Textbooks
1. Mathematical Statistics, Author: Kapur, J.N. and Saxena, H.C.
2. A First Course in Mathematical Statistics, Author: Weatherburn, C.E.

Reference Books
1. Probability and Mathematical Statistics, Author: MarekFisz
2. Fundamentals of Mathematical Statistics, Author: Gupta, S.C. and Kapoor V.K.

Jashore University of Science and Technology

Faculty of Science and Engineering
Department of Computer Science and Engineering
Course Outline: Business Psychology
Part A- Introduction
I.Course code: BUS 2201

II.Credit: 2

1.Course Summary

177
This course is designed to provide a broad overview of the field of Psychology. Special attention
will be given to helping the student become a better thinker by learning cognitive science,
industrial psychology, and using existing knowledge to draw conclusions, make predictions, or
construct explanations. The goal of this course is to think consciously, deliberately and skillfully
about human behavior and hence, the topics such as physiological psychology, object
recognition and language understanding, job analysis, method of section, learning, cognition,
emotions, as well as others are included. The concept of behavior-based safety program and
insights into accident prevention are included in this course.

2.Course Objectives

The objectives of this course is to give students the idea of the discussing the research and theory
as it relates to the following topics such as personnel, employee motivation and satisfaction,
group processes and leadership, and organizational change and development,self-efficacy and
self-safety and describing the scope of study in the field of industrial and organizational
psychology and the explanation of measurement and determinants of job satisfaction.

3.Course Learning Outcomes

CLO1.Analyze the basic theories of motivation, including concepts such as instincts,

drive reduction, and self-efficacy, self- safety and applythe nature of cognitive
science, introduce business psychology.
CLO2 Understand the theory suggested for organizational development and create
the role of learning industrial theory in the workplace.
CLO3.Analyze the types and causes of accidents with diagramandextending
cooperation concerning industrial safety measures.
CLO4.Apply different OOP design paradigms like use case diagram, sequence
diagram, ER diagram and data flow diagram.
CLO5.Apply engineering design to produce solutions that meet specified needs with
consideration of public health, safety, and welfare, as well as global, cultural, social,
environmental, and economic factors
CLO6.Evaluate the ability to think critically, to analyze complex and diverse
concepts, and to use reason and judgment and explain the measurement and
determinants of job satisfaction.

Part B- Lesson Plan

Course Details Learning plan

Timeline Topics Learning Outcomes Mapped Teaching Assessment

/contents CLOs Strategies Strategies

178
Week 1 Introduction -Student will able to explain CLO1 Lecture Quiz
to the history andmethods of
Psychology, psychology, concepts of
business business psychology.
psychology.

Week 2, 3 Cognitive -students will able to CLO1 Lecture, Quiz,

Science. understand the cross Exercise Assignment
disciplinary, historical Demonstrati ,
foundations of cognitive on Exam
science.
-understand the research
problems that unify the
cognitive sciences, including
language, thought, perception,
attention, learning, memory,
reasoning, problem solving,
judgment, and decision-
making.
-Understand the assumptions,
methods and concepts that
unify and differentiate the
cognitive sciences.
-Understand the diversity of
theoretical approaches and
paradigms across the cognitive
sciences, including neural,
embodied, social, and/or
technological approaches.
Week 4 Reasoning. -students will able to explain CLO5 Lecture, Quiz,
the three methods of reasoning Exercise Assignment,
which are the deductive, Demonstrati Exam
inductive, and adductive on
approaches.

179
Week 5, 6 Object -student will able to give the CLO2, Lecture, Quiz,
recognition explanation of object CLO4 Exercise Assignment,
and recognition and observe the Demonstratio Exam
language data spatial resolution. n
understandi -understand and appreciate the
ng. role of human behavior,
Learning -Demonstrate knowledge of
Industrial the biological and conceptual
Psychology languages of the brain and
their potential.
-understand and appreciate the
connection between scientific
inquiry and the creative and
artistic dimensions in the field
of Psychology
Week 7, Introduction -students will able to CLO5 Lecture, Quiz,
8, 9 to Job and understand about Job analysis Exercise Assignment
Job which is a procedure through Demonstrati , Exam
analysis, which they determine the on
Methods of duties and responsibilities,
selection. nature of the jobs and finally to
decide qualifications, skills
and knowledge to be required
for an employee to perform
particular job.
-understand what tasks are
important and how they are
carried on. Job analysis forms
basis for later HR activities
such as developing effective
training program, selection of
employees, setting up of
performance standards and
assessment of employee’s
performance appraisal and
employee remuneration system
or compensation plan.

180
Week 10 Training in -student will able to know CLO2, Lecture, Quiz,
Industry about coaching, training CLO3 Exercise Assignment,
program implementation, Demonstratio Exam
instructional design, and n
management training.

Week 11, Motivation -Students will able to CLO1, Lecture, Quiz,

12 and Work, understand about CLO5 Exercise Assignment,
Job Illustrate intrinsic and extrinsic Demonstratio Exam
satisfaction motivation and describe basic n
theories of motivation,
including concepts such as
instincts, drive reduction, and
self-efficacy.
-explain the measurement and
determinants of job
satisfaction.

Week 13, Introduction - Students will able to CLO1, Lecture, Quiz,

14 to understand the basic CLO4 Exercise Assignment,
Ergonomics, physiological systems, nervous Demonstratio Exam
System system, respiratory system, n
Engineering circulatory system, metabolic
, Accident system.
and Safety. -analyze the causes of a
systems failure.
-answer the question ‘why is
systems engineering
important?
-explain types and causes of
accidents with diagram
andextending cooperation
concerning industrial safety
measures.

181
Part C- Assessment and Evaluations
Assessment Procedures
Mapping of CLOs to Assessment
CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Marks (out of 20) Test Assignment Quizzes External

(10) (5) (5) Participation in
Curricular/Co-
Curricular
Activities
Remember 2
Understand 5
Apply 3
Analyze 2
Evaluate 4
Create 4

SEE-Semester End Examination (72 Marks)

Bloom’s Category Test

Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

Mapping of CLOs to PLOs

CLOs PLO10 PLO11 PLO12 PLO13 PLO14 PLO15 PLO16 PLO17 PLO18

CLO1 1 1 1 0 0 0 0 1 1

CLO2 1 1 1 0 0 0 0 1 0

CLO3 1 1 1 0 0 0 0 1 0

CLO4 1 1 1 0 0 0 0 1 1

CLO5 1 1 1 0 0 0 0 1 1

CLO6 1 1 1 0 0 0 0 1 1

Part D- Resources

182
 TEXT BOOKS:
1. A Text-Book of Psychologyby Edward Bradford Titchener.
2.The Social Animal by Elliot Aronson.

REFERENCE BOOKS:
1. Authentic Happiness by Martin Seligman
2. The Happiness Hypothesis by Jonathan Heidt
3. Influence: The Psychology Of Persuasion by Robert B. Cialdini

Jashore University of Science and Technology

Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Matrix and Vector

Part A- Introduction

I. Course code: MATH 2101

II. Credit: 2

1. Course Summary
This course covers vector and multi-variable calculus. Topics include vectors and matrices,
parametric curves, partial derivatives, double and triple integrals, and vector calculus in 2- and
3-space.

2. Course Objectives
Fluency with vector operations, including vector proofs and the ability to translate
1. back and forth among the various ways to describe geometric properties, namely, in
pictures, in words, in vector notation, and in coordinate notation.
Fluency with matrix algebra, including the ability to put systems of linear equation in
2.
matrix format and solve them using matrix multiplication and the matrix inverse.
An understanding of a parametric curve as a trajectory described by a position vector;
3. the ability to find parametric equations of a curve and to compute its velocity and
acceleration vectors.

3. Course Learning Outcomes

183
 CLO1. A comprehensive understanding of the gradient, including its relationship to
level curves (or surfaces), directional derivatives, and linear approximation.
CLO2. The ability to compute derivatives using the chain rule or total differentials.
CLO3. The ability to set up and solve optimization problems involving several
variables, with or without constraints.
CLO4. An understanding of line integrals for work and flux, surface integrals for flux,
general surface integrals and volume integrals. Also, an understanding of the physical
interpretation of these integrals.
CLO5. The ability to set up and compute multiple integrals in rectangular, polar,
cylindrical and spherical coordinates.
Part B- Lesson Plan

Course Details Learning plan

Timeline Topics /contents Learning Mapped Teaching Assessment

Outcomes CLOs Strategies Strategies

Part A: Vectors, Vectors, CLO1 Lecture Quiz

Determinants, and Determinants, Exercise Assignment
Planes and Planes Demonstration Practical Exam
Week 1
Week 2 » Session 1: Vectors
Week 3 » Session 2: Dot
Products
» Session 3: Uses of
the Dot Product:
Lengths and Angles
» Session 4: Vector
Components

» Session 5: Area and Vectors, CLO1 Lecture Quiz

Week 4 Determinants in 2D Determinants, Exercise Assignment
Week 5 » Session 6: Volumes and Planes Demonstration Practical Exam
Week 6 and Determinants in
Space
» Session 7: Cross
Products
» Session 8: Equations
of Planes

184
 Part B: Matrices and Matrices and CLO4 Lecture Quiz
Systems of Equations Systems of Exercise Assignment
Equations Demonstration Practical Exam
Week 7 » Session 9: Matrix
Week 8 Multiplication
» Session 10: Meaning
of Matrix
Multiplication

Week 9 » Session 11: Matrix Matrices and CLO4 Lecture Quiz

Week 10 Inverses Systems of Exercise Assignment
» Session 12: Equations Demonstration Practical Exam
Equations of Planes II
» Session 13: Linear
Systems and Planes
» Session 14: Solutions
to Square Systems

Part C: Parametric Parametric CLO3 Lecture Quiz

Equations for Curves Equations for Exercise Assignment
Week 11 Curves Demonstration Practical Exam
Week 12 » Session 15:
Equations of Lines
» Session 16:
Intersection of a Line
and a Plane
» Session 17: General
Parametric Equations;
the Cycloid

» Session 18: Point Parametric CLO2, Lecture Quiz

(Cusp) on Cycloid Equations for CLO5 Exercise Assignment
» Session 19: Velocity Curves Demonstration Practical Exam
and Acceleration
» Session 20: Velocity
Week 13 and Arc Length
Week 14 » Session 21: Kepler's
Second Law

Part C- Assessment and Evaluations

Assessment Procedures

Assessment Name Description

185
Quiz Quizzes are simple class tests with a duration from 20
minutes to 120 minutes. It can be online or offline, students
need to prepare for the quiz based on the instructed
syllabus.

Assignment Type of home work assessment, students are given specific

tasks and instructed to complete them within a given period
of time.

Practical Mostly related to laboratory works or by implementing in

real code in either exercise book or in programming IDE

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3hours exam for 72 marks. Students
need to answer at most 6 questions. Every question may
include sub questions

Mapping of CLOs to Assessment

Quiz Assignment Practical Final Quiz

(10%) (8%) (10%) (72%) (10%)

CLO1 1 1 1 1 1

CLO2 1 1 1 1 1

CLO3 1 1 1 1 1

CLO4 1 1 1 1 1

CLO5 1 1 1 1 1

Mapping of CLOs to PLOs

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 1 0 0 0 0 1 0 0 0

CLO2 0 1 0 0 0 0 1 0 0

CLO3 0 0 1 0 0 0 0 1 1

CLO4 0 0 0 1 0 0 0 1 0

CLO5 0 0 0 0 1 0 0 0 1

Part D- Resources

186
 01. Introduction to Matrices and Vectors
(Dover Books on Mathematics)
Paperback – November 24, 2011
by Jacob T. Schwartz

Jashore University of Science and Technology

Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Linear Algebra and Fourier Analysis

Part A- Introduction

III. Course code: MATH 2201

IV. Credit: 3

4. Course Summary
One of the main goals this course is to establish rules for the limiting behavior of functions so
that we can deal with functions with as much confidence as we do real or complex numbers.
An equally important motivation (that will only become clear in the second half) is that the
systematic study of Fourier series requires the Lebesgue integral. The square mean
convergence of Fourier series and Parseval's formula cannot be stated accurately in proper
generality without the Lebesgue integral and Lebesgue integrable functions.

5. Course Objectives
account for basic concept and theorems within the Linear Algebra and Fourier
1.
analysis;
2. demonstrate basic numeracy skill concerning the concepts in the previous point;
use the numeracy skill at the solution of mathematical and physical problems
3. formulated as ordinary or partial differential equations.

6. Course Learning Outcomes

Explain basic concepts of Matrices and their significance in engineering field.
CLO6. Understand and explain basic concepts of systems of linear equations.
CLO7. Learn determinant of a 2x2 Matrix, determinant of a 3x3 matrix.
CLO8. Understand and describe importance of Inverse in solving Linear Systems,
CLO9. Explain scalars and vectors, geometrical representation of Vectors

187
Part B- Lesson Plan
Course Details Learning plan
Timeline Topics /contents Learning Mappe Teaching Assessme
Outcomes d Strategies nt
CLOs Strategies

Matrices and their Significance, Matrix Matrices CLO1 Lecture Quiz

Notation, Dimension (Order) of a Exercise Assignme
Matrix, Addressing Elements of a Demonstra nt
Week 1 Matrix, Solving Linear Systems in 2 tion Practical
Week 2 Unknowns, Types of Matrices, Exam
Week 3 Addition and Subtraction of Matrices,
Multiplication of Scalars with
Matrices, Multiplication of two
Matrices

Systems of Linear Equations Preview, Linear CLO1 Lecture Quiz

Week 4 Elementary Row Operations, Row Equations Exercise Assignme
Week 5 Echelon Form (REF) Demonstra nt
Week 6 tion Practical
Determinant of a 2x2 Matrix, Exam
Determinant of a 3x3 Matrix, Finding
Determinants Quickly

Inverse exists only for Square

Matrices, Singular Matrices,
Importance of Inverse in solving Linear
Systems, Inverse of a 2x2 Matrix,
Inverse of a 3x3 Matrix - The Two
Methods

Scalars and Vectors, Geometrical Vector CLO4 Lecture Quiz

Representation of Vectors, Vector Spaces Exercise Assignme
Addition and Subtraction, Laws of Demonstra nt
Week 7 Vector Addition and Head to Tail Rule, tion Practical
Week 8 Unit Vector Exam

Introduction to Vector Spaces,

Euclidean Vector Spaces - Part 1,
Euclidean Vector Spaces - Part 2,
Euclidean Vector Spaces - Part 3,
Definition and Closure Properties,
Axioms of Vector Spaces,
Subspace and Null space.

188
Week 9 Fourier series, Fourier coefficients, Fourier CLO4 Lecture Quiz
Week 10 trigonometric polynomials and series Exercise Assignme
orthogonality. Demonstra nt
tion Practical
Exam

Properties of Fourier coefficients; Fourier CLO3 Lecture Quiz

Bessel's inequality, Parseval's identity coefficients Exercise Assignme
Week 11 and the Riemann-Lebesgue lemma. Demonstra nt
Week 12 tion Practical
Exam

Various notions of convergence of convergenc CLO2, Lecture Quiz

Fourier series, including pointwise, e of Fourier CLO5 Exercise Assignme
uniform and mean square convergence. series Demonstra nt
Summability methods, convolution and tion Practical
Young's inequality. Exam
Week 13 - Fourier Analysis in broader contexts;
Week 14 for example, Fourier integrals, Fourier
expansions in groups, Schwartz spaces
and tempered distributions.

Part C- Assessment and Evaluations

Assessment Procedures

Assessment Name Description

Quiz Quizzes are simple class tests with a duration from 20

minutes to 120 minutes. It can be online or offline, students
need to prepare for the quiz based on the instructed
syllabus.

Assignment Type of home work assessment, students are given specific

tasks and instructed to complete them within a given period
of time.

Practical Mostly related to laboratory works or by implementing in

real code in either exercise book or in programming IDE

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3hours exam for 72 marks. Students
need to answer at most 6 questions. Every question may
include sub questions

189
Mapping of CLOs to Assessment

Quiz Assignment Practical Final Quiz

(10%) (8%) (10%) (72%) (10%)

CLO1 1 1 1 1 1

CLO2 1 1 1 1 1

CLO3 1 1 1 1 1

CLO4 1 1 1 1 1

CLO5 1 1 1 1 1

Mapping of CLOs to PLOs

CLOs PLO10 PLO11 PLO12 PLO13 PLO14 PLO15 PLO16 PLO17 PLO18

CLO1 1 0 0 0 0 1 0 0 0

CLO2 0 1 0 0 0 0 1 0 0

CLO3 0 0 1 0 0 0 0 1 1

CLO4 0 0 0 1 0 0 0 1 0

CLO5 0 0 0 0 1 0 0 0 1

Part D- Resources
H. Anton and C.Rorres : Linear Algebra with Applications.
Brestscher : Linear Algebra with Applications.
Lipschutz, S. : Linear Algebra
Haward A. : Elementary Linear Algebra with Application
Haward A. : Contemporary Linear Algebra

190
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering
Course Outline: Operating System and System Programming

Part A- Introduction

I. Course code: CSE 3101

II. Credit: 3

1. Course Summary

Computer Engineers should be competent in Operating System. They must be able to apply the basic
concepts of operating system, various types of CPU scheduling algorithms, Deadlock problem and some
deadlock handling strategies, Paging, segmentation, fragmentation and file-management strategies.

2. Course Objectives

1. Identify the role of Operating System.

2. Understanding CPU Scheduling, Synchronization, Deadlock Handling and Comparing CPU
Scheduling Algorithms.
3. Solve Deadlock Detection Problems.
4. Describe the role of paging, segmentation and virtual memory in operating systems.
5. Description of protection and security and also the Comparison of UNIX and Windows based OS.
6. Defining I/O systems, Device Management Policies and Secondary Storage Structure and Evaluation
of various Disk Scheduling Algorithms.
7. Gather adequate knowledge in system programs (assemblers, loaders, linkers, macro-processors,
text editors, debuggers, interpreters, compilers, operating systems).

3. Course Learning Outcomes

CLO1. Learn about the basic knowledge about Operating System.

CLO2. Able to customize various system functions.
CLO3. Solve process allocation problems.
CLO4. Design and implement various scheduling algorithms.
CLO5. Understand and solve Deadlock Problems.
CLO6. Understand the role of paging, segmentation and virtual memory in operating system .
CLO7. Understand I/O systems, Device Management Policies and Secondary Storage Structure
CLO8. Learn adequate knowledge in system programs (assemblers, loaders, linkers, macro-
pocessors, text editors, debuggers,interpreters, compilers, operating systems).

191
 Part B- Lesson Plan

Timeline Topics /contents Learning Outcomes Mapped Teaching Assessme

CLOs Strategies nt
Strategies

Week 1 Introduction: Evolution, Learn about operating CLO1, Lecture Essay

Goals and Components of system types and services, CLO2 Short
OS, Types of OS. Operating Understand the goals of Question
System Services operating system

Week 2, Process management: Know different states of a CLO1, Lecture Quiz

3 Process states and state process, Understand CLO3 Assignme
transition, Process Control process control blocks, nt
Learn about process Essay
Blocks, Job and Process
scheduling, Learn about Short
scheduling, Process threads Question
Communication, Threads

Week 4, CPU Scheduling: Scheduling Understand CPU CLO1, Lecture Quiz

5 levels, Objectives and criteria, scheduling and its CLO4 Exercise Assignme
CPU scheduling algorithms, objectives, Learn and Demonstrati nt
design CPU scheduling on Essay
Algorithm Evaluation
algorithms, Compare and Short
analyze different CPU Question
scheduling algorithms

Week 6, Process Synchronization: Learn Process co- CLO1, Lecture Quiz

7 Process co-ordination, Critical ordination, Critical section CLO3 Exercise Essay
section problems, problems, Understand Short
Semaphores, Monitors, Semaphores , Know about Question
Classical problems of process Classical problems of
synchronization process synchronization

Week 8, Deadlock: System Model, Know about deadlock CLO1, Lecture Quiz
9 Deadlock Characterization, conditions, Understand CLO5 Exercise Essay
Methods for Handling methods for handling Short
deadlock, Learn recovery Question
Deadlocks, Deadlock
from deadlock and
prevention, avoidance, and prevention of deadlock
detection, Recovery form
deadlock, Deadlock handling.

Week 10 Memory management: Illustrate the memory CLO1, Lecture Assignme

management scheme with CLO6 Exercise nt

192
 Logical and Physical Address and without swapping, Essay
Space, Swapping, Memory Discuss various types of Short
allocation schemes, Paging page replacement Question
algorithm
and Segmentation,
Segmentation with Paging

Week 11 Virtual memory: Demand CLO1, Lecture Assignme

Understand demand CLO6 Exercise nt
paging, Performance of
paging, Learn page Essay
Demand Paging, Page replacement algorithm,
replacement algorithms, Short
Know allocation process
Question
Allocation of frames, of frames, Know about
Demand Segmentation demand segmentation

Week 12 Secondary storage CLO1, Lecture Assignme

management: Disk structure; CLO7 Exercise nt
Understand disk structure Essay
Disk scheduling, Disk
and management, Know Short
management, Swap-space about swap space Question
management, Disk reliability, management, Learn about
Stable storage implementation disk reliability

Week 13 File-System: File and Learn aboutfile and CLO1, Lecture Assignme
Directory concept, File directory concept, CLO7 Exercise nt
system structure, Allocation Understand file structure Demonstrati Essay
and allocation method on Short
method, Free space
Question
Management, Directory
Implementation.

Week 14 Assemblers, loaders, Learn adequate CLO1, Lecture Assignme

linkers, macro-processors, knowledge in system CLO8 Exercise nt
text editors, debuggers, programs (assemblers, Demonstrati Essay
interpreters, compilers, loaders, linkers, macro- on Short
operating systems processors, text editors, Question
debuggers, interpreters,
compilers, operating
systems).

193
Course Details Learning plan

Part C- Assessment and Evaluations

Assessment Procedures

Assessment Name Description

Quiz, Short questions and Essay These are simple class tests with duration from 10 minutes to 90
minutes. It can be online or offline, students need to prepare for
the quiz based on the instructed syllabus.

Assignment Type of homework assessment, students are given specific tasks

and instructed to complete them within a given period of time.

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3hours exam for 72 marks. Students need
to answer at most 6 questions. Every question may include sub
questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Test Assignment Quizzes External Participation
Marks (out of 20) (10) (5) (5) in Curricular/Co-
Curricular Activities
Remember 2 1 0
Understand 5 1 1
Apply 3 1 1 8
Analyze 2 1 1
Evaluate 4 1 1
Create 4 0 1

SEE-Semester End Examination (72 Marks)

Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

194
Mapping of CLOs to PLOs

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 1 1 0 0 0 0 0 1 0

CLO2 1 1 0 0 0 0 0 1 1

CLO3 1 1 0 0 0 0 0 1 1

CLO4 1 1 0 0 0 0 0 1 1

CLO5 1 1 0 0 0 0 0 1 1

CLO6 1 1 0 0 0 0 0 1 1

CLO7 1 1 0 0 0 0 0 1 1

CLO8 1 1 0 0 0 0 0 1 1

Part D- Resources

Textbooks
1. Operating System Concepts by J. Peterson, A. Silberschatz, and P. Galvin.
2. Introduction to Operating System by William Stalling.
3. Modern Operating Systems by Tanenbaum, Andrew S.

Jashore University of Science and Technology

Faculty of Science and Engineering
Department of Computer Science and Engineering
Course Outline: Operating System and System Programming Lab

Part A- Introduction
I. Course code: CSE 3102

II. Credit: 1.5

195
 1. Course Summary

Computer Engineers should be competent in Operating System. They must be able to apply the basic
concepts of operating system, various types of CPU scheduling algorithms, Deadlock problem and some
deadlock handling strategies, Paging, segmentation, fragmentation and file-management strategies.

2. Course Objectives

1. Identify the role of the Operating System.

2. Understanding CPU Scheduling, Synchronization, Deadlock Handling and Comparing CPU
Scheduling Algorithms.
3. Solve Deadlock Detection Problems.
4. Describe the role of paging, segmentation and virtual memory in operating systems.
5. Description of protection and security and also the Comparison of UNIX and Windows based OS.
6. Defining I/O systems, Device Management Policies and Secondary Storage Structure and Evaluation
of various Disk Scheduling Algorithms.
7. Gather adequate knowledge in system programs (assemblers, loaders, linkers, macro-processors,
text editors, debuggers, interpreters, compilers, operating systems).

3. Course Learning Outcomes

CLO1. Apply the basic knowledge about Operating System.

CLO2. Implement various system functions.
CLO3. Solve process allocation problems.
CLO4. Develop various scheduling algorithms.
CLO5. Solve Deadlock Problems.
CLO6. Understand the role of paging, segmentation and virtual memory in operating system .
CLO7. Understand I/O systems, Device Management Policies and Secondary Storage Structure
CLO8. Learn adequate knowledge in system programs (assemblers, loaders, linkers, macro-
processors, text editors, debuggers, interpreters, compilers, operating systems).

Part B- Lesson Plan

Course Details Learning plan
Timelin Topics /contents Learning Outcomes Mapped Teaching Assessme
e CLOs Strategies nt
Strategies

Week 1 Introduction: Evolution, Learn about operating CLO1, Lecture Essay

Goals and Components of system types and services, CLO2 Short
OS, Types of OS. Operating Understand the goals of Question
System Services operating system

196
Week Process management: Know different states of a CLO1, Lecture Quiz
2, 3 Process states and state process, Understand CLO3 Assignme
transition, Process Control process control blocks, nt
Learn about process Essay
Blocks, Job and Process
scheduling, Learn about Short
scheduling, Process threads Question
Communication, Threads

Week CPU Scheduling: Understand CPU CLO1, Lecture Quiz

4, 5 Scheduling levels, scheduling and its CLO4 Exercise Assignme
Objectives and criteria, CPU objectives, Learn and Demonstr nt
design CPU scheduling ation Essay
scheduling algorithms,
algorithms, Compare and Short
Algorithm Evaluation analyze different CPU Question
scheduling algorithms

Week Process Synchronization: Learn Process co- CLO1, Lecture Quiz

6, 7 Process co-ordination, ordination, Critical section CLO3 Exercise Essay
Critical section problems, problems, Understand Short
Semaphores, Monitors, Semaphores , Know about Question
Classical problems of Classical problems of
process synchronization process synchronization

Week Deadlock: System Model, Know about deadlock CLO1, Lecture Quiz
8, 9 Deadlock Characterization, conditions, Understand CLO5 Exercise Essay
Methods for Handling methods for handling Short
deadlock, Learn recovery Question
Deadlocks, Deadlock
from deadlock and
prevention, avoidance, and prevention of deadlock
detection, Recovery form
deadlock, Deadlock
handling.

Week Memory management: Illustrate the memory CLO1, Lecture Assignme

10 Logical and Physical management scheme with CLO6 Exercise nt
Address Space, Swapping, and without swapping, Essay
Discuss various types of Short
Memory allocation schemes,
page replacement Question
Paging and Segmentation, algorithm
Segmentation with Paging

Week Virtual memory: Demand Understand demand CLO1, Lecture Assignme

11 paging, Performance of paging, Learn page CLO6 Exercise nt
Demand Paging, Page replacement algorithm, Essay
Know allocation process

197
 replacement algorithms, of frames, Know about Short
Allocation of frames, demand segmentation Question
Demand Segmentation

Week Secondary storage CLO1, Lecture Assignme

12 management: Disk CLO7 Exercise nt
structure; Disk scheduling, Understand disk structure Essay
Disk management, Swap- and management, Know Short
about swap space Question
space management, Disk
reliability, Stable storage management, Learn about
disk reliability
implementation

Week File-System: File and Learn aboutfile and CLO1, Lecture Assignme
13 Directory concept, File directory concept, CLO7 Exercise nt
system structure, Allocation Understand file structure Demonstr Essay
and allocation method ation Short
method, Free space
Question
Management, Directory
Implementation.

Week Assemblers, loaders, Learn adequate CLO1, Lecture Assignme

14 linkers, macro-processors, knowledge in system CLO8 Exercise nt
text editors, debuggers, programs (assemblers, Demonstr EssayShor
interpreters, compilers, loaders, linkers, macro- ation t Question
operating systems processors, text editors,
debuggers, interpreters,
compilers, operating
systems).

Part C- Assessment and Evaluations

Assessment Procedures

Assessment Name Description

Quiz, Short questions and Essay These are simple class tests with duration from 10 minutes to 90
minutes. It can be online or offline, students need to prepare for the
quiz based on the instructed syllabus.

Assignment Type of homework assessment, students are given specific tasks

and instructed to complete them within a given period of time.

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3hours exam for 72 marks. Students need to

198
 answer at most 6 questions. Every question may include sub
questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Test Assignment Quizzes External Participation
Marks (out of 20) (10) (5) (5) in Curricular/Co-
Curricular Activities
Remember 2 1 0
Understand 5 1 1
Apply 3 1 1 8
Analyze 2 1 1
Evaluate 4 1 1
Create 4 0 1

SEE-Semester End Examination (72 Marks)

Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

Mapping of CLOs to PLOs

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 1 1 0 0 0 0 0 1 0

CLO2 1 1 0 0 0 0 0 1 1

CLO3 1 1 0 0 0 0 0 1 1

CLO4 1 1 0 0 0 0 0 1 1

CLO5 1 1 0 0 0 0 0 1 1

CLO6 1 1 0 0 0 0 0 1 1

199
CLO7 1 1 0 0 0 0 0 1 1

CLO8 1 1 0 0 0 0 0 1 1

Part D- Resources

Textbooks
1. Operating System Concepts by J. Peterson, A. Silberschatz, and P. Galvin.
2. Introduction to Operating System by William Stalling.
3. Modern Operating Systems by Tanenbaum, Andrew S.

Jashore University of Science and Technology

Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Computer Networks and IoT

Part A- Introduction
I. Course code: CSE 3103

II. Credit: 3

1. Course Summary

This course introduces some basic concepts, protocols, techniques, models etc. used in
computer networking. A computer science engineer needs to know the network model,
different networking protocols and their formats, transmission medium and technique used in
digital communication system to fulfill his Computer Science degree.

2. Course Objectives

1. Understand and develop modern network architectures from a design and performance perspective
2. To clarify network terminology.
3. To provide an opportunity to do network programming using TCP/IP.
4. To expose students to emerging technologies and their potential impact.
5. To introduce Internet of Things (IoT) and its protocols.

3. Course Learning Outcomes

CLO1. Learn the basic concepts of networking system

CLO2. Able to understand various protocols used in computer networking

200
 CLO3. Enable to design new networking system
CLO4. Calculate the effectiveness and performance of a network system
CLO5. Troubleshoot problems in networking systems
CLO6. Learn and understand about IoT and its protocols

Part B- Lesson Plan

Course Details Learning plan

Timeline Topics /contents Learning Outcomes Mappe Teaching Assessment

d CLOs Strategies Strategies

Week 1 Wireless Network Illustrate network applications, CLO1, Lecture Essay

concepts: frequency reuse, Identify channel allocation CLO2 Discussio Assignment
handoff strategies, system problem, Discuss multiple access n Short
capacity, improving protocols, Illustrate WLAN, Question
capacity and coverage; Ethernet, broadband, Bluetooth
Wireless LAN technology, Compare broadband
Technology; Ethernet, and narrowband, Demonstrate data
wireless LAN, broadband link layer switching,
wireless.

Week 2, IPv4 address, IPv6 Identify IP Address, Discuss and CLO1, Lecture Quiz
3, 4 address, Classfull and understand Classfull and classless CLO2, Exercise Assignment
classless address, address, Illustrate subnetting and CLO3, Demonstr Essay
subnetting and supernetting concept, Design new CLO5 ation Short
supernetting, NAT networking system Question

Week 5, network layer design Examine network layer design CLO1, Lecture Quiz
6 issues, routing algorithms, issues, Analyze routing and CLO2, Discussio Assignment
congestion control congestion control algorithms, CLO4 n Essay
algorithms, quality of Characterize QoS, Implement Short
service, internetworking, Internetworking, Discuss the Question
the network layer in the network layer in the internet
internet

Week 7, The transport layer List out transport layer services, CLO1, Lecture Quiz
8 services, elements of Name elements of transport CLO2, Discussio Essay
transport protocols, a protocols, llustrate SMTP, UDP CLO3 n Short
simple transport protocol, and TCP, Differentiate UDP and Question
the internet transport TCP
protocols: UDP, TCP.

Week 9, DNS-domain name List application layer activities, CLO1, Lecture Quiz
10 system, electronic mail, Understand and discuss E-mail, CLO2, Discussio Essay
the world wide web, Discuss WWW and multimedia, CLO5 n Short
multimedia, Functions, Define Network management Question

201
 protocols, Manager and systems and its function and its
agent, management role
components

Week 11, Cryptography, plaintext, Define cryptography and security; CLO1, Lecture Assignment
12 cipher text, differentiate between symmetric CLO2, Discussio Essay
cipher,symmetric and and asymmetric key cryptography, CLO3, n Short
asymmetric key, ceaser Traditional and modern ciphers, CLO5 Question
cipher, substitution, man in the middle attack concept,
transposition, XOR, shift, security services, Hash function,
modern round cipher, digital signature.
DES, triple DES, RSA
algorithm, DiffieHelman
algorithm, man in the
middle attack, security
services, message and
digest, Hash function, role
of KDC, key management
and digital signature

Week 13, Introduction to Internet of Describe what IoT is and how it CLO3, Lecture Assignment
14 Things (IoT), IoT works today, Discuss IoT CLO6 Discussio Essay
protocols, Importance of protocols, Design and program IoT n Short
IoT devices, Know the importance of Question
IoT

Part C- Assessment and Evaluations

Assessment Procedures
Assessment Name Description

Quiz, Short questions and Essay These are simple class tests with duration from 10 minutes to 90
minutes. It can be online or offline, students need to prepare for
the quiz based on the instructed syllabus.

Assignment Type of homework assessment, students are given specific tasks

and instructed to complete them within a given period of time.

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3hours exam for 72 marks. Students need
to answer at most 6 questions. Every question may include sub
questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):
Bloom’s Category Test Assignment Quizzes External Participation in
Marks (out of 20) (10) (5) (5) Curricular/Co-Curricular
Activities
Remember 2 1 0

202
Understand 5 1 1
Apply 3 1 1 8
Analyze 2 1 1
Evaluate 4 1 1
Create 4 0 1

SEE-Semester End Examination (72 Marks)

Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

Mapping of CLOs to PLOs

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 1 1 0 0 0 0 0 1 0

CLO2 1 1 0 0 0 0 0 1 1

CLO3 1 1 0 0 0 0 0 1 1

CLO4 1 1 0 0 0 0 0 1 1

CLO5 1 1 0 0 0 0 0 1 1

CLO6 1 1 0 0 0 0 0 1 1

Part D- Resources

Textbooks
1. Data Communications and networking by Behrouz A. Forouzan.
2. Data and Computer Communication by William Stallings.
3. “The Internet of Things” by Samuel Greengard

203
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Computer NetworksLab

Part A- Introduction
III. Course code: CSE 3104

IV. Credit: 1.5

Course Summary

This course is designed to impart knowledge about detailed knowledge of Computer Networks,
various protocols used in Communication, Managing and configuring Cisco Switches and
Routers, and various WAN technologies.

Course Objectives

1. Explain network technologies and how devices access local and remote
networks.
2. Describe router hardware.
3. Explain how switching operates in a small to a medium-sized business network.
4. Design an IPv4 and IPv6 addressing scheme to provide network connectivity for
a small to a medium-sized business network.
5.Configure initial settings on a network device using the Cisco command-line interface (CLI)
6. Implement basic network connectivity between devices.

Course Learning Outcomes

CLO1Demonstrate a broad knowledge of the area of computer networking and its terminology
CLO2Design, implement and test the operation of a basic computer network
CLO3Demonstrate an understanding of the operation of a range of networking protocols and
devices
CLO4Able to create a network for a small organization

Part B- Lesson Plan

Course Details Learning plan

204
Timeline Topics /contents Learning Outcomes Mapped Teaching Assessment
CLOs Strategies Strategies

Week 1 Introduction of the Demonstrate basic CLO1, Lecture Essay

simulator, networking knowledge on the CLO2 Discussion Assignment
devices, and cabling. simulator, networking Short
devices, and cabling. Question

Week 2,  Different topology  Design, implement, CLO1, Lecture Quiz

3, 4 configuration with and test the operation CLO2, Exercise Assignment
multiple networks using of a basic computer CLO3, Demonstra Essay
basic routing command. network topology. tion Short
 Introduction of Routing  Demonstrate an Question
protocols and Configure understanding of the
static routing. operation of the Static
Routing Protocol.

Week 5, Design, Configuration, and Demonstrate an CLO1, Lecture Quiz

6 Implementation of Dynamic understanding of the CLO2, Discussion Assignment
Routing (RIP). operation of the Dynamic CLO4 Essay
Routing Protocol (RIP). Short
Question

Week 7, Design, Configuration, and Demonstrate an CLO1, Lecture Quiz

8 Implementation of Dynamic understanding of the CLO2, Discussion Essay
Routing (EIGRP) operation of the Dynamic CLO3 Short
Routing Protocol Question
(EIGRP).

Week 9, Design, Configuration, and Demonstrate an CLO1, Lecture Quiz

10 Implementation of Dynamic understanding of the CLO2, Discussion Essay
Routing (OSPF). operation of the Dynamic CLO5 Short
Routing Protocol (OSPF). Question

Week 11, Design, Configuration, and Demonstrate an CLO1, Lecture Assignment

12 Implementation of Dynamic understanding of the CLO2, Discussion Essay
Host Configuration operation of DHCP. CLO3, Short
Protocol (DHCP). CLO5 Question

Week 13, Design, Configuration, and CLO3, Lecture Assignment

14 Implementation of Virtual Demonstrate an CLO6 Discussion Essay
Local Area Network understanding of the
operation of VLAN. Short
(VLAN). Question

Part C- Assessment and Evaluations

Assessment Procedures

Assessment Name Description

205
Quiz, Short questions and Essay These are simple class tests with duration from 10 minutes to 90
minutes. It can be online or offline, students need to prepare for
the quiz based on the instructed syllabus.

Assignment Type of homework assessment, students are given specific tasks

and instructed to complete them within a given period of time.

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3hours exam for 72 marks. Students need
to answer at most 6 questions. Every question may include sub
questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Test Assignment Quizzes External Participation
Marks (out of 20) (10) (5) (5) in Curricular/Co-
Curricular Activities
Remember 2 1 0
Understand 5 1 1
Apply 3 1 1 8
Analyze 2 1 1
Evaluate 4 1 1
Create 4 0 1

SEE-Semester End Examination (72 Marks)

Bloom’s Category Test

Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

Mapping of CLOs to PLOs

CLOs PLO10 PLO11 PLO12 PLO13 PLO14 PLO15 PLO16 PLO17 PLO18

CLO1 1 1 0 0 0 0 0 1 0

CLO2 1 1 0 0 0 0 0 1 1

206
CLO3 1 1 0 0 0 0 0 1 1

CLO4 1 1 0 0 0 0 0 1 1

Part D- Resources

Textbook

Cisco CCNA Study Guide v2.71, Aaron Balchunas

Reference Books

1. CCNA, Study Guide, 6th Edition, TodLammle

2. Cisco website (www.cisco.com) for technical data sheets of devices.

Jashore University of Science and Technology

Faculty of Science and Engineering
Department of Computer Science and Engineering
Course Outline: Microprocessors and Embedded System

Part A- Introduction

I.Course code: CSE 3105

II.Credit: 3

1.Course Summary

Microprocessors and Microcontrollers course is intended to introduce the architecture,

programming of microprocessors and interfacing various hardware circuits to
microprocessors. The topics covered are architecture, addressing modes, instruction set of
8086, minimum and maximum mode operation of 8086, 8086 INSTRUCTION SET,
Assembly language programming fundamentals, interfacing of static Ram, EPROM, DMA
Controller, keyboard, display, stepper motor, A/D and D/A converter, data
transmission,8251 USART, 8259 interrupt controller, data transmission, 8251 USART,
modes of timer operation of 8051, programming of Real time control by using basic
microcontroller, This course analyze the complete architectural, programming, interfacing
details of 8086 microprocessor-8051 microcontroller.

207
 2.Course Objectives

1.To develop an in-depth understanding of the operation of microprocessors.

2.To master the assembly language programming using concepts like assembler
directives, procedures, macros, software interrupts etc.

3.To create an exposure to basic peripherals, its programming and interfacing techniques

4.To learn the activities of I/O devices with respect to CPU.

5.To acquire knowledge about microcontroller based system design.

3.Course Learning Outcomes

CLO1.Understand the architecture and program module of microprocessors and

microcontrollers.

CLO2. Analyze Intel 8085/8086 architecture with explanation of internal organization

of some popular microprocessors/microcontrollers, addressing modes, coprocessors.

CLO3.Apply knowledge and demonstrate programming proficiency using the various

addressing modes and data transfer instructions of the target microprocessor and
microcontroller

CLO4.Interface different external peripheral devices with microprocessors and

microcontrollers.

CLO5.Develop an assembly language program for specified applications

Part B- Lesson Plan

Course Details Learning plan

Timeline Topics Learning Outcomes Mapped Teaching Assessme

/contents CLOs Strategies nt

208
 Strategies

Week 1 ,2 Introduction -Students will learn overview CLO1 Lecture Quiz

and overview of microprocessors, number
of system
microprocessor
s -Introduction to assembly
language, brief concept of
compiler, assembler, linker and
debugger

-Evolution of
computers
-ROM and RAM families
- Bus structure

-students will learn CPU Lecture, Quiz,

Week 3, 4 Microcompute modules and architecture, Bus CLO2 Exercise Assignme
r Structure configuration, CPU registers. Demonstra nt,
-Interrupt and Interrupt tion Exam
Handling.

- Read, Write operation, DMA

-Introduction to 8085 Lecture, Quiz,

Week 5, 6 8085 and 8086 Architecture, Timing Diagram, CLO2, Exercise Assignme
microprocessor Instruction Formats. CLO4 Demonstra nt
-Introduction to 8086 tion Exam
Architecture, registers, pin
diagram, physical address.
-Instruction Formats,
Instruction Set, Assembler
Directives, Interrupts of 8086.
-Features, Signals, I/O &
Memory Interfacing

209
 Memory addressing technique Lecture, Quiz,
Week 7 Addressing of 8086, CLO2 Exercise Assignme
modes, -learn the examples of Demonstra nt,
Coprocessors addressing modes. tion Exam
-8087 coprocessor structure

-students will learn the basics Lecture, Quiz,

Week 8, 9 Introduction to of the assembly language CLO3 Exercise Assignme
assembly program. Demonstra nt,
language and -Branching structure. tion Exam
machine -Learn about jump, CMP, if-
then.
language
programming -allocate assignment for the
course.

-understand how looping Lecture, Quiz,

Week 10 Assembly structures work. CLO3 Exercise Assignme
language, -analyze SHIFT and ROTATE Demonstra nt,
Stacks, instructions. tion Exam
Procedures. -understand the process of
shifting and rotating.

-Hardware features, Lecture, Quiz,

Week 11, 8051 Architecture, Internal RAM CLO4, Exercise Assignme
12 microcontrolle structure. CLO5 Demonstra nt,
r architecture -Special Function Registers, tion Exam
Memory Organization, I/O
Ports and Circuits.
-Timers, Interrupts, Serial
Communication, Interfacing of
External Memory.
-interfacing LCD & Keyboard,
Real Time Clock.

-Understand Addressing Lecture, Quiz,

Week 13, 8051 Modes, Instruction Set of 8051, CLO4, Exercise Assignme
14 programming, Assembly Language CLO5 Demonstra nt,
Peripheral Programming and C tion Exam
devices. Programming, -A/D & D/A
Interface;
-USART (8251), Interrupt
Controller (8259) Keyboard
and Display Controller.

210
Part C- Assessment and Evaluations

Assessment Procedures

Assessment Name Description

Quiz Quizzes are simple class tests with a duration from 20 minutes to 120
minutes. It can be online or offline, students need to prepare for the
quiz based on the instructed syllabus.

Assignment Type of home work assessment, students are given specific tasks and
instructed to complete them within a given period of time.

Attendance Student’s participation in the class lecture, quiz and exam.

Exam Each course contains a final exam considering the complete syllabus. It
should be a 3hours exam for 72 marks. Students need to answer at most
6 questions. Every question may include sub questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Test Assignment Quizzes External Participation
Marks (out of 20) (10) (5) (5) in Curricular/Co-
Curricular Activities
Remember 2 1 0
Understand 5 1 1
Apply 3 1 1
Analyze 2 1 1
Evaluate 4 1 1
Create 4 0 1

SEE-Semester End Examination (72 Marks)

211
 Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

Mapping of CLOs to PLOs

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 1 1 1 0 0 0 0 1 0

CLO2 1 1 1 0 0 0 0 1 1

CLO3 1 1 1 0 0 0 0 1 1

CLO4 1 1 1 0 0 0 0 1 1

CLO5 1 1 1 0 0 0 0 1 1

Part D- Resources

Textbooks

1. M. Rafiquzzaman,"Microprocessors: Theory and Applications: Intel and Motorola",

Revised ed., Prentice Hall, 1992 .
2. Ytha Yu, Charles Marut,”Assembly Language Programming and organization of IBM
PC” Mc.Graw Hill International Edition.
3. D. V. Hall: “Microprocessors and Interfacing: Hardware and Software”.

Reference Books

1. D. E. Knuth: “The Art of Computer Programming”, Vol. 1, Fundamental Algorithms.

2. Kenneth. J.Ayala.“The 8051 microcontroller”, 3rd edition,Cengage learning,2010.
3. N. Senthil Kumar, M. Saravanan and Jeevananthan (Oxford university press),
“Microprocessors and microcontrollers”
4. B.Ram, Dhanpat Rai Publications, “Fundamentals of Microprocessors and
Microcontrollers”

212
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Microprocessors and Embedded System Lab

Part A- Introduction

I.Course code: CSE 3106

II.Credit: 1.5

1.Course Summary

Microprocessors and Microcontrollers course is intended to introduce the architecture,

programming of microprocessors and interfacing various hardware circuits to
microprocessors. The topics covered are architecture, addressing modes, instruction set of
8086, minimum and maximum mode operation of 8086, 8086 INSTRUCTION SET,
Assembly language programming fundamentals, interfacing of static Ram, EPROM, DMA
Controller, keyboard, display, stepper motor, A/D and D/A converter, data
transmission,8251 USART, 8259 interrupt controller, data transmission, 8251 USART,
modes of timer operation of 8051, programming of Real time control by using basic
microcontroller, This course analyze the complete architectural, programming, interfacing
details of 8086 microprocessor-8051 microcontroller.

2.Course Objectives

1.To develop an in-depth understanding of the operation of microprocessors.

2.To master the assembly language programming using concepts like assembler
directives, procedures, macros, software interrupts etc.

3.To create an exposure to basic peripherals, its programming and interfacing techniques

4.To learn the activities of I/O devices with respect to CPU.

5.To acquire knowledge about microcontroller based system design.

213
 3.Course Learning Outcomes

CLO1.Understand the architecture and program module of microprocessors and

microcontrollers.

CLO2. Analyze Intel 8085/8086 architecture with explanation of internal organization

of some popular microprocessors/microcontrollers, addressing modes, coprocessors.

CLO3.Apply knowledge and demonstrate programming proficiency using the various

addressing modes and data transfer instructions of the target microprocessor and
microcontroller

CLO4.Interface different external peripheral devices with microprocessors and

microcontrollers.

CLO5.Develop and implement an assembly language program for specified

applications

Part B- Lesson Plan

Course Details Learning plan

Timeline Topics Learning Outcomes Mapped Teaching Assessme

/contents CLOs Strategies nt
Strategies

214
Week 1 ,2 Introduction -Students will learn overview of CLO1 Lecture Quiz
and overview microprocessors, number system
of
microprocess -Introduction to assembly
ors language, brief concept of
compiler, assembler, linker and
debugger

-Evolution of
computers
-ROM and RAM families
- Bus structure
-students will learn CPU modules Lecture, Quiz,
Week 3, 4 Microcomput and architecture, Bus CLO2 Exercise Assignme
er Structure configuration, CPU registers. Demonstra nt,
-Interrupt and Interrupt Handling. tion Exam

- Read, Write operation, DMA

-Introduction to 8085 Architecture, Lecture, Quiz,

Week 5, 6 8085 and Timing Diagram, Instruction CLO2, Exercise Assignme
8086 Formats. CLO4 Demonstra nt
microprocess -Introduction to 8086 Architecture, tion Exam
or registers, pin diagram, physical
address.
-Instruction Formats, Instruction
Set, Assembler Directives,
Interrupts of 8086.
-Features, Signals, I/O & Memory
Interfacing
Memory addressing technique of Lecture, Quiz,
Week 7 Addressing 8086, CLO2 Exercise Assignme
modes, -learn the examples of addressing Demonstra nt,
Coprocessors modes. tion Exam
-8087 coprocessor structure

215
 -students will learn the basics of Lecture, Quiz,
Week 8, 9 Introduction the assembly language program. CLO3 Exercise Assignme
to assembly -Branching structure. Demonstra nt,
language and -Learn about jump, CMP, if-then. tion Exam
machine
-allocate assignment for the
language course.
programming

-understand how looping structures Lecture, Quiz,

Week 10 Assembly work. CLO3 Exercise Assignme
language, -analyze SHIFT and ROTATE Demonstra nt,
Stacks, instructions. tion Exam
Procedures. -understand the process of shifting
and rotating.

-Hardware features, Architecture, Lecture, Quiz,

Week 11, 8051 Internal RAM structure. CLO4, Exercise Assignme
12 microcontroll -Special Function Registers, CLO5 Demonstra nt,
er architecture Memory Organization, I/O Ports tion Exam
and Circuits.
-Timers, Interrupts, Serial
Communication, Interfacing of
External Memory.
-interfacing LCD & Keyboard,
Real Time Clock.
-Understand Addressing Modes, Lecture, Quiz,
Week 13, 8051 Instruction Set of 8051, Assembly CLO4, Exercise Assignme
14 programming, Language Programming and C CLO5 Demonstra nt,
Peripheral Programming, -A/D & D/A tion Exam
devices. Interface;
-USART (8251), Interrupt
Controller (8259) Keyboard and
Display Controller.

Part C- Assessment and Evaluations

Assessment Procedures

Assessment Description

216
Name

Quiz Quizzes are simple class tests with a duration from 20 minutes to 120
minutes. It can be online or offline, students need to prepare for the quiz
based on the instructed syllabus.

Assignment Type of home work assessment, students are given specific tasks and
instructed to complete them within a given period of time.

Attendance Student’s participation in the class lecture, quiz and exam.

Exam Each course contains a final exam considering the complete syllabus. It
should be a 3hours exam for 72 marks. Students need to answer at most 6
questions. Every question may include sub questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Test Assignment Quizzes External Participation
Marks (out of 20) (10) (5) (5) in Curricular/Co-
Curricular Activities
Remember 2 1 0
Understand 5 1 1
Apply 3 1 1 8
Analyze 2 1 1
Evaluate 4 1 1
Create 4 0 1

SEE-Semester End Examination (72 Marks)

Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10

217
 Evaluate 10
Create 12

Mapping of CLOs to PLOs

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 1 1 1 0 0 0 0 1 0

CLO2 1 1 1 0 0 0 0 1 1

CLO3 1 1 1 0 0 0 0 1 1

CLO4 1 1 1 0 0 0 0 1 1

CLO5 1 1 1 0 0 0 0 1 1

Part D- Resources

Textbooks

1. M. Rafiquzzaman,"Microprocessors: Theory and Applications: Intel and Motorola",

Revised ed., Prentice Hall, 1992 .
2. Ytha Yu, Charles Marut,”Assembly Language Programming and organization of IBM
PC” Mc.Graw Hill International Edition.
3. D. V. Hall: “Microprocessors and Interfacing: Hardware and Software”.

Reference Books

1. D. E. Knuth: “The Art of Computer Programming”, Vol. 1, Fundamental Algorithms.

2. Kenneth. J.Ayala.“The 8051 microcontroller”, 3rd edition,Cengage learning,2010.
3. N. Senthil Kumar, M. Saravanan and Jeevananthan (Oxford university press),
“Microprocessors and microcontrollers”
4. B.Ram, Dhanpat Rai Publications, “Fundamentals of Microprocessors and
Microcontrollers”

Jashore University of Science and Technology

Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: System Analysis and Design

Part A- Introduction

218
 I. Course code: CSE3107

II. Credit: 3

1. Course Summary
They will learn about techniques to analyze a system and how the standard
engineering development cycle is implemented in each of the SDLCs traced from
requirements to solution specification to design and planning to construction and
project management. The issues of operational maintenance, change management
and system requirements are also examined in each SDLC. In order to do that they
will learn about modelling methods, documentation styles, requirements
representation and design approaches. The underlying ideas of each of these are
examined to provide students with both an ability to choose the approach that is most
appropriate for new projects, manage development process, preparing migration plan
and to understand how to work with modernization of legacy systems. The course
includes theory classes along with compulsory 3-hour laboratory work each week.
This lab will introduce students with modern techniques and tools used to design a
software system and hands on experience of system analysis and design.

2. Course Objectives

1. Introduce Students with fundamental concepts of System analysis and design

2. Teach students about structural model of the system
3. Teach behavioral models of the system.
4. Explain how to make a physical model of the system.
5. Teach students about managing programming process and documentation
6. Help students to build a system using proper and modern tools

3. Course Learning Outcomes

CLO1. Explain the fundamental concepts of System analysis and design.

CLO2. Design software model of the system i.e. structural, behavioral, physical
CLO3. Analyze migration plan
CLO4. Select and apply modern software design tools to develop a project.

Part B- Lesson Plan

219
 Course Details Learning plan

Timeli Topics /contents Learning Mapped Teaching Assessment

ne Outcomes CLOs Strategies Strategies

Week 1 Introduction to elements of Learn SDLC CLO 1 Lecture, Quiz

system analysis and design, steps basics Demonstration, Participation
of software development life handouts Exam
cycle.

Week 2 Identifying the business value of Calculate CLO 1 Lecture, Quiz

,3 the new project, preparing system business value handouts Participation
request, analyze three types of Exam
feasibility study

Week Major components of behavioral Design UMLs CLO 2 Lecture, Quiz

4, 5, 6 UML diagrams such as Use case, Demonstration, Participation
Activity and sequence. Notations handouts Exam
of these diagrams, how to draw
these diagrams from
requirements.

Week Major components of structural Develop DFD CLO 2 Lecture, Quiz

7, 8 UML diagram such as Data flow Demonstration, Participation
diagram. Notations of these handouts Exam
diagrams, how to draw these
diagrams from requirements.

Week Convert logical to physical Develop CLO 2 Lecture, Quiz

9, 10 process models, Designing Physical DFD Demonstration, Participation
programs, Structure chart and handouts Exam
Program specification.

Week Moving from logical to physical Organise data CLO 3 Lecture, Quiz
11, 12 data models, Different data storage Demonstration Participation
storage formats and Optimizing Exam
data storage.

Week Principles of user interface Define UI CL03 CLO Lecture, Quiz

13 design, User interface design 4 Demonstration, Participation
process, Navigation design, Input handouts Exam
design and Output design.

Week Managing the programming Plan testing CLO 4 Lecture, Quiz

14 process, Developing and delivery Demonstration Participation
documentation, Mitigation plan Exam
and post implementation
activities.

Part C- Assessment and Evaluations

221
Assessment Procedures

Assessment Name Description

Participation Attendance and participate in the class discussion

Quiz Quizzes are simple class tests with a duration from 20 minutes to 120
minutes. It can be online or offline, students need to prepare for the quiz
based on the instructed syllabus.

Exam Each course contains a final exam considering the complete syllabus. It
should be a 3hours exam for 72 marks. Students need to answer at most 6
questions. Every question may include sub questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Test Assignment Quizzes External Participation
Marks (out of 20) (10) (5) (5) in Curricular/Co-
Curricular Activities
Remember 2 1 0
Understand 5 1 1
Apply 3 1 1
Analyze 2 1 1
Evaluate 4 1 1
Create 4 0 1

SEE-Semester End Examination (72 Marks)

Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

222
Mapping of CLOs to PLOs

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 1 0 0 0 0 0 0 0 0

CLO2 1 1 1 0 1 0 0 0 1

CLO3 1 1 1 0 1 0 0 0 1

CLO4 1 1 0 0 0 0 0 0 1

Part D- Resources

Textbooks
1. Systems Analysis and Design BY Jeffrey Whitten and Lonnie Bentley
2. Systems Analysis and Design BY Dennis, Wixom and Roth

Jashore University of Science and Technology

Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: System Analysis and Design Lab

Part A- Introduction

I. Course code: CSE3108

II. Credit: 1.5

1. Course Summary
They will learn about techniques to analyze a system and how the standard
engineering development cycle is implemented in each of the SDLCs traced from
requirements to solution specification to design and planning to construction and
project management. The issues of operational maintenance, change management
and system requirements are also examined in each SDLC. In order to do that they
will learn about modelling methods, documentation styles, requirements

223
 representation and design approaches. The underlying ideas of each of these are
examined to provide students with both an ability to choose the approach that is most
appropriate for new projects, manage development process, preparing migration plan
and to understand how to work with modernization of legacy systems. The course
includes theory classes along with compulsory 3-hour laboratory work each week.
This lab will introduce students with modern techniques and tools used to design a
software system and hands on experience of system analysis and design.

2. Course Objectives

1. Introduce Students with fundamental concepts of System analysis and design

2. Teach students about structural model of the system
3. Teach behavioral models of the system.
4. Explain how to make a physical model of the system.
5. Teach students about managing programming process and documentation
6. Help students to build a system using proper and modern tools

3. Course Learning Outcomes

CLO1. Apply the fundamental concepts of System analysis and design.

CLO2. Design software model of the system i.e. structural, behavioral, physical
CLO3. Analyze migration plan
CLO4. Apply modern software design tools to develop a project.

Part B- Lesson Plan

Course Details Learning plan

Timelin Topics /contents Learning Mapped Teaching Assessment

e Outcomes CLOs Strategies Strategies

Week 1 Introduction to elements of Learn SDLC CLO 1 Lecture, Quiz

system analysis and design, steps basics Demonstration, Participation
of software development life handouts Exam
cycle.

Week 2 Identifying the business value of Calculate CLO 1 Lecture, Quiz

,3 the new project, preparing system business value handouts Participation

224
 request, analyze three types of Exam
feasibility study

Week 4, Major components of behavioral Design UMLs CLO 2 Lecture, Quiz

5, 6 UML diagrams such as Use case, Demonstration, Participation
Activity and sequence. Notations handouts Exam
of these diagrams, how to draw
these diagrams from
requirements.

Week 7, Major components of structural Develop DFD CLO 2 Lecture, Quiz

8 UML diagram such as Data flow Demonstration, Participation
diagram. Notations of these handouts Exam
diagrams, how to draw these
diagrams from requirements.

Week 9, Convert logical to physical Develop CLO 2 Lecture, Quiz

10 process models, Designing Physical DFD Demonstration, Participation
programs, Structure chart and handouts Exam
Program specification.

Week Moving from logical to physical Organise data CLO 3 Lecture, Quiz
11, 12 data models, Different data storage Demonstration Participation
storage formats and Optimizing Exam
data storage.

Week 13 Principles of user interface Define UI CL03 CLO Lecture, Quiz

design, User interface design 4 Demonstration, Participation
process, Navigation design, Input handouts Exam
design and Output design.

Week 14 Managing the programming Plan testing and CLO 4 Lecture, Quiz
process, Developing delivery Demonstration Participation
documentation, Mitigation plan Exam
and post implementation
activities.

Part C- Assessment and Evaluations

Assessment Procedures

Assessment Description
Name

Participation Attendance and participate in the class discussion

Quiz Quizzes are simple class tests with a duration from 20 minutes to 120 minutes. It can be
online or offline, students need to prepare for the quiz based on the instructed syllabus.

225
Exam Each course contains a final exam considering the complete syllabus. It should be a
3hours exam for 72 marks. Students need to answer at most 6 questions. Every question
may include sub questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Test Assignment Quizzes External Participation in
Marks (out of 20) (10) (5) (5) Curricular/Co-Curricular
Activities
Remember 2 1 0
Understand 5 1 1
Apply 3 1 1 8
Analyze 2 1 1
Evaluate 4 1 1
Create 4 0 1

SEE-Semester End Examination (72 Marks)

Bloom’s Category Test

Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

Mapping of CLOs to PLOs

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 1 0 0 0 0 0 0 0 0

CLO2 1 1 1 0 1 0 0 0 1

CLO3 1 1 1 0 1 0 0 0 1

CLO4 1 1 0 0 0 0 0 0 1

226
 Part D- Resources

Textbooks
1. Systems Analysis and Design BY Jeffrey Whitten and Lonnie Bentley
2. Systems Analysis and Design BY Dennis, Wixom and Roth

Jashore University of Science and Technology

Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Software Development Project-II

Part A- Introduction

I. Course code: CSE 3208

II. Credit: 1.5

1 Course Summary
Computer Engineers should be competent in Web programming through scripting Language This HTML,
CSS, JavaScript, Joomla 2.5 and WordPress, PHP,MySql .It is valuable to both beginners and advanced
developers that already have experience in developing web applications.

2 Course Objectives

1 Demonstrate understanding of (X) HTML (5)+CSS programming.

2 Create and compile advanced dynamic web projects using client – Jquery (Javascript) and
server – PHP technology.
3 Demonstrate understanding of database applications with MySQL.
4 Show understanding of the logic behind advanced web applications.
5 Demonstrate an understanding of Content Management System.

3 Course Learning Outcomes

CLO1: Become familiar with the operation of a sophisticated computer system, including high- performance
peripheral interfaces, extensive signal processing and graphics software.
CLO2: Be familiar with the different types of interrupt structures.
CLO3: Be able to select appropriate and compatible computer/peripherals combinations.
CLO4: Have a working knowledge of digital communication interface adapters.
CLO5: Be able to interface a microcontroller to various devices.

227
 Part B- Lesson Plan

Course Details Learning plan

Timeline Topics /contents Learning Mapped Teaching Assessment

Outcomes CLOs Strategies Strategies

Week 1 HTML, Creating a HTML page, To Apply CLO1 Lecture Quiz

Week 2 HTML Tags, Paragraph & Text html Exercise Assignment
Week 3 Demonstrat Practical
Formatting, Lists, Horizontal Ruling Knowledge
lines, HTML Color, Background ion Exam
Color, Specifying Font Information,
Formatting Tags, HTML
Hyperlinks, HTML Table & Data
Alignment Options, Table Cell
Spacing & Padding, Changing Table
Height & Width of Table, Elements
Links Anchor Tag, HTML pre tag
HTML Form Overview HTML
Frames, Create Interactive Button
List Background Using Images
Make menu Button Using HTML
code & Image HTML bdo tag
HTML span tag Marquee Tag

Week 4 CSS, Introduction to CSS, External CLO2 Lecture Quiz

Week 5 Style Sheet, Internal Style Sheet Exercise Assignment
Week 6 Demonstrat Practical
Inline Style, Multiple Style Sheet,
Div Concept, Div ID, Div Class, ion Exam
Keywords, Float, Padding, Margin
The letter-spacing Property, The To Apply
word-spacing Property, Text Align HTML
Property, Line Height Property, Knowledge
Background-URL, Background-
Position, Background-Repeat, Table
Captions, Table Columns, Other
Table Style, Background-Gradient
Color, Horizontal Menu Design

228
 PSD to HTML Convert

Week 7 Introduction to Java Scripting, To Apply CLO3, Lecture Quiz

Week 8 Client and Server side scripting, CSS CLO4 Exercise Assignment
Week 9 Knowledge Demonstrat Practical
Week 10 JavaScript inserted into HTML
pages, can be executed by all ion Exam
modern web browsers, JavaScript is
easy to learn, JavaScript Slide
Customization, Form Validation,
Basic Function

Week 11 Getting Started with jQuery, To Apply CLO3, Lecture Quiz

Week 12 Accessing HTML Elements, jwuery CLO4 Exercise Assignment
Week 13 Demonstrat Practical
Week 14 Selecting HTML Elements, Knowledge
Attributes, and Positions, Managing ion Exam
Events, Hide-and-Seek with Web
Page Elements, Sliding and Fading
Web Page Elements, Animating
Web Page Elements, Making Web
Page Content Dynamic,
Understanding Plug-ins.

Part C- Assessment and Evaluations

Assessment Procedures
Assessment Name Description

Quiz Quizzes are simple class tests with a duration from 20 minutes to
120 minutes. It can be online or offline, students need to prepare
for the quiz based on the instructed syllabus.

Assignment Type of home work assessment, students are given specific tasks
and instructed to complete them within a given period of time.

Practical Mostly related to laboratory works or by implementing in real

code in either exercise book or in programming IDE

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3hours exam for 72 marks. Students need
to answer at most 6 questions. Every question may include sub
questions

Mapping of CLOs to Assessment

229
CIE- Continuous Internal Evaluation (28 Marks):
Bloom’s Category Test Assignment Quizzes External Participation
Marks (out of 20) (10) (5) (5) in Curricular/Co-
Curricular Activities
Remember 2 1 0
Understand 5 1 1
Apply 3 1 1
Analyze 2 1 1
Evaluate 4 1 1
Create 4 0 1

SEE-Semester End Examination (72 Marks)

Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

Mapping of CLOs to PLOs

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 1 0 0 0 0 1 0 0 0

CLO2 0 1 0 0 0 0 1 0 0

CLO3 0 0 1 0 0 0 0 1 1

CLO4 0 0 0 1 0 0 0 1 0

CLO5 0 0 0 0 1 0 0 0 1

Part D- Resources
Textbooks
W3school.com
On line tutorial

228
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Artificial Intelligence and Machine Learning

Part A- Introduction
I. Course code: CSE3201

II. Credit: 3

1. Course Summary

To build automated systems and modern IT solutions we need to include artificial intelligence
so that it can interact dynamically facilitating customers or optimize the number of employees
needed. So every computer science graduate needs sound knowledge in artificial intelligence.

2. Course Objectives

1. To understand intelligent agents and environments.

2. To understand and implement informed and uninformed search algorithms.
3. To understand neural networks.
4. To acquire proper knowledge in reasoning.

3. Course Learning Outcomes

CLO1. Examine the basic idea of Artificial Intelligence and Machine learning
CLO2. Define intelligent agents
CLO3. Illustrate different search techniques
CLO4. Interpret Knowledge based reasoning and expert systems
CLO5. Apply logic programming

Part B- Lesson Plan

Course Details Learning plan

Timeline Topics /contents Learning Outcomes Mapped Teaching Assessment

CLOs Strategies Strategies

229
Week 1 Introduction: Introduction Describe AI, agent and CLO1, CLO2 Lecture, Quiz
to AI and intelligent agents. environments Exercise, Assignment
Handouts Exam

Week 2, 3 Problem Solving: Solving Solve advanced CLO1, CLO2 Lecture, Quiz
Problems by Searching, searching problems Exercise Assignment
Search Strategies, Heuristic Exam
search techniques, Game
Playing

Week 4, 5 Knowledge and Reasoning: Produce reasoning CLO2, CLO3 Lecture, Quiz
Building a Knowledge Exercise, Assignment
Base Agent, Propositional Handouts Exam
logic, First order logic,
Inference in First order
Logic.

Week 6 Logic Programming: Logic Examine logical CLO5 Lecture, Quiz

programming using programming Exercise, Assignment
PROLOG, LISP Handouts Exam

Week 7,8 Logical Action: Planning, Elaborate logical CLO5 Lecture, Quiz
partial order planning, actions Exercise, Assignment
Knowledge Engineering Handouts Exam
for Planning, Conditional
Planning, A Replanning
Agent.

Week 9 Uncertain Knowledge and Discover knowledge CLO4 Lecture Quiz

Reasoning: Uncertainty, Exercise Assignment
Probabilistic Reasoning Exam
Systems, Fuzzy Logic,
Making Simple Decisions

Week 10, Knowledge Acquisition: Apply new knowledge CLO4 Lecture, Quiz
11, 12 Overview of different Exercise, Assignment
forms of learning, Learning Handouts Exam
Decision Trees, Neural
Networks, Genetic
Algorithms, Intelligent
Editors, Introduction to
Natural Language
Processing

Week 13, Selected topics in AI: CLO3, CLO4 Lecture Quiz

14 Expert consultation, Exercise Assignment
Development of Expert Exam
Learn expert system
Systems, Pattern
recognition, Computer
vision, Robotics

230
Part C- Assessment and Evaluations
Assessment Procedures

Assessment Name Description

Quiz Quizzes are simple class tests with a duration from 20 minutes to 120 minutes. It
can be online or offline, students need to prepare for the quiz based on the
instructed syllabus.

Assignment Type of home work assessment, students are given specific tasks and instructed to
complete them within a given period of time.

Exam Each course contains a final exam considering the complete syllabus. It should be
a 3hours exam for 72 marks. Students need to answer at most 6 questions. Every
question may include sub questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Test Assignment Quizzes External Participation

Marks (out of 20) (10) (5) (5) in Curricular/Co-
Curricular Activities
Remember 2 1 0
Understand 5 1 1
Apply 3 1 1
Analyze 2 1 1
Evaluate 4 1 1
Create 4 0 1

SEE-Semester End Examination (72 Marks)

Bloom’s Category Test

Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

Mapping of CLOs to PLOs

231
CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 1 0 0 0 0 0 0 0 0

CLO2 1 1 0 0 0 0 0 0 0

CLO3 1 0 0 0 0 0 0 1 0

CLO4 1 1 0 0 0 0 0 1 0

CLO5 1 1 0 0 0 0 0 0 0

Part D- Resources

Textbooks
1. Artificial Intelligence: A Modern Approach by Peter Norvig and Stuart Russel

Jashore University of Science and Technology

Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Artificial Intelligence and Machine Learning Lab

Part A- Introduction
III. Course code: CSE3202

IV. Credit: 3

4. Course Summary

To build automated systems and modern IT solutions we need to include artificial intelligence
so that it can interact dynamically facilitating customers or optimize the number of employees
needed. So every computer science graduate needs sound knowledge in artificial intelligence.

5. Course Objectives

5. To understand intelligent agents and environments.

6. To understand and implement informed and uninformed search algorithms.
7. To understand neural networks.
8. To acquire proper knowledge in reasoning.

6. Course Learning Outcomes

232
 CLO6. Examine the basic idea of Artificial Intelligence and Machine learning
CLO7. Define intelligent agents
CLO8. Illustrate different search techniques
CLO9. Interpret Knowledge based reasoning and expert systems
CLO10. Apply logic programming

Part B- Lesson Plan

Course Details Learning plan

Timeline Topics /contents Learning Outcomes Mapped Teaching Assessment

CLOs Strategies Strategies

Week 1 Introduction: Introduction Describe AI, agent and CLO1, Lecture, Quiz
to AI and intelligent agents. environments CLO2 Exercise, Assignment
Handouts Exam

Week 2, Problem Solving: Solving Solve advanced searching CLO1, Lecture, Quiz
3 Problems by Searching, problems CLO2 Exercise Assignment
Search Strategies, Heuristic Exam
search techniques, Game
Playing

Week 4, Knowledge and Reasoning: Produce reasoning CLO2, Lecture, Quiz

5 Building a Knowledge Base CLO3 Exercise, Assignment
Agent, Propositional logic, Handouts Exam
First order logic, Inference
in First order Logic.

Week 6 Logic Programming: Logic Examine logical CLO5 Lecture, Quiz

programming using programming Exercise, Assignment
PROLOG, LISP Handouts Exam

Week 7,8 Logical Action: Planning, Elaborate logical actions CLO5 Lecture, Quiz
partial order planning, Exercise, Assignment
Knowledge Engineering for Handouts Exam
Planning, Conditional
Planning, A Replanning
Agent.

Week 9 Uncertain Knowledge and Discover knowledge CLO4 Lecture Quiz

Reasoning: Uncertainty, Exercise Assignment
Probabilistic Reasoning Exam
Systems, Fuzzy Logic,
Making Simple Decisions

233
Week Knowledge Acquisition: Apply new knowledge CLO4 Lecture, Quiz
10, 11, 12 Overview of different forms Exercise, Assignment
of learning, Learning Handouts Exam
Decision Trees, Neural
Networks, Genetic
Algorithms, Intelligent
Editors, Introduction to
Natural Language
Processing

Week 13, Selected topics in AI: CLO3, Lecture Quiz

14 Expert consultation, CLO4 Exercise Assignment
Development of Expert Exam
Learn expert system
Systems, Pattern
recognition, Computer
vision, Robotics
Part C- Assessment and Evaluations

Assessment Procedures

Assessment Name Description

Quiz Quizzes are simple class tests with a duration from 20 minutes to 120 minutes. It
can be online or offline, students need to prepare for the quiz based on the
instructed syllabus.

Assignment Type of home work assessment, students are given specific tasks and instructed to
complete them within a given period of time.

Exam Each course contains a final exam considering the complete syllabus. It should be
a 3hours exam for 72 marks. Students need to answer at most 6 questions. Every
question may include sub questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Test Assignment Quizzes External Participation

Marks (out of 20) (10) (5) (5) in Curricular/Co-
Curricular Activities
Remember 2 1 0
Understand 5 1 1
Apply 3 1 1
Analyze 2 1 1
Evaluate 4 1 1

234
 Create 4 0 1

SEE-Semester End Examination (72 Marks)

Bloom’s Category Test

Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

Mapping of CLOs to PLOs

CLOs PLO10 PLO11 PLO12 PLO13 PLO14 PLO15 PLO16 PLO17 PLO18

CLO1 1 0 0 0 0 0 0 0 0

CLO2 1 1 0 0 0 0 0 0 0

CLO3 1 0 0 0 0 0 0 1 0

CLO4 1 1 0 0 0 0 0 1 0

CLO5 1 1 0 0 0 0 0 0 0

Part D- Resources

Textbooks
2. Artificial Intelligence: A Modern Approach by Peter Norvig and Stuart Russe

Jashore University of Science and Technology

Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Compiler Design and Automata Theory

Part A- Introduction
I. Course code: CSE 3203

II. Credit: 3

235
 1. Course Summary
Computer Engineers should be competent in compiler design and automata theory. They must learn
the fundamental concepts of compiler design and automata theory and also various phases in the
design of a compiler, how to generate a machine code from a C program statement.

2. Course Objectives

1.To design a LEX compiler

2.To construct a DFA from the NFA
3.To design an NFA for the corresponding regular expressions.

3. Course Learning Outcomes

CLO1. Basic knowledge of compilation steps; ability to apply automata theory and
knowledge on formal languages.
CLO2. Ability to design and implement scanner modules in compilers.
CLO3. Ability to identify and select suitable parsing strategies for a compiler for
various cases. Knowledge in alternative methods (top-down or bottom-up etc).
CLO4. Knowledge and ability to devise, select, and use modern techniques and tools
needed to design and implement compilers.

Part B- Lesson Plan

Course Details Learning plan

Timeline Topics /contents Learning Outcomes Mapped Teaching Assessment
CLOs Strategies Strategies

Week 1 Introduction: Explain Phases of a CLO1 Lecture Quiz

Week 2 Phases of a compiler compiler Exercise Assignment
Week 3 (lexical analyzer, syntax Explain intermediate Demonstration Practical
analyzer, semantic code generator
Exam
analyzer, intermediate Overview of compilers
code generator, code
optimizer, code generator,
symbol-table manager &
error handler), overview
of C, C++, Java, C#
compilers.

236
Week 4 Lexical analysis: Construct NFA from CLO2 Lecture Quiz
Week 5 Role, finite automata, Regular Expression Exercise Assignment
Week 6 from regular expression to Design DFA from NFA Demonstration Practical
NFA, from NFA to DFA. Design of a lexical
Exam
analyzer generator using
LEX

Week 7 Syntax analysis: Classify different types CLO3, Lecture Quiz

Week 8 Role, CFG, writing a of parsing CLO4 Exercise Assignment
grammar, top-down Design different types of Demonstration Practical
parsing, bottom-up grammar
Exam
parsing, operator
precedence parsing, LR
parser, using ambiguous
grammar. Symbol table,
structure and management.

Week 9 Intermediate code Explain different types CLO3, Lecture Quiz

Week 10 generation: of intermediate code CLO4 Exercise Assignment
Intermediate languages, generation Demonstration Practical
declarations, assignment
Exam
statement, Boolean
expression, case
statements, back patching,
procedure calls.

Week 11 Code generation: Discuss the several CLO3, Lecture Quiz

Week 12 Issues in the design of a issues in the design of a CLO4 Exercise Assignment
code generator, target code generator Demonstration Practical
machine, runtime storage Draw a basic block &
Exam
management, basic blocks corresponding flow
and flow graphs, register graphs for the given
allocation and assignment, three-address statements
dag representation of basic
blocks, peephole
optimizations, generating
code from dags.

Week 13 Code optimization: Role of the code CLO3, Lecture Quiz

Week 14 principle of source optimization in compiler CLO4 Exercise Assignment
optimization, optimization design Demonstration Practical
of basic blocks, loop in
Exam
flow graphs, global data
flow analysis, iterative
solution of data flow
equations.

Part C- Assessment and Evaluations

237
 Assessment Procedures

Assessment Name Description

Quiz Quizzes are simple class tests with a duration from 20 minutes to
120 minutes. It can be online or offline, students need to prepare
for the quiz based on the instructed syllabus.

Assignment Type of home work assessment, students are given specific tasks
and instructed to complete them within a given period of time.

Practical Mostly related to laboratory works or by implementing in real

code in either exercise book or in programming IDE

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3hours exam for 72 marks. Students need
to answer at most 6 questions. Every question may include sub
questions
Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Test Assignment Quizzes External Participation
Marks (out of 20) (10) (5) (5) in Curricular/Co-
Curricular Activities
Remember 2 1 0
Understand 5 1 1
Apply 3 1 1
Analyze 2 1 1
Evaluate 4 1 1
Create 4 0 1

SEE-Semester End Examination (72 Marks)

Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

Mapping of CLOs to PLOs

238
CLOs PLO10 PLO11 PLO12 PLO13 PLO14 PLO15 PLO16 PLO17 PLO18

CLO1 1 0 0 0 0 1 0 0 0

CLO2 0 1 0 0 0 0 1 0 0

CLO3 0 0 1 0 0 0 0 1 1

CLO4 0 0 0 1 0 0 0 1 0

CLO5 0 0 0 0 1 0 0 0 1

Part D- Resources

Textbooks
1. Compilers Principles, Techniques and tools. Third edition by Alfred V.Aho, Ravi Sethi, Jeffrey
D.Ullman
2. Introduction to Automata Theory, Languages and Computation by Hopcroft and Ullman
Reference Books
1. Compiler Design Theory by Lewis and Stern

Jashore University of Science and Technology

Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Compiler Design and Automata Theory Lab

Part A- Introduction
III. Course code: CSE 3204

IV. Credit: 3

4. Course Summary
Computer Engineers should be competent in compiler design and automata theory. They must learn
the fundamental concepts of compiler design and automata theory and also various phases in the
design of a compiler, how to generate a machine code from a C program statement.

5. Course Objectives

239
 1.To design a LEX compiler
2.To construct a DFA from the NFA
3.To design an NFA for the corresponding regular expressions.

6. Course Learning Outcomes

CLO5. Basic knowledge of compilation steps; ability to apply automata theory and
knowledge on formal languages.
CLO6. Ability to design and implement scanner modules in compilers.
CLO7. Ability to identify and select suitable parsing strategies for a compiler for
various cases. Knowledge in alternative methods (top-down or bottom-up etc).
CLO8. Knowledge and ability to devise, select, and use modern techniques and tools
needed to design and implement compilers.
Part B- Lesson Plan
Course Details Learning plan

Timeli Topics /contents Learning Outcomes Mapped Teaching Assessment

ne CLOs Strategies Strategies

Week Introduction: Explain Phases of a CLO1 Lecture Quiz

1 Phases of a compiler compiler Exercise Assignment
Week (lexical analyzer, syntax Explain intermediate Demonstration Practical
2 analyzer, semantic analyzer, code generator Exam
Week intermediate code generator, Overview of compilers
3 code optimizer, code
generator, symbol-table
manager & error handler),
overview of C, C++, Java, C#
compilers.

Week Lexical analysis: Construct NFA from CLO2 Lecture Quiz

4 Role, finite automata, from Regular Expression Exercise Assignment
Week regular expression to NFA, Design DFA from NFA Demonstration Practical
5 from NFA to DFA. Design of a lexical Exam
Week analyzer generator
6 using LEX

Week Syntax analysis: Classify different types CLO3, Lecture Quiz

7 Role, CFG, writing a of parsing CLO4 Exercise Assignment
Week grammar, top-down parsing, Design different types Demonstration Practical
8 bottom-up parsing, operator of grammar Exam
precedence parsing, LR
parser, using ambiguous
grammar. Symbol table,

240
 structure and management.

Week Intermediate code Explain different types CLO3, Lecture Quiz

9 generation: of intermediate code CLO4 Exercise Assignment
Week Intermediate languages, generation Demonstration Practical
10 declarations, assignment Exam
statement, Boolean
expression, case statements,
back patching, procedure
calls.

Week Code generation: Discuss the several CLO3, Lecture Quiz

11 Issues in the design of a code issues in the design of a CLO4 Exercise Assignment
Week generator, target machine, code generator Demonstration Practical
12 runtime storage management, Draw a basic block & Exam
basic blocks and flow graphs, corresponding flow
register allocation and graphs for the given
assignment, dag three-address
representation of basic blocks, statements
peephole optimizations,
generating code from dags.

Week Code optimization: Role of the code CLO3, Lecture Quiz

13 principle of source optimization in CLO4 Exercise Assignment
Week optimization, optimization of compiler design Demonstration Practical
14 basic blocks, loop in flow Exam
graphs, global data flow
analysis, iterative solution of
data flow equations.

Part C- Assessment and Evaluations

Assessment Procedures

Assessment Description
Name

Quiz Quizzes are simple class tests with a duration from 20 minutes to 120 minutes. It can be
online or offline, students need to prepare for the quiz based on the instructed syllabus.

Assignment Type of home work assessment, students are given specific tasks and instructed to
complete them within a given period of time.

241
Practical Mostly related to laboratory works or by implementing in real code in either exercise
book or in programming IDE

Exam Each course contains a final exam considering the complete syllabus. It should be a
3hours exam for 72 marks. Students need to answer at most 6 questions. Every question
may include sub questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Test Assignment Quizzes External Participation
Marks (out of 20) (10) (5) (5) in Curricular/Co-
Curricular Activities
Remember 2 1 0
Understand 5 1 1
Apply 3 1 1
Analyze 2 1 1
Evaluate 4 1 1
Create 4 0 1

SEE-Semester End Examination (72 Marks)

Bloom’s Category Test

Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

Mapping of CLOs to PLOs

CLOs PLO19 PLO20 PLO21 PLO22 PLO23 PLO24 PLO25 PLO26 PLO27

CLO1 1 0 0 0 0 1 0 0 0

CLO2 0 1 0 0 0 0 1 0 0

CLO3 0 0 1 0 0 0 0 1 1

242
CLO4 0 0 0 1 0 0 0 1 0

CLO5 0 0 0 0 1 0 0 0 1

Part D- Resources

Textbooks
3. Compilers Principles, Techniques and tools. Third edition by Alfred V.Aho, Ravi Sethi, Jeffrey
D.Ullman
4. Introduction to Automata Theory, Languages and Computation by Hopcroft and Ullman
Reference Books
2. Compiler Design Theory by Lewis and Stern

Jashore University of Science and Technology

Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Peripherals, Interfacing and IoT

Part A- Introduction
III. Course code: CSE 3205

IV. Credit: 3

4 Course Summary
A computer engineer must have adequate practical knowledge of the various methods and
techniques used to interconnect peripheral devices to computers.

5 Course Objectives

1. To understand the principles used in interfacing devices to computers and will gain a practical
understanding of how those principles are put to use by manufacturers.
2. To assign I/O addresses, IRQs, DMA channels, and other I/O related parameters in installing
real equipment.

6 Course Learning Outcomes

CLO1: Become familiar with the operation of a sophisticated computer system, including high- performance
peripheral interfaces, extensive signal processing and graphics software.

243
 CLO2: Be familiar with the different types of interrupt structures.
CLO3: Be able to select appropriate and compatible computer/peripherals combinations.
CLO4: Have a working knowledge of digital communication interface adapters.
CLO5: Be able to interface a microcontroller to various devices.

Part B- Lesson Plan

Course Details Learning plan

Timeline Topics /contents Learning Mapped Teaching Assessment

Outcomes CLOs Strategies Strategies

Week 1 Design and operation of Design and CLO1 Lecture Quiz

Week 2 interface between computer explain the Exercise Assignment
Week 3 and the outside world interface between Demonstration Practical Exam
computer and the
outside world

Week 4 Sensors, transducers ad signal CLO2 Lecture Quiz

Week 5 conditioning circuits, Exercise Assignment
Week 6 Demonstration Practical Exam
interfacing memory and I/O
Relate the
devices-such as monitors,
operation of
printers, disc drives, optical
various devices to
displays, some special interfacing
purpose interface cards,
stepper motors and peripheral
devices.

Week 7 Define and CLO3, Lecture Quiz

Week 8 explain IEEE- CLO4 Exercise Assignment
Week 9 IEEE-488, RS-232 and other 488, RS-232 and Demonstration Practical Exam
Week 10 buses. other buses

Week 11 Study and applications of Examine various CLO3, Lecture Quiz

Week 12 peripheral chips including peripheral chips CLO4 Exercise Assignment
Week 13 8212, 8155, 8255, 8251, Demonstration Practical Exam
Week 14 DMA controllers.

Part C- Assessment and Evaluations

244
 Assessment Procedures
Assessment Name Description

Quiz Quizzes are simple class tests with a duration from 20 minutes to
120 minutes. It can be online or offline, students need to prepare
for the quiz based on the instructed syllabus.

Assignment Type of home work assessment, students are given specific tasks
and instructed to complete them within a given period of time.

Practical Mostly related to laboratory works or by implementing in real

code in either exercise book or in programming IDE

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3hours exam for 72 marks. Students need
to answer at most 6 questions. Every question may include sub
questions
Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Test Assignment Quizzes External Participation
Marks (out of 20) (10) (5) (5) in Curricular/Co-
Curricular Activities
Remember 2 1 0
Understand 5 1 1
Apply 3 1 1
Analyze 2 1 1
Evaluate 4 1 1
Create 4 0 1

SEE-Semester End Examination (72 Marks)

Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12
Mapping of CLOs to PLOs
CLOs PLO28 PLO29 PLO30 PLO31 PLO32 PLO33 PLO34 PLO35 PLO36

CLO1 1 0 0 0 0 1 0 0 0

245
CLO2 0 1 0 0 0 0 1 0 0

CLO3 0 0 1 0 0 0 0 1 1

CLO4 0 0 0 1 0 0 0 1 0

CLO5 0 0 0 0 1 0 0 0 1

Part D- Resources
Textbooks
JyotiSnehi Computer Peripherals and Interfacing
Amit Karma Computer Peripherals and Interfacing
Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Peripherals, Interfacing and IoT LAB

Part A- Introduction
V. Course code: CSE 3206

VI. Credit: 3

7 Course Summary
A computer engineer must have adequate practical knowledge of the various methods and
techniques used to interconnect peripheral devices to computers.

8 Course Objectives

1. To understand the principles used in interfacing devices to computers and will gain a practical
understanding of how those principles are put to use by manufacturers.
2. To assign I/O addresses, IRQs, DMA channels, and other I/O related parameters in installing
real equipment.

9 Course Learning Outcomes

CLO1: Become familiar with the operation of a sophisticated computer system, including high- performance
peripheral interfaces, extensive signal processing and graphics software.
CLO2: Be familiar with the different types of interrupt structures.
CLO3: Be able to select appropriate and compatible computer/peripherals combinations.
CLO4: Have a working knowledge of digital communication interface adapters.

246
 CLO5: Be able to interface a microcontroller to various devices.

Part B- Lesson Plan

Course Details Learning plan

Timeline Topics /contents Learning Mapped Teaching Assessment

Outcomes CLOs Strategies Strategies

Week 1 Design and operation of Design and CLO1 Lecture Quiz

Week 2 interface between computer explain the Exercise Assignment
Week 3 and the outside world interface Demonstration Practical Exam
between
computer and
the outside
world

Week 4 Sensors, transducers ad signal CLO2 Lecture Quiz

Week 5 conditioning circuits, Exercise Assignment
Week 6 Demonstration Practical Exam
interfacing memory and I/O
Relate the
devices-such as monitors,
operation of
printers, disc drives, optical
various devices
displays, some special to interfacing
purpose interface cards,
stepper motors and peripheral
devices.

Week 7 Define and CLO3, Lecture Quiz

Week 8 explain IEEE- CLO4 Exercise Assignment
Week 9 IEEE-488, RS-232 and other 488, RS-232 Demonstration Practical Exam
Week 10 buses. and other
buses

Week 11 Study and applications of Examine CLO3, Lecture Quiz

Week 12 peripheral chips including various CLO4 Exercise Assignment
Week 13 8212, 8155, 8255, 8251, peripheral Demonstration Practical Exam
Week 14 DMA controllers. chips

Part C- Assessment and Evaluations

Assessment Procedures

247
Assessment Name Description

Quiz Quizzes are simple class tests with a duration from 20 minutes to 120
minutes. It can be online or offline, students need to prepare for the
quiz based on the instructed syllabus.

Assignment Type of home work assessment, students are given specific tasks and
instructed to complete them within a given period of time.

Practical Mostly related to laboratory works or by implementing in real code

in either exercise book or in programming IDE

Exam Each course contains a final exam considering the complete syllabus.
It should be a 3hours exam for 72 marks. Students need to answer at
most 6 questions. Every question may include sub questions
Mapping of CLOs to Assessment
CIE- Continuous Internal Evaluation (28 Marks):
Bloom’s Category Test Assignment Quizzes External Participation
Marks (out of 20) (10) (5) (5) in Curricular/Co-
Curricular Activities
Remember 2 1 0
Understand 5 1 1
Apply 3 1 1
Analyze 2 1 1
Evaluate 4 1 1
Create 4 0 1
SEE-Semester End Examination (72 Marks)
Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12
Mapping of CLOs to PLOs
CLOs PLO37 PLO38 PLO39 PLO40 PLO41 PLO42 PLO43 PLO44 PLO45

CLO1 1 0 0 0 0 1 0 0 0

CLO2 0 1 0 0 0 0 1 0 0

CLO3 0 0 1 0 0 0 0 1 1

248
 CLO4 0 0 0 1 0 0 0 1 0

CLO5 0 0 0 0 1 0 0 0 1

Part D- Resources

Textbooks
JyotiSnehi Computer Peripherals and Interfacing
Amit Karma Computer Peripherals and Interfacing

Jashore University of Science and Technology

Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Software Development Project-II

Part A- Introduction
VII. Course code: CSE 3208

VIII. Credit: 1.5

10 Course Summary
Computer Engineers should be competent in web application software through different web oriented
language. This C#.net /ASP.net/Java Programming Knowledge is valuable to both beginners and advanced
developers that already have experience in developing applications software.

11 Course Objectives

1. Create and populate Windows Forms.

12 Course Learning Outcomes

CLO1: Become familiar with the operation of a sophisticated computer system, including high- performance
peripheral interfaces, extensive signal processing and graphics software.
CLO2: Be familiar with the different types of interrupt structures.
CLO3: Be able to select appropriate and compatible computer/peripherals combinations.
CLO4: Have a working knowledge of digital communication interface adapters.
CLO5: Be able to interface a microcontroller to various devices.

249
 Part B- Lesson Plan
Course Details Learning plan
Timelin Topics /contents Learning Mappe Teaching Assessment
e Outcomes d Strategies Strategies
CLOs

Week 1 C# .NET Language Basics Data To Apply CLO1 Lecture Quiz

Week 2 Types, Type Conversion, Boxing & OOP Exercise Assignment
Week 3 Unboxing, Conditional Statements, Knowledg Demonstration Practical Exam
Looping, Methods in C#, Properties, e
Arrays, Indexers, Structures,
Enumerations

Week 4 To Apply CLO2 Lecture Quiz

Week 5
Memory Management: Garbage
OOP Exercise Assignment
Week 6 Collector, Stack and Heap, System.
Knowledg Demonstration Practical Exam
GC Class. e

Week 7 Developing Microsoft.NET To Apply CLO3, Lecture Quiz

Week 8 Applications for Windows (Visual .NET CLO4 Exercise Assignment
Week 9 C#.NET) Knowledg Demonstration Practical Exam
Week e
10

Working with Controls

Control

Using Data in Windows Forms

Applications

in a Windows

250
 by Using DataSets

Week Developing Microsoft.NET To Apply CLO3, Lecture Quiz

11 Applications for Windows (Visual .NET CLO4 Exercise Assignment
Week C#.NET) Knowledge Demonstration Practical Exam
12
Week
13 Windows Forms
Week
14
Forms Application

Document
Content by Using GDI+

Crystal Reports

Applications
● .NET Assemblies

Part C- Assessment and Evaluations

Assessment Procedures
Assessment Name Description

Quiz Quizzes are simple class tests with a duration from 20 minutes to
120 minutes. It can be online or offline, students need to prepare for
the quiz based on the instructed syllabus.

Assignment Type of home work assessment, students are given specific tasks
and instructed to complete them within a given period of time.

Practical Mostly related to laboratory works or by implementing in real code

in either exercise book or in programming IDE

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3hours exam for 72 marks. Students need to
answer at most 6 questions. Every question may include sub
questions

251
Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Test Assignment Quizzes External Participation
Marks (out of 20) (10) (5) (5) in Curricular/Co-
Curricular Activities
Remember 2 1 0
Understand 5 1 1
Apply 3 1 1
Analyze 2 1 1
Evaluate 4 1 1
Create 4 0 1

SEE-Semester End Examination (72 Marks)

Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

Mapping of CLOs to PLOs

CLOs PLO46 PLO47 PLO48 PLO49 PLO50 PLO51 PLO52 PLO53 PLO54

CLO1 1 0 0 0 0 1 0 0 0

CLO2 0 1 0 0 0 0 1 0 0

CLO3 0 0 1 0 0 0 0 1 1

CLO4 0 0 0 1 0 0 0 1 0

CLO5 0 0 0 0 1 0 0 0 1

252
Part D- Resources

Textbooks
W3school.com
On line tutorial

Linear Algebra
Course Code: MATH 2201 Credit: 3.0
Exam Hours : 03 SEE Marks : 72
CIE Marks : 28

Course Learning Outcomes: After the successful completion of the course, students will be able to:
CLO1 Explain basic concepts of Matrices and their significance in engineering field.
CLO2 Understand and explain basic concepts of systems of linear equations.
CLO3 Learn determinant of a 2x2 Matrix, determinant of a 3x3 matrix.
CLO4 Understand and describe importance of Inverse in solving Linear Systems, Inverse of a 2x2
Matrix.
CLO5 Explain scalars and vectors, geometrical representation of Vectors, vector Addition and
subtraction.
CLO6 Understand and describe introduction to vector spaces, Euclidean Vector Spaces
CLO7 Explain Linear Dependence.
CLO8 Understand and describe Eigenvalues and Eigenvectors.

Mapping of CLOs with PLOs

CLO/PLO PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7
CLO1 2 3 2
CLO2 3 2 3 3 3
CLO3 3 3 3 3 3
CLO4 3 3 3 3 3
CLO5 3 3 3 3 2
CLO6 2 3 3 2 2
CLO7 3 2 2 3
CLO8 2 2 3

SN Course Content Hrs CLOs

1. Matrices and their Significance, Matrix Notation, Dimension (Order) of a 6 CLO1
Matrix, Addressing Elements of a Matrix, Solving Linear Systems in 2
Unknowns, Types of Matrices, Addition and Subtraction of Matrices,
Multiplication of Scalars with Matrices, Multiplication of two Matrices
2. Systems of Linear Equations Preview, Elementary Row Operations, Row 6 CLO2
Echelon Form (REF)
3. Determinant of a 2x2 Matrix, Determinant of a 3x3 Matrix, Finding 5 CLO3,
Determinants Quickly

253
 4. Inverse exists only for Square Matrices, Singular Matrices, Importance of 5 CLO4
Inverse in solving Linear Systems, Inverse of a 2x2 Matrix, Inverse of a 3x3
Matrix - The Two Methods
5. Scalars and Vectors, Geometrical Representation of Vectors, Vector Addition 5 CLO5
and Subtraction, Laws of Vector Addition and Head to Tail Rule, Unit Vector

6. Introduction to Vector Spaces, Euclidean Vector Spaces - Part 1, Euclidean 4 CLO6

Vector Spaces - Part 2, Euclidean Vector Spaces - Part 3, Definition and
Closure Properties, Axioms of Vector Spaces,
Subspace and Null space
7. Linear Dependence - Introduction 4 CLO7
8. Introduction to Eigenvalues and Eigenvectors. 4 CLO8

ASSESSMENT PATTERN
CIE- Continuous Internal Evaluation (28Marks)
Bloom’s Category Tests Assignments Quizzes External Participation in
Marks (out of 20) (10) (05) (05) Curricular/Co-Curricular
Activities(08)
Remember 05
Understand 03
Apply 04 8
Analyze 03
Evaluate 03
Create 02

SEE- Semester End Examination (72 Marks)

Bloom’s Category Test
Remember 15
Understand 15
Apply 15
Analyze 15
Evaluate 10
Create 02

Recommended References:
H. Anton and C.Rorres : Linear Algebra with Applications.
Brestscher : Linear Algebra with Applications.
Lipschutz, S. : Linear Algebra
Haward A. : Elementary Linear Algebra with Application
Haward A. : Contemporary Linear Algebra

254
255
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering
Course Outline: Computer Graphics and Multimedia

Part A- Introduction
I. Course code: CSE4101
II. Credit: 3
1. Course Summary
Introduces the basics of graphics and computer based graphical display. The mathematical basics
of the display mechanism and display primitives with their transformation characteristics are
elaborately discussed

2. Course Objectives
1. Receive a basic knowledge of computer graphics.
2. Able to apply graphic primitives in different displays.
3. Learn about viewing and positioning in several software and hardware.
4. Apply multimedia system to implements graphics into them.

3. Course Learning Outcomes

1. Devise the primary idea to computer graphics and its primitives

2. Apply different drawing applications.
3. Learn about clipping algorithms
4. Elaborate the idea of transformation and object representations
5. Learn about lights and illumination
Part B- Lesson Plan
Course Details Learning plan
Timeline Topics /contents Learning Mapped Teaching Assessment
Outcomes CLOs Strategies Strategies

Week 1, Introduction to Computer Learn how CLO1 Lecture Quiz

2 Graphics: Introduction, graphical Assignment
Presentation graphics, system works Practical
Application Areas, GUI; Exam
Graphics Hardware: Display
devices Architecture and Input
Devices

Week 3 Graphic Primitives: Drawing Learn and CLO1, Lecture Quiz

Points, Lines, Circles, Ellipse, implement CLO2 Exercise Assignment
Rectangles, Arcs; Polygons: primitives Demonstration Practical
Inside-outside tests, polygon fill Exam

255
 algorithms, Character
generation.

Week 4, Two-dimensional Viewing and Apply clipping CLO3 Lecture Quiz

5 Clipping: Viewing pipeline, Exercise Assignment
Window to view port Demonstration Practical
transformation, Point, Line, Exam
Polygon, Curve and Text
clipping.

Week 6, Transformations of Objects: Apply CLO4 Lecture Quiz

7 Basic transformations, Affine transformation Exercise Assignment
Transformations, Translations, Demonstration Practical
Rotations, Scaling, reflection and Exam
Shearing, Composite
transformations matrices,
Transformation of 3D objects
(4´4 matrices)

Week 8 Curve and Surface design: Implement CLO4 Lecture Quiz

Interpolation and approximation curve Exercise Assignment
techniques, B-spline, Bezier Demonstration Practical
curves and Surfaces, Fractal Exam
Geometry.

Week 9, 3D Object Representation: 3D Apply 3d CLO3, Lecture Quiz

10,11 Graphics Pipeline, Projection: transformation 4 Exercise Assignment
Different types of Parallel and Demonstration Practical
Perspective Matrices; B-Rep, Exam
Constructive Solid Geometry,
BSP tree, Octree, Hidden lines
and Surface detection: Back face
Detection, Painters algorithm, Z-
buffering; light models.

Week Illumination Models and CLO5 Lecture Quiz

12, 13 Surface-Rendering: Basic Exercise Assignment
illumination models, ambient Demonstration Practical
light, diffuse reflection, specular Learn light and Exam
reflection, Constant, Goraud and color
Phong shading; Ray-tracing;
Different Types of Color Model,
Fractals and Texture Mapping.

Week 14 Explain and CLO3 Lecture Quiz

Variable length argument list; apply argument Exercise Assignment
Command line parameters list Demonstration Practical
Exam

256
Part C- Assessment and Evaluations
Assessment Procedures

Assessment Description
Name

Quiz Quizzes are simple class tests with a duration from 20 minutes to 120 minutes. It can be
online or offline, students need to prepare for the quiz based on the instructed syllabus.

Assignment Type of home work assessment, students are given specific tasks and instructed to
complete them within a given period of time.

Practical Mostly related to laboratory works or by implementing in real code in either exercise
book or in programming IDE

Exam Each course contains a final exam considering the complete syllabus. It should be a
3hours exam for 72 marks. Students need to answer at most 6 questions. Every question
may include sub questions

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Test Assignment Quizzes External Participation
Marks (out of 20) (10) (5) (5) in Curricular/Co-
Curricular Activities
Remember 2
Understand 5
Apply 3
Analyze 2
Evaluate 4
Create 4
SEE-Semester End Examination (72 Marks)
Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

257
Mapping of CLOs to Assessment
Mapping of CLOs to PLOs

CLOs 1. 2. 3. 4. 5. 6. 7. 8. 9.

CLO1 1 1 0 0 0 0 0 1 0

CLO2 1 1 0 0 0 0 0 1 1

CLO3 1 1 0 0 0 0 0 1 1

CLO4 1 1 0 0 0 0 0 1 1

CLO5 1 1 0 0 0 0 0 1 1

Part D- Resources

Textbooks
1. Computer Graphics, Author: Donald Hearn and Paullin Baker
2. Computer Graphics, Principle and Practice, Author: Foley, Vandam, Feiner, Hughes
3. Computer Graphics & Geometric Modeling for Engineers, Author: Vera B Anand.

258
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering
Course Outline: Computer Graphics and Multimedia Lab

Part A- Introduction
1. Course code: CSE4102

II. Credit: 1.5

1. Course Summary
Introduces the basics of graphics and computer based graphical display in labratory. The
mathematical basics of the display mechanism and display primitives with their transformation
characteristics are elaborately discussed

2. Course Objectives
1. Receive a basic knowledge of computer graphics.
2. Able to apply graphic primitives in different displays.
3. Learn about viewing and positioning in several software and hardware.
4. Apply multimedia system to implements graphics into them.

3. Course Learning Outcomes

1. Implement the primary idea to computer graphics and its primitives

2. Apply different drawing applications.
3. Experiments the clipping algorithms
4. Elaborate the idea of transformation and object representations
5. Implement about lights and illumination
Part B- Lesson Plan
Course Details Learning plan

Timeline Topics /contents Learning Mapped Teaching Assessment

Outcomes CLOs Strategies Strategies

Week 1, Introduction to Computer Learn how CLO1 Lecture Quiz

2 Graphics: Introduction, graphical Assignment
Presentation graphics, system works Practical
Application Areas, GUI; Exam
Graphics Hardware: Display
devices Architecture and Input
Devices

Week 3 Graphic Primitives: Drawing Learn and CLO1, Lecture Quiz

Points, Lines, Circles, Ellipse, implement CLO2 Exercise Assignment
Rectangles, Arcs; Polygons: primitives Demonstration Practical
Inside-outside tests, polygon fill Exam

259
 algorithms, Character
generation.

Week 4, Two-dimensional Viewing and Apply clipping CLO3 Lecture Quiz

5 Clipping: Viewing pipeline, Exercise Assignment
Window to view port Demonstration Practical
transformation, Point, Line, Exam
Polygon, Curve and Text
clipping.

Week 6, Transformations of Objects: Apply CLO4 Lecture Quiz

7 Basic transformations, Affine transformation Exercise Assignment
Transformations, Translations, Demonstration Practical
Rotations, Scaling, reflection and Exam
Shearing, Composite
transformations matrices,
Transformation of 3D objects
(4´4 matrices)

Week 8 Curve and Surface design: Implement CLO4 Lecture Quiz

Interpolation and approximation curve Exercise Assignment
techniques, B-spline, Bezier Demonstration Practical
curves and Surfaces, Fractal Exam
Geometry.

Week 9, 3D Object Representation: 3D Apply 3d CLO3, Lecture Quiz

10,11 Graphics Pipeline, Projection: transformation 4 Exercise Assignment
Different types of Parallel and Demonstration Practical
Perspective Matrices; B-Rep, Exam
Constructive Solid Geometry,
BSP tree, Octree, Hidden lines
and Surface detection: Back face
Detection, Painters algorithm, Z-
buffering; light models.

Week Illumination Models and CLO5 Lecture Quiz

12, 13 Surface-Rendering: Basic Exercise Assignment
illumination models, ambient Demonstration Practical
light, diffuse reflection, specular Learn light and Exam
reflection, Constant, Goraud and color
Phong shading; Ray-tracing;
Different Types of Color Model,
Fractals and Texture Mapping.

Week 14 Explain and CLO3 Lecture Quiz

Variable length argument list; apply argument Exercise Assignment
Command line parameters list Demonstration Practical
Exam

260
Part C- Assessment and Evaluations
Assessment Procedures

Assessment Name Description

Attendance(Class Students should regularly attend the classes and actively participate in the
participation) class discussion.

Assignment Type of home work assessment, students are given specific tasks and
instructed to complete them within a given period of time.

Practical Mostly related to laboratory works or by implementing in real code in either

exercise book or in programming IDE

Exam Includes set of programming problems to solve within a timeline

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (40 Marks):

Bloom’s Category Test Attendance External Participation

Marks (out of 20) (30) (10) in Curricular/Co-
Curricular Activities
Remember 2
Understand 5
Apply 13
Analyze 2
Evaluate 4
Create 4
SE- Lab Final Exam (60 marks)
Bloom’s Category Test
Remember 5
Understand 10

Apply 25

Analyze 10

Evaluate 5

Create 5

261
Mapping of CLOs to PLOs

CLOs 1. 2. 3. 4. 5. 6. 7. 8. 9.

CLO1 1 1 0 0 0 0 0 1 0

CLO2 1 1 0 0 0 0 0 1 1

CLO3 1 1 0 0 0 0 0 1 1

CLO4 1 1 0 0 0 0 0 1 1

CLO5 1 1 0 0 0 0 0 1 1

Part D- Resources

Textbooks

1. Computer Graphics, Author: Donald Hearn and Paullin Baker

2. Computer Graphics, Principle and Practice, Author: Foley, Vandam, Feiner, Hughes
3. Computer Graphics & Geometric Modeling for Engineers, Author: Vera B Anand.

262
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Digital Signal and Image Processing

Part A- Introduction
I. Course code: CSE 4103

II. Credit: 3

1. Course Summary

This course presents the fundamentals of digital image processing. It covers principles and
algorithms for processing images. Topics include data acquisition, imaging, filtering, coding,
feature extraction, and modeling. The focus of the course is a series of labs that provide
practical experience in processing physiological data, with examples from cardiology, speech
processing, and medical imaging. The labs are done on the MIT Server in MATLAB® during
weekly lab sessions that take place in an electronic classroom. Lectures cover image
processing topics relevant to the lab exercise.

2. Course Objectives

1. To introduce students to basic image processing techniques.

2. To develop the students mathematical, scientific, and computational skills relevant to
the field of digital image processing.
3. To enhance the students ability in formulating problems and designing analysis tools
for digital images.
4. To foster effective interaction skills and teamwork communication.

3. Course Learning Outcomes

CLO1. Illustrate the concepts of digital images

CLO2. Illustrate the concepts of digital image representations
CLO3. Apply transformation technologies in image
CLO4. Identify the application of Image processing
CLO5. Application of image processing in computer vision

263
Part B- Lesson Plan
Course Details Learning plan

Timeline Topics /contents Learning Outcomes Mapped Teaching Assessment

CLOs Strategies Strategies

Week 1, Introduction; Point operations; Line Explain histograms CLO1 Lecture Quiz
2, 3, 4 and Edge detection, labeling, Discuss spatial
Histograms; Spatial operations; operations
Affine transformations; Image Illustrate image
Segmentation, Image Representation segmentation, image
and Modelling, Image rectification; representation ,Image
Interpolation and other rectification, Image
transformations; Contrast interpolation and other
enhancement; Convolution operation, transformations
Magnification and Zooming; Fourier Illustrate edge
transform; Edge detection; Boundary detection,boundary
extraction and representation; extraction and
Mathematical morphology. representation.

Week 5, Point processing; Histogram Describe, apply and CLO1, Lecture Quiz
6, 7 Processing – Normalization, analyze different CLO2 Exercise Assignment
Matching, Equalization; image filtering Demonstr Practical
Average Filter, Weighted Average techniques and image ation Exam
Filter, Median Filter, Gaussian Filters; enhancement operators
1st and 2ndDerivative, Laplacian; and algorithms in the
Sobel operator spatial domain

Week 8, Frequency domain of an image; Describe, apply and CLO1 Lecture Quiz
9, 10 Fourier transform, 1D and 2D analyze different Exercise Assignment
Discrete Fourier transform, smoothing image filtering Demonstr Practical
frequency domain filter - Ideal, techniques and image ation Exam
Butterworth and Gaussian low pass enhancement operators
filters; Sharpening frequency domain and algorithms in the
filter - Ideal, Butterworth and frequency domain
Gaussian high pass filters;

Week 11, Pattern Recognition: Statistical, Discuss different types CLO3 Lecture Quiz
12, 13, 14 Structural, Neural and Hybrid of pattern recognition Exercise Assignment
Techniques, Document Analysis and techniques Demonstr Practical
Optical Character Recognition, Object Define optical ation Exam
Recognition, Scene Matching and character recognition
Analysis. Explain scene
matching and analysis

264
Part C- Assessment and Evaluations
Assessment Procedures

Assessment Name Description

Quiz Quizzes are simple class tests with a duration from 20 minutes to
120 minutes. It can be online or offline, students need to prepare
for the quiz based on the instructed syllabus.

Assignment Type of home work assessment, students are given specific tasks
and instructed to complete them within a given period of time.

Practical Mostly related to laboratory works or by implementing in real

code in either exercise book or in programming IDE

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3 hours exam for 72 marks. Students need
to answer at most 6 questions. Every question may include sub
questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):
Bloom’s Category Test Assignment Quizzes External Participation
Marks (out of 20) (10) (5) (5) in Curricular/Co-
Curricular Activities
Remember 2
Understand 5
Apply 3
Analyze 2
Evaluate 4
Create 4
SEE-Semester End Examination (72 Marks)
Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

Quiz Assignme Practical Final

(10%) nt (10%) (72%)
(8%)

CLO1 1 0 1 1

265
CLO2 1 1 1 1

CLO3 1 1 1 1

CLO4 1 1 1 1

CLO5 1 1 1 1

Mapping of CLOs to PLOs

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 1 1 0 0 0 0 0 1 0

CLO2 1 1 0 0 0 0 0 1 1

CLO3 1 1 0 0 0 0 0 1 1

CLO4 1 1 0 0 0 0 0 1 1

CLO5 1 1 0 0 0 0 0 1 1

Part D- Resources
Textbooks
1. R. A. Plastock& G. Kalley :"Theory and Problems of Computer Graphics"
2. Gonzalez :"Pattern Recognition Principles''

Reference Books
1. Steven Harrington :"Computer Graphics : A Programming Approach"
2. NewmannSprocell :"Principles of Interactive Computer Graphics"

266
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Digital Signal and Image Processing Lab

Part A- Introduction
I. Course code: CSE 4104

II. Credit: 1.5

1. Course Summary

This course presents the fundamentals of digital image processing. It covers principles and
algorithms for processing images. Topics include data acquisition, imaging, filtering, coding,
feature extraction, and modeling. The focus of the course is a series of labs that provide
practical experience in processing physiological data, with examples from cardiology, speech
processing, and medical imaging. The labs are done on the MIT Server in MATLAB® during
weekly lab sessions that take place in an electronic classroom. Lectures cover image
processing topics relevant to the lab exercise.

2. Course Objectives

1. To introduce students to basic image processing techniques.

2. To develop the students mathematical, scientific, and computational skills relevant to
the field of digital image processing.
3. To enhance the students ability in formulating problems and designing analysis tools
for digital images.
4. To foster effective interaction skills and teamwork communication.

3. Course Learning Outcomes

CLO1. Implement the concepts of digital images

CLO2. Experiment the concepts of digital image representations
CLO3. Apply transformation technologies in image
CLO4. Install the application of Image processing
CLO5. Experiment of image processing in computer vision

267
Part B- Lesson Plan
Course Details Learning plan

Timeline Topics /contents Learning Outcomes Mappe Teaching Assessment

d CLOs Strategies Strategies

Week 1, Introduction; Point operations; Explain histograms CLO1 Lecture Quiz

2, 3, 4 Line and Edge detection, Discuss spatial
labeling, Histograms; Spatial operations
operations; Affine Illustrate image
transformations; Image segmentation, image
Segmentation, Image representation ,Image
Representation and Modelling, rectification, Image
Image rectification; interpolation and other
Interpolation and other transformations
transformations; Contrast Illustrate edge
enhancement; Convolution detection,boundary
operation, Magnification and extraction and
Zooming; Fourier transform; representation.
Edge detection; Boundary
extraction and representation;
Mathematical morphology.

Week 5, Point processing; Histogram Describe, apply and CLO1, Lecture Quiz
6, 7 Processing – Normalization, analyze different image CLO2 Exercise Assignment
Matching, Equalization; filtering techniques and Demonstration Practical
Average Filter, Weighted image enhancement Exam
Average Filter, Median Filter, operators and
Gaussian Filters; 1st and algorithms in the spatial
2ndDerivative, Laplacian; domain
Sobel operator

Week 8, Frequency domain of an image; Describe, apply and CLO1 Lecture Quiz
9, 10 Fourier transform, 1D and 2D analyze different image Exercise Assignment
Discrete Fourier transform, filtering techniques and Demonstration Practical
smoothing frequency domain image enhancement Exam
filter - Ideal, Butterworth and operators and
Gaussian low pass filters; algorithms in the
Sharpening frequency domain frequency domain
filter - Ideal, Butterworth and
Gaussian high pass filters;

Week Pattern Recognition: Statistical, Discuss different types CLO3 Lecture Quiz
11, 12, Structural, Neural and Hybrid of pattern recognition Exercise Assignment
13, 14 Techniques, Document techniques Demonstration Practical
Analysis and Optical Character Define optical character Exam
Recognition, Object recognition
Recognition, Scene Matching Explain scene matching

268
 and Analysis. and analysis

Part C- Assessment and Evaluations

Assessment Procedures

Assessment Name Description

Quiz Quizzes are simple class tests with a duration from 20 minutes to
120 minutes. It can be online or offline, students need to prepare
for the quiz based on the instructed syllabus.

Assignment Type of home work assessment, students are given specific tasks
and instructed to complete them within a given period of time.

Practical Mostly related to laboratory works or by implementing in real

code in either exercise book or in programming IDE

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3 hours exam for 72 marks. Students need
to answer at most 6 questions. Every question may include sub
questions

Mapping of CLOs to Assessment

Quiz Assignm Practical Final

(10%) ent (10%) (72%)
(8%)

CLO1 1 0 1 1

CLO2 1 1 1 1

CLO3 1 1 1 1

CLO4 1 1 1 1

CLO5 1 1 1 1

269
Mapping of CLOs to PLOs

CLOs PLO10 PLO11 PLO12 PLO13 PLO14 PLO15 PLO16 PLO17 PLO18

CLO1 1 1 0 0 0 0 0 1 0

CLO2 1 1 0 0 0 0 0 1 1

CLO3 1 1 0 0 0 0 0 1 1

CLO4 1 1 0 0 0 0 0 1 1

CLO5 1 1 0 0 0 0 0 1 1

Part D- Resources

Textbooks
1. R. A. Plastock& G. Kalley :"Theory and Problems of Computer Graphics"
2. Gonzalez :"Pattern Recognition Principles''

Reference Books
1. Steven Harrington :"Computer Graphics : A Programming Approach"
2. NewmannSprocell :"Principles of Interactive Computer Graphics"

270
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Computer Security

Part A- Introduction

I. Course code: CSE 4105

II. Credit: 3

1. Course Summary
To contribute to the ICT based innovative model, one needs to create a random
number, justify randomness and correlations in the system and apply probability
distribution in the system.

2. Course Objectives

1. To understand and apply simulations in different systems.

2. To create a random number and evaluate the randomness in the system.
3. To understand different modeling methods with its applications.

3. Course Learning Outcomes

CLO1. Describe the system

CLO2. Explain simulation of different systems
CLO3. Introduce various types of simulation
CLO4. Describe different distribution
CLO5. Introduce and generate various types of random numbers
CLO6. Introduce with queuing system
CLO7. Introduce with discrete event system simulation

271
Part B- Lesson Plan
Course Details Learning plan

Timeline Topics /contents Learning Outcomes Mapped Teaching Assessment

CLOs Strategies Strategies

Week 1 Concepts of a system; System Describe the system CLO 1 Lecture, Quiz
Environment; Activities; and environment handouts
Continuous and Discrete CLO 2 Participation
Systems. Exam

Week 2 The Technique of Simulation; Focus on analytical CLO 3 Lecture, Quiz

,3, 4 Comparison of Simulation and methods of
Analytical Methods; handouts Participation
simulation
Experimental Nature of Exam
Simulation; Parallel and
Distributed Simulation; Real
time Simulation Types of
System Simulation.

Week 5, Stochastic Variables; Discrete Develop solid CLO 4 Lecture, Quiz

6,7 and Continuous Probability concept on different handouts
Functions; Measures of types of distribution Participation
Probability Functions; The Exam
Coefficient of Variation;
Generation of Random Variates;
Binomial Distribution; Poisson
Distribution; Continuous
Distribution; Normal
Distribution; The Exponential
Distribution; The Erlang and
Hyper-Exponential
Distributions; Uniform
Distribution; Beta Distribution

Week Random Numbers Table; Develop solid CLO 5 Lecture, Quiz

8,9,10 Pseudo Random Numbers; concept on random handouts
Computer Generation of numbers Participation
Random Numbers; A Uniform Exam
and non-Uniform Continuously
Distributed Random Numbers;
Qualities of an efficient Random
Number

272
Week 11, Congestion in Systems; Arrival Develop solid CLO 6 Lecture, Quiz
12 Patterns; Service Times; concept on queuing handouts
Queuing Disciplines, Measure methodologies Participation
of Queue and Mathematical Exam
Solutions of Queuing Problems.

Week 13, Discrete Events; Representation Develop solid CLO 7 Lecture, Quiz
14 of Time; Generation of Arrival concept on discrete handouts
Patterns; Simulation of a events methodologies Participation
Telephone System; Simulation Exam

Part C- Assessment and Evaluation

Assessment Procedures

Assessment Name Description

Participation Attendance and participate in the class discussion

Quiz Quizzes are simple class tests with a duration from 20 minutes to
120 minutes. It can be online or offline, students need to prepare
for the quiz based on the instructed syllabus.

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3hours exam for 72 marks. Students need
to answer at most 6 questions. Every question may include sub
questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Test Assignment Quizzes External Participation
Marks (out of 20) (10) (5) (5) in Curricular/Co-
Curricular Activities
Remember 2
Understand 5
Apply 3
Analyze 2
Evaluate 4
Create 4
SEE-Semester End Examination (72 Marks)
Bloom’s Category Test
Remember 05
Understand 15

273
Apply 20
Analyze 10
Evaluate 10
Create 12

Attendance Quiz Final

(8%) (20%) (72%)

CLO1 1 1 1

CLO2 1 1 1

CLO3 1 1 1

CLO4 1 1 1

CLO5 1 1 1

CLO6 1 1 1

CLO7 1 1 1

Mapping of CLOs to PLOs

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 1 0 0 0 0 0 0 1 0

CLO2 1 0 0 0 0 0 0 1 0

CLO3 1 0 0 0 0 0 0 1 0

CLO4 1 0 0 0 0 0 0 1 0

CLO5 1 0 0 0 0 0 0 1 0

CLO6 1 0 0 0 0 0 0 1 0

CLO7 1 0 0 0 0 0 0 1 0

274
Part D- Resources
Textbooks
1. Simulation Modeling and Analysis: FIFTH EDITION by Averill M. Law
Reference Books
1. Modelling and Simulation: Exploring Dynamic System Behaviour by Gilbert Arbez and Louis G.
Birta
2. Other resources (Slides)

275
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering
Course Outline: Software Testing

Part A- Introduction

I. Course code: CSE4111

II. Credit: 3

1. Course Summary

This course provides an elementary introduction to software quality assurance and tests. Upon
completion of this course, students will have the ability to:

2. Course Objectives

1. Present effective testing techniques (both black-box and white box) for ensuring high
quality software
2. Learn metrics for managing quality assurance
3. Understand capabilities of test tools
4. Establish a testing group and manage the whole testing project;
5. Clearly and correctly report the software defectives;
6. Asses the software product correctly;
7. Distinguish relationship between the software testing and the quality assurance.

3. Course Learning Outcomes

CLO1. Present effective testing techniques (both black-box and white box) for
CLO2. ensuring high quality software
CLO3. Learn metrics for managing quality assurance
CLO4. Understand capabilities of test tools
CLO5. Establish a testing group and manage the whole testing project;
CLO6. Asses the software product correctly;

276
Part B- Lesson Plan
Course Details Learning plan

Timeline Topics /contents Learning Mapped Teaching Assessment

Outcomes CLOs Strategies Strategies

Week 1 Basic Testing Vocabulary Know the CLO1 Lecture Quiz

basic
Quality Assurance versus Quality concepts of
Control Software
The Cost of Quality Testing

Software Quality Factors

How Quality is Defined
Why Do We Test Software?
What is a Defect?
The Multiple Roles of the Software
Tester(People Relationships)
Scope of Testing
When Should Testing Occur?
Testing Constraints
Life Cycle Testing
Independent Testing
What is a QA Process?
Levels of Testing
The “V” Concept of Testing

Week 2 Structural versus Functional Apply CLO1, Lecture Quiz

Technique Categories Testing CLO2
Techniques Exercise Assignment
Verification versus Validation
Demonstration Practical Exam
Static versus Dynamic Testing
Examples of Specific Testing
Techniques

277
Week 3 Test Planning Know Test CLO1 Lecture Quiz
Administration
Customization of the Test Exercise Assignment
Process
Demonstration Practical Exam
Budgeting
Scheduling

Week 4, Prerequisites to test planning Create the Test CLO3 Lecture Quiz
5 Plan
Understand the Exercise Assignment
Characteristics of the
Software Being Developed Demonstration Practical Exam

Build the Test Plan

Write the Test Plan

Week 6 Test Cases: Understand Test CLO1 Lecture Quiz

Metrics –
Test case Design Guidelines and Exercise Assignment
Building test cases usage Demonstration Practical Exam
Test data mining
Test execution
Test Reporting
Defect Management
Test Coverage – Traceability
matrix

Week 7, Guidelines for writing test Apply Test CLO1, Lecture Quiz
8,9 reports reporting CLO2,
CLO5 Exercise Assignment
Test Tools used to Build
Test Reports Demonstration Practical Exam

Week Software Configuration CLO5 Lecture Quiz

10, 11, Management Learn how to
12 Exercise Assignment
Manage Change
Change Management
Demonstration Practical Exam

Week Risks – Risk Analysis and Learn Risk CLO4 Lecture Quiz
13, 14 Management with examples Analysis and
Management, Exercise Assignment
User Acceptance testing – in User Acceptance

278
 detail explanation with testing Demonstration Practical Exam
details

Part C- Assessment and Evaluations

Assessment Procedures

Assessment Description
Name

Quiz Quizzes are simple class tests with a duration from 20 minutes to 120 minutes. It can be
online or offline, students need to prepare for the quiz based on the instructed syllabus.

Assignment Type of home work assessment, students are given specific tasks and instructed to complete
them within a given period of time.

Practical Mostly related to laboratory works or by implementing in real code in either exercise book
or in programming IDE

Exam Each course contains a final exam considering the complete syllabus. It should be a 3hours
exam for 72 marks. Students need to answer at most 6 questions. Every question may
include sub questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Test Assignment Quizzes External Participation
Marks (out of 20) (10) (5) (5) in Curricular/Co-
Curricular Activities
Remember 2
Understand 5
Apply 3
Analyze 2
Evaluate 4
Create 4
SEE-Semester End Examination (72 Marks)
Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

279
 Quiz Assignme Practical Final
nt
(10%) (10%) (72%)
(8%)

CLO1 1 0 1 1

CLO2 1 1 1 1

CLO3 1 1 1 1

CLO4 1 1 1 1

CLO5 1 1 1 1

Mapping of CLOs to PLOs

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 1 1 0 0 0 0 0 1 0

CLO2 1 1 0 0 0 0 0 1 1

CLO3 1 1 0 0 0 0 0 1 1

CLO4 1 1 0 0 0 0 0 1 1

CLO5 1 1 0 0 0 0 0 1 1

Part D- Resources
Textbooks
1. Designing Object-oriented, Author: R. Wirfs-Brock et. al.
2. Software Engineering, Author: Ian Sommerville

Reference Books
1. Software Engineering: A Practitioner's Approach, Author: R.S. Pressman
2. Writing Effective Use Cases, Author: Robert C. Martin

280
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering
Course Outline: Software Testing Lab

Part A- Introduction

I. Course code: CSE4112

II. Credit: 1.5

1. Course Summary

This course provides an elementary introduction to software quality assurance and tests lab.
Upon completion of this course, students will have the ability to:

2. Course Objectives

1. Present effective testing techniques (both black-box and white box) for ensuring high
quality software
2. Learn metrics for managing quality assurance
3. Understand capabilities of test tools
4. Establish a testing group and manage the whole testing project;
5. Clearly and correctly report the software defectives;
6. Asses the software product correctly;
7. Distinguish relationship between the software testing and the quality assurance.

3. Course Learning Outcomes

CLO1. Present effective testing techniques (both black-box and white box) for
CLO2. ensuring high quality software
CLO3. Learn metrics for managing quality assurance
CLO4. Understand capabilities of test tools
CLO5. Establish a testing group and manage the whole testing project;
CLO6. Asses the software product correctly;

281
Part B- Lesson Plan
Course Details Learning plan

Timeline Topics /contents Learning Mapped Teaching Assessment

Outcomes CLOs Strategies Strategies

Week 1 Basic Testing Vocabulary Know the CLO1 Lecture Quiz

basic
Quality Assurance versus Quality concepts of
Control Software
The Cost of Quality Testing

Software Quality Factors

How Quality is Defined
Why Do We Test Software?
What is a Defect?
The Multiple Roles of the Software
Tester(People Relationships)
Scope of Testing
When Should Testing Occur?
Testing Constraints
Life Cycle Testing
Independent Testing
What is a QA Process?
Levels of Testing
The “V” Concept of Testing

Week 2 Structural versus Functional Apply CLO1, Lecture Quiz

Technique Categories Testing CLO2
Techniques Exercise Assignment
Verification versus Validation
Demonstration Practical Exam
Static versus Dynamic Testing
Examples of Specific Testing
Techniques

282
Week 3 Test Planning Know Test CLO1 Lecture Quiz
Administration
Customization of the Test Exercise Assignment
Process
Demonstration Practical Exam
Budgeting
Scheduling

Week 4, Prerequisites to test planning Create the Test CLO3 Lecture Quiz
5 Plan
Understand the Exercise Assignment
Characteristics of the
Software Being Developed Demonstration Practical Exam

Build the Test Plan

Write the Test Plan

Week 6 Test Cases: Understand Test CLO1 Lecture Quiz

Metrics –
Test case Design Guidelines and Exercise Assignment
Building test cases usage Demonstration Practical Exam
Test data mining
Test execution
Test Reporting
Defect Management
Test Coverage – Traceability
matrix

Week 7, Guidelines for writing test Apply Test CLO1, Lecture Quiz
8,9 reports reporting CLO2,
CLO5 Exercise Assignment
Test Tools used to Build
Test Reports Demonstration Practical Exam

Week Software Configuration CLO5 Lecture Quiz

10, 11, Management Learn how to
12 Exercise Assignment
Manage Change
Change Management
Demonstration Practical Exam

Week Risks – Risk Analysis and Learn Risk CLO4 Lecture Quiz
13, 14 Management with examples Analysis and
Management, Exercise Assignment
User Acceptance testing – in User Acceptance

283
 detail explanation with testing Demonstration Practical Exam
details

Part C- Assessment and Evaluations

Assessment Procedures

Assessment Description
Name

Quiz Quizzes are simple class tests with a duration from 20 minutes to 120 minutes. It can be
online or offline, students need to prepare for the quiz based on the instructed syllabus.

Assignment Type of home work assessment, students are given specific tasks and instructed to complete
them within a given period of time.

Practical Mostly related to laboratory works or by implementing in real code in either exercise book
or in programming IDE

Exam Each course contains a final exam considering the complete syllabus. It should be a 3hours
exam for 72 marks. Students need to answer at most 6 questions. Every question may
include sub questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Test Assignment Quizzes External Participation
Marks (out of 20) (10) (5) (5) in Curricular/Co-
Curricular Activities
Remember 2
Understand 5
Apply 3
Analyze 2
Evaluate 4
Create 4
SEE-Semester End Examination (72 Marks)
Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

284
 Quiz Assignme Practical Final
nt
(10%) (10%) (72%)
(8%)

CLO1 1 0 1 1

CLO2 1 1 1 1

CLO3 1 1 1 1

CLO4 1 1 1 1

CLO5 1 1 1 1

Mapping of CLOs to PLOs

CLOs PLO10 PLO11 PLO12 PLO13 PLO14 PLO15 PLO16 PLO17 PLO18

CLO1 1 1 0 0 0 0 0 1 0

CLO2 1 1 0 0 0 0 0 1 1

CLO3 1 1 0 0 0 0 0 1 1

CLO4 1 1 0 0 0 0 0 1 1

CLO5 1 1 0 0 0 0 0 1 1

Part D- Resources
Textbooks
3. Designing Object-oriented, Author: R. Wirfs-Brock et. al.
4. Software Engineering, Author: Ian Sommerville

Reference Books
3. Software Engineering: A Practitioner's Approach, Author: R.S. Pressman
4. Writing Effective Use Cases, Author: Robert C. Martin

285
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Data Mining and Warehousing

Part A- Introduction

I. Course code: CSE 4113

II. Credit: 3

1. Course Summary
The amount of data collected across a wide variety of domains far exceeds our ability
to reduce and analyze without the use of smart and intelligent analysis techniques. It is
becoming a challenging task to obtain information from the massive collection of data.
Data Science is a set of principles that support and guide the extraction of information
and insight from data. Machine learning, on the other hand, is a branch of Artificial
Intelligence that deals with the idea that systems can learn from data, identify patterns,
and make decisions with minimal human interaction. This course presents the
fundamentals of Data Science and Machine Learning. The concept of Data Science will
help students to acquire knowledge on various data processing methods, approaches,
tools and techniques. The section of Machine Learning will help the students to learn
about different algorithms and approaches in order to build models in such a way that
the models, when exposed to new data, will be able to produce reliable, repeatable
decisions and results by learning from previous computation.

2. Course Objectives

1. To introduce students to data collection and extraction techniques.

2. To develop the mathematical and logical skill sets for data preprocessing.
3. To develop and enhance data visualization techniques.
4. To understand the concepts of machine learning approaches and algorithms.
5. To acquire the skill for building machine learning problems..

286
 3. Course Learning Outcomes

CLO1. Introduction to data science

CLO2. Data preprocessing
CLO3. Data reduction
CLO4. Data transformation, and discretization and visualization
CLO5. Regression and classification analysis
CLO6. Classification
CLO7. Clustering and reinforcement learning
Part B- Lesson Plan
Course Details Learning plan

Timeline Topics Learning Mapped Teaching Assessment

/contents Outcomes CLOs Strategies Strategies

Week 1 History of data To become CLO 1 Lecture, Quiz

science, aims familiar with handouts
and objectives of data science Participation
data science, and its Exam
data, categorize applications
of data, data
sources, data To learn
collection and different data
extraction. types in data
science

Week 2 Data quality, To know the CLO 2 Lecture, Quiz

,3 data cleaning techniques
techniques, handouts Participation
of dealing
dealing with with missing Exam
missing values, and noisy
handling noisy
values
data, linear
regression and To know
non-linear other data
regression.. preprocessin
g techniques

Week 4, Wavelet To CLO 3 Lecture, Quiz

5 transformation, understand handouts
principal why is data Participation

287
 component reduction Exam
analysis, necessary
attribute subset
selection To become
familiar with
data
reduction
techniques

Week 6, Overview, To learn data CLO 4 Lecture, Quiz

7 normalization, transformatio handouts
binning, n techniques Participation
histogram Exam
analysis, data To know data
visualization visualization
tools and tools and
techniques techniques

Week 8, linear To obtain the CLO 5 Lecture, Quiz

9 regression, fundamental handouts
logistic understandin Participation
regression, g of Exam
maximum regression
likelihood and and
least square, classification
Bias variance analysis
decomposition,
over fitting and
under filling
problems and
solutions.

Week 10, Decision tree To learn the CLO 6 Lecture, Quiz

11, 12 classifiers, basic handouts
Naïve Bayes concepts and Participation
classifiers, techniques of Exam
Neural classification.
networks,
Support vector To
machine, understand
Random forest, the
Nearest mechanism
neighbor. of different
Evaluation of classifiers
classifiers. To learn how
Ensemble to evaluate
methods and compare
different

288
 classifiers

Week 13, Cluster analysis, To learn CLO 7 Lecture, Quiz

14 partition basic handouts
method, concepts and Participation
hierarchical methods of Exam
method, density cluster
based clustering, analysis.
evaluation of
clustering, To learn
reinforcement fundamental
analysis and clustering
approaches, techniques
model To learn
evaluation
how to
techniques
evaluate
models

Part C- Assessment and Evaluations

Assessment Procedures

Assessment Name Description

Participation Attendance and participate in the class discussion

Quiz Quizzes are simple class tests with a duration from 20 minutes to
120 minutes. It can be online or offline, students need to prepare
for the quiz based on the instructed syllabus.

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3hours exam for 72 marks. Students need
to answer at most 6 questions. Every question may include sub
questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Test (10) Assignment Quizzes External Participation in
Marks (out of 20) (5) (5) Curricular/Co-Curricular
Activities
Remember 2
Understand 5
Apply 3
Analyze 2

289
Evaluate 4
Create 4

SEE-Semester End Examination (72 Marks)

Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

Attendance Quiz Final

(8%) (20%) (72%)

CLO1 1 1 1

CLO2 1 1 1

CLO3 1 1 1

CLO4 1 1 1

CLO5 1 1 1

CLO6 1 1 1

CLO7 1 1 1

Mapping of CLOs to PLOs

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 1 0 0 0 0 0 0 1 0

CLO2 1 0 0 0 0 0 0 1 0

290
CLO3 1 0 0 0 0 0 0 1 0

CLO4 1 0 0 0 0 0 0 1 0

CLO5 1 0 0 0 0 0 0 1 0

CLO6 1 0 0 0 0 0 0 1 0

CLO7 1 0 0 0 0 0 0 1 0

Part D- Resources
Textbooks
1. Gareth James, Daniela Witten, Trevor Hastie, Robert Tibshirani. “An introduction to statistical
learning with application in R”
2. Trevor Hastie, Robert Tibshirani, Jerome Friedman “The elements of statistical learning”.

Reference Books
1. Christopher Bishop “Pattern Recognition and Machine Learning”

Other resources (Slides)

1.

291
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Software Design Patterns and Principles

Part A- Introduction

I. Course code: CSE 4115

II. Credit: 3

1. Course Summary

Students will create project teams of 3 members each. Number of team members can be varied
for special cases, decided by the assigned course manager. All the project teams are required to
prepare their Software Requirements Specification (SRS) first, and later develop the project
accordingly.

2. Course Objectives

1. Revision of concepts of OOP

2. Importance of learning design pattern

3. Course Learning Outcomes

CLO1. Learn to use design solutions based on design pattern

CLO2. Learn to implement design pattern
CLO3. Identify problems that can be solved using design patterns
CLO4. Becoming familiar with code smells
CLO5. Applying refactoring to the code smells

292
Part B- Lesson Plan
Course Details Learning plan

Timeline Topics /contents Learning Mapped Teaching Assessment Strategies

Outcomes CLOs Strategies

Week 1 Revision of Design and CLO1 Lecture Quiz

Concepts of OOP Implement

Week 2 Importance of Design, CLO1, Lecture Quiz

learning design Implement CLO2
pattern and Solve Exercise Assignment
Real-life Demonstration Practical Exam
Problems

Week 3 Types of design Design, CLO1 Lecture Quiz

patterns - Implement
Structural, and Solve Exercise Assignment
Behavioral and Real-life Demonstration Practical Exam
Creational Problems
Patterns

Week 4, 5 Singleton, Design, CLO3 Lecture Quiz

Factory, Factory Implement
Method, Abstract and Solve Exercise Assignment
Factory, Builder, Real-life Demonstration Practical Exam
Prototype and Problems
Object Pool

Week 6 Chain of Design, CLO1 Lecture Quiz

Responsibility, Implement
Command, and Solve Exercise Assignment
Interpreter, Real-life Demonstration Practical Exam
Iterator, Mediator, Problems
Memento,
Observer,
Strategy,
Template method,
visitor and Null
Object

Week 7, Adapter, Bridge, Design, CLO1, Lecture Quiz

8,9 Composite, Implement CLO2,
Decorator, and Solve CLO5 Exercise Assignment
Flyweight and Real-life Demonstration Practical Exam
Proxy Problems

293
Week 10 REFACTORING Design, CLO5 Lecture Quiz
CODE SMELL Implement
Introduction and Solve Exercise Assignment
Real-life Demonstration Practical Exam
Problems

Week 11, Inappropriate CLO4 Lecture Quiz

12 Naming,
Comments, Dead Exercise Assignment
Code, Duplicated Demonstration Practical Exam
code, Primitive
Obsession, Large
Class,
Lazy Class,
Alternative Class
with Different Design,
Interface, Long Implement
Method, Long and Solve
Parameter List, Real-life
Switch Problems

Statements,
Speculative
Generality,
Oddball Solution,
Feature Envy,
Refused Bequest,
Black Sheep
and Train Wreck

Week 13, Design Principles Design, CLO1, Lecture Quiz

14 (SOLID) - Single Implement CLO4
responsibility and Solve Exercise Assignment
principle, Open Real-life Demonstration Practical Exam
Close Principle, Problems
Liskov
substitution
principle,
Interface
segregation
principle,
Dependency
Inversion
principle.

294
Part C- Assessment and Evaluations
Assessment Procedures

Assessment Name Description

Quiz Quizzes are simple class tests with a duration from 20 minutes to
120 minutes. It can be online or offline, students need to prepare
for the quiz based on the instructed syllabus.

Assignment Type of home work assessment, students are given specific tasks
and instructed to complete them within a given period of time.

Practical Mostly related to laboratory works or by implementing in real

code in either exercise book or in programming IDE

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3hours exam for 72 marks. Students need
to answer at most 6 questions. Every question may include sub
questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Marks Test Assignment Quizzes External
(out of 20) (10) (5) (5) Participation in
Curricular/Co-
Curricular Activities
Remember 2
Understand 5
Apply 3
Analyze 2
Evaluate 4
Create 4

SEE-Semester End Examination (72 Marks)

Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

295
 Quiz Assignment Practical Final
(10%) (8%) (10%) (72%)

CLO1 1 0 1 1

CLO2 1 1 1 1

CLO3 1 1 1 1

CLO4 1 1 1 1

CLO5 1 1 1 1

Mapping of CLOs to PLOs

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 1 1 0 0 0 0 0 1 0

CLO2 1 1 0 0 0 0 0 1 1

CLO3 1 1 0 0 0 0 0 1 1

CLO4 1 1 0 0 0 0 0 1 1

CLO5 1 1 0 0 0 0 0 1 1

Part D- Resources

Textbooks
1. Gamma, Erich. Design patterns: elements of reusable object-oriented software. Pearson
Education, 1995.

296
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering
Course Outline: Information Control and Cyber Security
Part A- Introduction

I. Course code: CSE4121

II. Credit: 3

1. Course Summary

The accelerated expansion of security issues in computing products means students need to
learn the basics of information security, in both management and technical aspects. Students
must understand various types of security incidents and attacks, and learn methods to prevent,
detect and react to incidents and attacks. Students also need to learn the basics of application of
cryptography which are one of the key technologies to implement security functions.

2. Course Objectives

1. Explain various Information security threats and controls for it

2. Analyze security incidents and design countermeasures
3. Apply information security incident response
4. Implement the algorithms of common key cryptography and public key cryptography
5. Evaluate the mechanism to protect confidentiality and completeness of data

3. Course Learning Outcomes

CLO1. Articulate the concepts of Information security

CLO2. Detect the security threats in cyber spaces
CLO3. Detect the security threats in devices
CLO4. Evaluate risk managements of the systems
CLO5. Employ security preserving solutions in the information system

297
Part B- Lesson Plan
Course Details Learning plan

Timeline Topics /contents Learning Mapped Teaching Assessment

Outcomes CLOs Strategies Strategies

Week 1 Information Security, Examples Understand the CLO1 Lecture Quiz

of Information Security Incidents, goal and scope of
Information Security this course
Management through several
examples of
security
incidents.

Week 2 1. The three concepts of Learn the three CLO1, Lecture Quiz
Information Security concepts of CLO2
(Confidentiality, Integrity, information Exercise Assignment
Availability) security and other Demonstration Practical
basic concepts. Exam
2. Basic terminologies in
Information Security
3. Human Aspect of Information
Security
4. Social Engineering

Week 3 1. Attacks to Server Systems Explain Security CLO1 Lecture Quiz

connected to the Internet and Attacks for
countermeasures Server systems Exercise Assignment
and discuss Demonstration Practical
2. Attacks to Web Servers and counter measure
countermeasure Exam
for attacks
3. Denial of Service Attack
4. Attacks to Network Systems

Week 4, 1. Attacks for Personal Computers Explain CLO3 Lecture Quiz

5 and Smartphones, and Information
countermeasure Security for Exercise Assignment
Client devices Demonstration Practical
2. How the malicious software
intrude the device Exam

3. What the malicious software

does to the system

298
 4. Stolen and Lost Devices

Week 6 1. What is Risk Management Learn Risk CLO1 Lecture Quiz

process Management
process for Exercise Assignment
2. Identifying Information Assets Information Demonstration Practical
3. Identifying Security Risk and Systems Exam
evaluation
4. Risk Treatment

Week 7, 1. Information Security Learn how an CLO1, Lecture Quiz

8,9 Governance organization CLO2,
manages security CLO5 Exercise Assignment
2. Information Security risk, including,
Management System (ISMS) Demonstration Practical
establishing Exam
3. Information Security Policy, policy, building
Standards and Procedures organization and
internal rules.
4. Information Security
Evaluation

Week 10 1. What is Security Incident Learn CLO5 Lecture Quiz

response organization to
handle security Exercise Assignment
2. Computer Security Incident incidents and
response team Demonstration Practical
how to react to Exam
3. Incident response exercise security incidents
through
exercise

Week 11 1. Requirements for Secure CLO4 Lecture Quiz

Communication Learn
Exercise Assignment
2. What is Cryptography? about basic
Demonstration Practical
concept of
3. Classic Cryptography Exam
cryptography
4. Modern Cryptography

Week 1. Common Key Cryptography Apply Common CLO1, Lecture Quiz

12, 13 algorithms: DES, Triple DES, Key CLO4
AES Cryptography Exercise Assignment

2. Encryption modes Demonstration Practical

Exam
3. Exercise on Common Key
Cryptography

299
Week 14 Apply Public CLO3 Lecture Quiz
1. Exercise of Public Key Key
Cryptography Cryptography and Exercise Assignment
Hybrid Demonstration Practical
2. Exercise of Hybrid encryption
encryption. Exam

Part C- Assessment and Evaluations

Assessment Procedures

Assessment Name Description

Quiz Quizzes are simple class tests with a duration from 20 minutes to
120 minutes. It can be online or offline, students need to prepare
for the quiz based on the instructed syllabus.

Assignment Type of home work assessment, students are given specific tasks
and instructed to complete them within a given period of time.

Practical Mostly related to laboratory works or by implementing in real

code in either exercise book or in programming IDE

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3hours exam for 72 marks. Students need
to answer at most 6 questions. Every question may include sub
questions

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Test Assignment Quizzes External Participation
Marks (out of 20) (10) (5) (5) in Curricular/Co-
Curricular Activities
Remember 2
Understand 5
Apply 3
Analyze 2
Evaluate 4
Create 4
SEE-Semester End Examination (72 Marks)
Bloom’s Category Test
Remember 05
Understand 15

300
Apply 20
Analyze 10
Evaluate 10
Create 12

Quiz Assignment Practical Final

(10%) (8%) (10%) (72%)

CLO1 1 0 1 1

CLO2 1 1 1 1

CLO3 1 1 1 1

CLO4 1 1 1 1

CLO5 1 1 1 1

Mapping of CLOs to PLOs

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 1 1 0 0 0 0 0 1 0

CLO2 1 1 0 0 0 0 0 1 1

CLO3 1 1 0 0 0 0 0 1 1

CLO4 1 1 0 0 0 0 0 1 1

CLO5 1 1 0 0 0 0 0 1 1

Part D- Resources
Textbooks
1. Teach yourself C by Herbert Schildt
2. C: The Complete Reference by Herbert Schildt
Reference Books
1. Computer fundamentals and programming by Reema Thareja

301
2. C in a Nutshell: The Definitive Reference by Peter Prinz
3. Pointer in C Y. Kanitkar
4. Let us C by Y. Kanitkar
5. The C programming language by Kernighan & Ritchie

302
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Fault Tolerant Analysis

Part A- Introduction

I. Course code: CSE4123

II. Credit: 3

1. Course Summary

Fault-tolerant systems are used in applications that require high dependability, such as safety-
critical control systems in vehicles and airplanes, or business-critical systems for e-commerce,
automatic teller machines and financial transactions. This is an introductory course that covers
basic techniques for design and analysis of fault-tolerant systems, as well as project
management and development processes for safety-critical systems. The course covers
techniques for tolerating hardware and software faults, analysis of fault-tolerant systems,
project management and development processes for safety-critical systems.

2. Course Objectives

1. Learn the basics of fault-tolerance in a computer system

2. Devise the attributes of fault tolerance
3. Identify different systems to examine
4. Learn the designs of fault tolerance

3. Course Learning Outcomes

CLO1. Adopt the basics of Fault Tolerant System (FLS)

CLO2. Examine the attributes of FLS
CLO3. Explore the countables of FLS
CLO4. Design fault tolerances of the systems

303
Part B- Lesson Plan
Course Details Learning plan

Timeli Topics /contents Learning Mappe Teaching Assessmen

ne Outcomes d Strategies t Strategies
CLOs

Week Definition of fault tolerance, Understand the CLO1 Lecture Quiz

1 Redundancy, Applications of fault- fault tolerance Assignmen
tolerance, Fundamentals of dependability basics and t
applications Exam

Week Reliability, availability, safety, Understand fault CLO2 Lecture Quiz

2, 3, 4 Impairments: faults, errors and failures, tolerant system Exercise Assignmen
Means: fault prevention, removal and attributes like Demonstrat t
forecasting reliability, safety, ion Project
errors etc Task
Exam

Week Common measures: failures rate, mean Ability to design CLO3 Lecture Quiz
5, 6 time to failure, mean time to repair, etc. and develop Exercise Assignmen
Reliability block diagrams, Markov dependable Demonstrat t
processes systems for ion Exam
mission critical
applications

Week Canonical and Resilient Structures; Ability to know CLO1 Lecture Quiz
7, 8 Reliability Evaluation Techniques and about the faults of CLO2 Exercise Exam
Models; Processor-level Fault Tolerance; various systems Demonstrat
Byzantine Failures and Agreements. ion

Week Error Detection/Correction Codes Ability to know CLO3 Lecture Quiz

9, 10, (Hamming, Parity, Checksum, Berger, about different Exercise Exam
11 Cyclic, Arithmetic); Encoding/ Decoding types of codes Demonstrat
circuits; Resilient Disk Systems (RAID) ion
Various checkpoints and shared memory
systems.

Week Fault tolerant circuit design: Apply Fault CLO4 Lecture Project
12,13 Adder, subtractor, multiplicator etc. Tolerant in Exercise Exam
Defect-tolerance in VLSI Designs; Fault various design Demonstrat
Detection in Cryptographic Systems. ion

304
Part C- Assessment and Evaluations
Assessment Procedures

Assessment Name Description

Quiz Quizzes are simple class tests with a duration from 20 minutes to
120 minutes. It can be online or offline, students need to prepare
for the quiz based on the instructed syllabus.

Assignment Type of home work assessment, students are given specific tasks
and instructed to complete them within a given period of time.

Project Evaluate the systems using gained knowledge from the course

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3hours exam for 72 marks. Students need
to answer at most 6 questions. Every question may include sub
questions

Mapping of CLOs to Assessment

Participation Quiz Assignme Project Final

nt
(8%) (5%) (10%) (72%)
(5%)

CLO1 1 1 0 1 1

CLO2 1 1 1 1 1

CLO3 1 1 1 1 1

CLO4 1 1 1 1 1

305
Mapping of CLOs to PLOs

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Test Assignment Quizzes External Participation
Marks (out of 20) (10) (5) (5) in Curricular/Co-
Curricular Activities
Remember 2
Understand 5
Apply 3
Analyze 2
Evaluate 4
Create 4
SEE-Semester End Examination (72 Marks)
Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 0 1 0 0 0 0 0 1 0

CLO2 0 1 0 0 0 0 0 1 0

CLO3 0 1 0 0 0 0 0 1 0

CLO4 0 1 0 0 0 0 0 1 0

Part D- Resources
Textbooks
1. Fault-Tolerant Systems by Israel Koren
2. Fault-Tolerant Design by Elena Dubrova
Reference Books
1. Reliability of Computer Systems and Networks: Fault Tolerance, Analysis, and Design by Martin
L. Shooman

306
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Introduction to DNA Computing

Part A- Introduction

I. Course code: CSE4125

II. Credit: 3

1. Course Summary

This course is designed to introduce bioinformatics tools and analysis methods. Upon
completion of the course, students should be more comfortable working with the vast amounts
of biomedical and genomic data and online tools that will be relevant to their work in future.

2. Course Objectives

1. Define computational genomics and phylogenetics concepts.

2. Apply common bioinformatics tools and techniques effectively.
3. Implement basic algorithms such as sequence alignment.
4. Perform independent genome comparisons and assemblies using gained knowledge.
5. Evaluate on your own the promise and challenges for computing on biological datasets.

3. Course Learning Outcomes

CLO1. Introduce basic bioinformatics

CLO2. Discover chain and sequences
CLO3. Perform genome comparison
CLO4. Validate genome assembly
Part B- Lesson Plan
Course Details Learning plan

Timeline Topics /contents Learning Mapped CLOs Teaching Assessment

Outcomes Strategies Strategies

Week 1 DNA, genes and CLO1 Lecture Quiz

the genome. Explain

307
 introductory Assignment
concepts of
Exam
bioinformatics

Week 2 Sequence CLO2 Lecture Quiz

statistics. Knowledge about
Sequence statistics Exercise Assignment
Demonstration Project Task
Exam

Week 3, 4 Sequence CLO2 Lecture Quiz

alignment. Implement basic
algorithms on Exercise Assignment
Sequence Demonstration Exam
alignment

Week 5 Variation and CLO2 Lecture Quiz

natural selection Learn about
variation and Exercise Exam
natural selection Demonstration

Week 6 Hidden Markov CLO2 Lecture Quiz

Models Learn and apply
Hidden Markov Exercise Exam
Models Demonstration

Week 7, 8 Ab initio gene Learn gene finding CLO3 Lecture Quiz

finding
Exercise Exam
Demonstration

Week 9, Whole genome Perform CLO3 Lecture Quiz

10 comparisons independent
genome Exercise Exam
comparisons and Demonstration
assemblies using
gained knowledge

Week 11, Genome assembly Learn about CLO4 Lecture Quiz

12 and validation Genome assembly
and validation Exercise Exam
Demonstration

308
Week 13, Phylogenetic Define CLO3 Lecture Quiz
14 analysis phylogenetics
concepts Exercise Exam
Demonstration

Part C- Assessment and Evaluations

Assessment Procedures

Assessment Name Description

Quiz Quizzes are simple class tests with a duration from 20 minutes to
120 minutes. It can be online or offline, students need to prepare
for the quiz based on the instructed syllabus.

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3hours exam for 72 marks. Students need
to answer at most 6 questions. Every question may include sub
questions

Mapping of CLOs to Assessment

Participation Quiz Final

(8%) (20%) (72%)

CLO1 1 1 1

CLO2 1 1 1

CLO3 1 1 1

CLO4 1 1 1

Mapping of CLOs to PLOs

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Test Assignment Quizzes External Participation
Marks (out of 20) (10) (5) (5) in Curricular/Co-
Curricular Activities
Remember 2
Understand 5
Apply 3

309
Analyze 2
Evaluate 4
Create 4
SEE-Semester End Examination (72 Marks)
Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 0 1 0 0 0 0 0 1 0

CLO2 0 1 0 0 0 0 0 1 0

CLO3 0 1 0 0 0 0 0 1 0

CLO4 0 1 0 0 0 0 0 1 0

Part D- Resources
Textbooks

1. Statistical Methods in Bioinformatics by W. Ewens and G. Grant

2. Neural Networks and Genome Informatics by C.H. Wu

Reference Books
1. Bioinformatics; The Machine Learning Approach by Pierre Baldi and SÿrenBrunak

310
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering
Course Outline: Software Project Management and Maintenance
Part A- Introduction

I. Course code: CSE4127

II. Credit: 3

1. Course Summary

The course provides an in depth examination of project management principles and modern
software project management practices. Methods for managing and optimizing the software
development process are discussed along with techniques for performing each phase of the
systems development lifecycle. Portfolio management and the use and application of software
project management tools are also discussed.

2. Course Objectives

1. Understand the effectively strategies of testing, the methods and technologies of software
testing;
2. Design test plan and test cases;
3. Do automatic testing;
4. Establish a testing group and manage the whole testing project;
5. Clearly and correctly report the software defectives;
6. Asses the software product correctly;
7. Distinguish relationship between the software testing and the quality assurance.

3. Course Learning Outcomes

CLO1. Devise the basics of Project Management (PM)

CLO2. Develop project management
CLO3. Assess risk of projects
CLO4. Manage delivery of the system

311
 Part B- Lesson Plan
Course Details Learning plan

Timeline Topics /contents Learning Outcomes Mapped Teaching Assessment

CLOs Strategies Strategies

Week 1 Introduction of software project CLO1 Lecture Quiz

management Learn basics of Exam
project management Project

Week 2, 3 Business Case Development, CLO1 Lecture Quiz

Project Initiation and Process Learn project Exercise Exam
Management development life Demonstrat Project
cycle ion

Week 4 Software Project CLO2 Lecture Quiz

Management Methodology and Implement basic Exercise Exam
planning algorithms on Demonstrat Project
Sequence alignment ion

Week 5, 6 Work Activities and the CLO2 Lecture Quiz

Project Schedule and estimation Design schedule Exercise Exam
Demonstrat Project
ion

Week 7, 8 Project risk assessment CLO3 Lecture Quiz

Build risk matrix Exercise Exam
Demonstrat Project
ion

Week 9, 10, Project release and maintenance Learn delivery CLO4 Lecture Quiz
11 Exercise Exam
Demonstrat Project
ion

Week 12, Change request management Assess middleware CLO2 Lecture Quiz
13, 14 changes Exercise Exam
Demonstrat Project
ion

312
Part C- Assessment and Evaluations
Assessment Procedures

Assessment Name Description

Quiz Quizzes are simple class tests with a duration from 20 minutes to
120 minutes. It can be online or offline, students need to prepare
for the quiz based on the instructed syllabus.

Project On-hand exercise to learn PM by developing a full phase project

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3hours exam for 72 marks. Students need
to answer at most 6 questions. Every question may include sub
questions

Mapping of CLOs to Assessment

Participation Quiz Project Final

(8%) (10%) (10) (72%)

CLO1 1 1 1 1

CLO2 1 1 1 1

CLO3 1 1 1 1

CLO4 1 1 1 1

Mapping of CLOs to PLOs

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Test Assignment Quizzes External Participation
Marks (out of 20) (10) (5) (5) in Curricular/Co-
Curricular Activities
Remember 2
Understand 5
Apply 3
Analyze 2
Evaluate 4
Create 4

313
SEE-Semester End Examination (72 Marks)
Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 0 1 0 1 0 1 1 0 1

CLO2 0 1 0 1 0 1 1 0 1

CLO3 0 1 0 1 0 1 1 0 1

CLO4 0 1 0 1 0 1 1 0 1

Part D- Resources
Textbooks

1. A Brief Guide to MS Project 2010 by Kathy Scwhalbe

2. PMP in Depth, 2nd Edition by Paul Sanghera
3. Microsoft Project Standard
Reference Books
1. Leadership: Theory and Practice 5th Edition by Peter Guy Northouse

314
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Distributed System and Cloud Computing

Part A- Introduction

I. Course code: CSE4129

II. Credit: 3

1. Course Summary

The syllabus below describes a recent offering of the course, but it may not be completely up
to date. For current details about this course, please contact the course coordinator. Course
coordinators are listed on the course listing for undergraduate courses and graduate courses.

2. Course Objectives

1. To give students a basic grounding in designing and implementing distributed and cloud
systems.
2. The global consensus and Paxos, and their application in building cloud systems
3. The advantages and disadvantages of using distributed NoSQL stores
4. The "CAP Theorem," and its implication for building highly available services
5. Roles of REST, Websockets and stream processing in cloud applications
6. Tools and principles of building distributed and cloud applications
7. Cloud support for batch processing, such as the Hadoop and Pig frameworks, and their use
with NoSQL data stores such as Cassandra.

3. Course Learning Outcomes

CLO1. Devise the basics of cloud computing and distributed process

CLO2. Learn architecture of cloud system
CLO3. Implement algorithms into cloud
CLO4. Examining cloud and distributed database

315
Part B- Lesson Plan
Course Details Learning plan

Timeline Topics /contents Learning Outcomes Mapped Teaching Assessment

CLOs Strategies Strategies

Week 1, 2 Introduction to distributed CLO1 Lecture Quiz

systems and cloud Learn basics of Exercise Exam
computing. Cloud distributed system Demonstration Project
architectures: SaaS, PaaS, Handout
IaaS. End-to-end system
design. Networks and
protocol stacks.

Week 3, 4 Distributed file systems and CLO4 Lecture Quiz

cache consistency. NFS, Experimenting cloud Exercise Exam
AFS. Storage in the Cloud: file system Demonstration Project
Google/ Hadoop file system. Handout

Week 5 Web services and REST. CLO2 Lecture Quiz

Example: Amazon S3. The Understanding Exercise Exam
JAX-RS API. Persistent requests Demonstration Project
cloud services. Failure Handout
models and failure detectors.

Week 6, Batch cloud computing: map- CLO2 Lecture Quiz

7, 8 reduce and Hadoop. Domain- Implement cloud Exercise Exam
specific languages for cloud data processing Demonstration Project
data processing: Pig and Handout
Hive.

Week 9, Transactions. Atomic CLO3 Lecture Quiz

10, 11 commitment protocols: 2PC Executing CAP Exercise Exam
and 3PC, Highly available theorem Demonstration Project
services. Replicated services Handout
and quorum consensus. The
CAP Theorem.

Week 12, NoSQL data stores. Table- Discover NoSQL CLO4 Lecture Quiz
13, 14 based (Google BigTable), Exercise Exam
key-based (Amazon Demonstration Project
Dynamo), and Cassandra. Handout
The Hector API. Query
processing
with Map-reduce.

316
Part C- Assessment and Evaluations
Assessment Procedures

Assessment Name Description

Quiz Quizzes are simple class tests with a duration from 20 minutes to
120 minutes. It can be online or offline, students need to prepare
for the quiz based on the instructed syllabus.

Project On-hand exercise to learn PM by developing a full phase project

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3hours exam for 72 marks. Students need
to answer at most 6 questions. Every question may include sub
questions

Mapping of CLOs to Assessment

Participation Quiz Project Final

(8%) (10%) (10) (72%)

CLO1 1 1 1 1

CLO2 1 1 1 1

CLO3 1 1 1 1

CLO4 1 1 1 1

Mapping of CLOs to PLOs

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Test Assignment Quizzes External Participation in
Marks (out of 20) (10) (5) (5) Curricular/Co-Curricular
Activities
Remember 2
Understand 5
Apply 3
Analyze 2
Evaluate 4
Create 4

317
SEE-Semester End Examination (72 Marks)
Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 1 1 0 0 1 0 1 0 1

CLO2 1 1 0 0 1 0 1 0 1

CLO3 1 1 0 0 1 0 1 0 1

CLO4 1 1 0 0 1 0 1 0 1

Part D- Resources
Textbooks

1. Distributed and Cloud Computing From Parallel Processing to the Internet of Things by
Kai Hwang, Jack Dongarra, Geoffrey Fox
2. Cloud Computing: Principles and Paradigms by Rajkumar Buyya, James Broberg,
Andrzej M. Goscinski
3. Distributed Computing: Principles, Algorithms, and Systems by Ajay D. Kshemkalyani
and Mukesh Singhal
4. Distributed Computing: Fundamentals, Simulations and Advanced Topics by Hagit
Attiya and Jennifer Welch
Reference Books
1. Distributed Algorithms by Nancy Lynch
2. Cloud Computing Bible by Barrie Sosinsky
3. Cloud Computing: Principles, Systems and Applications by Nikos Antonopoulos, Lee Gillam

318
 Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Parallel and Vector Computing

Part A- Introduction

I. Course code: CSE4131

II. Credit: 3

1. Course Summary

To understand the architectures for parallel processing and to learn the concepts of
pipelining and multithreading

2. Course Objectives

1. Introduce to the basic concepts of parallel processing

2. Multithread program and their applications
3. Instructions and their properties
4. introduce students to the fundamentals of vector and tensor algebra
5. Vector computation and their advantages over traditional programs
6. Develop algorithms of parallel processing

3. Course Learning Outcomes

CLO1. To understand the architectures for parallel processing.

CLO2. To learn the concepts of parallelism and Data Flow Machine
CLO3. Understanding the concepts of instruction level of parallelism
CLO4. Understanding the parallel algorithms

319
Part B- Lesson Plan
Course Details Learning plan

Timeline Topics /contents Learning Mapped CLOs Teaching Assessment

Outcomes Strategies Strategies

Week 1, 2 Parallel computer models- CLO1 Lecture Quiz

the state of computing, Learn basics of
Multiprocessors and parallel processing Exercise Exam
multicomputers and Demonstration Project
Multivectors and SIMD
computers, PRAM and
VLSI models,
Architecture development
tracks, Program and
network properties.

Week 3, Conditions of parallelism, CLO2 Lecture Quiz

4, 5 Program partitioning and Preparing parallel
scheduling, Program flow system Exercise Exam
mechanisms, system Demonstration Project
interconnect architectures.
Principles of scalable
performance, performance
metrics and Measures,
Data Flow Machine
Language- Architecture of
Data Flow Machines.

Week 6, 7 Processor and memory CLO2 Lecture Quiz

hierarchy- advanced Understanding the
processor technology, vector memory Exercise Exam
superscalar and vector Demonstration Project
processors, memory
hierarchy technology,
virtual memory
technology, bus cache and
shared memory,
backplane bus systems,
cache memory
organizations, shared
memory
Organizations,sequential
and weak consistency
models.

320
Week 8, Pipelining in processing CLO3 Lecture Quiz
9, 10 elements- delays in Design instruction
Pipeline execution- Exercise Exam
difficulties in Demonstration Project
PipeliningSuperscalar
Processors- Vector
Processor _ Very Long
Instruction Word
Processor (VLIW)-
Commercial Processor-
Power PC 620 RISC
Processor- Two
Instruction Superscalar
RISCProcessor-
Multithreaded Processors-
Future Processor
Architecture- Trace
Processor,
MultiscalarProcessor,
Superflow Architecture.

Week 11, Classification of Parallel CLO4 Lecture Quiz

12 Algorithms: Synchronized Simulating
and Asynchronized parallel algorithms Exercise Exam
parallel Demonstration Project
algorithms,Performance of
Parallel algorithms-
Elementary parallel
algorithms: Searching,
Sorting, Matrix
Operations

Week 13, Vector in three non- Learn tensor and CLO3 Lecture Quiz
14 coplanar directions, vector vector analysis
in two non-coplanar Exercise Exam
directions, magnitude of Demonstration Project
vector, addition and
subtraction of vectors,
scalar multiplication and
projection, Tensor
Analysis

321
Part C- Assessment and Evaluations
Assessment Procedures

Assessment Name Description

Quiz Quizzes are simple class tests with a duration from 20 minutes to
120 minutes. It can be online or offline, students need to prepare
for the quiz based on the instructed syllabus.

Project On-hand exercise to learn PM by developing a full phase project

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3hours exam for 72 marks. Students need
to answer at most 6 questions. Every question may include sub
questions

Mapping of CLOs to Assessment

Participation Quiz Project Final

(8%) (10%) (10) (72%)

CLO1 1 1 1 1

CLO2 1 1 1 1

CLO3 1 1 1 1

CLO4 1 1 1 1

Mapping of CLOs to PLOs

Bloom’s Category Test Assignment Quizzes External Participation in

Marks (out of 20) (10) (5) (5) Curricular/Co-Curricular
Activities
Remember 2
Understand 5
Apply 3
Analyze 2
Evaluate 4
Create 4

322
CIE- Continuous Internal Evaluation (28 Marks):
SEE-Semester End Examination (72 Marks)
Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 1 1 0 0 0 0 0 1 1

CLO2 1 1 0 0 0 0 0 1 1

CLO3 1 1 0 0 0 0 0 1 1

CLO4 1 1 0 0 0 0 0 1 1

Part D- Resources
Textbooks

1. Advanced Computer Architecture by Kai Hwang Tata

2. Computer Architecture and Parallel Processing by Kai Hwang and FA Briggs
3. Advanced Engineering Mathematics by Palgrave Macmillan

Reference Books
1. Advanced Vector Analysis with Application to Mathematical Physics by Weatherburn C. E

323
 Jashore University of Science and Technology

Faculty of Science and Engineering

Department of Computer Science and Engineering

Course Outline: Cryptography

Part A- Introduction

I.Course code: CSE 4133

II.Credit: 3

1.Course Summary

Security mechanism is designed to detect, prevent or recover from a security attack and the
security service enhances the security of data processing systems and information transfers.
A security service makes use of one or more security mechanisms. Threat analysis is a
process where all possible threats to a system are identified. It is an important aid for
defining the security policy. Security policy is a set of rules stating what is permitted and
what is not permitted in a system during normal operation. It is written in general terms
and describes the security requirements for a system. Security mechanisms implement
functions that prevent, detect and respond to recovery from security attacks. Cryptography
underlies many security mechanisms. At the end of each chapter, the assignment is
compulsory to make students involved to use knowledge of this course to implement
programs and solve practical problems which they will use for their research study in the
future.

2.Course Objectives

1. The objective of this course is to give students the idea of Information Security and
its components.
2. Analyze security incidents and design countermeasures.
3. Apply information security incident response
4. Implement the algorithms of Common Key cryptography and Public Key
cryptography.
5. Evaluate the mechanism to protect confidentiality and completeness of data.

324
 3.Course Learning Outcomes

CLO1. Understand internet, information security, network security,

vulnerability, threat, brute-force attack, stream cipher, block cipher, DES, AES,
Merkle-Hellman Cryptosystem, RSA cryptosystem, El Gamal Algorithm,
Cryptographic Hash Function, MD5 algorithm, Message Authentication Code (MAC),
key management, authentication application, Kerberos, network access control, cloud
computing.
CLO2. Analyze attack, control, services, mechanisms, security services,
Cryptanalysis, symmetric cryptosystem, asymmetric cryptosystem, signature
verification, properties and application of hash function, types of MACs, HMAC,
wireless security and pretty good privacy.
CLO3. Remember computer security, internet security, security goals, how to
make a system trustworthy, distribution of public keys, public key certificate and secret
key distribution.
CLO4. Apply cryptography, key management, Diffie-Hellman Key Exchange.
CLO5 Evaluate the security life cycle, digital signature.

Part B- Lesson Plan

Course Details Learning plan

Timeline Topics Learning Outcomes Mapped Teaching Assessment

/contents CLOs Strategies Strategies

Week 1 Introducti -acquire knowledge about CLO1, Lecture Quiz

on internet, security, CLO2,CLO
threatknow about different 3
types of controls, services,
mechanisms and
attackslearn about security
goals

325
Week 2, 3 Cryptogra -students will understand CLO1, Lecture, Quiz,
phy about cryptography in CLO2,
details CLO4 Exercise Assignment,

-acquire knowledge about Demonstr Exam

symmetric cryptography and ation
asymmetric cryptography
-Common Key
Cryptography algorithms:
DES, Triple DES, AES
- Encryption modes
-Exercise on Common Key
Cryptography
-Exercise of Public Key
Cryptography
-Exercise of Hybrid
encryption
-illustration on Diffie-
Hellman key exchange

326
Week 4, 5 Explain -Attacks to Server Systems CLO2 Lecture, Quiz,
Security connected to the Internet and
Attacks countermeasures Exercise Assignment,
for Server Demonstr Exam
systems -Attacks to Web Servers and
countermeasure ation
and
discuss -Denial of Service Attack
counter
measure -Attacks to Network
for attacks Systems

Explain -Attacks for Personal

Informati Computers and
on Smartphones, and
Security countermeasure
for Client -How the malicious software
devices intrudes the device
-What the malicious
software does to the system
-Stolen and Lost Devices

Week 6 Digital students will learn about CLO1, Lecture, Quiz,

Signature digital signature CLO2,
CLO5 Exercise Assignment,
-learn about signature
verification and encrypted Demonstr Exam
signature ation

-acquire knowledge about

the algorithm used in digital
signature

327
Week 7, 8 Hash -discuss on cryptographic CLO1, Lecture, Quiz,
Function hash function CLO2
Exercise Assignment,
-discuss on the properties
and application of hash Demonstr Exam
function ation

- students will understand

how to check integrity and
authenticity using has
function
-students will learn
cryptographic hash
algorithm

Week 9 Message -students will learn about CLO1, Lecture, Quiz

Authentic message authentication code CLO2
ation Exercise Assignment
Code -acquire knowledge about
how to check integrity and Demonstr Exam
(MAC) ation
authenticity using MAC
-students will know about
different types of MAC
including HMAC (Hash
function based MAC)

Week 10 User -understand remote user CLO2, Lecture, Quiz,

Authentic authentication principles CLO3
ation Exercise Assignment,
-students will know about
Kerberos, remote user Demonstr Exam
authentication using ation
symmetric encryption and
asymmetric encryption

328
Week 11, Network -student will know about CLO1, Lecture, Quiz,
12 Access network access control CLO2
Control Exercise Assignment,
and Cloud -acquire knowledge about
cloud computing and cloud Demonstr Exam
Security ation
security as a service
-learn about authentication
protocol

Week 13, Wireless -Understand wireless CLO1, Lecture, Quiz,

14 Network security, mobile device CLO2
Security, security and wireless LAN Exercise Assignment
Electronic security Demonstr Exam
Mail ation
Security -acquire knowledge about
Email security
-understand Pretty Good
Privacy (PGP)

Part C- Assessment and Evaluations

Assessment Procedures

Assessment Name Description

Quiz Quizzes are simple class tests with a duration from 20

minutes to 120 minutes. It can be online or offline, students
need to prepare for the quiz based on the instructed
syllabus.

Assignment Type of home work assessment, students are given specific

tasks and instructed to complete them within a given period
of time.

Attendance Student’s participation in the class lecture, quiz and exam

Exam Each course contains a final exam considering the complete

syllabus. It should be a 3hours exam for 72 marks. Students
need to answer at most 6 questions. Every question may

329
 include sub questions

CIE- Continuous Internal Evaluation (28 Marks):

Bloom’s Category Test Assignment Quizzes External Participation
Marks (out of 20) (10) (5) (5) in Curricular/Co-
Curricular Activities
Remember 2
Understand 5
Apply 3
Analyze 2
Evaluate 4
Create 4
SEE-Semester End Examination (72 Marks)
Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12
Mapping of CLOs to Assessment

Quiz Assignment Attendance Exam

(10%) (10%) (8%) (72%)

CLO1 0 1 1 1

CLO2 1 0 1 1

CLO3 1 1 1 1

CLO4 1 1 1 1

CLO5 1 1 1 1

Mapping of CLOs to PLOs

330
CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 1 1 1 0 0 0 0 1 0

CLO2 1 1 1 0 0 0 0 1 0

CLO3 1 1 1 0 0 0 0 1 0

CLO4 1 1 1 0 0 0 0 1 0

CLO5 1 1 1 0 0 0 0 1 0

Part D- Resources

Textbooks

1. William Stallings: Cryptography and Network Security, Principles and Practice

2. Charles P. Pfleeger: Security in Computing
3. Christof Paa and Jan Pelzl: To understand cryptography in depth

Reference Books
1. Dhillon: Managing Information System Security
2. Michael E. Whitman and Herbert J. Mattord: Principles of Information Security

331
 Part - D
Grading Policy
GradingScale, Grades, Grade Point Average:
Each course, irrespective of the credit hours attributed to it, will be graded at a scale of 4.00
(four). Initially the courses will be assessed in 100 to calculate percentage of marks obtained by
the students. Letter Grades and corresponding Grade Points are awarded to the students (B.Sc. )
in accordance with provision shown below in Table 1.
Table 1. The grading system consists of Letter Grading Point Average (GPA), Letter Grade,
corresponding Grade Point of JUST of Science and Technology.

Numerical Grade Letter Grade Grade Point

80% and above A+ 4.00
75% to less than 80% A 3.75
70% to less than 75% A- 3.50
65% to less than 70% B+ 3.25
60% to less than 65% B 3.00
55% to less than 60% B- 2.75
50% to less than 55% C+ 2.50
45% to less than 50% C 2.25
40% to less than 45% C- 2.00
Less than 40% F 0.00

*Source: Controller Section of JUST

1. GPA: Grade Point Average (GPA) is the weighted average of the grade points obtained
in all the courses completed by a student in asemester.
2. CGPA: Cumulative Grade Point Average (CGPA) will be calculated by the weighted
average of previous CGPA and currentGPA.
3. SGPA:Semester Grade Point Average (SGPA) is the weighted average of the grade
points obtained in all the courses completed by a student in a semester.
4. YGPA: Yearly Grade Point Average (YGPA) is the weighted average of the grade points
obtained in all the courses completed by a student in a year (1st and 2nd semesters).
5. F Grades: If a student obtains an 'F' grade his grade will not be counted for GPA and
s/he has to repeat the course. If the same course is not available then the Head of the
department will assign an equivalent course. An 'F' grade will be in his/her record
permanently and s/he will not be eligible for honors orDistinction.

332
Course Withdrawal
A student can withdraw a course by a written application to the Chairman of the department
through his/her Advisor on or before the last date of instruction. The Chairman of the department
will inform it to the Chairman of the Examination Committee and the Controller of
Examinations. The Controller of Examinations will send the revised registration list to the
department before the examination.

Withdrawal from a Semester

If a student is unable to complete the Semester Final Examination due to illness, accident or any
other valid reason etc., he/she may apply to the Controller of Examination through his/her
Chairman of the Department for total withdrawal from the semester within a week after the end
of the Semester Final Examination. However, he/she may choose not to withdraw any
laboratory/ sessional / design course if the grade obtained in such a course is 'D' or better and that
he/she has to indicate clearly in his/her withdrawal application. The withdrawal application must
be supported by a medical certificate from University Medical Officer. The Academic Council
will take final decision about such an application.

Retake:
(a)If a student obtains "F" grade(s) in theory course(s), this grade(s) will not be counted for
SGPA calculation and s/he can repeat the course(s), which will be termed as "RETAKE". When
the student passes the RETAKE course(s) with grade higher than or equal to "A-", s/he will be
awarded a grade of "A-". If s/he obtains grade(s) lower than "A-", s/he will be awarded her/his
obtained grade(s). This RETAKE course (theory course) will be conducted as per the rules.
If a student obtains ‘F’ Grade in one or more courses, he/she can participate in re-exam through
any of the following three systems:

i) retake with regular students by paying TK 2,000 per course

ii) Through special examination by paying TK 10,000 per course but the student
shall have to apply within one week of the publication of results

iii) Using special semester after the results of the Final Semester by paying TK
5,000 for a single course and Tk.15,000 for more than one course.

(b) If a student obtains “F” grade in Sessional/Practical course, s/he will apply for RETAKE of
that course to the Chairman of the concerned Department. The Chairman will take
recommendation from the Academic Committee of the Department. After recommendation of
those committees, the student will pay the required fees (TK 10,000/=) to the Bank (JUST
branch). The Chairman will forward all these documents to the Controller of Examinations for
course registration. Thus the student can appear for the sessional/practical examination. It is to be

333
mentioned that a student will have the opportunity to take “RETAKE” in sessional/practical
course only for two times in his/her academic tenure. Any student having "RETAKE" in theory
and/or sessional/practical will not be considered for "Distinction".

(c) “F” grade(s) will be mentioned in the transcript unless the "Retake" course(s) has been
passed. After passing "Retake" course(s), the indication of “F” grade(s) will be removed from the
previous transcripts and in the fresh transcript ‘R’ will not be included along with the obtained
grade(s) of that/those particular ‘Retake’ course(s).

Special Semester Examination (Incomplete course):

A special semester examination will be conducted for final year students only with RETAKE.
This will be a non-taught semester (Theory /Sessional/Practical courses). The Chairman may
allow a student to register for the SPECIAL SEMESTER credits. The office of the Controller of
Examinations will attach a list of names of the unsuccessful students along with their RETAKE
courses (from 1st year 1st semester to 4th year 2nd semester) during publishing the final result (i.e.
4th year 2nd semester). At the same time RETAKE course(s) registration notice will be announced
by the office of the Controller of Examinations. This course(s) registration must be completed
within a week after publishing the final result (4 th year 2nd semester) and the examination of
RETAKE courses should be started within 4 weeks. Once the examination begins, the
examination will be completed within 25 days. The class attendance marks of 8% will be carried
over from previously attended theory courses. On the basis of application of the student(s), the
Academic Committee may consider him/her to take part to improve marks of Class Test /
Assignment / Spot Test / Quiz etc. The special semester examination will carry the remaining
72% marks. The student will have to pay the fee as follows:

For theory course : TK 5,000 for onecourse

For Sessional/Practical course : TK 10,000 for each course

It is to be mentioned that a student will have the opportunity to appear in the Special
Semester for subsequent two times in his/her academic tenure i.e. within 12
semesters from his/her first admission (first year first semester).

(e)ExaminationCommittee for the Special Semester Examination: The existing 4th year
Examination Committee will conduct the Special Semester Examination. In case of any vacancy,
absence or inability on the part of any one of the members of the Examination Committee, the
examination work shall not be invalidated. The Examination Committee will act according to the
instructions mentioned in Sub-section 3.4.6 of this ordinance.

334
 CURRICULUM
of
Bachelor of Science in Computer Science and Engineering
[B.Sc (Engineering) in CSE]
For Session 2020-21 and onwards
Department of Computer Science and Engineering
Faculty of Engineering and Technology
DEPARTMENT OF

UNDERGRADUATE PROGRAM

JASHORE UNIVERSITY OF SCIENCE AND TECHNOLOGY

JASHORE-7408

Contact
Department of Computer Science and Engineering
Jashore University of Science and Technology
Jashore-7408, Bangladesh

Mobile: +8801709818108
Fax: 02 0421 42012
Phone (office): +88 0421 62020 Ext. 215
E-mail: [email protected]
Web: https://cse.just.edu.bd/