Noakhali Science and Technology University

Syllabuses of the
Department of Computer Science and Telecommunication Engineering
for
4-year BSc Engineering Course for the Session: 2018-2019

Published by
Noakhali Science and Technology University
Sonapur, Noakhali-3814, Bangladesh

1
Year-1 Term-1

Course Credit
Sl. Code Course Title Credit Hours
1 CSTE 1101 Structured Programming Language 3 3
2 CSTE 1102 Structured Programming Language Lab 1.5 3
3 CSTE 1103 Electric Circuit Analysis 3 3
4 CSTE 1104 Electric Circuit Analysis Lab 1 2
5 CSTE 1106 Introduction to Computer Application Lab 1 2
6 PHYS 1101 Electromagnetism, Oscillations, Heat, and Optics 3 3
7 PHYS 1102 Physics Lab 1 2
8 MATH 1101 Differential and Integral Calculus 2 2
9 ENG 1101 English Language 2 2
10 ENG 1102 English Language Lab 1 2
11 BLWS 1101 Bangladesh Liberation War Studies 3 3
12 BAN 1101 বাাাাংলা ভাষা 0 3

Total 21.5 30

Year-1 Term-2

Credit
Sl. Course Code Course Title Credit
Hours

1 CSTE 1201 Data Structures and Analysis 3 3

2 CSTE 1202 Data Structures and Analysis Lab 1.5 3

3 CSTE 1203 Numerical analysis 3 3
4 CSTE 1204 Numerical analysis Lab 1 2

5 CSTE 1205 Discrete Mathematics 3 3

6 CSTE 1207 Electronic Devices and Circuits 3 3
7 CSTE 1208 Electronic Devices and Circuits Lab 1 2

8 MATH 1203 Ordinary and Partial Differential equations 2 2

9 HUM 1201 Industrial Management and Accountancy 3 3
10 CSTE 1226 Viva Voce 1 0
Total 21.5 24

2
Year-2 Term-1

Course Credit
Sl. Course Title Credit
Code Hours

1 CSTE 2101 Object Oriented Programming with C++ 3 3

2 CSTE 2102 Object Oriented Programming with C++ Lab 1.5 3
3 CSTE 2103 Algorithm Design and Analysis 3 3
4 CSTE 2104 Algorithm Design and Analysis Lab 1.5 3
5 CSTE 2105 Digital Logic Design 3 3
6 CSTE 2106 Digital Logic Design Lab 1 2
7 CSTE 2107 Computer Architecture and Organization 3 3
8 CSTE 2108 Computer Architecture and Organization Lab 1 2
9 MATH 2105 Matrices, Vector Analysis and Co-ordinate Geometry 3 3
10 HUM -2103 Principles of Economics 2 2
Total 22 27

Year-2 Term-2

Sl. Course Code Course Title Credit Credit

Hours
1 CSTE 2201 Object Oriented Programming with JAVA 3 3
2 CSTE 2202 Object Oriented Programming with JAVA Lab 1.5 3
3 CSTE 2203 Digital Electronics and Pulse Technique 2 2

4 CSTE 2204 Digital Electronics and Pulse Technique Lab 1 2

5 CSTE 2205 Signals and Systems 2 2

6 CSTE 2207 Electronic Communication 3 3

7 CSTE 2208 Electronic CommunicationLab 1 2

9 CSTE 2209 Theory of Computation 3 3

10 CSTE 2211 Electromagnetic Waves and Radiating Systems 2 2
11 MATH 2207 Complex Variables, Statistics and Probability 3 3
12 CSTE 2226 Viva Voce 1 0
Total 22.5 25

3
Year-3 Term-1

Course Credit
Sl. Course Title Credit
Code Hours

1 CSTE 3101 Data Communication 3 3

2 CSTE 3102 Data Communication Lab 1 2

3 CSTE 3103 Digital Signal Processing 3 3

4 CSTE 3104 Digital Signal Processing Lab 1 2

5 CSTE 3105 Database Management System 3 3

6 CSTE 3106 Database Management System Lab 1.5 3

7 CSTE 3107 Operating Systems and System Programming 3 3

8 CSTE 3108 Operating Systems and System Programming Lab 1.5 3

9 CSTE 3109 Microprocessor, Microcontroller and Interfacing 3 3

10 CSTE 3110 Microprocessor, Microcontroller and Interfacing Lab 1 2

Total 21 27

Year-3 Term-2

Course Credit
Sl. Course Title Credit
Code Hours
1 CSTE 3201 Computer Networking 3 3
2 CSTE 3202 Computer Networking Lab 1 2
3 CSTE 3203 Microwave and Satellite Communication 3 3
4 CSTE 3204 Microwave and Satellite Communication Lab 1 2
5 CSTE 3205 Web Engineering 3 3
6 CSTE 3206 Web Engineering Lab 1 2
7 CSTE 3207 Optical Fiber Communication 3 3
8 CSTE 3208 Optical Fiber Communication Lab 1 2
9 CSTE 3209 Software Engineering and Information System Design 3 3
10 CSTE 3210 Software Engineering and Information System Design Lab 1.5 3
11 CSTE 3211 Wireless and Mobile Communication 3 3
12 CSTE 3212 Wireless and Mobile Communication Lab 1 2
13 CSTE 3226 Viva Voce 1 0
Total 25.5 31

4
Year-4 Term-1

Course Credit
Sl.# Course Title Credit
Code Hours

1 CSTE 4101 Computer Graphics and Animation 3 3

2 CSTE 4102 Computer Graphics and Animation Lab 1 2
3 CSTE 4103 Artificial Intelligence and Neural Networks 3 3
4 CSTE 4104 Artificial Intelligence and Neural Networks Lab 1 2
5 CSTE 4105 Compiler Construction 3 3
6 CSTE 4106 Compiler Construction Lab 1 2
7 CSTE 4108 Software Development Project 1 2
8 CSTE 4109 Cryptography and Information Security 3 3
9 CSTE 4110 Cryptography and Information Security Lab 1 2
10 CSTE 4125 Project and Thesis 2 2
Total 19 23

Year-4 Term-2

Course Credit
Sl. Course Title Credit
Code Hours

1 CSTE 4201 Digital Image Processing 3 3

2 CSTE 4202 Digital Image Processing Lab 1 2

3 CSTE 4203 Multimedia Communications 3 3

4 CSTE 4225 Project and Thesis 3 3

5 CSTE 4226 Viva Voce 1 0

Total 11 11

Grand Total 164 210

5
 COURSE CODE: CSTE 1101COURSE TITLE: STRUCTURED PROGRAMMING LANGUAGE

Course Code: CSTE 1101Course Title: Structured Programming Language, 3Hours/Week, 3 Credits,
Total Marks 100 (Attendance=5, Continuous Assessment=25, Final exam=70), Year 1, Term 2
Rationale: This course has been designed to develop the students’ ability to solve computing problems
using structured programming languages.
Course Objectives:
➢ Solve computing problems using programming concepts
➢ Analyze and apply debugging and testing techniques to locate and resolve errors and to determine the
effectiveness of a program.
➢ Proficiently use fundamental programming elements, including variable declaration, use of data
types and data structures, loop structures, console and file I/O, and functions.
➢ Learn the basic concept of ACM problem solving techniques and programming contests.
➢ Apply the programming concept in accomplishing projects in a team.

Resources Used: Multimedia, Whiteboard, Marker, Handouts, PDF books, e-Tutorials, Question bank,
Previous questions.
Lesson Plan (as per week):
Course contents Outcome (at the end Teacher Learning Assessment
Week

of the session, student strategy Strategy

should be able to) (activities directed to (How they are
achieve outcomes) developed)
1. Programming Appreciate the Lecture and discussion Answer basic
Language: Computer evolution of with detailed questions, quizzes,
programming, programming information about the Homework, exams.
programming languages, languages. course, including the
Compilation vs. Differentiate objectives, course
Interpretation, between compiler outcomes,
Problem solving and interpreter base examinations, physical
techniques, program. Learn the environment and
Data Flow Diagram The basic concept of methodology with the
problem solving. students.
Maps out the flow of Demonstrate problem
information for any solving techniques
process or system

2. Basic program Use the basic data Lecture and discussion Answer basic
structure: types with with basic data type, questions, quizzes,
Variable declarations visualization of how concept of variable Homework, exams.
including common data data are stored in the and showing their
types (e.g., int, float, char memory and their memory
etc.); Constants and its use memory representation
I/O operations including representations. graphically.
formatted I/O Use various Demonstrate various
Operators: Assignment, expressions in their operators and build
arithmetic, relational, program and solve expression using them.
logical and bitwise simple arithmetic Students will be asked
expressions including problems to translate arithmetic
precedence and and algebraic statement
Associativity using
Example problems using programming
6
 variables and expressions language.
Example of using
variables and
constants and
expressions
3. Control Structures & Use the Boolean Lecture and discussion Answer basic
Statements: expressions with real with problems, which questions, quizzes,
Boolean expressions life problem. Use corresponds to the Homework, exams.
Conditional statements control statement program flow and
(e.g., if/else, switch case). with various Boolean logic control.
Nested conditional expressions and solve Demonstrate various
Structures simple logical control structure with
Standard/structures problems and get flow chart and show
programming practices for control over the How to make a decision
program
flow. Use continue making a problem
decision structures. using
Continue and and break statement them.
Break statements with various logical Students will be asked
Example problems using problems to write and analyze
control structures A program that
involved
decision making.
4. Loop Structures: Use the loop structure Lecture and discussion Answer basic
The While, The For, The and their control with problems that questions, quizzes,
Do While Loops, Nesting flow. Use nested require iterations. Homework, exams.
of loops, Switch, loops and solve Demonstrate repetition
Continue, Break problems using them. essentials, counter
statements, Jumps in Determine loop controlled repetition,
loops, Go To statements. operation usage from for repetition
the programming statement, break and
problem continue.

5. Complex data type Define the tabular Lecture and discussion Class Test 1(topics
(Array): data using an array. with tabular data, of the week’s 1-4)
Array syntax, rules, and Use an array for sorting and searching
solving
variable declaration, programming arrays.
One-dimensional, Multi-- problems Multidimensional
dimensional arrays, array
Strings as arrays; Examples using an
array.
initializing arrays
Processing an array using
Loops. Example problems
using arrays and records

7
6. Pointer: Create pointers and Lecture and discussion Answer basic
Basic concept of use them to process on the basics of questions, quizzes,
pointers, Array and arrays in pointers. Array- Homework, and exams.
pointer, Processing array programming pointer referencing
using Pointer, 2D array problems duality.
and pointer, Dynamic Create a dynamic array Strings. Dynamic
memory allocation using and use it in problem- memory management.
malloc Function solving Discuss sample
Sample problems using problems using pointers
Pointer and dynamic memory
management.

7. Functions: Write a function for Lecture and discussion Answer basic

both
Different part of a for pass by value and on function definition questions, quizzes,
function. pass by reference. and a function call. Homework, exams.
Argument passing and Understand the scope Function prototypes
of
returning results Passing variables and the and header files.
array and a pointer to command line Demonstrate the
function. Call by value arguments. mechanism of
and call by Reference, Appreciate problem recursion and
Swapping, Recursion, solving using swapping.
Variables in scope & function. Example function
Command line arguments. writing for
Sample problems using programming
functions problems.
8. Structure: Create a structure for Lecture and discussion Answer basic
Basic concept of representing real-life on the basics of questions, quizzes,
structure,
structure, structure array, tabular data structure array, and Homework, exams.
pointers for Visualize self- pointers for structure
structure, passing structure referential structure Example problem
to function, returning using structure
structure from function
Self-referential structure
Example problems using
structure
9. Union & Enumerated Use enum and union Lecture and discussion Class Test 2(topics
Data type: in the proper way. on the basics of union of the week’s 5-8)
and
Basic concept of Union, Create a union for enum data type.
Passing Union to function, representing real-life Example problem
returning union from tabular data using union and enum
function, Basic concept of data type
Enumerated data type,
Example problems using
Union & Enumerated data
types

8
 10. File management: Understand the Lecture and discussion Answer basic
(This will be covered in concept of files on file manipulation questions, quizzes,
the lab early due to project and file (e.g., CRUD on File) Homework, and exams.
activity) manipulation.
Create, read, write, and
update files, Sequential
files, unformatted files,
Text & Binary files, Case
problems using file IO
11. Computer Graphics: Understand the use of Lecture and discussion Answer basic
Graphics programming: graphics in programs on the basics of questions, quizzes,
lines, drawing & filling properly. graphics in programs. Homework, and exams.
images, patterns, drawing Represent images, Example problem
and filling shapes, Palettes shapes, and text in using graphics
& Colors & Text in programs.
graphics. Example
problems using graphics
12. Macros, C preprocessor, Understand the Lecture and discussion Class Test 3 (topics
Compilers controlled concept of Macros, on Macros, C of the weeks9-12)
directives: the C preprocessor, preprocessor
Basic concept of using and the use of
macros, Importance of compiler-controlled
preprocessor, Benefit of directives.
using compiler-controlled
directives, Example
problems using Macros, C
preprocessor, Compilers
controlled directives.
13. Miscellaneous and Final Learn about the latest Lecture and discussion Exercise the
exam preparation trends and better on miscellaneous answering methods
answering methods in subjects in the final exam.
the final exam.

Recommended books:
1. Programming in ANSI C by E. Balagurusamy, McGraw-Hill.
2. Teach yourself C by H. Schildt, McGraw-Hill.
3. Theory and problems of programming with C by Byron S. Gottfried, Schaum’s Outline Series,
McGraw-Hill.
4. C How to Program by H. M. Deitel and P. J. Deitel, Pearson Education.

9
 COURSE CODE: CSTE 1202, COURSE TITLE: STRUCTURED PROGRAMMING LANGUAGE
LAB

Course Code: CSTE 1102, Course Title: Structured Programming Language Lab, 3 Hours/Week, 1.5
Credits, Total Marks 100 (Class Attendance=10, Internal Evaluation/Observation = 70, Final Viva-voce
=20), Year 1, Term 2
Rationale: This course provides an introduction to structured programming language and teaches problem-
solving using programming concepts.
Course Objectives:
➢ In the course, students will perform experiments to practically verify the theories and concepts
developed in CSTE 1101.
➢ Solve computing problems using programming concepts
➢ Learn the basic concept of ACM problem-solving techniques and programming contests.

➢ Apply the programming concept in accomplishing projects in a team.

Resources Used: Multimedia, Whiteboard, Marker, Handouts, PDF books, e-Tutorials, Codeblocks.
Lesson Plan (as per week):
Course Outcome (at the end of the Teaching Learning Assessment
Week

Contents lesson, the student should Strategy Strategy

be able to) (activities directed to (How they are
achieve outcomes) developed)
1 Basic Program Structure • Write programs on Discussion and -Home task
• Data types basic program practice -Quiz
• Operators structure.
• Memory allocation
• Various expressions
• Simple arithmetic
problems
2 Control Structures & • Write programs on First lecture and then Answer basic
Statements different control Practice questions, quizzes,
• If/else structures. Homework, and
• Switch exams.
• Nested conditional
structure
• Continue and break

3 Loop Structures • Write programs Lecture and discussion Quiz 1 (Topic of the
• Loop structure using a loop with problems. 1-2 weeks)
• Loop control flow structure
• Nested loop
• Loop operation
4 Array • Write programs on Lecture and discussion Homework
• Array declaration array initialization and with problems.
• Array initialization different-dimensional
• Array processing array processing.
5 Pointer • Write programs on Practice with a real-life Answer basic
• Pointer to an array pointers and problem. questions, quizzes,
• Array of pointers pointer Homework, and
• Dynamic memory manipulations. exams.
allocation
10
6 Functions • Write programs on Lecture and discussion Homework
• Function declaration function declaration with problems.
• Argument passing • Write programs on
• Call by value Argument passing, call
• Call by reference by value, and call by
• Swapping reference
• Recursion • Demonstrate examples
of swapping and
recursion.
7-8 Structure, Union, and • Write programs on Lecture and discussion Quiz 2 (Topic of the
Enumerated the structure and with problems. 4-6 weeks)
• Structure declaration its manipulations.
• Structure array • Write programs on
• Pointers for structure Union and its
• Structure passing to manipulations.

function • Write programs on

• Self-referential enumerated data types.
structure
• Union declaration
• Union passing to
function
• Enumerated data type
9 File Management • Write programs on Practice with a real-life Answer basic
• Create files creating, reading, problem. questions,
• Read files writing, and updating . Homework
• Write files files.
• Update files • Write programs on
• Sequential files text, binary files, and
• Text and binary files unformatted files.
• Unformatted files
10 Computer Graphics • Write programs for Practice with a real-life Homework
Line drawing line drawing, filling problem.
Filling images images, patterns,
Patterns shapes, and text in
Shapes graphics.
Text in graphics
11 Macros, C preprocessor, • Write programs on Lecture and discussion Answer basic
Compilers controlled micros, and with problems. questions,
directives preprocessor Homework
• Macros • Write programs Quiz 3 (Topic of
• Preprocessor for creating a C the 9-12 weeks)
• Library creating library.
12 Project • Submit a project using Evaluate each project. Presentation,
the concepts of Project
structured showcasing.
programming
language.
13 Final Lab Exam (Lab and Viva)

11
 COURSE CODE: CSTE 1103, COURSE TITLE: ELECTRIC CIRCUIT ANALYSIS

Course Code: CSTE 1103, Course Title: Electric Circuit Analysis, 3 Hours/Week, 3 Credits, Total Marks
100 (Attendance=5, Continuous Assessment=25, Final exam=70), Year 1, Term 1
Rationale: This course is designed to develop the fundamental concepts regarding the analysis of electrical
circuits and enable the students to have a thorough knowledge of the working principle and characteristics
of all electrical machines.
Course Objectives:
➢ To acquaint students with the basic concepts and properties of electrical circuits and networks
➢ To teach students how to analyze both DC and AC electrical circuits
➢ To familiarize students with the working method and applications of the electrical machine
➢ To introduce students to power system protection and switchgear
Resources Used: Multimedia, Whiteboard, Marker, Handouts, PDF books, e-Tutorials, Device manual,
Question bank, and Previous questions.
Lesson Plan (as per week):

Course Outcome (at the end of the Teaching Learning Assessment

Week

Contents lesson, the student should be Strategy(activities Strategy(How

able to) directed to achieve they are
outcomes) developed)
1. Circuit Models: Characteristics Demonstrate basic Lecture and Answer basic
& applications of linear circuit proficiency in building basic discussion with questions,
elements, Ideal, and non-ideal electrical circuits and detailed information quizzes,
sources: Voltage and Current. operating fundamental about the course, Homework,
Series, Parallel, and Compound electrical engineering including the and exams.
circuit analysis. Loading effects: equipment. objectives, course
Ammeter and Voltmeter. outcomes,
examinations, Topic
wise lecture delivery.
2. Circuit Theorem and DC Use Kirchhoff’s laws, circuit Lecture and Answer basic
analysis: Ohm’s law, Voltage theorems, and node voltage discussion on theory questions,
and current divider rule, methodology to solve simple and problems. quizzes,
Kirchhoff’s Laws. DC as well as AC circuits. Homework,
exams.
3. Circuit Theorem and DC Choose proper analysis Lecture and Answer basic
analysis: Mesh and Nodal methods and use them to discussion on theory questions,
analysis, The matrix form of solve DC circuits. and problems. quizzes,
Mesh and Nodal equations, Use Homework,
of Cramer’s rule, Bridge and exams.
networks, T-Pie and Pie-T
Conversions.
4. Circuit Theorem and DC Lecture and Exercise with
analysis: Superposition discussion on theory various
Theorem, Thevenin’s Theorem, and problems. mathematical
Norton’s Theorem, Maximum problems.
Power Transfer Theorem, and
Reciprocity Theorem.

12
5. Transients and Time Domain Solve simple 1st order Lecture and Class Test 1
analysis: Transients in RC, RL, transient circuits. discussion on theory (topics of the
and RLC circuits. Pulse and problems. weeks 1-4)
repetition rate and duty cycle.
Average value. RC response to
square wave inputs.
6. AC Circuits: Periodic functions, Apply simple steady state Lecture and Answer basic
average &RMS values, Steady sinusoidal analysis to circuits. discussion on theory questions,
state behavior with sinusoidal, and problems related quizzes,
excitation, phasor representation, to AC circuits. Homework,
reactance and impedance, series exams.
and parallel AC circuits,
resonance,
7. AC Circuits: Power in AC Demonstrate a basic Lecture and Answer basic
circuits, power factor, the understanding of phasors and discussion on theory questions,
principle of generation of single phasor diagrams for AC and problems related quizzes, and
phase & Three phase voltages, circuit analysis. to AC circuits. homework
Power in Balanced three-phase exams.
AC systems.
8. Networks: Two-port network Recognize, analyze, and Lecture and Answer basic
and its parameters. Equivalent sketch characteristics for discussion on theory questions,
circuits. Analog filter design: different types of filters. and problems related quizzes, and
Elementary filter theory, to analog filters. homework.

Characteristics impedance. A exams.

low-pass filter, a high-pass filter,
a band-pass filter, Band-
elimination filter.
9. Magnetic Circuits: Flux, MMF, Explain different terms Lecture and Class Test 2
reluctance, analogous electric related to magnetic circuits discussion on theory (topics of the
circuits, simple calculations for and analyze a simple and problems related weeks 5-8)
composite magnetic circuits. magnetic circuit. to magnetism

10. Generator: Introduction, Understand the basic Lecture and Answer basic
construction, EMF equation, construction and operation of discussion on questions,
classification. DC and AC machines the theoretical quizzes, and
background homework.
of exams.
generator
11. Motor: Basics of DC motor, Lecture and Quizzes,
Induction motor (single & three discussion on the Homework,
phase) & Synchronous motor, theoretical and exams.
Stepper motor. background of
different types of
motor
12. Switchgear: Switch, Fuse, Develop the ability and skill Lecture and Class Test 3
Circuit Breaker, Relay. to design feasible protection discussion (topics of the
systems for power system on weeks 9-11)
switchgear
13. Review topics and Final exam Learn about the latest trends Lecture and Exercise the
preparation. and better answering methods discussion on answering
in the final exam. miscellaneous topics. methods in
13
 the final exam.

Recommended Books:
1. Introductory Circuit Analysis by Robert [Link], Prentice Hall.
2. A Textbook of Electrical Technology by B.L. Theraja, S. Chand.
3. Fundamentals of Electric Circuits by C. K. Alexander, M. N. O. Sadiku,

COURSE CODE: CSTE 1104, COURSE TITLE: ELECTRIC CIRCUIT ANALYSIS LAB

Course Code: CSTE 1104, Course Title: Electric Circuit Analysis Lab, 2 Hours/Week, 1 Credit, Total
Marks 100 (Class Attendance=10, Internal Evaluation/Observation = 70, Final Viva-voce =20),Year 1, Term
1
Rationale: This lab course is designed to give students the ability to design, build, and implement basic AC
and DC circuits.
Course Objectives:
➢ Provide hands-on experience to the students so that they are able to put theoretical concepts into practice.
➢ Give a specific design problem to the students, which after completion, they will verify using the
simulation software (PSPICE or Multisim) or a hardwired implementation.
➢ Understand the concept of circuit laws.
➢ Solve the electrical network using mesh and nodal analysis by applying network theorems.
➢ Analyze the transient response of series and parallel A.C. circuits.
➢ Build a foundation of basic knowledge required for electrical machines and protection systems.
➢ Acquire teamwork skills for working effectively in groups.
➢ Develop technical writing skills important for effective communication.

Resources Used: Multimedia, Whiteboard, Marker, Handouts, PDF books, e-Tutorials, Device manual

Question bank, Previous questions.

Lesson Plan (as per week):
Course Outcome (at the end of the Teaching Learning Assessment
Week

Contents lesson, the student should be Strategy(activities Strategy(How

able to) directed to achieve they are
outcomes) developed)
1. To be familiar with the gain significant experience Lecture and Answer basic
operation of different electrical with electrical instruments discussion with questions
instruments. such as function generators, detailed information about
digital multimeters, about the lab course, different types
oscilloscopes, and power including the of
supplies, etc. objectives, course instruments.
outcomes, lab
examinations, and
evaluation method.

14
2, To verify the following theorems Explain the concept of circuit Through lecture, Neatness,
3, using breadboarding and laws and network theorems laboratory, and out-of- organization,
4, simulation software (PSPICE): and apply them to class assignments. completeness,
5 i. KCL and KVL laboratory measurements. and
theorem, Become proficient with individually
ii. Superposition theorem, computer skills (eg, PSPICE written lab
iii. Thevenin’s theorem, or Multisim) for the reports are
iv. Norton’s theorem and analysis and design of circuits Due at the
v. Maximum power beginning of
transfer theorem the lab period.
6, To design and construct low- Explain the concept of an Through lecture, Respected
7 pass and high-pass filters and electrical filter and apply them laboratory, and out-of- Teacher will
draw their characteristic curves. to an electrical circuit. - class assignments. be evaluated
8, Study the frequency response of Explain the concept of series Through lecture, in lab period.
9 an RLC series and parallel circuit and parallel circuit and apply laboratory, and out-of-
and find its resonant frequency. them to AC circuit. class assignments.
10, Study the basic construction of Reflect a basic understanding Through lecture,
11 Generator, Motor, Transformer of generator, motor and laboratory, and out-of-
and different types of switchgear. transformer operation. class assignments.
12 Submit a mini project in a group
13 Final Lab Exam (Job, Quiz and Viva)

COURSE CODE: CSTE 1106, COURSE TITLE: INTRODUCTION TO COMPUTER

APPLICATIONLAB

Course Code: CSTE 1106, Course Title: Introduction to Computer ApplicationLab, 2 Hours/Week, 1
Credit, Total Marks 100 (Class Attendance=10, Internal Evaluation/Observation = 70, Final Viva-voce
=20),Year 1, Term 1
Rationale:This lab course is designed to give students ability tohands-on experience with computer
hardware, Operating systems, Office tools, Databases, Internet, Computer networks, and Troubleshooting
mechanism.
Course Objectives:
➢ Provide hands-on experience to the students so that they are able to put theoretical concepts to
practice.
➢ Understand the concepts of operating system
➢ Build a foundation of strong knowledge required for Word, Spread Sheet, Presentation package, and
Database related different problems.

➢ Use different computer network model practically.

➢ Analyze and solve different problems of hardware troubleshoot and computer software.

Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Eclipse IDE.
Lesson Plan (as per week):
Course Outcome (at the end of the Teaching Learning Assessment
Week

Contents lesson, student should be Strategy(activities Strategy(How

able to) directed to achieve they are
outcomes) developed)

15
1 HARDWARE • Students will able to Discussion and -Home task
• Assemble Hardware assemble hardware practice -Quiz
Components (Desktop components
and Laptop).
2 OPERATING SYSTEM • Students will learn First lecture and then Answer basic
• Basics of computer the basics of Practice questions, quizzes,
• DOS computers Homework, a n d
• Windows • They will learn how to exams.
• Linux operate DOS,
• Mac Windows, Linux, and
Mac
3 WORD PROCESSOR • Students will learn to Lecture and discussion Homework
• Popular word use a popular word with problems.
processors processor to create a
• Create a test file camera-ready test file
complete with figures, complete with figures,
columns, and tables. columns, and tables.
4 SPREAD SHEET • Students will learn to Lecture and discussion Quiz 1 (Topic of
• Popular Spreadsheet use a popular Spread with problems. the 1-3 weeks)
• Maintain a small Sheet to maintain a
database small database.
• Minor bookkeeping • They will learn to
• Statistical and graphical analyze statistical and
analysis of data. graphical data.
5 PRESENTATION • Students will learn how Practice with a real-life Answer basic
PACKAGE to create multimedia problem. questions, quizzes,
• Multimedia slides slides and animations. Homework, a n d
• Animation. exams.
6-7 DATABASE • Students will learn how Lecture and discussion Homework
APPLICATION to create a Field, with problems.
• Microsoft Access Table, Keys, ER
Topics: Database Diagram, Form,
basics, Field, Table, Report, and Query in
Keys, ER Diagram, Microsoft Access.
Form, Report, and
Query.
8-9 INTERNET AND • Students will learn how Lecture and discussion Quiz 2 (Topic of
COMPUTER to browse and search with problems. the 4-7 weeks)
NETWORK on the web.
• Browsing Concepts • They will learn about
• Searching on the web Email, Cable
• Email Configurations: Straight
• Cable cable, Cross Cable,
etc.

Configurations: Straight • They will learn how to

cable, Cross Cable, etc. set up a LAN and IP
• LAN setup and IP address configuration.
address configuration.

16
 10- HARDWARE • Student will learn how Practice with a real-life Answer basic
12 TROUBLESHOOTING to install/bind a new problem. questions,
• Installing/binding a new computer system, . Homework
computer system install the operating Quiz 3 (Topic of
• Installing the operating system, and install the 8-9 weeks)
system and other other software.
software. • They will learn how to
• Formatting and format and partition the
partitioning the hard hard disk.
disk. • They will learn about
• Precaution precaution, preventive
• Preventive maintenance maintenance, and
• Troubleshooting troubleshooting
hardware and software hardware and software
components. components.
13 Final Lab Exam (Job, Quiz, and Viva)

COURSE CODE: PHYS1101, COURSE TITLE: ELECTROMAGNETISM, OSCILLATIONS, HEAT,

AND OPTICS

COURSE ID: PHYS1101, COURSE TITLE: Electromagnetism, Oscillations, Heat and Optics, 3
Hours/Week, 3 Credits, Total Marks:100 (Attendance=5, Continuous Assessment=25, Final exam=70), Year
1, Term 1
Rationale: This course is designed to get a n idea about electric and magnetic fields,
oscillations, and thermodynamics.
Course Objectives:
➢ Make the students familiar with the idea of fundamental laws of electric field and magnetic field,
electric potential, capacitor, inductor, laws of thermodynamics, and oscillation.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, PDF books, e-Tutorials, Device manual,
Question bank, and Previous questions.
Lesson Plan (as per week):
Course Outcome (at Teaching Assessmen
Contents the end of the Learning t Strategy
lesson, student Strategy (How they
Week

should be able (activities are

to) directed to developed)
achieve
outcomes)
1 Coulomb’s Law; Electric field; Gauss’s Law and Using Lecture and Answer
itsapplication;Electric potential; Coulomb’s and discussion basic
Gauss’s law, with detailed questions,
how one can information quizzes,
calculate about the Homework
electric field. course, , exams.
The idea of including the
electric
potential and objectives,
relation with course
electric field. outcomes,

17
 examinations
. Topic-
wise lecture
delivery.

2 Capacitors and capacitance: Capacitors with dielectrics, Capacitor and

Dielectrics anatomic view, Charging and discharging of a its electric
capacitor; behavior.

3 Magnetic field: Magnetic induction, Magnetic force on a current-carrying Basic idea of Answer
conductor, Torque on a current-carrying loop, Hall effect. the magnetic basic
field. questions,
quizzes,
Homework,
and exams.
4 Faraday’s Law of electromagnetic induction; Lenz’s Law; Self- Magnetic Lecture and Answer
induction; Mutual induction; Magnetic properties of matter: induction and discussion basic
Hysteresis curve; Maxwell equations related laws. with questions,
problems. quizzes,
Homework,
and exams.
5 Differential equation of a simple harmonic oscillator, Total Understand Exercise with Class Test
energy and average energy, Combination of simple harmonic simple various 1(topics of
oscillations, Lissajous’ figures, spring-mass system, Time period of harmonic mathematical the week’s
the torsional pendulum; motion and its problems. 1-4)
practical
example.
6 Damped oscillation: Determination of damping coefficient; Forced Get an idea Lecture and
oscillation: Resonance, Two-body oscillations, Reduced mass. about different discussion
types of with
oscillatory problems.
motion.
7 Differentiable equation of a progressive wave, Power and intensity Get a concept
of wave motion; Stationary wave: Group velocity and phase of different
velocity; Doppler effect. types of waves.
8 Kinetic theory of gases: Deduction of gas law, Principle of Explain the Answer
equal partition of energy, Equation of state-Avogadro's kinetic theory basic
experiment, of gases and to questions,
deduce the laws quizzes,
of gases. Homework,
exams.
9 Vander Waals equation, Critical constants, Transmission of heat, Understand Class Test
Conduction, Convection, and Radiation. Laws of physical 3 (topics of
thermodynamics significance of the
Vander Waal’s week’s5-8)
equation and
laws of
thermodynamic
s.

18
10 Interference of light, Young’s double-slit experiment, Fresnel Understand Lecture and Answer
bi-prism, interference of discussion basic

Interference at wedge-shaped films, Newton’s rings, light and with questions,

Interferometer; different problems. quizzes,
experiment on Homework
interference. exams.
11 Diffraction of light: Fresnel and Fraunhofer diffractions, Diffraction by To get idea Answer
single slit, Diffraction from a circular aperture, about Fresnel basic
and Fraunhofer questions,
diffraction. quizzes,
Homework
, exams.
12 Resolving power of optical instruments, Diffraction at double Understand of Understandin
slit and N-slits-diffraction grating; resolving power g and solving
and diffraction the problem.
of different
slits.
13 Polarization: Production and analysis of polarized Production of Class Test
light,Brewster’sLa w, polarized light 3 (topics of
MalusLaw, Polarization by double refraction,Retardationplates,N using different the week’s
icol prism, Optical activity,Polarimeters,Polaroids. techniques. 9-12)

Recommended Books:
1. PhysicsVol-1&[Link]&[Link],WileyEasternPrivateLtd.
2. FundamentalsofPhysicsbyDavidHallidayandRobert Resnick, JonnWiley&Co.
3. VibrationsandWaves–[Link],CBS.
4. Heat and thermodynamics by Brijlal and N. Subrahmanyam
5. Physics for engineer by Dr. Giasuddin Ahmed.

COURSE CODE: PHYS 1102, COURSE TITLE: PHYSICS LAB

Course Code: PHYS 1102, Course Title: Physics Lab, 2 Hours/Week, 1 Credits, Total Marks 100 (Class
Attendance=10, Internal Evaluation/Observation = 70, Final Viva-voce =20), Year 1, Term 1
Rationale:Self conducting experiments in the field of general physics, processing and physical
understanding of the results, and writing laboratory reports on the experiment.
Course Objectives:
➢ Independently conducting experiments in the field of general physics (handling measuring devices
and instruments).
➢ Explain physical phenomena in the tests performed (a connection between physical laws and their
application).
➢ Statistical analysis of results obtained by experiment, interpretation of the results.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Device manual,
Question bank, Previous questions.
Lesson Plan (as per week):

19
 Course Outcome (at the end of the Teaching Learning Assessment

Week
Contents lesson, student should be able Strategy (activities Strategy
to) directed to achieve (How they are
outcomes) developed)
1. To familiar with the operation of gain significant experience Lecture and Answer basic
different instruments. with various equipment discussion with questions
detailed information about
about the lab course, different
including the types of
objectives, course instruments.
outcomes, lab
examinations and

evaluation method.

2, 1. Determination of unknown Through lecture, Neatness,

3, resistances and verification of the laboratory, and out- organization,
4, laws of resistances by P.O Box. of-class assignments. completeness
5 2. Comparison of EMF of two and
Cells. individually
3. Determination of the thermal written lab
conductivity of a bad conductor reports are
by Lee's method. due at the
6, 4. Determination of mechanical Through lecture, beginning of
7, equivalent of heat by an electrical laboratory, and out- the lab period.
8 method. of-class assignments. Respected
5. Determination of the focal Teacher will
length of i. a convex lens by be evaluated
displacement method and ii. a in lab period.
concave lens by an auxiliary lens
method.
9, 6. Determination of the refractive Through lecture,
10 index of a liquid by a plane mirror laboratory, and out-
and a pin method using a convex of-class assignments.
lens.
7. Measurement of the refractive
index of the material of a prism
with the help of a spectrometer.
11, 8. Determination of the radius of Through lecture,
12 curvature of a planoconvex lens laboratory, and out-
by Newton’s method. of-class assignments.
13 Final Lab Exam (Job, Quiz and Viva)

20
COURSE CODE: MATH-1101, COURSE TITLE: DIFFERENTIAL AND INTEGRAL CALCULUS

Course Code: MATH-1101, Course Title: Differential and Integral Calculus,2 Hours/Week, 2 Credits,
Total Marks: 100 (Attendance=5, Continuous Assessment=25, Final exam=70), Year 1, Term 1
Rationale: This course has been designed to develop the students’ ability to realize the application of
Differential and Integral Calculus in Science and Engineering aspects, specially analyzing and developing
algorithms in Computer Science and Telecommunication Engineering.
Course Objectives:
➢ Make the students familiarize with various types of Differentiation and Integration
➢ Analyze functions and theorems using Mathematica.
➢ Apply functions and Theorems in engineering solutions.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Mathematica,
MATLAB, Question bank, Previous questions.
LESSON PLAN (AS PER WEEK):
Course Contents Learning Outcome Teaching Learning Assessment
Week

(at the end of the Strategy(activities Strategy(How they

lesson, student directed to achieve are developed)
should be able to) outcomes)
1 Differential Calculus: Limits, Realize importance Lecture and Answer basic
continuity and differentiability; and application of discussion with questions, quizzes,
differential objectives, outcomes Homework, exams.
Calculus. of the course.

2 Successive differentiation of Solve functions Lecture and quizzes, Homework,

various types of functions; discussion with exams.
characteristics
parameters of
functions. Analyzing
functions.
3 Leibnitz’s Theorem; Rolle’s Lecture and Explanation, quizzes,
Theorem; Mean value Theorem; discussion with Homework, exams.
solution of problems
using Mathematica.
4 Expansion of functions; Apply theorem and Do. Exercise with various
Evaluation of indeterminate forms functions mathematical
by L’ Hospitals rule; problems.
5 Euler's Theorem; Tangent and Do. Class Test 1 (topics
Normal; Maximum and minimum of the week’s 1-4)
values of functions of single
variable; Curvature, Asymptotes
6 Partial differentiation; Realize importance Do. Exercise with
and application of Mathematica.
Partial Homework,exams.
differentiation.
7 Integral Calculus: Definitions of Do. Do.
integration; Integration by the
method of substitutions;
8 Integration by parts; Standard Do. Do.
integrals; Integration by the
method of successive reduction;

21
 9 Definite integrals and its use in Do. Class Test 2(topics
summing series; of the week’s5-8)
10 Walli’s formula, Improper Solve and apply Do. Exercise with
integrals, Beta function and integration. Mathematica.
Gamma function;
11 Area under a plane curve; Area of Do. Do.
the region enclosed by two curves;
12 Volume of solids of revolution; Apply in Do. Class Test 3(topics
multiple integrals and its engineering of the week’s9-12)
application. solutions.
13 Review topics and Final exam Discussion on
preparation. miscellaneous topics.

Recommended Books:
1. Erwin Kreyszig,” Advanced Engineering Mathematics”, Wiley Eastern
2. Babu Ram,” Engineering Mathematics”, Pearson Education
3. H. K. Dass “Higher Engineering Mathematics”, S. Chand& Co.
4. B.S. Grewal, “Engineering Mathematics”, S. Chand & Co.,
5. Das & Mukherjee, “Differential Calculus”, U.N. Dhar& Sons Private Ltd.
6. Das & Mukherjee, “Integral Calculus”, U.N. Dhar& Sons Private Ltd.

COURSE CODE: ENG 1101, COURSE TITLE: ENGLISH LANGUAGE

COURSE CODE: ENG 1101, COURSE TITLE: ENGLISH LANGUAGE, 2 Hours/Week, 2 Credits, Total
Marks 100 (Attendance=5, Continuous Assessment=25, Final exam=70),Year 1, Term 1
Rationale: This course is designed to provide advanced preparation to students wishing to take the IELTS

exam,who may be required to show an improvement in their performance to gain entry onto theirchosen
higher study program in different countries. At the same time, students will improve theirgeneral English
languagereading and writing skills.
Course Objectives:
➢ To prepare you to take the IELTS by discussing, practicing, and analyzing each section of the test.
➢ To improve your IELTS test-taking skills and strategies in each section of the test.
➢ To review particular grammatical patterns that occur regularly on the IELTS.
➢ To simulate actual test-taking conditions so that you become familiar with and more comfortable with test
situations.
➢ To improve the quality and quantity of writing you produce under time pressure.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Question bank,
Previous questions.
Lesson Plan (as per week):

22
 Course Outcome (at the end of the Teaching Learning Assessment

Week
Contents lesson, student should be able Strategy(activities Strategy(How
to) directed to achieve they are
outcomes) developed)
1. English phonetics: the places and Comprehend English speech Lecture and Answer basic
manners of articulation of the soundsystem, stress and discussion with questions,
English sounds; intonation. detailed information quizzes,
about the course, Homework,
including the exams.
objectives, course
outcomes,
examinations, Topic
wise lecture delivery.
2. Grammar: Grammatical Understand basic grammar Lecture and Answer basic
principles, modals, phrases & principles. discussion on theory questions,
idioms, affixes, sentence and problems. quizzes,
structures, why & yes/no Homework,
questions, and conditional and exams.
sentences.
3. Vocabulary building: technical Use appropriate language and Lecture and Answer basic
and scientific vocabulary; Correct vocabulary for specific tasks discussion on theory questions,
and precise diction, affixes, and and problems. quizzes,
the level of appropriateness. Homework,
Colloquial and standard, informal and exams.
and formal
4, Technical Writing: Write clear and coherent Lecture and Class Test
5, (i) Paragraph writing. Interpreting passages, effective letters for discussion on theory 1(topics of the
6, from table /data/ wagon wheel / job applications and and problems. week’s 1-3)
7, graph /figure (At least 150 words) complaints, and technical
8 (ii) Opinion based essay writings reports.
(At least 250 words)
(iii) Business letters, job
applications, memos, quotations,
tender notice, research reports,
research projects, Press release,
proof reading and editing,
designing questionnaires and
understanding survey, journal
writing.
9, Reading: Reading approaches, Enhance reading Lecture and Class Test 2
10, Comprehension of technical & comprehension. discussion on theory (topics of the
11, non-technical materials- and problems. week’s 4-8)

23
12 skimming, scanning, inferring&
responding to context Passages
must be paragraph types with
letter marks (A, B, C, D ............. )
Options:-
Write correct letter in boxes from
letter marks (A, B, C, D.............. )
passages which match with each
sentence
Or, Matching with events from
letter marks (A, B, C, D ............. )
passages
Or, List of headings
Or, Statements agree with
information (True/False/Not
Given)
Or, Fill up with appropriate word
from the passages without list
Or, Fill up with appropriate word
from the passages with list
(synonyms word)
Or, multiple choice
13. Review topics and Final exam Learn about latest trends and Lecture and Class Test 3
preparation. the better answering methods discussion on (topics of the
in the final exam. miscellaneous topics. week’s 9-12).

Recommended Books:
1. John M. Lennon: Technical Writing
2. A.J. Thomson and A.V. Martinet: A Practical English Grammar
3. A. Ashley: Oxford Handbook of Commercial Correspondence
4. J. Swales: Writing Scientific English
5. Robert J. Dixson: Complete Course in English
6. Rajendra Pal & J.S. Korlahalli: Essentials of Business Communications
7. Cambridge IELTS 1-10, Cambridge University Press, 2011.

COURSE CODE: ENG 1102, COURSE TITLE: ENGLISH LANGUAGE LAB

COURSE CODE: ENG 1102, COURSE TITLE: ENGLISH LANGUAGE LAB, 2 Hours/Week, 1 Credits,
Total Marks 100 (Class Attendance=10, Internal Evaluation/Observation = 70, Final Viva-voce =20),Year 1,
Term 1
Rationale: This course is designed to provide advanced preparation to students wishing to take the IELTS
exam,who may be required to show an improvement in their performance to gain entry onto theirchosen
higher study program in different countries. At the same time, students will improve theirgeneral English
language speakingand listening skills.
Course Objectives:
➢ To prepare you to take the IELTS by discussing, practicing, and analyzing each section of the test.
➢ To improve your IELTS test-taking skills and strategies in each section of the test.
➢ To simulate actual test-taking conditions so that you become familiar with and more comfortable with test
situations.
➢ To improve the quality and quantity of listening and speaking you produce under time pressure.

24
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Question bank,
Previous questions.

Lesson Plan (as per week):

Course Outcome (at the end of the Teaching Learning Assessment
Week

Contents lesson, student should be able Strategy(activities Strategy(How

to) directed to achieve they are
outcomes) developed)
1. To familiar with the test system of gain significant experience Lecture and Answer basic
IELTS. with practical system. discussion with questions.
detailed information
about the lab course,
including the
objectives, course
outcomes, lab
examinations and
evaluation method.
2, Spoken English: Recognize the different Through lecture, Answer basic
3, Introduction to phonetic symbols, sections and requirements of laboratory, and out-of- questions.
4, dialogue, responding to particular the IELTS speaking test. class assignments.
5, situations, extempore speech, and Introduce self and converse
6, cue card on situational confidently on a topic, for
7, condition/himself/herself. example, family, hobbies, or
8 work.
Use appropriate stress,
intonation and speed patterns
in their conversation.
Use the appropriate vocabulary
and grammar to express their
ideas
9, Listening: Recognize the format and Through lecture, Answer basic
10, Fill in the gap, multiple choice, question patterns in an IELTS laboratory, and out-of- questions.
11, etc. from CD recorder listening test. class assignments.
12 Identify specific information
and roles of speakers.
Identify the main ideas of an
aural text.
Identify numbers, dates, time,
letters, etc. correctly.
Understand the implications of
information provided in aural
texts.
Accurately transfer
information gathered from
listening to written answers
within the set time limit.
13. Final Lab Exam (Speaking & Listening)

Recommended Books:
1. Cambridge IELTS 1-10, Cambridge University Press, 2011.

25
 COURSE CODE: BLWS 1101, COURSE TITLE:HISTORY OF THE EMERGENCE OF
INDEPENDENT BANGLADESH

Course Code: BLWS 1101, Course Title:History of The Emergence of Independent Bangladesh, 3
Hours/Week, 3 Credits, Total Marks 100 (Attendance=5, Continuous Assessment=25, Final exam=70),
Year 1, Term 1
Rationale: History of the emergence of Independent Bangladesh is a basic part of our national history.
It is a mandatory course for all Departments and Institutes of NSTU. This knowledge will be needed
in
various job sectors.
Course Objectives:
➢ To make the student knowledgeable about the emergence of Bangladesh.
➢ To prepare them to face the question on Bangladesh Affairs in various job interviews.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Device manual,
Question bank, Previous questions.
Course Content Learning Outcomes Teaching- Assessment
Week

(Students will be able Learning Strategy Strategy

to)
1 Introducing: answer the scope Delivering Oral Test
History of the Emergence of and limitations of Lecture
Independent Bangladesh and its the course.
Scope
2, Description of the Country • narrate the • Delivering • Writte
3 and its People geographical Lecture n Test
• Description of the Country condition of • Power Point (PP) • Assignment
and its People Bangladesh. projection
• Ethnical Composition • describe the • Presenting
• Language anthropological through image,
identity of audio and video.
Bangalis and small • Showing the
ethnic groups of evolution of
Bangladesh. Bangla fonts.
• write on the
advancement of
Bangla language.

26
 Partition of the Sub-Continent • explain partition
1947, Structure of Pakistan, of the Sub- • Delivering • Writte
Disparity, the Language Continent 1947. Lecture n Test
Movement and the Rule of • differentiate the • Showing • Oral test
Ayub-Yahia Khan (1958-1971) economic reverent images • Assignment
• Lahore Resolution,1940 condition of two and videos.
• The creation of Pakistan wings of Pakistan.
4,
1947 • write on the
5
• Central and Provincial language
Structure movement of
• Economic, Social and 1948 and 1952.
Cultural Disparity • discuss on the
• Misrule of Pakistan and military rule of
Struggle for Democratic Ayub and Yahia
Politics Khan.
• The Language Movement :
Context and Phases
• Rise of Nationalism and the
Movement for Self-
Determination
Fall of Ayub Khan and Yahia
Khan’s Rule, Abolition of One
Unit, Universal Suffrage, LFO

27
6, Rise of Nationalism and the • narrate the six- • Delivering • Written
7 Movement for Self- point movement lectures Test
Determination and its • Showing relevant • Presentation
• The Six Point Movement of consequences. image and video • Assignment
Sheikh Mujibur Rahman • discuss about the • Group
• Reactions, Importance and Agartala Case and discussion
Significance of the Six Point mass upsurge of
Movement 1969.
• The Agartala Case, 1968
• Students’ 11-Points
Movement
The Mass-Upsurge of 1969
8, Election of 1970, Non- • analyze the • Delivering • Written
9 cooperation Movement of election of 1970, lectures Test
March 1971 and the non-cooperation • Showing • Short
Declaration of Independence movement of relevant image Question
by Bangabandhu March 1971 and and video Assignment
the declaration of • Panel discussion
• Election Result and Independence by •
Central’s Refusal to Comply Bangabandhu
• The Non-cooperation
Movement, the 7th March
Address, Operation
Searchlight
• Declaration of
Independence by
Bangabandhu and His
Arrest
The Proclamation of
Independence and the
Formation of Bangladesh
Government

28
10, The War of Liberation and • analyze the • Delivering • Written
11 Formation of Independent formation and lectures Test
Bangladesh role of Mukti • Showing • Assignment
• The Spontaneous Early Bahini, FF, Mujib relevant images • Presentation
Resistance and Subsequent Bahini, local and videos • Debating
Organized Resistance forces and other • Role play
(Mukti Fouj, Mukti Bahini, guerillas.
Guerillas and the Frontal • narrate Crime
Warfare Against Humanity
• Genocide, Repression of being held in the
Women, Refugees Liberation War of
• Publicity Campaign in the Bangladesh.
War for Liberation • interpret the role
(Swadhin Bangla Betar of anti-Liberation
Kendra, the Campaigns forces in 1971.
Abroad and Formation of • describe the trial
Public Opinion of Bangabandhu
• The Anti-Liberation and its reactions.
Activities of the • explain the role of
Occupation Army, the Peace India as well as
Committee, AL-Badar, Al- Indo-Bangladesh
Shams, Rajakars, Pro- joint force in the
Pakistan Political Parties and Liberation War.
Pakistani Collaborators, Killing
of the Intellectuals
• Trial of Bangabandhu in
Pakistan and Reaction of the
World Community
• The Contribution of India in
the Liberation War and the
Role of International
Communities
Formation of Joint Command
and the Victory

29
 12, Reconstruction of Bangladesh • analyze the role of • Lecture • Written
13 after 1971 Bangabandhu in • Demonstration Test
• Bangabandhu’s returning reconstructing the • Audio-video • Assignment
to Bangladesh10 war-ravaged projection. Panel
January country. Discussion
1972 • explain the
• Formation of formation of
the constitution.
Constitution • explain the
• Reconstruction of the assassination of
War-Ravaged Country Bangabandhu and
Conspiracy of the Anti- its aftermath.
Liberation Activists and the
Murder of Bangabandhu

Recommended Books:
1. Harun-or-Roshid, The Foreshadowing of Bangladesh: Bengal Muslim League
and Muslim Politics, 1906-1947, The University Press Limited, Dhaka 2012.
2. RounaqJahan, Pakistan: Failure in National Integration, The University Press Limited,
Dhaka 1977.
3. Talukder Maniruzzaman, Radical Politics and the Emergence of
Bangladesh, Mowla, Brothers, Dhaka20

30
COURSE CODE: CSTE 1201, COURSE TITLE: DATA STRUCTURES AND ANALYSIS

Course Code: CSTE 1201, Course Title: Data Structures and Analysis,3 Hours/Week, 3 Credits, Total
Marks 100 (Attendance=5, Continuous Assessment=25, Final exam=70),Year 2, Term 1
Rationale:This course is designed to teach students the fundamental data structures and algorithms and
also implement them by developing program. It will also make them understand basic techniques of
algorithm analysis
Course Objectives:
➢ Understand the behavior of basic data structures array, linked list, stack, queue, tree and graphs.
➢ Develop programs that implement data structure.
➢ Measure the complexity of some familiar searching and sorting algorithms.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials.
Lesson Plan (as per week):

Course Outcome (at the end of the lesson, Teaching Assessment

Contents student should be able to) Learning Strategy Strategy (How
Week

(activities directed they are

to achieve developed)
outcomes)
1 Basic of data Know the importance of data Lecture and Answer basic
structure: structure and algorithms and also discussion with questions,
Concept and demonstrate a thorough detailed quizzes.
importance of data and understanding of how data information about
data structure. Major structures impact the performance the course,
operations of data of algorithms. including the
[Link], Know the basic terminology of objectives, course
Asymptotic Notation linear data structure array, link lists, outcomes,
for complexity of stack, queue and nonlinear data examinations.
algorithms. structure tree, graph. Topic wise lecture
delivery.
2 Arrays: Know how data and records are kept Lecture and Answer basic
Maximization, ordered in array to perform different types of discussion on questions,
lists, sparse matrices, operations like traversing, inserting, characteristics, quizzes,
representation of deleting, searching and sorting. memory allocation Homework,
arrays. Implement basic matrix operations. and different exams.
operations of array.

3 Stacks and Queues: Implement stack, queue using array Lecture and Answer basic
Different types of and linked list. discussion on questions,
stacks and queues: Comprehend the expression formats characteristics, and quizzes,
Circular, dequeues, of prefix, infix and postfix and also different operations Homework,
etc; evaluation of evaluate postfix expressions by of stack and queue. exams.
expressions, multiple using stacks.
stacks and queues; Understand the application of stack
and queue.

31
4 Recursion: Know the basic understanding of Lecture and Exercise with
Direct and indirect recursion. discussion with problems.
recursion, depth of Apply recursive technique to solve problems.
recursion; Simulation some algorithms.
of Recursion, Removal
of recursion.
5 Linked Lists: Organize a list of data in linked list. Lecture and Class Test
Singly linked lists, Implement linked list using linear discussion on 1(topics of the
linked stacks and array and pointer. characteristics, week’s 1-4)
queues, the storage Do basic operations like traverse, memory allocation
pool, polynomial insertion, deletion, reverse, search and different
addition, equivalence and swapping two nodes using operations of linked
relations, sparse linked list. list.
matrices, doubly
linked lists and
dynamic storage
management,
generalized lists,
garbage collection,
and compaction.
6 Trees: Learn basic terminology of tree. Lecture and Answer basic
Basic terminology, Organize data in different types of discussion with questions,

binary trees, binary trees. problems. quizzes,

tree representations, Perform operations using array Homework,
binary tree traversal; based and linked list-based trees. exams.
Extended binary trees: Implement binary search tree, AVL
2trees, internal and search tree, B tree and Huffman's
external path lengths. Algorithm.
7 Huffman Explain and implement Huffman Lecture and Answer basic
codes/algorithms; coding. discussion with questions,
threaded binary trees, Explain decision trees, binary trees. problems. quizzes,
a binary tree Homework,
representation of trees; exams.
Application of Trees:
Set representation,
decision trees, games
trees: Counting binary
trees.

32
8 Graphs: Learn what a graph is and how it is Lecture and Answer basic
Introduction, used. Will also learn some graph discussion with questions,
definitions and algorithms such as shortest path and problems quizzes,
terminology, graph minimum spanning tree. Homework,
representations, Represent graph using two- exams.
traversals, connected dimensional array and linked list
components and and do practical operations on graph
spanning trees, data.
shortest path and Implement BFS and DFS traversal
transitive closure, methods.
activity networks,
topological sort and
critical paths,
enumerating all paths.

9 Sorting: Explain how different sorting Lecture on steps on Class Test

Efficiency algorithms work. different sorting 2(topics of the
considerations, O Implement some sorting algorithms algorithms. week’s5-8)
notation, Bubble sort, and also measure their complexity. Discussion with
Quick sort, Selection problems.
sort, Binary Tree sort
heap, Heap sort, Heap
as a priority queue,
10 Searching: Explain how different searching Lecture on steps on Answer basic
Insertion sort, Shell algorithms work. different searching questions,
sort, Merge sort, Radix Implement some searching algorithms. quizzes,
[Link] algorithms and also measure their Discussion with Homework,
searching, indexed complexity. problems. exams.
sequential searching,
Binary search,
Interpolation search,
Binary tree searching,
Insertion and deletion,
11 Optimum search trees, Understand the basic concept of B Lecture and Answer basic
Height balanced trees, and B+ tree and hash function. discussion with questions,
Single and double Implement B and B+ tree. problems. quizzes,
rotations, Multi way, Homework,
Search trees, B-trees, exams.

B+ trees, Hashing
methods of resolving
clashes, Methods of
choosing Hash
functions.

12 Symbol Tables: Implement symbol tables. Lecture and Class Test

static tree tables, Search for an item having a discussion with 3(topics of the
dynamic tree tables; specified key, insert an item, problems week’s9-12)
remove a specified item, Count the
number of items, Print the list of
items

33
 13 Hash Tables: Hashing Explain the basic of hash tables. Lecture and Exercise the
functions overflow Develop program to create has table discussion on answering
handling, theoretical to store data. miscellaneous methods in final
evaluation of overflow Implement symbol tables using hash topics. exam.
techniques. table.

Recommended Books:
1. Theory and Problems of Data Structures by S. Lipschutz, McGraw Hill
2. Data Structures and Algorithm analysis in C++ by M.A. Weiss,Addison Wesley
3. R Sedgewick, Algorithms in C, Parts 1-4 Fundamentals, Data Structures, Sorting, Searching,
Addison Wesley
4. Algorithms + Data Structures = Programs by Niklaus Wirth, Prentice Hall
5. Fundamentals of Data Structures by E. Horowitz and S. Sahni, Galgotia

COURSE CODE: CSTE 1202, COURSE TITLE: DATA STRUCTURES AND ANALYSIS LAB

Course Code: CSTE 1202, Course Title: Data Structures and Analysis Lab,3 Hours/Week, 1.5
Credits, Total Marks 100 (Class Attendance=10, Internal Evaluation/Observation = 70, Final Viva-voce
=20),Year 2, Term 1
Rationale:This course is designed to implement and develop programs on fundamental data structures
and algorithms. It will also make them understand basic techniques of algorithm analysis.
Course Objectives:
➢ Understand the behavior of basic data structures array, linked list, stack, queue, tree and graphs.
➢ Develop programs that implement data structure.
➢ Measure the complexity of some familiar searching and sorting algorithms.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Code Blocks
IDE
Lesson Plan (as per week):
Course Outcome (at the end of Teaching Learning Assessment
Contents the lesson, student should Strategy (activities Strategy
Week

be able to) directed to achieve (How they are

outcomes) developed)
1-3 Arrays Know how data and Discussion and Answer basic
A program which will store data records are kept in array to practice questions,
in a linear array. perform different types of quizzes,
Program to travers, insert, delete operations. Homework,
in a linear array. Implement searching and exams.
To find a given target number sorting algorithms.
using linear search from the list Differentiate different
of numbers. searching and sorting

34
 To find a given target number algorithm.
using Binary Search from the list
of number.
To find the maximum and
minimum value in a given list of
numbers.
To sort the given data using
selection sort.
To sort the given data using
Bubble sort.
To sort the given data using
Insertion sort.
To sort the given data using
Quick Sort.
Implement basic matrix
operations.
4-6 Stacks and Queues Implement stack, queue Discussion and Answer basic
Implement stack, queue using and their operations. practice. questions,
array and linked list. Comprehend the quizzes,
To perform all stacks operation. expression formats of Homework,
To perform all the queue prefix, infix and postfix exams.
operations. and also evaluate postfix Quiz 1 (Topic
Write a C code to implement expressions by using of the 1-3
queue and dequeue using array. stacks. weeks)
To sort the given data using Understand the application
Merge sort. of stack and queue.
Write a program to create a Stack
and different functionality related
to it (i.e. Push( ), Pop( ), Peak( ),
Traverse( ) ). Implement it using
linked Structure.
7 Recursion Apply recursive technique Lecture and Exercise with
Problems to solve using recursive to solve problems. discussion with problems.
technique. problems.

8-9 Linked Lists Implement the basic Discussion and Answer basic
Program which will store data in operations of linked list. practice questions,
linked list. quizzes,
Program which will implement Homework,
linked list using linear array and exams.
pointer.
Program which will do some
basic operations in a singly linked
list like traverse, insertion,
deletion, reverse, search and
swapping.

35
 10- Trees Perform operations using Lecture, discussion Answer basic
11 Write a C code to implement array based and linked list- with problems and questions,
binary search tree insertion, based trees. practice. quizzes,
deletion, search, and traverse Homework,
operations. exams.
Write program for Huffman Quiz 2 (Topic
algorithm. of the 4-9
weeks)

12 Graphs Represent graph using Discussion and Answer basic

Implement BFS and DFS two-dimensional array and practice questions,
traversal methods. linked list and do practical quizzes,
Implement minimum spanning operations on graph data. Homework,
tree algorithm. exams.
Quiz 3 (Topic
of the 10-13
weeks)
13 Final Lab Exam (Lab and Viva)

COURSE CODE: CSTE 1203, COURSE TITLE: NUMERICAL ANALYSIS

Course Code: CSTE 1203Course Title: Numerical Analysis, 3Hours/Week, 3 Credits, Total Marks
100 (Attendance=5, Continuous Assessment=25, Final exam=70), Year 1, Term 2
Rationale:The course deals with the concept of numerical computation on computer and analysis of
errors and accuracy of different numerical solutions.
Course Objectives:
➢ To understand the fundamental concept of digital computing, including number representation
and arithmetic’s operations.
➢ To provide the student with numerical methods of solving the non-linear equations,
interpolation, differentiation and integration.
➢ To apply numerical methods to obtain approximate solutions to mathematical problems.
➢ To understand the basic concepts of concrete mathematics.

Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Question bank,
Previous questions.
Lesson Plan (as per week):
Course Outcome (at the end of Teaching Learning Assessment
Contents the lesson, student should Strategy (activities Strategy (How
Week

be able to) directed to achieve they are

outcomes) developed)
1 Numerical analysis: Learn number Lecture and Answer basic
Computer Number representation and linkage discussion with questions,
Systems; Overflow and between error, accuracy detailed information quizzes,
underflow; and stability of a number. about the course, Homework,
Approximation in including the exams.
numerical computation; objectives, course
Truncation and round off outcomes,
errors; examinations. Topic
wise lecture
delivery.
36
2 Numerical analysis: Understand the Lecture and Answer basic
Propagation and control propagation of error discussion and questions,
of round off errors; through complex analyze the quizzes,
Chopping and rounding numerical algorithms. accuracy. Homework,
off errors; Pitfalls exams.
(hazards) in numerical
computations (ill
conditioned and well-
conditioned problems).
3 Numerical Solution of Apply appropriate Lecture and Answer basic
System of Linear numerical method to computation of questions,
Equations: Gauss determine approximate linear equation quizzes,
elimination method; solutions to system of solution methods. Homework.
Matrix Inversion; linear equation.
Operations Count;
4 Numerical Solution of Apply appropriate Lecture and Answer basic
System of Linear numerical method to decomposition of questions,
Equations: LU determine approximate linear systems quizzes,
Factorization Method solutions to system of Homework,
(Crout’s Method); Gauss- linear equations. exams.
Jordan Method; Gauss-
Seidel Method; Sufficient
Condition of
Convergence.
5 Numerical Solution of Apply appropriate Lecture and Class Test 1 6
Algebraic and numerical method to discussion on non- (topics of the
Transcendental determine approximate linear equations week’s 1-4)
Equations: Iteration solutions to non-linear solution.
Method; Bisection equations.
Method; Secant
Method;

6 Numerical Solution of Apply appropriate Lecture and Answer basic 7

Algebraic and numerical method to discussion on non- questions,
Transcendental determine approximate linear equations quizzes,
Equations: Regula-Falsi solutions to non-linear solution. Homework,
Method; Newton- equations. exams.
Raphson Method.

7 Interpolation: Find interpolation for Lecture and problem Answer basic 8

Lagrange’s Interpolation, given point using solving on questions,
Newton’s forward & Lagrange’s and Newtons interpolation. quizzes,
backward Interpolation methods. Homework,
Formula. exams.

8 Interpolation: Find divided difference, Lecture and Exercise with

Extrapolation; Newton’s and error computation of discussion on divided various

37
 Divided Difference given solution. difference and mathematical
Formula; Error; problem solving. problems.
Problems.
9 Numerical Find differentiation using Lecture and analysis Class Test 2
Differentiation: Use of numerical method from on numerical (topics of the
Newton’s forward and given data. differentiation with week’s 5-8)
backward interpolation problems.
formula only.
10 Numerical Integration: Find integration for given Lecture and Answer basic
Trapezoidal formula areas using numerical discussion on questions,
(composite); Simson’s methods. numerical quizzes,
1/3rd formula integration methods Homework,
(composite); Romberg with problems. exams.
Integration (statement
only); Problems.
11 Numerical Solution of Find numerical solutions Lecture and analysis Quizzes,
Initial Value Problems of initial value problems of Differential Homework,
of First Order Ordinary of first order ordinary equations. exams.
Differential Equations: differential equations.
Taylor’s Series Method;
Euler’s Method; Runge-
Kutta Method (4th order);
12 Numerical Solution of Learn improved numerical Lecture and Class Test
Initial Value Problems methods to find solutions discussion on 3(topics of the
of First Order Ordinary of initial value problems Differential weeks9-11)
Differential Equations: of first order ordinary equations.
Modified Euler’s Method differential equations.
and Adams-Moulton
Method.
13 Concrete Mathematics: Understand basic number Lecture and Exercise the
Recurrence, Sums, theory, recurrence discussion on answering
Number Theory, Discrete solution of different concrete methods in the
Probability. problems. mathematics. final exam.

Recommended Books:
1. Introductory Methods of Numerical Analysis by S. S. Sastry, Prentice-Hall.
2. Numerical Methods for Engineers by Steven C. Chapra,Raymond P. Canale, McGraw-Hill.
Concrete Mathematics by Donald L. Graham, Donald. Knuth, Oren Patashnik, Prentice Hal

38
 COURSE CODE: CSTE 1204, COURSE TITLE: NUMERICAL ANALYSIS LAB

Course Code: CSTE 1204, Course Title: Numerical Analysis Lab, 2 Hours/Week, 1 Credits, Total
Marks 100 ( ClassAttendance=10, Internal Evaluation/Observation = 70, Final Viva-voce =20), Year 1,
Term 2
Rationale:This course provides practical knowledge of computation of numerical problems using
computer programming.
Course Objectives:
➢ To understand the fundamental concept of digital computing, including number representation
and arithmetic’s operations.
➢ To provide the student with numerical methods of solving the non-linear equations,
interpolation, differentiation and integration.
➢ To apply numerical methods to obtain approximate solutions to mathematical problems.
➢ To understand the basic concepts of concrete mathematics.

Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, C/C++
compiler, programming problems.
Lesson Plan (as per week):
Course Outcome (at the end Teaching Assessment
Contents of the lesson, student Learning Strategy
should be able to) Strategy (How they
(activities are
directed to developed)
Week

achieve
outcomes)
1, Write a program to compute Learn numeric Lecture and -Home task
2 𝑦=𝑒 −𝑥3/2 for 0.1 ≤ 𝑥 ≤ 2 in steps computation and practice -Quiz
of 0.1 error calculation.

Write a program to compute

𝑦 = 5𝑥3 + 𝑒−2𝑥 for 0.1 ≤ 𝑥 ≤ 2 in
steps of 0.1

Write a program to compute the

value of i) 𝑒𝑥 ii) ln (1 + 𝑥) iii)
ln (1 + 𝑥) from Maclaurin
expansion truncated after the 6th term.

3 Write a program to find a real root of Find practical Lecture and -Home task
a nonlinear equation using Bisection knowledge and practice -Quiz
method, False position method, numerical solution of
Newton-Raphson method. non-linear system.
a) ex – 3x = 0
b) x3 - 6x + 4 = 0
c) x log10 x - 1.2 = 0

39
4 matrix form according to Understand Matrix Lecture and Quiz 1
given number of columns and representation using practice of (Topic of the
rows. programming matrix. 1-3 weeks)
ii. Represent the above matrix A language.
as an upper-triangular.
iii. Represent the above matrix A
as a lower-triangular matrix
iv. Represent the above matrix A
as a diagonal matrix.

Write a program to find (i) the

determinant of a square matrix A and
also find
(ii) the transpose, adjoint and
inverse matrix of a square
matrix A.

5, Write a program to solve a system of Solve different linear Discusion and Homework
6 linear equations using Matrix system equation practice on non-
Inversion method. using practical linear equations
knowledge. solution.
Write a program to solve a system of
linear equations using simple
Gaussian elimination method.

Write a program to solve a system of

linear equations using simple
Gaussian-Seidel method (iterative
method).

7- The following values of f (x) are Find missing value Discussion and Quiz 2
9 given. from a given data set. practice about (Topic of the
x=12345; interpolation. 4-6 weeks)
y = f(x) 1 8 27 64 125
Write a program to find the values of
y when x = 1.7 by using Newton's
forward interpolation formula and
when x = 4.7 by using Newton's
backward interpolation formula.

Write a program to find numerical

solution using Lagrange’s equation
and Newtons formula for unequal
interval.

40
10 Write a program to solve the Solve first order Discussion and Homework.
- following Differential Equation by differential equation practice.
11 using Euler’s method. dy / dx = x3 + using C/C++.
y, y (0) = 1. Compute y (0.02) taking
h = 0.01.

Write a program to solve the

following Differential Equation by
using Runge – Kutta method. dy / dx
= x + y, y (0) = 1. Compute y (0.1)
and y (0.2) taking h = 0.1.
12 Write a program to integrate a Solve practical Discussion and Answer basic
tabulated function using the problem of numerical problem solving questions,
trapezoidal rule. integration. on numerical quizzes,
integration. Homework,
Write a program to integrate a exams.
tabulated function using the
Simpson’s 1/3 rule.

13 Write a program to find GCD of two Practical analysis of Answer basic

or more numbers. concrete mathematics questions,
problems. Homework
Tower of Hanoi problem, Pizza Quiz 3
cutting problem etc. (Topic of the
Note: Basic Number 8-13 weeks)
Theory/probability related problems.

41
COURSE CODE: CSTE 1205, COURSE TITLE: DISCRETE MATHEMATICS

Course Code: CSTE 1205, Course Title: DISCRETE MATHEMATICS, 3 Hours/Week, 3 Credits,
Total Marks 100 (Attendance=5, Continuous Assessment=25, Final exam=70), Year 1, Term 2
Rationale: This course has been designed to develop the students’ ability to realize the mathematical
reasoning, combinatorial analysis, discrete structures, algorithmic thinking, applications and modeling.
Course Objectives:
➢ Students must understand mathematical reasoning in order to read, comprehend and construct
mathematical arguments.
➢ An important problem-solving skill is the ability to count or enumerate objects.
➢ A course in discrete mathematics should teach students how to work discrete structures include sets,
permutations, relations, graphs, trees and finite-state machines.
➢ Certain classes of problems are solved by the specification of an algorithm.
➢ Discrete mathematics has applications to almost every conceivable area of study.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Device manual,
Question bank, Previous questions.
Lesson Plan (as per week):
Course Outcome (at the end of the lesson, Teaching Learning Assessment
Week

Contents student should be able to) Strategy(activities Strategy(How

directed to achieve they are
outcomes) developed)
1 Introduction to Set and set operations. Overall discussion with Answer basic
sets, elements and To provide foundations for the students must be questions, group
notations; mathematics. needed about the discussion,
universal set, To identify and use set properties and course contents homework.
empty set and set notations. including the
subsets; all set To learn the basic concept of set objectives, course
operations; Venn theory, types of sets and operations outcomes,
diagrams, set of sets. examinations, physical
identities, classes To solve exercises, objective type environment and
of sets; computer problems and supplementary methodology.
representation of problems. An interactive
sets. approach must be
needed to teach the set
theory and all sets
operations
inclassroom.
Demonstrate
problem solving
techniques.

42
2 Definition of Functions and function Delivering lecture and Problems must
function, different applications. overall discussion with will be solved
types of To understand the definition of a the students must be correctly in
functions. function and different types of needed about several classroom.
Graphs of functions. topics of functions Home works and
functions, floor To recognize and use the graphs of interactively in assignments
functions and the basic functions. classroom. must be
celling functions. To draw the compositions of Demonstrate different submitted
Inverse functions, functions and relations of functions graphs of functions, regularly.
Euler’s function graphically. composition of
and compositions functions and relations
of functions. of functions.
Function Several examples will
relations. be solved in classroom.
3 Definition of Recurrence relations & generating Delivering lecture and Answer basic
recurrence functions. overall discussion with questions, group
relations, solving To understand the definition of the students must be discussion,
linear recurrence relations & generating needed about several assignments.
homogeneous functionsuse the Boolean expressions topics of recurrence
recurrence with real life problem. relations & generating
relations with To solve linear homogeneous functions interactively
constant recurrence relations with constant in classroom.
coefficients. coefficients. Demonstrate various
Definition of To power series and recurrence calculations to solve
generating relations using generating functions. recurrence relations of
functions, useful functions, power series
facts about power and recurrence
series and using relations using
generating generating functions.
functions to solve Showing several
recurrence problem-solving
relations. techniques to the
students in the
classroom.
4 Representations Integer and algorithms. Demonstrate various Exercise with
of integers, binary To calculate binary and hexadecimal calculations to solve various
expansions, expansions. binary and mathematical
hexadecimal To understand the algorithms to find hexadecimal problems.
expansions. out modular exponentiation. expansions.
Algorithms for To understand Euclidean algorithm Demonstrate
integer to find out the greatest common algorithms to find out
operations, divisor. modular
modular exponentiation and the
exponentiation. greatest common
Euclidean divisor.
algorithm.
5 Principle and Inclusion- exclusion & Binomial Showing several Class Test
applications of coefficients. problem-solving 1(topics of the

43
 Inclusion- To solve different examples on techniques to the week’s 1-4)
exclusion. principle of inclusion-exclusion. students to solve
Binomial To calculate binomial coefficients several problems on
theorem, from different expressions. principle of inclusion-
examples, To draw PASCAL’S Triangle using [Link] the
PASCAL’S PASCAL’S IDENTITY. classroom.
IDENTITY and Demonstrate
TRIANGLE. techniques to draw
PASCAL’S Triangle
using PASCAL’S
IDENTITY.
6 Basic concept of Permutations and Combinations. Lecture and discussion Q & A session,
permutation, To solve different problems using on basic concepts of group
examples, permutation principle with different permutation and discussion,
permutations with arrangements and ways. combination principles. assignments.
repetitions. To different problems using Discuss on sample
Basic concept of combination principle with different problems using
combination, arrangements and ways. permutation and
examples, combination principles.
combinations
with repetitions.
7 Introduction of Graph terminologies. Lecture and discussion Answer basic
graphs, types of To solve different problems using on graph questions, home
graphs, graph graph terminologies. terminologies, bipartite works.
terminology, To know about bipartite graph and graph, application of
bipartite graphs, application of graph and representing graph and representing
application of graphs as adjacency matrices and graphs in different
graph, incidence matrices. ways.
representing
graphs.

8 Graph Graph applications. Lecture and discussion Answer basic

isomorphism, To solve different properties of on graph properties, questions, group
connectivity, graphs. different types path and discussion,
Euler path, To know about different types path graph coloring. assignments.
shortest path and graph coloring.
algorithm, graph
coloring.
9 Introduction to Tree terminologies. Lecture and discussion Class Test
tree, rooted tree, To know about different tree on tree terminologies, 2(topics of the
binary tree, tree terminologies. different types traversal week’s 5-8)
parameters, To understand know about traversal algorithms to solve
properties of tree, algorithms solve related exercises. related exercises.
Tree traversal
algorithms.

44
 10 Infix, prefix and Binary and spanning trees. Lecture and Problems must
postfix notations To design binary trees by using infix, explanation on infix, will be solved
and algorithms, prefix and postfix algorithms. prefix and postfix correctly in
binary tree To design minimum spanning tree by algorithms to design classroom.
representation, using Prim’s and Kruskal’s binary trees and also Home works and
spanning tree, algorithms. Prim’s and Kruskal’s assignments
minimum . algorithms to design must be
spanning tree. minimum spanning submitted
tree. regularly.

11 Cryptology and Finite Geometries. Lecture on design and Q & A session,

coding theory, To understand cryptology, finite applications of group
Finite fields and fields and Latin squares, finite cryptology, finite fields discussion,
Latin Squares, geometry designs, Hamming and and Latin squares, assignments.
Finite geometry other codes. finite geometry
and designs, designs, Hamming and
Basic ideas of other codes.
public key
cryptology and
the theory of error
correcting codes,
Hamming code.
12 Random Random Variables and Stochastic Lecture and Class Test
variables, Processes. explanation on the pros 3(topics of the
Functions of To understand the pros and cons of and cons of random week’s 9-12)
random variables, random Variables and stochastic Variables and
Sequences of processes. stochastic processes.
random variables,
Stochastic
processes,
Markov chains,
Markov processes
and queuing
theory.
13 Review topics Learn about latest trends and the Lecture and discussion Exercise the
and Final exam better answering methods in the final on miscellaneous answering
preparation. exam. topics. methods in final
exam.

Recommended Books:
1. Discrete Mathematics and its application by Kenneth H. Rosen, McGraw-Hill.
2. Theory and Problems of Discrete Mathematics by Seymour Lipschutz, Schaum's Series, McGraw-Hill.
3. Discrete Mathematics structures with applications to Computer Science by J. P. Tremblay and R.
Manohar, Mc-Graw Hill.
4. Elements of Discrete Mathematics by C.L. Liu, McGraw-Hill.

COURSE CODE: CSTE 1207, COURSE TITLE: ELECTRONIC DEVICES AND CIRCUITS

Course Code: CSTE 1207, Course Title: Electronic Devices and Circuits,3 Hours/Week, 3 Credits, Total
Marks 100 (Attendance=5, Continuous Assessment=25, Final exam=70),Year 1, Term 2

45
Rationale: This course is designed to understand the construction, working and uses of unipolar and bipolar
devices, Oscillator, Operational amplifier and pnpn devices.
Course Objectives:
➢ Make the students familiarize with unipolar and bipolar transistor. The construction, working,
characteristics and practical application of unipolar and bipolar devices will be introduced to students.
➢ To give knowledge how transistor is biased and signal is amplified. To analyze various amplifier circuit
and their uses.
➢ To give the concept about positive and negative feedback in electronic circuit, practical feedback circuit
and oscillator circuits.
➢ To give idea about voltage regulator, industrial electronic devices and optoelectronics devices.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Device manual,
Question bank, Previous questions.

Lesson Plan (as per week):

Course Outcome (at Teaching Assessment
Contents the end of Learning Strategy(Ho
Week

the lesson, Strategy(activiti w they are

student es directed to developed)
should be achieve
able to) outcomes)
1 Semiconductor and PN junction: Electronic structure of Comparison Lecture and Answer
the elements, Energy band diagram of insulators, of discussion with basic
semiconductors & metals. Thep-njunction, Clipping and conductor, detailed questions,
clamping circuits, different types of diodes semiconduct information quizzes,
or and about the course, Homework,
insulator. including the exams
Construction objectives,
, working course outcomes,
principle [Link]
and uses of pic wise lecture
pn junction. delivery.
How diode
use for
clipping and
clamping
circuit. The
concept of
load line.
Applications
of diodes for
voltage
regulation.
2 Principle of bipolar transistor Transistor Lecture and Answer
Junction transistor, npn and pnp transistors, principle of construction discussion with basic
transistor action, potential distribution through a and problems questions,
transistor, transistor current components, emitter operation in quizzes,
efficiency. different Homework,
configuration exams.
s.
3 Characteristics of transistor: Variation of Lecture and Answer
Transistor as an amplifier, transistor characteristics in CB, collector, discussion with basic
CE and CC configurations. Concept of load line. Dynamic emitter and characteristics questions,

46
 transfer curves of Ge and Si transistor. base current parameters of quizzes,
in different transistor Homework,
configuration families exams.
s. Relation individually.
between
amplification
factors. What
is load line
and why this
is important.

4 DC Biasing and Load line: Operation of Lecture and Answer

The operating point, capacitive coupling, the static and transistor discussion with basic
dynamic load lines, bias stability, thermal stability. using fixed problems. questions,
Analyzing of different types biasing circuit. bias, emitter quizzes,
bias and Homework,
voltage exams.
divider bias
and which
bias is good
for transistor
stability. The
importance
of load line
to operate
transistor

5 Transistor as an amplifier: Explanation Lecture and Exercise

Classification of amplifier, BJT small signal amplifier of different discussion with with various
circuit analysis in three configuration using different types of problems. mathematica
biasing circuit. Push-pull amplifier. amplifier and l problems.
their
applications.
6 BJT AC analysis and Transistor model: To know the Transistor Class Test
BJT transistor modeling, the re transistor model, the actual modeling. 1(topics of
hybrid equivalent model behavior of a the week’s
semiconduct 1-4)
or device
using
different
model under
specific
operating
conditions.

47
7 Oscillator: Explanation Lecture, Answer
Feedback and circuit requirements for oscillation, of feedback discussion and basic
Nyquest criterion. connection, design. questions,
Sinusoidal oscillators, Barkhousen criterion, phase shift circuits and quizzes,
oscillators, resonant circuit oscillators, Colpitt’s and amplifier. Homework,
Hartly’s oscillator, Wein bridge oscillator, Crystal Explanation exams.
oscillator, frequency stability. of different
types of
oscillator
circuit,
operation
and their
applications.
Understandin
g series and
parallel
resonant
circuit.
8 Operational amplifier: Lecture on Answer
Basic differential amplifier, differential amplifier circuits, Explain design and basic
differential amplifier with current mirror and active load. operational applications of questions,

Basics of operational amplifier. amplifier with basic the circuits. quizzes,

properties, Homework,
application of exams.
operational amplifier
and design new
Op-Amp based
circuit.

9 The ideal OpAmp, Study of OpAmp parameters, Use of OpAmp as Lecture on Class Test
OpAmp circuits, Active filters, Voltage filter circuit. design and 2(topics of
regulation. Explanation of applications of the week’s5-
voltage the circuits. 8)
regulation.

10 Field effect transistor: Explain FET and its Lecture on Answer

JFET:construction, operation, static characteristic s, uses design and basic
currecteristics, small signal model and and application. applications of questions,
parameters. the circuits. quizzes,
Homework,
exams.

48
11 MOSFET: Explanation of Lecture on Quizzes,
MOSFET:different types,operation, depletion type and design and Homework,
characteristics curves,DC biasing of depletion enhancement type applications of exams.
type and enhancement type MOSFET. MOSFET, the circuits.
characteristic s and
applications.

12 Industrial electronic devices: Thyristors, SCR, Analyze and Lecture on Class Test
TRIAC,
UJT, PUT, DIAC, Shockley diode. explain pnpn design and 3(topics of
LED,LiquidCrystaldisplays(LCD)Photodiodes,Photo based circuit applications of the weeks9-
transisto
rs,Opto- isolators,Solarcells. and their the circuits. 11)
applications,
design new
multilayered
devices
based on the
explanations
and probable
applications.
13 Unregulatedpowersupply,regulatedpowersupply,regulatorI Explore Lecture and
Cs,reg
ulator circuits. Introduction, Advantage, Drawback, practical discussion of
Scale of
integration, Classification by structure and function power supply power supply
of
integrated circuit, How ICs are made? circuits, and integrated
concept of circuit.
voltage
regulation.
Construction
and uses of
integrated
circuit.
Classificatio
n and
function of
integrated
circuit.

Recommended Books:
1. [Link],McGraw-HillInc.
2. ElectronicPrinciplesbyAlbertPaulMalvino,CareerEducation.
3. [Link],PrenticeHall.

49
 COURSE CODE: CSTE 1208, COURSE TITLE: ELECTRONIC DEVICES AND CIRCUITS LAB

Course Code: CSTE 1208, Course Title: Electronic Devices and Circuits Lab, 2 Hours/Week, 1 Credits,
Total Marks 100 (Class Attendance=10, Internal Evaluation/Observation = 70, Final Viva-voce =20), Year 1,
Term 2
Rationale: This lab course is designed to understand the concepts, working and characteristics of Different
Diodes, BJT and FET Transistors, amplifiers and compensation techniques of transistors.
Course Objectives:
➢ Verify the working of different diodes, transistors, CRO probes and measuring instruments.
Identifying the procedure of doing the experiment.
➢ Design the circuits with basic semiconductor devices (active & passive elements), measuring
instruments & power supplies that serves many practical purposes.
➢ Construct, analyze and troubleshoot the designed circuits.
➢ Measure and record the experimental data, analyze the results, and prepare a formal laboratory report.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Device manual,
Question bank, Previous questions.
Lesson Plan (as per week):
Course Outcome (at the end of the Teaching Learning Assessment
Contents lesson, student should be able Strategy (activities Strategy
Week

to) directed to achieve (How they are

outcomes) developed)
1. To familiar with electronic gain significant experience Lecture and Answer basic
devices and Laboratory with electrical instruments discussion with questions
Equipment. such as function generators, detailed information about
digital multimeters, about the lab course, different types
oscilloscopes, and power including the of
supplies etc. objectives, course instruments.
outcomes, lab
examinations and
evaluation method.
2, Determination of unknown signal Through lecture, Neatness,
3, frequency and voltage by using laboratory, and out-of- organization,
4, Oscilloscope. class assignments. completeness
5 Study of lead identification and and
testing of diode, BJT, FET, and individually
MOSFET. written lab
To study of V-I Characteristics reports are
curve of a General Diode and due at the
Zener diode. beginning of
To study of Full-Wave the lab period.
Rectification circuit (Bridge & Respected

Center tap) and Half-wave circuit. Teacher will

To study of Clipper and Clamper be evaluated
circuit and draw the output in lab period.
waveshape.
6, To study of Common Emitter Through lecture,
7 (CE), Common Collector (CC) laboratory, and out-of-
and Common Base (CB) class assignments.
Transistor Amplifier circuits.

50
8, To study of output characteristics Through lecture,
9 of a FET. laboratory, and out-of-
To study of JFET as an amplifier. class assignments.

10, To study of output characteristics Through lecture,

11 of a JFET. laboratory, and out-of-
Study of MOSFET as a switch. class assignments.
12 Submit a mini project in a group
13 Final Lab Exam (Job, Quiz and Viva)

COURSE CODE: MATH 1203, COURSE TITLE: ORDINARY AND PARTIAL DIFFERENTIAL
EQUATIONS

Course Code: MATH 1203, Course Title: Ordinary and Partial Differential Equations, 2 Hours/Week,
2 Credits, Total Marks 100 (Attendance=5, Continuous Assessment=25, Final exam=70),Year 1, Term 2
Rationale: Ordinary and Partial Differential Equations (4:4:0). First- and second-order equations; series
solutions; Laplace transform solutions; higher order equations; Fourier series; second-order partial
differential equations.
Course Objectives:
➢ During this course students will obtain knowledge of approaches to modeling by differential equations,
basic theorems on existence of solutions and methods for analytical solving linear and non-linear
ordinary and partial differential equations.
➢ Furthermore, students will develop skills in using Lie group analysis for solving nonlinear ordinary and
partial differential equations.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Previous questions.
Lesson Plan (as per week):
Course Outcome (at the end of the Teaching Learning Assessment
Week

Contents lesson, student should be able Strategy(activities Strategy(How

to) directed to achieve they are
outcomes) developed)
1-2 Introduction Formulate and solve Lecture and discussion Answer basic
• Direction Fields differential equation with detailed questions and
• Solution of Some problems in the field of information about Homework.
Differential Equations Engineering. topic.
• Classification of
Differential Equation
3-4 First Order Differential Use computational tools to Lecture and discussion Answer basic
Equations solve problems and with detailed questions and
• Linear Equations with applications of Ordinary information about Homework.
Variable Coefficient Differential topic.
• Separable Equations Equations.
• Modeling with First
Order Equations

51
 • Differences between
Linear and Nonlinear
Equation.
• Autonomous Equations
and Population
Dynamics
• Exact Equation
5-8 Second Order Linear Use computational tools to Lecture and discussion Class Test
Differential Equations solve problems and with problems. 1(topics of the
• Homogenous Equations applications of second order week’s 1-4)
with Constant Ordinary Differential
Coefficients. Equations.
• Fundamental Solutions
of Linear Homogeneous
Equation.
• Complex Roots of the
Characteristic Equations
Repeated Roots;
• Reduction of Order
Nonhomogeneous
Equations.
9-11 Higher Order Linear Use computational tools to Lecture and discussion Class Test
Equations solve problems and with detailed 2(topics of the
• General Theory of 11-th applications of higher order information about week’s 5-8)
Order Linear Equations. Ordinary Differential topic.
• Heterogeneous Equations.
Equations with Constant
Coefficients.
11- The Laplace Transform Lecture and discussion Class Test
13 • Definition of the Laplace with detailed 3(topics of the
transforms. information about week’s 9-11)
• Solution of initial Value topic.
Problems
• Step Functions.
• Differential Equations
with Discontinuous
Forcing Functions.
• Impulse Function.

Recommended Books:
1. Elementary differentiate equations and boundary value problems. 9th Ed. W.E. Boyce and RCDiprima,
John Wiley and Sons Inc.

52
 COURSE CODE: HUM 1201, COURSE TITLE: INDUSTRIAL MANAGEMENT AND
ACCOUNTANCY

Course Code: HUM 1201, Course Title: Industrial Management and Accountancy, 3 Hours/Week, 3
Credits, Total Marks 100 (Attendance=5, Continuous Assessment=25, Final exam=70), Year 1 Term 2
Rationale: This course has been designed to develop the students’ ability to realize the different business
operations and working with different business methods.
Course Objectives:
➢ Make the students familiarize with business concepts.
➢ Analyze and Apply different strategies of marketing.

➢ Effective use of basic accounting in different application design.

Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Device manual,
Question bank, Previous questions.
Lesson Plan (as per week):
Course contents Outcome (at the end of the Teacher Learning Assessment
Week

session, student should be strategy Strategy

able to) (activities directed to (How they are
achieve outcomes) developed)
1. Business concepts: Explain the basic concepts Lecture and Answer basic
Business and Industry, of business and industry. discussion with questions,
Business and society, Discuss different types of detailed information quizzes,
Business environment, business and industry, the about the course, Homework,
Ethical issues of business objectives of business, and including the exams.
how business affects objectives, course
society. outcomes,
examinations,
physical
environment and
methodology with
the students.
Brief discussion
about business.
2. Management and Explain the basic concepts of Lecture and Answer basic
Organizational concepts management and its discussion with questions,
Management principles and functionality and corporate detailed information quizzes,
functions, activities. Discuss levels and about management Homework,
Levels of management, roles of management, and and its principles, exams.
Roles of management, different skills, activities, functions, levels,
Scientific management and and responsibilities of roles, responsibilities
core management skills, management. and skills.
Corporate activities,
Corporate Social
responsibilities,
Concept of business
management,
Organizational Structure of
the industrial organization
3. Management Strategy: Explain the basic concepts of Lecture and Answer basic
Strategy formulation in IT strategies, strategies discussion about questions,
industry, technological formulation in IT industry, management quizzes,
development strategy and technological development strategies, SWOT Homework,
planning,SWOT analysis, strategy and planning. Use analysis, planning exams.
53
 PPM,Competitive PPM, superiority and SWOT and how it connects
superiority, Customer analysis for proper with IT industries.
satisfaction, alliance, maintenance of management.
merger, acquisition and
integration.
4. Marketing Strategy: Explain the basic concepts of Lecture and Answer basic
Market and marketing, marketing, market research, discussion about questions,
Market research, business strategies and marketing and quizzes,
Sales/product planning, management system. customer’s Homework,
Sales promotion, Customer Improve sales and different satisfaction survey. exams.
satisfaction survey, strategies for sales
Business strategy and goal promotion. Survey customer
evaluation, Business satisfaction and evaluate goal

management system. of the business.

5. Human Resource Explain the basic concepts of Lecture and Class Test
Management and HRM functions and model. discussion about 1(topics of the
Industrial Relations: Know the recruitment and HRM and its week’s 1-4)
Concept of HRM, selection procedure. Explain functions and
HRM functions and model, industrial relations, workers’ models, workers
recruitment, selection participation and payment payment recruitment
Industrial relations and procedure. and job enrichment.
disputes, handling of
grievances, labor welfare,
Workers’ participation,
Motivation, leadership,
collective bargaining,
training and trade union,
Payment, job satisfaction
and job enrichment
6. Health, Safety and Explain Classification, Lecture and Answer basic
Industrial Environment: causes and effects of discussion about questions,
Accidents, Safety accidents, safety safety, accidents and quizzes,
consciousness, publicity, consciousness, basics of environment Homework,
procedures, and measures. environmental pollution, and pollution. exams.
Environmental pollution, various acts and management
control acts for air, water, techniques for controlling the
solid waste and noise. pollution.

7. Project and project Explain the basic concepts of Lecture and Answer basic
management,Project life project and how to manage discussion about questions,
cycle, scope management, industrial projects through project management quizzes,
proposal,Project scheduling, budgeting and and its life cycle, Homework,
scheduling, budgeting and monitoring. scope, scheduling, exams.
procurement, Project budgeting.
54
 monitoring and evaluation.
8. service and service Explain the basic concepts of Lecture and Answer basic
management, Service service and its management. discussion about questions,
management in IT industry, Find service management in service management quizzes,
IT-IL system diagram, IT industry. Explain IT-IL and its impact on IT Homework,
framework, Service diagram, framework, service industry. exams.
support, delivery, facility support, delivery, facility
management, System audit management. Audit different
and internal control. system and control internal
affairs.

9. Materials Management: Explain materials used in Lecture and Class Test

Material in industry, industry, inventory control discussion about 2(topics of the
inventory control model, procedure, safety stock, materials week’s5-8)
ABC analysis, safety stock, economic ordering and ABC management and its
reorder, level, economic analysis. Record stores purchasing
ordering quantity, Stores equipment, purchasing procedures, records
equipment, Purchasing procedures. and handling.
procedures, Bin card,
cardex, material handling,
Manual lifting, hoist,
cranes, conveyors, trucks
and fore trucks.
10. Operations research and Explain the basic concepts of Lecture and Answer basic
Industrial Engineering: operation research, charts, discussion about questions,
Operation research, charts, and diagram of operations research, quizzes,
and diagram of understanding operations. methods of job Homework,
understanding operations, Describe different methods analysis and decision exams.
job analysis, operational of job analysis and making and concepts
planning, decision-making, operational planning, of standardization
problem solving methods, decision making, and
Standardization problem solving. Explain
organizations and standardization and examples
specifications (ISO). of standardization.
11. Basics ofAccounting: Explain briefly the history, Lecture and Quizzes,
Concepts of accounting, scope, nature, purpose, discussion about Homework,
Accounting equation, classification of accounting. accounting, its cycle exams.
classification of account, Describe double entry journal, ledger, trial
Double entry system, system and rules for balance and financial
Accounting cycle journal, determining debit and credit. statement analysis.
ledger and trial balance, Work with accounting cycle
Preparation of financial journal, ledger and trial
statements, Financial balance. Analyze financial
statement analysis and statement and interpretation
interpretation: ratio ratio.
analysis

55
 12. Cost Accounting: Explain cost concepts, Lecture and Class Test 3
Cost concept, meaning of costs, different discussion on Cost (topics of the
Contribution margin, ratio types of costs, ratio analysis, concepts, break-even week’s9-12)
analysis, Break-even break-even analysis and CVP analysis and CVP
analysis, relationship in Graphical relationship
CVP relationship Form and target net profit
analysis.
13. Miscellaneous and Final Learn about latest trends and Lecture and Exercise the
exam preparation the better answering methods discussion on answering
in final exam. miscellaneous methods in
subjects final exam.

Recommended books:
1. Management by Harold Koontz and Heinz Weihrich, McGraw-Hill.
2. Business Organization and Management by M. C. Shukla, S. Chand.
3. Operation Management by Krajewski and Ritzman, Addison-Wesley.
4. Accounting Principles by JJ Weygandt, DE Kieso, PD Kimmel, Latest Edition, John Wiley.
5. Managerial Accounting by Garrison, R H and Noreen, EW, 10th Edition, McGraw-Hill.
6. Introduction to Management Accounting by Horngren, CT and Gary L Sundem, Prentice.
7. Advanced Management Accounting by Kaplan, RS & AA Atkinson, Prentice Hall.

56
 COURSE CODE: CSTE 1226, COURSE TITLE: VIVA VOCE

COURSE CODE: CSTE 1226, COURSE TITLE: VIVA VOCE, 0 Hours/Week, 1 Credits, Total
Marks 100, Year 1, Term 2
Rationale: This course has been designed to develop the students’ ability to realize practical situation
of job environment.
Course Objectives:
➢ Prepare the students to face interview both at the academicand the industrial sector
OUTCOME(Student should be able to)
COURSE CONTENTS
VIVA VOCE (Viva based on major/minor coursesof Evaluate overall technical knowledge
Year-1) and industry readiness.
Able to go under a virtual environment of
technical interview.
Able to analyze various application of
Computer Science &Telecommunication
Engineering inreal-life problem solving.

COURSE CODE: CSTE 2101, COURSE TITLE: OBJECT ORIENTED PROGRAMMING WITH C++

Course Code: CSTE 2101, Course Title: Object Oriented Programming with C++,3 Hours/Week, 3
Credits, Total Marks 100 (Attendance=5, Continuous Assessment=25, Final exam=70),Year 2, Term 1
Rationale:This course is designed to introduce with Object Oriented Programming. It covers OOP
design, implementation and real-life problem-solving using OOP.
Course Objectives:
➢ Introduce with the core concept of Object-oriented Programming
➢ To think and analyze real life problem in OOP way.
➢ Make familiar with OOP tools and implement OOP solution of real-life problem in C++.
➢ Make familiar with some advance features of OOP.
➢ Work in team environment.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials.
Lesson Plan (as per week):
Course Outcome (at the end of the Teaching Learning Assessment
Week

Contents lesson, student should be Strategy (activities Strategy

able to) directed to achieve (How they are
outcomes) developed)

57
1. Fundamentals of object- Understand the basic Lecture and Answer basic
oriented Design: terminology and concept of discussion with questions,
Data Abstraction, OOP. detailed information quizzes, exams.
Encapsulation, classes, Explain basic principle of about the course,
Inheritance and Polymorphism, object-oriented including the
class Hierarchies. Designing programming. objectives, course
and object-oriented system; outcomes,
Identifying the classes, examinations. Topic
Assigning Attributes and wise lecture delivery.
Behavior, finding relationship
between classes, arranging
classes into hierarchies: A
design example.
2. A first look at C++: Take input and show output Lecture on Homework
Using streams for input and using stream concept. characteristics and (stream concept
output, Standard Template Use some common libraries basic operations. and STL),
Library (STL). such as: vector, stack, Some standard exams.
queue, iterators. template libraries will
be introduced.

3. C++ enhancements to C: Write function and Lecture and Answer basic

Default Function Arguments, overload functions. discussion with questions,
Placement of variable Explain the scope of problems solution. exams.
declarations, the scope variables.
resolution operation, the Know the need of scope
“Const” Qualifier, overloaded resolution operation.
functions, OODBMS Explain object-oriented
database.

4. References: Understand how references Lecture and Homework

References as Aliases, work. discussion with (Reference),
references and pointers Explain the similarity and problems. exams.
similarities and differences, differences between
references as function pointers and references.
parameters, references as return
values.
5. Introduction to classes: Understand class concept. Lecture and Class Test
Declaring and using classes, Learn how class is declared discussion on class 1(topics of the
class members, creation and and access its members and object. Accessing week’s 1-4)
destruction of objects, accessing Learn about constructors class members.
data members, returning a and destructors
reference.
6. “Const” objects and member Write member methods and Lecture and Answer basic
function. Classes and dynamic access them. discussion on questions,
memory allocation: New, delete Allocate memory dynamic memory quizzes,
operators. dynamically. allocation of objects. Homework
(Memory
Allocation).

58
7. ‘this’ pointer, Static and Explain the use of this Lecture on this Answer basic
Friend: pointer. pointer, static variable questions,
“this” pointer, Static members, Use static members and and static functions, examples.
friends, array of class objects. static functions. friend function, and
Learn about friend class friend class. Explain
and friend function. their use and
Declare and use the array of necessity.

objects.
8. Inheritance and Understand the basic Lecture on basic of Answer basic
polymorphism: concept of inheritance. inheritance. Explain questions,
Derived class and base class, Know in which order inheritance with real quizzes,
derived class constructors, constructors and destructors life example. examples.
overriding member functions, are called in inheritance.
public, protected and private Know how to override
inheritance. functions in derived
classes.
Explain the public,
protected and private mode
of inheritance.
9. Virtual functions, abstract Understand Run time Lecture on the types Class Test
classes, polymorphism, polymorphism using virtual of inheritance and 2(topics of the
classification of inheritance, function. how to override week’s5-8)
classes within classes. Explain the purpose of methods in
abstract class and when a inheritance using
class is declared as abstract virtual function and
class. application of nested
Explain the different types classes.
of inheritance supported in
C++.
Explain the nested classes.
10. Operator overloading: Explain types of Lecture on operator Answer basic
Overloading unary operator, overloading. overloading with questions,
overloading a binary operator, Know how to overload problems solution. examples.
data conversion. unary and binary operator.
11. File processing: Understand how to process Lecture on file Homework,
File processing – formatted – different types of files. processing using IO examples.
unformatted and random files. Use IO Stream in C++ stream. String
Microsoft foundation classes: Know how to process processing and some
Strings, data structure. string. basic data structure.
Know some basic data
structures.
12. Templates and Lists: Understand the basic of Lecture on the Class Test
Generic actions & types, generic programming. characteristics of 3(topics of the
function templates, class Explain template function generic programming week’s9-11)
templates, sequential lists, and template class. and implement it by
virtual function nuances. Difference between template with some
overloading and template. problem’s solution.
Explain about lists.
Know why virtual functions
are used.

59
 13. Interface and Exception Know how to implement Lecture and Exercise the
Handling: interface. discussion on the use answering
Interface and Exception Know how to write of interface and how methods in
Handling. interface. to handle exception final exam.
Explain the basic of using some problems
exception handling. solution.
Know how to handle
different types of
exception.

Recommended Books:
1. C++ program Design- An introduction to Programming and Object-Oriented Design by James P. Cohon/
Jack W. Davison.
2. Object Oriented Programming in Microsoft C++ by RoberLafore, Galgotia Book House.
3. Object Oriented Programming in Microsoft C++by E. Balagurusamy, TMH.
4. C++ How to Program. Introduction to Object Oriented Design with the UML by Deitel&Deitel, Pearson
Education.
5. Programming with C++ by Schaum’s Outline Series
6. C++- Unleashed The comprehensive Solutions by J. Liberty
8. C++- The Complete Reference by Herbert Schildt, TMH.

60
COURSE CODE: CSTE 2102, COURSE TITLE: OBJECT ORIENTED PROGRAMMING WITH C++
LAB

Course Code: CSTE 2102, Course Title: Object Oriented Programming with C++ Lab, 3
Hours/Week, 1.5 Credits, Total Marks 100 (Class Attendance=10, Internal Evaluation/Observation = 70,
Final Viva-voce =20),Year 2, Term 1
Rationale:This course teaches C++ as a first step to real programming and offers a solid foundation for
the novice to become a competent programmer. It covers OOP design, implementation and real-life
problem-solving using OOP.
Course Objectives:
➢ Think and analyze real life problem in OOP way.
➢ Make familiar with OOP tools and implement OOP solution of real-life problem in C++.
➢ Develop object-oriented programs using C++.
➢ Perform experiments to verify practically the theories and concepts develop in CSTE 2101.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Code Blocks IDE.
Lesson Plan (as per week):
Course Outcome (at the end of the Teaching Learning Assessment
Week

Contents lesson, student should be Strategy (activities Strategy(How

able to) directed to achieve they are
outcomes) developed)
1-2 A first look at C++ • Write programs on Discussion and -Home task
Performing various C++, basic operations in practice -Quiz
I/Operations; C++.
Different input and output • Process string related
technique using streams problems.
concept. • Use some common
String related problems. libraries.
Standard Template Library
(STL): vector, List, stack,
queue, iterators.
3-4 Encapsulation • Identify class and Discussion, practice Answer basic
Problems related to creation objects. and case study questions,
of classes generating • Bind different quizzes,
output. Writing member components of classes. Homework,
variable, member functions, exams.
constructor and destructor.
Problems related to
different access specifiers.
Problems using array of
objects, pointers and
references;

5-6 Inheritance • Write code using Discussion, practice Quiz 1 (Topic of

Experiments related to inheritance and case study the 1-4 weeks)
Introducing Inheritance and relationships.
verification; Inheriting
classes and sharing base
classes functions;

61
7-8 Polymorphism • Implement Discussion, practice Homework, quizz
Problems related to creation polymorphism by and case study
of Overloaded functions writing code.
and constructor.
Problems related to
overloading relational and
logical operators.
Problems related to Method
overriding. Test of
achieving runtime
polymorphism.
9-11 Advance Topic • Able to understand the Discussion, Practice Quiz 2 (Topic of
Problems related to: functionality of these with a real-life the 5-8 weeks)
Static, Pure Virtual advance topics. problem.
Function, Abstract Class, • Handle exception.
Interface, Exception • Write generic program.
Handling and Template
function.
12 Problem Solving • Enhance problem Practice with a real-life Answer basic
Activities solving ability. problem. questions,
Using random access files . Homework
for solving problems; Quiz 3 (Topic of
Problems related to sharing the 9-13 weeks)
common algorithms and
procedures for different
datatype; Problems on
ACM. To perform also
other experiments relevant
to this course.
13 Final Lab Exam (Lab and Viva)

COURSE CODE: CSTE 2103, COURSE TITLE:ALGORITHM DESIGN AND ANALYSIS

Course Code: CSTE 2103, Course Title: Algorithm Design and Analysis, 3 Hours/Week, 3 Credits,
Total Marks 100 (Attendance=5, Continuous Assessment=25, Final exam=70),Year 2, Term 2
Rationale: This course has been designed to develop the students’ ability to realize the internal
functionality of Digital Electronic circuits and hence the logic functions, analyses and applications.

Course Objectives:
➢ Analyze the asymptotic performance of algorithms.
➢ Demonstrate a familiarity with major algorithms and data structures.
➢ Apply algorithmic design paradigms like: greedy, dynamic programming and methods of analysis to
real life problems.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, PDF books, Slides, e-Tutorials,
PowerPoint.
Lesson Plan (as per week):
Course Outcome (at the end of the Teaching Learning Assessment
Week

Contents lesson, student should be Strategy(activities Strategy(How

able to) directed to achieve they are
outcomes) developed)

62
1 Introduction with algorithm: Argue the correctness of Lecture and Answer some
The role of algorithm in algorithms using inductive discussion with some basic question on
computing: proofs and loop invariants basic questions on complexity
-What is algorithm? will be familiar with complexity analysis analysis and
-Algorithm as a technology Substitution and master time and space Solve some basic
- Analyzing algorithm Method. complexity. problems.
- Designing algorithm
2 Growth of functions Familiar with notation and Lecture and Answer basic
- Asymptotic notation they will learn how to find discussion on the questions,
- Standard notation and the complexity of an complexity of the quizzes.
common function algorithm and represent it. algorithm, analysis
Find the performance of and finding the
any algorithm. complexity.
3 Review: Basic data structure: Familiar with basic data Lecture and a. Answer some
stack,queue, BST, Heap, structures. discussion on the interesting
Priority queue, tree traversal, complexity of the questions on data
Union find, segment tree , data structures, structures.
interval tree. usefulness, and the b. Solving some
basic differences real-life
between problems.
[Link]
should be followed
by some interesting
problems on
different data
structure.
4-5 Sorting Paradigms: Introduction with sorting a) Lecture and Class Test 1
a. Divide and conquer algorithm. discussion with (topics of the
approach problems. week’s 1-4)
- What is divide and a) Will be familiar with b) Explain with
conquer approach? sorting algorithm. example step by
- Analyzing the divide and b) Can be able to find its step.
conquer algorithm. complexity. c) Show real life
b. Heapsort c) Analysis these example.
- Heaps algorithm’s
- Maintaining the heap performances.
property d) Compare one algorithm
- Building a heap with another.
- The heapsort algorithm
c. Quicksort
- Description of quicksort
- Performance of quicksort
- - Analysis of quicksort

63
6 Search Paradigms: Introduction with a) Lecture and Discussion, give
a. Linear Search searching discussion with assignment,
-Description of linear algorithm. problems. make problem
search a) Will be familiar with b) Explain with one group and
-Performance of linear searching algorithm. example step by another group
search b) Can be able to find its step. will find its
-Analysis of linear search complexity. c) Show real life solution, quizzes.
b. Binary Search c) Analysis these example.
-Description of binary algorithm’s
search performances.
-Performance of binary d) Compare one algorithm
search with another.
-Analysis of binary search

7-8 Dynamic Programming a) Introduction to dynamic • General Class Test 2

- What is dynamic Programming (DP). techniques will be (topics of the
programming? b) Analysis of DP. taught in the lecture. week’s 5-7)
- How it works? c) Practice with example. • Exercises will be
- Elements of dynamic d) Analysis DP with given in the tutorial
programming complexity. and the lecturer (with
- Example Analysis the participation.
(Rod cutting • Assignments will
problem, Matrix chain be given to the
multiplication, Longest students.
Common Subsequence)
9 Greedy Algorithm a) Introduction to dynamic Apply the algorithms Answer basic
- How greedy algorithm Programming (DP). and design questions,
differs from dynamic b) Analysis of DP. techniques to solve quizzes,
programming c) Practice with example. problems. Homework
- Elements of the greedy d) Analysis DP with • Some algorithms
strategy complexity. will be given and the
students will be
asked to estimate the
running time of the
algorithms.
10- Graph Algorithms: BFS, DFS, a. Students will be familiar a. General Class Test 3
11 Advance dfs, Exhaustive bfs, with graph algorithm. techniques will (topics of the
MST, Shortest path b. Students should practice be taught in the week’s 8-11)
algorithms, detecting negative algorithm step by step lecture.
cycles, DAG. with example. b. Exercises will be
c. Analysis performances. given in the
tutorial and the
lecturer.
c. Assignments will
be given to the
students.

64
 12- a. Problem solving b. Can be able to a. Practice with Problem solving.
13 paradigms: participate programing UVA online.
greedy, divide and conquer, contest. b. Can participate
dynamic programming c. Able to solve hard online
, recursive memorization, 2 problem. programming
pointer idea, complete search, d. Develop logic. contest.
using binary search and ternary
search
b. How to formulate a solution
using these

Recommended Books:
2. Introduction to Algorithms - Cormen, Thomas, Charles Leiserson, Ronald Rivest, and Clifford Stein
3. Computer Algorithms, Henry F. Korth
4. Algorithm, Schaums Outline Series
5. Anny [Link]. Introduction to the design and analysis of Algorithms

COURSE CODE: CSTE 2104, COURSE TITLE:ALGORITHM DESIGN AND ANALYSIS LAB

COURSE CODE: CSTE 2104, COURSE TITLE: ALGORITHM DESIGN AND ANALYSIS LAB
3 Hours/Week, 1.5 Credits, Total Marks 100 (Class Attendance=10, Internal Evaluation/Observation =
70, Final Viva-voce =20),Year 2, Term 2
Rationale: Practical implementations of the Algorithms that are learned from the course CSTE-2204.

Course Objectives:
➢ Design and develop programs.
➢ Debug and test their execution with realistic and challenging data.
➢ Conduct experiments to get time and storage efficiency of the program codes.
Resources Used: Multimedia, Whiteboard, Marker, e-Tutorials, Compiler, PowerPoint Slides.
Lesson Plan (as per week):
Course Outcome (at the end of the lesson, Teaching Learning Assessment
Week

Contents student should be able to) Strategy Strategy

(activities directed to (How they are
achieve outcomes) developed)
1- Design and Analysis Introduction with algorithm. • Statement of the Assignment
2 of Algorithms Argue the correctness of algorithms problem.
using inductive proofs and loop • Find a strategy to
invariants will be familiar with solve it.
Substitution and master Method. • Write program
with C++or
JAVA
3- Sorting Algorithms • Student will be familiar with • Discussion about Solve problem
4 a. Bubble Sort basic data structures. the problem. from exercise
b. Insertion Sort • Can be able to write program. • Students will be book and
c. Selection Sort • Develop their problem-solving given to do some online.
d. Quick Sort logic. problem to solve.
• Analysis the
complexity.

65
5- Design Strategies • Finding the maximum and • Statement of the Solve problem
6 Divide & Conquer minimum of a sequence of problem. from exercise
a. Merge sort numbers. • Find a strategy to book and
b. Binary search • Can be able to write program. solve it. online.
• Develop their problem-solving • Write program
logic. with C++or
JAVA
7- Search Paradigms: • Understand searching problems • Statement of the Quiz 1(1 to 3
8 a. Linear Search with examples. problem. week)
b. Binary Search • Can be able to write program. • Find a strategy to
• Develop their problem-solving solve it.
logic. • Write program
with C++or
JAVA
9- Dynamic • Matrix chain multiplication. • Statement of the Solve problem
10 Programming • Longest common subsequence. problem. from exercise
• Travelling salesman problem. • Find a strategy to book and
solve it. online.
• Write program
with C++or
JAVA
11 Greedy Algorithm • Finding the shortest path • Statement of the Solve problem
between two vertices using problem. from exercise
Dijkstra’s algorithm. • Find a strategy to book and
• Finding the minimal spanning solve it. online.
tree in a graph using Prim’s Write program
/Kruskal’s algorithm, etc. with C++or
JAVA
12 Graph Algorithms: • Understand searching problems • Discussion about Solve problem
- Spanning Tree with examples. the problem. from exercise
- Shortest path • Can be able to write program. • Students will be book and
algorithms • Develop their problem-solving given to do some online.
- DAG. logic. problem to solve.
• Analysis the
complexity.

13 Final Lab Exam (Lab and Viva)

66
 COURSE CODE: CSTE 2105, COURSE TITLE: DIGITAL LOGIC DESIGN

Course Code: CSTE 2105, Course Title: Digital Logic Design, 3 Hours/Week, 3 Credits, Total Marks
100 (Attendance=5, Continuous Assessment=25, Final exam=70), Year 2, Term 1
Rationale: This course has been designed to provide the students an in-depth understanding of digital
circuits and systems which is fundamental to the student’s ability to become a successful digital designer
and computer engineer.
Course Objectives:
➢ To provide the students with a basic understanding of digital and logic circuits with its different
components.
➢ To provide students with a knowledge of problem-solving with digital logic circuits & systems.
➢ To familiarize the students with building blocks of combinational and sequential circuits to enable
them to develop circuit solutions to problems and to understand the design and operation of
hardware models of digital systems.

Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Device manual,
Question bank, Previous questions.
Lesson Plan (as per week):
Course Contents Outcome (at the end of Teaching Learning Assessment
Week

the lesson, student Strategy (activities Strategy (How

should be able) directed to achieve they are
outcomes) developed)
1. Introduction: Digital and analog ➢ To differentiate Lecture and discussion Answering
systems, The introductory concept between digital and on detailed information basic questions,
of number systems and codes. analog systems. about the course, quizzes,
Digital representation, Digital ➢ To learn how to including the Homework etc.
circuit, and Logic circuit. Logic convert a number to objectives, course
Gates, Boolean Algebra and different number outcomes,
Minimization: Boolean constants systems. examinations. Lecture
and variables, truth tables. Basic ➢ To familiar with delivery on the basics
Logic gates. logic gates, truth of digital and analog
table, and logical systems, number
algebra. systems and logic
gates.
2. Logic Gates, Boolean Algebra ➢ To learn how to Lecture and discussion Answering
and Minimization: Universality of implement logic gates on the universality of basic questions,
NAND and NOR gates, Describing and logical expression NAND and NOR gates quizzes,
logic circuits algebraically, using NAND and and the implementation Homework etc.
Evaluating logic circuit outputs, NOR gates. of logic circuits.
Boolean theorems, DeMorgan's ➢ To describe logic Exercise sample
theorems. Implementing logic circuits algebraically. problems on logic
circuits from boolean expressions, ➢ To implement a circuit implementation.
Alternate logic-gate logic circuit from
representations. Boolean expression.

67
3. Combinational Logic Circuits ➢ To learn how to Lecture and discussion Answering
Design: Sum-of-product and express a logical on SOP and POS basic questions,
product-of-sum forms, Simplifying expression in SOP and logical expression, quizzes,
logic circuits, algebraic POS form. logic simplification Homework etc.
simplification, Karnaugh map ➢ To simplify the using algebraic and K-
method. logic circuit and Map techniques.
Boolean expression Exercise with various
using algebraic and logical problems.
K-Map simplification.
4. Combinational Logic Circuits ➢ To design Lecture and discussion Answering
Design: Designing combinational combinational logic with examples on basic questions,
logic circuits, Exclusive OR and circuits. combinational logic quizzes,
Exclusive NOR circuits, Logic ➢ To design logic circuits with single and Homework etc.
circuits with multiple outputs, circuits with multiple multiple outputs, parity
Designing logic circuits without a outputs. generator, and checker
truth table, Parity generator and ➢ To learn how to circuits.
checker circuit, Enable/Disable design a parity Lecture on the basics of
circuits, Programmable logic generator and checker hardware
devices (PLD), Hardware circuit. description language.
description languages- HDL, ➢ To learn some
VHDL. hardware description
languages like HDL,
VHDL etc.
5. Flip-Flops (FF): NAND gate ➢ To understand Lecture on the basics CT-1 (topics of
latch, NOR gate latch, D latch, the basics of FF and on FF and latch with the week’s 1-4)

Clock signals and clocked Flip- latch. the introduction of S-C

Flops, Clocked S-C FF. ➢ To design a FF.
Clocked S-C FF.
6. Flip-Flops (FF): Clocked J-K FF, ➢ To design Lecture and discussion Answering
Clocked D FF, Master-slave FF, clocked J-K, D and on the design of J-K, D basic questions,
FF applications, FF Master-slave FF. and Master-Slave FF. quizzes,
synchronization, Data storage and ➢ To learn about Lecture on the design Homework etc.
transfer, Frequency division, and FF applications. of HA, FA, Parallel
counting. ➢ To design the adder, Carry look-
Arithmetic circuits: Adder different types of ahead adder and BCD
circuits, Half adder (HA), Full adder circuits like adder.
adder (FA), Carry propagation, HA, FA, Parallel
Parallel adder, carry look-ahead adder and carry look-
adder, The 2's complement ahead adder etc.
addition, and subtraction system,
The BCD adder circuit, Cascading
BCD adder, Binary multiplier.
7. Counters and Registers: ➢ To understand Lecture and discussion Answering
Asynchronous counter: Ripple the basics of counter on the basics of a basic questions,
counters, Counters with mod and registers. counter with the design quizzes,
numbers<2n, IC asynchronous ➢ To design the and implementation of Homework etc.
counters, Asynchronous down different types of different types of an
counter, Asynchronous up/down asynchronous up asynchronous counter.
counter, Propagation delay in and/or down counter Exercise on related
ripple counters. for the different mod topics.
number.

68
8. Counters and Registers: ➢ To design the Lecture on the design Answering
Synchronous counter, Synchronous different types of and implementation of basic questions,
down counter, Synchronous synchronous up different types of quizzes,
up/down counters, decoding a and/or down counter synchronous counter Homework etc.
counter, Decoding glitches, for the different mod and a digital clock
Cascading BCD counters, Shift- number. circuit.
registers, Counter applications: ➢ To design a Exercise on related
frequency counter, digital clock. digital clock. topics.
9. MSI Logic Circuits: Decoders, ➢ To understand Demonstrate the CT-2 (topics of
BCD-to-decimal decoders, BCD- the basics of a basics, design, and the week’s 5-8)
to-7-segment decoder/drivers. decoder. operations of the
➢ To design different decoder
different types of circuit.
decoder circuit like
BCD-to-decimal
decoders, BCD-to-7-
segment decoder etc.
10. MSI Logic Circuits: Encoders, ➢ To design Demonstrate the Answering
Multiplexers and multiplexer different types of basics, design, and basic questions,
applications, Demultiplexers. encoder, multiplexer operations of different quizzes,
Integrated-Circuit Logic and demultiplexer encoder, multiplexer Homework etc.
Families: Digital IC terminologies, circuit etc. and demultiplexer
TTL logic family, TTL series ➢ To learn about circuit.
characteristics, open-collector TTL, ECL, and Lecture and discussion
TTL, Tristate TTL, ECL family, CMOS digital ICs on the basics of TTL,
MOS digital ICs, MOSFET, logic families. ECL, and CMOS
CMOS characteristics, CMOS tri- digital ICs logic
state logic, TTL CMOS-TTL families.

interfacing.
11. Interfacing with the Analog ➢ To design Lecture and discussion Answering
World: Digital to analog different types of on the design and basic questions,
conversion (DAC), D/A ADC and DAC operation of ADC and quizzes,
conversion circuitry, Summing circuit. DAC circuit. Homework etc.
amplifier, Analog to digital Exercise on related
conversion (ADC), A/D topics.
conversion circuitry, Digital ramp
ADC.
12. Memory Devices: Memory ➢ To design the Lecture and discussion CT-3 (topics of
terminology, general memory architecture of RAM on the design and the week’s 9-
operation, semiconductor memory and ROM. operation of RAM and 12)
technologies, different types of ROM architecture.
ROMs, semiconductor RAMs, Exercise on related
static and dynamic RAMs, ROM topics.
architecture, RAM architecture,
FPGA Concept.

69
 13. Review topics and Final exam ➢ To learn about Students will be asked Exercise the
preparation. the latest trends and to answer the questions answering
the better answering orally on previous methods in
methods in the final lectures and review the final exam.
exam. contents of the course.
Discussion on the
better answering
methods for the final
examinations.

Recommended Books:
1. Digital Systems: Principles and Applications by Ronald J. Tocci, Prentice Hall.
2. Digital Logic and Computer Design by M. Morris Mano, Prentice Hall.
3. An Introduction to Switching Theory and Digital Electronics by V. K. Jain,Khanna Publishers.

COURSE CODE: CSTE 2106, COURSE TITLE: DIGITAL LOGIC DESIGN LAB

Course Code: CSTE 2106, Course Title: Digital Logic Design Lab, 2 Hours/Week, 1 Credits, Total
Marks 100 (Class Attendance=10, Internal Evaluation/Observation = 70, Final Viva-voce =20), Year 2,
Term 1
Rationale: This course has been designed to provide the students with practical knowledge of
designing digital circuits and systems which is fundamental to the student’s ability to become a
successful digital designer and computer engineer.
Course Objectives:
➢ To understand the principles and methodology of digital logic design at the gate level.
➢ To design and analyze combinational and sequential logic circuits.
➢ To design and analyze digital circuits for real life problem solving.
➢ To understand the basic software tools for the design and implementation of digital circuits and
systems.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Lab equipment
and Manuals, Quartus software.
Lesson Plan (as per week):
Experiments Outcome (at the end of Teaching Learning Assessment
Week

the lesson, student Strategy (activities Strategy (How

should be able) directed to achieve they are
outcomes) developed)

1-2 ➢ Verification of the truth ➢ To verify the First lecture and then Answer basic
tables of the logic gates truth table of logic Practice. questions,
(AND, OR, NOT, NOR, gates and universality quizzes.
NAND, Ex-OR, Ex-NOR of NAND and NOR
etc). gates.
➢ Realization of the
universality of NAND and
NOR gate.

70
3-4 ➢ Design, construction and ➢ To design the Discussion and Answer basic
testing of a parity generator parity generator and practice. questions,
and checker circuit. checker circuit and quizzes.
➢ Design, construction and understand its
testing of Half Adder & Full operations.
Adder circuits. ➢ To design and
test the Half adder
and Full adder
circuit.
5-6 ➢ Verification of the truth ➢ To design and Lecture and discussion Answer basic
tables of different Flip- understand the on Flip-Flop with questions,
Flops. operations of tutorials and then quizzes,
➢ Realization of D and T Flip- different Flip-Flop practice. homework,
Flops by using J-K Flip- circuits. exams.
Flop.
7-8 ➢ Design, construction and ➢ To design and Lecture and discussion Answer basic
testing of different understand the on Counter and questions,
synchronous counters. operations of practice. quizzes,
➢ Design, construction and different homework.
testing of different Synchronous and
asynchronous counters. Asynchronous
counter circuits.
9-10 ➢ Design, construction and ➢ To design and Lecture and discussion Answer basic
testing of a different understand the on Decoder and questions,
Decoder circuit using logic operations of Encoder circuits with quizzes,
gates and Decoder IC. different Decoder and tutorials and then homework,
➢ Design, construction and Encoder circuits practice. exams.
testing of a different Encoder using logic gates and
circuit using logic gates and IC.
Encoder IC.
11 ➢ Design, construction and ➢ To design and Lecture and discussion Answer basic
testing of a multiplexer by understand the on the concepts of questions,
using circuit using logic gate operations of Multiplexer and De- quizzes,
and MUX IC. different Multiplexer multiplexer circuits homework.
➢ Design, construction and and De-multiplexer and practice.
testing of different de- circuits using logic
multiplexer by using circuit gates and IC.
using logic gate and MUX
IC.
12 ➢ Solving some real-life ➢ To analyze and Lecture and discussion Answer basic
problems using a solve a real-life with real life questions,
combination of different problem with digital problems. quizzes,
logic gates. circuits. Demonstration on homework,
➢ Using software tools for the ➢ To learn how Quartus Software. exams.
design and implementation software tools can be
of digital circuits and used to design and

systems. implement digital

➢ Perform other experiments circuit and systems.
relevante to this course.
13 Final Lab Exam (Job, Quiz and Viva)

71
 COURSE CODE: CSTE 2107, COURSE TITLE: COMPUTER ARCHITECTURE AND
ORGANIZATION

Course Code: CSTE 2107, Course Title: Computer Architecture and Organization, 3 Hours/Week, 3
Credits, Total Marks 100 (Attendance=5, Continuous Assessment=25, Final exam=70), Year 2, Term 1
Rationale: This course has been designed to provide the students with an in-depth understanding of
computer architecture and organization which is fundamental to the students’ ability to become a
successful computer engineer.
Course Objectives:
➢ To familiarize students about basic structure and behavior of the various functional modules of the
computer and how they interact to provide the processing needs of the user.
➢ To familiarize students about hardware design including arithmetic unit, logic unit, shifter and
different types of the adder circuit.
➢ To analyze the processor and memory performance of a digital computer with improvement using
instruction level parallelism.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Device manual,
Question bank, Previous questions.
Lesson Plan (as per week):
Course Contents Outcome (at the end of Teaching Learning Assessment
Week

the lesson, student should Strategy (activities Strategy (How

be able) directed to achieve they are
outcomes) developed)
1. Introduction: A brief history of ➢ To familiar with Lecture and discussion Answering basic
computers, difference between computer history and on detailed information questions,
computer architecture & understand the basics about the course, quizzes,
organization, Limitations of of computer including the Homework etc.
computers- Unsolvable problem, architecture and objectives, course
Intractable problems, Speed organization. outcomes,
limitations, Basics of computer ➢ To learn in detail examinations. Lecture
organization: Top level about computer delivery on the history
structure of a computer, structure limitations. of computers and the
of digital computer-CPU, ALU, ➢ To understand the basics of computer
I/O devices. basic structure of a architecture and
computer. organization.
2. Organization of the IAS ➢ To explain the Lecture and discussion Answering basic
computer, IBM System/360 and structure of computers on computer structure, questions,
personal computer system, of the different computer performance, quizzes,
Factors that determine computer generation. Harvard & Von- Homework etc.
performance, Harvard & Von- ➢ To analyze and Neumann architecture,
Neumann architecture, evaluate computer Microcontroller &
Microcontroller Vs. performance. Microprocessor etc.
Microprocessor. ➢ To differentiate
between Harvard &
Von-Neumann
architecture,
Microcontroller &
Microprocessor.
3. Micro-operations: Arithmetic ➢ To understand Lecture and discussion Answering basic

72
 micro-operation, Logic micro- different types of on micro-operations, questions,
operation, Shift micro-operation. micro-operations with computer instructions. quizzes,
Instruction Set: Instruction an example. Exercise on system Homework etc.
format, instruction types, CPI, ➢ To learn in detail performance
IPS, MIPS & FLOPS, about instruction set, calculation and
addressing modes of Instruction. format, types and addressing modes.
addressing modes of
instruction.
➢ To apply the
knowledge of
performance metrics to
find the performance of
systems.
4. Arithmetic & logic circuits: ➢ To design and Demonstration on Answering basic
Serial adder, Ripple carry adder, understand the arithmetic, logic and questions,
carry look-ahead adder, the operation of arithmetic, different types of the quizzes,
design of floating-point adder, logic, and arithmetic adder circuit. Homework etc.
Arithmetic circuit design, Logic logic unit circuit.
circuit design, ALU design. ➢ To design and
understand the
operation of different
types of the adder
circuit.
5. Combinational circuit shifter ➢ To design and Lecture and discussion CT-1 (topics of
design, Addition-subtraction understand the on addition- the week’s 1-4)
logic network. Multiplier & operation of addition- subtraction, multiplier,
divider: Unsigned binary subtraction, multiplier, divider and shifter
multiplication, Booths divider and shifter circuit
multiplier, array multiplier, circuit.
restoring &nonrestoring divider.
6. I/O devices & system ➢ To introduce with Lecture and discussion Answering basic
organization: External devices the operations of on I/O device and I/O questions,
(keyboards, monitors, CD-ROM familiar I/O devices modules. quizzes,
drive, HDD, Mouse, light Pen and I/O organizations. Homework etc.
etc.), I/O modules, programmed ➢ To learn different
I/O, interrupt-driven I/O. DMA- types of I/O modules.
I/O processors.
7. CPU organization: ➢ To learn the Lecture and discussion Answering basic
Fundamentals, Processor- basics of Processor- on cache memory and questions,
memory communication with & memory CPU organization. quizzes,
without cache, an overview of communication with & Exercise on instruction Homework etc.
CPU functions, Single without cache. formats.
accumulator-based organization, ➢ To learn different
General register organization, types of CPU
Stack organization. organization with
instruction formats.

73
8. Control Unit Design: ➢ To understand in Lecture and discussion Answering basic
Hardwired control, detail about control on control unit design questions,
microprogrammed control, nano- unit operation. and pipelining. quizzes,
program control. Pipeline ➢ To learn the Homework etc.
control Unit-throughput & concepts behind
efficiency, instruction level pipelining techniques
pipelining different pipelined for processor
stages in CPU, pipeline hazards performance
(data, control & structure). improvement.

Tristate bus & Bus

interconnection: Register
transfer & RTL notation.
9. RISC & CISC based ➢ To understand in Lecture and discussion CT-2 (topics of
architecture: Examples of RISC detail about different on different types of the week’s 5-8)
processor (SPARC & C490), types of processor processor architecture.
introduction to superscalar architecture.
& VLIW
architectures.
10. Memory organization: ➢ To learn about Lecture and discussion Answering basic
Characteristics of memory memory organization, on memory questions,
systems, memory technology, characteristics, and characteristics with quizzes,
types of memory-volatile & classification in detail. detail classification. Homework etc.
nonvolatile, ROM, PROM,
EPROM, EEPROM, Flash
memory, SRAM, DRAM,
SDRAM, Content addressable
memory.
11. Cache & virtual memory: ➢ To understand the Lecture and discussion Answering basic
Direct, associative & set- concept of cache on cache mapping and questions,
associative, Cache hit, Cache mapping and cache memory hierarchy with quizzes,
miss & Hit ratio, Miss ratio, design techniques. exercise. Homework etc.
Miss penalty, instruction cache ➢ To understand the
& data cache, virtual memory concept of memory
paging, Types of cache design- hierarchy with its goal.
Logical cache, Physical cache.
Memory hierarchy and goal in
memory hierarchy design.
12. Multiprocessors: types, ➢ To understand the Lecture and discussion CT-3 (topics of
performance, single bus concept of on multiprocessor and the week’s 9-12)
multiprocessors, multiprocessors multiprocessor and parallel processing
connected by network, clusters, parallel processing system.
parallel processing. system.
13. Review topics and Final exam ➢ To learn about the Students will be asked Exercise the
preparation. latest trends and the to answer the questions answering
better answering orally on previous methods in final
methods in the final lectures and review the exam.
exam. contents of the course.
Discussion on the
better answering
methods for the final
examinations.

74
Recommended Books:
1. Computer Organization and Architecture by W. Stallings, Prentice Hall.
2. Computer Architecture and Organization by J.P. Hayes, McGraw Hill.
3. Computer System Architecture by- M. Morris Mano, Pearson Education.

COURSE CODE: CSTE 2108, COURSE TITLE: COMPUTER ARCHITECTURE AND

ORGANIZATION LAB

Course Code: CSTE 2108 Course Title: Computer Architecture and Organization Lab, 2 Hours/Week,
1 Credits, Total Marks 100 (Class Attendance=10, Internal Evaluation/Observation = 70, Final Viva-voce
=20), Year 2, Term 1

Rationale: This course has been designed to provide the students with practical knowledge of designing
and understanding computers internal components which is fundamental to the students’ ability to become
a successful computer engineer.
Course Objectives:
➢ To identify the basic components of computer organization and explain how they work together.
➢ To familiarize students about the designing of various functional modules of the computer.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Lab equipment and
Manuals.
Lesson Plan (as per week):
Experiments Outcome (at the end of Teaching Learning Assessment
Week

the lesson, student should Strategy (activities Strategy

be able) directed to achieve (How they are
outcomes) developed)
1-2 ➢ Design, Construction and Testing ➢ To design andLecture and Answer basic
of Arithmetic Unit (AU) Circuit. understand the discussion on AU and questions,
➢ Design, Construction and Testing operations of AU andLU circuit with quizzes.
of Logic Unit (LU) Circuit using LU circuit. practical
MUX IC. implementation and
testing.
3-4 ➢ Design, Construction and Testing ➢ To design andDiscussion with Answer basic
of Logic Unit (LU) Circuit using understand the practical questions,
basic logic gates only. operations of ALUimplementation and quizzes,
➢ Design, Construction and Testing circuit. testing. homework.
of Arithmetic Logic Unit (ALU)
Circuit.
5-7 ➢ Design, Construction and Testing ➢ To design Discussion and Answer basic
of different Adder circuit. different adder circuitspractice. questions,
like serial adder, quizzes,
parallel adder, carry exams.
look-ahead adder etc
and understand their
operation.
8-9 ➢ Design, Construction and Testing ➢ To learn how toDiscussion and Answer basic
of Addition-Subtraction Logic design an addition-practice. questions,
Unit. subtraction logic quizzes.
➢ Design, Construction and Testing circuit, shifter circuit
of Shifter circuit. and understand their
operation.

75
10- ➢ Design, Construction and ➢ To design aDiscussion with Answer basic
11 Testing of 2-bit, 4-bit magnitude comparator and registerpractical questions,
comparator. circuit with a clearimplementation and quizzes.
➢ Design, Construction and understanding of itstesting.
Testing of Registers. operations. Demonstration with
e-Tutorials.
12- ➢ Design of a combinational ➢ To learn how toDemonstration with Answer basic
13 multiplier. design a multiplier,e-Tutorials. questions,
➢ Design of Direct Mapped and direct mapped cache quizzes,
Associative cache. and associative cache. homework,
➢ Perform other experiments exams.
relevant to this course.

76
Course Code: MATH 2105, Course Title: Matrices, Vector Analysis and Coordinate Geometry, 3
Hours/Week, 3 Credits, Total Marks 100 (Attendance=5, Continuous Assessment=25, Final exam=70),
Year 2, Term 1

COURSE CODE: MATH 2105, COURSE TITLE: MATRICES, VECTOR ANALYSIS AND CO-
ORDINATE GEOMETRY

Rationale: This course is designed to deal with the concept of matrix, vector and coordinate geometry. It
will also show the concept of matrix decomposition and the coordinate transformation from two-
dimensional space to three-dimensional space.
Course Objectives:
➢ To understand the basic matrix transformation and its operations.
➢ To describe and manipulate vector spaces, subspaces and their bases.
➢ To understand vector differentiation and vector integration.
➢ Understanding of the principles and concepts of coordinate geometry.
➢ To be able to use appropriate formulas to solve coordinate geometry equations.

Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Question bank,
Previous questions.
Lesson Plan (as per week):
Course Outcome (at the end Teaching Learning Assessment
Contents of the lesson, student Strategy (activities Strategy (How they
Week

should be able to) directed to achieve are developed)

outcomes)
1 Matrix Terminology: Vector Find vector Lecture and Answer basic
presentation by matrix, representation using discussion on matrix questions, quizzes,
different types of matrices, matrix. Homework, exams.
algebraic operations on Matrix
matrices, Transpose of a transformation and
Matrix, Adjoint and inverse of its representation.
a matrix,
2 Matrix Terminology: Different matrix Lecture and Answer basic
augmented matrix, row operation along with discussion about questions, quizzes,
operation method, rank of determinate matrix operation. Homework, exams.
Matrices, Mathematical computation.
Problems using Matrix,
distinguish between
determinant and matrix.
3 Matrix Terminology: Normal Determine the Lecture and problem Answer basic
Vector, Orthonormal Vectors, relation between solving. questions, quizzes,
Orthogonality, Gram-Schmidt matrix and vector Homework, exams.
Orthonormalization Process, and different
co-variance matrix, properties of vector.
4 Matrix Decomposition: Apply matrix Lecture and practice. Exercise with
Eigen Decomposition decomposition using various
Theorem, Singular Value different theorem. mathematical
Decomposition (SVD). problems.
5 Matrix Decomposition: LU Apply LU, QR and Lecture and Class Test 1(topics
Decomposition, QR Cholesky algorithm discussion about of the week’s 1-4)
decomposition, Cholesky to decompose a problems.
decomposition. matrix.

77
 6 Matrix Decomposition: Understand Lecture and problem Answer basic
Physical application of Matrix application of matrix solving. questions, quizzes,
Decomposition Theorem, decomposition. Homework, exams.
Mathematical Analysis of
Matrices using MATLAB.
7 Vector differentiation: Compute derivative Lecture and Answer basic
Derivative of vector function- of vector spaces, discussion on vector questions, quizzes,
Velocity and acceleration- subspace and differentiation. Homework (word
Scalar and vector fields- gradients. size expansion,
Gradient- It’s geometrical memory location
interpretation expansion), exams.

8 Vector differentiation: Compute directional Lecture and problem Answer basic

Directional derivative- derivative, solving. questions, quizzes,
Divergence and Curl-Their divergence and curl Homework, exams.
physical meaning-Relations and have knowledge
involving-Solenoidal and of the physical
irrotational fields-Scalar interpretation of
potentials (simple problems). these quantities.
9 Vector Integration: Line Compute lines, curve Lecture and Class Test 2(topics
integral, the surface integral integrals and discussion on vector of the weeks5-8)
and volume integral-work done circulation, surface integration.
by a force-Statement and integrals
Verification of Green’s
theorem
10 Vector Integration: Stoke’s To apply Stoke’s Lecture and practice. Answer basic
theorem and Gauss’s theorem and Gauss’s questions, quizzes,
Divergence theorem-their use theorem to compute Homework, exams.
in evaluating the Integrals. integral.
11 Coordinate geometry of two Identify coordinate Lecture and Quizzes,
dimensions: Change of axes, of a point in a discussion on Homework, exams.
General equation of second Cartesian system and coordinate
degree. transform of geometry.
coordinates.
12 Coordinate Geometry of Calculate the length Lecture and Class Test 3(topics
three dimensions: a system of of a line and angle discussion on of the weeks9-12)
coordinates, the distance between two lines. problems.
between two points; Direction
cosine and ratio; the angle
between two straight lines;
13 Coordinate Geometry of Calculate the Problem solving and Exercise the
three dimensions: Equation of equation for plane in practice. answering methods
a plane; Plane through three 3D space and angle in the final exam.
given points; Angle between between two planes.
two planes; Equation of a
straight line through two
points.
Recommended Books:
1. Vector Analysis and An Introduction to Tensor Analysis by M. R. Spiegel, S. Lipschutz, McGraw-Hill.
2. Analytical Geometry of Three Dimension by Vasistha and Agarwal, Krishna.
3. Advanced Engineering Mathematicsby ErwinKreyszig, Wiley Eastern.

78
 COURSE CODE: HUM 2103, COURSE TITLE: PRINCIPLES OF ECONOMICS

Course Code: HUM 2103, Course Title: Principles of Economics,3 Hours/Week, 3 Credits, Total Marks
100 (Attendance=5, Continuous Assessment=25, Final exam=70),Year 2, Term 1

Rationale: This course provides an introduction to a broad range of economic concepts, theories and
analytical techniques.
Course Objectives:
➢ Understanding the economic problem, specific economic issues, and policy alternatives;
➢ Understand and apply the economic perspective and reason accurately and objectively about economic
matters.
➢ Promote a lasting student interest in the economic environment in which business operates.
➢ Acquire the necessary quantitative skills used in economic analyses.

Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials.

Lesson Plan (as per week):
Course Outcome (at the end of the Teaching Learning Assessment
Week

Contents lesson, student should be able Strategy (activities Strategy (How

to) directed to achieve they are
outcomes) developed)
1 Definition and scope of Understand the nature and Lecture and Answer basic
Economics: scope of economics. discussion with questions,
Definition of basic terms- Explain the classification of detailed information quizzes, exams.
Goods-wants and their economics. about the course,
classificationwealth-Income– Explain the money market including the
Money Near money- Credit condition. objectives, course
money- Utility, features, and outcomes,
kinds of utility – examinations. Topic
wise lecture
delivery.
2 Concept of national income: Explain the major features: Lecture and Answer basic
-Methods of calculating national income, economic discussion with questions,
GDP, GNP, NMP etc. at growth, unemployment, practical scenarios. quizzes, exams.
factor cost, at market prices inflation, money and banking,
etc. public sector.
Explain the economic growth
condition of a society of a
nation.

3 Numerical problems on Explain National income Lecture and Answer basic

National income, Capital capital formation. discussion with questions, exams.
formation, savings and Understand how to increase problems solution.
Investment relationship, the investment situation with
Economic estimation. the help of savings.
4 Bangladeshi economic Understand how to relate Lecture and Answer basic
growth in rates and their money market and commodity discussion with questions,
estimation. Bangladeshi market in Bangladesh examples. quizzes, exams.
economic growth in recent economy.
years, saving investment
equality, LM, IS curves.
79
5 Basic laws in Economics: Relate with consumer Lecture and Class Test
Law of Diminishing preference. discussion with 1(topics of the
marginal utility – Demand, examples. week’s 1-4)
Law of Demand and demand
curve-

6 The concept of supply- Analyze the determinants of Lecture and Answer basic
Supply schedule and supply supply and demand and the discussion with questions,

curve. ways in which changes in these practical scenarios. quizzes, exams.

determinants affect
equilibrium price and output.
Understand the concepts of
consumer surplus and producer
surplus should also be
introduced.
7 Market structure: Explain the major features of Lecture and Answer basic
Classifications – Pricing economics such as: types of discussion with questions,
under different markets as market, market mechanism, practical scenarios. quizzes, exams.
perfect competition, market failures, competition
monopoly, and oligopoly. State assumptions of various
Pricing under monopolistic market models.
competition.

8 Inflation: Explain the price condition and Lecture and Answer basic
Measures to control inflation employment situation of a discussion with questions,
– Monetary measures and nation which helps in policy practical scenarios. quizzes,
fiscal measures – Effects of making. examples.
inflation.

9 Tax: Explain the government policy Lecture and Class Test

Classification of Taxes – to increase revenue. discussion with 2(topics of the
Direct &Indirect taxes practical scenarios. weeks5-8)
specific and Ad-Valorem
taxes
10 Personal income- tax – The government takes tax Lecture and Answer basic
characteristics of a good tax policy in such way that which discussion with questions,
system – Tax evasion. will not burden for tax payers. practical scenarios. quizzes, exams.

11 Monetary Fund: Explain the role of IMF, Lecture and Answer basic
Issues & Challenges – Foreign reserve management, discussion with questions,
International liquidity – International reserve account. examples. quizzes, exams.
12 Special Drawing Rights - Explain the relation between Lecture and Class Test
Bangladesh & IMF governments and other discussion with 3(topics of the
international monetary practical scenarios. week’s9-12)
organization.
13 Welfare Economics: Understand the basic elements Lecture and Exercise the
Old Welfare Economics of welfare economics. discussion with answering
-Pigou’s Analysis – New examples. methods in final
Welfare Economics Pareto’s exam.
welfare criterion.

80
Recommended Books:
1. Modern Economic theoryby [Link].
2. Elements of Ecomic Analysis by Prof. [Link]
3. Money, Banking, Trade & Finance by Sundaran K.P.M

COURSE CODE: CSTE 2201, COURSE TITLE: OBJECT ORIENTED PROGRAMMING WITH
JAVA

Course Code: CSTE 2201, Course Title: Object Oriented Programming with Java, 3 Hours/Week, 3
Credits, Total Marks 100 (Attendance=5, Continuous Assessment=25, Final exam=70), Year 2, Term 1
Rationale: This course has been designed to develop the students’ ability to use Java as an object-oriented
programming language to build several types of application software using GUI.
Course Objectives:
➢ Identify problems and apply object-oriented programming concept to build information system
➢ Apply UML notations used in object-oriented applications design.
➢ Implement common I/O operations using Java
➢ Implement event-driven graphical user interfaces (GUI) in Java
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Device manual,
Question bank, Previous questions.
Lesson Plan (as per week):
Course contents Outcome (at the end of the Teacher Learning Assessment
Week

session, student should be strategy (activities Strategy

able to) directed to achieve (How they are
outcomes) developed)
1. History of Java, Java Class Explain the basics of java. Lecture and Answer basic
Libraries, Introduction to Use Java class libraries and discussion with questions,
Java Programming run sample java program. detailed information quizzes,
about the course, Homework,
including the exams.
objectives, course
outcomes,
examinations,
physical
environment and
methodology with
the students.

81
2. Developing Java Explain about the Lecture and discuss Answer basic
application: algorithms, pseudo code, about the algorithms questions,
Algorithms, Pseudo code, control structure, if/else and pseudo code. quizzes,
Control structure, if/else selection structure, while Using Java IDE to Homework,
selection structure, while repetition structure. Learn implement if/else, exams.
repetition structure, about assignment operators, while, and different
assignment operators, increment and decrement operators.
increment and decrement operators.
operators.
3. Control structure: Explain about the primitive Lecture and Answer basic
Primitive data types, data types, escape discussion about questions,
Common Escape sequence, sequences, logical different primitive quizzes,
logical operator, For operators, for structure, data types, common Homework,
structure, switch, do/while, switch, do/while, break, and escape sequences. exams.
break and continue continue. Using Java IDE to
implement for,
switch, do/while,
break and continue.
4. Methods: Explain about method Lecture and discuss Answer basic
Program module in Java, definitions, java API methods and the way questions,
Math class methods, Method packages, recursion, method to implement them quizzes,
definitions, Java API overloading, and method of in java programs. Homework,
packages, Automatic the Applet class. Implement Java API exams.
variables, Recursion, Method package, recursion,
overloading, Method of the and method
Applet class overloading through
Java IDE.
5. Arrays: Explain about array Lecture and discuss Class Test
Arrays, Declaring and declaration, sorting arrays, arrays and 1(topics of the
allocating arrays, passing searching arrays, multiple implement array in week’s 1-4)
arrays to methods, sorting subscripted arrays, and Java IDE.
arrays, searching arrays, passing arrays to methods.
multiple-subscripted arrays
6. Object-based Explain about Implementing Lecture and Answer basic
programming: a Time abstract Data type discussion about questions,
Time abstract Data type, with a class, class scope, implementing a quizzes,
Class scope, controlling controlling access to Time abstract Data Homework,
access to members, utility members, utility methods, type with a class, exams.
methods, constructors, using constructors, and class scope,
Overload constructor, constructor overloading. constructors, and
constructor
overloading.
7. set and get method, software Explain about set and get Lecture and discuss Answer basic
reusability, friendly method, software set and get methods, questions,
members, finalize, static reusability, friendly software reusability, quizzes,
class members, Data members, finalize, and static friend, finalize, and Homework,
abstraction and information class. Use data abstraction, static class members. exams.
hiding and information hiding. Using Java IDE to
implement
encapsulation.

82
8. Superclass and subclass, Use superclass, and Implement Answer basic
protected members, subclass. Explain protected inheritance and the questions,
constructor, finalize, members, and using way to access quizzes,
composition, and inheritance. constructor and finalize in inheritance through Homework,
subclasses. Differentiate Java IDE. exams.
between composition and
inheritance.
9. polymorphism, dynamic Explain polymorphism, and Lecture and discuss Class Test
method building, final, dynamic method building. polymorphism, and 2(topics of the
abstract superclass and Use final in methods and dynamic method weeks5-8)
concrete class classes, abstract superclass, building. Implement
and concrete class in Java final, and abstract
program. keywords in the Java
program.
10. String and Exception Explain about String class Using Java IDE to Answer basic
handling: String and and characters. Learn about show String, files questions,
characters, exception exception handling and exception quizzes,
handling, files and stream. procedures, file operations, handling related Homework,
and streams. problems. exams.
11. Java API and GUI: Make Java API, Utility Implement Java API, Quizzes,
Java API, Utility classes, 2D classes, 2D graphics, and utility classes, 2D Homework,
graphics, GUI, Swing GUI interfaces using java graphics, and GUI exams.
swing. using swing through
Java IDE.
12. Multithreading and Explain about how to create Implement Class Test 3
Interface: events, and interface. multithreading, (topics of the
Events, Interface, Describe about events, and interface week’s9-12)
Multithreading, Collection multithreading, and through Java IDE.
Framework collection framework.
13. Miscellaneous and Final Learn about latest trends Lecture and Exercise the
exam preparation and the better answering discussion on answering
methods in final exam. miscellaneous methods in
subjects final exam.

RecommendedBooks:
1. Java How to Program by Deitel&Deitel, Prentice Hall.
2. Java: The Complete Reference by H. Schildt, McGraw-Hill.
3. Beginning Java 2 by Ivor Horton: John Wiley & Sons.

COURSE CODE: CSTE 2202, COURSE TITLE: OBJECT ORIENTED PROGRAMMING WITH
JAVALAB

Course Code: CSTE 2202, Course Title: Object Oriented Programming with JavaLab, 3 Hours/Week,
1.5 Credit, Total Marks 100 (Class Attendance=10, Internal Evaluation/Observation = 70, Final Viva-voce
=20),Year 2, Term 2
Rationale: This course provides an introduction to object-oriented programming with Java. Pupil will
learn how to develop different kinds of applications using java.

83
Course Objectives:
➢ Experimental verifications of theoretical concepts developed in CSTE 2201.
➢ Implement common I/O operations using Java
➢ Implement event-driven graphical user interfaces (GUI) in Java
➢ Developing Java API and GUI based software.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Eclipse IDE.

Lesson Plan (as per week):

Course Outcome (at the end of the Teaching Learning Assessment
Week

Contents lesson, student should be Strategy(activities Strategy(How they

able to) directed to achieve are developed)
outcomes)
1 Developing Java • Write programs using Discussion and -Home task
application algorithms, different practice -Quiz
• Algorithms data types, and
• Data types operators.
• Operators
2 Control structure • Write programs on First lecture and then Answer basic
• If/else if/else, while repetition, Practice questions, quizzes,
• While repetition for, switch, do/while, Homework, exams.
• For break, and continue.
• Switch
• Do/while
• Break and continue
3 Methods • Write programs on Lecture and discussion Quiz 1 (Topic of
• Method declaration Method declaration, with problems. the 1-3 weeks)
• Java API packages Recursion, method
• Recursion overloading, and
• Method overloading method of the applet
• Method of the applet class
class
4 Arrays • Write programs on Lecture and discussion Homework
• Array declaration array declaration, with problems.
• Memory allocation passing array as
• Array as argument arguments, sorting
• Sorting arrays arrays, and searching
• Searching arrays arrays
5-6 Object-based • Write programs on Practice with a real life Answer basic
programming abstract data type, problem. questions, quizzes,
• Time abstract data type Constructors, set and Homework, exams.
• Utility methods get methods, data
• Constructors abstraction, friendly
• Overload constructor class, and information
• Get and set methods hiding
• Friendly class
• Data abstraction
• Information hiding

84
7-8 Object-oriented • Write programs on Lecture and discussion Quiz 2 (Topic of
programming superclass and with problems. the 4-8 weeks)
• Superclass and subclass subclass, Finalize,
• Finalize inheritance,
• Inheritance polymorphism,
• Polymorphism Dynamic method
• Dynamic method building, final, and
building abstract superclass, and
• Final concrete class.
• Abstract superclass and
concrete class

9 String and Exception • Write programs on Lecture and discussion Homework

handling String and characters, with problems.
• String and characters Exception handling,
• Exception handling and Files and Stream.
• Files and stream
10 Java API and GUI • Write programs on Practice with a real life Answer basic
• Java API Java API, Utility problem. questions,
• Utility classes classes, 2D graphics, . Homework
• 2D graphics GUI and Swing.
• GUI
• Swing
11 Multithreading and • Write programs on Lecture and discussion Answer basic
Interface events, inheritance, and with problems. questions,
• Events multithreading Homework
• Interfaces Quiz 3 (Topic of
• Multithreading the 9-12 weeks)
12 Project • Submit a project using Evaluate each project. Presentation,
the concepts of Project showcasing.
structured
programming
language.
13 Final Lab Exam (Lab and Viva)

COURSE CODE: CSTE 2203, COURSE TITLE: DIGITAL ELECTRONICS AND PULSE
TECHNIQUE

Course Code: CSTE 2203, Course Title: Digital Electronics and Pulse Technique, 2 Hours/Week, 2
Credits, Total Marks 100 (Attendance=5, Continuous Assessment=25, Final exam=70),Year 2, Term 2
Rationale: This course has been designed to develop the students’ ability to realize the internal
functionality of Digital Electronic circuits and hence the logic functions, analyses and applications.
Course Objectives:
➢ Make the students familiarize with the internal structure of digital logic circuits
➢ Analyze and apply debugging and testing techniques to locate and resolve errors and to determine
the effectiveness of a logic circuit.
➢ Effective use of fundamental logic elements including: function generation, application,
troubleshooting.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Device manual,
Question bank, Previous questions.
85
 Lesson Plan (as per week):
Course Outcome (at the end of the lesson, Teaching Learning Assessment
Contents student should be able to) Strategy Strategy
Week (activities directed to (How they are
achieve outcomes) developed)
1 Electronic switch Explain basic concept on logic Lecture and Answer basic
(logic): gates by using PN junction diode. discussion with questions,
Diode logic gates, Use a transistor as a switch, detailed information quizzes,
Transistor switches, Construct and explain the about the course, Homework,
Transistor gates, characteristics of logic circuits by including the exams.
MOS gates; using BJT, MOSFETs objectives, course
outcomes,
examinations. Topic
wise lecture delivery.

2 Logic applications: Compare the properties Lecture and Questions about

Logic Families: (temperature, frequency, power, size discussion with comparison,
TTL, ECL, IIL and etc.) of logic families and their sub- characteristics quizzes,
CMOS logic; families e.g. TTL series 54 & 74LS, parameters of logic Homework,
Logic families and ALS, AS, F etc. and CMOS 4000A, families individually. exams.
their sub-families 4000B, 4000UB, 54/74C, 54/74HC, Data sheet will be
54/74HCT, 54/74AC and 54/74ACT introduced.
families.
3 Propagation delay, Explain characteristics and Lecture and Design,
product and noise operation time (speed), merits and discussion with development,
immunity; Open demerits of Totem pole & open problems. explanation,
collector and high collector output NAND, NOT, Tri- quizzes,
impedance gates; state logic gates. Homework,
Electronic circuits Use FFs the basic building blocks of exams.
for flip-flops, counter, register, memory. Logic
counters and building by PLA.
register, memory
systems, PLA's;
4 Waveform Compare the functions, Lecture and Exercise with
generator, constructions and applications of discussion with various
Oscillator: LED & LCD. problems. Circuit mathematical
LED, LCD, and Characteristics, applications of design with op-amp. problems.
optically coupled operational amplifier (op- amp),
oscillators; Non- Integrator, differentiator, wave
linear applications converter, pulse generator,
of OP- AMPs; relaxation oscillator, Schmitt trigger
Analog switches by using op-amp.
5 A/D and D/A Realize the basic functions, Lecture and Class Test
converter: constructions, applications of A-D discussion on types of 1(topics of the
Basics of A-D and and D-A converters. A/D, D/A converters. week’s 1-4)
D-A converters.
6 A-D and D-A Explain the functions and Lecture and Design &
converters with applicability of A-D and D-A discussion with construction,
applications; S-H converters (e.g. flash, counter type, problems, precision of quizzes,
circuits tracking type) and Sample & Hold A-D and D-A Homework,
circuit. converters. exams.

86
 7 Memory devices: Realize and explain the architecture Lecture on design and Design,
Memory and properties of RAM (static & applications of construction &
architecture, mask dynamic), MROM, EPROM, memory devices. explanation,
ROM design, EEPROM. Types &Applications of Architecture, quizzes,
NMOS and CMOS ROMs, Expanding Memory properties, word size Homework
memories, dynamic Capacity. expansion, memory (word size
registers. location expansion. expansion,
memory
location
expansion),
exams.
8 Waveform shaper: Design & Explanation of wave Lecture on design and Design,
Linear wave shaping circuits, RC. applications of the construction &
shaping: diode wave Clippers and clampers circuits and circuits. explanation,
shaping techniques, application of all of them. quizzes,
clipping Homework,
andclampingcircuits, exams.
comparator circuits

9 Transistor switch, Transistor as a switch, Transistor at Lecture on design and Class Test
Pulse transmission: cut-off, Transistor switch in applications of the 2(topics of the
Switching circuits; saturation, Transistor switch with circuits. week’s5-8)
Pulse transformers, inductive/capacitive load.
pulse transmission. Pulse transformer construction,
Character, application. Pulse
transmission in Data
communication, FSK.
10 Multivibrator: Design and explanation of Lecture on design and Design,
Monostable, multivibrators, Schmitt trigger by applications of the construction &
Bistable and Astable npn transistors. Design and circuits. explanation,
multivibrators, explanation of Monostable, Astable quizzes,
Schmitt trigger by multivibrators, Homework,
using npn transistors VCO by555 IC. exams.
11 Signal generator: Pulse generation (Blocking Lecture on design and Design,
Pulse generation, oscillator), Voltage time-base applications of the construction &
Blocking oscillators generator, Current time-base circuits. explanation.
and time-base generator.
circuit
12 Timing circuits; Time base waveform generation, Lecture on design and Class Test
Simple voltage sweep circuit using a Transistor, applications of the 3(topics of the
sweeps, linear current sweep circuits. circuits. week’s9-11)
current sweeps
13 Review topics and Learn about latest trends and the Lecture and Exercise the
Final exam better answering methods in the discussion on answering
preparation. final exam. miscellaneous topics. methods in final
exam.

Recommended Books:
6. Digital and Pulse Technique by Gyanendra K Mithal, Khanna.
7. High-Speed Pulse and Digital Techniques by Arpad Bama, John Wiley, and Sons.
8. An Introduction to Switching Theory and Digital Electronics by V. K. Jain,Khanna Publishers.
9. Digital Electronics Principles, Devices and Applications by Anil K. Maini.
87
10. Millman’s pulse, Digital & switching waveforms. By Jacob Millman, Herbert Taub.

COURSE CODE: CSTE 2204, COURSE TITLE: DIGITAL ELECTRONICS AND PULSE
TECHNIQUE LAB

Course Code: CSTE 2204, Course Title: Digital Electronics and Pulse Technique Lab,2
Hours/Week, 1 Credit, Total Marks 100 (Class Attendance=10, Internal Evaluation/Observation = 70,
Final Viva-voce =20),Year 2, Term 2
Rationale: This course has been designed to develop the students’ ability to realize practically the
internal functionality of Digital Electronic Circuits and hence the logic functions, analyses and
applications.
Course Objectives:
➢ Make the students familiarize with the internal structure of digital logic circuits
➢ Analyze and apply debugging and testing techniques to locate and resolve errors and to determine
the effectiveness of a logic circuit.
➢ Effective use of fundamental logic elements including: function generation, application,
troubleshooting.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Device manual,
Question bank, Previous questions, Circuits.
Lesson Plan (as per week):

Course Outcome (at the end of the Teaching Assessment

Contents lesson, student should be able earning Strategy(How
to) Strategy they are
Week

(activities developed)
directed to
achieve
outcomes)
1 Use a transistor as a switch, Electronic switch (logic). Demonstration Answer basic
Construct and explain the with questions,
characteristics of logic circuits by appropriate quizzes.
using BJT, MOSFETs devices
2 Logic Families: TTL, ECL, IIL Logic applications. Demonstration Do.
and CMOS logic;Logic families Compare the properties with
and their sub-families (temperature, frequency, power, appropriate
size etc.) of logic families and devices and
their sub-families e.g. TTL manual
series 54 & 74LS, ALS, AS, F
etc. and CMOS 4000A, 4000B,
4000UB, 54/74C, 54/74HC,
54/74HCT, 54/74AC and
54/74ACT families.
3 Design and Construction of a Waveform generator, Demonstration Circuit
Summing amplifier by using Op- Oscillator. with construction
amp. Integrator, differentiator, appropriate and
wave converter by using Op-amp. circuits interpretation.
Design and Construction of a
Voltage Controlled Oscillator
(VCO) by using 555 IC.
4 D-A converter by using Op-amp. A/D and D/A converter. Do. Do.

88
5 Do. Class Test
1(topics of the
week’s 1-4)
6 Design and Construction of a Waveform shaper. Do. Circuit
Schmitt trigger by using NPN construction
transistors./Op-amp. and
interpretation.
7 Design and Construction of Multivibrator. Do. Do.
Astable/Monostable/Bi-stable
multivibrators by using NPN
transistors.
8 Design and Construction of Do. Do.
Astable/Monostable/Bi-stable
multivibrators by using PNP
transistors.
9 Do. Class Test
2(topics of the
week’s5-8)
10 Design and Construction of Do. Circuit
Astable/Monostablemultivibrators construction
by using 555 IC. and
interpretation.
11 Design and Construction of a Signal generator. Do. Do.
Relaxation oscillator by using Op-

amp. /UJT.
12 Do. Class Test
3(topics of the
week’s9-12)
13 Final Lab Exam (Lab and Viva)

COURSE CODE: CSTE 2205, COURSE TITLE: SIGNALS AND SYSTEMS

Course Code: CSTE 2205, Course Title: Signals and Systems, 2 Hours/Week, 2 Credits, Total Marks
100 (Attendance=5, Continuous Assessment=25, Final exam=70),Year 2, Term 2
Rationale: This course is designed to provide a platform for engineers and designers who would like to
work in the most challenging and emerging field of signal processing. The study of signals and systems
has opened up a whole new era of solutions to resolve many intricate signal processing problems.
Course Objectives:
➢ To introduce students the concept and theory of signals and systems needed in computer science
and telecommunication engineering fields.
➢ To introduce students to the basic idea of signal and system analysis and its characterization in time
and frequency domain.
➢ To present the concepts of convolution and correlation integrals and also understand the properties
in the context of signals/systems and lay down the foundation for advanced courses.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Device manual,
Question bank, Previous questions.
Lesson Plan (as per week):

89
 Course Outcome (at the end Teaching Learning Assessment

Week
Contents of the lesson, student Strategy Strategy
should be able to) (activities directed to (How they are
achieve outcomes) developed)
1. Signal classifications: Continuous, Recognize, sketch Lecture and Answer basic
discrete, stochastic, even-odd signals, and manipulate basic discussion with questions,
mathematical models of ideal signals, signals commonly detailed information quizzes,
Elementary/test signals, power and used in engineering about the course, Homework,
energy signal. applications; including the exams.
objectives, course
outcomes,
examinations, Topic
wise lecture delivery.
2. Signal classifications: Response of Lecture and Answer basic
test signals to LTI systems, discussion on questions,
representation of signals using different types of quizzes,
impulse function. signals. Homework,
exams.
3. Systems: Classification, Properties of Define, state and Lecture and Answer basic
system- Linearity, causality, time identify system discussion on questions,
invariance, memory, stability, and properties of different properties of quizzes,
invariability. linearity, time systems. Homework,
invariance, causality, exams.
memory and
stability;
4. Time domain analysis of LTI Formulate and solve Lecture and Exercise with
systems: Differential equations- differential equations discussion on various
system representation, order of the describing linear, differential equation mathematical
system, solution techniques, zero state time invariant (LTI) of system response. problems.

and zero input response, system systems, including

properties; both transient and
steady-state
responses;
5. Time domain analysis of LTI Lecture and Class Test
systems: Impulse response- discussion on impulse 1(topics of the
convolution integral, determination of response of systems. week’s 1-4)
system properties; state variable- basic
concept, state equation and time
domain solution.
6. Frequency domain analysis of LTI Lecture and Answer basic
systems: Fourier series- properties, discussion on how to questions,
harmonic representation, system apply Fourier analysis quizzes,
response, frequency response of LTI to periodic and Homework,
systems; aperiodic signals exams.
7. Frequency domain analysis of LTI Lecture and Answer basic
systems: Fourier transformation- discussion on how to questions,
properties, system transfer function, apply Fourier quizzes,
system response and distortion-less transform techniques Homework
systems. to signals and exams.
systems.

90
 8. Applications of time and frequency Analyze engineering Answer basic
domain analyses: Solution of analog problems by using questions,
electrical and mechanical systems. properties of quizzes,
transform Homework,
techniques. exams.
9. Laplace transformation: Fourier to Define Laplace Lecture and Class Test
Laplace, Properties, inverse transform, transforms and discussion on how to 2(topics of the
solution of system equations, system manipulate s-domain analyze LTI systems week’s 5-8)
transfer function. transfer functions by transform
describing LTI techniques
systems.

10. Laplace transformation: System Answer basic

stability and frequency response and questions,
application, Convolution integral and quizzes,
its application, Superposition integral. Homework,
exams.
11. The Z Transformation: Sampled Apply Z transform Lecture and Quizzes,
data system, Definition and properties techniques to signals discussion on how to Homework,
of Z-transform, ROC, and systems analyze LTI systems exams.
by transform
techniques
12. The Z Transformation: Inverse Z- Class Test
transform, Mapping between Z plane 3(topics of the
and S plane, Stability, Solution of week’s 9-12)
Difference equations.
13. Review topics and Final exam Learn about latest Lecture and Exercise the
preparation. trends and the better discussion on answering
answering methods miscellaneous topics. methods in
in the final exam. final exam.

Recommended Books:
1. Continuous and Discrete Signals and Systems- S. S. Soliman, M.D. Srinath

91
2. Signal Processing and Linear Systems- B.P. Lathi
3. Analysis of Linear Systems- David K. Cheng
4. Signals and Systems- Simon Haykin, Barry Van Veen
5. Linear Circuit Analysis:Time Domain, Phasor, and Laplace Transform Approaches-Raymond A.
DeCarlo, Pen-Min Lin

COURSE CODE: CSTE 2207, COURSE TITLE: ELECTRONIC COMMUNICATION

Course Code: CSTE 2207, Course Title: Electronic Communication, 3 Hours/Week, 3 Credits, Total
Marks 100 (Attendance=5, Continuous Assessment=25, Final exam=70), Year 2, Term 2
Rationale: This course is designed to develop the students’ ability to realize on highlighting the
concepts and principles pertaining to electronic communication systems. Concepts such as information
theory, telephone switching systems, modulation, side band and television signal transmission,
radiation and propagation, reception and demodulation which are widely used in the field of analog
communication are dealt with in this course.
Course Objectives:
➢ To introduce the concepts of analog communication systems
➢ To equip students with various issues related to analogue communication such as modulation,
demodulation, transmitters and receiver’s performance.
➢ To explain the concept of switching, signaling and traffic in the telephone networks environment.
➢ To introduce the basics of picture transmission and reception, analysis and synthesis of composite
video signal, receiver and picture tubes and television camera tubes.
➢ To introduce latest and revolutionary ideas in the field of digital TV, HDTV, and etc.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Device manual,
Question bank, Previous questions.
Lesson Plan (as per week):
Course Outcome (at the end of Teaching Learning Assessment
Contents the lesson, student Strategy (activities Strategy
Week

should be able to) directed to achieve (How they

outcomes) are
developed)
1. Overview of communication Understand different Lecture and Answer basic
systems: Basic principles, blocks in discussion with questions,
fundamental elements, system communication detailed information quizzes,
limitations, message source, system about the course, Homework,
bandwidth requirements, transmission including the exams.
media types and transmission objectives, course
capacity. outcomes,
examinations, Topic
wise lecture
delivery.
2. Overview of telecommunication: Memorize the Lecture and Answer basic
history, evolution, convergence of evolution of discussion on questions,
telecommunication and data networks, telecommunication and overview of quizzes,
standards; Noise: Source, how noise affects telecommunication Homework,
characteristics of various types of communication exams.
noise and signal to noise ratio. systems
using different
parameters.

92
3. Information theory: Measure of Determine the amount Lecture and Answer basic
information, source encoding, error of information per discussion with questions,
free communication over a noisy symbol and mathematical quizzes,
channel, channel capacity of a information rate of a concepts on Homework,
continuous system and channel discrete memoryless information theory. exams.

capacity of a discrete memoryless source

system.
4. Switching system: Introduction to Understand the Lecture and Exercise with
analog system, digital switching principles and discussion on various
systems-space division switching, operation of telephone different types of mathematical
blocking probability and multistage switching systems. switching systems problems.
switching, time division switching and
two-dimensional switching.
5. Telephone apparatus: Microphone, Analyze the Lecture and Class Test
speakers, ringer, pulse and tone characteristics of the discussion on 1(topics of
dialing mechanism, side-tone telephone systems and mechanism of the week’s 1-
mechanism, local and central batteries networks. telephone and how 4)
and advanced features. Telephone telephone signal
Networks: Subscriber loop systems, propagates in
switching hierarchy and routing, wireless medium.
Transmission plan, Transmission
systems, numbering plan, charging
plan, signaling techniques, In-channel
signaling, Common channel signaling.
6. Telephone switching systems: Develop the concepts Lecture and Answer basic
PABX, Centrex, ACDs, call centers, and principles about discussion on how questions,
computer integration, PSTN; Modern modern telephone old telephony quizzes,
telephone services and network: systems technology is Homework,
Internet telephony, facsimile, converted to exams.
integrated services digital network, modern telephony.
asynchronous transfer mode and
intelligent networks. Introduction to
ISDN channels & access
arrangements, formats, service
capabilities and user-network
interfaces; Limitations of ISDN,
Introduction to B-ISDN.
7. Video transmission and storage: Understand the Lecture and Answer basic
Introduction, Color representation, fundamental concepts discussion on questions,
Conventional TV transmission of television analog television quizzes,
systems, transmitter and system. Homework
receiver systems, the exams.
transmission of video
signals
8. Video transmission and storage: Understand advanced Lecture and Answer basic
High definition TV, Digital video, TV technology and discussion on latest questions,
Cable TV networks, Video data describe the operating trend of TV quizzes,
compression, Compression standards, principles of latest technology Homework,
Packet video, Hybrid Fiber Coaxial digital TV. exams.
(HFC) Network.

93
9. Dial-Up MODEMs: Modem Lecture and Class Test
Standards- V.32, V.32bis, V.90, V.92. discussion on 2(topics of
Digital Subscriber Line (DSL): concepts of the week’s 5-
ADSL, HDSL, SDSL, VDSL. MODEM and DSL. 8)
10. Continuous wave modulation: Demonstrate Lecture and Answer basic
Amplitude Modulation (AM), Time understanding of discussion on basics questions,
Domain Expression and Modulation various analog of amplitude quizzes,
Index, Frequency Domain (Spectral) modulation and modulation. Homework,
Representations, and Transmission demodulation exams.

Bandwidth for AM. AM for a Single techniques

Tone Message, Pharos Diagram of an
AM signal, Illustration of the Carrier
and Side Band Components.
11. Continuous wave modulation: Distinguish between Lecture and Quizzes,
Double Side Band (DSB) Modulation: different amplitude discussion on Homework,
Time and Frequency Domain modulation schemes mathematical exams.
Expressions. Square Law Modulators, with their advantages, concepts of
Balanced Modulators, Ring disadvantages and amplitude
Modulators. Single Side Band applications. modulation and
Modulation (SSB), Generation of SSB explain it in time
Using a Side Band Filter, Indirect and frequency
Generation of SSB. Vestigial Side domain.
Band Modulation (VSB).
Demodulation for Linear Modulation:
Demodulation of AM Signals, Square
Laws and Envelops Detectors. Super
Heterodyne Receiver for Standard AM
Radio, Synchronous Demodulation of
AM, DSB and SSB Using
Synchronous Detection.
12. Continuous wave modulation: Angle Analyze generation Lecture and Class Test
Modulation: Instantaneous Frequency and detection of discussion on 3(topics of
and Phase, Time Domain FM/PM signal. mathematical the week’s 9-
Representations for FM and PM, concepts of angle 12)
Phasor Diagram for FM and PM, FM modulation and
and PM Signals for a Single Tone explain it in time
Message, Modulation Index and and frequency
Phasor Diagrams, Spectral domain.
representation of FM and PM for
Single Tone Message. Transmission
Bandwidth for FM, Carson's rule,
Narrow band and Wide Band FM and
PM Signals. Generation of FM Using
Armstrong Method, Commercial FM
Requirements. Demodulation of FM
and PM Signals, Limiter
Discriminator, Commercial and Stereo
FM Radio.

94
 13. Review topics and Final exam Learn about latest Lecture and Exercise the
preparation. trends and the better discussion on answering
answering methods in miscellaneous methods in
the final exam. topics. final exam.

Recommended Books:
1. Data Communications and Networking by Behrouz A. Forouzan, McGraw-Hill.
2. Principles of Communication Systems by Herbert Taub& Donald L. Schilling, McGraw-Hill
3. Communication System by Simon Haykin,
4. Telecommunications Switching, Traffic and Networks by Flood, John Edward, Prentice Hall, 1995.

COURSE CODE: CSTE 2208, COURSE TITLE: ELECTRONIC COMMUNICATION LAB

COURSE CODE: CSTE 2208, COURSE TITLE: ELECTRONIC COMMUNICATION LAB, 1

Hours/Week, 1 Credits, Total Marks 100 (Class Attendance=10, Internal Evaluation/Observation = 70,
Final Viva-voce =20), Year 2, Term 2
Rationale: This lab course is designed to give students ability to design, build, and implement
electronic
communication related experiment. Through well design experiment, students are able to appreciate the
theoretical aspects of electronic communication system.
Course Objectives:
➢ Provide hands-on experience to the students so that they are able to put theoretical concepts
to practice.
➢ Understand the concept of analog modulation, analog and digital telephone exchange, and different
electronic communication experiment with practical environment.
➢ Acquire teamwork skills for working effectively in groups.
➢ Develop technical writing skills important for effective communication.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Device manual.
Lesson Plan (as per week):
Course Outcome (at the end Teaching Learning Assessment
Contents of the lesson, student Strategy (activities Strategy
Week

should be able to) directed to achieve (How they

outcomes) are
developed)
1. To familiar with the operation of gain significant Lecture and Answer basic
different communication equipment. experience with discussion with questions
communication detailed information about
equipment. about the lab different
course, including types of
the objectives, communicati
course outcomes, on
lab examinations equipment.
and evaluation
method.
2, Analog Modulation: Explain the concept of Through lecture, Neatness,
3, Using Board: analog modulation and laboratory, and out- organization,
4, AM/FM/PM/DSB-SC/SSB-SC apply them of-class completeness
5, transmitter and Receiver to laboratory assignments. and
6 measurements. individually

95
 7, Telephone: Explain the concept of Through lecture, written lab
8 Analog and digital
telephone telephone system and laboratory, and out-reports are
exchange apply them of-class due at the
to laboratory assignments. beginning of
measurements. the lab
9, Acquaint with Simulation program Become proficient Through lecture and period.
10, (MATLAB) with computer skills discussion Respected
11 (eg.,MATLAB) for the Teacher will
analysis of circuits. be evaluated
in lab period.
12 Visit different communication related
company.
13 Final Lab Exam (Job, Quiz and Viva)

COURSE CODE: CSTE 2209, COURSE TITLE: THEORY OF COMPUTATION

Course Code: CSTE 2209, Course Title: Theory of Computation, 3 Hours/Week, 3 Credits, Total
Marks 100 (Attendance=5, Continuous Assessment=25, Final exam=70), Year 2, Term 2
Rationale: The course deals with the concept of computability and mathematical models, such as finite
automata, grammars and Turing machines, and the relations between these models.
Course Objectives:
➢ Introduce students to the mathematical foundations of computation including automata theory; the
theory of formal languages and grammars; the notions of algorithm, decidability, complexity, and
computability.
➢ Enhance/develop students' ability to understand and conduct mathematical proofs for computation
and algorithms.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Question bank,
Previous questions.
Lesson Plan (as per week):
Course Outcome (at the end of Teaching Learning Assessment
Contents the lesson, student should Strategy (activities Strategy (How
Week

be able to) directed to achieve they are

outcomes) developed)
1 Formation of Preliminary Give preliminary concepts Lecture and Answer basic
Concepts Automata, about computation theory. discussion with questions,
computability, and Give an account of detailed information quizzes,
complexity Mathematical important concepts and about the course, Homework,
tools Definitions, definitions for automata including the exams.
theorems, and proofs and formal languages; objectives, course
Types of proofs outcomes,
examinations. Topic
wise lecture
delivery.
2 Regular Languages, finite Understand recursive Lecture and Answer basic
automaton, Examples of definitions of regular discussion about questions,
finite automata, languages, regular regular expression quizzes,
Designing finite expressions and the use of and its relation with Homework,
automata, regular expressions to NFA and DFA exams.
represent regular
languages.
96
3 Equivalence of NFA’s Detailed knowledge and Lecture and problem Answer basic
and DFA’s, The regular the relationship between solving on regular questions,
operations - Closure regular expressions and expression quizzes,
under the regular finite automata. Homework,
operations exams.
4 Regular Expressions. Transform between Lecture and Exercise with
Regular Set, Closure of equivalent deterministic discussion with various
Regular Expressions, and non-deterministic problems. mathematical
Equivalence with finite finite automata and problems.
automata, Arden’s regular expressions;
Theorem.
5 Application of Regular Get the knowledge about Lecture and Class Test
Expressions. Non-regular particular regular discussion with 1(topics of the
Languages - The pumping language’s regularity problems; pumping weeks 1-4)
lemma for regular properties. lemma
languages.

6 Context-Free Apply rigorously formal Lecture and Answer basic

Languages: Formal mathematical methods to discussion about questions,
definition of a context- prove properties of CFG. quizzes,
free grammar - Examples languages, grammars, and Homework,
of context-free automata. exams.
grammars.
Ambiguity.

7 CFG Simplify context-free Lecture and Answer basic

Simpli grammar and discussion on questions,
fication, Chomsky making Grammar quizzes,
normal form and interconversion simplification. Homework
Greibach Normal Form between CNF and (word size
(GNF) GNF. expansion,
memory
location
expansion),
exams.
8 Pushdown Automata, transform pushdown Lecture and Answer basic
the Formal definition of automata and context- discussion on questions,
a pushdown automaton free grammar. pushdown quizzes,
- Examples of pushdown automata and Homework,
automata, Equivalence its relation with exams.
with CFG.
contex
t-free grammars.
9 Computability Theory: design Turing machine Lecture and Class Test
The Church-Turing and Pushdown automata discussion on 2(topics of
Thesis. Turing machine, for a given language. Turing the weeks5-
Nondeterministic machine. 8)
Turing machines,
Hilbert's
problems

97
10 Decidability: Identify a language is Lecture and Answer basic
Decid decidable, undecidable or discussion on questions,
able languages, The partially decidable. language quizzes,
haltin decidability. Homework,
g problem–the exams.
diagonalization method.
11 Complexity Theory: The Understand time and Lecture and Quizzes,
Classes P, NP, Examples space management of discussion on Homework,
of complexity theories. complexity exams.
proble theory.
ms in Learn classic results on
complexity classes
these including P and NP.
classes. The
P
versus
[Link]-
Completeness,
Polynomial

time
reducibility, The Cook-
Levin Theorem.
12 Examples of NP- Learn NP-complete Lecture and Class Test
Complete Problems: problems and its related discussion on 3(topics of
The vertex cover problems with NP complete the weeks9-
problem-The application. problems. 12)
Hamiltonian path
problem
Examples of NP-
Complete Problems:
The subset sum
problem.
Approximation
algorithm, Probabilistic
Algorithms.
13 Applications: analysis Understand the Lecture and Exercise the
and classification of application of discussion on answering
Biochemical reactions, biochemical reaction in the application methods in
the complexity of complexity of the
evolved theory. complexity final exam.
theory.
organisms.

98
Recommended Books:
1. Introduction to Automata Theory, Languages and Computation by Hopcroft and Ulman, Addison
Wesley.
2. Elements of the Theory of Computation by Lewis and Papadimitriou, Prentice Hall.
3. Compiler design in C by A.J. Holub, Prentice-Hall.
4. Elements of Automata Theory by Jacques Sakarovitch, Cambridge University Press.
5. A Textbook on Automata Theory by P.K. Srimani and S.F.B Nasir, Cambridge University Press.

COURSE CODE: CSTE 2211, COURSE TITLE: ELECTROMAGNETIC WAVES AND RADIATING
SYSTEMS

Course Code: CSTE 2211, Course Title: Electromagnetic Waves and Radiating Systems, 2 Hours/Week,
2 Credits, Total Marks 100 (Attendance=5, Continuous Assessment=25, Final exam=70),Year 2, Term 2
Rationale:Develop a strong background in electromagnetic theory and understand and use various
mathematical tools to solve Maxwell equations in problems of wave propagation and radiation.
Course Objectives:
➢ Obtain solutions for the one-dimensional wave equations of voltage and current along the line.
➢ Understand and analyze uniform transmission lines in order to predict and design specified
characteristic impedances and propagation constants.
➢ Calculate load impedance-admittance transformations analytically and with Smith charts.
➢ Perform single-stub impedance-admittance matching-network calculations.
➢ Understand and predict plane electromagnetic-wave propagation in free space and dielectrics.
➢ Predict electromagnetic plane-wave reflection and transmission properties at interfaces between
different media.
➢ Understand electromagnetic radiation from antennas, its application in satellite communications and
radar.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Device manual,
Question bank, Previous questions.
Lesson Plan (as per week):
Course Outcome (at the end of Teaching Assessm
Contents the lesson, student should Learning ent
be able to) Strategy(ac Strategy
Week

tivities (How
directed to they are
achieve develope
outcomes) d)
1 Guided waves: Maxwell's equations ;plane wave propagation in Derivation of Maxwell Lecture and Answer
isotr- opic media
equations and wave discussion basic
propagation in with question
conducting and non- detailed s,
conducting media. information quizzes,
about the Homewo
course, rk,
including exams.
the
objectives,

99
 outcomes,
examination
[Link]
wise lecture
delivery

2 Reflection; refraction; diffraction and polarization of EM To get idea about the Lecture and Answer
waves ;pointing vectors and power flow. change of discussion basic
electromagnetic field of question
when it passes from one
propagation s,
medium to another. of EM quizzes,
waves in Homewo
different rk,
medium. exams.
3 Waves between parallel planes, TE,TM,TEM waves and Wave propagation Lecture and Answer
their characteristics, Attenuat ion in parallel plane guides, between parallel plate. discussion basic
wave impedances. To get concept about with question
TE,TM,TEM waves and problems. s,
their characteristics. quizzes,
Homewo
rk,
exams.
4 Rectangular waveguides: TM,TE waves in rectangular guides Wave propagation in Lecture and Exercise
and their characteristics, rectangular system and discussion with
TE, TM characteristics. with various
problems. mathema
tical
problems
.
5 Wave velocity, guide wave length, wave impedances, field Idea of wave velocity Lecture and Class
configurations and group velocity. discussions. Test
1(topics
of the
week’s
1-4)
6 Transmissionlines: Transmission line equations and their Understand and analyze Lecture,disc Answer
solution. Transmission line parameters, characteristic uniform transmission ussions and basic
impedance, propagation constant, attenuation constant and lines in order to predict power point question
phase constant, and design specified presentation s,
characteristic impedances . quizzes,
and propagation Homewo
constants. rk,
exams.

100
7 Wave form distortion, distortionless transmission lines, Calculate load Answer
loading of transmission lines, reflection coefficient and impedance-admittance basic
VSWR. Equivalent circuits of transmission lines,transmission transformations question
lines at radio frequency, openand short-circuited lines,Smith analytically and with s,
chart, stubmatching. Smith charts. quizzes,
Homewo
rk (word
size
expansio
n,
memory

location
expansio
n),
exams.
8 Potential: Scalar and vector potentials, retarded potentials, field Understand Retarded Answer
due to a current element, the power radiated and radiation potentials and basic of basic
resistance for field due to a dipole, radiation. question
s,
quizzes,
Homewo
rk,
exams.
9 The power radiated and radiation resistance, reciprocity Understand the basic Class
theorem applied to antennas gain and aperture of an antenna, concepts and Test
radiation intensity, directivity and antenna gain. characteristics of 2(topics
antennas in the of the
transmit and receive week’s5-
mode. 8)
1 Array: Two element arrays and their directional characteristics, Understand the Answer
0 linear array analysis, broadside and end-fire arrays,pattern concepts of array basic
multiplication, binomial arrays,Design of broadcast array for antennas such as question
as pecific pattern. analysis and s,
synthesis of radiation quizzes,
patterns. Homewo
rk,
exams.
1 Antenna: Basic principles of parabolic reflectors, analysis and Understand and design of Quizzes,
1 power pattern, lens antennas, folded dipole, parabolic reflector Homewo
antenna, lens antenna and rk,
folded dipole antenna. exams.
1 Turnstile and Yagi antenna log periodic antenna Understand and Class
2 horn antennas, traveling wave antennas design broadband Test
,Cassegrain antenna. antennas such as 3(topics
helixes, spirals, and of the
log periodic antennas, week’s9-
horn etc. 12)

101
1 Review Classes Learn about latest trends Lecture and Exercise
3 and the better answering discussion the
methods in the final on answerin
exam. miscellaneo g
us topics. methods
in final
exam.

Recommended Books:
1. Electromagnetic waves and radiating systems by Edward [Link]& Keith G. Balmain, Pearson.
2. Elements of Electromagnetics by Matthew N O Sadiku, Oxford University Press.
3. Engineering Electromagnetics [Link]& J.A. Buck, McGraw Hill.

COURSE CODE: MATH 2207, COURSE TITLE: COMPLEX VARIABLES, STATISTICS AND
PROBABILITY

Course Code: MATH 2207, Course Title: Complex Variables, Statistics and Probability,3 Hours/Week, 3
Credits, Total Marks 100 (Attendance=5, Continuous Assessment=25, Final exam=70),Year 1, Term 2
Rationale:This course is designed to provide an introduction to the theories for functions of a complex
variable and also extend and formalize knowledge of the theory of probability and random variables.
Provide an introduction to subsequent statistics courses for the information processing.
Course Objectives:
➢ Begins with the exploration of the algebraic, geometric and topological structures of the complex
number field.
➢ Equipped with the understanding of the fundamental concepts of complex variable theory.
➢ Analyzing of numerical data using different statistical tools.
➢ Analyzing complex function and its related problems.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Device manual,
Question bank, Previous questions.
Lesson Plan (as per week):
Course Outcome (at Teaching Assessm
Contents the end of Learning ent
the lesson, Strategy Strategy
Week

student (activities (How

should be directed to they are
able to) achieve develope
outcomes) d)

102
1 Complex Analysis-Differentiation: Differentiation of functions of complex To get idea
Lecture and Answer
variable-Analytic functions- Cauchy-RiemannEquations(cartesianonly)- about discussion basic
HarmonicFunction-Orthogonalsystem-velocitypotential. analytic with detailed questions
function,Ca
information , quizzes,
uchy- about the Homewo
Riemann course, rk,
equations including the exams.
and objectives,
Harmonic course
function. outcomes,
examinations.
Topic wise
lecture
delivery.
2 Conformalmapping- Conditions Lecture and Answer
Mappingbyw=1/z,w=z2,w=ez,w=z+1/z,w=sinz,w=[Link] of conformal discussion basic
ion- fixed points-Problems to find the transformation when three mapping, about questions
points and their images are given. general mapping , quizzes,
transformati Homewo
ons and rk,
related exams.
problems.
3 Line integrals-simple problems-Statements of Cauchy’s Solution of Lecture and Answer
integral theorem, Cauchy’s integral formula- Formula for complex discussion basic
higher derivatives-Evaluation of integrals using the above integrations with questions
results. Taylor series and Laurent’s series(no proof)-simple using problems. , quizzes,
problems. Singularities-Residues-Cauchy’s Residue Cauchy’s Homewo
theorem(noproof)-[Link] of real definite theorem and rk,
integrals. Cauchy’s exams.
integral
formula.
Cauchy’s
residue
theorem,
Taylor and
Laurent
series
problem.

103
4 Meaning & Scope,Variables and Attributes, Collection and presentation of To Lecture and Exercise
Statistical data, Frequency Distribution and Graphical Representation. understand discussion with
Analysis of Statistical Data: Location, Dispersion and their measures. the analysis with various
Skewness, Kurtosis, and their measures. Moment and Cumulants of statistical problems. mathemati
data. cal
problems
.
5 Correlation theory: Linear correlation. Measures of correlation and its To get idea Lecture and Class
significance. Regression and curve fitting: Linear and nonlinear about thediscussion Test
regression. Methods of least squares. Curve fitting. interaction with 1(topics
of two problems. of the
variables and week’s 1-
data fitting. 4)
6 Concept of probability, Sample Space, Events. Union and Intersection of Conception Lecture and Answer
Events. The probability of Events. about discussion basic
Laws of probability. Conditional Probabilities. probability. with questions
Bose-Einstein Statistics. Bays probability problems. , quizzes,
Homewo
rk,
exams.
7 Basic concepts. Discrete and continuous Random variables. Density To get idea Lecture and Answer
and distribution functions. Mathematical Expectation and variance. about discussion basic
Conditional Expectation and conditional variance. Expected values and random with questions
variances of the density distributions. Moments and Cumulant generating variable and problems. , quizzes,
functions. Characteristic function. Study of Binomial, Poisson, Normal. different Homewo
Geometric, Negative Binomial, Hyper geometric, Multinomial, kinds of rk (word
uniform, exponential, Log normal, Logarithmic, Beta and Gamma, distribution. size
Cauchy and Weibull distributions expansio
n,
memory
location
expansio
n),
exams.
8 Study of Binomial, Poisson,[Link],Negative Continue of
Binomial,Hypergeometric,Multinomial,uniform,exponential,Lognor different
mal,Logarithmic,Betaand Gamma,Cauchy and Weibull distributions distributions
9 Chebyshev’s Inequality, Markov chain (discrete and Markov Lecture and Answer
continuous).Queuing theory Birthdeath processin [Link] chain, discussion basic
from computer [Link] models.(Elementary concepts). Sampling Queuing with questions
2
Distributing: Fisher's Lemma. Studyofᵡ Distribution,T- theory and problems. , quizzes,
Distribution,and F-Distribution,Properties,Uses & properties of Homewo
[Link] of sample correlation coefficient in the null ᵡ 2
, T and F rk,
case. Sampling Distribution of the Medians and Range distribution. exams.

1 Basic Concepts. Consistent estimates. Unbiased [Link] and varianc Basic Lecture and Class
0 e of estimates. Ideas of Efficiency. The principle of Maximum Likelihood. concepts of discussion Test
Illustration from Binomial, Poisson &Normal Distributions. consistent with 2(topics

104
 and unbiased problems. of the
estimates. week’s5-
8)
1 Statistical decisions; Statistical hypothesis; Critical region, Best Understand Lecture and Answer
1 critical region;Two types of errors; the procedure of Test of hypothesis; the various discussion basic
Most powerful test, standard Errors. concepts with questions
related to the problems. , quizzes,
testing of Homewo
hypothesis. rk,
exams.
1 Test of Significance: Test of single mean & single variance. Comparison of Test of Lecture and Quizzes,
2 two sample Means, proportions, and Variances. Bartlett's test for single mean, discussion Homewo
homogeneity of [Link] for correlation and Regression variance, with rk,
coefficients. correlation problems. exams.
and
regression
coefficient.
1 An exact test for 2*2 tables. Test for r*c tables. Three-Way Contingency Lecture and Class
3 contingency tables. Large Sample Test of Significance. tables and discussion Test
Nonparametric Test, One Sample, and two Sample Sign Test. one sample with 3(topics
Run Test and Rank Sum Test. and two problems. of the
sample sign week’s9-
tests. 12)

Recommended Books:
1. Probability with Statistical Applications by Mosteller, Rourke and Thomas,Addison-Wesley
2. Probability by [Link], McGraw-Hill,
3. Elements of Probability and Statistics by [Link], McGraw-Hill.

COURSE CODE: CSTE 2226, COURSE TITLE: VIVA VOCE

COURSE CODE: CSTE 2226, COURSE TITLE: VIVA VOCE, 0 Hours/Week, 1 Credits, Total
Marks 100, Year 2, Term 2
Rationale: This course has been designed to develop the students’ ability to realize practical situation
of job environment.
Course Objectives:
➢ Prepare the students to face interview both at the academic and the industrial sector
OUTCOME (Student should be able to)
COURSE CONTENTS
VIVA VOCE (Viva based on major/minor courses of Evaluate overall technical knowledge
Year-2) and industry readiness.
Able to go under a virtual environment of
technical interview.
Able to analyze various application of
Computer Science & Telecommunication
Engineering in real-life problem solving.

105
 COURSE CODE: CSTE 3101, COURSE TITLE: DATA COMMUNICATION

Course Code: CSTE 3101, Course Title: Data Communication, 3 Hours/Week, 3 Credits, Total Marks
100 (Attendance=5, Continuous Assessment=25, Final exam=70),Year 3, Term 1
Rationale: After understanding electronic communication systems, it isimportant to proceed further on
to the concepts related to Data Communication. Thefield of communication is the fastest growing
technology and undoubtedly heading towards to a runaway growthin future which makes it important to
know how data transfer takes place from one system to another, throughdifferent channels and
computer networks. This course is the cornerstone of modern telecommunications
Course Objectives:
➢ Convey the essentials of data communication and networking including a study of the Open
Systems Interconnection (OSI), TCP/IP and Internet models.
➢ Learn about theoretical bounds on the rates of digital communication system and represent a digital
signal usingseveral modulation methods.
➢ Understanding the concepts of various pulse modulation techniques and methods of generating and
decoding, in each of the pulse modulationsystems, along with error detection and correction
methods.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Device manual,
Question bank, Previous questions.
Lesson Plan (as per week):
Course Outcome (at the end of Teaching Learning Assessment
Week

Contents the lesson, student Strategy(activities Strategy(Ho

should be able to) directed to achieve w they are
outcomes) developed)
1. Introduction: Data communication Understand the Lecture and Answer basic
components, Data representations, fundamental concepts discussion with questions,
Data flow types, Network topologies, of data communications detailed information quizzes,
Protocols, Standards, Network and networking about the course, Homework,
Model: Basics of OSI and TCP/IP including the exams.
model, Functions of different layers objectives, course
of OSI and TCP/IP model. outcomes,
examinations, topic
wise lecture
delivery.
2. Data and Signals: Analog and Explain how data is Lecture and Answer basic
digital data, Analog and digital converted to signal. discussion on the questions,
signals, Nyquist theorem, Shannon concepts of quizzes,
capacity, Performance measurement analog/digital data Homework,
of data network, Bandwidth-delay and signal. exams.
product,
3. Digital Transmission: Digital to Describe and determine Lecture and Answer basic
digital conversion- Line coding- the performance of line discussion on the questions,
NRZ, RZ, Manchester, Differential codes and methods to performance of the quizzes,
Manchester, AMI, Pseudoternary, mitigate inter symbol line coding. Homework,
2B/1Q, 8B/6T, 4D-PAM5, MLT-3, interference. exams.
Block coding- 4B/5B, 8B/10B,
Scrambling, B8ZS, HDB-3.
106
4. Pulse modulation: Sampling– Analyze and draw Lecture and Exercise with
sampling theorem, Nyquist graphs to illustrate the discussion on various
criterion, aliasing, instantaneous different types of pulse different types of mathematical
and natural sampling; pulse carrier modulation pulse modulation. problems.
amplitude techniques:
modulation (PAM), PWM, PPM;

5. PCM: Sampling, aliasing, anti- Lecture and Class Test

aliasing filter, linear and non-linear discussion on the 1(topics of
quantization, quantization noise, different steps of the week’s 1-
companding, DPCM, DM, PCM, DPCM and 4)
multiplexing, Digital hierarchy: DM system.
T1/E1 system; simplex, half-duplex
and full-duplex communication.
6. Modulation Technique: Digital to Understand the Lecture and Answer basic
analog conversion- ASK, FSK, generation, discussion on the questions,
Various type of PSK such as BPSK. detection,constellation different types of quizzes,
QPSK, 8-PSK, 16-PSK etc. diagram, spectrum, digital to analog Homework,
bandwidth modulation. exams.
efficiency,and
probability of error
analysis of different
band pass modulation
techniques.
7. Modulation Technique: Digital to Lecture and Answer basic
analog conversion- Various type of discussion on the questions,
QAM such as 8-QAM, 16-QAM etc., different types of quizzes,
GMSK, Probability of Error, Bit error digital to analog Homework
rate performance of all modulation in terms exams.
of bit error rate
performance
8. Bandwidth Utilization- Understand working of Lecture and Answer basic
Multiplexing and Spreading: FDM, spread spectrum discussion on the questions,
WDM, TDM- Synchronous TDM, communication system types of quizzes,
Statistical TDM, Interleaving, Spread and analyze its multiplexing and Homework,
spectrum- FHSS, DSSS. performance. spread spectrum exams.
technique.
9. Switching: Circuit switched network, Understand various Lecture and Class Test
packet switched network, Datagram types of switching, discussion on 2(topics of
network, Virtual circuit network. multiplexing and access different types of the week’s 5-
techniques. switching 8)
technique.

107
 10. Introduction to Coding Theory: Describe and determine Lecture and Answer basic
Single bit error, Burst error, Huffman the performance of discussion on the questions,
code, Error detecting and correcting different error control performance of quizzes,
Codes; Block coding- Hamming coding schemes for the different error Homework,
distance, Linear block codes. reliable transmission of control coding exams.
digital representation of technique.
signals and information
over the channel.
11. Introduction to Coding Theory: Lecture and Quizzes,
Simple parity check code, Hamming discussion on the Homework,
codes, Cyclic codes-Cyclic performance of exams.
redundancy check (CRC), Checksum, different error
Convolution codes. control coding
technique.
12. Multiple Access Technique: Lecture and Class Test
FDMA, TDMA, CDMA, SDMA, discussion on the 3(topics of
OFDM, OFDMA, SCFDMA. advantage, the week’s 9-
disadvantage and 12)
applications of
different types of
multiple access
technique.

13. Review topics and Final exam Learn about latest Lecture and Exercise the
preparation. trends and the better discussion on answering
answering methods in miscellaneous methods in
the final exam. topics. final exam.

Recommended Books:
1. Data Communications and Networking by Behrouz A. Forouzan, McGraw-Hill.
2. Principles of Communication Systems by Herbert Taub& Donald L. Schilling, McGraw-Hill
3. Modern Digital and Analog Communication Systems by B.P. Lathi and Zhi Ding, Oxford University
Press.

108
 COURSE CODE: CSTE 3102, COURSE TITLE: DATA COMMUNICATION LAB

Course Code: CSTE 3102, Course Title: Data Communication Lab, 2 Hours/Week, 1 Credits, Total
Marks:100 (Class Attendance=10, Internal Evaluation/Observation = 70, Final Viva-voce =20),Year 3,
Term 1
Rationale:This lab course is designed to give students ability todesign, build, and implement data
communication related experiment. Through well design experiment, students are able to appreciate the
theoretical aspects of data communication system.
Course Objectives:
➢ Provide hands-on experience to the students so that they are able to puttheoretical concepts to
practice.
➢ Understand the concept of analog to digital conversion, digital transmission, digital modulation,
error correction and detection method, signal multiplexing, and different types of spread spectrum
technique with practical environment.
➢ Acquire teamwork skills for working effectively in groups.
➢ Develop technical writing skills important for effective communication.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Device manual.
Lesson Plan (as per week):
Course Outcome (at the end of Teaching Learning Assessment
Week

Contents the lesson, student Strategy(activities Strategy(Ho

should be able to) directed to achieve w they are
outcomes) developed)
1. To familiar with the operation of gain significant Lecture and Answer basic
different data communication experience with data discussion with questions
equipment. communication detailed information about
equipment. about the lab different
course, including types of data
the objectives, communicati
course outcomes, on
lab examinations equipment.
and evaluation
method.
2, Digital Transmission: Explain the concept of Through lecture, Neatness,
3 Line Coding line coding and apply laboratory, and out- organization,
Using Board them tolaboratory of-class completeness
Unipolar-NRZ/ Bipolar-NRZ/ measurements. assignments. and
Unipolar-RZ/ Bipolar-RZ/ Alternate individually
Mark Inversion/ Manchester signal written lab
encodes and decode. reports are

109
 4, Digital Modulation: Explain the concept of Through lecture, due at the
5 Using Board: digital modulation and laboratory, and out- beginning of
ASK/FSK/BPSK/QPSK/QAM apply them tolaboratory of-class the lab
transmitter and Receiver measurements. assignments. period.
Respected
6, Analog to Digital conversion: Explain the concept of Through lecture, Teacher will
7 Using Board: analog to digital laboratory, and out- be evaluated
PAM/PWM/PPM/PCM modulator- conversion and apply of-class in lab period.
demodulator them to laboratory assignments.
measurements.
8’ Error Detection-Correction: Explain the concept of Through lecture,
9 Hamming code/Convolutional Code error detection- laboratory, and out-
transmitter-receiver. correction and apply of-class
them to laboratory assignments.
measurements.

10 Multiplexing: Explain the concept of Through lecture,

FDM/TDM/CDM multiplexing and apply laboratory, and out-
them to laboratory of-class
measurements. assignments.
11 Spread Spectrum: Explain the concept of Through lecture,
FHSS/DSSS spread spectrum and laboratory, and out-
apply them tolaboratory of-class
measurements. assignments.
12 Acquaint with Simulation program Become proficient with Through lecture and
(MATLAB) computer skills discussion
(eg.,MATLAB) for the
analysis of circuits.
13 Final Lab Exam (Job, Quiz and Viva)

Course Code: CSTE 3103, Course Title: Digital Signal Processing,3 Hours/Week, 3 Credits, Total
Marks 100 (Attendance=5, Continuous Assessment=25, Final exam=70), Year 3, Term 1

COURSE CODE: CSTE 3103, COURSE TITLE: DIGITAL SIGNAL PROCESSING

110
Rationale:The course deals with the concept of digital signal, systems and its applications, and also about
the different operations on digital signals and digital filter design.
Course Objectives:
➢ To develop the knowledge on signals used in digital signal processing.
➢ To introduce signals, systems, time and frequency domain concepts and the associated
mathematical tools those are fundamental to all DSP techniques.
➢ To provide a thorough understanding and working knowledge of design, implementation, analysis
and comparison of digital filters for processing of discrete time signals.
➢ To study various sampling techniques and different types of filters and will also understand basic
principles of Estimation Theory.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Question bank,
Previous questions.
Lesson Plan (as per week):
Course Outcome (at the end of Teaching Learning Assessment
Contents the lesson, student should Strategy (activities Strategy (How
Week

be able to) directed to achieve they are developed)

outcomes)
1 Discrete time signals & Impart the knowledge Lecture and Answer basic
systems: Discrete time about continuous and discussion with questions, quizzes,
signals, Discrete time discrete time signal detailed information Homework, exams.
systems, Linearity, Convert DT signals about the course,
causality, stability, between different notation including the
static/dynamic, Time representations and objectives, course
Invariance/Time variance, determine the class of outcomes,
classification of discrete signal whether a signal is examinations. Topic
time system. linear, time-invariant or wise lecture
Causal. delivery.
2 Discrete time signals & Apply to find impulse Lecture and problem Answer basic
systems: Linear response of DT system, discussion about questions, quizzes,
convolution, Circular convolution/system linear convolution Homework, exams.
convolution Cross response. and correlation
Correlation,
Autocorrelation. Linear
constant coefficient
difference equations

3 Discrete time signals & Understand origins of Lecture and Answer basic
systems: sampling Nyquist sampling rate and discussion on signal questions, quizzes,
theorem & sampling sinc reconstruction conversion Homework, exams.
process. Reconstruction formula for bandlimited
of sampling data, signals.
convolution.
4 Discrete time signals & Understand frequency Lecture and Exercise with
systems: Frequency domain and time domain discussion various
domain representation of representation of signal mathematical
discrete time signals and and Fourier transform of problems.
systems, Fourier the digital signal.
transform of discrete time
signals, properties of
discrete time, Fourier
transform.

111
5 The Z-transform: Determine the Z- Lecture and problem Class Test 1(topics
Definition, properties of transform of DT signal solving on z- of the week’s 1-4)
the region of convergence and specify ROC, using transform
for the Z-transform, Z- Z-transform properties to

transform properties. solve such problems

efficiently.
6 The Z-transform: Invert Z-transform by Lecture and Answer basic
Inverse Z-transform using power-series expansion, discussion with questions, quizzes,
contour integration, table-lookup, and/or PFE. problems about Homework, exams.
complex convolution different invert z-
theorem, Parseval‘s, transform methods.
unilateral Z-transform,
stability interpretation
using Jury‘s array.
7 Transform analysis of Identify LTI system Lecture and Answer basic
LTI system & structures properties from system discussion about questions, quizzes,
for discrete-time system: function / pole-zero plot Linear Time Homework (word
Frequency response of (transient/steady-state Invariant system. size expansion,
LTI system, relationship response, causality, memory location
between magnitude & stability). expansion), exams.
phase, all pass systems,
minimum phase system.
Linear system with
generalized linear phase.
8 Transform analysis of Understand different types Lecture and Answer basic
LTI system & structures of IIR filter structures and discussion and questions, quizzes,
for discrete-time system: their implementations graphical Homework, exams.
Block diagram (such as direct form I, representation of
representation & signal direct form II, cascade of different LTI
flow graph representation second order systems, system.
of Linear constant. parallel form
Coefficient difference implementations, etc.).
equations, Basic
structures for IIR systems,
transposed forms, basic
network structures for
FIR systems, lattice
structures.
9 Filter design Design IIR filters by Lecture and Class Test 2(topics
Techniques: Design of bilinear transformation of discussion with of the weeks5-8)
discrete time IIR filters analog filters, problems. IIR filter
from continuous time
filters, frequency
transformations of low
pass IIR filters.
10 Filter design Design FIR filters using Lecture and Answer basic
Techniques: Design of window method or discussion with questions, quizzes,
FIR filters by windowing, Hamming method. problems. FIR filter Homework, exams.
FIR filter design by with windowing
Kaiser window method. technique.
Frequency sampling
method.
112
 11 Discrete Fourier Find Discrete Fourier Lecture and Quizzes,
Transform: Discrete transform of digital discussion with Homework, exams.
Fourier series, properties signals. problems.
of discrete Fourier series,
Discrete Fourier
transform, properties of
DFT, circular convolution

using discrete Fourier

transform.
C1o2ur sD
e iCscordet:eCSTE 310F4o,uCrioeurrseFTinitdleF:aDstigFiotaulriSeirgnal Proce Ls iencgtuLreaba n, d2 Hours/W eC k,l a1ssCT
r edsitts3,(T
t optiacls
Mark sT1r0a0ns(fColramss:AtD on10 ,tIrnatnesrfnoarlmEvoaf lduiagtitoanl/Observ atdioisncu=s7si0o,nFw
teencdiamnactei= i niathl Viva-v oocfet=he2 0w),eYe k 9r-13,2 )
esa
Term i1n time FFT algorithm, signals for difference problems.
decimation in frequency sequence of input signals.
FFT, FFT of long
sequences using overlap
add and overlap save
method.
13 Digital signal processor design a real-time signal Lecture and Exercise the
architectures: Evolution processing algorithm discussion on DSP answering methods
of DSP architecture, using the latest fixed-point architectures. in final exam.
different architectures, processor.
important architectural
elements of a DSP,
instruction set and special
instructions, Introduction
to interfacing DSPs.

Recommended Books:
1. Digital Signal Processing by J.G. Proakis, Prentice-Hall.
2. Understanding Digital Signal Processing by R. G. Lyon, Orling Kindersley.
3. Digital Signal Processing by Defatta, Wiley.

113
COURSE CODE: CSTE 3104, COURSE TITLE: DIGITAL SIGNAL PROCESSING LAB

Rationale:The course deals with the concept of digital signal, systems and its applications, and also about
the different operations on digital signals and digital filter design.
Course Objectives:
➢ To develop the knowledge on signals used in digital signal processing.
➢ To introduce signals, systems, time and frequency domain concepts and the associated
mathematical tools those are fundamental to all DSP techniques.
➢ To provide a thorough understanding and working knowledge of design, implementation, analysis
and comparison of digital filters for processing of discrete time signals.
➢ To study various sampling techniques and different types of filters and will also understand basic
principles of Estimation Theory.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, MATLAB, DSP
Kit.
Lesson Plan (as per week):
Course Outcome (at Teaching Assessment
Contents the end of the Learning Strategy Strategy
lesson, (activities directed (How they are
Week

student should to achieve developed)

be able to) outcomes)
1-2 Write a program in MATLAB to generate Generate the Lecture and -Home task
the following waveforms (DT and CT basic DT and discussion on -Quiz
signal)- CT signal and digital signals
i) Unit Impulse sequence/signal perform basic
ii) Unit step sequence/signal operations on
iii) Unit Ramp sequence/signal DT signals.
iv) Sinusoidal sequence/signal
v) Exponential sequence/signal
vi) Random sequence/signal

Write a program in MATLAB to study the

basic operations on the Discrete – time
signals. (Operation on dependent variable
(amplitude manipulation) and Operation on
independent variable (time manipulation)).
3 Write a program in MATLAB to check for Check digital Lecture and -Home task
linearity, Causality and stability of various system problem discussion -Quiz
systems. properties and about linear
their convolution and
Write a MATLAB Script to perform discrete application. digital systems
convolution (Linear and Circular) for the
given two sequences and also prove by
manual calculation.

114
4-6 Write a MATLAB program to (a) find Z and Find pole- Lecture and Quiz 1 (Topic
inverse Z transform and pole zero plot of Z- zero and Z- problem solving on of the 1-3
transfer function. transform and z-transform and weeks)
(b) Solve the difference equation and find the
different sampling.
system response using Z transform. sampling
operation on
Write a MATLAB Script to perform digital signals.
sampling rate conversion for any given
arbitrary sequence (D.T) or signal (C.T) by
interpolation, decimation, up-sampling,
down-sampling and resampling (i.e.
fractional value).

7-8 Write a MATLAB program to perform the Implement Lecture and Homework
Discrete Fourier Transform (DFT) & inverse Fourier problem solving.
Discrete Fourier Transform for the given transform and
sequences. inverse Fourier
transform
Write a MATLAB Script to compute of
Discrete Fourier Transform and Inverse digital signal
Discrete Fourier Transform of the given
sequence using FFT algorithms (DIT-FFT &
DIF-FFT).
9- Write a MATLAB Script to design a low Design Lecture and problem Quiz 2 (Topic
10 pass FIR filter using Window Method for the FIR and solving on Filter of the 4-8
given specifications IIR filer using designing. weeks)
MATLAB.
Write a MATLAB Script to design
Butterworth low pass filters using Bilinear
Transformation Impulse
Invariant
Transformation
11 Write a MATLAB program to find the Check Practice. Homework.
response of type I, type II, type III, type IV response
FIR filter for a given sequence. of
different FIR
filter for input
sequence.
12 Implement at least one of the following Understand the Discussion and Quiz 3 (Topic
operations using DSP Processor application of application of GSP of the 4-11
i) Linear and Circular convolution. DSP processor. weeks)
ii) Low pass filter an audio signal input to processor for
DSK with FIR filter. different DSP
iii) Low pass filter an audio signal input to operations.
DSK with IIR filter.
iv) To generate sine wave using lookup
table with table values generated within the
program.
13 Final Lab Exam (Job and Viva)

115
COURSE CODE: CSTE 3105, COURSE TITLE: DATABASE MANAGEMENT SYSTEM

Course Code: CSTE 3105, Course Title: Database Management System,3 Hours/Week, 3 Credits, Total
Marks 100 (Attendance=5, Continuous Assessment=25, Final exam=70),Year 3, Term 1

Rationale:This course focuses on the fundamentals of relational database management system and also
provide the background to design, implement, and use database management systems.
Course Objectives:
➢ List and explain the fundamental concepts of a relational database system.
➢ Analyze database requirements and determine the entities involved in the system and their relationship
to one another.
➢ Develop the logical design of the database using data modeling concepts such as entity-relationship
diagrams.
➢ Manipulate a database using SQL.
➢ Formulate, using relational algebra, solutions to a broad range of query problems.
➢ Demonstrate an understanding of normalization theory and apply such knowledge to the normalization
of a database.
➢ Understanding the DBMS Concepts such as: Integrity, security, authentication, transaction,
concurrency, Recovery, distributed database, data mining and warehousing.
➢ Real world database design.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Previous
questions.
Lesson Plan (as per week):
Course Outcome (at the end of the Teaching Learning Assessment
Week

Contents lesson, student should be able Strategy(activities Strategy(How they

to) directed to achieve are developed)
outcomes)

116
1. Drawback of general Basic of Database Lecture and discussion Answer basic
file processing system, Management System with detailed questions, quizzes,
data processing through Understand what a database is, information about the Homework, exams.
COBOL, Basic about different types of course, including the
concepts of the databases, and why they are objectives, course
database system, valuable assets for decision outcomes,
Architecture of a making. examinations. Topic
Database System, Data Explain the basic terminology wise lecture delivery.
structures and of database.
Corresponding Learn data models, basic data-
Operators. The modeling building blocks.
Hierarchical Approach Different types of data model’s
to DBMS: Architecture business rules are and how they
to IMS, IMS data affect database design.
structure, External Identify different types of
Level to IMS, IMS, database users.
Data manipulation, Explain the roles of database
defining PCB, DL/1, administrator.
Operations, Use IMS database.
Construction SSA and Differentiate the IMS DBMS
SSA command codes, approach and capabilities from
The Network Approach traditional master files.
to DBMS: Architecture Describe hierarchical data
to DBTG Systems, structures, database records and
DBTG data structures, the goals for accessing them
Hierarchical and through DL/I
Network Set constructs,
Singular Sets,
Membership Classes
and set selections.
2. Entities and Entity Sets, Entity- Relationship Model Lecture and discussion Exercise with
Relationships and Learn relational model’s basic with some practical various problems.

Relationship Sets, components such as: entities, scenario.

attributes, mapping attributes, and relationships
constraints, keys, entity among entities.
relationship diagrams, Know how entities and their
Reducing E-R diagrams attributes are organized into
to Tables. tables.
Learn about the various types of
keys used in relational
databases.

3 Generalization, Understand how to interpret the Lecture and discussion Answer basic
Aggregation, Design of modeling symbols for the most with problems. questions, quizzes,
an E-R Database popular ER modeling tools. Homework, exams.
Scheme. Explain some advance topic
specialization, generalization
and aggregation.

117
4 Structure of Relational Relational Model Lecture and discussion Answer basic
Databases, the Explain the basic operation of with problems. questions, quizzes,
relational Algebra, The relational algebra. Homework, exams.
Tuple Relational Write queries in relational
Calculus, the domain algebra and tuple relational
Relational Calculus, calculus.
Modifying the
database, Views.
5. SQL, Query-by Relational Commercial Lecture and discussion Class Test 1(topics
Example, QUEL, Languages with problems. of the week’s 1-4)
Summary. Understand the basic operations
of SQL.
Perform join operations in
SQL.
Impose different types of
constraints.
Understand some string
operations.
Write subquery.
Crate function, procedure.
Understand how to use SQL for
data administration (indexes,
views, and roles).
6. Integrity Constraints: Theoretical underpinnings of Lecture and discussion Answer basic
Domain Constraints, the relational database, with problems. questions, quizzes,
Referential Integrity, including concepts like Homework, exams.
Functional functional dependence, entity
Dependencies, integrity, and relational
Assertions, and integrity.
Triggers. Understand dependencies and
Relational Database pitfall in relational database.
Design: Pitfalls in
Relational Database
Design,
7. Normalization using Understand what normalization Lecture and discussion Answer basic
Functional is and what role it plays in the with some practical questions, quizzes,
Dependencies. database design process. scenario. Homework, exams.
Normalization using Understand how normal forms

Multi-valued can be transformed from lower

Dependencies, normal forms to higher normal
Normalization using forms.
Join Dependencies,
Domain – Key Normal
Form, Alternative
Approaches to
Database design.

118
8. Basic Concepts, Indexing and Hashing Lecture and discussion Answer basic
Indexing, B+ Tree Understand the basic concept of with problems. questions, quizzes,
Index Files, B- Index indexing and hashing. Homework, exams.
Files, Static Hash Explain the types of indices.
Functions, Comparison Explain the types of hashing.
of Indexing and Understand the concept of B
Hashing Index and B+ tree indices.
Definition in SQL,
Multiple-Key Access.
9. Query Interpretation, Query Processing: Lecture and discussion Class Test 2(topics
Equivalence of Understand the query with problems. of the weeks5-8)
Expressions, optimization.
Estimation of Query Explain query processing cost.
Processing Cost,
Estimation of Cost of
Access using Indices,
Join Strategies, Join
Strategies for Parallel
Processors, Structure of
a Query Optimizer.
10. Failure Classification, Crash Recovery: Lecture and discussion Answer basic
the storage Hierarchy, Understand the failure with problems. questions, quizzes,
Transaction Model, classification. Homework, exams.
Log Based Recovery, Implement log based recovery.
Buffer Management, Understand different types of
Checkpoints, Shadow recovery strategies.
Paging, failure With
Loss of non-volatile
Storage, Stable Storage
Implementation.
11. Schedules, Testing of Concurrency Control: Lecture and discussion Quizzes,
Serialization, Lock – Understand the basic concept of with problems. Homework, exams.
based Protocols, Time transaction and properties of
Stamp Based Protocols, transaction.
Validation Techniques, Understand concurrent
Multiple Granularity, execution of transaction.
Multi-version Schemes,
Insert and Delete
Operations.
12. Centralized Systems, Database System Lecture on design and Class Test 3(topics
Client/Server Systems, Architectures and Distributed applications of the of the weeks9-12)
Parallel systems, Databases: circuits.
Distributed data Explain centralized system,
storage, Network client-server system, parallel
transparency, system, and distributed query
Distributed query processing.

119
 processing, Distributed Understand deadlock.
transaction model, Explain deadlock detection,
Commit Protocols, prevention and recovery.
Concurrency controls,
Deadlock handling,
Multidatabase Systems.
13. Decision-Support Data Warehousing and Lecture and discussion Exercise the
Systems, Data Mining on miscellaneous answering methods
Warehousing, Data Understand the basic concept of topics. in final exam.
Mining, Classification, data mining and warehousing.
Association Rules, Explain the classification and
Other Types of association rules.
Associations,
Clustering and Other
Forms of Data Mining.

Recommended Books:
1. Data base system Concepts, A. Silberschatz, [Link], 4th Edition, Mcgraw-Hill
2. Principles of Database Systems, Jeffrey D. Ullman, 2nd Edition, Galgotia Publishing.
3. An Introduction To Database Systems, [Link], 7th Edition, Pearson Education.
4. Database Systems –Design, Implementation & Management 4th Edition, By Rob. Coronel, Thomson
CourseTechnology

COURSE CODE: CSTE 3106, COURSE TITLE: DATABASE MANAGEMENT SYSTEM LAB

Course Code: CSTE 3106, Course Title: Database Management System Lab, 3 Hours/Week, 1.5
Credits, Total Marks 100 (Class Attendance=10, Internal Evaluation/Observation = 70, Final Viva-voce
=20), Year 3, Term 1
Rationale:This course focuses on the transformation of business requirements into an operational
database.
Course Objectives:
➢ Analyze database requirements and determine the entities involved in the system and their
relationship to one another.
➢ Manipulate a database using SQL.
➢ Formulate, using relational algebra, solutions to a broad range of query problems.
➢ Implement Integrity, security, authentication, transaction, concurrency, Recovery.
➢ Real world database implementation.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Previous
questions.
Lesson Plan (as per week):
120
 Course Teaching Learning Assessment
Contents Strategy Strategy

Week
(activities directed to (How they are
achieve outcomes) developed)
1-2 Relational Create SQL INSERT, Discussion and Answer basic
Commercial UPDATE and DELETE practice questions, quizzes,
Languages: statements to make changes to Homework,
Introduction to SQL, data exams.
Relational Database Create SQL SELECT
Management System. statements that retrieve any
Writing Basic SQL required data
statements, Capabilities Process data with row and
of SQL SELECT aggregate functions
Statements, Restricting

and sorting data.

Single-Row-Functions,
Displaying Data from
multiple tables,
aggregating data using
group functions.
3-4 Sub queries, Multiple Manipulate data to modify and Discussion and Answer basic
Column Sub queries, summaries results for reporting practice. questions, quizzes,
Producing Readable Homework,
output with SQL *Plus. exams.
Manipulating Data, Quiz 1 (Topic of
Creating and Managing the 1-2 weeks)
Tables including
constraints.
5-6 Other Database Set privilege of using data. Lecture and discussion Exercise with
Objects, Controlling with problems. problems.
User Access.
SQL Workshop.
7-8 Oracle PL/SQL Discussion and Answer basic
Oracle: Object Create programmed solutions practice questions, quizzes,
Relational Database using the PL/SQL procedural Homework,
Management System, language. exams.
SQL statements, about
PL/SQL and its
environments.
Declaring Variables,
writing Executable
Statements.
9- Interacting with the Lecture, discussion Answer basic
10 Oracle Server, Writing Understand Conditional with problems and questions, quizzes,
Control Structures. selection statements, loop practice. Homework,
Working with statements and sequential exams.
Composite Data types. control statements. Quiz 2 (Topic of
Writing Explicit Create cursors. the 3-8 weeks)
Cursors, Advanced
Explicit Cursors
Concepts.
121
11- Create view, Apply views to break down Discussion and Answer basic
12 procedures and problems and enhance security practice questions, quizzes,
functions. Write procedures and functions. Homework,
Handling Exceptions. Handle exception. exams.
Quiz 3 (Topic of
the 9-10 weeks)
13 Final Lab Exam (Job and Viva)

122
 COURSE CODE: CSTE 3107, COURSE TITLE: OPERATING SYSTEM & SYSTEM
PROGRAMMING

Course Code: CSTE 3107, Course Title: Operating System & System Programming, 3 Hours/Week,

3 Credits, Total Marks 100 (Attendance=5, Continuous Assessment=25, Final exam=70),Year 3, Term
1
Rationale: This course has been designed to develop the students’ ability to realize the Operating
system and its functionalities.
Course Objectives:
➢ Identify and describe functions and facilities of operating systems and fundamental operating system
abstractions.
➢ Select and justify recommending an operating system for a specified application and system
configuration.
➢ Evaluate the design and performance of algorithms used in major components of operating systems,
such as scheduler, memory manager, concurrency control manager and mass-storage manager, I/O
manager.
➢ Investigate operating system administrative functions based on a commonly available operating
system.
➢ Design and develop system program to implement operating system functions using system service
calls.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, Slides, PDF books, e-Tutorials,
Question bank, Previous questions.
Lesson Plan (as per week):
Course Outcome (at the end of the lesson, Teaching Learning Assessment
Week

Contents student should be able to) Strategy(activities Strategy(How

directed to achieve they are
outcomes) developed)
1 Introduction to Identify many types of computing Lecture and discussion Answer basic
operating environments, OS services, structures with some basic questions using
system, and major components. questions on the role of practical
operating system Differentiate between user level and operating system in examples on
structures, system level functions of OS. computer system. operating
services, user Explain the various ways of Demonstrate various systems from the
interface, and Structuring an operating system. OS structures with real user viewpoint.
system calls. Explore several open- source life examples.
operating systems.
2 Process Describe various features of Lecture and discussion. 1) Solve given
scheduling, processes, including scheduling, Provide sample exercise
operations on creation and termination, and problems and engage problems and
processes, IPC, communication. students while making submit
Threading, Explain different process scheduling solutions. assignment.
Scheduling algorithms and their pros and cons. Provide exercise 2) Participate in
criteria, Differentiate between the notion of a problems as the quiz
scheduling process and thread and describe assignment. 3) Implementing
algorithms. various types of multithreading Arrange quizzes. process
models. Conduct lab class scheduling
Evaluate the performance of various session on processes. algorithms by
scheduling algorithms. writing computer
programs

123
3 Process Introduce the critical- section Lecture and discussion Solve given
coordination, problem, whose solutions can be with examples on the exercise
synchronization, used to ensure the consistency of topic. problems and
critical section shared data Provide exercise submit
problem, Present both software and hardware problems as assignment.
semaphores. solutions of the critical-section assignment.
problem Conduct lab class
Examine several classical process- session on processes.
Synchronization problems
Explore several tools that are used to
solve process synchronization
problems
5 Deadlock Identify deadlock situation by Lecture and discussion Answer basic
characterization, checking conditions with examples on the questions on the
Methods for Select a deadlock handling method topic topic
handling from a number of different methods Provide exercise Solve exercise
deadlocks, for a specific scenario. problems Do lab tasks and
Deadlock Identify safe state and apply deadlock submit lab report
prevention, avoidance algorithm for sample data on the topic
avoidance and set.
detection.
6 Memory Identify various ways of organizing Lecture and discussion Answer basic
management memory hardware with examples on the questions on the
strategy, Explain memory-management topic topic
swapping, techniques, including paging and Arrange pop-up Discuss among
paging, segmentation quizzes. them on the topic
segmentation. Participate in the
quiz
7 Virtual memory Describe benefits of a virtual Lecture and discussion Answer basic
management, memory system with examples on the questions on the
demand paging Explain the concepts of demand topic topic
and page paging, page- replacement Arrange pop-up Discuss among
replacement. algorithms, and allocation of page quizzes. them on the topic
frames Participate in the
Examine the relationship between quiz
shared memory and memory-
mapped files.
Explore how kernel memory is
managed.
8 File systems, Explain the function of file systems Lecture and discussion Answer basic
access methods, Describe the interfaces to file with examples on the questions on the
file system systems topic topic
mounting. Discuss file-system design tradeoffs, Conduct lab session on Discuss among
including access methods, file the topic them on the topic
sharing, file locking, and directory Submit lab report
structures on the topic
Explore file-system protection

124
 9 Disk structure, Describe the physical structure of Lecture and discussion Answer basic
Disk scheduling, secondary storage devices and its with examples on the questions on the
RAID structure. effects on the uses of the devices topic topic
Explain the performance Arrange pop-up Discuss among
characteristics of mass- storage quizzes. them on the topic
devices Participate in the
Evaluate disk scheduling algorithms quiz

Discuss operating- system services

provided for mass
storage, including RAID
11 I/O System, I/O Explore the structure of an operating Lecture and discussion Answer basic
hardware, system’s I/O subsystem with examples on the questions on the
application I/O Discuss the principles of I/O topic topic
Interface, hardware and its complexity Arrange pop-up Discuss among
Transforming Explain the performance aspects of quizzes. them on the topic
I/O requests to I/O hardware and software Participate in the
Hardware quiz
Operations.
12 System Security, Explore the structure of an operating Lecture and discussion Answer basic
System and system’s I/O subsystem with examples on the questions on the
Network Discuss the principles of I/O topic topic
Threats, hardware and its complexity Arrange pop-up Discuss among
Cryptography as Explain the performance aspects of quizzes. them on the topic
a security tool, I/O hardware and software Participate in the
user quiz
authentication.
13 System Security, Discuss the goals and principles of Answer basic questions Answer basic
System and protection and security threats and on the topic questions on the
Network attacks in a modern computer system Discuss among them topic
Threats, Explain how protection domains on the topic Discuss among
Cryptography as combined with an access matrix are Participate in the quiz them on the topic
a security tool, used to specify the resources a Participate in the
user process may access quiz
authentication. Examine capability and language-
based protection systems
Explain the fundamentals of
encryption, authentication, and
hashing and the uses of cryptography
in computing
Describe the various
countermeasures to security attacks

Recommended Books:
11. Operating System Concepts, 9th edition by Silberschatz, Galvin, Gagne.
12. Modern Operating Systems (3rd Edition): Andrew S. Tanenbaum

125
 COURSE CODE: CSTE 3108, COURSE TITLE: OPERATING SYSTEM & SYSTEM
PROGRAMMING LAB

Course Code: CSTE 3108, Course Title: Operating System & System Programming Lab, 3
Hours/Week, 3 Credits, Total Marks 100 (Class Attendance =10, Internal Evaluation/Observation = 70,
Final Viva-voce = 20), Year 3, Term 1
Rationale: This course has been designed to develop the students’ ability to realize the Operating
system and its functionalities by doing lab task properly.
Course Objectives:
➢ Identify and describe functions and facilities of operating systems and fundamental operating
system abstractions
➢ Select and justify recommending an operating system for a specified application and system

configuration
➢ Evaluate the design and performance of algorithms used in major components of operating systems,
such as scheduler, memory manager, concurrency control manager and mass-storage manager, I/O
manager
➢ Investigate operating system administrative functions based on a commonly available operating
system
➢ Design and develop system program to implement operating system functions using system service
calls.
Resources Used: Computer with Linux/Unix environment, Multimedia, Whiteboard, Marker,
Handouts, Slides, PDF books.
Lesson Plan (as per week):
Course Outcome (at the end of the Teaching Learning Assessment
Week

Contents lesson, student should be able Strategy(activities Strategy(How

to) directed to achieve they are
outcomes) developed)
1-2 Introduction to Linux- Install Linux OS Lecture in the lab a. Install Linux
Linux Installation, Work with some Shell class with b. Use Shell
Introduction to Shell, Commands demonstration commands
Creating user account- Manage user account c. Solve
1.5hrs. Exercise
3-4 Course Project To form a team and select a a. Form a
discussion and group project Project discussion project team
formation – list of with demonstration of b. Select a
projects, team sample project project and
formation, project plan prepare a plan
and deliverables with
presentation – 1.5hrs
5-6 Introduction to Linux Work with Linux files and a. Lecture in the lab a. Use Linux
tools- Linux files, directories class with tools with
Directories, Root, File demonstration commands
Permissions, Working b. Providing simple b. Work with
with files and lab tasks based on the file and
directories, Disk related demonstration directory
commands- operations
1.5hrs. c. Do lab task
126
 d. Solve
Exercise
7-8 Essential Linux Customize Linux environment Lecture in the lab Do lab task.
commands and Working using commands. class with Solve Exercise
with editors- 2.5hrs. Identify types of editors and demonstration of Present the
Present the concept of modes of operation. customizing and concept of the
the project in a team – Edit single and multiple files editing session. project
30mins with command line options. Providing simple lab (Presentation 1)
Plan work for the project and tasks based on the
present the concept demonstration.
Arrange team
presentation.
9 Processes in Linux, Work with process related Lecture in the class Implement
Process Scheduler, commands. with demonstration of Process
Deadlock avoidance– Write computer programs for process related Scheduling
3hrs various scheduling algorithms. commands and Algorithms
Write programs for algorithms
deadlock avoidance algorithm.

10 Introduction to Shell Create simple Shell script Demonstration of Do lab task

Scripts- Shell Debug and process scripts Shell Scripting Solve Exercise
programming, Shell b. Providing simple
Variables, Shell lab tasks based on the
Keywords, Write simple demonstration
Shell program- 1.5hrs.
11 Decision making and Write Shell programs related Demonstration of Do lab task
Loop control structure- with decision making and loop Shell Scripting Solve Exercise
1.5hrs. control structure. Providing simple lab
tasks based on the
demonstration
12 Shell Administration- To be able to work as an a. Demonstration of a. Do lab task
Adding and removing administrator administrative Solve Exercise
users, commands
Daily administrative b. Providing simple
works, File lab tasks based on the
management. Disk demonstration
management,
Monitoring system and
Ensuring system
security
13 Final Team Project a. To develop a project through Arrange and guide Present the team
knowledge acquired team presentation on project
the project

127
COURSE CODE: CSTE 3109, COURSE TITLE:MICROPROCESSOR, MICROCONTROLLER AND
INTERFACING

Course Code: CSTE 3109, Course Title:Microprocessor, Microcontroller and Interfacing, 3

Hours/Week, 3 Credits, Total Marks 100 (Attendance=5, Continuous Assessment=25, Final exam=70),
Year 3, Term 1
Rationale: This course has been designed for the students to introduce microprocessor architecture,
instruction sets, assembly language programming and discussed the design of systems based on
microprocessors and microcontrollers.
Course Objectives:
➢ Students to become familiar with the architecture and the instruction sets and addressing modes of
an Intel 8086 microprocessor.
➢ Assembly language programming will be studied as well as the design of various types of digital
and analog interfaces.
➢ Ability to interface various devices to the microprocessor.
➢ Skill to understand microcontroller architecture, addressing mode and instruction sets
➢ Familiar with various programmable interfacing devices.
➢ Develop various interfacing techniques using assembly language programming.

Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Device manual,
Question bank, Previous questions.
Lesson Plan (as per week):
Course Outcome (at the end of the Teaching Learning Assessment
Week

Contents lesson, student should be able Strategy(activities Strategy(How

to) directed to achieve they are
outcomes) developed)
1 Evolution of Microprocessor Overall discussion with Answer basic
microprocessor, Fundamentals and the students must be questions,
architecture of a Architecture. needed about the course group
microprocessor, Data To learn the basic concepts contents including the discussion,
bus, address bus, control on microprocessor objectives, course assignments.
bus, I/O units, and architecture, data buses, I/O outcomes, examinations,
memory, architecture of units and memory. physical environment and
Intel 8086 To understand the Intel 8086 methodology.
Microprocessor, its Microprocessor, its An interactive
execution unit, and bus- execution unit, and bus- demonstration must be
interface unit, its interface unit, its registers needed to teach the
registers and flags. and flags. microprocessor
architecture and its related
functional parts in
classroom.

128
2 Programming model of Programming Model. Delivering lecture and Problems
8086 processor, To understand the segment- overall discussion with the must be
segment-offset address offset address students must be needed solved
and physical address To calculate any physical on several topics of correctly in
calculations, even and address of memory location. programming model of classroom.
odd addressing, the To comprehend the all types 8086 processor Home works
introduction of different of addressing modes, its PA interactively in classroom. and
addressing modes, calculations and memory Several examples of assignments
Operating systems and organization. addressing modes will be must be
BIOS, Memory solved in classroom. submitted
organization of PC. regularly.
3 Introduction to IBM PC Assembly Language. Delivering lecture and Exercise with
Assembly Language, To understand assembly overall explanation with various
Assembly Language language instructions, syntax, the students must be programming
syntax, Program Data, variable declaration and step needed about several problems.
Variables, named by step procedures to run a topics of assembly
constants, program program. language
structure, memory programminginteractively
models, Input/output in classroom.
instruction, Running Demonstrate various
program, Program solving techniques to run
Segment Prefix. a program in the
classroom.

129
4 The processor status and Status Register and Flow Demonstrate various Exercise with
the Flag register, Control. techniques to solve the various
overflow condition, To debug a program and design of a program. programming
debugging a program, show the status of all flag Demonstrate flowcharts to problems.
flow control instructions, registers. run a program correctly.
conditional jumps, To understand the algorithms
signed versus unsigned to find out modular
jumps, high-level exponentiation.
language structures, To understand conditional
branching and looping jumps, signed versus
structures. unsigned jumps, high-level
language structures,
branching and looping
structures.
5 Logic, Shift and Rotate Logic Operation. Demonstrate several Class Test
Instruction, some To solve different examples problem-solving 1(topics of the
common applications of on logical operations. techniques to the students week’s 1-4)
Shift and Rotate To run shift and rotate to solve several problems
operations and related instructions based programs. on logical, shift and rotate
examples. instructions in the
classroom.
6 The Stack and Data Structure. Lecture and discussion on Exercise with
Introduction to To understand stack stack operations, various
Procedures, Basic stack operations, procedures procedures declaration, programming
operations, Procedures declaration, communication communication between problems,
Declaration, between procedures and procedures and calling a group
Communication between calling a procedures. procedures. discussion.
procedures, calling a Discuss on sample
procedures. programs using stack
operations.
7 Multiplication and Arithmetic Operation. Lecture and explanation Exercise with
Division Instructions, To solve different problems on arithmetic various
signed versus unsigned using arithmetic terminologies to run programming
multiplications, divide terminologies. related programs. problems,
overflow, Signed home works.
Extension of Dividend.
8 Arrays and related Arrays andString Lecture and discussion on Answer basic
addressing modes, DUP Manipulation. arrays and String related questions,
operator, register indirect To solve different arrays and programs and solve home works.
modes, Based and String related programs. programs in the class
Indexed addressing room.
modes. The string
instructions, director
flag, moving a string,
storing a string, loading a
string, scanning a string,
comparing strings,
substring operation.

130
9 Introduction to Microcontroller. Lecture and explanation Class Test
microcontroller, To know about 8051 on different 2(topics of the
microcontroller microcontroller architecture, microcontroller week’s 5-8)
architecture, addressing addressing mode, instruction terminologies.
mode and instruction sets and different related
sets, introduction to 8051 terminologies.

family architecture, pin

diagram, operation,
ports, addressing modes,
internal & external
memory, SFR, flags,
organization, counters
and timers, serial
communication.
10 Basic description on PPI 8255, Keyboard and Lecture and discussion on Q & A
Programmable Display Interfaces. PPI 8255, Keyboard and session, group
Peripheral Interface To design PPI 8255 and Display Interfaces. discussion,
(8255), block diagram, Keyboard and Display assignments.
ports and operating Interfaces.
modes, programming To solve different
8255, control word, I/O applications using these
port addressing, BSR interfacing devices with
mode,Interface to Read interface programs.
from I/P DIPs and .
Display at O/P LEDs in
mode 0, all interface
circuit and programs,
basics of Keyboard and
Display Interface, 8086
Keyboard Interface.
11 DMA controller (8237), 8237, 8259, 8295. Lecture and explanation Answer basic
data transfer DMA To design DMA, Interrupt on DMA, Interrupt and questions,
mode, block diagram, and Printer controller Printer controller interface presentations,
step in DMA operation, interface devices. devices. Homeworks.
DMA registers and To solve different
modes, Programmable applications using these
Interrupt Controller interfacing devices with
(8259), block diagram, interface programs.
priority modes, control
word initialization,
masking and
prioritization,
programming OCWs,
LRC7040 Printer
Interface to a
Microcomputer using the
8295-printer controller
chip.

131
 12 Programmable Interval 8254, AVR, ARM Lecture and discussion on Class Test
Timer (8254), block Microcontroller. the pros and cons of 8254, 3(topics of the
diagram, control register, To understand the pros and AVR, ARM week’s 9-12)
status register, modes of cons of 8254, AVR, ARM Microcontrollers.
counters with examples Microcontrollers.
and interface programs,
Advanced Virtual RISC
(AVR) Microcontroller,
ARM Microcontroller.
13 Review topics and Final Learn about latest trends and Lecture and discussion on Exercise the
exam preparation. the better answering methods miscellaneous topics. answering
in the final exam. methods in
final exam.

Recommended Books:

1. Assembly Language Programming and Organization of the IBMPC by Ytha Yu and Charles Marut,
McGraw-Hill
2. Microprocessor and Microcomputer based System Design by Rafiquzzaman, CRC Press
3. Microcomputer Systems: 8086/8088 Family by Y. Liu and G. A. Gibson, Prentice-Hall.
4. Microprocessor and Interfacing by Douglas V. Hall, Tata McGraw Hill.

132
COURSE CODE: CSTE 3110, COURSE TITLE:MICROPROCESSOR, MICROCONTROLLER AND
INTERFACING LAB

Course Code: CSTE 3110, Course Title: Microprocessor, Microcontroller and Interfacing
Lab, 2 Hours/Week, 1 Credit, Total Marks 100 (Class Attendance=10, Internal
Evaluation/Observation = 70, Final Viva-voce =20).

Rationale: This Lab course has been designed for the students to introduce and operate the
microprocessor MDE-8086 kit, develop instruction sets and assembly language programming,
design microprocessor and microcontroller-based interfacing devices.

Course Objectives
➢ Students to become operate microprocessor MDE-8086 kit.
➢ Ability for storing and executing of a typical machine code program using the MDE-8086 kit
and to observe the operation in a single step.
➢ Develop various Interface, Interrupt and Serial monitor based experiments by using 8255A
I/O controller and MDE-8086 kit.
➢ Skill to develop various Assembly language programs by using MASM translator in PC.
➢ Skill to design of various interfacing systems based on microprocessors and microcontrollers.

Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Device
manual, Sample interfacing devices and programs.

Lesson Plan (as per week):

Course Outcome (at the end of Teaching Learning Assessment
Content the lesson, student Strategy (activities Strategy
s should be able to) directed to achieve (Ho
Week

outcomes) w they
are
developed)
1 Introduction MDE-8086 kit. An interactive Answer basic
o To independently demonstration must questions, group
n Microprocessor MDE- handle and operate be needed to teach discussion.
8086 kit. microprocessor MDE- different key
8086 kit successfully. functions, addressing,
instructions and
related functional
parts of MDE-8086
kit in
classroom.

133
2-3. Experiments on 8255A 8255A Interface. Delivering lecture and Home works and
Interface: To conduct and perform overall discussion on assignments.
a) 7-segment display machine code program 7-segment display
interface to display the for displaying the interface and LED
hexadecimal character. hexadecimal character interface using 8255A
b) LED interface using the MDE-8086 kit module into MDE-
perfectly. 8086 kit interactively
To design LED interface in classroom.
using MDE-8086 kit. Several machine code
programs will be
solved in classroom.
4-5. Experiments on Interface: Interface. Demonstrate various Exercise with
a) Interfacing a speaker To design instruction solving techniques to various instruction
with microprocessor and to code programs to interface speaker, code programs.
operate on by the program interface speaker, dot display dot matrix
b) Dot matrix LED matrix LED display and LED and control the
displays. speed control of stepper speed of stepper motor
c) Stepper Motor Interface motor by MDE-8086 by MDE-8086 kit in
to control speed. [Link]. the classroom.
6. Experiments on Interrupt. Demonstrate various Lab Test 1(topics
Interrupt: To manage and design techniques to solve of the weeks1-5)
a) Interrupt due to division various Interrupt based various Interrupt based
by zero experiments by using experiments.
b) Interrupt due to overflow 8255A I/O controller and
c) Interrupt due to user MDE-8086 kit.
defined software.
7. Experiments with serial Serial monitor. Delivering lecture and Assignments.
monitor: To design various serial overall discussion to
a) Execution of different monitor based solve various Serial
serial monitor commands experiments by using monitor based
b) Loading and executing 8255A I/O controller and experiments with
assembly language MDE-8086 kit. various instructions
program. and assembly
programming in the
classroom.
8. List of Assembly Assembly Language Lecture and discussion Exercise with
Language based Programs. on related sample various
programs: To develop various programs. programming
a) Write an assembly assembly codes to input, problems, group
language program to read a display a single character discussion.
character from the or multiple characters
keyboard. and also display a single
b) A program to display a line of the message.
single character.
c) A program to display a
line of the message.

134
9. List of Assembly Assembly Language Lecture and Assignments,
Language based Programs. explanation on group discussion.
programs: To develop various program terminologies
a) A program to display a assembly codes to to run related
message using Macro. display multiple line programs.
b) A program to display messages.
more than one message in a To write codes for case
different line. conversion letter.

c) A program to read a
character from the keyboard
and display it next line.
d) Enter a lowercase letter
and display it in uppercase.
e) Enter an uppercase letter
and display it in lowercase.
10. List of Assembly Assembly Language Demonstrate various Answer basic
Language based Programs. techniques to solve questions,
programs: To solve different various arithmetic homeworks.
a) Display program checks arithmetic operations operations and loop
flags. Find and loop related related programs in the
ADD,SUB,NEG, AND programs. class room.
INC of a number using
debug.
b) A program to display
“NSTU” 20 times.
c) A program to display 256
ASCII character/Enter IBM
set character.
d) Write a count-controlled
loop to display a row of 80
stars.
11. List of Assembly Assembly Language Lecture and discussion Lab Test 2
Language based Programs. on procedure and (topics of the
programs: To solve different macro related weeks 8-10)
a) A program to read a programs using programs in the class
character if it’s ‘is ‘x’ Procedure and Macro. room.
display it,
otherwise,terminate the
program.
b) A program to find odd or
even numbers using
Procedure.
c) A program to find odd or
even numbers using Macro.

135
12. List of Assembly Assembly Language Demonstrate various Q & A session,
Language based Programs. techniques to solve group discussion,
programs: To solve different string, various string, arrays final exam
arrays and sort related and sort related preparation.
a) A program to display the programs. programs in the class
string in Reverse order. room.
b) A program to display the
length of a string.
c) A program to the sum of
first 4 numbers.
d) A program to sort 10
numbers in Ascending
order.
e) A program to sort 10
numbers in Descending
order.
13. Final Exam (Job, Viva)

136
COURSE CODE: CSTE 3201, COURSE TITLE: COMPUTER NETWORKING

Course Code: CSTE 3201, Course Title: Computer Networking, 3 Hours/Week, 3 Credits, Total
Marks 100 (Attendance=5, Continuous Assessment=25, Final exam=70),Year 3, Term 2
Rationale: This course has been designed to develop the students’ ability to realize Networking
principles, media, devices, functions of devices, analyses and applications of communication protocols.
Course Objectives:
➢ Make the students familiarize with the internal structure of Networking layers, Protocols,
Application of Protocols, Topologies, device selection depending on medium.
➢ Analyze and apply debugging and testing techniques to locate and resolve errors and to determine the
effectiveness of a network.
➢ Effective use of protocol applications, troubleshooting and network management.

Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Device manual,
Question bank, Previous questions.
Lesson Plan (as per week):
Course Outcome (at the end Teaching Assessment
Contents of the lesson, student Learning Strategy
Week

should be able to) Strategy (How they are

(activities directed developed)
to achieve
outcomes)
1 Introduction: The Use of Computer Realize Network Lecture and Answer basic
Network – Network Hardware, LANs, types, devices, discussion with questions,
WANs, Wireless network, Internetworks, TCP/IP and OSI detailed quizzes,
Network software Protocol Hierarchies, model. information about Homework,
Design issues for Layers, Interfaces and network devices, exams.
services, CO & CL services, service types of networks.
primitives, relationship of services to
protocol,
2 OSI reference model, TCP/IP reference Lecture and Questions
model, Example networks – Novell discussion with about
NetWare, Internet, X.25. characteristics OSI comparison,
model and quizzes,
protocols in Homework,
several network exams.
types- LAN,
MAN, WAN

137
3 The PhysicalLayer:The theoretical basis Describe properties Lecture and Design,
of data communication-Fourier Analysis, and applications of discussion with development,
Bandwidth-limited signals. The communication problems. explanation,
maximum data rate of a channel. media. quizzes,
Transmission Media - twisted pair, Homework,
Baseband Coaxial Cable, Broadband exams.
coaxial cable, fiber optics. The line of
Sight transmission, Communication
satellites. Analog Transmission, tree
Telephone system, Modems, RS – 232 &
RS – 449.
4 The medium Access Sublayer: Local Apply media access Lecture and Exercise with
and Metropolitan Area’s Networks Static control and standards discussion with various
Channel allocation in LAN’s and MAN’s of them. problems in problems in
Dynamic channel allocation in LAN’s multiple access media access.
and MAN’s Network Protocols-persistent control.
and Non-Persistent CSMA, CSMA with
collision detection, BRAP-broadcast
recognition with alternating priorities.
MLMA-the multilevel multi-access
Multi-access protocol, binary countdown.
Limited Contention Protocol – The
adaptive tree walk protocol. IEEE
standard 802 for local area network –
IEEE standard 802.3 and Ethernet, IEEE
standard 802.5 token buses, IEEE
standard 802.5 token, ring, comparison of
local area networks, FDDI, Wireless
LAN – 802.11.

5 The Data Link Layer: data link layer Error control, flow Lecture and Class Test
issues-services provided to the network control and discussion on 1(topics of the
Layer, Framing Error Control, Flow management of data various types of week’s 1-4)
control, Link Management, error communication. link management
detection and Correction-Error-
Correcting Codes, error-detecting codes.
6 Elementary data link protocols – An Lecture and Performance
Unrestricted simplex, Protocol, A simple discussion with analysis of
Stop and wait for protocol, A simplex problems in error flow control
protocol for a noisy channel, sliding control, flow protocols,
window protocols – A one-bit sliding control quizzes,
window protocol, A protocol using Go Homework,
back N, A protocol using selective repeat exams.
Protocol performance – performance of
the stop and wait for protocol. The
performance of the sliding window
protocol. An example of the data link
layer – the data layer in public networks
– the data link layer on the Internet.

138
 7 The Network layer: Network Layer IP distribution and Lecture on design Assignment
design issues – services provided to the network management. and applications of on IP
transport layer, an Internal organization IP addresses. IP distribution of
of the network layer, distribution, an ISP
address block, sub-
netting, super-
netting, subnet
mask, Broadcast
and network
addresses.
8 Routing, Congestion, Internetworking, Lecture on Presentations,
Routing Algorithms, performance of quizzes,
router Homework,
exams
9 Congestion – Control algorithms, Pre- Congestion control, Lecture and Class Test
allocation of buffers. Packet discarding, flow control. discussion about 2(topics of the
Congestion Control, flow control, Choke congestion control weeks5-8)
packets, deadlocks. Examples of the
network layer – the network layer in
public networks, the network layer on
Internet (IP).
10 The Transport Layer: Transport layer Process to process Lecture on services Explanation,
design issues-services provided to the data delivery in port. of transport layer quizzes,
session layer, quality of services, the OSI Homework,
transport service primitives, transport exams.
protocol, elements of transport protocols,
11 addressing, establishing a connection, Lecture on Explanation,
releasing connection flow control & Transmission quizzes,
buffering, multiplexing, crash recovery, Control Protocol Homework,
examples of the transport layer, TCP, User exams.
Transmission Control Protocol TCP). Datagram Protocol
12 The presentation Layer: Presentation Network security and Lecture on security Class Test
layer design issues-Data representation, privacy. issues and 3(topics of the
Text Compression, Network security and applications of weeks9-12)
privacy. The OSI presentation, Service them.

primitives, Substitution Ciphers,

Transposition Ciphers, Public key
Encryption, Secrecy and Digital
Signature with Public Key encryption.
13 Review topics and Final exam Learn about latest Lecture and Exercise the
preparation. trends and the better discussion on answering
answering methods in miscellaneous methods in
the final exam. topics. final exam.

Recommended Books:
1. Data Communications and Networking by Behrouz A. Forouzan, McGraw-Hill.
2. Computer Networks by Andrew S. Tanenbaum, Prentice Hall.
3. TCP/IP Protocol Suite by Behrouz A. Forouzan, McGraw-Hill.

139
 COURSE CODE: CSTE 3202, COURSE TITLE: COMPUTER NETWORKS LAB

Course Code: CSTE 3202, Course Title: Computer Networks Lab, 2 Hours/Week, 1 Credit,
Total Marks 100 (Class Attendance=10, Internal Evaluation/Observation = 70, Final Viva-voce
=20),Year 3,
Term 2
Rationale: This course has been designed to develop the students’ ability to realize
Networking principles, media, devices, functions of devices, analyses and applications of
communication
protocols. Server (email server, web server) setup and maintenance.
Course Objectives:
➢ Make the students familiarize with the internal structure of Networking layers, Protocols,
Application of Protocols, Topologies, device selection depending on medium.
➢ Analyze and apply debugging and testing techniques to locate and resolve errors and to
determine the effectiveness of a network.
➢ Effective use of protocol applications, troubleshooting and network management.
➢ DNS, FTP, NFS, email server, web server setup and maintenance.

Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Hand
books-manual,Previous questions, LAN, Internet.

Lesson Plan (as per week):

Course Outcome (at the Teaching Assessment
Content end of the lesson, Learnin Strategy
s student should be g Strategy (How they are
Week

able to) (activities directed to developed)

achieve outcomes)

1 The Use of Computer Network – Realize Network Discussion with Answer basic
Network Hardware, OSI model. types, devices, Hands on questions,
TCP/IP and OSI manual quizzes.
model.

2 Installation of a virtual machine Demonstration Do.

wit
h [Link]
and
bootable pen
drive with
rhel6
3 Network setup with appropriate IP Ensure and Do.
of real host and guest machine. testing
ping, communication

140
 traceroute, arp, learning remote login between computers.
using telnet session, ssh. Study of
Network IP. TTL, ICMP
4 FTP, vsftpd configuration, NFS File sharing and Demonstration with Do.
browsing FTP
5 IP forwarding, dig, nslookup Class Test
1(topics of the
week’s 1-4)
6 Web server in Redhat OS, httpd Web server setup Hands on instruction Answer basic
configuration questions,
quizzes.
7 Email server setup in Redhat OS. Email server Hands on instruction Do.
8 User add, user delete, recreate user Email ID creation Hands on instruction Do.
name
9 Manual using for instruction Demonstration Class Test
2(topics of the
weeks5-8)
10 DNS Domain Name Hands on instruction Answer basic
System setup questions,
quizzes.
11 DHCP server DHCP Server setup Hands on instruction Do.
12 yum server installation Easy installation Demonstration Class Test
practice by yum 3(topics of the
server week’s9-11)
13 Final Lab Exam (Job and Viva)

COURSE CODE: CSTE 3203, COURSE TITLE: MICROWAVE AND SATELLITE

COMMUNICATION

Course Code: CSTE 3203, Course Title: Microwave and Satellite Communication, 3 Hours/Week, 3
Credits, Total Marks 100 (Attendance=5, Continuous Assessment=25, Final exam=70), Year 3, Term 2
Rationale: This course has been designed to cover the most relevant aspects of microwave & satellite
communications, with emphasis on the most recent applications and developments.
Course Objectives:
➢ To understand Radio communication in general and also the special aspects that relate to
microwave and satellite communications.
➢ To discuss the use of microwave radio systems in communications highlighting the design,
deployment and operational challenges of microwave radio communications
➢ To provide an in-depth understanding of different concepts used in a satellite communication
system.
➢ To give a thorough understanding of satellite systems including topics of orbits and constellations,
satellite space segment, and propagation and satellite links; baseband communications techniques
for satellites including modulation, coding, multiple access and on-board processing as well as the
applications of various satellite communications systems.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Device manual,
Question bank, Previous questions.
Lesson Plan (as per week):

141
 Course Outcome (at the end Teaching Learning Assessment
Contents of the lesson, student Strategy (activities Strategy
should be able to) directed to achieve (How they
Week outcomes) are
developed)
1. Microwave Communication: CCIR Understand the Lecture and Answer basic
recommendation on frequency fundamental concepts discussion with questions,
assignment; comparison with radio of microwave detailed information quizzes,
communication in another frequency communication. about the course, Homework,
band. including the exams.
objectives, course
outcomes,
examinations, topic
wise lecture
delivery.
2. Microwave Link: Microwave link and Understand the details Lecture and Answer basic
its advantage, Frequency assignment, concept of microwave discussion with questions,
modulation methods, Transmitting and signal transmission. details concept of quizzes,
receiving equipment, Baseband microwave Homework,
repeater, IF repeater, Microwave transmission exams.
carrier supply, Auxiliary channels
3. Microwave Antenna: Hertzian and Design microwave Lecture and Answer basic
half wave dipoles. Monopole, horn, antenna for
discussion on brief questions,
rhombic and parabolic reflector, array, microwave signal
outline and quizzes,
and Yagi-Uda antenna. transmission. choosing of Homework,
microwave antenna exams.
for long haul and
short haul.
4. Microwave transmission lines: Design impedance Lecture and Exercise with
Introduction to transmission lines, matching network for discussion on how various
waveguides, strip-lines, microstrip any transmission line the microwave mathematical
lines, fin-lines, inverted-striplines. or system. signal reach it problems.
Reflection coefficient, Transmission exactly by find out
coefficient, VSWR, Impedance the components of
transformation in RF lossless lines. transmission line.
Impedance measurement.
5. Microwave Components: Microwave Identify the use of Lecture and Class Test
hybrid circuits, scattering parameters, microwave discussion on 1(topics of
Waveguide Tees, Directional couplers, components and various type of the week’s 1-
Circulators and Isolators, Phase shifter devices in microwave microwave 4)
and attenuator. applications components.
6. Microwave Devices: Microwave Lecture and Answer basic
transistors; varacter diode, IMPATT discussion on how questions,
diode, Gunn Diode, Schottky Barrier the microwave quizzes,
diode; a backward diode; point contact devices work Homework,
diode. properly and why exams.
need these devices.

142
7. Microwave Devices: Klystron; Reflex Lecture and Answer basic
Klystron, TWT, Backward Wave discussion on how questions,
Oscillator (BWO), Microwave filters, the microwave quizzes,
planer microwave elements (directional devices work Homework
copular, circulators) and Magnetron. properly and why exams.
need these devices.
8. Applications of Microwave: Radar Discriminate different Lecture and Answer basic
systems - Pulsed radar, MTI, Radars, find discussion with questions,
Tracking radars, Altimeter- applications and use various types of quizzes,
Principles of operation, applications. of its radar and its Homework,
supporting applications. exams.
systems.
9. Satellite Communication: Explain the basics of Lecture and Class Test
Introduction: Origin of Satellite satellite discussion 2(topics of
communication. The current state of communication. wit the week’s 5-
Satellite Communication. An orbital h fundamental 8)
aspect of satellite communication: concepts of satellite
Orbital mechanism, the equation of communication.
orbit, locating satellite in orbit,
orbital elements, orbital
perturbation.
10 Space craft subsystem: -Altitude and Explain and analyzes Lecture and Answer basic
. orbit control system, Telemetry link budget of discussion on the questions,
tracking and command power satellite signal for design of satellite quizzes,
system, communication subsystem. proper link budget and Homework,
Satellite link design: System noise communication and different types of exams.
temperature and G/T ratio, different types of subsystem which is
downlink design, domestic satellite subsystem. very important for
system, uplink design, the design of controlling.
satellite link for
specified (C/N).
11 Fundamentals of Software Defined Understand the Lecture and Quizzes,
. Radio: Baseband Technology, fundamental concepts discussion on the Homework,
Emergence of Software Defined of software defined importance exams.
Radio, Evolution of Software radio. of
Defined Radio, software defined
Baseband requirements. radio
12 Multiple access techniques: - FDMA, Understand working Lecture and Class Test
. FDM/FM/FDMA, effects of principle of multiple discussion on 3(topics of
intermodulation, access technique and satellite Multiple the week’s 9-
commanded analyze its Access 12)
FDM/FM/FDMA. TDMA, TDMA performance for (M
frame structure and design, TDMA satellite A) techniques which
synchronization and timing, code communication. is interconnect
division multiple access, SS ground stations
transmission and reception through
applicability of CDMA to a multiple satellite
commercial system, multiple access transponders with
onboard processing, SCPS system, the goal of
digital speech interpolation system, optimizing several
DAMA. system attributes.
13 Review topics and Final Learn about latest Lecture and Exercise
. exam preparation. trends and the better discussion on the

143
 answering methods in miscellaneous answering
the final exam. topics. methods

in
final exam.
Recommended Books:
1. Advanced Electronic Communication Systems by Wayne Tomasi, Prentice Hall.
2. Foundations for Microwave Engineering by R. E. Collin, McGraw Hill.
3. Satellite Communications by Dennis Roddy, McGraw Hill.
4. Microwave devices and Circuits by S. Y. Lao, Prentice Hall

144
 COURSE CODE: CSTE 3204, COURSE TITLE: MICROWAVE AND SATELLITE
COMMUNICATION LAB
Course Code: CSTE 3204, Course Title: Microwave and Satellite Communication Lab, 2
Hours/Week, 1 Credits, Total Marks 100 (Class Attendance=10, Internal Evaluation/Observation = 70,
Final Viva-voce =20),Year 3, Term 2
Rationale: This course is designed to acquire skills in measuring, designing by conducting and
simulating experiments related to microwave communication, microwave devices/components,
microwave antenna and satellite communication.
Course Objectives:
➢ Provide hands-on experience to the students so that they are able to puttheoretical concepts to
practice.
➢ Acquire teamwork skills for working effectively in groups.
➢ Develop technical writing skills important for effective communication.
➢ Familiarize with basic microwave measurements.
➢ Characterize microwave and microwave components/devices bymeasuring important parameters.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Device manual,
Question bank, Previous questions.
Lesson Plan (as per week):
Course Outcome (at the end Teaching Learning Assessment
Contents of the lesson, student Strategy(activities Strategy(Ho
Week

should be able to) directed to achieve w they are

outcomes) developed)
1. To familiar with different equipment gain significant Lecture and Answer basic
related to microwave and satellite experience with discussion with questions
communication. microwave and detailed information about
satellite about the lab different
communication course, including types of
equipment. the objectives, instruments.
course outcomes,
lab examinations
and evaluation
method.

145
2, • Study of the characteristics of used microwave Through lecture, Neatness,
3, Klystron Tube and to determine laboratory equipment laboratory, and out- organization,
4, its electronic tuning range. to measure of-class completeness
5 • To determine the frequency & fundamental assignments. and
6, wavelength in a rectangular microwave individually
wave-guide working on TE10 parameterssuch as written lab
mode. SWR, reflection reports are
• To determine the Standing coefficient, unknown due at the
Wave-Ratio and Reflection impedance, beginning of
Coefficient. attenuation and the lab
• To measure an unknown power. period.
Impedance with Smith chart. used modern Respected
• To study the substitution microwave design and Teacher will
method for attenuation measurement be evaluated
measurement & determine the techniques, in lab period.
attenuation due to a component
under test.
• Study the voice communication
by using microwave test bench.
• Study of PC to PC
communication using
microwave test bench.
• Study of PC to PC
communication using
microwave transceiver
communication kit.
• Study of Magic Tee,
Circulator/Isolator,
Attenuator (Fixed and
Variable type), and Resonant
Cavity.

146
7 • Establishing a direct motivate Through lecture, Neatness,
8, communication link between students laboratory, and out- organization,
9, Uplink Transmitter and toward space of-class completeness
10 Downlink Receiver using by assignments. and
tone signal. providing individually
• To implement matlab code written lab
for uplink and downlink “real world” reports are
budget calculation. due at the
• To implement matlab code to satellite beginning of
determine look angle design, the lab
(azimuth and elevation) of fabrication,test, period.
satellite. launch, Respected
• Transmitting and receiving Teacher
three separate signals and wi
(Audio, Video, Tone) operational ll be
simultaneously through experience; ev
satellite link. aluated in lab
• Study the delay between period.
Uplink Transmitter and
Downlink Receiver during
data transmission.
• Study the global
positioning system and
GPS receiver.
• Calculate the carrier to
noise ratio/signal to noise
ratio of established satellite
link.
• Transmitting and receiving
PC data through satellite link.

147
11, Followings are implemented by used Through lecture, Hands on
12 the simulation software. modern and problem design experience in
• Design of a 100 MHz microwave design in simulation simulation
Chebyshev Lowpass Filter and measurement environment. environment.
(series inductor and parallel techniques,
capacitor version). software and
• Impedance Matching using a 1 / instrumentation
4 –Microstrip-Line (on an FR4- to
board). design, simulate,
• Impedance Matching using a 1 / fabricate and verify
4 – Line (= Grounded Coplanar the operation
Waveguide). of
• Analyzing a 1 GHz – a
Microstrip-LPF. passivemicrostrip
• Complete Design of a 1575 microwave circuit.
MHz – Microstrip edge
coupledBandpass Filter.

13 Final Lab Exam (Job, Quiz and Viva)

148
 COURSE CODE: CSTE 3205, COURSE TITLE: WEB ENGINEERING

Course Code: CSTE 3205, Course Title: Web Engineering, 3 Hours/Week, 3 Credits, Total Marks
100 (Attendance=5, Continuous Assessment=25, Final exam=70),Year 3, Term 2
Rationale: Lectures and seminars are supported by practical exercises that impart skills as well as
knowledge. This outline enables students to put into practice the techniques they have been taught
throughout the course.
Course Objectives:
➢ Encourage students to take web technology as their profession.
➢ They will be able to know about the technologies of web.
➢ They can be able to develop webpage.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Device manual,
Question bank, Previous questions.
Lesson Plan (as per week):
Course Outcome (at the end of the Teaching Learning Assessment
Week

Contents lesson, student should be Strategy(activities Strategy(How

able to) directed to achieve they are
outcomes) developed)
29. Web Engineering: • Know the attributes of Lecture and discussion Answer basic
• Attributes of Web based Web Applications with detailed questions,
system and Application. • Layers of Web App information about the quizzes,
• Web App Engineering Engineering course, including the Homework.
Layers • Processes of Web objectives, course
• Web Engineering Engineering outcomes,
Process examinations. Topic
wise lecture delivery.
30. Web Apps Analysis: • Analyze and select Lecture and discussion Answer basic
• Requirement Analysis, requirements for web with characteristics questions,
• Analysis Model, apps. parameters of logic quizzes,
• Web Apps Estimation, • Analyze and estimate families individually. Homework.
• Content Model. target app model. Data sheet will be
introduced.
3-5 Web Apps design: • Students will able to Lecture and discussion Class Test-1
• Design issues of Web know the issues of web with problems. (topics of the
Apps apps. week’s 1-5)
• Interface Design, • They can design
Typography, different kinds of
• Layout design, layout as the
Aesthetic Design, requirement of web
Content Design, apps.
Architecture Design,
Navigation Design,
• Object Oriented
Hypermedia Design,
Design Metrics for web
Apps.

149
 6-8 Web Apps Students can develop Exercise with
Implementation: Client side and server-side various
Client-side scripting: Java apps by different scripting mathematical
Script, AJAX, JQuery; languages problems.
Server-Side Scripting:
[Link], PHP;

Framework: PHP MVC

frameworks (Code Igniter,
Symfony, Zend, CakePHP)
[Link] MVC
Framework, Web service.
10- Web Apps Security: • Know how to build Class Test- 2
11 • Encryption techniques secure web apps with (topics of the
(digital signatures, different techniques. weeks 5-9)
certificates, PKI), • Know how to apply
• Security threats, different security
securing client/server techniques in web apps.
interactions,
Vulnerabilities at the
client (desktop security,
phishing, etc.) and
• The server (cross-site
scripting, SQL
injections, etc.),
Building Secure Web
Apps.
12 Testing Web Apps: • Know how to test web Answer basic
• Content Testing, User app with different testing questions,
• Interface Testing, approaches quizzes,
• Navigation Testing, Homework,
• Configuration Testing, exams.
• Security Testing,
Performance Testing.
13 Maintenance of Web Know how to monitor and Class Test-3
Applications: maintain web app (topics of the
• Web Server and weeks 10-13)
Database server load
balancing,
• web apps performance
assessment
• Application usage
monitoring and report
generation

Recommended Books:
1. Roger Pressman and David Lowe, Web Engineering, Tata McGraw Hill Edition, 2008
2. Dino Esposito Programming Microsoft [Link] 2.0, Microsoft Press, 2005
3. J. Castagnetto, H. Rawat, S. Schumann, C. Scollo and D. Veliath, Professional PHP Programming ,Wrox
Publications, 1999.
4. Leon Atkinson, Core PHP Programming, Prentice Hall Professional, 2004
150
 COURSE CODE: CSTE 3206, COURSE TITLE: WEB ENGINEERING LAB

Course Code: CSTE 3206, Course Title: Web Engineering Lab, 3 Hours/Week, 1.5 Credits, Total
Marks 100 (Class Attendance=10, Internal Evaluation/Observation = 70, Final Viva-voce =20),Year 3,
Term 2
Rationale: This course provides an introduction of web-development techniques that use HTML, CSS
and JavaScript as a web development essential including database connectivity (JDBC), Basics of PHP,
Basics of Java for Web Development and Basics of [Link] as an advanced technique of web

programming.
Course Objectives:
➢ To understand the concept of Web Application Development and its Architecture.
➢ To understand the Essentials of Web Application Development.
➢ To understand and practice web page designing techniques.
➢ To understand and practice embedded dynamic scripting on client-side Internet Programming.
➢ To understand the differences between client side & server-side technologies to develop Web
Application.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Eclipse IDE.
Lesson Plan (as per week):
Course Outcome (at the end of the Teaching Learning Assessment
Week

Contents lesson, student should be Strategy(activities Strategy(How

able to) directed to achieve they are
outcomes) developed)
31. UI DESIGN • Students will able to do Discussion and -Home task
• Introduction to HTML frontend layout. practice -Quiz
and HTML5 • Able to write html
• TML Tags, code.
• Formatting and
Fonts,Commenting
• Code, Anchors,
Backgrounds, Images,
• Hy perlinks, Lists,
Tables, Frames,
HTML
Forms.
2-3 Cascading Style Sheet • Students will introduce First lecture and then Answer basic
• Basic syntax and with design. Practice questions,
structure , • They will understand quizzes,
• Inline Styles, about attribute, class, Homework,
Embedding Style id etc. exams.
Sheets • They will make perfect
• Linking External, Sty le design.
• Backgrounds,
Manipulating Text,
Margins
• and Padding
Positioning using CSS

151
4-5 Introduction to • Student will introduce Lecture and discussion Quiz 1 (Topic of
JavaScript with JavaScript. with problems. the 1-3 weeks)
• Develop Client side and • Can make JavaScript
server side apps by functions.
different scripting • Understand Jquery
languages library.
6-7 JDBC (Java • Introduce with Practice with a real life Homework
Database SQl/MySQL problem.
Connectivity) • JDBC connection. CRUD Project.
• SQL, My SQL, • Database connectivity.
PostgreSQL • Data view from
• Connection Overview, database.
Transactions,
• Driver Manager
Overview

• Statement Overview
• Result Set Overview
• Prepared Statement
Overview
8- Java Server Pages • Introduction to JSP Practice with a real life Quiz 2 (Topic of
10 Technology • How to create dynamic problem. the 4-7 weeks)
• Creating Dynamic content. Apply JSP on CRUD
Content • Create Java Applets Project.
• Using Objects within • Java Servlets.
JSP Pages
• JSP Programming
• Java Applets
• Java Servlets
11- .Net • Introduction to MVC Practice with a real life Answer basic
12 Architecture framework. problem or project. questions,
and C# • A large collection of Make CRUD Project Homework
• Introduction to Dot Net. library. using MVC Quiz 3 (Topic of
• Dot Net framework and framework. the 8-13 weeks)
its architecture
• CLR ,What is
Assembly ,
• Components of
Assembly ,
• DLL hell and Assembly
Versioning.
Overview to C#.
• Introduction to [Link]
[Link] Programming
Final Lab Exam (Job and Viva)

152
 COURSE CODE: CSTE 3207, COURSE TITLE:OPTICAL FIBER COMMUNICATION

Course Code: CSTE 3207, Course Title:Optical Fiber Communication, 3 Hours/Week, 3 Credits,
Total Marks 100 (Attendance=5, Continuous Assessment=25, Final exam=70),Year 3, Term 2
Rationale: This course has been designed to provide the students an in-depth understanding of
component and system concepts in optical communications and its application which is fundamental to
the students’ ability to become a successful telecommunication engineer.
Course Objectives:
➢ To give students with a knowledge with the history of optical fiber communication and their
application in optical communication networks.
➢ To provide students with an understanding of the functionality of each of the components, that
comprises a fiber-optic communication system: optical source, transmitter, fiber, amplifier, an
optical detector, and receiver etc.
➢ To provide students with an understanding of the design of a basic communication link.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Device manual,
Question bank, Previous questions.
Lesson Plan (as per week):
Course Contents Outcome (at the end of the Teaching Learning Assessment
lesson, student should be Strategy (activities Strategy
Week

able) directed to achieve (How they

outcomes) are
developed)

1. History: History of optical To know the history of Discussion on detailed Answering

fiber communications, optical fiber information about the basic
Overview of the SEA-ME- communication with its course, including the questions,
WE-4 project. Introduction: need comparing with other objectives, course quizzes,
General communication networks. outcomes, examinations. Homework
system and optical fiber Discussion on the history etc.
communication system, The of optical fiber
need for fiber-optic communication with its
communication systems, need comparing with other
Satellite systems versus networks.
optical fiber networks.
2. The advantage of optical To get some fundamental Lecture and discussion on Answering
fiber communication, knowledge on light the fundamentals of light basic
Property of light, Skew ray propagation through the property and some other questions,
and meridional ray, Phase optical fiber and its related topics. quizzes,
and group velocity, Energy bandwidth calculation. Exercise on some basic Homework
level concepts of radiating topics. etc.
material, pumping and
radiation, Electrical
bandwidth and optical
bandwidth.
3. Optical fiber waveguide: To learn the basics of an Discussion on the basics Answering
Basics, Refractive index, optical fiber waveguide. of optical fiber waveguide basic
Step index fiber, Graded- To learn the characteristics and the characteristics of questions,
index fiber, Multimode step- of different fiber types. different fiber types. quizzes,
index fiber, Multimode Exercise on refractive Homework
graded index fiber, Total index and some other etc.
internal reflection. basic topics.

153
4. Optical fiber waveguide: To learn the details of an Lecture and discussion in Answering
Critical propagation angle, optical fiber waveguide. detail on optical fiber basic
Incident angle, Acceptance waveguide, attenuation, questions,
angle, Numerical aperture, absorption, dispersion etc. quizzes,
Attenuation, Absorption, Exercise on NA, Homework
Dispersion, Bit rate and attenuation, dispersion etc. etc.
Bandwidth.
5. Preparation of optical To explain the fiber Demonstration on optical CT-1
fibers: Liquid phase preparation technique in fiber preparation (topics of
(melting) technique, Vapor detail. techniques. the week’s
phase deposition technique. 1-4)
6. Optical sources and To learn the basics of optical Lecture and discussion on Answering
transmitter: Light emitting sources. the basics of a light source basic
diode, Principle of action and To understand the working and working principles of questions,
characteristics, Properties of procedure of different types different types of LED. quizzes,
spontaneous and stimulated of LED. Exercise on related topics. Homework
radiation, Homostructure and etc.
heterostructure LED, SLED,
ELED.
7. Optical sources and To understand the working Lecture and discussion on Answering
transmitter: a Laser diode procedure of different types working principles of basic
(LD), Principle of action and of LD. different types of LD. questions,
characteristics, Fabry-Perot To explain the functional Exercise on related topics. quizzes,
laser diode, Lifetime, block diagram of an optical Homework
rise/fall time and bandwidth, transmitter. etc.
a Functional block diagram
of an optical transmitter.

8. Optical detectors and To learn the basics of optical Lecture and discussion on Answering
receiver: p-n photodiode, p- sources. the basics of an optical basic
i-n photodiode, Avalanche To understand the working detector and working questions,
photodiode (APD) with procedure of different types principles of different quizzes,
working procedure, of optical detector. types of optical detector. Homework
Responsibility of a To explain the functional Exercise on related topics. etc.
photodiode, Phototransistors, block diagram of an optical
Functional block diagram of receiver.
an optical receiver.
9. Optical fiber connection: To learn in detail about fiber Lecture and discussion on CT-2
Joints and couplers, Fiber joint techniques and coupler fiber joint and couplers. (topics of
splices, Fiber connectors. types. Exercise on joint and the week’s
coupling loss calculations. 5-8)
10. Optical amplifiers: Types To learn the basics of optical Lecture and discussion on Answering
of an optical amplifier, amplifiers. the basics of an optical basic
Semiconductor optical To understand the working amplifier and working questions,
amplifier (SOA), Types of procedure of different types principles of different quizzes,
SOA, Erbium-doped fiber of optical amplifier. types of the optical Homework
amplifier (EDFA). To familiar with some amplifier and some etc.
Optical link connections in networks using fiber link. electronic networks using
electronic networks: FDDI, an optical link.
Ethernet, fiber channel, Exercise on related topics.
ESCON, and intersystem
coupling.

154
 11. Optical link connections in Lecture and discussion on Answering
electronic Familiar with some other some other electronic basic
networks:Opticonnect, electronic networks using networks using an optical questions,
SONET and SDH, ATM, fiber link connections link and some optical quizzes,
WDM, building photonic Familiar with some optical devices like multiplexers, Homework
networks, components for devices like multiplexers, switches, wavelength etc.
WDM, add-drop switches, wavelength converters etc used in
multiplexers, optical space converters etc. practical applications.
division switches, optical
switching nodes, wavelength
converters, standards for
WDM, lightwave networks.
12. Optical fiber applications. Introduce different optical Discussion on optical fiber CT-3
Optical link budget. fiber applications applications. (topics of
Analyze optical link budget. Exercise on optical link the week’s
budget calculations. 9-12)
13. Review topics and Final Learn about latest trends and Students will be asked to Exercise
exam preparation. the better answering methods answer the questions the
in the final exam. orally on previous lectures answering
and review the contents of methods in
the course. final exam.
Discussion on the better
answering methods for the
final examinations.

Recommended Books:
1. Fiber-Optic Communications Technology by Djafar K. Mynbaev, Addison-Wesley
2. Optical Fiber Communications by John M. Senior, Prentice-Hall.
3. Fiber-Optic Communication Systems by G P. Agrawal, G P. Agrawal, Wiley.

155
 COURSE CODE: CSTE 3208, COURSE TITLE: OPTICAL FIBER COMMUNICATION LAB

Course Code: CSTE 3208, Course Title: Optical Fiber Communication Lab, 2 Hours/Week,
1Credits, Total Marks 100 (Class Attendance=10, Internal Evaluation/Observation = 70, Final Viva-
voce =20), Year 3, Term 2
Rationale: This course has been designed to provide the students with practical understanding of
theories and concepts in optical communications which is fundamental to the students’ ability to
become a successful telecommunication engineer.
Course Objectives:
➢ To enable students to relate what they have learnt in classroom to practical, hands-on experiments
that will be performed in a fiber optic communication laboratory.
➢ To take away the “fear factor” by providing experience of operating various equipments.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Lab equipment
and Manuals.
Lesson Plan (as per week):
Course Contents Outcome (at the end of the Teaching Assessment
lesson, student should be Learning Strategy
Week

able) Strategy (How they are

(activities directed developed)
to achieve
outcomes)
1-2. ➢ Study the basic structure ➢ To understand, Lecture and Answer basic
and types of the optical fiber. measure and examine the discussion with questions,
➢ Examine the operational parameters of optical practical quizzes,
characteristics and parameters sources, detectors and implementation. homework.
of optical sources and detectors. connectors.
➢ Examine the
characteristics of optical
connectors.
3. ➢ Carry out measurements ➢ To calculate and Discussion and Answer basic
on the optical communication analyze the measurements practice. questions,
system. on the optical quizzes.
communication system.
4-5. ➢ Construct a digital ➢ To construct a Discussion with Answer basic
transmission system applying digital transmission practical questions,
Manchester and Bi-phase data system applying implementation quizzes.
codes. Manchester and Bi-phase and testing.
➢ Construct a data data coding techniques.
transmission system with ➢ To construct a link
personal Computer. for the transmission of
data with personal
Computer.
6-7. ➢ Construct a ➢ To construct a Lecture and Answer basic
communication system communication system discussion with questions,
consisting of : consisting of some practical quizzes,
 8-channel Multiplexer/ defined features. implementation. homework.
Demultiplexer
 Manchester or Bi-Phase
coder/decoder.
 Transceiver of optical fiber.

156
 8. ➢ Carry out a ➢ To construct an Discussion and Answer basic
communication system optical communication practice. questions,
consisting of FM modulator and system with FM quizzes.
demodulator, transmitter and modulator and
receiver on optical fiber. demodulator.

9-10. ➢ Carry out an optical ➢ To design an optical Discussion and Answer basic
multiplexing of audio signal communication system practice. questions,
with the video signal through a with audio-video quizzes.
frequency translation. multiplexing/
➢ Carry out how the multiplexed demultiplexing
audio signal can be separated techniques.
from the video signal.
11. ➢ Perform Intensity ➢ To perform Discussion and Answer basic
modulation (linear modulation) Intensity modulation of practice. questions.
of an optical source. an optical source.
12 ➢ Construct an audio+video ➢ To construct and Discussion with Answer basic
communication system analyze an audio/video practical questions,
consisting of audio and video optical communication implementation quizzes,
source, audio/video multiplexer system. and testing. homework,
and de-multiplexer; analog Demonstration exams.
transmitter and receiver on with e-Tutorials.
optical fiber and loudspeaker.
➢ Perform other
experiments relevant to this
course.
13 Final Lab Exam (Job and Viva)

COURSE CODE: CSTE 3209, COURSE TITLE: SOFTWARE ENGINEERING AND INFORMATION
SYSTEM DESIGN

Course Code: CSTE 3209, Course Title: Software Engineering and Information System Design,3
Hours/Week, 3 Credits, Total Marks 100 (Attendance=5, Continuous Assessment=25, Final
exam=70),Year 3, Term 2
Rationale:This course introduces the concepts and methods required for the construction of large
software intensive systems. It aims to develop a broad understanding of the discipline of software
engineering.

157
Course Objectives:
➢ Apply software engineering practice over the entire system lifecycle. This includes requirements
engineering, analysis, prototyping, design, implementation, testing, maintenance activities and
management of risks involved in software and embedded systems.
➢ Effective communication skills and technical skills to assure production of quality software, on time
and within budget.
➢ Agile software developers with a comprehensive set of skills appropriate to the needs of the
dynamic global computing-based society.
➢ Capable of team and organizational leadership in computing project settings, and have a broad
understanding of ethical application of computing-based solutions to societal and organizational
problems.
➢ Understanding of the role and impact of software engineering in contemporary business, global,
economic, environmental and societal context.
➢ Ability to use knowledge, techniques, skills and modern tools necessary for software engineering
practice.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Previous
questions.
Lesson Plan (as per week):
Course Outcome (at the end of the lesson, Teaching Learning Assessment
Contents student should be able to) Strategy(activities Strategy(How
Week

directed to achieve they are

outcomes) developed)

32. Overview of Basic of Software Engineering Lecture and discussion Answer basic
Software Industry, Explain the software engineering with detailed questions,
Introduction to practice. information about the quizzes.
Software Understand the basic terminology course, including the
Engineering, and characteristics of good objectives, course
Software software. outcomes,
Development Explain the system development examinations. Topic
Process and and software development life wise lecture delivery.
Various Life Cycle cycle.
Models.
33. Communication Requirement Engineering and Lecture and discussion Answer basic
Techniques, Modeling. with requirement questions,
Analysis Principles, Explain the tasks of requirement analysis tasks. Discuss quizzes,
Software engineering. Inception, Elicitation, Homework,
Prototyping, Initiate requirement engineering Elaboration, exams.
Requirement process. Negotiation,
Specification. Recognize multiple viewpoint. Specification,
validation, and
requirement
management and
software prototype.

158
34. Working in Teams, Work in team environment. Lecture and discussion Homework,
Characteristics of Explain the characteristics, roles with problems related exams.
Successful Team, and responsibilities of teams. to teamwork.
understanding
Group Dynamics,
Team Roles and
Temperament,
democratic Team
and Chief
Programmer Team
Approach.

35. Steps of system Feasibility Study Lecture and discussion Exercise with
analysis, Feasibility Understand technical feasibility, on different types of various scenario.
study, Economic operational feasibility, economic feasibility study and
and technical feasibility, and operational feasibility study
analysis, System feasibility. process. Discussion
specification, the Build analysis model. with problems and its
elements of analysis Explain the elements of the solution.
model. analysis model.
36. Data modeling, Understand data flow diagram. Lecture and discussion Class Test 1
Functional Explain functional model. on elements of (topics of the
modeling and Understand graphical description. different types of weeks 1-4)
information flow, Explain activity diagram. models. Discussion
Behavioral with problems.
modeling,
Mechanics of
structured analysis,
Data Dictionary.
37. Design principles, Software Design Lecture and discussion Answer basic
Design Concepts, Explain design principles, with problems and its questions,
effective modular concepts. solution. quizzes,
design, design Design effective software module. Exercise with

heuristics, Data Understand taxonomy of various scenario,

Design, architectural styles. exams.
Architectural
Design process,
38. Transformation Use DFDs to map real life scenarios Lecture and discussion Exercise with
mapping, to a software architecture. Explain with problems and its various problem
Transaction transaction flow. solution. scenario.
mapping, interface Understand how to design
design, human interface.
computer interface
design, procedural
design.

159
39. Testing Software Testing Lecture on design Answer basic
fundamentals, test Understand the characteristics of different test cases and questions,
case design, different types of testing. perform different types exams.
white-box testing, Develop test cases. of software testing
black-box testing, Understand strategic approach to based on scenarios.
testing GUIs, Unit software testing.
testing, Integration Explain recovery, security, stress,
testing, validation performance testing.
testing, system Explain alpha and beta testing.
testing, debugging.
40. Major maintenance Maintenance. Lecture on corrective, Class Test
activities, Understand different types of adaptive, perfective 2(topics of the
estimating software maintenance. maintenance and weeks5-8)
maintenance cost Understand key factors that maintenance cost
and productivity. distinguish development and estimation.
maintenance
Estimate repair and maintenance
cost.
41. Project estimation, Software Cost Management. Lecture and discussion Answer basic
estimation Apply critical path method of with problems. questions,
techniques, project software project management. exams.
scheduling, critical Estimate cost in software project.
path analysis.
42. O-O concepts, O-O Object Oriented Software Lecture and discussion Quizzes,
analysis, Domain Engineering. with problems. Homework,
analysis, O-O Understand the generic steps of exams.
analysis process, object-oriented analysis.
Object relational
model. O-O design: Understand how a software design
system design may be represented as a set of
process, object interacting objects that manage
design process, O- their own state and operation.
O programming.
Understand the different models
that may be used to document an
object-oriented design

Represent the models in the

Unified Modeling Language
(UML).
43. O-O Testing: Explain object oriented testing by Lecture and discussion Class Test 3
Testing strategies, designing test cases. with problems. (topics of the

160
 test case design. Development and maintenance of Component and scope weeks9-12)
Introduction to software projects with help of of CASE tools.
CASE Tools: What various automated software tools.
is CASE, the Automate SDLC activities
taxonomy of CASE
tools, iCASE
environment, CASE
repository, Example
CASE tools.

44. Trade Marks, Copy Intellectual Properties Lecture and discussion Exercise the
Rights, Trade Understand some software with examples. answering
Secrets, Patents. engineering ethics. methods in final
Explain and differentiate exam.
trademarks, copy rights, trade
secrets and patents.

Recommended Books:
1. Software Engineering, A Practitioner's approach by Roger S. Pressman, 4th Edition, McGraw Hill
2. Software Engineering by I. Sommerville, 6th Edition, Pearson Education
3. Software Engineering Concepts by Richard Fairley, 1st Edition, McGraw Hill
4. Software Quality Assurance from Theory to Implementation by D. Galin, 1st Edition, Addison Wesley
5. Software Engineering for Internet Applications by Eve Andersson, et. al.
6. UML Process by SharamHekmat

COURSE CODE: CSTE 3210, COURSE TITLE: SOFTWARE ENGINEERING AND INFORMATION
SYSTEM DESIGN LAB

Course Code: CSTE 3210, Course Title: Software Engineering and Information System Design
Lab,3 Hours/Week, 1.5 Credits, Total Marks 100 (Class Attendance=10, Internal
Evaluation/Observation = 70, Final Viva-voce =20),Year 3, Term 2
Rationale:This course focuses on experiments to verify practically the theories and concepts develop in
CSTE 3209.
Course Objectives:
➢ Apply software engineering practice over the entire system lifecycle. This includes requirements
engineering, analysis, prototyping, design, implementation, testing, maintenance activities and
management of risks involved in software and embedded systems.
➢ Develop software in application level by the knowledge of previous knowledge such as database
system, software engineering, data structure etc.
➢ Follow the procedure of software such as collection of user requirements by visiting different
organization/institution or company.
➢ Understanding of the role and impact of software engineering in contemporary business, global,
economic, environmental and societal context.
➢ Ability to use knowledge, techniques, skills and modern tools necessary for software engineering
practice.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Previous
questions.
Lesson Plan (as per week):

161
 Course Outcome (at the end of the Teaching Learning Assessment

Week
Contents lesson, student should be able to) Strategy Strategy
(activities directed to (How they are
achieve outcomes) developed)
1-3 House hold Applysoftware development life Discussion, practice Answer basic
accounting- for cycle. and case study questions,
budgeting of a Initiate requirement engineering Homework.
particular family. process.
4-5 Library Understand technical feasibility, Discussion, practice quizzes,
management operational feasibility, economic and case study Homework,
system to run a feasibility, and operational Quiz 1 (Topic of
library. feasibility. the 1-3 weeks)
Recognize multiple viewpoint.
6-7 Payroll system. Work in team environment. Discussion, practice Answer basic
Design effective software and case study questions,
module. Homework.
Develop test cases.
Estimate project cost.
Explain recovery, security,
stress, performance testing

Understand different types of

8-9 Lubricating oil software maintenance. Discussion, practice Answer basic
management and case study questions,
system. Homework.
Quiz 2 (Topic of
the 4-7 weeks)

10-11 Super shop Answer basic

management questions,
system. Homework.
12 To perform other Understand key factors that Discussion, practice Answer basic
experiments distinguish development and and case study questions,
relevant to this maintenance quizzes,
course. . Homework,
exams.
Quiz 3 (Topic of
the 8-11 weeks)
13 Final Lab Exam (Job and Viva)

COURSE CODE: CSTE 3211, COURSE TITLE: WIRELESS AND MOBILE COMMUNICATION

Course Code: CSTE 3211, Course Title: Wireless and Mobile Communication, 3 Hours/Week, 3
Credits, Total Marks 100 (Attendance=5, Continuous Assessment=25, Final exam=70), Year 1, Term 2
Rationale: This course has been designed for the students to understand wireless and mobile cellular
communication systems, advanced multiple access techniques, frequency reuse, cell splitting, different
modulation techniques, different generations mobile, wireless LAN and other networks.

162
Course Objectives:
➢ To enable the student to synthesis and analyze wireless and mobile cellular communication systems.
➢ To provide the student with an understanding of advanced multiple access techniques.
➢ To provide the student with an understanding of diversity reception techniques.
➢ To give the student about understanding digital cellular systems (cdma 2000, W-CDMA, LTE),

WLAN, RTS/CTS mechanism, GSM, GPRS, Bluetooth networks.

➢ By the end of the course, the student will have the ability to work in advanced research wireless and
mobile cellular programs.

Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Device manual,
Question bank, Previous questions.
Lesson Plan (as per week):
Course Outcome (at the end of the Teaching Learning Assessment
Contents lesson, student should be able Strategy Strategy
Week

to) (activities directed (How they are

to achieve developed)
outcomes)
1 Evolution of mobile radio Introduction to wireless Overall discussion Answer basic
communications, wireless communication. with the students questions,
communication system To learn the basic concepts on must be needed group
definitions, FDD and TDD, wireless communication about the course discussion,
cordless and cellular mobile system, different generations of contents including assignments.
systems, different wireless networks. the objectives,
generations of wireless To understand different course outcomes,
networks, modulation duplexing and modulation examinations,
techniques for wireless techniques. physical
communication. environment and
methodology.
2 FDMA, TDMA and CDMA FDMA, TDMA and CDMA. Delivering lecture Draw the
multiple access techniques To understand the multiple and overall circuit
for wireless communications, access techniques for wireless discussion with the diagrams to
communications, students must be design the
To setup encoding and needed on several multiple
decoding techniques by using techniques of accesses in
CDMA. multiple access. classroom.
Show the Assignments
comparison among on the
FDMA, TDMA and applications of
CDMA in multiple
classroom. accesses must
be submitted
regularly.
3 GSM and GPRS: services, GSM and GPRS. Delivering lecture Answer basic
system architecture, radio To understand the architecture and overall questions and
interface, protocols, and other services of GSM and discussion on GSM demonstrate
handover, [Link], GPRS. and GPRS systems. presentation.
Demonstrate block
diagrams and video
tutorials GSM and
GPRS systems in
the classroom.
163
4 2.5G systems, EDGE, Special Wireless Network Demonstrate Q & A
TETRA, TDMA frame Systems. various techniques session,
structure of TETRA, 3G To draw the block diagrams of to solve the design demonstrate
systems, UMTS, Spreading special wireless networks. of all wireless presentation
and scrambling technique, To be able to understand the networks. and
UTRAN, 4G and beyond Spreading and scrambling assignments.
technique.
5 IS-95 System architecture, CDMA Terminologies. Delivering lecture Class Test

Air interface, Physical and To draw the block diagrams of and overall 1(topics of the
Logical channel, Handover different categories CDMA discussion on weeks 1-4)
and Security, and system. different categories
Introduction to CDMA 2000, To understand the handover, CDMA system.
W-CDMA security and channel formation
in CDMA technique.
6 Mobile telephone systems, Cellular Mobile Concepts. Lecture and Answer basic
Trunking efficiency, Basic To understand the concept of explanation on questions,
cellular system, Performance trunking, grade of service, cellular Mobile group
criteria, Mobile radio mobile phone functions, setting Concepts in the discussions,
environment, Operation of a call, types of mobile system, class room. assignments.
cellular systems, Planning a control channel and mobile
cellular systems, Analog and equipment.
digital cellular systems.
7 frequency reuse, cell Cellular Services. Lecture and Group
splitting, registration, To improve coverage and discussion on discussion,
terminal authentication, capacity in cellular systems. different cellular presentation.
handoff; services to expand
cellular coverage
and capacity.
8 Path loss modeling and Radio Propagation and Path Demonstrate on Q & A session
signal coverage, Path loss Loss Model. various path loss and
model for outdoor To solve different radio models for outdoor demonstrate
communications- Free space propagation and path loss and indoor presentation.
propagation model, Two-Ray problems for indoor and communications.
model, Okumura model, outdoor communications.
Hata model, Path loss model To compare the characteristics
for indoor communications. among different path loss
models.

164
9 Small scale fading- Flat Fading. Lecture and Class Test
fading, Frequency selective To know about different fading explanation on 2(topics of the
fading, Fast fading, slow problems occurred due to different fading weeks 5-8)
fading, Large scale fading, multipath propagation in problems and to
Rayleigh and Rician cellular system and solve the solve the problems
distributions. Statistical problems by applying diversity by applying
model for multipath fading schemes. diversity schemes.
channels. Narrowband fading
model, Wideband fading
model, Diversity, transmit
diversity, receive diversity-
selection combining (SC),
maximal ratio combining,
Coherence time and
Coherence bandwidth, Path
loss, shadowing and
multipath, Effects of
multipath channel, Doppler
shift.
10 Frequency planning, noise Wireless Communication Delivering lecture Answer basic
and interference in wireless Technology. and overall questions,
communication systems, To comprehend pros and cons discussion on group
antenna & radio-wave of basic wireless several topics of discussion,
propagation in the mobile communication system. basic wireless presentation.
environment-fading. To solve different noise, communication

interference and radio system in

propagation problems in classroom.
mobile system.
.
11 IEEE 802.11 standard, Wireless LAN. Lecture and Q&A
WLAN Family, WLAN To understand different WLAN discussion on session,
modulation system, WLAN basics, family and modulation WLAN basics, demonstrate
protocol architecture, system. family and presentation
Collision Sense Multiple To design WLAN protocol modulation system, and
Access with Collision architecture and solve hidden protocol assignments.
Detection terminal problems in WLAN architecture and
(CSMA/CD) and CSMA by using CSMA/CD CSMA/CD
Collision avoidance mechanism. mechanism.
(CSMA/CA).

165
 12 IEEE 802.11 Distributed WLAN and ADHOC Lecture and Class Test
Coordinate System (DCF) families. explanation on the 3(topics of the
and Point Coordination To learn about different pros and cons weeks 9-12)
Function (PCF), WLAN WLAN and ADHOC network ofdifferent WLAN
family (HAN, WPAN, systems. and ADHOC
Wireless ATM. HIPERLAN: To design and maintain these network systems.
Requirements & networks properly.
Architecture. BLUETOOTH
architecture & protocol
stack. Brief introductions to
3G and 4G Cellular Mobile
Communications Systems.
Adhoc network (MANET,
VANET)
13 Review topics and Final Learn about latest trends and Lecture and Exercise the
exam preparation. the better answering methods discussion on answering
in the final exam. miscellaneous methods in
topics. final exam.

Recommended Books:
1. Mobile Communications by Jochen Schiller, PEARSON Education Ltd.
2. Mobile Cellular Telecommunications by William C.Y. Lee, McGraw Hill.
3. Wireless Communications: Principles and Practice by Theodore S. Rappaport, Wiley.
4. Wireless Digital Communication by KamiloFeher, Prentice Hall.
5. Wireless Communications by Andrea Goldsmith, Cambridge University Press.

COURSE CODE: CSTE 3212, COURSE TITLE: WIRELESS AND MOBILE COMMUNICATION
LAB

Course Code: CSTE 3212, Course Title: Wireless and Mobile Communication Lab, 2 Hours/Week,
1 Credit, Total Marks 100 (Class Attendance=10, Internal Evaluation/Observation = 70, Final Viva-
voce =20), Year 3, Term 2
Rationale: This course deals with Wireless connectivity establishment, designing and monitoring. It
also helps to investigate different signal bands and channels.
Course Objectives:
➢ Experimental verifications of theoretical concepts developed in CSTE 3211.
➢ To understand Wireless LAN designing and develop Wireless LAN connectivity between two pcs.
➢ To investigate different signals and channels.
➢ To create frequency flat Rayleigh fading channel and Rican fading channel object for processing a
DBPSK signal.

Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials.

Lesson Plan (as per week):
Course Outcome (at the end of the Teaching Learning Assessment
Week

Contents lesson, student should be Strategy Strategy

able to) (activities directed to (How they are
achieve outcomes) developed)

166
1-2 • How to create a home • Learn about wireless Discussion and -Home task
group. LAN connectivity and practice -Quiz
• Configure two pc for transfer data through it.
wireless LAN using
DWL-2100AP.
• Transfer a file between
two pc using wireless
LAN.
3-4 • Radio Signal • Learn about monitoring First lecture and then Answer basic
Monitoring and White and investigation of Practice questions,
Space Allocation different band signal. quizzes,
• Investigate a wide band Homework,
(1710 – 3500 MHz) exams.
• Investigate the ISM Quiz 1 (Topic of
band (2400-2500MHz) the 1-4 weeks)
5-6 • Signal strength of the • Learn about the Lecture and discussion Homework
3G mobile phone simulation. with problems.
frequency band
• Monitoring 3G mobile
phone signal (optional)
• Simulate a QPSK
modulation scheme and
compare it with BPSK
scheme.
7-8 • Create a frequency flat • Create frequency flat Lecture and discussion Quiz 2 (Topic of
Rayleigh fading channel Rayleigh fading with problems. the 5-8 weeks)
object. Uses it to channel and Rican
process a DBPSK fading channel object.
signal.
• Create a Rican fading
channel object. Uses it
to process a DBPSK
signal.
• Generate binary random
sequence with length
10000.
9- • Pulse Shaping and • Learn about filtering, Practice with a real-life Answer basic
10 Matched Filtering. modulation, and problem. questions,
• OFDM Modulation & channel estimation and quizzes,
Frequency Domain equalization. Homework,
Equalization. exams.
• Channel Estimation &
Equalization.
11- • Wireless LAN • Learn about wireless Lecture and discussion Answer basic
12 designing by LAN LAN design and with problems. questions,
Planner. investigation Homework
• Investigation on WLAN Quiz 3 (Topic of

Multipath Channel. the 9-10 weeks)

13 Final Lab Exam (Job and Viva)

167
 COURSE CODE: CSTE 3226, COURSE TITLE:VIVA VOCE

COURSE CODE: CSTE 3226, COURSE TITLE: VIVA VOCE, 0 Hours/Week, 1 Credits, Total
Marks 100, Year 3, Term 2
Rationale: This course has been designed to develop the students’ ability to realize practical situation
of job environment.
Course Objectives:
➢ Prepare the students to face interview both at the academic and the industrial sector
OUTCOME (Student should be able to)
COURSE CONTENTS
VIVA VOCE (Viva based on major/minor courses of Evaluate overall technical knowledge
Year-3) and industry readiness.
Able to go under a virtual environment of
technical interview.
Able to analyze various application of
Computer Science & Telecommunication
Engineering in real-life problem solving.

168
 COURSE CODE: CSTE 4101, COURSE TITLE: COMPUTER GRAPHICS AND ANIMATION

Course Code: CSTE 4101, Course Title: Computer Graphics and Animation, 3 Hours/Week, 3 Credits,
Total Marks 100 (Attendance=5, Continuous Assessment=25, Final exam=70), Year 4, Term 1
Rationale: This course has been designed to develop the students’ ability to implement the tools and
techniques of different computer graphics.
Course Objectives:
➢ Explain the tools and techniques of different computer graphics hardware and software.
➢ Describe briefly different algorithms used in computer graphics.
➢ Discuss clipping, splines and interactive techniques.
➢ Explain lighting models, shading and animation techniques.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Device manual,
Question bank, Previous questions.
Lesson Plan (as per week):
Course contents Outcome (at the end of Teacher Learning Assessment
the session, student strategy (activities Strategy
Week

should be able to) directed to achieve (How they are

outcomes) developed)
1. Computer Graphics Work with OpenGL. Lecture and discussion Answer basic
Programming: OpenGL. Explain Scan with detailed questions,
Scan Conversion: scan Conversion and information about the quizzes,
converting a point, line, converting method of a course, including the Homework,
circle, ellipse, arc, and point, line, circle, objectives, course exams.
sectorized polygons. ellipse, arc, and sector- outcomes, examinations,
based polygon. physical environment
and methodology with
the students.
Demonstrate problem
solving techniques

2. Camera Analogy and Explain viewing, Lecture and discussion Answer basic
Color Model: Viewing, windowing, and about camera analogy questions,
Windowing,Clipping, RGB clipping. Learn different and color model. quizzes,
color model,CMYK color color models like RGB, Homework,
model, Lookup table and CMYK, lookup table, exams.
direct coding and direct coding.

3. ProjectiveTransformatio Learn and explain Demonstrate examples Answer basic

n: different types of of projective questions,
Types of projection, projection. transformation using quizzes,
Parallel Projection, internet. Homework,
Perspective Projection exams.
4. Vector and Matrix: Explain normal and Lecture and discussion Answer basic
Normal Vector,View view vector. about vector and matrix. questions,
Vector, 2D and 3D Differentiate between quizzes,
Rotation and Translation 2D and 3D rotation and Homework,
Matrix translation matrix. exams.

169
5. Raster Graphics & Explain about line Use different software Class Test 1
Hidden Surface Removal: drawing, anti-aliasing, tools to implement (topics of the
Line Drawing,Anti- polygon filing algorithms relate to week’s 1-4)
aliasing,Polygon Filing algorithms, Z-buffer raster graphics and
Algorithms, Z-buffer algorithm, and painter’s hidden surface removal.
algorithm,Painter’s algorithm.
algorithm

6. Lighting and Surface Compare different light Lecture and discussion Answer basic
Property: such as diffused light, about lighting and questions,
Diffused Light, ambient light, and surface property. quizzes,
Ambient Light, specular light. Homework,
Specular Light, Explain lighting models exams.
Lighting Models for for reflection, refraction
reflection, refraction and and transparency.
transparency
7. Shading and Texture Differentiate among Lecture and demonstrate Answer basic
Mapping: Flat, lambert, and phong shading and texture questions,
Flat Shading, shading. Explain mapping. quizzes,
Lambert Shading, Texture fundamentals Homework,
Phong Shading, and blending. exams.
Texture Fundamentals,
Texture Blending
8. Curves and Surfaces: Explain different types Lecture and discuss Answer basic
Types of Curves, of curves, cubic-spline, about curves and questions,
Cubic-Spline, beta-spline, and surfaces. quizzes,
Beta-Spline, NURBS. Homework,
NURBS exams
9. Image Formats: Explain PPM, BMP, and Lecture and discussion Class Test 2
PPM,BMP,Image Based Image Based Rendering. about Image formats. (topics of the
Rendering week’s 5-8).
10. Morphing Explain view-morphing, Lecture and discussion Answer basic
View-morphing, Volume and volume about morphing. questions,
Metamorphosis metamorphosis. quizzes,
Homework,
exams.

11. Animation: Explain real time Lecture and demonstrate Answer basic
Real time animation, animation, hardware for videos of real time questions,
Hardware for real-time real-time animation, animations, games and quizzes,
animation, character animation, movies using animation. Homework,
Character Animation, Computer games, and exams.
Computer Games, movies.
Movies
12. Animation: Explain computer-based Lecture and discussion Class Test 3
Computer based animation, animation about animation. Use (topics of the
Animation, language, and methods Unix and 3D max studio week’s 9-12)
Animation Language, of controlling animation. for practical uses.
Methods of controlling Demonstrate animation
Animation, and transmission of
Display of Animation, animation.
Transmission of Animation

170
13. Miscellaneous and Final Learn about latest trends Lecture and discussion Exercise the
exam preparation and the better answering on miscellaneous answering
methods in final exam. subjects methods in final
exam.

Recommended books:
4. Computer Graphics: A Programming approach by St even Harrington, McGraw Hill.
5. Computer Graphics by Donald Hearnand M. Pauline Baker, Prentice Hall.
6. OpenGL(r) 1.2 Programming Guide, Third Edition: The Official Guide to Learning OpenGL,
Version 1.2: by Mason Woo, Jackie Neider, Tom David, Dave Shriner, OpenGL Architecture
Review Board, Tom Davis, Dave Shreiner.
7. Computer Graphics: Schaum’s Outlines, McGraw Hill.
8. Animations for Beginners by MorrOleroz.

COURSE CODE: CSTE 4102, COURSE TITLE: COMPUTER GRAPHICS AND ANIMATION LAB

Course Code: CSTE 4102, Course Title: Computer Graphics and Animation Lab,2 Hours/Week, 1
Credit, Total Marks 100 (Class Attendance=10, Internal Evaluation/Observation = 70, Final Viva-voce
=20), Year 4, Term 1
Rationale: This course deals with drawing line, circle, and ellipse, scan conversion, transformation, line
and polygon clipping, and 3D graphics using OpenGL API.
Course Objectives:
➢ Experimental verifications of theoretical concepts developed in CSTE 4101.
➢ To understand different algorithms related to drawing line, circle, and ellipse properly.
➢ To use scan conversion technique to convert various designs and characters.
➢ To develop 3D models using OpenGL API
➢ To develop complete project using these concepts.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, OpenGL.
Lesson Plan (as per week):
Course Outcome (at the end of Teaching Learning Assessment
Contents the lesson, student Strategy Strategy
Week

should be able to) (activities directed to (How they are

achieve outcomes) developed)

1-2 • Draw a Line using • Write programs for Discussion and -Home task
Polynomial Line drawing line, and practice -Quiz
Algorithm, DDA Line circle using different
Algorithm, Bresenham’s algorithms
Line Algorithm
• Draw a Circle using
Midpoint Circle Algorithm,
Polynomial circle
algorithm, Trigonometric
circle algorithm,
Bresenham’s circle
algorithm

171
3-4 • Draw an Ellipse using the • Write programs for First lecture and then Quiz 1 (Topic
Polynomial algorithm, drawing ellipse, arc Practice of the 1-4
Trigonometric algorithm. and sector using weeks)
• Draw an Arc and a sector. various algorithms
5-6 • Scan conversion of various • Write programs on Lecture and Answer basic
characters: using Bitmap method scan conversion of discussion with questions,
and Outline method various characters problems. quizzes,
• Scan converting a character and designs. Homework,
bangle ka using Bitmap method exams.
and Outline method

• The scan converts Shahid Minar,

SritiShoudo, a clock and a
flower.
7-8 • Rotate a Line, Triangle, and • Write programs on Lecture and Quiz 2 (Topic
Rectangle about a point. transformation. discussion with of the 5-8
• Magnifying a circle, a triangle problems. weeks)
and a rectangle about a point.

• Create a flower with rotating an

object
9- • Scan converts a three- • Write 3D graphical Practice with a real Answer basic
10 dimensional “F” and cube programs using life problem. questions,
then rotates the object OpenGL API. quizzes,
about the x-axis and Homework,
magnifies it. exams.
• Rotate a 3D cube and NSTU
Shahid Minar using OpenGL.
• Projection of 3D cube.
11 • Line & polygon clipping • Write programs on Lecture and Answer basic
problems. line and polygon discussion with questions,
clipping problems. Homework
• To perform also other Quiz 3 (Topic
experiments relevant to this of the 9-12
course. weeks)
12 Project • Submit a project Evaluate each project. Presentation,
using the concepts of Project
structured showcasing.
programming
language.
13 Final Lab Exam (Job and Viva)

172
 COURSE CODE: CSTE 4103, COURSE TITLE: ARTIFICIAL INTELLIGENCE AND NEURAL
NETWORKS

Course Code: CSTE 4103, Course Title: Artificial Intelligence and Neural Networks, 3 Hours/Week,
3 Credits, Total Marks 100 (Attendance=5, Continuous Assessment=25, Final exam=70),Year 4, Term 1
Rationale: Artificial Intelligence (AI) is a flourishing research field that is one of the driving forces of
today's economy and as such is having increasing impact on our way of living. Artificial intelligence
studies how computers can be made to behave intelligently. In this course we'll cover theoretical and
practical approaches to AI, with topics to include search, game playing, knowledge representation, logic,
uncertainty and decision-making systems. This course also introduces students with the Machine learning
algorithms. Machine learning is a specific subset of AI in which machine can learn by its own without
being explicitly programmed.
Course Objectives:
• Formulate search problems and implement search algorithms using admissible heuristics.
• Formulate constraint satisfaction problems and find solutions using constraint graphs.
• Describe games as adversarial search problems and implement optimal and efficient solutions.
• Obtain theoretical and practical knowledge about principles for logic-based representation and
reasoning.
• To understand natural language processing and to learn how to apply basic algorithms in this field.
• Formulate nondeterministic search as Markov decision processes and solve the Bellman equations in
reinforcement learning contexts.
• Formulate Bayes' nets for stochastic problems and use them to solve inference problems.
• Solve temporal applications using hidden Markov models and filtering algorithms.
• Understand the applications of Fuzzy set theory and design Fuzzy controllers.
• Define the machine learning problems and implement simple algorithms including Naive Bayes,
Neural Networks and Support Vector Machine.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Question bank,
Previous questions.
Lesson Plan (as per week):
Course Outcomes (at the end of the Teaching Learning Assessment
Week

Contents lesson, student should be able to) Strategy Strategy

(activities directed to (How they are
achieve outcomes) developed)
1. Introduction to AI: • Know about the history of AI Lecture and discussion Answer basic
History of AI, Views research; with detailed questions, quizzes,
of AI, Turing Test, • Understand the views, information about the Homework,
Intelligent Agents objectives and principles of course, including the exams.
AI; objectives, course
• Explain the architecture, outcomes,
properties and types of AI [Link]
agents/systems; wise lecture delivery.
• Differentiate between AI and
Non-AI systems.

173
2. Search: State Space • Formulate problems, such as Lecture and discussion, Answer basic
Search, Uninformed puzzles as State Space Search showing programming questions, quizzes,
search algorithms problems; solutions of simple Homework,
• Learn the ways of obtaining problems to reinforce exams.
brute-force solution of such the theoretical
problems by using un- understandings.
informed search techniques;
• Choose the appropriate
algorithm for different types

of problems

3. Informed search • Learn to solve optimization Lecture and discussion, Answer basic
techniques: A* and problems using different showing programming questions, quizzes,
Greedy Best First informed search techniques; solutions of simple Homework,
Search, Designing • Design admissible heuristics problems to reinforce exams.
Heuristics, Hill for finding optimal solutions the theoretical
Climbing Search, faster; understandings.
Simulated Annealing, • Understand Constraint
Constraint Satisfaction Satisfaction Problems and
Problems, Planning Local Search Problems;
problems • Realize the techniques and
algorithms to solve Constraint
Satisfaction Problems and
Local Search Problems.
4. Game playing: Two • Use minimaxing algorithm to Lecture and discussion, Answer basic
player zero sum design AI for two player zero– Visual simulation, questions, quizzes,
games, Minimaxing sum games (i.e. Chess); showing programming Homework,
Algorithm, Alpha-beta • Understand the utility of solutions of related exams.
pruning alpha-beta pruning technique problems to reinforce
for increasing the the theoretical
effectiveness of such AI. understandings.
5. Knowledge • Represent knowledge of a Lecture and discussion, Answer basic
Representation: KR domain formally using demonstrating related questions, quizzes,
Frameworks, Semantic different KR frameworks; problems Homework,
Nets, Introduction to • Design, implement and apply exams.
Logical reasoning a knowledge-based system,
andunderstand the limitations
and complexity of reasoning
algorithms.
6. Logic: Propositional • Understand and be able to Lecture and discussion, Answer basic
and Predicate Logic, explain and illustrate the showing programming questions, quizzes,
First Order Predicate meaning of given logical solutions of related Homework (word
Logic, Prolog formulas, to translate such problems to reinforce size expansion,
formulas into English and the theoretical memory location
vice-versa; understandings. expansion),
• Be able to use the resolution exams.
proof system in propositional
logic and in predicate logic;
• Learn to use Prolog language
to solve FOPL problems

174
7. Natural Language • Apply basic algorithms for
Processing: NLP;
Introduction, history • Get acquainted
of NLP, Natural withunderlying computational
language properties of natural
understanding: languages;
semantic • Conceive basics of speech
representation, recognition and speech
inference and synthesis techniques;
knowledge
representations.
HMM and Speech
Recognition: Speech

Recognition
Architecture,
Overview of
HMM, A* decoding
8. Uncertainty: • Understand the probabilistic Lecture and discussion, Answer basic
Reasoning under principles of reasoning under Visual simulation, questions, quizzes,
uncertainty, Bayes’ uncertainty; showing solutions of Homework,
Rule, Bayesian Net, • Have insight into algorithms related problems to exams.
Dempster-Shafer for probabilistic reasoning in reinforce the
Theory Bayesian networks; theoretical
• Have insight into the pros and understandings.
cons of learning models
versus using expert
knowledge;
• Using Bayesian Network and
Dempster-Shafer Theory to
solve problems involving
uncertainty
9. Fuzzy Logic: Crisp • Understand the concepts of Lecture and discussion, Answer basic
vs Fuzzy Set Theory, fuzzy sets; Visual simulation, questions, quizzes,
Fuzzy controller, • Knowledge representation showing solutions of Homework,
Fuzzification, using fuzzy rules, related problems to exams.
Inference rules and approximate reasoning, fuzzy reinforce the
Defuzzification inference systems, and fuzzy theoretical
techniques logic control and other understandings.
machine intelligence
applications of fuzzy logic;

175
 10. Markov decision • Learn about sequential Lecture and discussion, Answer basic
process: Stochastic decision making in a Visual simulation, questions, quizzes,
Processes and Finite stochastic environment; showing programming Homework,
Horizon MDPs, • Model engineering problems solutions of related exams.
Infinite Horizon as Markov Decision Process problems to reinforce
Discounted (MDP) and study the tools and the theoretical
MDPs,value iteration, techniques to solve these understandings.
policy iteration, linear MDPs.
programming
methods, and
applications
Hidden Markov
Models
11. Introduction to • Understand the concepts and Lecture and discussion, Quizzes,
Neural Networks: architecture of neural Visual simulation, Homework,
History and concepts networks and connectionist showing programming exams.
of Artificial Neural models; solutions of related
Networks (ANN), • Identify and describe the problems to reinforce
Models of ANN, mathematical elements, the theoretical
Learning algorithms characteristics and behaviors understandings.
of different types of neural
networks;
• Design, train, use and analyze
neural networks for practical
purposes.
12. Backpropagation • Understand the architecture of Lecture and discussion, Answer basic
Network: Backpropagation Network; Visual simulation, questions, quizzes,

Architecture of • Realize the concept of showing programming Homework,

Backpropagation Gradient Descent Error solutions of related exams.
Network, Learning in correction technique; problems to reinforce
Backpropagation • Design, train, use and analyze the theoretical
Network, Gradient Backpropagation networks for understandings.
Descent Learning practical purposes.
13. Recurrent Neural • Understand the architecture of Lecture and discussion, Exercise the
networks: Structure Recurrent Neural Network; Visual simulation, answering
of RNN, LSTM, • Realize the methods of showing programming methods in final
Learning in RNN learning in RNNs; design, solutions of related exam.
Support Vector train, use and analyze RNN problems to reinforce
Machine (SVM) for practical purposes; the theoretical
• Understand the basic concept understandings.
and application of SVM for
classification problems.

Recommended Books:
1. Artificial Intelligence: A Modern Approach by Stuart J. Russel and Peter Norvig, Pearson.
2. Introduction to Artificial Intelligence and Expert System by D. W. Patterson,Prentice-Hall.
3. Prolog Programming for Artificial Intelligence by Bratko, Addison-Wesley.

COURSE CODE: CSTE 4104, COURSE TITLE: ARTIFICIAL INTELLIGENCE AND NEURAL
176
 NETWORKS LAB

Course Code: CSTE 4104, Course Title: Artificial Intelligence and Neural Networks Lab, 3
Hours/Week, 1.5 Credits, Total Marks 100 (Class Attendance=10, Internal Evaluation/Observation =
70, Final Viva-voce =20),Year 3, Term 2
Rationale: This course accompanies the theoretical course CSTE 4103, where various AI concepts are
discussed. In this course, the student will try to programmatically solve various AI problems on some
selected topics. They will be introduced to new programming languages and frameworks for AI along
the way. In each topic, solutions for a few sample problems will be demonstrated to better grasp the
techniques and algorithms. Then their understanding will be tested using assignments and home tasks.
Course Objectives:
• Reinforce the concept of various AI concepts learnt in theory lectures.
• Get acquainted to various AI tools like programming languages and frameworks.
• Get firsthand experience on how to implement learnt algorithms in suitable programming languages.
• Solve search, planning, reasoning, assertion, prediction, classification and regression problems using
appropriate AI tools;
• Learn to design, train and use machine learning systems.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Codeblocks
IDE, MATLAB, Tensorflow, CNTK, Keras, Theano Neural Network frameworks, Python.
Lesson Plan (as per week):
Course Outcome (at the end of the Teaching Learning Assessment
Contents lesson, student should be Strategy(activities Strategy(How
Week

able to) directed to achieve they are

outcomes) developed)

1-2 State Space Search: • Reinforce the concept of Discussion, Home task,
Uninformed search: various uninformed Demonstration of assignments,
Implementing BFS, DFS, search techniques learnt sample programing Lab exam
DLS, IDS, and in theory lectures by codes to guide students
Bidirectional search for analyzing and coding
solving - solutions of various
• Water-jug problem related problems;
• 8-puzzle problem,
• Missionaries and
Cannibals problem
3 Informed search: • Reinforce the concept of Discussion, Home task,
Rewrite 8 puzzle problem various informed search Demonstration of assignments,
solution using heuristics techniques learnt in sample programing Lab exam
and implementing - theory lectures; codes to guide students
• Greedy best first search • Design admissible
• A* heuristic search heuristics for informed
Use heuristic search for search problems;
path finding problems

177
4 Constraint satisfaction • Reinforce the concept of Discussion, Home task,
and Local search various local search Demonstration of assignments,
problems: techniques learnt in sample programing Lab exam
Solve local search problems theory lectures; codes to guide students
(i.e. n-queens problem) • Write AI for solving
using: constraint satisfaction
• Hill-climbing, and local search
• Simulated annealing, problems;
• Local beam search,
• Genetic algorithm
5 Minimaxing algorithm: • Reinforce the concept of Discussion, Home task,
Write a two player zero minimaxing and alpha- Demonstration of assignments,
sum games AI program (i.e. beta pruning techniques sample programing Lab exam
Tic-Tac-Toe/ Chess) using learnt in theory lectures; codes to guide students
- • Write AI for two player
• Minimaxing algorithm zero sum games;
• Minimaxing with alpha-
beta pruning
6-8 Prolog: • Express domain Discussion, Home task,
Solve reasoning, deduction knowledge in FOPL in Demonstration of assignments,
and assertion problems prolog; sample programing Lab exam
using Prolog (SWI-Prolog • Write prolog programs codes to guide students
IDE): for reasoning, assertion
• Express family tree and and deduction problems;
relationships,
• Solve Mark Twain’s
puzzle,
• List manipulation,
• Solve Einstein’s puzzle
9 Bayesian network: • Reinforce the concept of Discussion, Video Home task,
Implement Bayesian Bayesian Network learnt tutorial, Demonstration assignments,
Network to design a in theory lectures; of sample programing Lab exam
reasoning/ prediction • Design simple prediction codes to guide students
system (i.e. Disease- systems using Bayesian
Symptom Checker) using Network;
MATLAB/C++

178
 10- Neural Network: • Reinforce the concept of Discussion, Video Home task,
13 Learn about Neural Neural Networks learnt tutorial, Demonstration assignments,
Network frameworks: in theory lectures; of sample programing Lab exam
Tensorflow, CNTK, Keras, • Get firsthand experience codes to guide students
Theano; with available NN
Setting up and using frameworks;
Tensorflow and Keras on • Setup environment to
Python environment for train basic systems;
learning basic systems:
• AND/OR gate using
SLP,
• XOR gate using MLP
and Backpropagation
learning,
• Designing and training a
CNN for English
alphabet OCR;

COURSE CODE: CSTE 4105, COURSE TITLE: COMPILER CONSTRUCTION

Course Code: CSTE 4105, Course Title: Compiler Construction, 3 Hours/Week, 3 Credits, Total
Marks 100 (Attendance=5, Continuous Assessment=25, Final exam=70), Year 4, Term 1
Rationale: The purpose of this course is to provide an understanding about the phase of compiler and
to develop skill for constructing compiler.
Course Objectives:
➢ To introduce the major concept areas of language translation and compiler design.
➢ To explore the principles, algorithms, and data structures involved in the design
and construction of compilers.
➢ To enrich the knowledge in various phases of compiler ant its use, code
optimization techniques, machine code generation, and use of symbol table.
➢ To extend the knowledge of parser by parsing LL parser and LR parser.
➢ To provide practical programming skills necessary for constructing a compiler.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Question bank,
Previous questions.
Lesson Plan (as per week):
Course Outcome (at the end Teaching Learning Assessment
Contents of the lesson, student Strategy (activities Strategy (How
Week

should be able to) directed to achieve they are

outcomes) developed)
1 Introduction: Compilers & describe the design of a Lecture and Answer
Translators, Structure of compiler including its discussion basic
Compiler, phases of phases and components. with questions,
Compiler, Compiler writing detailed quizzes,
tools, information about Homework,
Programmin the exams.
g languages: course,
including
the
objectives,
course outcomes,
179
 examinations. Topic
wise
lecture
delivery.

2 Introduction: Lexical & Understand different Lecture and problem Answer

Syntactic structure of a translation technique discussion about basic
Language, Data elements, and symbol extraction lexical analyzer. questions,
Data structures, Operators, technique. quizzes,
Assignments, Program Homework,
Units, Data environments. exams.
Parameter transmission,
storage
Management
,
Lexical Analyzer.
3 Syntax Analysis: The role Learn basic parsing Lecture and Answer
of Parser, Top-down tools and its discussion on basic
parsing, predictive Parsers. applications. Learn parsing questions,
top-down parsing. technique. quizzes,
Homework,
exams.
4 Syntax Analysis: Bottom- Learn different Lecture and Exercise
up parsing. L.R. Parsers bottom-up parsing and discussion on with various
(SLR, CLR & LALR), implementations. bottom-up mathematical
Implementation of LR parsing problems.
Parsers. technique: (SLR)
5 Syntax Analysis: Bottom- Learn different bottom- Lecture and Class Test
up parsing. L.R. Parsers up parsing and problem solving on 1(topics of the
(SLR, CLR & LALR), implementations. bottom-up parsing week’s 1-4)
Implementation of LR technique:(CLR
Parsers. and
LALR)
6 Syntax Directed Understand code Lecture and Answer basic
Translation: representation and its discussion with questions,
Interme notations. problems about quizzes,
diate
Code, Postfix
notation,
7 Syntax Learn to translate Lecture and Answer basic
Directed productions into discussion about questions,
Translation: Translation semantic rules and to semantic rules quizzes,
of Assignment statements. evaluate the order of Homework (word
Boolean operations. size expansion,
expressi memory location
ons, statements that alter expansion),
the flow of control. Array exams.
references in arithmetic
expressions, Procedure
Calls, Declarations, and
Case Statements.
8 Symbol Tables: Contents, Learn symbol table Lecture and Answer basic
Data structures for symbol components, operations discussion on scope questions,
tables, representing scope and its scope. management. quizzes,
information.

180
9 Symbol Tables: Error Learn different error Lecture and Class Test
detection and Recovery: detection and recovery discussion on error 2(topics of the
Error handling. Lexical- technique. detection. weeks5-8)
phase, Syntactic phase and
semantic phase.
10 Code Generation: Issues in Understand run-time Lecture and Answer basic
Code Generation, Target environment and its tasks discussion on code questions,
Machine, Runtime storage in compiler. generation. quizzes,
management.
11 Code Generation: Basic design & conduct Lecture and Quizzes,
block and flow graphs, experiments discussion and code Homework,
Simple code generator, for generation from flow exams.
register allocation and Intermediate Code graph.
assignment. Generation in compiler.
12 Code Generation: DAG, Understand internal code Lecture and Class Test
Peephole Optimization, representation and code discussion on DAG. 3(topics of the
Generation Code from generation. weeks9-12)
DAG’s. Three address
codes, quadruples, triples.
13 Code learn the new code Lecture and Exercise the
optimiza optimization techniques discussion on code answering
tion: Principle source of to improve the optimization. methods in final
optimization, optimization performance of a program exam.
of basic books, blocks, in terms of speed &
loops in Flow graphs, space.
Data-Flow analysis, code
improving
transformations,
alias, Data flow algorithms
Recommended Books:
1. Principles of Compiler Design by Alfred V. Aho and Jeffrey D. Ullman, Addison-Wesley.
2. Compiler design in C by A.J. Holub, Prentice-Hall .
3. Theory and Practices of Compiler Writing by Trembly and Sorensen, McGraw-Hill
4. Compiler Construction by Niklaus wirth, Addision-Wesley.

181
 COURSE CODE: CSTE 4106, COURSE TITLE: COMPILER CONSTRUCTION LAB

Rationale: This course is aimed to deal with the practical implementation process of different phases
of modern compiler. It will also help to understand the detail concept of each compiler design
processes.
Course Objectives:
➢ To understand the basic concept of lexical analyzer and its operation.
➢ To understand the application of regular expression and grammar in language recognition.
➢ To understand the use of Lex, flex and other lexical analyzer generation tools.
➢ To understand the implementation of parser and code generator in compiler.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, C/C++
compiler, LEX & YACC Tools.
Lesson Plan (as per week):
Course Outcome (at the end Teaching Assessment
Contents of the lesson, student Learning Strategy (How
should be able to) Strategy they are
(activities developed)
directed to
Week

achieve
outcomes)
1- Write a c program to find number To understand the Discussion and -Home task
2 of characters, number of alphabets, basic operations of practice. -Quiz
number of digits, number of white lexical analyzer.
spaces and number of new lines
from a file.
Write a c program to find
comments in a given file or text.
Write a program that shows
whether a variable is valid or not
3- Write a c program to find Implement the Lecture and Answer basic
5 keywords in a program. fundamental Discussion with questions,
Write a c program to find different operation of problems. quizzes,
types of variables. compiler first phase. Homework,
Write a c program to find numbers exams.
in .c file.
Write a C program to simulate
lexical analyzer for validating
operators.
Write a c program to find operator
precedence parsing for an
expression like ((x+y*z) +p/q) +z
6 Write a c program to validate Understand string Lecture and Quiz 1 (Topic of
string by a given regular validation concept in discussion about the 1-5 weeks)
expression like a*b+, (a|b)*abb, compiler design and regular
(ab)*aba. its applications. expression and
Write a C program to check grammars.
whether a string belong to a
grammar or not

182
7 Apply Lex & YECC Lecture and Homework
Implement the lexical analyzer tool to implement discussion on
using JLex, flex or other lexical lexical analyzer. Lex & YACC
analyzer generating tools. tools
8- Write a c program to eliminate left Implement grammar Lecture and Quiz 2 (Topic of
9 recursion in a production. recursion discussion with the 6-7 weeks)
Write a c program to identify first elimination and first- problems
and follow of a grammar. follow identification.
10 Write a c program to construct Implement parsing Lecture and Homework
parsing table for a predictive table and discussion on
parser. Write a c program to LL(1) its parsing
parsing for a given input application to parse
expression.

11 Write a C program to implement Implement semantic Lecture and Homework

Program semantic rules to rules to recognize discussion about
calculate the expression that takes expression. semantic rules
an expression with digits, + and *
and computes the value.
12 Write a C program to generate Generate machine Lecture and Answer basic
machine code from the abstract code from the syntax discussion on questions,
syntax tree generated by the tree. code Homework
parser. generation. Quiz 3 (Topic of
the 8-12 weeks)
13 Final Lab Exam (Job and Viva)

183
COURSE CODE: CSTE 4108, COURSE TITLE: SOFTWARE DEVELOPMENT PROJECT

184
 COURSE CODE: CSTE 4109, COURSE TITLE: CRYPTOGRAPHY AND INFORMATION
SECURITY

Course Code: CSTE 4109, Course Title: Cryptography and Information Security, 3 Hours/Week, 3
Credits, Total Marks 100 (Attendance=5, Continuous Assessment=25, Final exam=70), Year 4, Term 1
Rationale: This course has been designed to provide the students an in-depth understanding of different
types of symmetric and public-key encryption-decryption technique for security in public network which
is fundamental to the students’ ability to become a successful network engineer.
Course Objectives:
➢ To provide students basics of Cryptography and Network Security.
➢ To give students a knowledge of standard algorithms used to provide confidentiality, integrity, and
authenticity.
➢ To understand the various key distribution and management schemes.
➢ To understand various protocols for network security to protect against the threats in the networks.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, PDF books, e-Tutorials, Question
bank, Previous questions.
Lesson Plan (as per week):
Course Contents Outcome (at the end of Teaching Learning Assessment
Week

the lesson, student Strategy (activities Strategy (How

should be able to) directed to achieve they are
outcomes) developed)
1. Overview of Cryptography: ➢ To introduce the Discussion on detailed Answering
Concept of Cryptography, basics of information about the basic questions,
Cryptanalysis, Brute-force Cryptography with its course, including the quizzes,
Attack. OSI Security importance in objectives, course Homework etc.
Architecture: Security Attacks, networking. outcomes, examinations.
Security Services, Security ➢ To learn in Lecture and discussion on
Mechanisms; Network detail about OSI the basics of
Security Model. security architecture. Cryptography and OSI
security architecture.
2. Symmetric Cryptosystem: ➢ To learn the Lecture and discussion on Answering
Symmetric Cipher Model, basics of a symmetric basics of symmetric basic questions,
Substitution Technique: Caesar cryptosystem. cryptosystem with a quizzes,
Cipher, Monoalphabetic ➢ To analyze the variety of substitution and Homework etc.
Cipher, Polyalphabetic Cipher, encryption-decryption transposition symmetric

Playfair Cipher, Hill Cipher; algorithm of a variety ciphers encryption-

Transposition Technique: Rail of substitution and decryption technique.
Fence Technique, Columnar Transposition Exercise on substitution
Transposition; Rotor symmetric cipher and transposition
Machines, Steganography. technique. symmetric ciphers
encryption-decryption
technique.

185
3. Block Ciphers & DES: Block ➢ To analyze the Detailed discussion on Answering
Cipher Principals, The Feistel popular DES block DES encryption- basic questions,
Cipher, Data Encryption cipher encryption- decryption technique with quizzes,
Standard (DES). DES decryption technique. examples. Homework etc.
Encryption, DES Decryption,
The Strength of DES,
Differential and Linear
Cryptanalysis of DES,
Diffusion, and Confusion.
4. AES: Basic Structure, ➢ To analyze the Detailed discussion on Answering
Primitive Operation, Inverse popular AES block DES encryption- basic questions,
Cipher, Key Expansion, cipher encryption- decryption technique with quizzes,
Rounds, Inverse Rounds, decryption technique examples and introduce Homework etc.
Simplified AES; Double DES, and some DES with DES extension
Triple DES. extensions. techniques.
5. Block Cipher Modes of ➢ To get a good Lecture and discussion on CT-1 (topics of
Operation: Electronic understanding of different types of block the week’s 1-4)
Codebook Mode (ECB), different types of cipher modes of
Cipher Block Chaining Mode block cipher modes of operation.
(CBC), Cipher Feedback Mode operation.
(CFB), Output Feedback Mode
(OFB), Counter Mode (CTR).
6. Stream Cipher and RC4; ➢ To understand Lecture and discussion on Answering
Placement of Encryption the stream cipher stream cipher technique, basic questions,
Function: Link versus End-to- technique. to identify potential quizzes,
End Encryption, Traffic ➢ To decide where locations where Homework etc.
Confidentiality, Key encryption function encryption function
Distribution Scenario, should deploy in should deploy in networks
Automatic Key Distribution, networks. and symmetric key
Decentralized Key ➢ To learn the management procedures.
Distribution. procedures of
symmetric key
management and
distribution.
7. Public Key Cryptosystems: ➢ To learn the Discussion on the basics Answering
Requirements for Public Key basics of the public of public key basic questions,
Cryptography, Principles of key cryptosystem. cryptosystem and detailed quizzes,
Public Key Cryptosystems, ➢ To analyze the discussion on RSA Homework etc.
RSA Algorithms, Security of RSA public key algorithm with examples.
RSA. algorithm.
8. Key Management: ➢ To learn the Lecture and discussion on Answering
Distribution of Public Keys, procedures of public public key management basic questions,
Diffie-HellmanKey key management and procedure with a detailed quizzes,
Exchange; Authentication distribution including analysis of Diffie- Homework etc.
Requirements, Authentication Diffie-Hellman key Hellman key exchange
Functions, Message exchange technique. technique and discussion
Authentication Codes. ➢ To get a well on message authentication
understanding of technique.
message
authentication.

186
 9. Hash Functions; Digital ➢ To learn in Lecture on different CT-2 (topics of
Signature Standards: RSA detail about digital approaches to digital the week’s 5-8)
Approach, DSS Approach. signature. signature.
10. Network Security: Electronic ➢ To get a well Lecture and discussion on Answering
Mail Security: Pretty Good understanding of network security, E-mail basic questions,
Privacy, S/MIME. network security, E- security and IP security. quizzes,
IP Security: Architecture, mail security, and IP Homework etc.
Authentication Header, security.
Encapsulating Security
Payload, Combining Security
Associations, Key
Management.
11. Web Security: Web Security ➢ To familiar with Lecture and discussion on Answering
Considerations, Secure Socket Web security. web security. basic questions,
Layer and Transport Layer quizzes,
Security, Electronic Homework etc.
Translation.
12. Firewalls: Firewall Design ➢ To learn about Discussion on the security CT-3 (topics of
Principles, Packet-Filtering security issues in issues in Firewall, Router, the week’s 9-
Router, Application-Level Firewall, Router, and and Gateway. 12)
Gateway, Circuit-Level Gateway.
Gateway, Firewall
Configurations, Trusted
Systems.
13. Review topics and Final exam ➢ To learn about Students will be asked to Exercise the
preparation. the latest trends and answer the questions answering
the better answering orally on previous lectures methods in final
methods in the final and review the contents of exam.
exam. the course.
Discussion on the better
answering methods for the
final examinations.

Recommended Books:
1. Cryptography and Network Security Principles and Practice by W. Stallings,Prentice Hall.
2. Cryptography and Network Security by BehrouzForouzan, McGraw-Hill.
3. Fundamentals of Computer Security Technology by Edward Amoroso, Prentice Hall.

COURSE CODE: CSTE 4110, COURSE TITLE: CRYPTOGRAPHY AND INFORMATION

SECURITY LAB

Course Code: CSTE 4110, Course Title: Cryptography and Information Security Lab, 2
Hours/Week, 1 Credits, Total Marks 100 (Class Attendance=10, Internal Evaluation/Observation = 70,
Final Viva-voce =20), Year 4 Term 2
Rationale: This course has been designed to provide the students with practical knowledge of different

187
security techniques which is fundamental to the students’ ability to become a successful network
engineer.
Course Objectives:
➢ Be exposed to the different cipher techniques.
➢ Learn to implement different Substitution and Transposition techniques.
➢ Understand the Digital Signature Standard.
➢ Learn to use network security tools like GnuPG, KF sensor, Net Strumbler.
➢ Be familiar with the intrusion detection system.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, pdf books, e-Tutorials, Lab equipment
and Manuals.
Lesson Plan (as per week):
Course Contents Outcome (at the end of Teaching Learning Assessment
Week

the lesson, student Strategy (activities Strategy (How

should be able) directed to achieve they are
outcomes) developed)
1-2. ➢ Find out the corresponding ➢ To implement Discussion and Answer basic
Caesar cipher, the Caesar cipher, practical questions and
Monoalphabetic Cipher and the Monoalphabetic implementation of quizzes.
Polyalphabetic Cipher of a Cipher , Caesar cipher,
plaintext. And then find the and Monoalphabetic
original text from the Polyalphabetic Cipher Cipher ,
ciphertext. Substitution and
techniques. Polyalphabetic
Cipher.
3-4. ➢ Find out the corresponding ➢ To implement Discussion and Answer basic
Playfair Cipher and Hill the Playfair cipher and practical questions,
Cipher of a plaintext. And Hill Cipher implementation of quizzes, and
then find the original text Substitution Playfair cipher and homework.
from the ciphertext. techniques. Hill Cipher.
5-6. ➢ Find out the corresponding ➢ To implement Lecture and Answer basic
Transposition Cipher of a the Transposition and Discussion with questions and
given message. Then perform Double Transposition practical exams.
the reverse operation to get techniques. implementation of
the original plaintext. the Transposition
➢ Find out the corresponding Cipher.
double Transposition Cipher
of a given plaintext. Then
perform the reverse operation
to get the original plaintext.
7. ➢ Implement the encryption and ➢ To implement Discussion with Answer basic
decryption of 8- bit data using the encryption and practical questions,
‘Simplified DES Algorithm’ decryption techniques implementation of quizzes, and
(created by Prof. Edward of the DES algorithm. DES encryption and homework.
Schaefer) in ‘C’. decryption techniques.
8. Implement the ➢ To implement Discussion and Answer basic
‘Linear Congruential the algorithms for practice questions and
Algorithm’ to generate 5 generating pseudo- quizzes.
pseudo-random numbers in random numbers and
‘C’. the GCD of an array of
Implement the Euclid integers.
Algorithm to generate the GCD of
an array of 10 integersin ‘C’.
188
9. ➢ Encrypt the plaintext ➢ To implement Discussion with Answer basic
message using the RSA the RSA algorithm for practical questions,
algorithm. Then perform the encryption and implementation of quizzes, and
reverse operation to get decryption. RSA encryption and exams.

original plaintext. decryption techniques.

10. ➢ Implement the ➢ To design the Discussion and Answer basic
Signature Scheme - Digital signature scheme by practice. questions and
Signature Standard. applying Digital quizzes.
Signature Standard.
11. ➢ Demonstrate how to ➢ To use different Demonstration with Answer basic
provide secure data storage, open source tools for e-Tutorials. questions and
secure data network security and quizzes.
transmission, and create analysis.
digital signatures (GnuPG)

12 ➢ Demonstrate an ➢ To demonstrate Demonstration on Answer basic

intrusion detection system the intrusion detection intrusion detection questions,
(IDS) using any tool (Snort or system. with e-Tutorials. quizzes,
any other) homework, and
➢ Perform other exams.
experiments relevant to this
course.
13 Final Lab Exam (Job and Viva)

COURSE CODE: CSTE 4111, COURSE TITLE: INDUSTRIAL TRAINING

Course Code: CSTE 4111, Course Title: Industrial Training, 2 Hours/Week, 2 Credits, Total Marks
100, Year 4, Term 1
Rationale: This course has been designed to develop the students’ ability to realize project and
research methodologies. [This is a 5-credit course which has two parts: one in Year 4, term 1, credit 2,
and the other in Year 4, term 2, credit 3]
Course Objectives:
➢ To study a field of interest under a supervisor and to find a specific problem that can be solved for
a thesis or a project work to be carried out in the 4 th year.
➢ To get a clear idea of the related work/project accomplished by the different authors.
➢ To learn project/research methodologies that propel the students to do good project/research work.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, PDF books, e-Tutorials, Internet,
Printer, photocopier, Device manual (if necessary), Journals, and other necessary resources from the
Internet.
COURSE CONTENTS OUTCOME
Study the problems related to Computer Science and Students should be able to
Telecommunication Engineering. [Every 1. Realize the existing research/project work.
project/Thesis work will be continued to the 2nd term 2. Find out a problem from a research paper or
of the 4th year.] a project work.
3. Try to solve the problem

189
 COURSE CODE: CSTE 4125, COURSE TITLE: PROJECT AND THESIS

Course Code: CSTE 4125, Course Title: Project and Thesis, 2 Hours/Week, 2 Credits, Total Marks
100, Year 4, Term 1
Rationale: This course has been designed to develop the students’ ability to realize project and
research methodologies. [This is a 5-credit course which has two parts: one in Year 4, term 1, credit 2,
and the other in Year 4, term 2, credit 3]

Course Objectives:
➢ To study a field of interest under a supervisor and to find a specific problem that can be solved for
a thesis or a project work to be carried out in the 4 th year.
➢ To get a clear idea of the related work/project accomplished by the different authors.
➢ To learn project/research methodologies that propel the students to do good project/research work.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, PDF books, e-Tutorials, Internet,
Printer, photocopier, Device manual (if necessary), Journals, and other necessary resources from the
Internet.
COURSE CONTENTS OUTCOME
Study the problems related to Computer Science and Students should be able to
Telecommunication Engineering. [Every 4. Realize the existing research/project work.
project/Thesis work will be continued to the 2nd term 5. Find out a problem from a research paper or
of the 4th year.] a project work.
6. Try to solve the problem

190
 COURSE CODE: CSTE 4201, COURSE TITLE: DIGITAL IMAGE PROCESSING

Course Code: CSTE 4201, Course Title: Digital Image Processing, 3 Hours/Week, 3 Credits, Total
Marks 100 (Attendance=5, Continuous Assessment=25, Final exam=70), Year 4, Term 2
Rationale: This course has been designed to introduce the fundamental concepts of image processing
to undergraduate-level students. The idea is to make them familiar with the basic image processing
tools, image filtering, and image compression.
Course Objectives:
➢ Make a foundation of the basic knowledge (both theoretical and practical) on Digital Image
Processing.
➢ Provide a rigid concept of the underlying mathematics of basic image processing tools.
➢ Gain the practical experience of digital image processing on real-world problem using
MATLAB.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, PDF books, e-Tutorials.
Lesson Plan (as per week):
Course Outcome (at the end of the Teaching Learning Assessment
Week

Contents lesson, the student should Strategy(activities Strategy(How

be able to) directed to achieve they are
outcomes) developed)
1 Digital Image Explain the basic concept Give a detailed Conduct one
Fundamentals, Simple of image and the model of course plan, MCQ test to
Image Model, Sampling image processing. Get the objectives, possible justify the basics
and Quantization, Basic idea about sampling, outcomes, and at the last lecture
Relationship between quantization, and the assessment plan for of the week.
Pixels, Image Geometry; details of pixels. the whole course.
Understand the basic Deliver the topic-
geometry of image wise lectures in
processing. detail to provide
deep concepts about
image processing.
2 Fourier Transform, Explain the basics of Provide the lecturers Home assignment
Discrete Fourier Fourier and the discrete on the desired topics. to solve any
Transform; Fourier transform. problem using
fourier transform.

3 Properties of 2D Fourier Understand the properties Provide the lecturers Conduct a class
Transform, Fast Fourier of 2-D Fourier and Fast on the desired topics. test-1 (week 1-3).
Transform, and Fourier Transform. Get the
Image Transform. fundamentals of image
transform.
4 Background of Image Get the basic idea about the Lecture and Exercise with
Enhancement, necessity of image discussion with various image
enhancement by Point- enhancement and the problems. Provide enhancement
Processing, Spatial procedure to perform the some practical techniques.
Filtering; same. examples of image
enhancement.

5 Enhancement in Understand the principles Lecture and Exercise on color

Frequency Domain, Color of color image processing discussion on the image processing.
Image Processing. desired topics.

191
6 Degradation Model, Explain the basics and Lecture and Give an
diagonalization of necessity of image discussion about assignment on
circulant and block- restoration. restoration and image restoration.
Circulant Matrices. diagonalization.
7 Algebraic Approach to Understand the use of Lecture on desired Conduct a class
Restoration, Inverse various filters in image topics. test-2 (week 4-7).
Filtering, Geometric processing.
Transformation
8 Principle of Mathematical Explain the basics of Lecture on A sudden test to
Morphology, Erosion and morphological image. morphology and its justify the class
Dilation in the Euclidean use in image performances.
Space, processing.
9 Closings and Explain the basics of Lecture on desired Answer basic
Openings, Grayscale morphological image. topics. questions,
Morphology, Links quizzes,
between Links and Sets, Homework, and
Grayscale Morphological exams.
Transformations,
10 Detection of Understand the basics of Lecture on image Answer basic
Discontinuities, Edge image segmentation. segmentation. questions,
Linking and Boundary quizzes,
Detection, Thresholding, Homework,
exams.
11 Region-Oriented Explain the basics of Lecture on image Quizzes,
Segmentation, Use of morphological image segmentation. Homework, and
Motion in Segmentation. processing exams.
12 JPEG Compression Understand the basics of Lecture on image Conduct a class
Technique, MPEG image compression. compression. test-3 (week 8-
Compression Technique, 12).
Motion Estimation,
Motion Vector
Generation.
13 Review topics and Final Learn about the latest Lecture and Exercise the
exam preparation. trends and better discussion on answering
answering methods in the research related issue methods in
final exam. of digital image t h e final exam.
processing.

COURSE CODE: CSTE 4202, COURSE TITLE: DIGITAL IMAGE PROCESSING LAB

Course Code: CSTE 4202, Course Title: Digital Image Processing Lab, 2 Hours/Week, 1 Credit,
Total Marks 100 (Class Attendance=10, Internal Evaluation/Observation = 70, Final Viva-voce
=20), Year 4, Term 2
Rationale: This lab course aims to introduce the principles of digital image processing and to
develop students’ knowledge from basic signal processing techniques to advanced image processing
and analysis systems in a practical environment.

192
Course Objectives:
➢ Learn basic image processing theories and their real-world applications, including printing,
medical diagnosis, telecommunications, the internet, and digital entertainment.
➢ Design and conduct digital imaging experiments and analyze and interpret image and video
data, as evidenced by computer projects.
➢ Identify, formulate, and solve engineering problems using digital imaging techniques. An
example is how to scan, compress, analyze, and index old newspaper images so that one can
retrieve a piece of old news easily through the internet.
➢ Learn how to use image processing-related tools, including compilers, and hardware and
software for image acquisition, storage, and conversion.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, PDF books, e-Tutorials.
Lesson Plan (as per week):
Course Outcome (at the Teaching Learning Assessment
Week

Contents end of the lesson, Strategy (activities Strategy(How

the student should directed to achieve they are
be able to) outcomes) developed)
1 To familiar about the tools for gain significant Lecture and Answer basic
digital image processing. experience in discussion with questions.
image detailed information
processing. about the lab course,
including the
objectives, course
outcomes, lab
examinations, and
evaluation method.
2, Add any two given images and Reflect a basic Through lecture, Neatness,
3, write the result into a file in BMP understanding of laboratory, online organization,
4 format. image processing. learning, computer completeness,
Perform the subtraction of two projects, and out- and individually
given BMP images. Save the output of-class assignments. written lab
image in a BMP file. Input images reports are due at
may be of different sizes. the beginning of
Draw a histogram for any image, the lab period.
equalize the histogram, and redraw The respected
the equalized image. teacher will be
You are given a blurred image. evaluated during
Make it smooth using a smoothing the lab period.
filter (filter size may be varied).
5, You are given an image; make it a Reflect a basic Through lecture,
6, negative image. Save the output understanding of laboratory, online
7 image in a BMP file. image processing. learning, computer
You are given an image, and you projects, and out-
perform a log transformation. Save of-class assignments.
the output image in a BMP file.
Perform Point and Line Detection,

193
 8, You will be given a file of fixed- Reflect a basic Through lecture,
9, length binary strings, and you will understanding of laboratory, online
10, have compressed the file using image processing. learning, computer
11 Huffman coding. projects, and out-
You will be given a file of fixed- of-class assignments.
length binary strings, and you will
have compressed the file using
Truncated Huffman coding.
You will be given a file of binary
stream, you will have compressed
the file using ID run-length coding
in accordance with the given
length-code table

12 Submit a mini project in a group.

13 Final Lab Exam (Job, Quiz, and Viva)

Course Code: CSTE 4203, Course Title: Multimedia Communication

Course Code: CSTE 4203, Course Title: Multimedia Communication, 3 Hours/Week, 3 Credits, Total
Marks 100 (Attendance=5, Continuous Assessment=25, Final exam=70), Year 4, Term 2
Rationale: This course introduces technologies for multimedia processing, coding, and
communications. We will address how to efficiently represent multimedia data and how to deliver it over
a variety of networks. In the coding aspect, state-of-the-art compression technologies will be
presented. Emphasis will be given to state-of-the-art multimedia coding standards.
Course Objectives:
• Understanding the multimedia communications systems, applications, and basic principles, analysis
of the multimedia streaming.
• Learn about different types of multimedia file formats and their standards. Learning about different
multimedia file structures gives students the idea of how the designers of those standards tackled or
overcame various issues or problems
• Learn about popular multimedia software applications and try them firsthand.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, PDF books, e-Tutorials, Video tutorial,
Question bank, Previous questions.
Lesson Plan (as per week):
Course Outcomes (at the end of the Teaching Learning Assessment
Week

Contents lesson, students should be Strategy Strategy

able to) (activities directed to (How they are
achieve outcomes) developed)

194
1 Syllabus overview, • Get the basic outline and Lecture and Answer basic
course organization, overview of the course discussion with questions, quizzes,
and expectations contents; detailed information Homework, and
---- • Learn about different types about the course, exams.
of media; including the
Introduction to • Learn about different objectives, course
Multimedia transmission techniques outcomes,
Communication: Media for multimedia content; examinations, Topic
and Data-stream, wise lecture delivery.
Medium, Transmission
of multimedia contents.
Properties of multimedia
2 Coding: Codecs, • Realize the importance of Lecture and Answer basic
Encoding and Decoding coding and compression in discussion, Visual questions, quizzes,
techniques, RLE, DPCM, multimedia systems; simulation Homework, and
Entropy coding: • Learn about different exams.
Huffman coding, encoding algorithms used
Arithmetic coding, in multimedia file
Compression: Lossy standards.
and lossless compression • Learn about different
techniques, compression techniques

used in multimedia file

standards;

3 Introduction to Audio • Learn how audio is Lecture and Answer basic

coding: Properties of digitized, stored, and discussion, Visual questions, quizzes,
audio/sound, Digitizing reproduced/ outputted in simulation Homework, and
sound, DAC, Sound computers; exams.
quality standards, Need • Learn about uncompressed
for compression, audio standards;
Streaming audio, MIDI, • Realize why audio needs
Audio editing to be compressed for
applications: Audacity transmission.
•

195
4 MP3 Standard: History, • Learn about the history of Lecture and Answer basic
Advantages of MP3, the MPEG standard. discussion, Visual questions, quizzes,
Psychoacoustics, • Learn about file structure simulation Homework, and
Perceptual coding, MP3 of MP3, and factors for exams.
file structure, Encoding such design consideration;
in MP3, MDCT and • Learn about perceptual
Windowing, Q, coding and how human
Decoding in MP3, perceptual limitations are
Streaming of MP3 exploited in MP3
compression;
• Learn about the encoding
and decoding pipeline in
the MP3 standard.
• Learn about different
techniques used for
compression in JPEG;
5 Introduction to Image: • Learn about the difference Lecture and Answer basic
Image formats, Raster between raster and vector discussion, Visual questions, quizzes,
and vector formats, Use image formats; simulation Homework, exams.
cases of different • Learn about different
formats, Color spaces: image formats and their
RGB, CMYK, HSV, use cases;
YIQ, YUV, YCbCr and • Learn about different color
other color spaces, spaces and techniques for
Legacy TV video conversion between them;
standards, How digital • Learn about how common
camera works. How image capturing,
modern monitors work, manipulation, and
Color gamut, How to presentation devices work.
choose a monitor for
image/video editing;
Simple raster formats:
Bitmap, Raw image
format
Vector image formats:
Scalable Vector
Graphics (SVG),
Encapsulated PostScript

(EPS)
6 JPEG Standard: • Learn about the pipeline of Lecture and Answer basic
History, Advantages of JPEG encoding and discussion, questions, quizzes,
JPEG, Encoding in decoding; Showcasing Homework (word
JPEG, Decoding in • Learn about different MATLAB code for size expansion,
JPEG techniques used for JPEG encoding and memory location
compression in JPEG; decoding expansion), and
exams.

196
7 Other image formats: • Learn about other image Lecture and
Portable Network standards like PNG and discussion, Visual
Graphics (PNG) format, GIF; simulation
GIF format: Encoding • Realize how PNG standard
and decoding in GIF, was designed to be
LZW encoding, forward compatible;
Animation in GIF • Understand the
Image Editing compression in GIF and
applications: how animations can be
Photoshop/GIMP, encoded in the GIF file
Illustrator, etc. format;
• Learn about popular image
manipulation/editing
software/applications;
8 Introduction to Video: • Learn about the capture, Lecture and Answer basic
Capture and digitization storing, and presentation discussion, Visual questions, quizzes,
of video, Challenges in of digital video; simulation Homework, and
video streaming, Need • Learn why video needs to exams.
for video compression, be heavily compressed;
Common Video formats: • Learn about the different
MPEG-1, MPEG-2, video standards available.
MPEG-4, H.264 • Learn about the future of
(MPEG-4 AVC), H.265 video standards.
HVEC, MKV container
format, AVI, WMV
Video editing
applications
9 MPEG Standard: • Learn about different Lecture and Answer basic
History of MPEG, techniques used for discussion, questions, quizzes,
MPEG standards, compression in JPEG. Showcasing Homework, and
Encoding in MPEG-4: • Learn about Encoding and MATLAB code for exams.
Spatial and temporal decoding in MPEG MPEG encoding and
compression, Motion standard; Learn about decoding
compensation, Inter- MPEG-4 file structure and
frame encoding, CBR, inter-frame encoding;
VBR encoding,
Decoding in MPEG-4,
10 Animation: Introduction • Learn about traditional and Lecture and Answer basic
to animation, 2D/3D modern 2D/3D animation discussion, Visual questions, quizzes,
animation techniques: techniques; simulation, showing Homework, and
Key framing, motion • Learn about the making of exams.
capture, contemporary animation successful animation
Animation techniques; movies, showcasing
software/applications, • Learn about the popular animation
VFX simulation of physics in software/applications
Simulation: Physics animations.
simulation for animation

197
 11 Networking for • Understand the Lecture and Quizzes, Homework,
Multimedia mechanisms of multimedia discussion, Visual and exams.
Communication: streaming, broadcasting, simulation
Streaming, broadcasting, and multicasting;
multicasting, Quality of • Learn how to ensure high-
Service (QoS) Quality voice and video
guarantees, resource Streaming With QoS.
reservation, traffic
specification, shaping
and monitoring,
admission control;
Multicasting issues;
Session directories;
Protocols for controlling
sessions;

12 Security in Multimedia • Understand the need for Lecture and Answer basic
Communication: security in Multimedia discussion, Visual questions, quizzes,
Storage of Multimedia storage and streaming. simulation Homework, and
contents, Right • Learn about right exams.
management (DRM), management in
digital watermarking, multimedia.
partial encryption • Learn about different
schemes for video techniques for right
streams. Other security management in digital
concerns multimedia content and
gaming consoles;
13 Multimedia Operating • Learn about the Lecture and Exercise the
Systems: Multimedia requirements of discussion, Visual answering methods
OS vs General-purpose Multimedia OS; simulation in the final exam.
OS, Requirements of • Learn about the scheduling
Multimedia OS, techniques in Multimedia
Scheduling in OS;
Multimedia OS, • Learn about other
Other Multimedia multimedia applications;
Applications: Audio
and Video conferencing,
Video on demand,
Satellite DTH, VOIP,
Podcasts

Recommended Books:
1. Multimedia Communications Applications, Networks, Protocols and Standards by Fred Halsall,
Pearson.
2. Fundamentals of Multimedia by Ze-Nian Li and Mark S. Drew, Pearson.
3. Multimedia Sound and Video by Jose Lozano, Louis Molina, and John Willie, Prentice-Hall.
4. Multimedia: Making It Work by Tay Vaughan, McGraw-Hill.

198
 COURSE CODE: CSTE 4225, COURSE TITLE: PROJECT AND THESIS

Course Code: CSTE 4225, Course Title: Project and Thesis, 3 Hours/Week, 3 Credits, Total Marks
100, Year 4, Term 2
Rationale: This is the continuation of the course CSTE 4125. After completion of the course CSTE
4125, students can get the registration done for the course CSTE 4225.
Course Objectives:
➢ To design one’s own algorithm to solve the specific problem.
➢ To implement his/her proposal.
➢ To be oriented with the research/big project.
Resources Used: Multimedia, Whiteboard, Marker, Handouts, PDF books, e-Tutorials, Internet,
Printer, photocopier, Device manual (if necessary), Journals, and other necessary resources from the
Internet.
COURSE CONTENTS OUTCOME
At the end of the course student should be able
to
1. Work in team.
2. Have detailed insights of a specific topic
Continuation of the project/Thesis topic undertaken and the works done by others.
in CSTE 4125. 3. Design and implement of the proposal
prepared in the previous term.
4. Compare the results produced in the
previous term or with those of others work.
5. Write journal and conference paper

COURSE CODE: CSTE 4226, COURSE TITLE: VIVA VOCE

COURSE CODE: CSTE 4226, COURSE TITLE: VIVA VOCE, 0 Hours/Week, 1 Credits, Total
Marks 100, Year 4, Term 2
Rationale: This course has been designed to develop the students’ ability to realize practical situation
of job environment.
Course Objectives:
➢ Prepare the students to face interviews in both the academic and the industrial sectors
OUTCOME (Student should be able to)
COURSE CONTENTS
VIVA VOCE (Viva based on major/minor courses of Evaluate overall technical knowledge
whole academic year) and industry readiness.
Able to go under a virtual environment of
technical interview.
Able to analyze various applications of
Computer Science & Telecommunication
Engineering in real-life problem solving.

199
200