MSCIT

Download as pdf or txt
Download as pdf or txt
You are on page 1of 22

DEPARTMENT OF INFORMATION TECHNOLOGY

Babasaheb Bhimrao Ambedkar University, Lucknow

Programme Structure of M. Sc. (Information Technology) as per New Education Policy (NEP-2020)
W.E.F Session 2022-23
PROGRAMME CREDIT NEP
Total Credit 100 100
CBCS Programme 08 47% (47 Credits)
Core Programme & Electives 39
Foundation Programme -- 53% (53 Credits)
Skill Development 53

1st SEMESTER Total Credit= 25


SN Paper Code Programme Type SUBJECT CREDIT
1 MIT101 CBCS Programme Fundamentals of Information Technology and 4
C Programming
2 MIT102 Core Programme Data Structure and Algorithm 5
3 MIT103 Core Programme Digital Communication and Computer 5
Networks
4 MIT104 Core Programme Computer Architecture 5
5 MIT105 Skill Enhancement Elective-I 4
Programme/Elective
6 MIT106 Skill Development SWAYAM Online Programme/MOOCs 2
7 MPDC-105 Foundation Remedial Language-English --
Programme

2nd SEMESTER Total Credit= 25


SN Paper Code Programme Type SUBJECT CREDIT
1 MIT201 CBCS Programme Network Security 4
2 MIT202 Core Programme Operating System and Systems Programming 5
3 MIT203 Core Programme Database & Data Warehousing 5
4 MIT204 Skill Enhancement Elective-II 5
Programme/Elective
5 MIT205 Skill Enhancement Elective-III 4
Programme/Elective
6 MIT206 Skill Development SWAYAM Online Programme/MOOCs 2
7 MPDC-205 Foundation Ambedkar Studies --
Programme

3rd SEMESTER Total Credit= 25


SN Paper Code Programme Type SUBJECT CREDIT
1 MIT301 Core Programme Computer Graphics 5
2 MIT302 Core Programme Edge Computing 5
3 MIT303 Skill Enhancement Elective-IV 5
Programme/Elective
4 MIT304 Skill Enhancement Elective-V 4
Programme/Elective
5 MIT305 Core Programme Educational Tour, Industrial Visit/ Minor 4
Project
6 MIT306 Skill Development SWAYAM Online Programme/MOOCs 2
7 MPDC-305 Foundation Gender Studies --
Programme

4th SEMESTER Total Credit= 25


SN Paper Code Programme Type SUBJECT CREDIT
1 MIT401 Skill Development Major Project 25
2 MPDC-405 Foundation Community Service --
Programme
Note:
• A Programme of 01 Credit shall consider as 01 hours for the lecture.
DEPARTMENT OF INFORMATION TECHNOLOGY
Babasaheb Bhimrao Ambedkar University, Lucknow

• Contact Hours (Teacher-Student)-15 Hours


o Lecture / Classroom Activity-10 Hours.
o Laboratory Work/ Community Service/Tutorials/Mentoring/ Problem Solving Modeling-05 Hours
• Upto (06 credits) may be opted from the Skill Development/Skill Enhancement Programme by the students from the MHRD
SWAYAM portal. Each opted Programme should be 15-20 hours..
DEPARTMENT OF INFORMATION TECHNOLOGY
Babasaheb Bhimrao Ambedkar University, Lucknow

LIST OF ELECTIVES
Elective-I Elective-II

MIT105(A) Python Programming MIT204(A) Software Engineering


MIT105(B) Programming Languages & Concepts MIT204(B) Wireless Network

MIT105(C) Object Oriented Programming Concepts MIT204(C) Natural Language Programming

MIT105(D) Visual C++ MIT204(D) Digital Image Processing

Elective-III Elective-IV
MIT205(A) Machine Learning MIT303(A) Selected Topics in Information
Technology
MIT205(B) Advanced JAVA Programming MIT303(B) Soft Computing

MIT205(C) Windows Programming MIT303(C) Data Science

MIT205(D) Web Services MIT303(D) Mathematical Modeling

Elective-V
MIT304(A) Internet of Things
MIT304(B) Block Chain Technology

MIT304(C) Artificial Intelligence

MIT304(D) Dot NET Technology


DEPARTMENT OF INFORMATION TECHNOLOGY
Babasaheb Bhimrao Ambedkar University, Lucknow

SEMESTER-I
PROGRAMME TYPE: CBCS PROGRAMME CREDIT: 04
MIT101- FUNDAMENTALS OF INFORMATION TECHNOLOGY AND C PROGRAMMING

UNIT-1 FUNDAMENTAL CONCEPT OF INFORMATION


Definition of information, Data Vs Information, Introduction to Information
representation in Digital Media, Text, image, graphics, Animation, Audio, Video etc.,
Definition of Computer, History, Generations, Characteristic and Application of
Computers, Classification of Computers, RAM/ROM, Computer Hardware, CPU,
Computer Languages, Generation of Languages, Translators-Interpreters,
Compiler/Interpreters, Compilers, Flow, Charts, Dataflow Diagram, Assemblers.

UNIT-2 DIGITAL DEVICES AND BASIC NETWORK CONCEPTS


Decimal, binary, hexa decimal conversion, floating numbers, gates, flip flops, adder,
multiplexes, need for Data Transmission over distances, Types of Data Transmission,
Networks, Networking of computers- Introduction of LAN & WAN. Network
Topologies.

UNIT-3 INTERNET AND WEB TECHNOLOGIES


Hypertext Markup Language, E-Commerce, Public Key Private Key, Electronic Token,
Security Threats, Electronic Payment Systems, Digital Signatures, Network, Security,
Firewall, Introduction to Web Technologies.

UNIT-4 CONCEPTS IN OPERATING SYSTEM & DATA MANAGEMENT


Elementary Concepts in Operating System, textual Vs GUI Interface, Introduction to
DOS, MS Windows, MS office Tools, MS WORD, MS EXCEL, MS Power Point, Basics
of Database management system, Introduction to basic Commands of Dbase, SQL Etc.

UNIT-5 FUNDAMENTALS OF C PROGRAMMING


Introduction to C, features of C, Constants, variables, data types, variable declaration,
symbolic constant definition, conditional control statements- if, if-else, nested if, switch,
go to statement, while, do-while and for statements. Unconditional control statements-
break, continue and return statements.

TEXT BOOK(S)
1. D S Yadav, “Foundations of IT”, New Age, Delhi

REFERENCE BOOKS
1. Curtin, “Information Technology : Breaking News”, TMH
2. Rajaraman, “Introduction to Computers”, PHI
3. Peter Nortans “Introduction to Computers”, TMH.
4. Leon & leon “Fundamental of information Technology”, Vikas
DEPARTMENT OF INFORMATION TECHNOLOGY
Babasaheb Bhimrao Ambedkar University, Lucknow

PROGRAMME TYPE: CORE PROGRAMME CREDIT: 05


MIT102-DATA STRUCTURE AND ALGORITHM

UNIT-1 REVIEW OF C++


Object oriented programming, concepts of OOP, advantages of OOP, C++ program
structures classes, objects, friend functions, overloading member functions,
constructors, destructors, operator overloading and type conversion, inheritance,
virtual base classes, abstract classes, inheritance, arrays, memory models, new and
delete operators binding, polymorphism and virtual functions, exceptional handling,
strings.

UNIT -2 RECURSION AND POINTERS


Factorial, surface analysis of recursion; Recursion as a natural means of expressing
algorithms for solving certain kinds of problems- Arithmetic expression evaluation,
Towers of Hanoi; Backtracking techniques, Applications-Polish notation, Infix to Polish
conversion, Polish conversion to code. Introduction to pointers.

UNIT -3 DYNAMIC DATA STRUCTURES, STACK, QUEUES & LINKED


LIST
Dynamic data / dynamic memory -- allocation and de-allocation; Class constructors
(default constructors; copy constructors); Dynamically sized arrays - collections of
varying sizes, Stack definition, basic stack operations, stack linked list
implementation, queue definition, queue operations, queue linked list design, Linked
lists: Traversals – search, Insertion / deletion; Doubly linked lists, Circularly linked lists.

UNIT –4 SEARCHING, SORTING AND TREES


Searching algorithms, Algorithm analysis for best, worst, and average cases, sorts:
selection and insertion, sorts: Shell sort, heap sort, and quick sort, Trees: Binary search
trees, Binary tree traversal, Binary expression trees. AVL Tree, B Tree, B+ Tree.

UNIT –5 GRAPHS
Graphs, graph operations, graph storage structures, graph algorithms.

TEXT BOOKS
1. Gottfried, “Schaum’s Outline series in C Programming”, McGraw Hill.
2. Horowitz, E. and Sahni, S., “Fundamentals of Data Structures”, Galgotia
Publications. 2002

REFERENCE BOOKS
1. Kernighan and Ritche, “The C programming Language”, PHI. 1999
2. Lipschultz, “Schaum’s Outline series in Data Structures”, McGraw Hill.
3. Hutchison, R., “Programming in C”, McGraw Hill. 1999.
4. Johnsonbaugh,R.and Kalin M.,“Applications programming in C”,PHI.
5. Rajaraman, V., “Computer programming in C”, PHI. 2003
DEPARTMENT OF INFORMATION TECHNOLOGY
Babasaheb Bhimrao Ambedkar University, Lucknow

PROGRAMME TYPE: CORE PROGRAMME CREDIT: 05


MIT103- DIGITAL COMMUNICATION AND COMPUTER NETWORKS

UNIT-1 INTRODUCTION TO DIGITAL COMMUNICATION


Introduction to digital communication, analog Vs Digital Communication, Fourier
Analysis, Band Width limitation, data rate of a channel, Error detection and
correction; nature of errors, parity check, CRC, hamming code, Modulation;
Multiplexing: SDM, FDM, TDM, STDM.

UNIT-2 INTRODUCTION TO NETWORK


Introduction to computer networks and application; network hardware, network
software, OSI reference model, TCP/IP model, network standardization, physical
layer: circuit switching, packet switching, message switching, terminal handling,
telephone system, modems, connections, transmission media- Guided media and
unguided media.

UNIT-3 PHYSICAL & DATA LINK LAYER


Duties of Physical Layer; Signals - Transmission impairment; Transmission Mode -
Serial and Parallel transmission; Analog Transmission - Telephone Modems;
Transmission media -; Circuit switching and telephone network, Duties of DLL; Error
detection and correction; Data link control and protocols; Multiple access – Random
access and Controlled access; Local Area Networks - Ethernet; Connecting devices;
Virtual Circuit switching – Frame Relay & ATM

UNIT-4 NETWORK AND TRANSPORT LAYER


Host-to-Host Delivery – Internetworks, Addressing and Routing; Network layer protocols
– ARP, IPv4, ICMP and IPv6; Unicast routing – RIP and OSPF; Multicast routing –
IGMP; Duties of Transport layer; Process- to-process delivery- UDP, TCP.

UNIT-5 APPLICATION LAYER


Application layer - Issues, DNS, E-mail and FTP; HTTP and WWW; Security –
Cryptography

TEXT BOOK(S)
1. Behrouz A Forouzan, “Data communication and networking” Tata McGraw Hill –
2004.

REFERENCE BOOKS
1. Andrew S. Tanenbaum, “Computer Networks” PHI – 2003
2. William Stallings, “Data and computer communications” PHI 1997
DEPARTMENT OF INFORMATION TECHNOLOGY
Babasaheb Bhimrao Ambedkar University, Lucknow

PROGRAMME TYPE: CORE PROGRAMME CREDIT: 05


MIT104 -COMPUTER ARCHITECTURE

UNIT-1 INSTRUCTION SET DESIGN


Alternatives and Principles: classifying instruction set architectures, operations in the
instruction set, type and size of operands, instruction representations, interactions
between languages and instruction sets, measuring instruction set usage, instruction set
examples.

UNIT-2 ARITHMETIC LOGIC UNIT & BASIC PROCESSOR IMPLEMENTATION


TECHNIQUES
Arithmetic and logic operations, arithmetic and logic operands, constructing an arithmetic
logic unit. processor data path, basic steps of execution, hardwired control, Interrupts.

UNIT-3 PIPELINING
Pipelined datapaths, pipelined control, pipeline hazards, pipeline implementations,
Dynamic instruction scheduling , taking advantage of more instruction-level parallelism,
Branch prediction

UNIT-4 MEMORY SYSTEMS


Principle of locality, principles of memory hierarchy, caches design and optimization,
main memory, virtual memory design, memory protection, memory coherency,
evaluating memory hierarchy performance

UNIT-5 I/O & MULTIPROCESSORS


I/O interface. Buses, Multiprocessor organizations. Cache coherence, Types and uses of
storage devices, interfacing I/O to the rest of the system, reliability and availability, I/O
system design, classifying parallel architectures, centralized vs. distributed shared
memory, interconnection topologies, synchronization, memory consistency

TEXT BOOK(S)
1. D. Patterson and J. Hennessy, Computer Organization and Design: The
Hardware/Software Interface, Third Edition.

REFERENCE BOOKS
1 J. Hennessy and D. Patterson, Computer Architecture: A Quantitative Approach
(3rd Edition), Morgan Kaufmann Publishers, 2003.
2. Mark Hill, et al, Readings in Computer Architecture, Morgan Kaufmann
Publishers.
3. Kai Hwang, Advanced Computer Architecture, McGraw Hill, 1993.
DEPARTMENT OF INFORMATION TECHNOLOGY
Babasaheb Bhimrao Ambedkar University, Lucknow

PROGRAMME TYPE: ELECTIVE -I CREDIT: 04


MIT105 (A): PYTHON PROGRAMMING

UNIT I: INTRODUCTION DATA, EXPRESSIONS, STATEMENT

Introduction to Python and installation, data types: Int, float, Boolean, string, and list; variables,
expressions, statements, precedence of operators, comments; modules, functions--- function and its use,
flow of execution, parameters and arguments.

UNIT II: CONTROL FLOW, LOOPS Conditionals:

Boolean values and operators, conditional (if), alternative (if-else), chained conditional (if-elif-else);
Iteration: while, for, break, continue.

UNIT III: FUNCTIONS, ARRAYS

Fruitful functions: return values, parameters, local and global scope, function composition, recursion;
Strings: string slices, immutability, string functions and methods, string module; Python arrays, Access
the Elements of an Array, array methods.

UNIT IV: LISTS, TUPLES, DICTIONARIES Lists

list operations, list slices, list methods, list loop, mutability, aliasing, cloning lists, list parameters, list
comprehension; Tuples: tuple assignment, tuple as return value, tuple comprehension; Dictionaries:
operations and methods, comprehension;

UNIT V: FILES, EXCEPTIONS, MODULES, PACKAGES

Files and exception: text files, reading and writing files, command line arguments, errors and exceptions,
handling exceptions, modules (datetime, time, OS , calendar, math module), Explore packages.

TEXT BOOKS:

1.
Allen B. Downey, ``Think Python: How to Think Like a Computer Scientist‘‘, 2nd edition, Updated
for Python 3, Shroff/O‘Reilly Publishers, 2016.
2. Guido van Rossum and Fred L. Drake Jr, ―An Introduction to Python – Revised and updated for
Python 3.2, Network Theory Ltd., 2011.
REFERENCE BOOKS:
1. Allen B. Downey, "Think Python: How to Think Like a Computer Scientist”, 2nd Edition, Green Tea Press,
2015.
2. Wesley J Chun, “Core Python Applications Programming”, 3rd Edition, Pearson Education India, 2015.
3. Roberto Tamassia, Michael H Goldwasser, Michael T Goodrich, “Data Structures and Algorithms in Python”,
1st Edition, Wiley India Pvt Ltd, 2016..
4. ReemaThareja, “Python Programming using problem solving approach”, Oxford University press, 2017.
DEPARTMENT OF INFORMATION TECHNOLOGY
Babasaheb Bhimrao Ambedkar University, Lucknow

SECOND SEMESTER-II
PROGRAMME TYPE: CBCS PROGRAMME CREDIT: 04
MIT-201 NETWORK SECURITY

UNIT-1 FOUNDATIONS OF INFORMATION SECURITY


Threats & Countermeasures, Terminology: Security Objectives and Services,
Cryptographic Algorithms and Protocols, Cryptography and Cryptanalysis, Primitives:
Symmetric Encryption, Asymmetric Encryption / Signing, Modification Check Values,
Random Number Generation, Cryptographic Protocols, Access Control

UNIT-2 NETWORK SECURITY INTEGRATION AND LINK LAYER SECURITY


PROTOCOLS
Basic Design Space of Security Integration, Pragmatic Internet Computing Model and
Different Security Requirement Levels, Discussion of Integration into Lower vs. Higher
Protocol Layers and into End Systems vs. Intermediate Systems, Link Layer Security
Protocols: Point to Point Protocol, Point to Point Tunneling Protocol, Layer 2 Tunneling
Protocol, Virtual Private Networks: Definition and Design Alternatives

UNIT-3 INTERNET SECURITY ARCHITECTURE


Basic Security Deficits of the Internet Protocol, Security Objectives of IPSec, Overview
on Concepts: Security Associations, Security Association Database, Security Policy
Database, Security Protocols, Transport Mode and Tunnel Mode, Authentication Header
(AH), Encapsulating Security Payload (ESP), Authentication and Key Management

UNIT-4 TRANSPORT LAYER SECURITY PROTOCOLS AND FIREWALLS


Secure Socket Layer / Transport Layer Security (SSL/TLS), Secure Shell (SSH), Basic
Firewall Concepts, Firewall Architectures, Packet Filtering, Proxy Services and Bastion
Hosts

UNIT-5 SECURITY IN WIRELESS AND MOBILE NETWORKS


Specific Threats in Mobile Communications, Security of Wireless Local Area Networks
according to IEEE 802.11, GSM/GPRS/UMTS Security Concepts and Protocols, Outlook
on Security for Mobile Internet Communications, Electronic Payment Systems, Secure
Electronic Transaction (SET), CyberCash, iKey Protocols, Ecash (DigiCash)
TEXT BOOKS:
1. Cryptography and Network Security Principles and Practice!, Pearson Education Inc.,
William Stallings, 5th Edition, 2014, ISBN: 978-81-317- 6166-3.
2. Cryptography and Network Security, Atul Kahate, TMH, 2003.

REFERENCE BOOKS:
1. Cryptography and Network Security- Behrouz A Forouzan, Debdeep Mukhopadhyay,
Mc-GrawHill, 3rd Edition, 2015
2. Cryptography and Network Security- William Stallings, Pearson Education, 7th
Edition
DEPARTMENT OF INFORMATION TECHNOLOGY
Babasaheb Bhimrao Ambedkar University, Lucknow

PROGRAMME TYPE: CBCS PROGRAMME CREDIT: 04


MIT202-OPERATING SYSTEM AND SYSTEMS PROGRAMMING

UNIT-1 INTRODUCTION TO OPERATING SYSTEM


Introduction-What is an OS-OS structures-Process management-Process concept-Process
creation-Operation on processes–Inter process communication

UNIT-2 MEMORY MANAGEMENT


Storage management - Memory management - Logical Vs Physical address space -
Swapping – Contiguous allocation – Paging – Segmentation - Virtual memory - Demand
paging - Page replacement - Page replacement algorithms – Thrashing

UNIT-3 FILE SYSTEM & DEADLOCKS


File system interface-file concept-access methods-directory structure, Process
Synchronization, Deadlocks - Deadlock characterization – Preventions - Deadlock
avoidance. Detection recovery from Deadlock

UNIT-4 ASSEMBLER AND MACROS


Assemblers: - Two pass and one pass assemblers. Macros:- Macro definition, macro call,
macro expansion, nested macro calls, macro processors.

UNIT-5 COMPILER
The phases of a compiler, the role of the lexical analyzer, a simple approach to the lexical
analysis- transition diagram. The syntactic specification of a programming language-
Context frees grammar derivations and parse tree, unambiguous grammar. Basic parsing
techniques- bottom-up and top-down parses, representation of a parse tree,

TEXT BOOKS
1. D. M. Dhamdhere, System Programming & Operating Systems, Tata McGraw
Hill, 1993 (Reprinted 1994, 1995).
2. Silberschatz Galvin et. al.– “Operating system concepts” - John Wiley & Sons –
2004

REFERENCE BOOKS
1. Milan Milenkovic – “Operating System Concepts and Design” - McGraw Hill –
2003
2. Andrew S. Tennenbaum – “Modern Operating System” – PHI – 1997.
3. Deital - “An Introduction to Operating System” – Pearson Education–1990
DEPARTMENT OF INFORMATION TECHNOLOGY
Babasaheb Bhimrao Ambedkar University, Lucknow

PROGRAMME TYPE: CORE PROGRAMME CREDIT: 05


MIT203- DATABASE AND DATA WAREHOUSING

UNIT-1 INTRODUCTION
Purpose of Database system - Advantages of DBMS over File Processing System –
View of Data - Data Abstraction - Data Independence – Data models – Database
languages – Database Administrator – Database users – DBMS system structure

UNIT-2 LOGICAL DATABASE DESIGN


ER model basic concepts – Attributes and its types – Entity and Entity set –
Relationship & Relationship set - Mapping Constraints – Keys – ER Diagram –
Weak entity sets

UNIT-3 RELATIONAL, OBJECT MODEL & DESIGN TECHNIQUES


Structure of Relational Database - Relational Algebra - Extended Operations - Tuple
relational Calculus & Domain Relational Calculus – Aggregate Functions-
Modification of the database-Views – Object Oriented Database - Object Relational
Database, Pitfalls in relational database design- Decomposition - 1 NF, 2 NF, 3 NF,
BCNF, 4 NF & 5 NF.

UNIT-4 PHYSICAL IMPLEMENTATION, TRANSACTION & RECOVERY


Storage and File Structure, Indexing & Hashing, Transaction Concurrency Control,
Recovery System, Parallel & Distributed Database.

UNIT-5 DATA WAREHOUSE CONCEPTS AND TERMINOLOGY


Data Warehouse Definition, Data Warehouse Properties, Data Warehousing
Terminology, Components of a Data Warehouse, Oracle Warehouse Vision,
Products, and Services, Online Analytical Processing (OLAP).

TEXT BOOK(S)
1. Ramez Elmasri and Shamkant B. Navathe, “Fundamentals of Database
Systems”, Fourth Edition, Pearson Addison Wesley;

REFERENCE BOOKS
1 Peter Rob and Carlos Coronel, Thomson Learning, “Database Systems Design,
Implementation and Management”, 5th edition, Programme Technology,
2. “Modern Database Management (6th Edition)”, Prentice Hall.
3. Jeffrey A. Hoffer, Mary B. Prescott, and Fred R. McFadden, “Database
Systems, A Practical Approach to Design, Implementation, and
Management”, Thomas M. Connolly and Caroline E. Begg, Addison-Wesley.
DEPARTMENT OF INFORMATION TECHNOLOGY
Babasaheb Bhimrao Ambedkar University, Lucknow

PROGRAMME TYPE: ELECTIVE -II CREDIT: 05


MIT204 (B): WIRELESS NETWORKS

UNIT 1: BASICS

Analog and digital data transmission, radio spectrum, channel capacity, Nyquist Bandwidth, Shannon
capacity formula, Modulation, Multiplexing, SDMA, FDMA, TDMA, CDMA, comparison of
S/T/F/CDMA. , Noise and Interference. Antennas, Characteristic antenna quantities; Radio Wave
Propagation: Types and modes, Free Space Propagation Model; Propagation Mechanisms: Reflection,
Diffraction, and Scattering.

UNIT 2: PROPOGATION MODELING

Propagation modeling: Outdoor/Indoor Propagation models, Small scale Multipath propagation- Flat
fading, Frequency selective fading, Rayleigh fading, Ricean Fading, Nakagami fading, Shadowing,
lognormal shadowing fading model, outage probability, coverage estimation under shadowing, and
multipath fading. Average Probability of Error –– Combined Outage and Average Error Probability –
Doppler Spread – Inter symbol Interference

UNIT 3: CELLULAR CONCEPTS

Introduction, Frequency Reuse, Channel, Assignment Strategies, Handoff Strategies- Prioritizing


Handoffs, Practical Handoff Considerations, Interference and system capacity – Co channel Interference
and system capacity, Channel planning for Wireless Systems, Adjacent Channel interference, Power
Control for Reducing interference, Trunking and Grade of Service, Improving Coverage & Capacity in
Cellular Systems- Cell Splitting, Sectoring

UNIT 4: 5G NETWORKS

Evolution of Wireless Technologies, Need Something Beyond 4G, 5G NR: New Levels of Capability
and Efficiency, 5G NR Service Classes Overview, Enhanced Mobile Broadband (eMBB), Massive
Machine-Type Communications (m-MTC), Ultra Reliable Low Latency Communications (URLLC) and
use cases, The 5G NR Spectrum, Motivation & Challenges Behind mmWave Deployments, Advantages
of mmWave, 5G Radio Access Network (RAN)

UNIT 5: SOME WIRELESS NETWORKS

Wireless Adhoc Network and its applications, Wireless sensor networks, Satellite communication
network, 5G and satellite communication networks

TEXT BOOK(S):

1. Rappaport, “Wireless communications : principal and practice”, Pearson, 2010


REFERENCE BOOKS:
1. Jagannatham, Aditya K. “Principles of modern wireless communication systems” McGraw-Hill
Education, 2015.
2. Goldsmith , Andrea “Wireless communication”, cambridge university press, 2005.
DEPARTMENT OF INFORMATION TECHNOLOGY
Babasaheb Bhimrao Ambedkar University, Lucknow

PROGRAMME: ELECTIVE –II CREDIT: 05


MIT204 (D): DIGITAL IMAGE PROCESSING

UNIT-1 INTRODUCTION TO THE DIGITAL IMAGE


Why digital images; The digital camera; Data types and 2d representation of digital
images; Discrete sampling model; Quantisation; Noise processes; Image attributes

UNIT-2 SEGMENTATION & IMAGE TRANSFORMATIONS


Thresholding and thresholding algorithms; Performance evaluation and ROC analysis;
Connected components labeling; Region growing and region adjacency graph (RAG);
Split and merge algorithms; Grey level transformations; Histogram equalization;
Geometric transformations; Affine transformations; Polynomial warps

UNIT-3: MORPHOLOGICAL OPERATION & FEATURE CHARACTERISATION


Erode and dilate as max and min operators on binary images; Open, close, thinning and
other transforms; Medial axis transform; Introduction to grey-level morphology;
Calculation of region properties; Moment features; Boundary coding; Fourier descriptors
Line descriptors from boundary coding and from moments

UNIT-4 IMAGE FILTERING& EDGE DETECTION


Linear and non-linear filtering operations; Image convolutions; Separable convolutions
Sub-sampling and interpolation as convolution operations; Alternative approaches; Edge
enhancement by differentiation; Effect of noise, edge detection and Canny;
implementation; Edge detector performance evaluation

UNIT-5 CORNER DETECTION & COLOUR IMAGES


Image structure tensor; Relationship to image auto-correlation; Characterisation and
Harris corner detector; Sub-pixel accuracy and performance evaluation; Representations
of colour in digital images; Colour metrics; Pixel-wise (point) operations; Colour
invariants and Finlayson colour constancy algorithmSimilarity and dissimilarity matching
metrics; L2 metric and relationship to cross-correlation; Image search and multi-
resolution algorithms; 2D object detection, recognition, location
DEPARTMENT OF INFORMATION TECHNOLOGY
Babasaheb Bhimrao Ambedkar University, Lucknow

PROGRAMME TYPE: ELECTIVE -III CREDIT: 04


MIT205 (A): MACHINE LEARNING

UNIT I: INTRODUCTION TO MACHINE LEARNING

Introduction ,Components of Learning , Learning Models , Geometric Models, ProbabilisticModels,


Logic Models, Grouping and Grading, Designing a Learning System, Types ofLearning, Supervised,
Unsupervised, Reinforcement, Perspectives and Issues, Version Spaces,PAC Learning, VC Dimension.
UNIT II: SUPERVISED AND UNSUPERVISED LEARNING

Decision Trees: ID3, Classification and Regression Trees, Regression: Linear Regression, Multiple
LinearRegression, Logistic Regression, Neural Networks: Introduction, Perception, Multilayer
Perception,Support Vector Machines: Linear and Non-Linear, Kernel Functions, K Nearest
Neighbors.Introduction to clustering, K-means clustering, K-Mode Clustering.

UNIT III: ENSEMBLE AND PROBABILISTIC LEARNING

Model Combination Schemes, Voting, Error-Correcting Output Codes, Bagging: Random Forest
Trees,Boosting: Adaboost, Stacking.Gaussian mixture models - The Expectation-Maximization (EM)
Algorithm, Information Criteria, Nearestneighbour methods - NearestNeighbour Smoothing, Efficient
Distance Computations: the KD-Tree, Distance Measures.

UNIT IV:REINFORCEMENT LEARNING AND EVALUATING HYPOTHESES

Introduction, Learning Task, Q Learning, Non deterministic Rewards and actions, temporal
differencelearning, Relationship to Dynamic Programming, Active reinforcement learning,
Generalization in reinforcement learning. Motivation, Basics of Sampling Theory: Error Estimation and
Estimating Binomial Proportions, TheBinomial Distribution, Estimators, Bias, and Variance

UNIT V: AI AND BAYESIAN LEARNING

Neurons and biological motivation, Linear threshold units. Perceptrons: representational limitation and
gradient descent training, Multilayer networks and backpropagation, Hidden layers and constructing
intermediate, distributed representations. Overfitting, learning network structure, recurrent networks.
Support Vector Machines: Maximum margin linear separators. Quadractic programming solution to
finding maximum margin separators. Kernels for learning non-linear functions. Probability theory and
Bayes rule. Bayes nets and Markov nets for representing dependencies. Instance-Based Learning

TEXT BOOKS:
1. Ethem Alpaydin, “Introduction to Machine Learning”, MIT Press, Prentice Hall of India, 3rd
Edition2014.

REFERENCE BOOKS:
1. CharuC.Aggarwal,“DataClassificationAlgorithmsandApplications”,CRCPress,2014.
2. Charu C. Aggarwal, “DATA CLUSTERING Algorithms and Applications”, CRC Press,
2014
3. Kevin P. Murphy ”Machine Learning: A Probabilistic Perspective”, The MIT Press, 2012
DEPARTMENT OF INFORMATION TECHNOLOGY
Babasaheb Bhimrao Ambedkar University, Lucknow

PROGRAMME TYPE: ELECTIVE -III CREDIT: 04


MIT205 (B): ADVANCED JAVA PROGRAMMING

UNIT-1 JAVA SERVLET


Servlet life cycle , servlet basics , HTTP servlets, The Servlets API, request server side –,
session tracking , databases and non-HTML content , request dispatching , shared
attributes, resource abstraction. advantages of Servlets over CGI; Servlet sessions;
Servlet class hierarchy; Servlet interaction with the client

UNIT-2 JDBC
JDBC versus ODBC; JDBC driver types; JDBC-ODBC bridge; two tier versus three tier
models; Java Database Connectivity: JDBC overview , Architecture , Drivers, database
connection statements Result sets, transaction, Metadata and Aggregate functions ,
callable statements.

UNIT-3 JAVA NETWORKING


Remote Method –introduction , architecture, defining remote objects, creating stubs
and skeleton, object serialization, dynamically loaded classes, RMI activation,
registrating remote objects, marshaled objects. CORBA-concepts, object bus,
distributed objects, interoperability of distributed objects, concept of open object bus, a
java interface to CORBA, creating a basic CORBA server, creating CORBA clients with
Java IDL, RMI v/s CORBA

UNIT-4 JAVA BEAN


Basics of designing JavaBeans, creating and using properties, using events to
communicate with other components, Enterprise Java Beans- basics of EJB, implementing
session beans , implementing Entity Beans , Deploying an Enterprise Java Beans.

UNIT-5 REVIEW OF OTHER JAVA TECHNOLOGIES


JSP(Java Server Pages: Introduction to JSP, Use of JSP, JSP Architecture, JSP
tags, Implicit and Explicit objects, Request forward, Request –time include ,use of
Beans in JSP and their scopes. Java Naming and Directory Interface (JNDI); Java
Transaction Service (JTS); Java Message Service (JMS); Java in small memory spaces,
eg PDAs
DEPARTMENT OF INFORMATION TECHNOLOGY
Babasaheb Bhimrao Ambedkar University, Lucknow

SEMESTER-III
PROGRAMME TYPE: CORE PROGRAMME CREDIT: 05
MIT301- COMPUTER GRAPHICS

UNIT-1 OVERVIEW OF COMPUTER GRAPHICS AND DISPLAY DEVICES


Interactive Graphics, Passive Graphics, Refresh CRT, Random-Scan and Raster Scan
Monitor, Vector, Inner Product and vector product, Distance between a point and a line,
Projection of a point on line, scan conversion of Line, Circle, and ellipse.

UNIT-2 2-D GRAPHICS TRANSFORMATIONS


Geometric and Co-Ordinate Transformation- Rotation, Scaling, and Reflection.

UNIT-3 2-D VIEWING AND CLIPPING


Windowing concept, Clipping algorithms(line, Sutherland, mid-point subdivision),
window to viewport transformation, Be’zier curves, B-Spline curve fitting.

UNIT-4 3-D GRAPHICS & PROBLEM OF PROJECYION


3-D Graphics Transformations- - Rotation, Scaling, and Reflection, Parallel projection,
perspective projection, Z-Buffer Algorithm.

UNIT-5 HIDDEN SURFACE ELIMINATION


Hidden Line Surface Removal Algorithms, Z-Buffer, Scan Line, Sub Division Shading:
Modeling Light Intensities: Diffuse Reflection, Refracted Light, Half toning, Surface
Shading Methods: Const ant Intensity Method, Gouraud Shading, Phong Shading.

TEXT BOOK(S)
1. D.P. Mukherjee, “Fundamentals of Computer Graphics and Multimedia”, PHI,
2002.

REFERENCE BOOKS
1. David Hillman, “Multimedia Technology & Applications”, Galgotia Publications.
2. Rajneesh Agrawal, “Multimedia Systems”, Excel Books.
3. Nigel Chapman & Jenny Chapman, “Digital Multimedia”, Wiley Publications.
DEPARTMENT OF INFORMATION TECHNOLOGY
Babasaheb Bhimrao Ambedkar University, Lucknow

PROGRAMME TYPE: CORE PROGRAMME CREDIT: 05


MIT302- EDGE COMPUTING
DEPARTMENT OF INFORMATION TECHNOLOGY
Babasaheb Bhimrao Ambedkar University, Lucknow

PROGRAMME TYPE: ELECTIVE -IV CREDIT: 05


MIT303 (B): SOFT COMPUTING

UNIT – 1 INTRODUCTION
Neural Networks: History, overview of biological Neuro-system, Mathematical Models
of Neurons, ANN architecture, Learning rules, Learning Paradigms-Supervised,
Unsupervised and reinforcement Learning, ANN training Algorithms-perceptions,
Training rules, Delta, Back Propagation Algorithm, Multilayer Perceptron Model,
Hopfield Networks, Associative Memories, Applications of Artificial Neural Networks.

UNIT – 2 FUZZY LOGIC


Introduction to Fuzzy Logic, Classical and Fuzzy Sets: Overview of Classical Sets,
Membership Function, Fuzzy rule generation. Operations on Fuzzy Sets: Compliment,
Intersections, Unions, Combinations of Operations, Aggregation Operations.

UNIT – 3 FUZZY ARITHMETIC


Fuzzy Numbers, Linguistic Variables, Arithmetic Operations on Intervals & Numbers,
Lattice of Fuzzy Numbers, Fuzzy Equations. Fuzzy Logic: Classical Logic, Multivalued
Logics, Fuzzy Propositions, Fuzzy Qualifiers, Linguistic Hedges. Uncertainty based
Information: Information & Uncertainty, Nonspecificity of Fuzzy & Crisp Sets,
Fuzziness of Fuzzy Sets.

UNIT-4 FUZZY IMAGE PROCESSING


Introduction to fuzzy image processing, Fuzzy Data Fusion; Fuzzy Diagnosis; Neural
Networks: Supervised Learning: Hopfield Nets, Perceptrons, gradient descent, multilayer
nets, backpropagation, overfitting.

UNIT – 5 NEURO-FUZZY SYSTEMS


Introduction of Neuro-Fuzzy Systems, Architecture of Neuro Fuzzy Networks.
Application of Fuzzy Logic: Medicine, Economics etc. Overview of Genetic Algorithm,
GA in problem solving, Implementation of GA
DEPARTMENT OF INFORMATION TECHNOLOGY
Babasaheb Bhimrao Ambedkar University, Lucknow

PROGRAMME TYPE: ELECTIVE -IV CREDIT: 05


MIT303 (C): DATA SCIENCE

UNIT I: BASICS OF PYTHON

Introduction to Python and installation, data types: Int, float, Boolean, string, and list; variables,
expressions, statements, precedence of operators, comments; modules, functions--- function and its use,
flow of execution, parameters and arguments, Boolean values and operators, conditional (if), alternative
(if-else), chained conditional (if-elif-else); Iteration: while, for, break, continue.

UNIT II: FUNCTIONS, ARRAYS AND TUPLES

Fruitful functions: return values, parameters, local and global scope, function composition, recursion;
Strings: string slices, immutability, string functions and methods, string module; Python arrays, Access
the Elements of an Array, array methods, list operations, list slices, list methods, list loop, mutability,
aliasing, cloning lists, list parameters, list comprehension; Tuples: tuple assignment, tuple as return
value, tuple comprehension; Dictionaries: operations and methods, comprehension.

UNIT III: INTRODUCTION TO DATA UNDERSTANDING AND PREPROCESSING

Knowledge domains of Data Analysis, Understanding structured and unstructured data,


Data Analysis process, Dataset generation, Importing Dataset: Importing and Exporting
Data, Basic Insights from Datasets, Cleaning and Preparing the Data: Identify and Handle
Missing Values.

UNIT IV: DATA PROCESSING AND VISUALIZATION

Data Formatting, Exploratory Data Analysis, Filtering and hierarchical indexing using
Pandas. Data Visualization: Basic Visualization Tools, Specialized Visualization Tools,
Seaborn Creating and Plotting Maps.

UNIT V: MATHEMATICAL AND SCIENTIFIC APPLICATIONS FOR DATA ANALYSIS

Numpy and Scipy Package, Understanding and creating N-dimensional arrays, Basic
indexing and slicing, Boolean indexing, Fancy indexing, Universal functions, Data
processing using arrays, File input and output with arrays.

UNIT VI: MODEL DEVELOPMENT AND EVALUATION

Introduction to Machine Learning- Supervised and Unsupervised Learning, Model


development using Linear Regression, Model Visualization, Prediction and Decision
Making, Model Evaluation: Over-fitting, Under-fitting and Model Selection.

Text Books

1. David Ascher and Mark Lutz, Learning Python, Publisher O’Reilly Media.
Reference Books
1. Allen Downey ,JeffreyElkner ,Chris Meyers,: Learning with Python, Dreamtech Press.
DEPARTMENT OF INFORMATION TECHNOLOGY
Babasaheb Bhimrao Ambedkar University, Lucknow

2. David Taieb ,”Data Analysis with Python: A Modern Approach “ 1st Edition, Packt Publishing.
DEPARTMENT OF INFORMATION TECHNOLOGY
Babasaheb Bhimrao Ambedkar University, Lucknow

PROGRAMME TYPE: ELECTIVE -V CREDIT: 04


MIT304 (A): INTERNET OF THINGS

UNITI: FUNDAMENTALS OF IoT

Evolution of Internet of Things, EnablingTechnologies, M2M Communication, IoT World Forum


(IoTWF) standardizedarchitecture, Simplified IoT Architecture, Core IoT Functional Stack, Fog, Edge
andCloud in IoT, Functional blocks of an IoT ecosystem, Sensors, Actuators, Smart
Objects and Connecting Smart Objects.

UNIT II: IoT PROTOCOLS

IoT Access Technologies: Physical and MAC layers, topologyand Security of IEEE 802.15.4, 802.11ah
and Lora WAN, Network Layer: IP versions,Constrained Nodes and Constrained Networks,6LoWPAN,
ApplicationTransportMethods: SCADA, Application Layer Protocols: CoAP and MQTT.
UNIT III: DESIGN AND DEVELOPMENT

Design Methodology, Embedded computinglogic, Microcontroller, System on Chips, IoT system


buildingblocksIoT Platform overview: Overview of IoT supported Hardware platforms such as:
Raspberry pi, Arduino Board details.

UNIT IV: DATA ANALYTICS AND SUPPORTING SERVICES

Introduction, Structured Versus Unstructured Data, Data in Motionversus Data at Rest, IoT Data
Analytics Challenges, Data Acquiring, Organizing inIoT/M2M,Computing Using a Cloud Platform for
IoT/M2MApplications/Services, Everything as a service and Cloud Service Models.

UNIT V: CASE STUDIES/INDUSTRIAL APPLICATIONS:

IoT applications in home, infrastructures, buildings, security, Industries, Home appliances, other IoT
electronicequipments, Industry 4.0 concepts.

Text Books:

1. IoT Fundamentals: Networking Technologies, Protocols and Use Cases for Internet of
Things, David Hanes, Gonzalo Salgueiro, Patrick Grossetete, Rob Barton and Jerome Henry,
Cisco Press, 2017

Reference Books:

1. The Internet of Things – Key applications and Protocols, Olivier Hersent, David
Boswarthick, Omar Elloumi and Wiley, 2012 (for Unit2).
2. “From Machine-to-Machine to the Internet of Things – Introduction to a New Age
of Intelligence” ,Jan Ho ̈ ller , VlasiosTsiatsis, Catherine Mulligan, Stamatis,
Karnouskos, Stefan Avesand. David Boyle and Elsevier, 2014.
3. Architecting the Internet of Things,DieterUckelmann, Mark Harrison, Michahelles
and Florian (Eds), Springer,2011.
DEPARTMENT OF INFORMATION TECHNOLOGY
Babasaheb Bhimrao Ambedkar University, Lucknow

4. Recipes to Begin, Expand, and Enhance Your Projects, 2nd Edition,Michael


Margolis,Arduino Cookbook and O‟Reilly Media,2011

PROGRAMME TYPE: ELECTIVE -V CREDIT: 04


MIT304 (C): ARTIFICIAL INTELLIGENCE

UNIT –1 INTRODUCTION
Introduction to Artificial Intelligence, Simulation of sophisticated & Intelligent Behavior
in different area problem solving in games, natural language, automated reasoning, visual
perception.

UNIT-2 STATE SPACES, PRODUCTION SYSTEMS AND SEARCH


State Space representation of problems. Problem solving as search. Constraints.
Definition and examples of Production Systems. Heuristic search techniques. Two person
games.

UNIT-3 KNOWLEDGE REPRESENTATION


First order predicate calculus, Horn Clauses, Introduction to PROLOG, Partitioned Nets,
Minskey frames, Case Grammar Theory, Production Rules Knowledge Base, The
Interface System, Forward & Backward Deduction.

UNIT-4 WEAK SLOT AND FILLER STRUCTURES


Semantic Nets and Frames. Scripts for representing prototypical combinations of events
and actions, Pattern-matching algorithms. The problem of Control in Rule Based
Systems. The Rete Algorithm

UNIT-5 PATTERN RECOGNITION


Introduction to Pattern Recognition, Structured Description, Symbolic Description,
Machine perception, Line Finding, Interception Semantic & Model, Object Identification,
Speech Recognition.

TEXT BOOK(S)
1. Elaine Rich and Kevin Knight, Artificial Intelligence, Mc Graw Hill,
2nd Edition, 1991.

REFERENCE BOOKS
1. Stuart Russell and Peter Norvig, Artificial Intelligence: A Modern Approach,
Prentice Hall, 2nd edition, 2003.
2. Herbert A. Simon, The Sciences of the Artificial, MIT Press, 3rd Edition (2nd
printing), 1998.
3. Guy Steele, Common Lisp: The Language, Digital Press, 2nd Edition, 1990.

You might also like