Third Semester

Subjects:
1. EG 2101 CT Web Technology and Programming II
2. EG 2104 SH Engineering Mathematics III
3. EG 2105 CT Data Structure & Algorithm
4. EG 2107 CT Database Management System(DBMS)
5. EG 2107 EX Microprocessors
6. EG 2108 EX Electronic Devices & Circuits

73
 Web Technology and Programming II
EG 2101 CT
Total: 7 hour /week
Year: II Lecture: 3 hours/week
Semester: III Tutorial: 1 hours/week
Practical: 3 hours/week

Course Description:
This course aims at providing skills to the student to development of modern web application
and gain a broad understanding of the Web Technology with database. The course will initiate
students to the different web development tools and technology such as Ajax, XML, PHP-
MySQL and open sources web development frameworks.

Course Objectives
After completing this course, the students will be able to:
 Explain basics of various Scripting Languages.
 Explain the XML and used into web development.
 Describe the AJAX and implement into webpage design.
 Create interactive web sites and maintain them with server-side scripting.
 Handle the database on the web site using PHP and MySQL
Course Contents
Units Topics Contents Hours Methods Marks
/Media
1 XML and Ajax 1.1 Introduction to XML [5]
1.2 Working with Basics of XML
1.3 Converting XML Documents in Other
Formats
1.4 Working with XSLT
1.5 Working with XPath, XLink and
XPointer
1.6 XML Application
1.7 Overview of AJAX
1.8 AJAX components
1.9 Asynchronous Data Transfer with XML
Http Request
1.10 Implementing AJAX Frameworks
1.11 Consuming Web Services Using AJAX

74
Units Topics Contents Hours Methods Marks
/Media
2 Introduction to 2.1 Introduction to PHP Scripting (10)
PHP Language
2.2 PHP vs JSP vs ASP server-side
programming
2.3 Server-Side Scripting vs Client-Side
Scripting
2.4 Installing XAMPP or WAMP or other
web server
2.5 Setting server environment
2.6 Configuring and Adjusting setting in
[Link] and [Link]
2.7 Running PHP Scripts
2.8 Formatting Outputs
2.9 Working with Variables, Global
Variables and Constants.
2.10 Logical, Concatenation, mathematical
and relational operators
2.11 Escape Sequences
3 Programming 3.1 Conditional Statements (If, if else, [10]
on PHP switch statement)
3.2 Iteration and Looping (do while, while,
for loop, foreach loop)
3.3 Functions: Built-In and user-defined
functions
3.4 String functions and pattern: String
comparison, String concatenation
3.5 Array: Numeric Array, Associative
Array
3.6 One Dimension and multi-dimensional
array
4 Programming 4.1 Web Concepts in PHP [5]
on PHP 4.2 Get and Post
4.3 File Inclusion and Files & I/O
4.4 Functions
4.5 Cookies
4.6 Sessions
4.7 Sending Emails
4.8 File Uploading
4.9 Error Handling
4.10 Bugs Debugging

75
Units Topics Contents Hours Methods Marks
/Media
5 PHP and 5.1 BASIC DATABASE CONCEPTS [10]
Database 5.2 Explore PhpMyAdmin panel
Connection
5.3 Create MySQL Database Using PHP
5.3.1 Opening Database Connection
5.3.2 [Link] file Configuration
5.3.3 Closing Database Connection
5.3.4 Creating a Database
5.3.5 Selecting a Database
5.3.6 Creating Database Tables
5.4 Deleting MySQL Database and Table
Using PHP
5.5 Insert Data into MySQL Database
5.6 Retrieve Data From MySQL Database
5.7 Releasing Memory
5.8 Updating Data Into MySQL Database
5.9 Deleting Data From MySQL Database
5.10 Using PHP To Backup My SQL
Database
6 PHP 6.1 Overview of Laravel Framework [5]
Framework: 6.2 MVC Concepts in Laravel
LARAVEL
6.3 Installation
6.4 Artisan and Routing
6.5 Controller, View and Migration
6.6 Request and Response
6.7 Seeding
6.8 Database Configuration
6.9 Blade Templating System
6.10 Emailing and Session
6.11 Authentication and Authorization
6.12 Pagination
Practical Perform the following tasks: [45]
1. Apply XML in web development.
2. Apply AJAX in web development
3. Install and configure Apache, PHP and
MySQL
4. Demonstrte the PHP programming
5. Develop web site usingPHP and MySQL
6. Apply PHP framework like Laravel to
develop the web site.

76
Practical:
Students are given lab assignments to help gain practical experience in both the Server side and
client side scripting languages and are given a final project that includes developing a Dynamic
web page design including database connectivity. The topic could be either initiated by the
student or selected from unit 1-7 provided by the instructor.

Reference Books
1. Kogent Learning Solutions Inc (2013). HTML 5 Black Book: CSS3, Javasvript,
XML, XHTML, AJAX, PHP and jQuery. Wiley India
2. Bayross, I. (2005). Web enabled commercial applications development using ...
HTML, DHTML, Javascript, Perl CGI. New Delhi: BPB publication.
3. Nixon, R. (2015). Learning PHP, MySQL & JavaScript: with jQuery, CSS & HTML5
(4. ed). Beijing: O’Reilly.

Reference Materials
1. Lockhart, J. (2015). Modern PHP (1. ed). Sebastopol, Calif: O’Reilly.
2. Bergmann, S., & Priebsch, S. (2011). Real-world solutions for developing high-quality
PHP frameworks and applications. Indianapolis, Ind: Wiley.

77
 Engineering Mathematics III
EG 2104 SH
Total: 4 hours /week
Year: II Lecture: 3 hours/week
Semester: III Tutorial: 1 hour/week

Course description:
This course consists of Partial derivative, Differential equations, Infinite series, Fourier series, and
Elementary group theory necessary to develop mathematical background.

Course objectives:
After completing this course students will able to:
1. Provide the basic mathematical idea for the analysis of electronic circuits and
2. Help in the development of program for the technical applications

Course Contents
Units Topics Contents Hours Methods/ Marks
Media
Unit 1 Partial 1.1 Functions of more than one variables [8]
Derivative 1.2 Partial derivative, partial differential
coefficient.
1.3 Partial derivative of first and higher
order.
1.4 Homogeneous function and Euler's
Theorem on homogeneous functions.
1.5 Composite function,
1.6 Derivative of composite
functions.(Total differential
coefficient)
2 Differential [10]
Equations:
2.1 Ordinary  Differential Equation and its order and
Differential degree.
Equations  Differential Equations of first order
and first degree,
 Differential Equations with separate
variables,
 Homogeneous and exacted
differential Equations

78
Units Topics Contents Hours Methods/ Marks
Media
2.2 Partial  Basic concepts, definition and
Differential formation
Equations (PDF)  General solution of linear PDF of first
order (Pp + Qq = R form)
3 Infinite Series:  Definitions of sequence and infinite [11]
series,
 Condition for convergence of an
infinite series,
 Geometric series.
 Test of convergence. (p-test, D'
alembert's ratio test, Cauchy radical test
or root test)
 Power series and its interval of
convergence,
 Expansion of functions using Taylor's
and Maclaurin's theorems.
4 Fourier Series:  Periodic function, [8]
 Even and odd function
 Trigonometric series
 Fourier series of the functions of period
2π,
 Euler's formula,
5 Elementary  Binary operation, Binary operation on [8]
Group Theory: sets and their properties.
 Definition of group
 Group whose elements are not number
 Finite, Infinite group and Abelian
group
 Elementary properties of group.

References:
1. Thomas and Finney, Calculus and Analytical Geometry, Narosa Publishing House, New Delhi, 1990.
2. E. Kreyszig, Advanced Engineering Mathematics, Wiley-Easter Publication, New Delhi, 1990.
3. Chandrika Prasad, Mathematics for Engineer, Prasad Mudranalaya, Allahabad, 1996.
4. E. Kreyszig,Advanced Engineering Mathematics, Wiley-Easter Publication, New Delhi, 1990.
5. A.V. Oppenheim, Discrete-Time Signal Processing, Prentice Hall, India Limited, 1990.
6. K. Ogata, Discrete-Time Control System, Prentice Hall, India Limited, 1993.

79
 Data Structures and Algorithm
EG 2105 CT
Total: 7 hour /week
Year: II Lecture: 3 hours/week
Semester: III Tutorial: 1 hours/week
Practical: 3 hours/week
Course Introduction
The purpose of this course is to provide the students with the basic concepts of data structures and
algorithms. The main objective of the course is to teach the students how to select and design data
structures and algorithms that are appropriate for problems that might occur. This course offers the
students a mixture of theoretical knowledge and practical experience. Programming language C
can be used for practical work.

Objectives
On completion of this course the students will be enabled to:
 Introduce data abstraction and data representation in memory
 Discuss, design and use elementary data structures such as stack, queue, linked list, tree
and graph.
 Decompose complex programming problems into manageable sub-problems
 Introduce theory of algorithms and their complexity
Course Contents
Units Topics Contents Hours Methods/ Marks
Media
1 Introduction to Data 1.1 Data Structures: Definition (5)
Structures and and Types
Algorithms 1.2 Abstract Date Type
1.3 Dynamic Memory: malloc,
calloc, realloc and free
1.4 Introduction to Algorithms:
Definition and properties of
algorithms
1.5 Asymptotic Notations: Big-
O, Big-Ω and Big-θ
2 Stacks 2.1 Definition, Stack as ADT (5)
2.2 Stack Operations: Concept
and Algorithms
2.3 Stack Applications
3 Queues 3.1 Definition, Queue as ADT (6)
3.2 Queue Operations: Concept
and Algorithms
3.3 Queue Applications
3.4 Linear vs Circular Queue
3.5 Circular Queue Operations:
Concept and Algorithms

80
Units Topics Contents Hours Methods/ Marks
Media
3.6 Concept of Priority queue.

4 Recursion 4.1 Definition, Recursion vs (4)

Iteration
4.3 Factorial, Fibonacci
sequence, and TOH
4.4 Applications and Efficiency
of recursion
5 Linked lists 5.1 Definition, Linked List as (8)
ADT
5.2 Types of Linked List
5.3 Basic operations in Singly
Linked List: creation, node
insertion and deletion from
beginning, end, and specified
position
5.4 Linked List Implementation
of Stack and Queue
5.5 Concept of other types of
Linked Lists
5.6 Applications of Linked List
6 Trees 6.1 Concept and Definition: (5)
Concept of level, depth,
number of nodes
6.2 Binary Tree and Binary
Search Tree
6.3 Insertion, Deletion, and
Traversal of BST
6.4 Applications of Tree,
Concept of Balanced Trees
7 Graphs 7.1 Representation and (5)
Applications of Graph
7.2 Graph Traversal Algorithms:
Depth First Traversal and
Breadth First Traversal
7.3 Minimum Spanning Trees:
Kruskal’s Algorithms
8 Sorting and 8.1 Concept of Sorting and (7)
Searching Searching
8.2 Comparison Sorting: Bubble,
Selection, and Insertion Sort
and their complexity

81
Units Topics Contents Hours Methods/ Marks
Media
8.3 Divide and Conquer Sorting:
Merge, and Quick Sort and
their Complexity
8.4 Searching Algorithms:
Sequential, and Binary
Search
8.5 Concept of Hash Data
Structure and Hash Function
Laboratory Work (45 hrs) (45 hrs)
 Write program to implement stack operations
 Write program to implement linear queue operations
 Write program to implement circular queue operations
 Write programs to implement recursive algorithms
 Write programs to implement linked list operations
 Write programs to implement linked stack and linked queue
 Write programs to implement Comparison Sorting algorithms
 Write programs to implement searching algorithms
 Write programs to implement BST operations
 Write programs to implement graph operations

Recommended Books
1. Y Langsam , MJ , Augenstein and A.M , Tanenbaum ( 2007) Data Structures using C and
C++ , Prentice Hall India, Second Edition

References
1. G.W Rowe (2016), Introduction to Data Structure and Algroithms with C and C++ , prentice
Hall India, First Edition
2. G. S. Baluja, (2016), Data structure Through C, A Practical Approach, Fourth Edition,
DhanpatRai& Co, Second Edition, 2016

82
 Database Management Systems
EG 2107 CT
Year: II
Semester: III Total: 7 hours/week
Lecture: 3 hours/week
Tutorial: 1 hours/week
Practical: 3 hours/week
Course Description:
The course covers the fundamental concepts of database and database management system
including database design using entity relationship diagram, relational databases, structured query
language, normalization, transaction processing, and concurrency control and recovery techniques.

Course Objective:
The main objective of this course is to:
 Explain the concepts of database and database management system.
 Provide knowledge of database design using entity relationship diagram.
 Perform on SQL statements, normalization, transaction processing, and database recovery.

Course Contents:
Units Topics Contents Hours Methods/ Marks
Media
1 Database and  Introduction; (6 )
Database System  Characteristics of the Database
Approach;
 Advantages of Using the DBMS
Approach;
 Data Models,
 Schemas, and Instances;
 Three-Schema Architecture and Data
Independence;
 Centralized and Client/Server
Architectures for DBMSs;
 Classification of Database Management
Systems
2 Data Modeling  Introduction to Entity-Relationship (9 )
Using the Entity- Model;
Relational Model  Entity Types,
 Entity Sets,
 Attributes, and Keys;
 Relationship Types,
 Relationship Sets,
 Roles, and Structural Constraints;
 Weak Entity Types;
 ER Diagrams

83
Units Topics Contents Hours Methods/ Marks
Media
3 The Relational  Relational Model Concepts; (10 )
Database and  Relational Model Constraints and
SQL Relational Database Schemas;
 Introduction to Relational Algebra;
 SQL:
 Data Definition and Data Types,
 Specifying Constraints,
 Basic Retrieval Queries, and INSERT,
 DELETE and UPDATE Statements
4 Relational  Relational Database Design Using ER- (7 )
Database Design to-
 Relational Mapping;
 Functional Dependencies;
 First, Second and Third Normal Form;
 Properties of Relational Decomposition
5 Transaction  Introduction to Transaction Processing; (13 )
Processing,  Transaction and System Concepts;
Concurrency  Desirable Properties of Transactions;
Control, and  Serializable Schedule;
Recovery  Two-Phase Locking and Timestamp
Ordering Techniques;
 Introduction to Database Recovery
Practical:
 Write SQL query for CREATE, INSERT, DELETE, and 45hrs
UPDATE operations.
 Write SQL query for SELECT operation.
 Write SQL query using aggregate functions.
 Apply SQL for specifying constraints.

Recommended Books:
 Ramez Elmasri and Shamkant B. Navathe (2010), Fundamentals of Database Systems, 6th
Edition, Pearson Addison Wesley
 Silberschatz, H.F. Korth, and S. Sudarshan (2010), Database System Concepts, 6th Edition,
McGraw Hill
 Raghu Ramakrishnan, and Johannes Gehrke (2007), Database Management Systems, 3rd
Edition ,McGraw-Hill
 Jaffrey D. Ullman, Jennifer Widom; A First Course in Database Systems; Third Edition;
Pearson Education Limited

84
 Microprocessor
EG 2107 EX
Total: 7 hour /week
Year: II Lecture: 3 hours/week
Semester: III Tutorial: 1 hours/week
Practical: 3 hours/week
Course Description:
This course deals with fundamentals of microprocessor, basic low level microprocessor
programming, interfacing and introduction to basic programmable devices.

Course Objectives:
After completing this course the students will be able to:
1. Explain the working principle of a computer
2. Demonstrate the working principle of microprocessor
3. Implement the process of writing and executing low level language
4. Explain and implement the Interfacing techniques of devices with a computer system

Course Contents
Units Topic Contents Hours Methods/ Marks
Media
1 Introduction to 1.1 History of computer [8]
Microprocessor: development
1.2 Analog and digital computer
1.3 Microprocessor,
microcomputer,
microcontroller
1.4 Stored program concept and
von-Neumann’s architecture
1.5 General architecture of a
microcomputer system
showing control buses
1.6 History of x86
microprocessors
1.7 Block diagram of a typical
microprocessor and
microcontroller
1.8 Programming language
1.9 Instruction set of
microprocessors
1.10 Introduction to Simple as
Possible (SAP1, SAP2, SAP3)
computers
2 Microprocessor 2.1 Internal architecture of 8085 [8]
architecture and microprocessor
2.2 Instruction and data formats

85
 the instruction 2.3 Instruction classifications
set: 2.4 Addressing modes in 8085
2.5 8085 Instruction set
3 Assembly 3.1 Introduction to assembly [9]
language language and assemblers
programming for 3.2 Simple assembly language
8085 programs
3.3 Programs using loops, counters,
delays
3.4 Table processing
3.5 Subroutine and stack
3.6 Code conversion
ASCII/BCD/Binary
4 Interfacing I/O 4.1. 8085 machine cycles and bus [10]
and memory timing
devices:  Fetch and execute cycles
 Memory read/write machine
cycle
 I/O read/write machine cycle
4.2. Address Decoding
 Unique and non-unique
address decoding
 Address decoding for I/O and
memory devices
4.3. Interfacing I/O devices
 Interfacing Input Devices
 Interfacing Output Devices
 Address decoding using block
decoders
 Interfacing Memory-mapped
I/O
4.4. Memory Interfacing
 Memory structure and its
requirement
 RAM and ROM chips
 Address decoding using
NAND and block decoders
4.5. Direct memory access
5 8085 Interrupt 5.1. Programmed I/O [6]
processing: 5.2. Interrupt Driven I/O
5.3. The 8085 Interrupt
5.4. 8085 Vectored Interrupts
5.5. Restart and software instructions
6 Introduction to 6.1. 8255 Programmable Peripheral [4]
general purpose Interface

86
 programmable 6.2. 8254(8253) Programmable
peripheral Interval Timer
devices: 6.3. 8259 Programmable Interrupt
Controller
6.4. 8251 USART
Practical: [45 hrs]
Perform the following tasks:
1. Demonstrate the basics of microcomputer system through
the 8085 microprocessor trainer kit
2. Write a program that uses data transfer instructions
3. Write a program that uses arithmetic instructions
4. Write a program that uses logical instructions
5. Demonstrate with conditional and unconditional
branching
6. Demonstrate with conditional and unconditional
subroutine call and stack
7. Demonstrate involving loops and counters
8. Demonstrate that involves masking and checking numbers
9. Write a program to manipulate table of numbers
10. Write a program for BCD and ASCII manipulation
11. Write a program to perform multiplication and division
12. Write a programs to read and write from the port

Reference books:
1. Ramesh S. Gaonkar, “8085 Microprocessor programming and interfacing”, New Age
2. John Uffenbeck, “The 8080, 8085 & Z-80 Programming, Interfacing and
Troubleshooting”, PHI
3. B. Ram "Fundamentals of Microprocessor and Microcontrollers" Dhanpat Rai Publications
4. Ajay Wadhwa, "Microprocessor 8085: Architecture, Programming and Interfacing", PHI
5. Albert Paul Malvino, Jerald A. Brown, “Digital Computer Electronics”, McGraw-Hill

87
 Electronic Devices and Circuits
EG 2108 EX
Total: 8 hour /week
Year: II Lecture: 4 hours/week
Semester: III Tutorial: 1 hours/week
Lab: 3 hours/week
Course Description:
This course deals with different electronic devices and circuits.

Course Objectives:
On completion of this course the students will be able to:
1 Differentiate between passive and active components.
2 Identify the characteristics of passive and active components.
3 Explain the working principles of various semiconductor devices, relate their
characteristics and applications
4 Explain the characteristics of CB, CE and CC configuration circuits
5 Explain the function of different dc power supplies.
6 Explain the function of JFET, MOSFET
7 Explain the function of SCR, PUT, UJT , special diodes and wave generating circuits
Course Contents:

Units Topics Contents Hours Methods/ Marks

Media
1 History of 2 hrs
1.1 Electron vacuum tubes:
electronic devices 1.2 Diode,
1.3 Triode and Pentode:

2 Basic Passive 2.1 Construction, 4 hrs

Devices: R, C and 2.2 Types,
L: 2.3 Color coding
2.4 Characteristics
3 Semiconductor 3.1 Energy levels, valence and
10 hrs
Diodes: conduction bands, conduction of
electrons and holes.
3.2 Intrinsic and extrinsic
semiconductor devices (Si),
impurities, doping, majority and
minor charge carries in P – type
and N – type materials..
3.3 PN Junction and depletion layer
and potential barrier – definition
and characteristics.
3.4 Forward and reverse biasing of PN
junction diode – The V-I

88
Units Topics Contents Hours Methods/ Marks
Media
characteristic, principles of
operation, and effects of
temperature and junction
capacitance.
3.5 Analysis of PN junction diode
circuit: The V-I characteristic and
mathematical expressions with
equivalent model circuit diagrams.
3.6 Operation in the reverse breakdown
region- Zener diode, principles of
operation and IV characteristic.
4 Power Supplies: 4.1 Half wave and full wave rectifiers
6 hrs
– Types, working principles,
characteristics and applications.
4.2 Analysis of simple DC voltage
power supplies – Principles,
characteristics and ripple (voltages)
factors.
4.3 Simple voltage regulation using
Zener diodes – Principles, circuits,
characteristics and application.

5 Bipolar Junction 5.1 The Unbiased Transistor, The

14hrs
Transistors (npn Biased Transistor, Transistor
and pnp) – Types, Currents, The CE Connection, The
construction, base Curve, Collector Curves,
working principle BJT AC Models: Base-Biased
as an amplifier and Amplifier, Emitter-Biased
characteristics: Amplifier, Small Signal operation,
AC Beta, AC Resistance of the
Emitter Diode, Reading Data Sheets
5.2 Other characteristics of BJT – The
load line, operating point,
Saturation and cutoff modes:
Definition, circuits, principles and
characteristics.
5.3 CC and CB Amplifier: CC
Amplifier, Output Impedance,
Cascading CE and CC, Darlington
Connections, Voltage Regulation,
The Common Base amplifier
5.4 Types of amplifier circuits: Class
A, Class B, Class AB and Class C –

89
Units Topics Contents Hours Methods/ Marks
Media
Definition, characteristics and
applications.
5.5 Frequency Effects: Frequency
Response of an Amplifier, Decibel
Power gain, Decibel voltage gain,
Impedance matching,

6 Field Effect 6.1 Basic Ideas, Drain Curves, Tran

12hrs
Transistor (JFET conductance Curves, Biasing in
and MOSFETS) – Ohmic Region, Biasing in Active
Types, Region,
construction, 6.2 Saturation, cut off breakdown and
working principles ohmic regions of operation –
as an amplifier and analysis of V-I characteristic
characteristics: curves.
6.3 The Depletion Mode MOSFET,D-
MOSFET Curves, Depletion Mode
MOSFET Amplifier, The
Enhancement Mode MOSFET
6.4 Data Book
7 Special 7.1 UJT, PUT, SCR, Diar and Triac.
12hrs
Semiconductor 7.2 Photo voltaic effects and solar
Devices – Working cells.
principles, 7.3 Photodiode, phototransistor, LED,
functional circuits, LDR, opt couplers and isolators.
characteristics and 7.4 Tunnel diode, schottyky diode,
applications: GaAs Transistors, MOSFET.
7.5 Charge coupled devices, Hall
effects, solid state relay and
thermister.
7.6 Multi vibrators: Generation of
square and triangular wave forms
using 555 IC

Practical: Demonstrate the following tasks: 45 hrs

1 Diode characteristics – PN diode
and Zener diode
2 BJT characteristics – C.E. input
and output characteristics
3 FET characteristics – C.S. input
and output characteristics
4 HW and FW rectifier –
waveforms and characteristics

90
Units Topics Contents Hours Methods/ Marks
Media
5 UJT characteristics – IV
characteristics
6 PUT characteristics – IV
characteristics
7 SCR characteristics – IV
characteristics
8 Tunnel diode characteristics – IV
characteristics
9 Photo diode characteristics – IV
characteristics

Reference books:
1. Theraja, B. L. (2010). Basic Electronics: Solid state. New Delhi: S. Chand & Company Ltd.
2. Sharma, S., & Sharma, D. (2010). Electronic principles. New Delhi: S.K. Kataria & Sons
3. Floyd, T. L. (2005). Electronic devices. Upper Saddle River, N.J: Pearson Education.
4. Malvino, A. P., & Bates, D. J. (2016). Electronic principles. New York: McGraw-Hill
Education

91