Part A-Introduction: JUST CSE '21-22 Syllabus of 12

Download as pdf or txt
Download as pdf or txt
You are on page 1of 43

JUST CSE '21-22

Syllabus of 12

Jashore University of Science and Technology


Faculty of Science and Engineering
Department of Computer Science and Engineering

Course Outline: Data Structures

Part A- Introduction

I. Course code: CSE 1201


II. Credit: 3

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

2.Course Objectives

1. Apply different data structures to problem solving


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

3.Course Learning Outcomes

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

Part B- Lesson Plan

Course Details Learning plan

Timeline Topics /contents Learning Mapped Teaching Assessment


Outcomes CLOs Strategies Strategies

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

Elements of Graphs and Construct CLO1 Lecture Quiz


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

Linked Lists: Construct CLO4 Lecture Quiz


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

Week 9 Extended binary trees: Construct CLO4 Lecture Quiz


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

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

Algorithms: Apply CLO2, Lecture Quiz


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

Part C- Assessment and Evaluations

Assessment Procedures

Assessment Description
Name

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

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

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

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

Mapping of CLOs to Assessment

CIE- Continuous Internal Evaluation (28 Marks):


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

SEE-Semester End Examination (72 Marks)


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

Mapping of CLOs to PLOs

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 1 0 0 0 0 1 0 0 0

CLO2 0 1 0 0 0 0 1 0 0

59
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. Theory and Problem of Data Structures by S. Lipschutz
2. Data Structure by E. Horowitz
Reference Books
1. The Art of Computer Programming, Vol. 1, Fundamental Algorithms by D. E. Knuth
2. The Art of Computer Programming, Vol. 2, Fundamental Algorithms by D. E. Knuth
3. The Art of Computer Programming, Vol. 3, Fundamental Algorithms by D. E. Knuth

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

Course Outline: Data Structures Lab

Part A- Introduction

I. Course code: CSE 1202

II. Credit: 1.5

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

2. Course Objectives

1. Apply different data structures to problem solving


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

3. Course Learning Outcomes

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

61
Part B- Lesson Plan

Course Details Learning plan

Timeline Topics /contents Learning Mapped Teaching Assessment


Outcomes CLOs Strategies Strategies

Stacks, Queues and Apply stacks, CLO1 Lecture Quiz


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

Elements of Graphs Construct graphs CLO1 Lecture Quiz


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

Linked Lists: Construct linked CLO4 Lecture Quiz


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

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

Week 9 Extended binary Construct and apply CLO4 Lecture Quiz


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

Sorting: Apply sorting CLO3 Lecture Quiz


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

Algorithms: Apply algorithmic CLO2, Lecture Quiz


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

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

Part C- Assessment and Evaluations


Assessment Procedures

Assessment Name Description

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

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

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


either exercise book or in programming IDE

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

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

SE- Lab Final Exam (60 marks)


Bloom’s Category Test
Remember 5

Understand 10

Apply 25

Analyze 10

Evaluate 5

Create 5

Mapping of CLOs to PLOs

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 1 0 0 0 0 1 0 0 0

CLO2 0 1 0 0 0 0 1 0 0

CLO3 0 0 1 0 0 0 0 1 1

CLO4 0 0 0 1 0 0 0 1 0

CLO5 0 0 0 0 1 0 0 0 1

65
Part D- Resources

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

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

Course Outline: Digital Logic Design

Part A- Introduction

I. Course code: CSE 1203

II. Credit: 3

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

2. Course Objectives

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

3. Course Learning Outcomes

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

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

Part B- Lesson Plan


Course Details Learning plan

Timeline Topics /contents Learning Outcomes Mapped CLOs Teaching Assessment


Strategies Strategies

Week 1 Number systems Explain number CLO1, CLO2 Lecture Quiz


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

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


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

Week 7 Arithmetic and data Determine decoder CLO3, Lecture Quiz


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

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

68
problems.

Week 11 Counters: Design synchronous CLO3, Lecture Quiz


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

Week 13 State minimization Explain state CLO3, CLO4 Lecture Quiz


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

69
Part C- Assessment and Evaluations

Assessment Procedures

Assessment Name Description

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

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

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


in either exercise book or in programming IDE

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

CIE- Continuous Internal Evaluation (28 Marks):


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

SEE-Semester End Examination (72 Marks)


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

70
Mapping of CLOs to PLOs

CLOs PLO1 PLO2 PLO3 PLO4 PLO5 PLO6 PLO7 PLO8 PLO9

CLO1 1 0 0 0 0 1 0 0 0

CLO2 0 1 0 0 0 0 1 0 0

CLO3 0 0 1 0 0 0 0 1 1

CLO4 0 0 0 1 0 0 0 1 0

Part D- Resources

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

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

Course Outline: Digital Logic Design Lab

Part A- Introduction

III. Course code: CSE 1204

IV. Credit: 1.5

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

5. Course Objectives

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

6. Course Learning Outcomes

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

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

art B- Lesson Plan

Course Details Learning plan

Timeline Topics /contents Learning Outcomes Mapped CLOs Teaching Assessment


Strategies Strategies

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

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

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

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

Week 11 Counters: Design synchronous and CLO3, Lecture Quiz


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

Synchronous and State and explain Mealy and


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

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

74
Part C- Assessment and Evaluations

Assessment Procedures

Assessment Name Description

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

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

Practical Mostly related to laboratory works or by implementing in real


code in either exercise book or in programming IDE

Exam Each course contains a final exam considering the complete


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

CIE- Continuous Internal Evaluation (40 Marks):


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

SE- Lab Final Exam (60 marks)


Bloom’s Category Test
Remember 5

Understand 10

Apply 25

75
Analyze 10

Evaluate 5

Create 5

Mapping of CLOs to PLOs

CLOs PLO10 PLO11 PLO12 PLO13 PLO14 PLO15 PLO16 PLO17 PLO18

CLO1 1 0 0 0 0 1 0 0 0

CLO2 0 1 0 0 0 0 1 0 0

CLO3 0 0 1 0 0 0 0 1 1

CLO4 0 0 0 1 0 0 0 1 0

Part D- Resources

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

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

Course Outline: Engineering Drawing

Part A- Introduction

V. Course code: CSE 1206

VI. Credit: 1

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

8. Course Objectives

1. Understand scaling of drawing different objects.


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

9. Course Learning Outcomes

CLO5. Ability to read basic engineering drawing.


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

77
Part B- Lesson Plan

Course Details Learning plan

Timeline Topics /contents Learning Mapped CLOs Teaching Assessment


Outcomes Strategies Strategies

Week 1- Familiarization with Apply scales CLO1 Lecture Quiz


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

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


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

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


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

78
Part C- Assessment and Evaluations

Assessment Procedures

Assessment Name Description

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

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

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


in either exercise book or in programming IDE

Exam Includes set of programming problems to solve within a timeline

CIE- Continuous Internal Evaluation (40 Marks):


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

Understand 10

Apply 25

Analyze 10

Evaluate 5

Create 5

79
Mapping of CLOs to PLOs

CLOs PLO19 PLO20 PLO21 PLO22 PLO23 PLO24 PLO25 PLO26 PLO27

CLO1 1 0 0 0 0 1 0 0 0

CLO2 0 1 0 0 0 0 1 0 0

CLO3 0 0 1 0 0 0 0 1 1

CLO4 0 0 0 1 0 0 0 1 0

Part D- Resources

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

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

Part A- Introduction

I. Course code: EEE 1201

II. Credit: 3

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

2. Course Objectives

1. To learn basic concepts about semiconductor physics.


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

3. Course Learning Outcomes

CLO1. learn basic concepts about semiconductor physics


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

81
Part B- Lesson Plan

Course Details Learning plan

Timeline Topics /contents Learning Outcomes Mapped CLOs Teaching Assessment


Strategies Strategies

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


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

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

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


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

82
regulators.

Week 9 Bipolar Draw and describe CLO3, Lecture Quiz


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

Week 11 Field effect Define and explain CLO3, Lecture Quiz


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

83
impedance.

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


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

84
Part C- Assessment and Evaluations

Assessment Procedures

Assessment Name Description

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

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

Practical Mostly related to laboratory works or by implementing in real


code in either exercise book or in programming IDE

Exam Each course contains a final exam considering the complete


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

CIE- Continuous Internal Evaluation (28 Marks):


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

85
Mapping of CLOs to PLOs

CLOs PLO28 PLO29 PLO30 PLO31 PLO32 PLO33 PLO34 PLO35 PLO36

CLO1 1 0 0 0 0 1 0 0 0

CLO2 0 1 0 0 0 0 1 0 0

CLO3 0 0 1 0 0 0 0 1 1

CLO4 0 0 0 1 0 0 0 1 0

Part D- Resources

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

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

Part A- Introduction

I. Course code: EEE 1202

II. Credit: 1.5

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

2. Course Objectives

1. To learn basic concepts about semiconductor physics.


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

3. Course Learning Outcomes

CLO1. Implement basic concepts about semiconductor physics


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

87
Part B- Lesson Plan

Course Details Learning plan

Timeline Topics /contents Learning Mapped Teaching Assessment


Outcomes CLOs Strategies Strategies

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


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

Week 4 Intrinsic and Extrinsic Define and CLO1, Lecture Quiz


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

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

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


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

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

Week 13 Capacitor and Capacitance: Classify CLO3, Lecture Quiz


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

Part C- Assessment and Evaluations


Assessment Procedures

Assessment Name Description

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

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

Practical Mostly related to laboratory works or by implementing in real


code in either exercise book or in programming IDE

Exam Each course contains a final exam considering the complete


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

CIE- Continuous Internal Evaluation (40 Marks):

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

Understand 10

Apply 25

Analyze 10

Evaluate 5

Create 5

Mapping of CLOs to PLOs

CLOs PLO37 PLO38 PLO39 PLO40 PLO41 PLO42 PLO43 PLO44 PLO45

CLO1 1 0 0 0 0 1 0 0 0

CLO2 0 1 0 0 0 0 1 0 0

CLO3 0 0 1 0 0 0 0 1 1

CLO4 0 0 0 1 0 0 0 1 0

Part D- Resources

Textbooks
1. Basic Electronics (Solid State).

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

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

Differential Equations and Geometry


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

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

CLO1 Understand and explain formation and classification of differential


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

S Course Content Hrs CLOs


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

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

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

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

SEE- Semester End Examination (72 Marks)


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

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

Course Outline: Physics for Engineer

Part A- Introduction

I. Course code: PHY 1201

II. Credit: 2

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

2. Course Objectives

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

3. Course Learning Outcomes

CLO1. Apply the concepts, ideas and methods of Physics


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

94
Part B- Lesson Plan

Course Details Learning plan

Timeline Topics /contents Learning Mapped Teaching Assessment


Outcomes CLOs Strategies Strategies

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


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

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

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


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

95
Variation of resistance with
temperature.

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

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


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

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


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

96
Part C- Assessment and Evaluations

Assessment Procedures

Assessment Name Description

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

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

Practical Mostly related to laboratory works or by implementing in real


code in either exercise book or in programming IDE

Exam Each course contains a final exam considering the complete


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

CIE- Continuous Internal Evaluation (28 Marks):


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

SEE-Semester End Examination (72 Marks)


Bloom’s Category Test
Remember 05
Understand 15
Apply 20
Analyze 10
Evaluate 10
Create 12
97
Mapping of CLOs to PLOs

CLOs PLO46 PLO47 PLO48 PLO49 PLO50 PLO51 PLO52 PLO53 PLO54

CLO1 1 0 0 0 0 1 0 0 0

CLO2 0 1 0 0 0 0 1 0 0

CLO3 0 0 1 0 0 0 0 1 1

CLO4 0 0 0 1 0 0 0 1 0

Part D- Resources

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

98

You might also like