Web Technology

Course Type Subject L T P Credits CA MS ES CA ES Pre-requisites

Code
CBCPC04 CC Web 3 0 2 4 15 15 40 15 15 Computer Programming
Technology and Data Structures
COURSE OUTCOMES:
1. To understand the development and transi�on of the web.
2. To Learn crea�ng the web pages and apply the styles
3. To learn the web programming for simple day to day work.
4. To learn fetching the object using latest technologies and using them to process informa�on
5. To write a full-fledged web-based applica�on and deploy it.
UNIT CONTENT
Unit-1 Introduc�on, Web Browser, Web 2.0: Introduc�on, W3C, Web 2.0, Personal, Distributed and
Client/Server compu�ng, Browser portability, So�ware technologies, Web resources,
Customizing browser se�ng, Searching the internet, Keeping track of your favourite sites, File
Transfer Protocol (FTP), Online help, Web resources, Web 2.0?, Search, Content networks, User-
generated content, Blogging, Social networking, Social media, Tagging, Social bookmarking,
So�ware development, Rich Internet Applica�ons (RIAs), Web services, Mashups, Widgets and
gadgets, Loca�on-based services, XML, RSS, Atom, JOSN and VolP, Web 2.0 mone�za�on
models, Web 2.0 business models, Future of the web, Where to GO for more Web 2.0
informa�on.
XHTML, Cascading Style Sheets (CSS): Introduc�on, Edi�ng XHTML, First XHTML example,
W3CXHTML valida�on service, Headings, Linking, Images, Special characters and horizontal
rules, Lists, Tables, Forms, Internal linking, Meta elements, Inline styles, Embedded style sheers,
Conflic�ng style, Linking external style sheers, Posi�oning elements, Backgrounds, Element
dimensions, Box model and text flow, Media types, Building a CSS drop-down menu, User style
sheets, CSS 3, Web resources
Unit-2 JavaScript:
Introduc�on to Scrip�ng: Introduc�on, Simple program: Displaying a line of text in a webpage,
Modifying our first program, Obtaining user input with prompt dialogs, Dynamic welcome page,
Adding integers, Memory concepts, Arithme�c, Decision making: Equality and rela�onal
operators, Web resources
Control Statements: Introduc�on, Algorithms, Pseudo code, Control structures, if selec�on
statement, if…else selec�on statement, Formula�ng algorithms: Counter-controlled repe��on,
Sen�nel-controlled repe��on, Nested control statements; Assignment operators, Increment and
decrement operators, Essen�als of counter-controlled repe��on, For repe��on statement,
Examples using the for statement, Switch mul�ple-selec�on statement, do….while repe��on
statement, break and con�nue statements, Labelled break and con�nue statements, Logical
operators, Summary of structures programming, Web resources
Func�ons: Introduc�on, Program modules in JavaScript, Programmer-defini�ons func�ons,
Func�on defama�ons, Random number genera�on, Example: Game of chance; Random image
genera�on, JavaScript global func�ons, Recursion, Recursion vs. Itera�on
Arrays: Introduc�on, Arrays, Declaring and alloca�ng arrays, Examples using arrays, Random
image generator using arrays, References and reference parameters, Passing arrays to func�ons,
Sor�ng arrays, Searching arrays: Linear search and binary search; Mul�dimensional arrays,
Building an online quiz, Introduc�on to object technology, Math object, String object,
Fundamentals of characters and strings, Methods of the string object, Character-processing
methods, Searching methods, Spli�ng steins and obtaining substrings, XHTML markup methods,
Date object, Boolean and number objects
 Document Object Model (DOM): Objects and collec�ons, Introduc�on, Modelling a document:
DOM nodes and trees; Traversing and modifying a DOM tree, DOM collec�ons, Dynamic styles,
Summary of the DOM objects and collec�on, Web resources
Events: Introduc�on, Registering event handlers, Event onload, Event onmousemove, the event
object and this, Rollovers with onmouseover and onmouseout, From processing with onfoucus
and onblur, More form processing with onsubmit and onreset, Event building, More events
Unit-3 XML and RSS: Introduc�on, XML basics, Structuring data, ZXML namespaces, Document Type
Defini�ons (DTDs), W3CXML schema documents, XML vocabularies, MathMLTM, Other markup
languages, Extensible stylesheet language and XSL transforma�ons, Document Object Model
(DOM), RSS
Ajax-Enabled Rich Internet Applica�ons: Introduc�on, Tradi�onal web applica�on vs. Ajax
applica�ons, Rich Internet Applica�ons (RIAs) with Ajax, History of Ajax, “Raw” Ajax example
using the XMLHtpRequest object, Using XML and the DOM, Crea�ng a full-scale Ajax-enabled
applica�on, Dojo toolkit
Unit-4 IIS and Apache: Introduc�on, Architecture, Client-server side scrip�ng, Reques�ng documents.
Database: Introduc�on, RDBMS, SQL-simple queries, ADO.NET object model, Java DB/Apache
Derby
PHP: Introduc�on, Basics, Form processing and business logic, Connec�ng to a database, Using
cookies.
Ruby on Rails: Introduc�on, Ruby, Rails framework, Scrip�ng
Unit-5 ASP.NET and ASP.NET Ajax: Introduc�on, Crea�ng and running a simple web form example,
Rela�onship, Genera�ng XHTML code, Web controls, Sessions tracking.
Java Server Faces Web Applica�ons: Java web technologies, Crea�ng and running a simple
applica�on in NetBeans, Examining a JSP file, Event processing life cycle, JSF components, Text
vs. graphics components, valida�on, session cookies, web services
Guidelines for Project Work:
Exercises based on these technologies
REFERENCE BOOKS:
1. Deitel and Deitel: Internet and Worldwide Web programming, Pearson
2. Frank Barbier: Reac�ve Internet programming, ACM Books
3. Tara Calishain: Google hacks, O’Reilly Media
4. Sergei Dunaev Advanced Internet Programming, IT Master
 Database Management Systems
Course Type Subject L T P Credits CA MS ES CA ES Pre-requisites
Code
CBCPC05 CC Database 3 0 2 4 15 15 40 15 15 None
Management Systems
COURSE OUTCOMES: At the end of the course students will be able to-
1. Understand fundamentals of database management systems.
2. Design database models and learn database languages to write queries to extract information from
databases.
3. Identify database anomalies and improve the design of database management system
4. Understand transaction management and concurrency control.
5. Understand storage organization and database recovery.
Unit Content
Unit-1 Introduction: Database management system, Characteristics of the database, Database systems
and architecture, Data models, Schemes and instances, DBMS architecture and data
independence, Database administrator and database users, Database languages and interfaces,
DDL, DML, DCL, Overview Relational Data Base Management Systems (RDBMS)
Unit-2 Data Modelling: Data modelling using the entity-relationship model- Entities, Attributes and
Relationships, Cardinality of Relationships, Strong and Weak Entity Sets, Generalization,
Specialization, and Aggregation, Translating your ER Model into Relational Model, Relationships
of higher degree
Unit-3 Relational Model, Languages & Systems: Relational data model concepts, Relational model
constraints, Integrity constraints, Keys domain constraints, Referential integrity, Assertions
triggers, Foreign key, Relational algebra and calculus, SQL, Database security
Relational Data Base Design: Functional dependencies and normalization for relational
databases, Functional dependencies, Normal forms based on primary keys, (1NF, 2NF, 3NF &
BCNF), Lossless join and dependency preserving decomposition, Functional dependencies and its
closure, Covers and equivalence
Unit-4 Transaction Management: Transaction concept and state, Implementation of atomicity and
durability, Concurrent executions, Serializability- Testing of serializability, Serializability of
schedules, Conflict and view serializable schedule
Concurrency Control Techniques: Lock-based protocols, Timestamp-based protocols, Validation
based protocol, Deadlock Handling
Unit-5 Recovery System: Recoverability- Failure classification, Storage structure, Recovery and atomicity,
Log-based recovery, Shadow paging, Recovery with concurrent transactions
Storage Organization: Indexing, Hashing , File storage
LIST OF EXPERIMENTS:
Following is only a suggestive list of experiments. For better coverage faculty may increase the list of
experiments.
Ques 1: Consider the following relational schema
SAILORS (sid, sname, rating, date_of_birth)
BOATS (bid, bname, color)
RESERVES (sid, bid, date, time slot)
Write the following queries in SQL and relational algebra
a. Find sailors who’ve reserved at least one boat
b. Find names of sailors who’ve reserved a red or a green boat in the month of March.
c. Find names of sailors who’ve reserved a red and a green boat
d. Find sid of sailors who have not reserved a boat after Jan 2018.
e. Find sailors whose rating is greater than that of all the sailors named “John”
f. Find sailors who’ve reserved all boats
g. Find name and age of the oldest sailor(s)
 h. Find the age of the youngest sailor for each rating with at least 2 such sailors

Ques 2: Consider the following relational schema:

CUSTOMER (cust_num, cust_lname , cust_fname, cust_balance);
PRODUCT (prod_num, prod_name, price)
INVOICE (inv_num, prod_num, cust_num, inv_date ,unit_sold, inv_amount);
Write SQL queries and relational algebraic expression for the following
a. Find the names of the customer who have purchased no item. Set default value of
Cust_balance as 0 for such customers.
b. Write the trigger to update the CUST_BALANCE in the CUSTOMER table when a new invoice
record is entered for the customer.
c. Find the customers who have purchased more than three units of a product on a day.
d. Write a query to illustrate Left Outer, Right Outer and Full Outer Join.
e. Count number of products sold on each date.
f. As soon as customer balance becomes greater than Rs. 100,000, copy the customer_num in
new table called ”GOLD_CUSTOMER”
g. Add a new attribute CUST_DOB in customer table

Ques 3: Consider the following relational schema

DEPARTMENT(Department_ID, Name, Location_ID)
JOB (Job_ID , Function )
EMPLOYEE (Employee_ID, name, DOB, Job_ID , Manager_ID, Hire_Date, Salary, department_id)
Answer the following queries using SQL and relational algebra:
a. Write a query to count number of employees who joined in March 2015
b. Display the Nth highest salary drawing employee details.
c. Find the budget (total salary) of each department.
d. Find the department with maximum budget.
e. Create a view to show number of employees working in Delhi and update it automatically
when the database is modified.
f. Write a trigger to ensure that no employee of age less than 25 can be inserted in the
database.

Ques 4: PROJECT
Students are required to develop a DBMS for the applications assigned to them. Following items are
required to be submitted for the project
a. Problem Statement
b. ER model/ Relational Model
c. Integrity Constraints implemented
d. Suitable Queries to create and manage database

Note: Students have to make sure that they have defined proper integrity constraints to ensure
consistency of database used in assignments as well as project.
SUGGESTED READINGS:
Textbook-
Korth ,Silbertz, Sudarshan, ”Data base concepts”, McGraw-Hill, 2013
Reference books-
a. Elmasri, Navathe, “Fundamentals of Database systems”, Addison Wesley, 2010
b. Date C.J., “An Introduction to Database systems”, Addison-Wesley Longman, Inc.,2004
 Design and Analysis of Algorithms
Course Code Type Subject L T P Credits CA MS ES CA ES Pre-requisites
CBCPC06 CC Design and Analysis of 3 0 2 4 15 15 40 15 15 Data
Algorithms Structures
COURSE OUTCOMES:
1. To be able to analyse the asympto�c performance of algorithms.
2. To be able to write rigorous correctness proofs for algorithms.
3. Ably demonstrate a familiarity with major algorithms and data structures.
4. To be able to apply important algorithmic design paradigms and methods of analysis.
5. To be able to synthesize efficient algorithms in common engineering design situa�ons.
Unit Content
Unit-1 Design and analysis of algorithms, Asympto�c nota�ons and their significance, Introduc�on to
RAM model of computa�on, Complexity analysis of algorithms, Worst case and average case,
Basic introduc�on to algorithmic paradigms like divide and conquer, recursion, greedy, etc.
Unit-2 Searching: Binary search trees, Balanced binary search trees, AVL trees and Red-black trees, B-
trees, Skip lists, Hashing, Priority queues, Heaps, Interval trees, Tries; Order sta�s�cs
Sor�ng: Comparison based sor�ng- Quick sort, Heap sort, Merge sort, Worst and average case
analysis, Decision tree model and (worst case) lower bound on sor�ng, Sor�ng in linear �me -
Radix sort, Bucket sort, Coun�ng sort, etc., String matching
Unit-3 Graph Algorithms: BFS, DFS, Connected components, Topological sort, Minimum spanning trees,
Shortest paths- single source and all pairs.
Models of computa�on: RAM model and its logarithmic cost.
Formal introduc�on to algorithmic paradigms: Divide and conquer, Recursion, Dynamic
programming, Greedy, Branch and bound, etc.
Advanced data structures: Fibonacci heap, Union-find, Splay trees, Amor�zed complexity analysis
Unit-4 Randomized algorithms: Randomized algorithms to be introduced a bit early, i.e., before NP-
completeness to highlight randomiza�on as an algorithmic technique, Applica�on areas
Geometric algorithms: Convex hulls, Nearest neighbour, Voronoi diagram, etc.,
Algebraic and number-theore�c algorithms: FFT, Primality tes�ng, etc.
Unit-5 Graph algorithms: Network flows, Matching, etc.
Op�miza�on techniques: Linear programming, Reducibility between problems and NP-
completeness- Discussion of different NP-completeness problems like sa�sfiability, clique, vertex
cover, independent set, hamiltonian cycle, TSP, knapsack, set cover, bin packing, etc.;
Backtracking, Branch and bound
Approxima�on algorithms: Constant ra�o approxima�on algorithms.
Suggested Readings:
1. E. Horowitz, S. Sahni, and S. Rajsekaran, “Fundamentals of Computer Algorithms,” Galo�a
Publica�on
2. T .H . Cormen, C .E .Leiserson, R .L .Rivest “Introduc�on to Algorithms”, PHI.
3. Sedgewich, Algorithms in C, Galgo�a
4. Berman. Paul, “Algorithms, Cengage Learning”.
5. Richard Neopolitan, Kumar SS Naimipour, “Founda�ons of Algorithms”
 Computer Architecture and Organisa�ons
Course Type Subject L T P Credits CA MS ES CA ES Pre-requisites
Code
CBCPC07 CC Computer 3 1 0 4 25 25 50 - - Computer
Architecture and Programming and
Organisa�ons Data Structures
COURSE OUTCOMES:
1. To understand the architecture of modern processors and organiza�on of its components, and
rela�onship between hardware and so�ware in digital machines.
2. To design instruc�ons and corresponding logic circuits for a simple CPU with its essen�al
components such as ALU, a register file, memory and input-output.
3. To understand the organiza�on of computer systems
4. To understand the computa�on standards and using them in wri�ng algorithms
5. To appreciate the evolving technology that governs the evolu�on of modern computers and
con�nue to keep abreast of state-of-art in compu�ng technology
Unit Content
Unit-1 Overview of computer organiza�on: Characteris�cs of a general-purpose computer, The stored
program concept, Von Neumann architecture, Harvard architecture, Programmer’s model- The
Instruc�on Set Architecture (ISA), ISA design and performance criteria, Basic computer
organiza�on with CPU, Memory and IO subsystems, Interconnect busses, Evolu�on of CISC and
RISC based processors and their merging.
Unit-2 Instruc�on Set Architectures: Machine instruc�on, Machine cycle and Instruc�on cycles,
Instruc�on Set- Memory and non-memory reference instruc�ons, Instruc�on categories- Data
movement, Data manipula�on, Program control and machine control instruc�ons, CISC types
addressing modes and instruc�on formats, RISC type addressing modes and instruc�on formats.
Unit-3 Central Processing Unit: Specifica�on of a simple CPU using RTL, Design of the data path for the
simple CPU, Designing the hardwired control path for the simple CPU, Performance analysis of
the simple CPU, Enhancement of the ISA for the simple CPU and design extensions,
Characteris�cs of RISC CPU design- ISA characteris�cs, Pipelining, Data and instruc�on caches,
Prac�cal case studies in CISC type and RISC type CPU designs.
Unit-4 Microprogrammed Control Unit: Control memory system, Microinstruc�on-sequencing,
Condi�onal branch, Mapping and subrou�nes; Direct, Horizontal and Ver�cal microcoding;
Micro-instruc�on format and symbolic representa�on, Design of microcontrol unit for a simple
CPU, Applica�ons of microprogramming
Memory Organiza�on: Memory hierarchy, Cache organiza�on- Direct, Associa�ve and Set
associa�ve cache, Auxiliary memory organiza�on, RAID organiza�ons
Input Output organiza�on: I/O interfacing, Asynchronous data transfer, Programmed IO,
Interrupt driven IO, Priority schemes, Direct memory access, Serial communica�on techniques
Unit-5 Computer arithme�c: Design of binary addi�on and subtrac�on units, Algorithms for
mul�plica�on and division and their implementa�on, Floa�ng point arithme�c, etc.
Pipelined architecture: Basic concepts of pipelining, Speedup and throughput, Minimum
average latency, Instruc�on pipeline.
GPU architecture: Hardware basics, Execu�on model, GPU instruc�on set architecture, NVIDIA
GPU instruc�on set architecture
GUIDELINES FOR PROJECT WORK:
• Exercises using assembly-level programming and debugging to illustrate the working of
instruc�ons in the ISA of a CISC based /RISC based processor. These exercises should illustrate the
status of various registers, flags, counters and pointers a�er data movement, data manipula�on,
program control, and stack opera�ons.
• Semester-long group project on the design and simula�on /hardware emula�on of a simple
processor.
REFERENCE BOOKS:
1. William stallings, “Computer Organiza�on and Architectue, PHI” 2. M. Morris Mano,
2. M. Morris Mano, “Computer System Architecture” , PHI
3. J.D. Carpinelli, “Computer Systems Organiza�on and Architecture,” Pearson Educa�on
4. Heuring and Jordan, Pearson Educa�on, “Computer Systems Design and Architecture”
5. Tor M. Aamodt, Wilson Wai Lun Fung, Timothy G. Rogers General-Purpose Graphics Processor
Architectures
 Microprocessors and Microcontrollers
Course Code Type Subject L T P Credits CA MS ES CA ES Pre-requisites
CBEPC08 CC Microprocessors and 3 0 2 4 15 15 40 15 15 None
Microcontrollers
COURSE OUTCOMES:
1. Acquire knowledge of architecture and programming of microprocessors.
2. Understand the salient features of the x86 architecture.
3. Acquire hands-on knowledge of interfacing microprocessors with peripherals.
4. Understand the architecture and working of microcontrollers and their u�lity.
5. Acquire introductory knowledge about high-end microprocessors and microcontrollers.
Unit Content
Unit-1 Intel 8085 microprocessor: Basic concepts of microprocessor, Microcomputer, Microcontroller,
Architecture (pins, signals, buses, register set), Addressing modes, Instruc�on set (instruc�on
format, opcode, mnemonic), Subrou�nes, Timing diagrams and T-states of different instruc�ons,
Programming, Recursive programs, Vectored and non-vectored interrupts and interrupt handling
of 8085.
Unit-2 Intel 8086 microprocessor: Architecture (pins, bus interface unit, execu�on unit, register set,
pipelining), Memory addressing, Segmenta�on, Instruc�on set (data transfer, arithme�c, logic,
string, long and short control transfer and processor control), Timing diagrams, Opera�ng modes,
Programming, Assemblers, Address-objects, Parameter passing to subrou�nes, Hardware and
so�ware interrupts and interrupt handling of 8086.
Unit-3 Interfacing of microprocessors: Interfacing a microprocessor with RAM and ROM chips, Address
alloca�on and decoding techniques, Interfacing with LED, LCD, ADC, DAC, toggle switch and
keypad; Memory-mapped I/O, Interfacing with 8255 programmable peripheral interface
(architecture, ports, I/O modes and BSR mode), Basic architecture and features of 8254
programmable �mer, 8257 programmable DMA controller, 8259 programmable interrupt
controller, 8279 programmable keyboard and display controller and 8087 math coprocessor.
Unit-4 Microcontrollers: 8051 microcontroller: Architecture, I/O ports, Memory organiza�on,
Addressing modes, Instruc�on set, Simple programs.
Introduc�on to IoT: Basic architecture, Sensing and actua�ng, Applica�on domains.
Unit-5 High-end microprocessors and microcontrollers: Important features of 32-bit processors, RISC
and Pen�um; Implementa�on of memory management schemes like segmenta�on, paging and
virtual memory at the hardware level
Introduc�on to Arduino: Basic architecture, Hardware and so�ware, Simple programs.
Guidelines for Prac�cal Work:
1. Write an assembly program to generate the numbers of the Fibonacci series.
2. Write an assembly program to clear all flags without using any data transfer instruc�on.
3. Write an assembly program to search for a number in a list.
4. Write an assembly program to sort a list.
5. Write an assembly program to copy a list from one part of the memory to another.
6. Write an assembly program to mul�ply two numbers using successive addi�ons.
7. Write an assembly program to calculate the square root of a number.
8. Write an assembly program to calculate the factorial of a number using recursion.
9. Write a self-replica�ng assembly program.
10. Interface 8255 with a microprocessor and use all its modes.
11. Interface 8254 with a microprocessor and use it to generate differ types of clock signals.
12. Interface 8259 with a microprocessor and use all its features.
13. Interface 8257 with a microprocessor and write a program to control a keypad and a LED display.
14. Design digital systems with Arduino and simple sensors and actuators.
Suggested Readings:
1. Ramesh S. Gaonkar, “Microprocessor Architecture, Programming, and Applica�ons with the 8085”
Pren�ce Hall.
2. D. V. Hall, “Microprocessor and Interfacing Programming & Hardware” TMH – 2nd Edi�on.
3. S. P. Morse, “8086 Primer: An Introduc�on to Its Architecture, System Design and Programming”
Hayden Book Co.
4. S. Monk, “Programming Arduino: Ge�ng Started with Sketches”, 2nd Edi�on, McGraw-Hill.
5. M.A. Mazidi et. al. “The 8051 Microcontroller and Embedded Systems: Using Assembly and C”
Pearson Publishers.