B.tech Syllabus
B.tech Syllabus
SCHOOL OF ENGINEERING
Syllabus for
B.Tech.
In
1|91
Babu Banarasi Das University, Lucknow Department of CSE
SYLLABUS
BCS3101/ BCS3201 Foundation of Information Technology
Course Objective:
1. Introduce the fundamentals of computing devices and reinforce computer
vocabulary, particularly with respect to personal use of hardware and software,
the internet, network and mobile computing.
2. Study the basic concepts and functions of hardware and software.
3. Study the basic concepts and functions of operating system.
4. Study the basic concepts and functions of computer network.
5. Study the basic concepts and functions of Information Technology.
6. Study the basic concepts of C programming language.
7. Provide foundational or “Computer literacy” curriculum that prepares students
for life-long learning of computer concept and skills.
Learning Outcome:
At the end of the course, the student should be able to:
1. Understanding organization of computer system and networking.
2. An ability to understand the basics of computer hardware and software.
3. Awareness of basic information security issues.
4. To understand the use of Information Technology in business.
5. To analyse and understand various types of software system.
6. An ability to understand operating system and its functions.
7. Ability to apply knowledge and practice on office tools to develop I.T
application.
8. To analyse various computer networks.
Course Contents:
Total
Module Course Topics Credits
Hours
Hardware and Software
Hardware, Software, Information technology, Types
of computer: Mainframe computer, network
computer, personal computer, laptop, personal digital
assistant (PDA); Personal computer: Central
processing unit (CPU), hard disk, common input or
output devices, types of memory viz. RAM, ROM,
peripheral device, computer performance.
Input Devices: Mouse, keyboard, trackball, scanner,
I touchpad, light pen, joystick, digital camera and 30 Hours 1
microphone. Output Devices: Monitors, screens,
printers, plotters, speakers. Input/output Devices:
Modems, Touch Screens. Storage Devices: Diskette,
Zip disk, data cartridges, CD-ROM, internal, external
hard disk: Disk formatting
Software: Types Of Software: Operating systems
software and application software, Software versions,
Operating System: Functions and Types. Graphical
User Interface (GUI), SDLC and its phases.
2|91
Babu Banarasi Das University, Lucknow Department of CSE
Computer Network
Networks: LAN, WAN, client/server, sharing
printers, applications, and files across a network.
Intranet, Extranet, Internet and its uses, World Wide
Web (WWW)
II 30 Hours 1
The Telephone Network In Computing: Public
Switched Telephone Network (PSTN), Integrated
Services Digital Network (ISDN), Asymmetric
Digital Subscriber Line (ADSL), Analog and digital
modem and transfer rate.
Information Technology (IT)
Applications of IT: Applications in business such as:
business administration systems, airline booking
systems, insurance claims processing, online banking.
Uses of large-scale computer applications in
government such as: public records systems (census,
vehicle registration), revenue collection, electronic
voting. Applications in education such as: student
registration and timetabling systems, computer-based
III training (CBT), distance learning, homework using 30 Hours 1
the Internet. Electronic World: electronic mail, E-
Commerce, concept of purchasing goods and services
online, payment methods, advantages and
disadvantages of purchasing goods and services
online
Health, safety and environment: Ergonomics, health
issues, precautions, recycling printed outputs,
recycling printer toner cartridges, using efficient
monitor
Introduction to the C Language
Introduction to the C Language and its Advantages, C
Program: Structure, Writing, Building an Executable
Version, Debugging, and Running.
IV 30 Hours 1
Data Types and Variables, Operands, Operators, and
Arithmetic Expressions, Control statements, use of
while, for and do while loops, nesting loops and
break, continue statement.
Text/Reference Books:
1. D. S. Yadav, “Foundations of Information Technology”, New Age
International Pvt. Ltd.
2. Silberschatz, Galvin and Gagne, “Operating Systems Concepts”, Wiley
Publication
3. D M Dhamdhere, “Operating Systems: A Concept based Approach”, TMH
4. Yashavant P. Kanetkar, “Let us C”, BPB
3|91
Babu Banarasi Das University, Lucknow Department of CSE
4|91
Babu Banarasi Das University, Lucknow Department of CSE
5|91
Babu Banarasi Das University, Lucknow Department of CSE
6|91
Babu Banarasi Das University, Lucknow Department of CSE
7|91
Babu Banarasi Das University, Lucknow Department of CSE
8|91
Babu Banarasi Das University, Lucknow Department of CSE
9|91
Babu Banarasi Das University, Lucknow Department of CSE
10 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
11 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
into browser rendering engine and browser control. The web browser control,
too, consists of several sub-components including navigation, window control,
event handlers, page display etc.
7. Develop a UML Sequence diagram for an information system for online book
store.
8. Develop a UML Class diagram & Sequence diagram for car manufacturing
process.
9. Develop State-Transition diagram for online air reservation system
10. Develop Deployment diagram for different scenarios of Railway Reservation
System.
Text/Reference Books:
1. Use Case Driven Object Modelling with UML: Theory and Practice, Apress,
2007
2. UML 2 Certification Guide: Fundamental & Intermediate Exams (The
MK/OMG Press), Morgan Kaufmann, 2006
3. UML Distilled: A Brief Guide to the Standard Object Modelling Language,
Addison Wesley
12 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
13 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
14 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
15 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
16 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
17 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
18 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
19 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
20 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
5. Given the list of processes, their CPU burst times and arrival times,
display/print the Gantt chart for Priority and Round robin. For each of the
scheduling policies, compute and print the average waiting time and average
turnaround time.
6. Developing Application using Inter Process communication (using shared
memory, pipes or message queues).
7. Implement the Producer – Consumer problem using semaphores (using UNIX
system calls).
8. Implement memory management scheme: Free space is maintained as a linked
list of nodes with each node having the starting byte address and the ending
byte address of a free block. Each memory request consists of the process-id
and the amount of storage space required in bytes. Allocated memory space is
again maintained as a linked list of nodes with each node having the process-
id, starting byte address and the ending byte address of the allocated space.
9. Implement any file allocation technique (Linked, Indexed or Contiguous).
21 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
22 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Text/Reference Books:
1. Rajib Mall, “Fundamentals of Software Engineering”, Prentice Hall India.
2. Pankaj Jalote, “An integrated approach to Software Engineering”, Springer/Narosa.
3. Roger S. Pressman, “Software Engineering: A practitioner's approach”, McGraw
Hill.
4. Ian Sommerville, “Software Engineering”, Addison-Wesley.
23 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
8085 Microprocessor
8 bit Microprocessor: Internal architecture; PIN
diagram; interrupt and machine cycle; Instruction
II sets: Addressing modes; Instruction Classification; 30 1
machine control and assembler directives; Technical Hours
features of: The Pentium, PentiumPro Micro
Processor, Pentium II, Pentium III, Pentium – IV
Microprocessor.
24 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Peripheral Interfacing
Introduction to Peripheral Devices 8237 4.2 DMA
IV Controller;8255 programmable peripheral interface; 30 1
8253/8254 programmable timer/counter; 8259 Hours
programmable interrupt controller; 8251 USART and
RS232C.
Text/Reference Books:
1. Gaonkar, Ramesh S: “Microprocessor Architecture, Programming and
Applications with 8085”, Penram International Publishing.
2. Ray A K , Bhurchandi K M : “Advanced Microprocessors and Peripherals”,
TMH
3. Hall D V: “Microprocessor Interfacing”, TMH
4. Liu and Gibson G A: “Microcomputer System: The 8086/8088 family’’, PHI
5. Aditya P Mathur: “Introduction to Microprocessor”, TMH
6. Brey, Barry B: “INTEL Microprocessors”, PHI
7. Renu Singh & B. P. Singh, “Microprocessor, Interfacing and Applications”, 8.
M Rafiqzzaman, “Microprocessors, Theory and Applications”, Prentice Hall,
1992
25 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
4. Identify the different types of network devices and their functions within a
network
5. Understand and building the skills of routing mechanisms.
6. Analysis the requirements for a given organizational structure and select the
most appropriate networking architecture and technology.
Course Contents:
Total
Module Course Topics Credits
Hours
Introduction
Introduction: Network objectives and applications;
network structure and architecture; OSI reference
model; network services; network standardization; 30
I examples of network; Physical layer: Fundamentals of Hours 1
data communication; transmission media; analog
transmission; digital transmission; switching;
ISDN; terminal handling; Broadcast channels and
medium access: LAN protocols.
Application Layer
Application layer: Design issues; File transfer and 30
IV file access; electronic mail; virtual terminals; other Hours 1
applications, Case study based on available network
software.
Text/Reference Books:
1. Andrew S. Tanenbaum “Computer Networks” Prentice Hall of India.
2. William Stallings “Local Networks” Maxwell Macmillan International
Edition.
26 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Course Contents:
Total
Module Course Topics Credits
Hours
Introduction to Automata
Introduction, Alphabets, Strings and Languages,
Automata and Grammars, Deterministic finite
Automata (DFA)-Formal Definition- State transition
I graph, Transition table, Language of DFA.
Nondeterministic finite Automata (NFA)-NFA with 30 Hours 1
epsilon transition, Language of NFA, Equivalence of
NFA and DFA, Minimization of Finite Automata,
Myhill-Nerode Theorem.
27 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Regular expression
Operators of regular expression and their precedence,
Algebraic laws for Regular expressions, Kleen’s
Theorem, Regular expression to FA, Application and
Limitations of FA, DFA to Regular expression-
II Arden Theorem, Non Regular Languages, Pumping 30Hours 1
Lemma for regular Languages - Application of
Pumping Lemma, Closure and Decision properties of
Regular Languages, FA with output -Moore and
Mealy machine, Equivalence of Moore and Mealy
Machine.
Text/Reference Books:
1. 1.Hopcroft, Ullman, “Introduction to Automata Theory, Languages and
Computation”, Pearson Education.
2. K.L.P. Mishra and N. Chandrasekaran, “Theory of Computer Science:
Automata, Languages and Computation”, PHI Learning Private Limited, Delhi
India.
28 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
29 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Text/Reference Books:
1. Donald Hearn and M Pauline Baker, “Computer Graphics C Version”, Pearson
Education
2. Amrendra N Sinha and Arun D Udai, “Computer Graphics”, TMH
3. Donald Hearn and M Pauline Baker, “Computer Graphics with OpenGL”,
Pearson education
4. Steven Harrington, “Computer Graphics: A Programming Approach”, TMH
5. Rogers, “Procedural Elements of Computer Graphics”, McGraw Hill
30 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
31 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
32 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
33 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Text/Reference Books:
1. Patrick Naughton and HerbertzSchildt, “Java-2: The Complete Reference”,
TMH, 1999.
2. Bill Vanners, “Inside Java Virtual Machine”, TMH, 2nd Ed.
3. Rick Dranell, “HTML 4 unleashed”, Techmedia Publication, 2000
4. Shelley Powers, “Dynamic Web Publishing”, 2nd Ed., Techmedia, 1998.
5. Paul Dietel and Harvey Deitel, “Java How to Program”, PHI, 8th Ed., 2010
6. E. Balaguruswamy, “Programming with Java: A Primer”, TMH, 1998.
34 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Graph Algorithms
Graph Algorithms: Elementary Graphs Algorithms,
III Depth first Search and Breadth First Search,
Minimum Spanning Trees, Shortest paths problem 30
1
Single-source Shortest Paths, All-Pairs Shortest Paths Hours
Maximum Flow and Flow networks, Back Tracking
Selected Topics
30
IV Randomized Algorithms, String Matching, Travelling 1
Hours
Salesman Problem, NP Completeness ,
Approximation Algorithms
Text/Reference Books:
1. Thomas H Cormen, Charles E Lieserson, Ronald L Rivest and Clifford Stein,
“Introduction to Algorithms”, Second Edition, MIT Press/McGraw-Hill, 2001.
2. Jon Kleinberg and ÉvaTardos, “Algorithm Design”, Pearson, 2005.
35 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Introduction
Introduction Parallel Computing, Parallel Computer
Model, Program and Network Properties, Parallel 30
I Architectural Classification Schemes. Flynn’s & Feng’s Hours 1
Classification. Performance Metrics and Measures,
Multiprocessor System and Interconnection Networks.
Speedup Performance Laws.
36 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Text/Reference Books:
1. Kai Hwang,” Advance Computer Architecture”, TMH
2. Matthew, ”Beginning Linux Programming”, SPD/WROX
3. Hennessy and Patterson, “Computer Architecture: A Quantitative Approach”,
Elsevier
4. Dezso and Sima, “Advanced Computer Architecture”, Pearson
5. Quinn, “Parallel Computing: Theory & Practice”, TMH
6. Quinn, “Parallel Programming in C with MPI and Open MP”, TMH
7. Open MP Specification and Usage (www.openmp.org)
Learning Outcome:
At the end of the course, the student should be able to:
1. Understand the structure of compilers.
2. Understand the basic techniques used in compiler construction such as lexical
analysis, top-down, bottom-up parsing, context-sensitive analysis, and
intermediate code generation.
3. Understand the basic data structures used in compiler construction such as
abstract syntax trees, symbol tables, three-address code, and stack machines
37 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Course Contents:
Total
Module Course Topics Credits
Hours
Introduction to Compiler
Introduction-Compiler and features, Analysis –
Synthesis model, Phases of compiler, Grouping of
Phase, Concept of pass, Bootstrapping. Lexical
analyzer-Implementation and Role of lexical 30
I analyzer, Token, Pattern and Lexemes and function, 1
Hours
Finite state machine and Regular expression. Formal
grammar and their application to syntax analysis-
CFG, derivation and Parse trees
Basics Parsing Techniques –I: Top-Down Parser-
Back tracking, Predictive Parser
Basic parsing techniques-II: Bottom –Up Parser
Shift –Reduce Parser, Operator Precedence parsing,
Recursive descent parsing, LR Parser-LR(0) Parser ,
SLR parser , Canonical LR Parser, LALR Parser.
Syntax-Directed Translation-Syntax Directed 30
II 1
definition and type, Construction of Syntax Tree and Hours
DAG representation. Symbols Table- Storage
Allocation strategies, Runtime Storage Organization,
Structure Storage Allocation, Error detection and
Recovery-Lexical, syntax and semantic error.
Intermediate code Generator
Intermediate code- forms of intermediate code,
Implementation of 3-address code- Quadruple, direct
and triple, Translation of Assignment statements,
III
Translation of Boolean expression- Flow of Control
Statement, and Case statements. Code Generation-
Design issues, The Target code and addresses in 30
1
target code, Code generator algorithm. Hours
Code Optimization
Machine-independent optimization, Basic Blocks,
IV Flow graph- DAG representation of basic blocks, 30 1
Loop in Flow graph .Transformation, Loop Hours
Optimization ,Peephole Optimization, Global Data
Flow-Control Flow Analysis, Data Flow Analysis
Text/Reference Books:
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.
38 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
4. 4.. Charles Fischer and Ricard LeBlanc, “Crafting a Compiler with C”,
Pearson Education
Generic Elective-I
39 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Digital representation
Digital representation: Introduction, Analog
representation, waves, digital representation, need
II for digital representation, A to D conversion, D to A
conversion, relation between sampling rate and bit
depth, Quantization error, Fourier representation, 30
pulse modulation. Importance and drawback of Hours 1
digital representation.
Text/Reference Books:
th
1. “Data Compression” – David Salomon, Springer Publication, 4 Edition.
2. “Introduction to Data Compression” – Khalid Sayood, Morgan Kaufmann
rd
Series, 3 Edition
40 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
3. Learn about the architecture of artificial neural networks and implement them
in fuzzy environment.
4. Study the concept behind genetic algorithm and its various operations.
5. Learn different levels of CPN Networks and ART algorithms.
Learning Outcome:
At the end of the course, the student should be able to:
1. Implement numerical methods in soft computing.
2. Design the algorithms which can work as an intelligent production system.
3. Demonstrate various learning methods in artificial neural networks, like:
supervised and unsupervised learning.
4. Familiar about the various mutation and cross over techniques of genetic
algorithm for producing new strings.
5. Design and Implement different predicate logic rules for solving any specific
AI problem.
Course Contents:
Total
Module Course Topics Credits
Hours
Artificial Intelligence
Neural networks
41 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Fuzzy logic
Genetic Algorithm(GA)
Text/Reference Books:
1. S. Rajsekaran & G.A. Vijayalakshmi Pai, “Neural Networks, Fuzzy Logic and
Genetic Algorithm: Synthesis and Applications” Prentice Hall of India.
2. Sivanandani, Deepa, “Principles of Soft Computing”, Wiley India (2007)
3. Jang J.S.R. Sun C.T. and Mizutani E., “Neuro-Fuzzy and Soft computing”,
Prentice Hall
4. Timothy J. Ross. “Fuzzy Logic with Engineering Applications”, McGraw Hill
5. Laurene Fausett. ‘Fundamentals of Neural Networks”, Prentice Hall
42 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Learning Outcome:
Upon completion of this course, students will be able to:
1. Explain the principles underlying Evolutionary Computation in general and
Genetic Algorithms in particular.
2. Apply Evolutionary Computation Methods to find solutions to complex
problems
3. Analyze and experiment with parameter choices in the use of Evolutionary
Computation
4. Summarize current research in Genetic Algorithms and Evolutionary
Computing
Course Contents:
Total
Module Course Topics Credits
Hours
Introduction to Evolutionary Computation,
Biological Background: Principles of Darwinian
natural selection, Historical Development of EC,
Genetic Algorithms, Genetic Programming, 30
I Evolutionary Strategies and Evolutionary Hours 1
Programming, Features of Evolutionary Computation,
Advantages of Evolutionary Computation
Applications of Evolutionary Computation.
43 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Text/Reference Books:
1. Sivanandam, Deepa “Introduction to Genetic Algorithm”, Springer.
2. Melanie Mitchell: “An Introduction to Genetic Algorithm”, Prentice Hall of
India.
3. D. E. Goldberg, “Genetic Algorithms in Search, Optimisation and Machine
Learning”, Addison-Wesley.
4. Zbigniew Michalewics, “Genetic Algorithms + Data Structures = Evolution
Programs”, Springer Verlag, 1997.
5. Goldberg, “Genetic Algorithms”, Pearson Eduction.
6. T. Back, D. B. Fogel and Michalewicz, “Evolutionary Computation1: Basic
Algorithms and Operators”, 2000.
44 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
45 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
46 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
47 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
24. Write an Applet that displays ―Hello World‖ (Background color-black, text
color-blue and your name in the status window.)
25. Write a program that displays the life cycle of an Applet.
26. Write an Applet displaying line, rectangle, rounded rectangle, filled rectangle,
filled rounded rectangle, circle, ellipse, arc, filled arc and polygon, all in
different colors.
27. Write an Applet that illustrates how to process mouse click, enter, exit,
press and release events. The background color changes when the mouse
is entered, clicked, pressed, released or exited.
48 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
49 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Course Contents:
Total
Module Course Topics Credits
Hours
Introduction to Cryptography and Symmetric
Ciphers
Security Attacks: Security Services and mechanism;
Classical encryption techniques: Substitution ciphers
and Transposition ciphers, Steganography,
Cryptanalysis;
Modern Block Ciphers: Stream and Block Cipher, 30
I Block Cipher Principles, Block Cipher Modes of 1
Hours
Operations; Shannon’s theory of Confusion and
Diffusion; Fiestal structure; Data encryption
standard(DES); Strength of DES; Idea of differential
cryptanalysis; Triple DES; Symmetric Key
Distribution; Finite Fields: Introduction to groups,
rings and fields, Modular Arithmetic, Euclidean
Algorithm, Finite Fields of the form GF(p).
Basics of Number Theory and Public key
Cryptography
Introduction to Number Theory: Prime and Relative
Prime Numbers, Fermat’s and Euler’s theorem,
30
II Testing for Primality, Chinese Remainder theorem, 1
Hours
Discrete Logarithms; Public Key Cryptography:
Principles of Public-Key Cryptography, RSA
Algorithm, Security of RSA; Key Management:
Deffie-Hellman Key Exchange.
Hash Functions and Digital Signatures
Message Authentication; Hash Functions; Secure
Hash Functions; Security of Hash functions and 30
III MACs; Digital Signatures; Digital Signature 1
Hours
Standards (DSS); Proof of digital signature algorithm;
Advanced Encryption Standard (AES) encryption and
decryption.
Network and System Security
Authentication Applications: Kerberos, X.509
Certificates; Electronic Mail Security: Pretty Good
Privacy, S/MIME; IP Security: IP Security 30
IV Architecture, Authentication Header, Encapsulating Hours 1
security payloads, Combining Security Associations;
Web Security: Secure Socket Layer and Transport
Layer Security, Secure Electronic transaction;
Intruder; Viruses; Firewalls.
Text/Reference Books:
1. William Stallings, “Cryptography and Network Security: Principals and
Practice”, Pearson Education.
50 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Generic Elective II
51 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Text/Reference Books:
1. “Systems Programming” by Donovan, Tata McGraw-Hill.
2. “The UNIX Programming Environment” by Brain Kernighen& Rob Pike,
1984, Prentice Hall of India & Rob Pike.
52 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
53 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
54 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Learning Outcome:
At the end of the course, the student should be able to:
1. Install, configure, and maintain a Web server;
2. Identify and successfully manage issues of Web caching, Web security, and
Web performance;
3. Students will be able to understand proficient in Web technologies like
HTML, XML, DOM, SAX
4. java technologies for the Web like JAXP, Java Beans, Servlet, JSP, JDBC
with proficiency in Web server configuration
5. Create XML documents. Create XML Schema. Build dynamic web pages
using JavaScript (client side programming).
6. Create web pages using XHTML and Cascading Styles sheets.
7. Analyze a web page and identify its elements and attributes.
8. Build web applications using JSP.
Course Contents:
Total
Module Course Topics Credits
Hours
HTML, XML and Java Scripting
HTML Common tags: List, Tables, images, forms,
Frames; Cascading Style sheets, Introduction to Java
Scripts, Objects in Java Script, Dynamic HTML with
I Java Script, XML, Document type definition, XML 30 Hours 1
Schemas, Document Object model, Presenting XML,
Using XML Processors, DOM and SAX and XSTL
,Java API for XML Processing (JAXP)
Java Beans: Introduction to Java Beans, Advantages
and properties of Java Beans, BDK , Introspection,
Using Bound properties, Bean Info Interface
,Constrained properties, Introduction to EJB, Java
II 30 Hours 1
Beans API, Introduction to Servelet, Lifecycle of a
Servelet, JSDK , HTTP package, Handling Http
Request & Responses, Using Cookies-Session
Tracking, Security Issues
Introduction to JSP,JSP Processing, JSP Application
Design ,Tomcat Server ,Implicit JSP Objects,
Conditional Processing, Declaring Variables and
III 30 Hours 1
Methods, Error Handling and Debugging, Sharing
Data Between JSP pages, Sharing Session and
Application Data
Database Access, Database Studying Javax.sql.*
package, Accessing a Database from a JSP Page,
IV Application – Specific Database Actions, Deploying 30 Hours 1
JAVA Beans in a JSP Page, Introduction to struts
framework.
Text/Reference Books:
1. “Programming world wide web”-Sebesta, Pearson
55 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
2. “Java: The Complete Reference”, 7th edition, Herbert Schildt, Tata McGraw-
Hill.
3. “Core Servelet and Java Server Pages Volume 1: Core Technologies” by
Marty Hall and Larry Brown Pearson
4. “Java Server Pages”, 2nd Edition by Hans Bergsten, Publisher: O'Reilly
5. “Internet and World Wide Web – How to program” by Dietel and Nieto
Prentice Hall of India/Pearson Education Asia.
Introduction
56 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Course Contents:
Total
Module Course Topics Credits
Hours
57 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Text/Reference Books:
58 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
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. “Big-Data Black Book”, DT Editorial Services, Wily India
3. P. J. Sadalage and M. Fowler, “NoSQL Distilled: A Brief Guide to the Emerging
World of Polyglot Persistence”, Addison-Wesley Professional, 2012.
4. Tom White, “Hadoop: The Definitive Guide”, Third Edition, O'Reilley,2012.
5. Eric Sammer, “Hadoop Operations”, O'Reilley, 2012.
59 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Text/Reference Books:
1. Godbole, “ Information Systems Security”, Willey
2. Merkov, Breithaupt, “ Information Security”, Pearson Education
3. Yadav, “Foundations of Information Technology”, New Age, Delhi
4. Schou, Shoemaker, “ Information Assurance for the Enterprise”, Tata
McGraw Hill
5. Sood,“ Cyber Laws Simplified”, McGraw Hill
6. Furnell, “Computer Insecurity”, Springer
60 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
7. IT Act 2000
61 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Text/Reference Books:
1. Silberschatz, Galvin and Gagne, “Operating Systems Concepts”, Wiley
2. Phillip. A. Laplante, “Real-Time Systems Design and Analysis”, second
edition, PHI, 2005.
3. Jane. W. S. Liu, “Real Time Systems”, Pearson education, 2005
GE33223 Robotics
Course Objective:
1. This course provides an introduction to the mechanics of robots and spatial
mechanics and motion planning.
2. The theoretical focus is on kinematics and dynamics of robotic manipulators
and control design for non-linear mechanical systems.
3. Laboratory practice to learn simple robot programming.
4. This course will also expose students to some of the contemporary happenings
in robotics, including current robotics research, applications, robot contests
and robot web surfing.
Learning Outcome:
At the end of the course, the student should be able to:
1. Be familiar with the history, concept development and key components of
robotics technologies.
2. Understand basic mathematic manipulations of spatial coordinate
representation and transformation.
3. Understand and able to solve basic robot forward and inverse kinematics
problems.
4. Understand and able to solve basic robotic dynamics, path planning and
control problems.
5. Able to undertake practical robotics experiments that demonstrate the above
skills.
Course Contents:
Total
Module Course Topics Credits
Hours
Introduction
30
I Definition, Classification of Robots, geometric Hours 1
classification and control classification. Robot
Elements: Drive system, control system, sensors, end
62 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Robot Control
Applications
Text/Reference Books:
1. Coifet Chirroza, “An Introduction to Robot Technology” Kogan Page.
2. Y. Koren “Robotics for Engineers” Mcgraw Hill.
3. K. S. Fu, R.C. Gonzalez Y& CSG Lee, “Robotics” McGraw Hill.
4. J.J. Craig, “Robotics” Addison-Wesley.
5. Grover, Mitchell Weiss, Nagel Octrey, “Industrial Robots” Mcgraw Hill.
6. Asfahl, “Robots & Manufacturing Automation” Wily Eastern.
63 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
64 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
65 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Total
Module Course Topics Credits
Hours
Overview of Computing Paradigm
Recent trends in Computing Grid Computing, Cluster
Computing, Distributed Computing, Utility
Computing, and Cloud Computing Evolution of cloud
computing Business driver for adopting cloud 30
I computing. 1
Introduction to Cloud Computing Cloud Computing Hours
(NIST Model), History of Cloud Computing, Cloud
service providers Properties, Characteristics &
Disadvantages, Pros and Cons of Cloud Computing,
Cloud computing vs. Cluster computing vs. Grid
computing Role of Open Standards
Cloud Computing Architecture
Cloud computing stack Comparison with traditional
computing architecture (client/server), Services
provided at various levels, How Cloud Computing
30
II Works, Role of Networks in Cloud computing, 1
protocols used, Role of Web services Service Models Hours
(XaaS), Infrastructure as a Service(IaaS), Platform as
a Service (PaaS), Software as a Service(SaaS),
Deployment Models Public cloud, Private cloud,
Hybrid cloud, Community cloud.
Service (IaaS, PaaS, SaaS)
Introduction to IaaS, IaaS definition, Introduction to
virtualization, Different approaches to virtualization,
Hypervisors, Machine Image, Virtual Machine(VM),
Resource Virtualization Server, Storage, Network
Virtual Machine (resource) provisioning and
manageability, storage as a service, Data storage in
cloud computing (storage as a service) Examples 30
III Amazon EC2 Renting, EC2 Compute Unit, Platform 1
Hours
and Storage, pricing, customers Eucalyptus Platform
as a Service (PaaS), Introduction to PaaS, What is
PaaS, Service Oriented Architecture (SOA), Cloud
Platform and Management, Computation Storage
Examples Google App Engine, Microsoft Azure
Software as a Service (PaaS) Introduction to SaaS,
Web services, Web 2.0, Web OS, Case Study on
SaaS.
Service Management and Cloud Security
66 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Open Elective-I
67 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Text/Reference Books:
1. Bharat Bhaskar, “Electronic Commerce: Framework, Technologies &
Applications 4/e”, TMH
2. Ravi Kalakota, Andrew Winston, “Frontiers of Electronic Commerce”,
Addison-Wesley
68 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
3. Bajaj and Nag, “E-Commerce: The Cutting Edge of Business”, Tata McGraw
Hill
4. P. Loshin, John Vacca, “Electronic Commerce”, Firewall Media, New Delhi
5. P. T. Joseph, “E-Commerce: An Indian Perspective”, PHI Learning Pvt. Ltd.
6. Norman, Sadeh , “M Commerce: Technologies, Services, and Business
Models”, Wiley Computer Publishing
69 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Learning Outcome:
1. Understand image formation and the role human visual system plays in
perception of gray and color image data.
2. Get broad exposure to and understanding of various applications of image
processing in industry, medicine, and defense.
3. Learn the signal processing algorithms and techniques in image
enhancement and image restoration.
4. Acquire an appreciation for the image processing issues and techniques
and be able to apply these techniques to real world problems.
5. Be able to conduct independent study and analysis of image processing
problems and techniques.
Course Contents:
Total
Module Course Topics Credits
Hours
Introduction & Fundamentals
Introduction: Motivation and Perspective,
Applications, Components of Image Processing
System.
Fundamentals: Element of Visual Perception, A
Simple Image Model, Sampling and Quantization;
Image Enhancement in Spatial Domain Introduction; 30 1
I Basic Gray Level Functions: Piecewise-Linear Hours
Transformation Functions-Contrast Stretching;
Histogram Specification: Histogram Equalization,
Local Enhancement, Enhancement using
Arithmetic/Logic Operations-Image Subtraction,
Image Averaging; Basics of Spatial Filtering:
Smoothing - Mean filter, Ordered Statistic Filter;
Sharpening – The Laplacian;
70 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
71 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Generic Elective – IV
Mod Total
Course Topics Credits
ule Hours
Data Mining
Overview , Motivation(for Data Mining),Data Mining,
Definition & Functionalities, Data Processing, Form of
Data Preprocessing ,Data Cleaning: Missing Values
30
I ,Noisy Data, Inconsistent Data, Data Integration and 1
Hours
Transformation. , Data Reduction, Data Cube
Aggregation, Dimensionality reduction, Data
Compression, Numerosity Reduction, Clustering,
Discretization and Concept Hierarchy generation.
72 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
73 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
74 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Genetic Algorithm(GA)
Introduction of Genetic Algorithm; Fundamentals of
GA, Basic concepts of GA, Working principle,
Encoding, fitness function,
30
IV Reproduction. Genetic modeling; Inheritance Hours 1
operator, Cross over Operators, Inversion& deletion,
Mutation operator, Bitwise operators. Generational
Cycle of GA. Convergence of GA. Applications &
advances in GA. Differences & similarities between
GA & other traditional methods.
Text/Reference Books:
1. S. Rajsekaran & G.A. Vijayalakshmi Pai, “Neural Networks,Fuzzy Logic and
Genetic Algorithm: Synthesis and Applications”, Prentice Hall of India.
2. N. P. Padhy, “Artificial Intelligence and Intelligent Systems”, Oxford
University Press.
3. Siman Haykin, “Neural Networks”, Prentice Hall of India
4. Timothy J. Ross, “Fuzzy Logic with Engineering Applications”, Wiley I
75 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
76 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Text/Reference Books:
1. J. Schiller, “Mobile Communications”, Addison Wesley.
2. A. Mehrotra, “GSM System Engineering”.
3. M. V. D. Heijden, M. Taylor, “Understanding WAP”, Artech House.
4. Charles Perkins, “Mobile IP”, Addison Wesley.
5. Charles Perkins, “Ad hoc Networks”, Addison Wesley.
77 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Text/Reference Books:
1. Akshar Bharti, Vineet Chaitanya and Rajeev Sangal, “NLP: A Paninian
Perspective”, Prentice Hall, New Delhi.
2. James Allen, “Natural Language Understanding”, 2/e, Pearson Education,
2003.
3. D. Jurafsky, J. H. Martin, “Speech and Language Processing”, Pearson
Education, 2002.
4. L.M. Ivansca, S. C. Shapiro, “Natural Language Processing and Language
Representation”.
78 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
79 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
80 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Generic Elective – V
Course Contents:
Total
Module Course Topics Credits
Hours
Introduction
Compression Techniques: Lossless and Lossy
Compression, Measures of performance, Modeling
I and Coding; Mathematical Preliminaries for Lossless 30 1
compression: A brief introduction to information Hours
theory; Models: Physical models, Probability models,
Markov models, Composite source model; Coding:
Uniquely decodable codes, Prefix codes.
81 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Text/Reference Books:
1. David Salomon, “Data Compression”, Springer Publication, 4th Edition.
2. Khalid Sayood, “Introduction to Data Compression”, Morgan Kaufmann
Series, 3rd Edition
82 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
83 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Text/Reference Books:
1. Singhal & Shivaratri, “Advanced Concept in Operating Systems”, McGraw
Hill
2. Ramakrishna, Gehrke, “Database Management Systems”, McGrawhill
3. Coulouris, Dollimore, Kindberg, “Distributed System: Concepts and Design”,
Pearson Education
4. Tenanuanbaum, Steen, “Distributed Systems”, Prentice Hall of India
5. Gerald Tel, “Distributed Algorithms”, Cambridge University Press
GE33253 Bioinformatics
Course Objective:
1. Study to develop methods and software tools for understanding biological
data.
2. To introduce students to the fundamentals of evolution, molecular biology,
and molecular evolution.
3. To study DNA, RNA important molecules, protein data, etc. their structure,
replication and transcription.
4. Study on biological databases which help in analyzing biological data and
their interpretation.
5. Introduction of Perl programming for developing tools for genome sequencing
and other applications.
Learning Outcome:
After completing the course, the students should be able to:
1. Have a good working knowledge of basic bioinformatics tools and databases
such as GenBank, BLAST, multiple alignment, and phylogenetic tree
construction.
84 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Introduction
Bioinformatics objectives and overviews,
Interdisciplinary nature of Bioinformatics, Data
integration, Data analysis, Major Bioinformatics
databases and tools. Metadata: Summary & reference 30
I systems, finding new type of data online. Molecular Hours 1
Biology and Bioinformatics: Systems approach in
biology, Central dogma of molecular biology,
problems in molecular approach and the
bioinformatics approach, Overview of the
bioinformatics applications.
85 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Text/Reference Books:
1. O’Reilly, “ Developing Bio informatics computer skills”, Indian Edition’s
publication
2. Rastogi, Mendiratta, Rastogi, “Bioinformatics concepts, skills &
Applications”, CBS Publishers
3. Rashidi, Hooman and Lukas K. Buehler, “Bioinformatics Basic Applications”
CRC Press.
4. “Bioinformatics” , Addison Wesley
5. Stephen Misner& Stephen Krawetz, “ Bioinformatics- Methods & Protocols”
6. Cynthia Gibas and Per Jambeck, “Introduction to Bioinformatics computer
Skills”, 2001 SPD
7. Atwood, “Introduction to Bioinformatics”, Person Education
8. James Tisdall, “Beginning Perl for Bioinformatics”, SPD
86 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Course Contents:
Total
Module Course Topics Credits
Hours
Introduction to Pattern Recognition, Basics of pattern
recognition, Design principles of pattern recognition
system, Learning and adaptation, Pattern recognition
30
I approaches, Mathematical foundations – Linear algebra, 1
Hours
Probability Theory, Expectation, mean and covariance,
Normal distribution, Multivariate normal densities, Chi
squared test.
Text/Reference Books:
1. Richard O. Duda, Peter E. Hart and David G. Stork, “Pattern Classification”,
2nd Edition, John Wiley, 2006.
2. C. M. Bishop, “Pattern Recognition and Machine Learning”, Springer, 2009.
3. S. Theodoridis and K. Koutroumbas, “Pattern Recognition”, 4th Edition,
Academic Press, 2009.
87 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
and they will improve their understanding of the on-going research in computer vision
and multimedia field.
Learning Outcome:
Knowledge and understanding
1. To understand the fundamentals of deep learning.
2. To know the main techniques in deep learning and the main research in this field.
Applying knowledge and understanding
1. Be able to design and implement deep neural network systems.
2. Be able to identify new application requirements in the field of computer vision.
Course Contents:
Total
Module Course Topics Credits
Hours
INTRODUCTION :
Introduction to machine learning- Linear models
(SVMs and Perceptrons, logistic regression)- Intro to 30
I Neural Nets: What a shallow network computes- 1
Hours
Training a network: loss functions, back propagation
and stochastic gradient descent- Neural networks as
universal function approximates.
DEEP NETWORKS :
History of Deep Learning- A Probabilistic Theory of
Deep Learning- Backpropagation and regularization , 30
II batch normalization- VC Dimension and Neural Nets- 1
Hours
Deep Vs Shallow Networks-Convolutional Networks-
Generative Adversarial Networks (GAN),
Semisupervised Learning.
DIMENTIONALITY REDUCTION
9 Linear (PCA, LDA) and manifolds, metric learning –
Auto encoders and dimensionality reduction in 30
III networks - Introduction to Convnet - Architectures – 1
Hours
AlexNet, VGG, Inception, ResNet - Training a
Convnet: weights initialization, batch normalization,
hyper parameter optimization
OPTIMIZATION AND GENERALIZATION:
Optimization in deep learning– Non-convex
optimization for deep networks- Stochastic
Optimization Generalization in neural networks- Spatial 30
IV 1
Transformer Networks- Recurrent networks, LSTM - Hours
Recurrent Neural Network Language Models- Word-
Level RNNs & Deep Reinforcement Learning -
Computational & Artificial Neuroscience
88 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Text/Reference Books:
1. Cosma Rohilla Shalizi, “Advanced Data Analysis from an Elementary Point of
View”, 2015.
2. Deng & Yu, “Deep Learning: Methods and Applications”, Now Publishers,
2013.
3. Ian Goodfellow, Yoshua Bengio, Aaron Courville, “Deep Learning”, MIT
Press, 2016.
4. Michael Nielsen, “Neural Networks and Deep Learning”, Determination
Press, 2015.
Open Elective-II
89 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
Text/Reference Books:
1. David Benyon, “Designing Interactive Systems: A comprehensive guide to
HCI and interaction design”, (Second Edition), Pearson Education Limited,
2010.
2. Andrew Sears, Julie A. Jacko, “The Human-Computer Interaction Handbook:
Fundamentals”.
3. “Evolving Technologies and Emerging Applications", Second Edition, CRC
Press, 2007
90 | 9 1
Babu Banarasi Das University, Lucknow Department of CSE
91 | 9 1