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

72
 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

73
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
PHP.ini and httpd.conf
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

74
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 PHP.INI 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.

75
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.

76
 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

79
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

80
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

81
 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

82
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

83