Just Cse Syllabus
Just Cse Syllabus
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]
Associate Professor
Dr. Md. Asif Nashiry
BSc and MSc (IU), PhD (ULeth, Canada)
Email: [email protected]
Assistant Professor
Md. Ashraful Islam (on study leave)
BSc Engg. and MSc Engg. (IU)
Email: [email protected]
1
Monishanker Halder
BSc Engg. and MSc Engg. in CSE (JUST)
Email: [email protected]
Md. Shafiuzzaman
BSc and MSc in Software Engineering (DU)
Email: [email protected]
Lecturer
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.
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.
5
BSc in CSE Curriculum(OBE)
Jashore University of Science and Technology
Department of Computer Science and Engineering
Part A- Introduction
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.
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
M2 Enable the graduates to get their way into higher studies and research across
the globe.
Show abilities in the analysis of complex problems and the synthesis of solutions
PEO3
to those problems.
Apply ethical and social aspects of modern computing technology to the design,
PEO6
development and usage of computing artifacts.
7
Program Learning Outcome (PLO)
Generic Skills
8
GS1 Problem-Solving and Innovation
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
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
11
Part B- Structure
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
Mathematics 12 7%
Viva Voce 3 2%
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
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
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
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
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
18
Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering
Part A- Introduction
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
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
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 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
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
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
Part A- Introduction
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
23
Part B- Lesson Plan
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
Assessment Procedures
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
Understand 10
Apply 25
Analyze 10
Evaluate 5
Create 5
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
Part A- Introduction
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.
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 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 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 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
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
Part A- Introduction
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.
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 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 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
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
34
Create 5
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
35
Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering
Part A- Introduction
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.
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 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 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
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
Understand 10
38
Apply 25
Analyze 10
Evaluate 5
Create 5
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
39
Course Outline: Differential and Integral Calculus
Part A- Introduction
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.
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 Finding Area between Curves, Learn tree in CLO4 Lecture Quiz
12 Volumes, Volumes by graph Exercise Assignment
Cylindrical Shells, Exam
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
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
Part A- Introduction
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.
44
dimensional lattices; Defects
in solid; Semiconductors:
Structures of Si, Ge, B, N, P,
In. Types of Semiconductor,
Electronic and band theory
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.
45
Effects of Radiation.
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.
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
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
47
Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering
Part A- Introduction
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.
48
Part B- Lesson Plan
Week 9, Tense form, Phrase & Learn Tense CLO 2 Lecture, Quiz
10 Clause, Making Demonstration, Participation
Questions, Gerund and handouts Exam
Participle,
49
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.
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
Understand 10
Apply 25
Analyze 10
Evaluate 5
Create 5
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
51
Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering
Part A- Introduction
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
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 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
53
socialist movements, rural
sociology.
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.
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
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
Part A- Introduction
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. 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.
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;
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.
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
58
(5) Activities
Remember 2
Understand 5
Apply 3
Analyze 2
Evaluate 4
Create 4
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
Part A- Introduction
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
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
62
linked lists and
dynamic storage
management,
generalized lists,
garbage collection and
compaction.
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.
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
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
Understand 10
Apply 25
Analyze 10
Evaluate 5
Create 5
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
Part A- Introduction
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
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
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.
69
Part C- Assessment and Evaluations
Assessment Procedures
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
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
Part A- Introduction
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
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
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 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
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.
Understand 10
Apply 25
75
Analyze 10
Evaluate 5
Create 5
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
Part A- Introduction
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
77
Part B- Lesson Plan
78
Part C- Assessment and Evaluations
Assessment Procedures
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.
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
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
81
Part B- Lesson Plan
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.
82
diode and voltage
regulators.
83
OPAMPS, gain,
input and output
impedance.
84
Part C- Assessment and Evaluations
Assessment Procedures
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.
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
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
87
Part B- Lesson Plan
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.
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.
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.
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
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
Course Learning Outcomes: After the successful completion of the course, students will be able to:
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
93
Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering
Part A- Introduction
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.
94
Part B- Lesson Plan
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
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
96
Part C- Assessment and Evaluations
Assessment Procedures
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.
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.
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.
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.
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
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.
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.
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.
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.
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.
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.
Assignment Type of home work assessment, students are given specific tasks
and instructed to complete them within a given period of time.
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.
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
108
3. Course Learning Outcomes
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
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.
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.
111
Understand 5
Apply 3
Analyze 2
Evaluate 4
Create 4
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
Part A- Introduction
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.
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
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
Assessment Procedures
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.
115
Analyze 10
Evaluate 10
Create 12
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
Part A- Introduction
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.
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
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.
Assessment Procedures
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
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
Part A- Introduction
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.
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
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.
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.
Assessment Procedures
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
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
II.Credit: 2
1.Course Summary
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.
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
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.
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.
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
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.
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
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
.
135
Part C- Assessment and Evaluations
Assessment Procedures
Assessment Name Description
136
Evaluate 10
Create 12
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
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
138
Visual Studio,
Phpstorm,
Eclipse etc.),
Giving view
to software
project
139
Generic classes, Static
classes, Static
constructors, Object
initialize
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
141
Take operators, Joins, nt
Query, Lambda
expressions.
Data Projection
Single result value,
Existing types,
Anonymous
types,Grouping
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.
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.
144
Create 5
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.
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.
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
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.
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.
149
Apply 20
Analyze 10
Evaluate 10
Create 12
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
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.
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
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
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
154
Apply 13
Analyze 2
Evaluate 4
Create 4
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
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.
156
Timeline Topics /contents Learning Outcomes Mapped Teaching Assess
CLOs Strategies ment
Strateg
ies
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
Assessment Procedures
158
SEE-Semester End Examination (72 Marks)
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
159
Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering
Part A- Introduction
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.
160
Part B- Lesson Plan
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
162
Apply 13
Analyze 2
Evaluate 4
Create 4
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
163
Part A- Introduction
I.Course code: CSE 2207
II.Credit: 3
1.Course Summary
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
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.
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.
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.
168
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 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
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.
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
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.
Assignment Type of home work assessment, students are given specific tasks
and instructed to complete them within a given period of time.
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
Part A- Introduction
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
174
Part B- Lesson Plan
175
Part C- Assessment and Evaluations
Assessment Procedures
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.
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
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.
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.
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.
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.
181
Part C- Assessment and Evaluations
Assessment Procedures
Mapping of CLOs to Assessment
CIE- Continuous Internal Evaluation (28 Marks):
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
Part A- Introduction
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.
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
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
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.
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
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
Part A- Introduction
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.
187
Part B- Lesson Plan
Course Details Learning plan
Timeline Topics /contents Learning Mappe Teaching Assessme
Outcomes d Strategies nt
CLOs Strategies
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
Assessment Procedures
189
Mapping of CLOs to Assessment
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
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
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
191
Part B- Lesson Plan
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.
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 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.
193
Course Details Learning plan
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.
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.
Part A- Introduction
I. Course code: CSE 3102
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
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 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.
197
replacement algorithms, of frames, Know about Short
Allocation of frames, demand segmentation Question
Demand Segmentation
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.
Assessment Procedures
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.
198
answer at most 6 questions. Every question may include sub
questions
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.
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.
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
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
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.
202
Understand 5 1 1
Apply 3 1 1 8
Analyze 2 1 1
Evaluate 4 1 1
Create 4 0 1
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
Part A- Introduction
III. Course code: CSE 3104
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.
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
204
Timeline Topics /contents Learning Outcomes Mapped Teaching Assessment
CLOs Strategies Strategies
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.
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
Reference Books
Part A- Introduction
II.Credit: 3
1.Course Summary
207
2.Course Objectives
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
208
Strategies
-Evolution of
computers
-ROM and RAM families
- Bus structure
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
210
Part C- Assessment and Evaluations
Assessment Procedures
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
211
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 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
Reference Books
212
Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering
Part A- Introduction
II.Credit: 1.5
1.Course Summary
2.Course Objectives
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
213
3.Course Learning Outcomes
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
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
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.
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
217
Evaluate 10
Create 12
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
Reference Books
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
219
Course Details Learning plan
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.
221
Assessment Procedures
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
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
Part A- Introduction
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
224
request, analyze three types of Exam
feasibility study
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 14 Managing the programming Plan testing and CLO 4 Lecture, Quiz
process, Developing delivery Demonstration Participation
documentation, Mitigation plan Exam
and post implementation
activities.
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.
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
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
Part A- Introduction
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
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
228
PSD to HTML Convert
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.
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
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
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
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
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 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 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
230
Part C- Assessment and Evaluations
Assessment Procedures
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
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
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
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
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 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.
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
Assessment Procedures
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
234
Create 4 0 1
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
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
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.
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
237
Assessment Procedures
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.
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
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.
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
240
structure and management.
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
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
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.
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.
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.
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
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.
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.
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.
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
Part A- Introduction
VII. Course code: CSE 3208
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
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
Control
in a Windows
250
by Using DataSets
Document
Content by Using GDI+
Crystal Reports
Applications
● .NET Assemblies
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.
251
Mapping of CLOs to Assessment
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.
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
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
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.
255
algorithms, Character
generation.
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
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
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.
259
algorithms, Character
generation.
260
Part C- Assessment and Evaluations
Assessment Procedures
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.
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
262
Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering
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
263
Part B- Lesson Plan
Course Details Learning plan
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
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.
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
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
Part A- Introduction
I. Course code: CSE 4104
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
267
Part B- Lesson Plan
Course Details Learning plan
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
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.
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
Part A- Introduction
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
271
Part B- Lesson Plan
Course Details Learning plan
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
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
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.
273
Apply 20
Analyze 10
Evaluate 10
Create 12
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
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
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.
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
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
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 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
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
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
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
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.
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
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
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 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
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
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
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
Part A- Introduction
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
286
3. Course Learning Outcomes
287
component reduction Exam
analysis, necessary
attribute subset
selection To become
familiar with
data
reduction
techniques
288
classifiers
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.
289
Evaluate 4
Create 4
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
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”
291
Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering
Part A- Introduction
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
292
Part B- Lesson Plan
Course Details Learning plan
293
Week 10 REFACTORING Design, CLO5 Lecture Quiz
CODE SMELL Implement
Introduction and Solve Exercise Assignment
Real-life Demonstration Practical Exam
Problems
Statements,
Speculative
Generality,
Oddball Solution,
Feature Envy,
Refused Bequest,
Black Sheep
and Train Wreck
294
Part C- Assessment and Evaluations
Assessment Procedures
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.
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
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
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
297
Part B- Lesson Plan
Course Details Learning plan
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
298
4. Stolen and Lost Devices
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
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.
300
Apply 20
Analyze 10
Evaluate 10
Create 12
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
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
Part A- Introduction
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
303
Part B- Lesson Plan
Course Details Learning plan
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 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
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
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
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
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
307
introductory Assignment
concepts of
Exam
bioinformatics
308
Week 13, Phylogenetic Define CLO3 Lecture Quiz
14 analysis phylogenetics
concepts Exercise Exam
Demonstration
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.
CLO1 1 1 1
CLO2 1 1 1
CLO3 1 1 1
CLO4 1 1 1
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
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
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.
311
Part B- Lesson Plan
Course Details Learning plan
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
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.
CLO1 1 1 1 1
CLO2 1 1 1 1
CLO3 1 1 1 1
CLO4 1 1 1 1
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
314
Jashore University of Science and Technology
Faculty of Science and Engineering
Department of Computer Science and Engineering
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.
315
Part B- Lesson Plan
Course Details Learning plan
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
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.
CLO1 1 1 1 1
CLO2 1 1 1 1
CLO3 1 1 1 1
CLO4 1 1 1 1
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
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
319
Part B- Lesson Plan
Course Details Learning plan
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 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
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.
CLO1 1 1 1 1
CLO2 1 1 1 1
CLO3 1 1 1 1
CLO4 1 1 1 1
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
Reference Books
1. Advanced Vector Analysis with Application to Mathematical Physics by Weatherburn C. E
323
Jashore University of Science and Technology
Part A- Introduction
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
325
Week 2, 3 Cryptogra -students will understand CLO1, Lecture, Quiz,
phy about cryptography in CLO2,
details CLO4 Exercise Assignment,
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
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
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
Assessment Procedures
329
include sub questions
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
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
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.
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.
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:
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).
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
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/