UTTAR PRADESH TECHNICAL UNIVERSITY

LUCKNOW

SYLLABUS
Bachelor of Information Technology
3

rd

Year (V & VI Semester)

(Effective from Session 2015-2016)

U.P. TECHNICAL UNIVERSITY, LUCKNOW

STUDY EVALUATION SCHEME
B. TECH. INFORMATION TECHNOLOGY
YEAR THIRD, SEMESTER V
(Effective from the session : 2015-16)
S.
No
.

Course
Code

Subject

THEORY SUBJECT
1
NCS
Design and Analysis of
501
Algorithm
2
NCS
Database Management
502
System
3
NCS
Principle of
503
Programming Language
4
NCS
Web Technology
504
5
NIT
Management
501
Information System
6
NHU Engineering Economics
501
PRACTICAL/DESIGN/DRAWING
7
NCS
Design and Analysis of
551
Algorithm Lab
8
NCS
DBMS Lab
552
9
NCS
Principle of
553
Programming Language
Lab
10 NCS
Web Technology Lab
554
11 NGP
GP
501
TOTAL

Periods

Evaluation Scheme

Subject
Total

Credit

Sessional Exam
CT TA Total

ESE

30

20

50

100

150

30

20

50

100

150

30

20

50

100

150

30

20

50

100

150

15

10

25

50

75

15

10

25

50

75

10

10

20

30

50

10

10

20

30

50

10

10

20

30

50

10

10

20

30

50

50
16

10

50
1000

25

U.P. TECHNICAL UNIVERSITY, LUCKNOW

STUDY EVALUATION SCHEME
B. TECH. INFORMATION TECHNOLOGY
YEAR THIRD, SEMESTER VI
(Effective from the session : 2015-16)
S.
No
.

Course
Code

Subject

THEORY SUBJECT
1
NCS
Computer Networks
601
2
NCS
Software Engineering
602
3
NCS
Compiler Design
603
4
Departmental Elective-I
5
Departmental Elective-II
6
NHU Industrial Management
601
PRACTICAL/DESIGN/DRAWING
7
NCS
Computer Networks Lab
651
8
NCS
Software Engineering
652
Lab
9
NCS
Compiler Design Lab
653
10 NIT
SEMINAR
654
11 NGP
GP
601
TOTAL

Periods

Sessional Exam
CT TA Total

ESE

30

20

50

100

150

30

20

50

100

150

30

20

50

100

150

3
2
2

1
1
0

0
0
0

30
15
15

20
10
10

50
25
25

100
50
50

150
75
75

4
3
2

10

10

20

30

50

10

10

20

30

50

10

10

20

30

50

50

50

50

50

50

16

10

Information Retrieval and Management

Modeling & Simulation
Bioinformatics
Knowledge based & decision Support System
Geographic Information System

Departmental Elective-II
1.
2.
3.
4.
5.

Data Warehousing & Data Mining

Human Computer Interface
E-Business Strategies
Distributed DBMS
Big Data

Credit

Total

Departmental Elective-I
1.
2.
3.
4.
5.

Subject

Evaluation Scheme

1000

25

NCS- 501 Design and Analysis of Algorithms

Topic

Unit

310
Proposed
Lectures
8

I.

Introduction : Algorithms, Analyzing algorithms, Complexity of algorithms, Growth

of functions, Performance measurements, Sorting and order Statistics - Shell sort,
Quick sort, Merge sort, Heap sort, Comparison of sorting algorithms, Sorting in linear
time.

II.

Advanced Data Structures: Red-Black trees, B trees, Binomial Heaps, Fibonacci

Heaps.

III.

Divide and Conquer with examples such as Sorting, Matrix Multiplication, Convex
hull and Searching.
Greedy methods with examples such as Optimal Reliability Allocation, Knapsack,
Minimum Spanning trees Prims and Kruskals algorithms, Single source shortest
paths - Dijkstras and Bellman Ford algorithms.

IV.

Dynamic programming with examples such as Knapsack.

All pair shortest paths Warshals and Floyds algorithms, Resource allocation
problem.
Backtracking, Branch and Bound with examples such as Travelling
Salesman Problem, Graph Coloring, n-Queen Problem, Hamiltonian Cycles
and Sum of subsets.

V.

Selected Topics: Algebraic Computation, Fast Fourier Transform, String Matching,

Theory of NP-completeness, Approximation algorithms and Randomized algorithms.

Text books:
1. Thomas H. Coreman, Charles E. Leiserson and Ronald L. Rivest, Introduction to Algorithms,
Printice Hall of India.
2. E. Horowitz & S Sahni, "Fundamentals of Computer Algorithms",
3. Aho, Hopcraft, Ullman, The Design and Analysis of Computer Algorithms Pearson Education,
2008.
References:

1. Jon Kleinberg and va Tardos, Algorithm Design, Pearson, 2005.

2. Michael T Goodrich and Roberto Tamassia, Algorithm Design: Foundations, Analysis, and Internet
Examples, Second Edition, Wiley, 2006.
3. Harry R. Lewis and Larry Denenberg, Data Structures and Their Algorithms, Harper Collins, 1997
4. Robert Sedgewick and Kevin Wayne, Algorithms, fourth edition, Addison Wesley, 2011.
5. Harsh Bhasin,Algorithm Design and Analysis,First Edition,Oxford University Press.
6. Gilles Brassard and Paul Bratley,Algorithmics:Theory and Practice,Prentice Hall,1995.

NCS-502 Database Management System

310

Unit

Topic

I.

Introduction: An overview of database management system, database system Vs file

system, Database system concept and architecture, data model schema and instances, data
independence and database language and interfaces, data definitions language, DML, Overall
Database Structure.
Data Modeling using the Entity Relationship Model: ER model concepts, notation for ER
diagram, mapping constraints, keys, Concepts of Super Key, candidate key, primary key,
Generalization, aggregation, reduction of an ER diagrams to tables, extended ER model,
relationship of higher degree.

II.

Relational data Model and Language: Relational data model concepts, integrity
constraints, entity integrity, referential integrity, Keys constraints, Domain constraints,
relational algebra, relational calculus, tuple and domain calculus.
Introduction on SQL: Characteristics of SQL, advantage of SQL. SQl data type and literals.
Types of SQL commands. SQL operators and their procedure. Tables, views and indexes.
Queries and sub queries. Aggregate functions. Insert, update and delete operations, Joins,
Unions, Intersection, Minus, Cursors, Triggers, Procedures in SQL/PL SQL

III.

Data Base Design & Normalization: Functional dependencies, normal forms, first, second,
third normal forms, BCNF, inclusion dependence, loss less join decompositions,
normalization using FD, MVD, and JDs, alternative approaches to database design.
Transaction Processing Concept: Transaction system, Testing of serializability,
serializability of schedules, conflict & view serializable schedule, recoverability, Recovery
from transaction failures, log based recovery, checkpoints, deadlock handling.
Distributed Database: distributed data storage, concurrency control, directory system.

Concurrency Control Techniques: Concurrency control, Locking Techniques for

concurrency control, Time stamping protocols for concurrency control, validation based
protocol, multiple granularity, Multi version schemes, Recovery with concurrent transaction,
case study of Oracle.
Text books:

IV.

V.

1.Korth, Silbertz, Sudarshan, Database Concepts, McGraw Hill

2.Date C J, An Introduction to Database Systems, Addision Wesley
3. Elmasri, Navathe, Fudamentals of Database Systems, Addision Wesley
4. ONeil, Databases, Elsevier Pub.
References:
1.Leon & Leon,Database Management Systems, Vikas Publishing House
2.Bipin C. Desai, An Introduction to Database Systems, Gagotia Publications
3. Majumdar & Bhattacharya, Database Management System, TMH

Proposed
Lectures
8

Unit
I.

NCS- 503 Principle of Programming Language

Topic
Introduction
The Role of Programming Languages: Why Study Programming Languages,
Towards Higher-Level languages, Programming paradigms, Programming
environments
Language Description: Syntactic structure, language Translation Issues: Programming
language Syntax, Stages in translation, Formal translation Models

II.

310
Proposed
Lectures
8

Language Properties
8
Modeling Language Properties, Elementary Data Types, Encapsulation, Inheritance,
Sequence Control, Subprogram Control
III. Programming Paradigms
8
Imperative Programming: Statements, Types, Procedure Activations
Object-Oriented Programming: Grouping Of Data and Operations, object oriented
programming
Functional Programming: Elements, Programming in a Typed language, Programming
with lists
IV.
Other Programming Paradigms
8
Logic Programming, Concurrent Programming, Network Programming , Language
Description: Semantic Methods
V. Lambda Calculus
8
Introduction to Lambda Calculus, Simple types, Subtyping
Text books:
1. Programming Languages: Design and Implementations , Terrance W.Pratt, Marvin V. Zelkowitz,
T.V.Gopal,Fourth ed.,Prentice Hall
2. Programming languages: Concepts and Constucts, Ravi Sethi, Second Ed.,Pearson.
3. Types and programming Languages, Benjamin C. Pierce. The MIT Press Cambridge, Massachusetts
London, England
References:
1. Concepts of Programming Languages, Robert W. Sebesta, 10th Ed.,Pearson

NCS- 504 Web Technology

Topic

Unit
I.

310
Proposed
Lectures
8

Introduction:
Introduction and Web Development Strategies, History of Web, Protocols governing
Web, Creating Websites for individual and Corporate World, Cyber Laws Web
Applications, Writing Web Projects, web development strategies, Identification of
Objects, Target Users, Web Team, Planning and Process Development,
communication Issues, Quality Assurance and Testing.
II. Web Page Designing:
HTML: list, table, images, frames, forms, CSS, Document type definition, XML:
DTD, XML schemes, Object Models, presenting and using XML, Using XML
Processors: DOM and SAX Introduction to Java Script, Object in Java Script,
Dynamic HTML.
III. Scripting:
Java script: Introduction, documents, forms, statements, functions, objects; event and
event handling; introduction to AJAX, VB Script, Java Beans and Web Servers
Introduction to Java Beans, Advantage, Properties, BDK, Introduction to EJB, Java
Beans API Introduction to Servelets, Lifecycle, JSDK, Servlet API, Servlet Packages:
HTTP package, Working with HTTP request and response, Security Issues.
IV. Server Site Programming:
Introduction to active server pages (ASP), ASP.NET, Introduction to JSP, JSP
processing, JSP Application Design, Tomcat Server, Implicit JSP objects, Conditional
Processing, Declaring variables and methods, Error Handling and Debugging, Sharing
data between JSP pages- Sharing Session and Application Data, data base action,
Database Connectivity Database Programming using JDBC , development of java
beans in JSP, Introduction to Struts framework,
V. PHP (Hypertext Preprocessor):
Introduction, syntax, variables, strings, operators, if-else, loop, switch, array, function,
form, mail, file upload, session, error, exception, filter, PHP-ODBC, Introduction to
COM/DCOM/CORBA.
Text books:
1. Burdman, Jessica, Collaborative Web Development Addison Wesley
2. Xavier, C, Web Technology and Design , New Age International
3. Ivan Bayross, HTML, DHTML, Java Script, Perl & CGI, BPB Publication
4. Bhave, Programming with Java, Pearson Education
5. Herbert Schieldt, The Complete Reference:Java, TMH. 6. Hans Bergsten, Java Server
SPD OReilly
6. Ullman, PHP for the Web: Visual QuickStart Guide, Pearson Education

Pages,

References:

1.
2.
3.
4.
5.
6.

Ramesh Bangia, Internet and Web Design , New Age International

Ivan Bayross, HTML, DHTML, Java Script, Perl & CGI, BPB Publication
Deitel, Java for programmers, Pearson Education
Chris Bates, Web Programing Building Internet Applications, 2nd Edition, WILEY, Dreamtech
Joel Sklar , Principal of web Design Vikash and Thomas Learning
Horstmann, CoreJava, Addison Wesley

Unit

NIT 501 MANAGEMENT INFORMATION SYSTEMS

Topic

210
Proposed
Lectures
8

Foundation of Information Systems: Introduction to information system in business,

fundamentals of information systems, Solving business problems with information
systems, Types of information systems, Effectiveness and efficiency criteria in
information system.

II

An overview of Management Information Systems: Definition of a management

information system, MIS versus Data processing, MIS & Decision Support Systems,
MIS & Information Resources Management, End user computing, Concept of an
MIS,Structure of a Management information system.

III

Concepts of planning: Concept of organizational planning, The Planning Process,

Computational support for planning.
Business applications of information technology: Internet & electronic commerce and
its applications Enterprise Solutions, Information System for Business
Operations(SDLC),Information System for Strategic Advantage,Decision Support
Systems and its benefits and characterstics.

IV

Managing Information Technology: Enterprise & global management, Security &

Ethical challenges, Planning & Implementing changes. Advanced Concepts in
Information Systems: Enterprise Resource Planning, Supply Chain Management,
Customer Relationship Management, and Procurement Management.

TEXT BOOK:
1. O Brian, Management Information System, TMH
2. Gordon B. Davis & Margrethe H. Olson, Management Information System, TMH
3. Ravi Kalakota, Andrew Winston, Frontiers of Electronic Commerce, Addison Wesley.

REFRENCE BOOKS:1. O Brian, Introduction to Information System, MCGRAW HILL.

2. Murdick, Information System for Modern Management, PHI.
3. Jawadekar, Management Information System, TMH.
4. Jain Sarika, Information System, PPM
5. Davis, Information System, Palgrave Macmillan

NCS 551 Design and analysis of algorithms Lab

Objective :1. Program for Recursive Binary & Linear Search.
2. Program for Heap Sort.
3. Program for Merge Sort.
4. Program for Selection Sort.
5. Program for Insertion Sort.
6. Program for Quick Sort.
7.Study of NP-Complete theory.
8.Study of Cooks theorem.
9.Study of Sorting network.
NCS 552 DBMS Lab
Objectives:1. Installing oracle.
2. Creating Entity-Relationship Diagram using case tools.
3. Writing SQL statements Using ORACLE /MYSQL:
a)Writing basic SQL SELECT statements.
b)Restricting and sorting data.
c)Displaying data from multiple tables.
d)Aggregating data using group function.
e)Manipulating data.
e)Creating and managing tables.
4. Normalization in ORACLE.
5. Creating cursor in oracle.
6. Creating procedure and functions in oracle.
7. Creating packages and triggers in oracle.
NCS 553 Principles of programming languages
1. Define a LISP function to compute sum of squares.
2. Define a LISP function to compute difference of squares. (if x > y return x2 -y 2 , otherwise y2 - x2 )
3. Define a Recursive LISP function to solve Ackermanns Function.
4. Define a Recursive LISP function to compute factorial of a given number.
5. Define a Recursive LISP function which takes one argument as a list and returns last element of the list. (do
not use last predicate)
6. Define a Recursive LISP function which takes one argument as a list and returns a list except last element of
the list. (do not use but last predicate)
7. Define a Recursive LISP function which takes one argument as a list and returns reverse of the list. (do not
use reverse predicate)
8. Define a Recursive LISP function which takes two arguments first, an atom, second, a list, returns a list after
removing first occurrence of that atom within the list.

NCS 554 Web Technology Lab

Objectives:1. Write HTML/Java scripts to display your CV in navigator, your Institute website, Department Website
and Tutorial website for specific subject
2. Design HTML form for keeping student record and validate it using Java script.
3. Write programs in core Java for Web Page to display browsers information using Java script.
4. Write a Java applet to display the calculator screen.
5. Use Java Servlets for proxy server.
6. Writing program in XML for creation of DTD, which specifies set of rules. Create a style sheet in CSS/
XSL & display the document in internet explorer.
7. Write an HTML program to design an entry form of student details and send it to store at database
server like SQL, Oracle or MS Access.
8. Using ASP for server side programming, ASP for user name and password and to retrieve & match the
value. It display success and failure messages. ASP for creating text file local drive, ASP for keeping the
student record in database.
9. Program to illustrate JDBC connectivity. Program for maintaining database by sending queries. Design
and implement a simple servlet book query with the help of JDBC & SQL. Create MS Access Database,
Create on ODBC link, Compile & execute JAVA JDVC Socket.
10. Design and implement a simple shopping cart example with session tracking API.

NCS-601
Unit
I

II
III
IV
V

Computer Networks
Topic

Introduction Concepts: Goals and Applications of Networks, Network structure and

architecture, The OSI reference model, services, Network Topology Design - Delay
Analysis, Back Bone Design, Local Access Network Design, Physical Layer Transmission
Media, Switching methods, ISDN, Terminal Handling.
Medium Access sub layer: Medium Access sub layer - Channel Allocations, LAN
protocols - ALOHA protocols - Overview of IEEE standards - FDDI. Data Link Layer Elementary Data Link Protocols, Sliding Window protocols, Error Handling.
Network Layer: Network Layer - Point - to Pont Networks, routing, Congestion control
Internetworking -TCP / IP, IP packet, IP address, IPv6.
Transport Layer: Transport Layer - Design issues, connection management, session
Layer-Design issues, remote procedure call. Presentation Layer-Design issues, Data
compression techniques, cryptography - TCP - Window Management.
Application Layer: Application Layer: File Transfer, Access and Management, Electronic
mail, Virtual Terminals, Other application. Example Networks - Internet and Public
Networks.

TEXTBOOKS:
1. Forouzen, "Data Communication and Networking", TMH
2. A.S. Tanenbaum, Computer Networks, Pearson Education
3. W. Stallings, Data and Computer Communication, Macmillan Press
REFRENCES:
1. Anuranjan Misra, Computer Networks, Acme Learning
2. G. Shanmugarathinam, Essential of TCP/ IP, Firewall Media

310
Proposed
Lectures
8

8
8
8
8

NCS- 602
Unit

Software Engineering
Topic

Introduction:Introduction to Software Engineering, Software Components,

Software Characteristics, Software Crisis, Software Engineering Processes,
Similarity and Differences from Conventional Engineering Processes,
Software Quality Attributes. Software Development Life Cycle (SDLC)
Models: Water Fall Model, Prototype Model, Spiral Model, Evolutionary
Development Models, Iterative Enhancement Models.
II Software Requirement Specifications (SRS):Requirement Engineering
Process: Elicitation, Analysis, Documentation, Review and Management of
User Needs, Feasibility Study, Information Modeling, Data Flow Diagrams,
Entity Relationship Diagrams, Decision Tables, SRS Document, IEEE
Standards for SRS.Software Quality Assurance (SQA): Verification and
Validation, SQA Plans, Software Quality Frameworks, ISO 9000 Models,
SEI-CMM Model.
III Software Design:Basic Concept of Software Design, Architectural Design,
Low Level Design: Modularization, Design Structure Charts, Pseudo Codes,
Flow Charts, Coupling and Cohesion Measures, Design Strategies: Function
Oriented Design, Object Oriented Design, Top-Down and Bottom-Up
Design. Software Measurement and Metrics: Various Size Oriented
Measures: Halesteads Software Science, Function Point (FP) Based
Measures, Cyclomatic Complexity Measures: Control Flow Graphs.
IV
Software Testing:Testing Objectives, Unit Testing, Integration Testing,
Acceptance Testing, Regression Testing, Testing for Functionality and
Testing for Performance, Top-Down and Bottom-Up Testing Strategies: Test
Drivers and Test Stubs, Structural Testing (White Box Testing), Functional
Testing (Black Box Testing), Test Data Suit Preparation, Alpha and Beta
Testing of Products.Static Testing Strategies: Formal Technical Reviews
(Peer Reviews), Walk Through, Code Inspection, Compliance with Design
and Coding Standards.
V Software Maintenance and Software Project Management:Software as an
Evolutionary Entity, Need for Maintenance, Categories of Maintenance:
Preventive, Corrective and Perfective Maintenance, Cost of Maintenance,
Software Re-Engineering, Reverse Engineering. Software Configuration
Management Activities, Change Control Process, Software Version Control,
An Overview of CASE Tools. Estimation of Various Parameters such as
Cost, Efforts, Schedule/Duration, Constructive Cost Models (COCOMO),
Resource Allocation Models, Software Risk Analysis and Management.
Textbooks:
1. R. S. Pressman, Software Engineering: A Practitioners Approach,
McGraw Hill.
2. Rajib Mall, Fundamentals of Software Engineering, PHI Publication.
3. K. K. Aggarwal and Yogesh Singh, Software Engineering, New Age
International Publishers.
4. Pankaj Jalote, Software Engineering, Wiley
5.Deepak Jain,Software Engineering:Principles and Practices,Oxford
University Press.

310
Proposed
Lectures
8

NCS-603
Unit

Compiler Design
Topic

I Introduction to Compiler, Phases and passes, Bootstrapping, Finite

state machines and regular expressions and their applications to
lexical analysis, Optimization of DFA-Based Pattern Matchers
implementation of lexical analyzers, lexical-analyzer generator, LEXcompiler, Formal grammars and their application to syntax analysis,
BNF notation, ambiguity, YACC. The syntactic specification of
programming languages: Context free grammars, derivation and
parse trees, capabilities of CFG.
II Basic Parsing Techniques: Parsers, Shift reduce parsing, operator
precedence parsing, top down parsing, predictive parsers Automatic
Construction of efficient Parsers: LR parsers, the canonical
Collection of LR(0) items, constructing SLR parsing tables,
constructing Canonical LR parsing tables, Constructing LALR
parsing tables, using ambiguous grammars, an automatic parser
generator, implementation of LR parsing tables.
III Syntax-directed Translation: Syntax-directed Translation schemes,
Implementation of Syntax-directed Translators, Intermediate code,
postfix notation, Parse trees & syntax trees, three address code,
quadruple & triples, translation of assignment statements, Boolean
expressions, statements that alter the flow of control, postfix
translation, translation with a top down parser. More about
translation: Array references in arithmetic expressions, procedures
call, declarations and case statements.
IV Symbol Tables: Data structure for symbols tables, representing scope
information. Run-Time Administration: Implementation of simple
stack allocation scheme, storage allocation in block structured
language. Error Detection & Recovery: Lexical Phase errors,
syntactic phase errors semantic errors.
Code Generation: Design Issues, the Target Language. Addresses
V
in the Target Code, Basic Blocks and Flow Graphs, Optimization
of Basic Blocks, Code Generator.
Code optimization: Machine-Independent Optimizations, Loop
optimization, DAG representation of basic blocks, value numbers and
algebraic laws, Global Data-Flow analysis.

310
Proposed
Lectures
8

Textbooks:
1. Aho, Sethi & Ullman, "Compilers: Principles, Techniques and Tools, Pearson
Education
2. V Raghvan, Principles of Compiler Design, TMH
3. Kenneth Louden, Compiler Construction, Cengage Learning.
4. Charles Fischer and Ricard LeBlanc, Crafting a Compiler with C, Pearson
Education
Refrences:
1.K. Muneeswaran,Compiler Design,First Edition,Oxford University Press.
2.J.P. Bennet, Introduction to Compiler Techniques, Second Edition, Tata McGraw-Hill,
2003.
3.Henk Alblas and Albert Nymeyer,Practice and Principles of Compiler Building with
C, PHI, 2001.

DEPARTMENTAL ELECTIVE-I
NIT-061
Unit

Information Retrieval and Management

Topic

I Basic Concepts of IR, Data Retrieval & Information Retrieval, IR system

II

III

IV

block diagram. Automatic Text Analysis, Luhn's ideas, Conflation

Algorithm, Indexing and Index Term Weighing, Probabilistic Indexing,
Automatic Classification. Measures of Association, Different Matching
Coefficient, Classification Methods, Cluster Hypothesis. Clustering
Algorithms, Single Pass Algorithm, Single Link Algorithm, Rochhio's
Algorithm and Dendograms
File Structures, Inverted file, Suffix trees & suffix arrays, Signature files,
Ring Structure, IR Models, Basic concepts, Boolean Model, Vector Model,
and Fuzzy Set Model. Search Strategies, Boolean search, serial search, and
clusterbased retrieval, Matching Function.
Performance Evaluation- Precision and recall, alternative measures
reference collection (TREC Collection), Libraries & Bibliographical
system- Online IR system, OPACs, Digital libraries - Architecture issues,
document models, representation & access, Prototypes, projects &
interfaces, standards
Taxonomy and Ontology: Creating domain specific ontology, Ontology life
cycle Distributed and Parallel IR: Relationships between documents,
Identify appropriate networked collections, Multiple distributed collections
simultaneously, Parallel IR - MIMD Architectures, Distributed IR
Collection Partitioning, Source Selection, Query Processing
Multimedia IR models & languages- data modeling, Techniques to
represent audio and visual document, query languages Indexing &
searching- generic multimedia indexing approach, Query databases of
multimedia documents, Display the results of multimedia searches, one
dimensional time series, two dimensional color images, automatic feature
extraction.
Searching the Web, Challenges, Characterizing the Web, Search Engines,
Browsing, Mata searchers, Web crawlers, robot exclusion, Web data
mining, Metacrawler, Collaborative filtering, Web agents (web shopping,
bargain finder), Economic, ethical, legal and political issues..

310
Proposed
Lectures
8

Text Books :
1. Yates & Neto, "Modern Information Retrieval", Pearson Education, ISBN 81-297-0274-6
2. I. Witten, A. Moffat, and T. Bell, Managing Gigabytes 4. D. Grossman and O. Frieder
Information Retrieval: Algorithms and Heuristics
Reference Books :
1. Mark leven, Introduction to search engines and web navigation, John Wiley and sons Inc., ISBN
9780-170-52684-2.
2. V. S. Subrahamanian, Satish K. Tripathi Multimedia information System, Kulwer Academic
Publisher
3. Chabane Djeraba, Multimedia mining A highway to intelligent multimedia documents, Kulwer
Academic Publisher, ISBN 1-4020-7247-3

NIT-062
Unit

Modelling and Simulation

Topic

I System definition and components, stochastic activities, continuous

and discrete systems, System modeling, Types of models, static and
dynamic physical models, static and dynamic mathematical models,
full corporate model, types of system study.
II System simulation, Need of simulation, Basic nature of simulation,
techniques of simulation, comparison of simulation and analytical
methods, types of system Simulation, real time simulation, hybrid
simulation, simulation of pursuit problem, single-server queuing
system and an inventory problem, Monte-Carlo simulation,
Distributed Lag model, Cobweb model.
III Simulation of continuous Systems, analog vs digital simulation,
simulation of water reservoir system, simulation of a servo system,
simulation of an auto-pilot. Discrete system simulation, fixed timestep vs event-to-event model, generation of random numbers, test of
randomness, Monte-Carlo computation vs stochastic simulation.
IV System dynamics ,exponential growth models, exponential decay
models, logistic curves, system dynamics diagrams, world model.
V Simulation of PERT networks, critical path computation,
uncertaintities in activityduration, resource allocation and
consideration, Simulation languages, object oriented simulation.
Textbooks:
1) Geoftrey Gordon, System Simulation, PHI
2) Narsingh Deo, System Simulation with digital computer, PHI.
3) Averill M. Law, W. David Kelton, Simulation Modelling and
Analysis,TMH.

310
Proposed
Lectures
8

8
8

NIT-063
Unit

Bioinformatics
Topic

I Bioinformatics objectives and overviews, Interdisciplinary nature of

Bioinformatics, Data integration, Data analysis, Major
Bioinformatics databases and tools. Metadata: Summary & reference
systems, finding new type of data online.
Molecular Biology and Bioinformatics: Systems approach in
biology, Central dogma of molecular biology, problems in
molecular approach and the bioinformatics approach, oerview
of the bioinformatics applications.
II Basic chemistry of nucleic acids, Structure of DNA,
Structure of RNA, DNA Replication, TranscriptionTranslation, Genes- the functional elements in DNA,
Analyzing DNA,DNA sequencing. Proteins: Amino acids,
Protein structure, Secondary, Tertiary and Quaternary
structure, Protein folding and function, Nucleic acid-Protein
interaction.
III Perl Basics, Perl applications for bioinformatics- Bioperl, Linux
Operating System, mounting/unmounting files, tar, gzip / gunzip,
telnet, ftp, developing applications on Linux OS, Understanding and
Using Biological Databases, Overview of Java, CORBA, XML, Web
deployment concepts.
IV Genome, Genomic sequencing, expressed sequence tags, gene
expression, transcription factor binding sites and single nucleotide
polymorphism. Computational representations
of molecular biological data storage techniques: databases (flat,
relational and object oriented), and controlled vocabularies, general
data retrieval techniques: indices, Boolean
search, fuzzy search and neighboring, application to biological data
warehouses.
V Macromolecular structures, chemical compounds, generic variability
and its connection to clinical data. Representation of patterns and
relationships: sequence alignment algorithms, regular expressions,
hierarchies and graphical models, Phylogenetics. BLAST.

310
Proposed
Lectures
8

Textbooks :
1. D E Krane & M L Raymer, Fundamental concepts of Bioinformatics, Perason
Education.
2. Rastogi, Mendiratta, Rastogi, Bioinformatics Methods & applications, Genomics,
Proteomics & Drug Discovery PHI, New Delhi
3. Shubha Gopal et.al. Bioinformatics: with fundamentals of genomics and proteomics,
Mc Graw Hill.
4. OReilly, Developing Bio informatics computer skills, CBS
5. Forsdyke, Evolutionary Bioinformatics, Springer

NIT-064
Unit

Knowledge based decision Support System

Topic

I DECISION MAKING AND COMPUTERIZED SUPPORT : Management

II

III

IV

Support Systems: An Overview - Decision Making, Systems, Modeling ,

and Support.
DECISION SUPPORT SYSTEMS: Decision Support Systems: An
Overview - Modeling and Analysis - Business Intelligence: Data
Warehousing, Data Acquisition, Data Mining, Business Analysis, and
Visualization - Decision Support System Development.
COLLABORATION, COMMUNICATION, ENTERPRISE DECISION
SUPPORT SYSTEMS, AND KNOWLEDGE MANAGEMENT:
Collaborative Computing Technologies: Group Support Systems Enterprise Information Systems - knowledge Management.
INTELLIGENT DECISION SUPPORT SYSTEMS: Artificial Intelligence
and Expert Systems: Knowledge-Based System - Knowledge Acquisition,
Representation, and Reasoning - Advanced Intelligent Systems - Intelligent
Systems over the Internet.
IMPLEMENTING IN THE E-BUSINESS ERA : Electronic Commerce Integration, Impacts, and the Future of the Management Support Systems.

310
Proposed
Lectures
8
8

Text Book:
1. Efraim Turban, Jay Aronson E., Ting-Peng Liang, "Decision Support Systems and Intelligent
Systems", 7th Edition, Pearson Education, 2006.
References:
1. George M .Marakas , "Decision Support Systems in the 21st century",2nd Edition, PHI, 2009.
2. Janakiraman V.S., Sarukesi K., Decision Support Systems, PHI, 2009.

NIT-065
Unit

Geographic Information System

Topic

I FUNDAMENTALS OF GIS,What is GIS Introduction Defining GIS

310
Proposed
Lectures
8

Components of a GIS Spatial data Introduction - Maps and their

influence on the character of spatial data Other sources of spatial data

II SPATIAL DATA MODELING :Introduction Entity definition Spatial

data models Spatial data structures Modeling surfaces Modeling
networks Building computer networks Modeling the third dimension
modeling the fourth dimension - Attribute data management - Introduction
Why choose a databaseapproach? - Database data models Creating a
database GIS database applications Developments in databases
III DATA INPUT AND EDITING :Introduction Methods of data input
Data editing Towards an integrated database - Data analysis: Introduction
Measurements in GIS lengths, perimeters and areas Queries
Reclassification Buffering and neighborhood functions Integrating data
map overlay Spatial interpolation Network analysis.
IV ANALYTICAL MODELING IN GIS : Introduction process models
Modeling physical and environmental processes Modeling human
Processes Modeling the decision making process Problems with using
GIS to model spatial processes - Output: from new maps to enhanced
decisions: Introduction Maps as output Non-cartographic output
Spatial multimedia Mechanisms of delivery GIS and spatial decision
support
V ISSUES IN GIS - The development of computer methods for handling
spatial data Introduction Handling spatial data manually The
development of computer methods for handling spatial data The
development of GIS - Data quality issues Introduction Describing data
quality and errors sources of errors in GIS

Text Books:
1. Ian Heywood, Sarah Cornelius and Steve carver, Introduction to geographical information
systems, Pearson Education, 4th Edition, 2012.
Refrences:
1. DeMers, M.N., Fundamentals of Geographic Information Systems, 3 rdEdition, Wiley
Press, 2009.
2. Lo C.P. and Yeung, A.K.W.,Concepts and Techniques of Geographic Information
Systems, Prentice Hall, 2002.
3. Burrough, P.A. and R.A. McDonald, Principles of Geographical Information Systems,
Oxford University Press, 1998.

DEPARTMENTAL ELECTIVE-II
310
NCS-066
Data warehousing & Data Mining
Un
Topic
Proposed
it
Lectures
I Data Warehousing: Overview, Definition, Data Warehousing Components,
8
Building a Data Warehouse, Warehouse Database, Mapping the Data
Warehouse to a Multiprocessor Architecture, Difference between Database
System and Data Warehouse, Multi Dimensional Data Model, Data Cubes,
Stars, Snow Flakes, Fact Constellations, Concept hierarchy, Process
Architecture, 3 Tier Architecture, Data Marting.
II Data Warehouse Process and Technology: Warehousing Strategy, Warehouse
8
/management and Support Processes, Warehouse Planning and Implementation,
Hardware and Operating Systems for Data Warehousing, Client/Server
Computing Model & Data Warehousing. Parallel Processors & Cluster
Systems, Distributed DBMS implementations, Warehousing Software,
Warehouse Schema Design, Data Extraction, Cleanup & Transformation Tools,
Warehouse Metadata
III Data Mining: Overview, Motivation, Definition & Functionalities, Data
8
Processing, Form of Data Preprocessing, Data Cleaning: Missing Values, Noisy
Data,(Binning,
Clustering,
Regression,
Computer
and
Human
inspection),Inconsistent Data, Data Integration and Transformation. Data
Reduction:-Data Cube Aggregation, Dimensionality reduction, Data
Compression, Numerosity Reduction, Discretization and Concept hierarchy
generation, Decision Tree.
IV Classification: Definition, Data Generalization, Analytical Characterization,
8
Analysis of attribute relevance, Mining Class comparisons, Statistical measures
in large Databases, Statistical-Based Algorithms, Distance-Based Algorithms,
Decision Tree-Based Algorithms.
Clustering: Introduction, Similarity and Distance Measures, Hierarchical and
Partitional Algorithms. Hierarchical Clustering- CURE and Chameleon.
Density Based Methods-DBSCAN, OPTICS. Grid Based Methods- STING,
CLIQUE. Model Based Method Statistical Approach,
Association rules: Introduction, Large Itemsets, Basic Algorithms, Parallel and
Distributed Algorithms, Neural Network approach.
VData Visualization and Overall Perspective: Aggregation, Historical
8
information, Query Facility, OLAP function and Tools. OLAP Servers,
ROLAP, MOLAP, HOLAP, Data Mining interface, Security, Backup and
Recovery, Tuning Data Warehouse, Testing Data Warehouse. Warehousing
applications and Recent Trends: Types of Warehousing Applications, Web
Mining, Spatial Mining and Temporal Mining.
TEXTBOOKS:
1. Alex Berson, Stephen J. Smith Data Warehousing, Data-Mining & OLAP, TMH
2. Mark Humphries, Michael W. Hawkins, Michelle C. Dy, Data Warehousing: Architecture
and Implementation, Pearson
3. Margaret H. Dunham, S. Sridhar,Data Mining:Introductory and Advanced Topics Pearson
Education
4. Arun K. Pujari, Data Mining Techniques Universities Press
5. Pieter Adriaans, Dolf Zantinge, Data-Mining, Pearson Education

Unit

NCS-070 Human Computer Interaction

Topic

I Introduction : Importance of user Interface definition, importance of

good design. Benefits of good design. A brief history of Screen design.
The graphical user interface popularity of graphics, the concept of
direct manipulation, graphical system, Characteristics, Web user
Interface popularity, characteristics- Principles of user interface.
II Design process Human interaction with computers, importance of
human characteristics human consideration, Human interaction speeds,
understanding business junctions.
III Screen Designing : Design goals Screen planning and purpose,
organizing screen elements, ordering of screen data and content
screen navigation and flow Visually pleasing composition amount
of information focus and emphasis presentation information simply
and meaningfully information retrieval on web statistical graphics
Technological consideration in interface design.
IV Windows New and Navigation schemes selection of window,
selection of devices based and screen based controls.
Components text and messages, Icons and increases Multimedia,
colors, uses problems, choosing colors.
V Software tools Specification methods, interface Building Tools.
Interaction Devices Keyboard and function keys pointing devices
speech recognition digitization and generation image and video
displays drivers.

310
Proposed
Lectures
8

TEXT BOOKS:

1. Alan Dix, Janet Finlay, Gregory Abowd, Russell Beale Human Computer Interaction, 3rd
Edition Prentice Hall, 2004.
2. Jonathan Lazar Jinjuan Heidi Feng, Harry Hochheiser, Research Methods in HumanComputer
Interaction, Wiley, 2010.
REFERENCE:
1. Ben Shneiderman and Catherine Plaisant Designing the User Interface: Strategies
for Effective Human-Computer Interaction (5th Edition, pp. 672, ISBN 0-321-53735-1,
March 2009), Reading, MA: Addison-Wesley Publishing Co.

NIT 066
Unit

E-Business Strategies
Topic

I Electronic Commerce Environment and Opportunities:

Background The Electronic Commerce Environment Electronic
Marketplace Technologies Modes of Electronic Commerce:
Overview Electronic Data Interchange Migration to Open EDI
Electronic Commerce with WWW/Internet Commerce Net
Advocacy

Web
Commerce
going
forward.

310
Proposed
Lectures
8

II Approaches to Safe Electronic Commerce: Overview Secure Transport

III Internet/Intranet Security Issues and Solutions: The need for Computer

IV MasterCard/Visa Secure Electronic Transaction: Introduction

V Internet and Website Establishment: Introduction Technologies for

Protocols Secure Transactions Secure Electronic Payment

Protocol(SEPP) Secure Electronic Transaction (SET)- Certificates for
Authentication Security on Web Servers and Enterprise Networks
Electronic cash and Electronic payment schemes: Internet Monetary
payment and security requirements payment and purchase order process Online
Electronic
cash.

Security Specific Intruder Approaches Security strategies Security

tools Encryption Enterprise Networking and Access to the Internet
Antivirus
programs

Security
Teams.
Business Requirements Concepts Payment processing E-mail and
secure e-mail technologies for electronic commerce. Introduction The
Mean of Distribution A model for message handling Working of Email MIME: Multipurpose Internet Mail Extensions S/MIME: Secure
Multipurpose Internet Mail Extensions MOSS: Message Object Security
Services.
web servers Internet tools relevant to Commerce Internet Applications
for Commerce Internet charges Internet Access and Architecture
Searching the Internet- Case study.

TEXT BOOK 1. Daniel Minoli and Emma Minoli, Web Commerce Technology
Handbook, Tata McGraw-Hill, 2005.
REFERENCES 1. Andrew B. Whinston, Ravi Kalakota, K. Bajaj and D. Nag, Frontiers of
Electronic Commerce, Tata McGraw-Hill, 2004. 2. Bruce C. Brown, How to Use the
Internet to Advertise, Promote and Market Your Business or Website with Little or No
Money, Atlantic Publishing Company, 2006.

NCS-067
Unit

Distributed Database
Topic

310
Proposed
Lectures
8

I Transaction and schedules, Concurrent Execution of transaction,

Conflict and View Serializability, Testing for Serializability,
Concepts in Recoverable and Cascadeless schedules.
II Lock based protocols, time stamp based protocols, Multiple
8
Granularity and Multiversion Techniques, Enforcing serializablity by
Locks, Locking system with multiple lock modes, architecture for
Locking scheduler.
Transactions
Management,
Data Distribution,
III Distributed
8
Fragmentation and Replication Techniques, Distributed Commit,
Distributed Locking schemes, Long duration transactions, Moss
Concurrency protocol.
IV Issues of Recovery and atomicity in Distributed Databases,
8
Traditional recovery techniques, Log based recovery, Recovery with
Concurrent Transactions, Recovery in Message passing systems,
Checkpoints, Algorithms for recovery line, Concepts in Orphan and
Inconsistent Messages.
V Distributed Query Processing, Multiway Joins, Semi joins, Cost
8
based query optimization for distributed database, Updating
replicated data, protocols for Distributed Deadlock Detection, Eager
and Lazy Replication Techniques.
References
1. Silberschatz,korth and Sudershan, Database System Concept, Mc Graw Hill
2. Ramakrishna and Gehrke, Database Management System, Mc Graw Hill
3. Garcia-Molina, Ullman,Widom, Database System Implementation Pearson
Education
4. Ceei and Pelagatti,Distributed Database, TMH
5. Singhal and Shivratri, Advance Concepts in Operating Systems MC Graw Hill

Unit

NIT 067- BIG DATA

Topic

I UNDERSTANDING BIG DATA

What is big data,why big data,convergence of key trends, unstructured
data, industry examples of big data, web analytics,big data and
marketing,fraud and big data,risk and big data ,credit risk management,
big data and algorithmic trading,big data and healthcare,big
data in medicine,advertising and big data,big data technologies,
introduction to Hadoop,open source technologies,cloud and big data
mobile business intelligence,Crowd sourcing
analytics ,inter and trans firewall analytics
II NOSQL DATA MANAGEMENT
Introduction to NoSQL , aggregate data models ,aggregates ,key-value
and document data models, relationships, graph databases, schema less
databases ,materialized views,distribution models ,sharding , masterslave replication , peer-peer replication , sharding and
replication , consistency , relaxing consistency , version stamps , mapreduce , partitioning and
combining , composing map-reduce calculations
III BASICS OF HADOOP
Data format , analyzing data with Hadoop , scaling out , Hadoop
streaming , Hadoop pipes ,
design of Hadoop distributed file system (HDFS) , HDFS concepts ,
Java interface , data flow ,Hadoop I/O , data integrity , compression ,
serialization , Avro file-based data structures
IV MAP REDUCE APPLICATIONS
Map Reduce workflows , unit tests with MRUnit , test data and local
tests anatomy of Map Reduce job run , classic Map-reduce , YARN ,
failures in classic Map-reduce and YARN , job scheduling , shuffle and
sort , task execution , MapReduce types , input formats , output formats
.
V HADOOP RELATED TOOLS
Hbase,data model and implementations, Hbase clients ,Hbase examples
praxis.Cassandra ,cassandra data model , cassandra examples ,
cassandra clients , Hadoop integration.
Pig , Grunt , pig data model , Pig Latin , developing and testing Pig
Latin scripts. Hive , data types and file formats , HiveQL data definition
, HiveQL data manipulation HiveQL queries

310
Proposed
Lectures
8

Text Books:
1. Michael Minelli, Michelle Chambers, and Ambiga Dhiraj, "Big Data, Big Analytics: Emerging
Business Intelligence and Analytic Trends for Today's Businesses", Wiley, 2013.
2. P. J. Sadalage and M. Fowler, "NoSQL Distilled: A Brief Guide to the Emerging World of
Polyglot Persistence", Addison-Wesley Professional, 2012.
3. Tom White, "Hadoop: The Definitive Guide", Third Edition, O'Reilley, 2012.
4. Eric Sammer, "Hadoop Operations", O'Reilley, 2012.
5. E. Capriolo, D. Wampler, and J. Rutherglen, "Programming Hive", O'Reilley, 2012.
6. Lars George, "HBase: The Definitive Guide", O'Reilley, 2011.
7. Eben Hewitt, "Cassandra: The Definitive Guide", O'Reilley, 2010.
8. Alan Gates, "Programming Pig", O'Reilley, 2011.

NCS 651 Computer Networks Lab

1. Programs using TCP Sockets (like date and time server & client, echo server & client, etc.)
2. Programs using UDP Sockets (like simple DNS)
3. Programs using Raw sockets (like packet capturing and filtering)
4. Programs using RPC
5. Simulation of sliding window protocols
NCS 652 Software Engineering Lab
For any given case/ problem statement do the following;
1. Prepare a SRS document in line with the IEEE recommended standards.
2. Draw the use case diagram and specify the role of each of the actors. Also state the
precondition, post condition and function of each use case.
3. Draw the activity diagram.
4. Identify the classes. Classify them as weak and strong classes and draw the class
diagram.
5. Draw the sequence diagram for any two scenarios.
6. Draw the collaboration diagram.
7. Draw the state chart diagram.
8. Draw the component diagram.
9. Perform forward engineering in java.(Model to code conversion)
10. Perform reverse engineering in java.(Code to Model conversion)
11. Draw the deployment diagram.

NCS 653 Compiler Design Lab

1.
2.
3.
4.
5.
6.
7.
8.
9.

Implementation of LEXICAL ANALYZER for IF STATEMENT

Implementation of LEXICAL ANALYZER for ARITHMETIC EXPRESSION
Construction of NFA from REGULAR EXPRESSION
Construction of DFA from NFA
Implementation of SHIFT REDUCE PARSING ALGORITHM
Implementation of OPERATOR PRECEDENCE PARSER
Implementation of RECURSIVE DESCENT PARSER
Implementation of CODE OPTIMIZATION TECHNIQUES
Implementation of CODE GENERATOR