Syllabus PDF
Syllabus PDF
Syllabus PDF
and SYLLABI
for
for
Academic Session
2017-18
VISION:
To produce information engineers who work passionately, creatively and effectively for
the betterment of technology and society at large.
MISSION:
● The mission of I.T.E. department is to provide advance knowledge and educate students in
technology and related areas in order to enable them to create and consume information
products for dynamic information society.
● The aim is to create a culture that fosters excellence and combines rigorous academic
study and the excitement of discovery with the support and intellectual stimulation of a
diverse campus community.
● The endeavor is to have up-to-date curricula and pedagogy in the information
technology discipline so that students have a solid foundation in the core concepts and
develop problem solving and decision making skills. The aim to prepare them for lifelong
learning in the discipline by designing the curriculum which anticipates the skills and
knowledge needed in the future.
● The mission is to offer internship opportunities to the students and to foster the personal and
professional growth of our students.
2
PROGRAMME OUTCOMES:
Students in the Information Technology program are expected to know and be able to do the
following at the time of their graduation:
3
EXAMINATION NOTE:
The Semester question paper of a subject will be of 50 marks having 7 questions of equal marks.
First question, covering the whole syllabus and having questions of conceptual nature, will be
compulsory. Rest of the paper will be divided into two parts having three questions each and the
candidate is required to attempt at least two questions from each part.
2.1 All B.E / integrated B.E-M.B.A programmes 2.1 All B.E / integrated B.E-M.B.A
are organized around semester-based credit programmes are organized around semester-
system of study. The credit system is based on based credit system of study. The credit
continuous evaluation of a student’s system is based on continuous evaluation of a
performance/progress and includes flexibility to student’s performance/progress and includes
allow a student to progress at an optimum pace flexibility to allow a student to progress at an
suited to his/her ability or convenience, subject to optimum pace suited to his/her ability or
fulfilling minimum requirements for convenience, subject to fulfilling minimum
continuation. requirements for continuation.
3.1 Relative standing of the student in the class 3.1 The grades and their respective
shall be clearly indicated by his/her grades. The description , along with grade points are
process of awarding grades shall be based upon listed in the table given below in Table-1
fitting performance of the class to a defined
statistical model. Table-1
Grade Grade Description
3.2 The grades and their respective description , Point
along with grade points are listed in the table A+ 10 Outstanding
given below in Table-1 A 9 Excellent
B+ 8 Very Good
Table-1 B 7 Good
Grade Grade Description C+ 6 Average
Point C 5 Below average
A+ 10 Outstanding D 4 Marginal
A 9 Excellent F 0 Very Poor
B+ 8 Very Good I - Incomplete
B 7 Good NP - Audit Pass
C+ 6 Average NF - Audit Fail
C 5 Below average W - Withdrawal
D 4 Marginal X - Unsatisfactory
E 2 Poor S - Satisfactory
F 0 Very Poor Completion
I - Incomplete
NP - Audit Pass
NF - Audit Fail
W - Withdrawal
X - Unsatisfactory
S - Satisfactory
Completion
Z - Course
continuation
5
4.1 Continuous Assessment : 4.1 Continuous Assessment :
There shall be continuous evaluation of the There shall be continuous evaluation of the
student during the semester. For evaluation student during the semester. For evaluation
purpose, total marks assigned to each subject purpose, total marks assigned to each subject
shall be distributed as : shall be distributed as :
Two Mid semester Examination (Minor-1 and Two Mid semester Examination (Minor-1
Minor-2) with 30 % of total marks assigned to and Minor-2) with 30 % of total marks
the subject. assigned to the subject. Best Marks of one of
these two will be considered for award of
sessional.
4.2 Statistical Method for the Award of Grades: 4.2 Method for the Award of Grades:
For the award of grades in a course, all For the award of grades in a course, all
component wise evaluation shall be done in component wise evaluation shall be done in
terms of marks. The components include: terms of marks. The components include:
Midterm-1 and Midterm-2 examinations, Midterm-1 and Midterm-2 examinations,
Assignments/projects/class Assignments/projects/class
presentations/Attendance, and End semester presentations/Attendance, and End semester
examination as per regulation 4.1. After examination as per regulation 4.1. After
converting the marks obtained in percentage , the converting the marks obtained in percentage ,
grades will be assigned as per the guidelines the grades will be assigned as per the
given below : guidelines given below :
6
82 < A < 90 4. ≥60 &< 70 B 7
73 < B+ < 81 5. ≥50 &< 60 C+ 6
64 < B < 72 6. ≥45 &< 50 C 5
55 < C+ < 63 7. ≥40 &< 45 D 4
46 < C < 54 8. <40 F 0
40 < D < 45
35 < E < 39
F < 35
Table-3
Lower Grade Upper
Range of Assigned Range of
Marks(%) Marks (%)
A+
A <
B+ <
B <
C+ <
C <
D <
E <
< F <
*
Note: In case Board of Control of the
department/ institute or appropriate
body/committee approved by the university for
the purpose, is convinced on broad variations in
grade distribution in a class for a particular
subject, B.O.C may make some minor variations
in while maintaining the grade distribution as
recommended by the UGC.
9
SCHEME OF EXAMINATION AND SYLLABI FOR
B.E. (Information Technology)
10
*- Note: Marks refer to mid semester evaluation and end semester evaluation.
11
Teaching Scheme for B.E. Third Year
12
Departmental Elective Course-I
(Choose any one from the following :)
Sr No. Subject Subject Code
1 Business Intelligence ITE642
2 System Software ITE645
3 Neural Network and Fuzzy Logic ITE648
4 System Analysis and Design ITE649
5 Distributed Operating System ITE650
6 Network Management and Administration ITE651
7 Cyber Crime and Digital Forensic ITE652
8 Data Mining and Analytics ITE654
13
Teaching Scheme for B.E. Fourth Year
Elective Course-II
(Choose any one from the following :)
Sr No. Subject Subject Code
1 Cloud Computing ITE744
2 Artificial Intelligence ITE745
3 Principle of Telecommunication ITE748
14
Departmental Honors Course (III,IV,V)
(Choose any three from the following)
Sr Subject Subject Code
No.
1 Mobile Computing ITE 743
2 Building Enterprise Applications ITE 747
3 Mobile Apps Development ITE 749
4. Machine Learning ITE 750
5. Data Acquisition and Hardware Interfacing ITE 751
6. Object Oriented Analysis and Design ITE 752
15
Total Marks:700 Total Credits: 22
OR OPTION – 2
Sub Sub Name Duration Credits Int. Ass. Marks* Grand
Code Total
ITE899 Industrial Training 6 months 22 300 400 700
*- Note: Marks refer to mid semester evaluation and end semester evaluation.
Elective Course-III
(Choose any one from the following :)
Sr Subject Subject Code
No.
1 Theory of Computation ITE 844
16
SYLLABUS FOR B.E. (I.T.) THIRD SEMESTER
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from Part
A and three questions from Part B of the syllabus. Candidate is required to attempt at least two
questions from each part. All the course outcomes must be covered by the question paper.
17
SECTION-A Hours
SECTION-B
Probability (07)
Sample Space and Events, the Axioms of probability, some elementary theorems,
Conditional probability, Baye’s Theorem, Random Variables-Discrete and Continuous,
Independent random variables, Expectation, Variance and Covariance, Means and
variancesof linear combinations of random variables, Chebyshev’s inequality
Probability Distributions (07)
Joint Probability distributions, Marginal and Conditional distributions, Binomial, Poisson,
Uniform and Normal distributions, Normal and Poisson approximations to Binomial,
Moments, Moment generating function.
Two Dimensional Random Variables (07)
Joint distributions – Marginal and conditional distributions – Covariance – Correlation
andRegression – function of a random variable-Transformation of random variables -
Central limit theorem.
RECOMMENDED BOOKS
PO
a b c d e f g h i
CO
CO1 2 2 1
CO2 2 2 1 1
CO3 2 2 1 1
CO4 1 2 1 1
19
COURSE INFORMATION SHEET
20
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from Part
A and three questions from Part B of the syllabus. Candidate is required to attempt at least two
questions from each part. All the course outcomes must be covered by the question paper.
Section –A Hours
Organizational Context: 4
Business processes, Workflow, IT environment, Organizational culture, Organizational
structure, professionalism
Teamwork Concepts and Issues: 3
Colaboration, group dynamics, leadership styles, personality types, collaboration tools
Professional Communications: 6
Skill of effective oral presentation, efficient technical writing, system documentation,
technical requirements
Security and Legal issues in computing: 9
Data security, system security and network security, GhostNet, cloud computing and
security, cyber terrorism, hacktivism, information warfare, Compliance, Hackers/crackers,
computer crime, viruses, system use policies and monitoring, risk and liabilities of
computer-based systems
Section –B
Social context of computing: 5
Social informatics, social impact of IT on society, online communities and social
implications, globalization issues, economic issues in computing, digital divide
Intellectual Property: 4
Foundations of Intellectual Property, ownership of information, plagiarism, software
piracy, fair use, Digital Millennium Copyright Act (DMCA), copyrights, patents,
trademarks and trade secrets, Non Disclosure Agreements (NDAs), International
differences
Professional and Ethical Issues and Responsibility: 5
Relationships with Professional Societies, codes of professional conduct, ethics and
history of ethics, whistle-blowing, workplace issues (harassment, discrimination), identify
theft, ethical hacking
Privacy and Civil Liberties 9
Health Insurance Portability and Accountability Act (HIPPA), Family Educational Rights
and Privacy Act (FERPA), European Union (E. U.) Data Protection, Gramm-Leach-Bliley
Act
21
RECOMMENDED BOOKS
22
PO
a b c d e f g h i
CO
2 2
CO1
2
CO2
2
CO3
2
CO4
23
COURSE INFORMATION SHEET
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set
from Part A and three questions from Part B of the syllabus. Candidate is required to
attempt at least two questions from each part. All the course outcomes must be covered
by the question paper.
SECTION A Hours
24
AM, DSB/SC, and SSB signals, Super heterodyne Radio Receivers.
Frequency Modulation Techniques (08)
Principles and generation of Frequency Modulation and Phase Modulation
signals, FM and PM Transmitter, FM and PM receiver with various stages.
Pulse Modulation & Demodulation (08)
Sampling Theorem, Quanitization, Principles, Generation and detection of Pulse
Amplitude Modulation, Pulse Width Modulation, Pulse Position Modulation &
Pulse Code Modulation signals, DPCM, Delta modulation, Adaptive delta
modulation, Noise in pulse modulation system, Companding, Expanding.
SECTION-B
Digital Transmission (11)
Data and signals, Periodic analog signals, Digital signals, Data rate limit,
Performance, Line coding, Line coding schemes, Block coding , Scrambling,
Transmission Modes, Digital technology, Modem classification. Modem
interfacing, Interconnection of data circuits to telephone loops.
Digital Modulation Techniques (10)
Principal of transmission and reception: ASK, QASK, PSK, FSK, BPSK, BFSK,
QPSK, MSK, QAM, Error Calculations for ASK, PSK, FSK.
RECOMMENDED BOOKS
25
PO
a b c d e f g h i
CO
1 2 1
CO1
1 2 1
CO2
2 1 1
CO3
1 1
CO4
SYLLABUS
26
COURSE INFORMATION SHEET
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION-A Hours
RECOMMENDED BOOKS
28
PO
a b c d e f g h i
CO
CO1 2 2 2 1
CO2 2 2 2 1
CO3 2 2 2 1
CO4 2 2 2 1
SYLLABUS
List of experiments:
1. Functions, Classes and Objects
2. Constructors and Destructors
3. Operator Overloading and Type Conversion
4. Inheritance and Virtual Functions
5. File Handling
6. Exception Handling and Generic Programming
7.
29
COURSE INFORMATION SHEET
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION-A Hours
Introduction (10)
Representation of Logic, Logic Variables, Boolean Algebra, Boolean Expressions and
minimization of Boolean expression using K-Map, Review of Logic Gates & Flip-
flops, design & Implementation of Adder, Subtractor, Multiplexer, DeMultiplexer,
Encoder, Decoder, ROM, Digital Comparators, Code Converters
Number Systems and Codes (07)
Decimal, Binary, Hexadecimal, Octal’s complement, 2’s complement, addition and
subtraction, weighted binary codes, Error detecting codes, Error correcting codes,
Alphanumeric codes.
Counters & Shift Registers (07)
30
Ripple Counters, Design of Modulo-N ripple counter, Up-Down counter, design of
synchronous counters with and without lockout conditions, design of shift registers
with shift-left, shift-right & parallel load facilities, Universal shift Registers.
SECTION-B
Data Converters (07)
Sample & Hold switch, D/A converters: weighted type, R-2R Ladder type; A/D
Converters: Counter-Ramp type, Dual Slope Type, Successive approximation type,
flash type; Specifications of ADC & DAC
Digital Logic families (06)
Characteristics of digital circuits: fan in, fan-out, power dissipation, propagation delay,
noise margin; Transistor-transistor Logic(TTL), TTL NAND Gate with active pull up,
its input and output Characteristics, MOS and CMOS. Comparison of Characteristics
of TTL, ECL, MOS & CMOS logic circuits
Semiconductor Memories & Programmable Logic (04)
ROM, PROM, EPROM, EEPROM; RAM: Static RAM, Memory Organization,
Reading, & Writing Operation in RAM, PLA, PAL & FPGA.
Synchronous sequential logic (04)
Sequential circuits, State Reduction and Assignment, Design Procedure.
RECOMMENDED BOOKS
PO
a b c d e f g h i
CO
CO1 2 1 1 1
CO2 1 2 2
CO3 1 1
CO4 1 1
31
COURSE INFORMATION SHEET
SYLLABUS
List of Experiments:
1.To verify truth tables of various gates: AND, OR, NOR, NAND, NOT and XOR using
their respective ICs.
2. To design and implement various gates using NAND as Universal Gate
3. To design and implement various gates using NOR as Universal Gate
4. To design and test the truth table of Half adder and Full adder.
5. To design and test the truth table of Half Subtractor and Full Subtractor
6. To design and test circuit which converts binary number to its gray code (and vice
versa).
7. To Verify the truth tables of various flip flops: RS, D, JK and T Flip Flops
8. Design & implement circuits using Multiplexers.
9. To verify the truth table of Multiplexers/ Demultiplexers using ICs.
10. To Design & implementation of Asynchronous counter.
11. To Design & implementation of synchronous counter.
12. To Design and implement shift register.
13. To design and implement circuit for given state diagram using various flip flops.
32
COURSE INFORMATION SHEET
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
33
SECTION-A Hours
SECTION-B
Input-Output Organization (06)
I/O interface, Modes of transfer, Priority interrupts, DMA, I/O processor.
Memory Organization (06)
Memory hierarchy, Main memory, Auxiliary memory, Associative memory. Cache
memory, virtual memory, Memory management H/W.
Parallel Processing (05)
Introduction, Multiprocessors, Interconnection structure.
RECOMMENDED BOOKS
PO
a b c d e f g h i
CO
CO1 2 1 1 1
CO2 2 1 1 1
CO3 2 1 1
CO4 2 1 1
34
SYLLABUS FOR B.E. (I.T.) FOURTH SEMESTER
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION-A Hours
RECOMMENDED BOOKS
PO a b c d e f g h i
CO
CO1 2 2 1 1 2
CO2 1 1 1
CO3 1 1
CO4 1 1 1
36
COURSE INFORMATION SHEET
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION-A Hours
37
SECTION-B
RECOMMENDED BOOKS
PO a b c d e f g h i
CO
CO1 1 1 1
CO2 1 2
CO3 1 2 1
CO4 1 1
38
COURSE INFORMATION SHEET
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION-A Hours
39
Pioneering Contributions to Sociology (04)
Seminal Views of Karl Marx, Emile Durkheim, Max Weber, AlwinToeffler
Evolution of Society (05)
Primitive, Agrarian, Industrial and Post-Industrial, Features of Industrial and Post-
Industrial Society, Impact of Automation and Industrialization on Society
Economy and Society (05)
Economic Systems of Simple and Complex Societies, Sociological Dimensions of
Economic Life, Market (free) Economy and Controlled (planned) Economy
SECTION-B
Industrial Sociology (04)
Nature and Scope of Industrial Sociology, Pre-Conditions and Consequences of
Industrialization
Science and Technology (04)
Ethos of Science and Social Responsibility of Science
Social Change (05)
Theories of Change, Factors of Change, Directed Social Change, Social Policy and
Social Development, Social Cost Benefit Analysis, Role of Engineers in Development
Understanding Indian Society (07)
Traditional Hindu Social Organization, Caste System, Agrarian Society in India, Social
Consequences of Land Reforms and Green Revolution, Working of the Democratic
Political System in a Traditional Society, Problem of Education in India, Gender
Discrimination, Economic Reforms: Liberalization, Privatization and Globalization,
Strategies for Development in India
Social Problems (04)
AIDS, Alcoholism, Drug Addiction, Corruption
RECOMMENDED BOOKS
40
PO a b c d e f g h i
CO
CO1 2 1
CO2 1 1
CO3 1
CO4 2 1 1
41
COURSE INFORMATION SHEET
SYLLABUS
Note: The Semester question paper of a subject be of 50 Marks having 7 questions of equal
marks. First question, covering the whole syllabus and having questions of conceptual nature,
be compulsory. Rest of the paper will be divided into two sections having three questions each
and the candidate is required to attempt at least two questions from each section.
Section-A Hours
The Russian Alphabet, consonants, vowel, words, stress, sentence patterns. (4)
Grammar: Noun, gender, personal pronoun, the conjunction conjugation of verbs, number (5)
(singular-plural), possessive pronoun, adverbs, translation (Russian to English & vice-versa)
Section-B
Irregular plurals, Imperative mood, demonstrative pronoun, declaration of noun (nominative (4)
case, prepositioned case, the past tense, reflexive verbs, adjectives. Translation (Russian in to
English & Vice-versa.)
RECOMMENDED BOOKS
42
COURSE INFORMATION SHEET
43
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from Part
A and three questions from Part B of the syllabus. Candidate is required to attempt at least two
questions from each part. All the course outcomes must be covered by the question paper.
SECTION-A Hours
Sets, Relations and Functions: Definition of sets, product sets and partitions, Relations (14)
and digraphs, matrix of a relation, paths in relations and digraphs, equivalence relations
and partitions, operations on relations, transitive closure and warshall’s algorithm.(Scope
as in Chapter 4, Sections 4.1 – 4.7 of Reference 2).
Functions, One-to-one and onto functions, Special functions. The pigeon hole principle.
Function composition and inverse functions (Scope as in Chapter 5, Sections 5.1 – 5.6 of
Reference 1).
Partially ordered sets; Extremal elements of Partially ordered sets, Lattices, Linearly
ordered sets. (Scope as in Chapter 6, Sections 6.1 – 6.3 of Reference 1).
Fundamentals of Logic: Basic connectives and truth tables, Logical equivalence, The (08)
laws of logic, Logical implication, Rules of Inference, Use of Quantifiers, Definitions and
Proofs of Theorems (Scope as in Chapter 2, Sections 2.1 – 2.5 of Reference 1).
SECTION-B
Graph Theory: Definitions and examples, Subgraphs, Complements and Graph (05)
Isomorphism, Vertex degree: Euler trails and circuits, Planar Graphs, Hamilton Paths and
Cycles, Graph colouring and Chromatic polynomials (Scope as in Chapter 11, Sections
11.1 – 11.6 of Reference 1).
Groups Theory: Definition and elementary properties of groups, subgroups, (09)
Homomorphism, Isomorphism and Cyclic groups, Cosets and Lagrange’s Theorem
(Scope as in Chapter 16, Sections 16.1 – 16.3 of Reference 1).
Introduction to Rings and Fields (definitions, examples and basic properties) (Scope as in
Chapter 14, Sections 14.1-14.2 of Reference 1)
44
RECOMMENDED BOOKS
PO
a b c d e f g h i
CO
CO1 1 1 1
CO2 2 2 2
CO3 1 1 1
CO4 1 1
45
COURSE INFORMATION SHEET
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
46
SECTION-A Hours
Introduction: (01)
Introduction to data structures; Introduction to Algorithms Complexity
Arrays, Stacks & Queues: (08)
Concepts; Basic operations & their algorithms: Transverse, Insert, Delete, Sorting of
data in these data structures; Prefix, Infix, Postfix Notations;
Lists: (10)
Concepts of Link List and their representation; Two way lists; Circular link list; Basic
operations & their algorithms: Transverse, Insert, Delete, Searching and Sorting of data
in List; Storage Allocation & Garbage Collection; Linked stack and queues;
Generalized List; sparse matrix representation using generalized list structure;
SECTION-B
Trees: (08)
Binary Trees and their representation using arrays and linked lists; Trees and their
applications; Binary tree transversal; Inserting, deleting and searching in binary trees;
Heap & Heap Sort; General Trees; Thread binary tree; Height balance Tree (AVL); B-
Tree.
Graphs and their applications: (08)
Graphs; Linked Representation of Graphs; Graph Traversal and spanning forests;
Depth first search; Breadth first search.
Sorting & Searching: (10)
Insertion sort; Selection sort; Merging; Merge sort; Radix sort; Sequential & Binary
Search; Indexed Search; Hashing schemes; Binary search Tree.
RECOMMENDED BOOKS
S. NAME AUTHOR(S) PUBLISHER
No.
1 Data Structure Using C and C++ A. Tanenbaum, Y. Prentice Hall
Langsam, M. J. Augenstein of India
2 Theory and problems of Data Structures Seymour Lipschutz McGraw Hill
3 Data Structures & Program Design Robert L. Kruse Prentice Hall
of India
PO a b c d e f g h i
CO
CO1 1 1 1 1
CO2 1 2 1 1
CO3 1 2 1 1
CO4 2 2 1 1
47
COURSE INFORMATION SHEET
SYLLABUS
List of Programs:
1. Implementation of Array Operation: Traversal, Insertion & Deletion at and from a given
location; Sparse Matrices; Multiplication, addition.
2. Stacks: Implementation of Push, Pop; Conversion of Infix expression to Postfix,
Evaluation of Postfix Expressions.
3. Queues: Adding, Deleting Elements; Circular Queue: Adding and Deleting elements.
4. Implementation of Linked Lists: Inserting, deleting, inverting a linked list.
Implementation of stacks and queues using linked lists; Polynomial addition, Polynomial
multiplication.
5. Trees: Implementation of Binary & Binary Search Trees, Recursive and Non-Recursive
traversal of Tress.
6. Graphs: BFS & DFS
7. Implementation of sorting and searching algorithms.
8. Hash Tables Implementation: Searching, inserting and deleting, searching & sorting
techniques.
48
COURSE INFORMATION SHEET
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set
from Part A and three questions from Part B of the syllabus. Candidate is required to
attempt at least two questions from each part. All the course outcomes must be covered
by the question paper.
SECTION-A Hours
49
Interfacing I/O Devices (06)
Basic Interfacing Concepts, Interfacing Output Displays, Interfacing Input Devices,
Memory- Mapped I/O
Programming the 8085: (07)
Introduction to 8085 Assembly Language Programming, The 8085 Programming
Model, Instruction Classification, Instruction Format. Data Transfer (Copy)
Operations, Arithmetic Operations, Logic Operations, Branch Operations, Writing
Assembly Language Programs.
Programming Techniques with Additional Instructions: (06)
Programming Techniques Looping, Counting and Indexing, Additional Data
Transfer and 16-Bit Arithmetic Instructions, Arithmetic Operations Related to
Memory, Logic Operations.
SECTION-B
Counters and Time Delays: (06)
Counters and Time Delays, Hexadecimal Counter, Modulo Ten, Counter,
Generating Pulse Waveforms, Debugging Counter and Time-Delay Programs.
Stack and Subroutines: (04)
Stack, Subroutine, Conditional Call and Return Instructions
Interrupts: (03)
The 8085 Interrupt, 8085 Vectored interrupts.
General –Purpose Programmable Peripheral Devices: (07)
Block Diagram, Working and Control word of: The 8255A Programmable
Peripheral Interface, The 8259 A Programmable Interrupt Controller,
Programmable communications interface 8251.
RECOMMENDED BOOKS
50
PO
a b c d e f g h i
CO
CO1 2 2 1 1
CO2 2 2 2 2 1 1
CO3 2 1
CO4 1 2
SYLLABUS
Familiarization of 8085 kits.
Application of assembly language using 8085 instructions set to develop various programs.
51
COURSE INFORMATION SHEET
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
52
SECTION-A Hours
Introduction: (08)
Basic concepts of computer networks,; Network Hardware: LAN, MAN, WAN,
Wireless networks, Internet; Network Software: Layer, Protocols, interfaces and
services; Reference Model: OSI/TCP/IP and their comparison.
Physical Layer: (08)
Multiplexing, Line coding techniques, Transmission media: Magnetic, Twisted pair,
coaxial cable, fiber optics, wireless transmission (radio, microwave, infrared, light
wave). Switching: Circuit Switching & Packet Switching. Cellular radio and
communication satellites.
Data Link Layer: (09)
Framing, Error control: Error correction & Detection, sliding window protocols (one
bit, Go back n, selective repeat), Medium Access Sub layer: Channel Allocation, MAC
protocols -ALOHA, CSMA protocols, Collision free protocols, IEEE 802.3, 802.4,
802.5 standards and their comparison.
SECTION-B
Network Layer: (09)
Design issues, routing algorithms (shortest path, flooding, flow based, distance vector,
hierarchical, broadcast, multicast).
Congestion control algorithms (Leaky bucket, Token bucket, Choke, Packet, Load
shedding), IPV4, IP addressing, IPV6.
Transport Layer: (06)
Addressing, establishing and releasing connection, flow control & buffering,
multiplexing, crash recovery, Internet Transport protocol (TCP and UDP).
Application Layer: (05)
Network Security; Domain Name System; Simple Network Management Protocol;
Electronic Mail.
RECOMMENDED BOOKS
53
PO
a b c d e f g h i
CO
CO1 2
CO2 2 1 1
CO3 2 1 1
CO4 1 1 1 1
54
COURSE INFORMATION SHEET
55
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION-A Hours
56
RECOMMENDED BOOKS
PO a b c d e f g h i
CO
CO1 1 1 1
CO2 1 1 2 2
CO3 2 1 2 2
CO4 1 1 1 2 1 1
57
COURSE INFORMATION SHEET
SYLLABUS
List of Practicals:
58
COURSE INFORMATION SHEET
PO
a b c d e f g h i
CO
CO1 1 2 1 2 2 2
CO2 1 1 1 2 1 1
CO3 1 2 2 1 1
59
SYLLABUS FOR B.E. (I.T.) FIFTH SEMESTER
60
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION-A Hours
61
RECOMMENDED BOOKS
PO a b c d e f g h i
CO
CO1 1 1 1
CO2 1 1 2 2 1 2
CO3 1 1 1 1 1
CO4 1 1 2 2 1 2
62
COURSE INFORMATION SHEET
SYLLABUS
List of Practicals:
63
COURSE INFORMATION SHEET
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
64
SECTION-A Hours
SECTION-B
RECOMMENDED BOOKS
S. NAME AUTHOR(S) PUBLISHER
No.
1 Computer Graphics C Version Donald Hearn, M.P. Baker Pearson
Education
2 Principle of interactive Computer Newman and Sproul McGraw Hill
Graphics, 2nd Edition
3 Graphics, A programming Approach, 2nd Steven Harrington Tata McGraw
Edition Hill
4 Mathematical Elemants of Computer Rogar and Adams McGraw Hill
Graphics, 2nd Edition
5. Introduction to Computer Graphics, 1st N.Krishnamurthy Tata McGraw
Edition Hill
65
PO a b c d e f g h i
CO
CO1 2 1 1 2
CO2 2 1 2 1 1
CO3 2 1 2 1 1
CO4 1 1 2 2 1
SYLLABUS
66
COURSE INFORMATION SHEET
Course Code ITE543
Course Title Operating System (Theory)
Type of Course Core
LT P 313
Credits 04
Total Lectures 45
Course Assessment Methods:
End Semester Assessment (University Exam.) 50
Continuous Assessment (Sessional) 50
Course Prerequisites Introduction to Information Technology, Data
Structures
Course Objectives 1. To study and understand main
components of operating system, their
working, and operations performed by
operating system.
2. To provide students knowledge on:
resource management provided by
operating systems, concepts and
theories of operating systems,
implementation issues of operating
systems.
3. To be able to understand description
of multiprocessor and distributed
operating system and different
operating system and compare their
features.
Course Outcomes After completion of this course, the students
are able to:
67
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION-A Hours
RECOMMENDED BOOKS
PO a b c d e f g h i
CO
CO1 1 1 1
CO2 1 1 2 2
CO3 2 1 2 2
CO4 1 1 1 2 1 1
69
COURSE INFORMATION SHEET
SYLLABUS
List of Practicals:
70
COURSE INFORMATION SHEET
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION A Hours
Introduction:
Multimedia and its types, Introduction to Hypermedia, Hypertext, Multimedia Systems:
(4)
Characteristics, Challenges, Desirable Features, Components and Applications, Trends
in Multimedia..
Multimedia Technology:
Multimedia Authoring Paradigms, Design Issues in Multimedia Applications, (6)
Standardsfor Document Architecture: SGML (Standard Generalized Markup
71
Language), ODA (Open Document Architecture); Multimedia Standards for Document
Interchange: MHEG (Multimedia Hypermedia Expert Group).
Storage Media :
Magnetic and Optical Media, RAID and its levels, Compact Disc and its standards, (4)
DVD and its standards, Multimedia Servers.
Audio:
Basics of Digital Audio, Sample Rates, Bit Size, Nyquist's Sampling Theorem; Audio
(5)
File Formats; Introduction to MIDI (Musical Instrument Digital Interface): Components
of a MIDI System, Hardware Aspects of MIDI, MIDI Messages.
SECTION B
Images, Graphics and Videos:
Types of Color Models, Graphic/Image Data Structures, Graphic/Image File Formats, (4)
Types of Color Video Signals, TV Standards..
Image Compression:
Types of Redundancies, Classifying Compression Algorithms, Basics of Information
Theory, Entropy Encoding: Run-length Encoding, Pattern Substitution, Huffman
Coding, Huffman Coding of Images, Adaptive Huffman Coding, Arithmetic Coding, (9)
Lempel-Ziv-Welch (LZW) Algorithm, Source Coding Techniques: Transform Coding,
Frequency Domain Methods, Differential Encoding, Hybrid Coding: Vector
Quantization, JPEG Compression.
Audio Compression:
Simple Audio Compression Methods, Psychoacoustics Model, MPEG Audio (4)
Compression.
Video Compression:
Intra Frame Coding (I-frame), Inter-frame (P-frame) Coding, H.261 Compression,
(5)
MPEG Compression, MPEG Video, MPEG Video Bitstream, Decoding MPEG Video
in Software.
Multimedia Communication:
Building Communication Network, Application Subsystem, Transport Subsystem, (4)
QOS, Resource Management, Distributed Multimedia Systems.
RECOMMENDED BOOKS:
72
PO a b c d e f g h i
CO
CO1 2 1
CO2 2 1
CO3 2 2 2 1
CO4 2 2 1
73
COURSE INFORMATION SHEET
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION-A Hours
RECOMMENDED BOOKS
PO a b c d e f g h i
CO
CO1 2 1
CO2 2 1 1
CO3 1 1 2
CO4 2 1 1
75
COURSE INFORMATION SHEET
PO a b c d e f g h i
CO
CO1 2 1 2 1 1
CO2 1 2 2 2
CO3 1 2 1 2
76
SYLLABUS FOR B.E. (I.T.) SIXTH SEMESTER
SYLLABUS
Note: The examiner shall set seven questions of equal marks. First question is compulsory
and shall cover the whole syllabus by including questions of conceptual nature. Rest of the
syllabus will be divided into A and B parts having three questions each. Candidate is
required to attempt at least two questions from each part.
77
SECTION-A Hours
Introduction (05)
Evolution of Mobile Communication Systems: 1G, 2G, 2.5G, 3G, 4G , comparison of
common wireless communication systems.
System Design Fundamentals (10)
Frequency reuse, Channel assignment strategies, handoff strategies, interference,
improving coverage and capacity in cellular systems: cell splitting, cell sectoring and
microcell zone concept, Multiple Access Techniques: FDMA, TDMA, SSMA, SDMA.
Mobile Communication Systems (08)
GSM: Architecture, Identifiers, Authentication and Security , Control Channels,
Services.
SECTION-B
CDMA (IS-95):Architecture ,Forward and Reverse channels ,Soft handoff, call (09)
processing Features: Near Far Effect, Cell Breathing, Mobile data over CDMA,
CDMA-2000. Comparison of CDMA and GSM
Channel Impairment Mitigation Techniques (08)
Introduction, Power control, Diversity Techniques: Frequency Diversity, Time
Diversity, Space Diversity, Path Diversity, Channel Equalization, Rake receiver,
Channel coding and interleaving.
Advance Technologies: (05)
Operation, Applications and Technical specification of WiFi, WiMax, EDGE, WSN,
LTE
RECOMMENDED BOOKS
PO
a b c d e f g h i
CO
1
CO1 1 1 1
1 2 1 1 1
CO2 2 1 2
1
CO3 1
1 1 1 1
CO4 1 1
78
COURSE INFORMATION SHEET
SYLLABUS
79
COURSE INFORMATION SHEET
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
80
SECTION-A Hours
RECOMMENDED BOOKS
81
5. Firewalls and Internet Security, 2nd Bill Cheswick and Steve Addison-
Edition Bellovin Wesley
6. Security Technologies for the world Rolf Oppliger Artech House,
wide web, 2nd Edition Inc
PO
a b c d e f g h i
CO
1 2 2 1
CO1
CO2 1 2 2 1
1 2 2 1
CO3
1 2 2 1
CO4
82
COURSE INFORMATION SHEET
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION-A Hours
Introduction (05)
Introduction to Software Engineering, System Engineering Vs Software Engineering,
Software Evolution, Software Characteristics, Cost of Software Production, Software
Components, Crisis – Problem and Causes, Challenges in Software Engineering.
Software Process Model (06)
SDLC, Waterfall Model, Incremental Model, Prototyping Model, Evolutionary Model,
Spiral Model, Rapid Application Development Model, Formal Methods, Open Source
83
Development, Object Oriented Life Cycle Model, Agile Methods.
Project Management Concepts (06)
Management Activities, Project Planning, Project Scheduling, Size Estimation – LOC,
FP; Cost Estimation Models –COCOMO, COCOMO-II.
Software Requirements Analysis and Specification Concepts (05)
Requirement Engineering, Requirement Elicitation Techniques, Requirements
Documentation, Characteristics and Organization of SRS, Analysis Principles, Analysis
Modeling – Data Modeling, Functional Modeling and Behavioral Modeling; Structured
vs. Object Oriented Analysis.
SECTION-B
Software Design and Coding Concepts (06)
Design Principles, Data Design, Architectural design, Interface Design, Component
Level Design, Object Oriented Design Concepts, Cohesion and Coupling and their
classification, top-down, bottom-up and middle-out design, Coding, Coding Standards,
Coding Conventions, Programming Style.
Testing (05)
Verification and Validation, Testing Process, Design of Test Cases, Software Testing
Strategies, Unit Testing, Integration Testing, Top Down and Bottom Up Integration
Testing, Alpha & Beta Testing, System Testing and Debugging.
Technical Metrics for Software (06)
Software Measurements: What and Why, A Framework for Technical Software
Metrics, Metrics for the Analysis Model, Metrics for Design Model, Metrics for Source
Code, Metrics for Testing, Metrics for Software Quality, Metrics for Maintenance.
CASE (Computer Aided Software Engineering) and Introduction to UML (06)
CASE and its Scope, Building blocks of CASE, CASE Tools, CASE Environment,
UML Concepts, Use Case Diagrams, Sequence Diagrams, Collaboration Diagrams,
Class Diagrams, State Transition Diagrams, Component and Deployment Diagrams.
RECOMMENDED BOOKS
84
PO
a b c d e f g h i
CO
2 1 1 1
CO1
1 1 1 1 2
CO2
1 2 1 2
CO3
1 1 2
CO4
85
COURSE INFORMATION SHEET
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION-A Hours
Analysis of algorithm (09)
Role of Algorithms in Computing; Growth of functions: Asymptotic Notation, Standard
notation, Performance measurements Introduction to Recurrences: substitution method,
recursion-tree method, master method; Algorithms;
86
Divide and Conquer Method (07)
General Method, Binary Search, Matrix Multiplication, Merge Sort, Quick Sort and
their performance analysis
SECTION-B
Dynamic Programming (09)
General Method, Multistage Graph , All Pairs Shortest Path Algorithm , 0/1 Knapsack
Problem, Traveling Salesman Problem
Backtracking (07)
The General Method , 8-Queens Problem- Sum of Subsets ,Knapsack
P and NP Problems (06)
Polynomial time, Nondeterministic Algorithms and NP, Reducibility and NP
completeness, NP complete Problems
RECOMMENDED BOOKS
3. The Design and Analysis of Computer Aho A.V., Hopcroft J.E., Pearson
Algorithms Ullman J.D. Education
87
PO
a b c d e f g h i
CO
CO1 2 2 1
CO2 2 2 1 1
CO3 2 2 1 2 1
CO4 2 2 2 2 1
SYLLABUS
88
DEPARTMENTAL ELECTIVE COURSE -I
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION-A Hours
89
Basics of Data Integration (Extraction Transformation Loading) (08)
Concepts of data integration, need and advantages of using data integration,
introduction to common data integration approaches, introduction to ETL, Introduction
to data quality, data profiling concepts and applications.
SECTION-B
Basics of Enterprise Reporting (06)
Introduction to enterprise reporting, concepts of dashboards, balanced scorecards, and
overall architecture.
RECOMMENDED BOOKS
90
PO
a b c d e f g h i
CO
2
CO1
1 2
CO2
2 2
CO3
1 2
CO4
91
COURSE INFORMATION SHEET
92
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION-A Hours
Introduction: (06)
System software and machine architecture. Simplified Instructional Computer (SIC),
Traditional CISC and RISC Machines.
Assemblers: (08)
Basic assembler functions, Machine-dependent assembler features, Machine-
Independent assembler features, Assembler Design options, Implementation examples:
AIX Assembler.
Macro Processors: (08)
Basic Macro processor functions, Machine-Independent Macro processor features,
Design options.
SECTION-B
Loader and Linkers: (07)
Basic loader functions, Machine dependent Loader features, Machine-Independent
Loader features, Loader Design options, Implementation examples.
Compilers: (10)
Basic Compiler functions, Phases of Compiler, Grammar, Lexical Analysis, Syntax
Analysis, Code Generation, Machine dependent compiler features, Machine-
Independent compiler features, and Compiler Design options.
Operating Systems: (06)
Basic operating system functions, Machine dependent operating system features,
Machine independent operating system features, Operating System Design options
RECOMMENDED BOOKS
93
PO
a b c d e f g h i
CO
CO1 1 2 2 2
CO2 1 1 2
CO3 2 2
CO4 1 2 1 1
94
COURSE INFORMATION SHEET
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION-A Hours
95
Networks, BAM, Hopfield Networks, Kohonen Self Organizing Feature Maps,
Counter propagation Networks, Adaptive Resonance Theory Networks
Introduction to Fuzzy Logic, Classical Vs Fuzzy sets, Membership Functions, (10)
Defuzzification, Fuzzy model, Fuzzy Rule Base, Fuzzy inference systems, Fuzzy
Expert System
SECTION-B
Fuzzy Arithmetic: Fuzzy Numbers, Linguistic Variables, Arithmetic Operations on (04)
Intervals, Arithmetic Operations on Fuzzy Numbers, Fuzzy Equation
Fuzzy Logic: Classical Logic, Multivalued Logic, Fuzzy Propositions, Fuzzy (04)
Quantifiers, Linguistic Hedges
Uncertainty Based Information: Information and Uncertainty, Nonspecificity of Crisp (04)
Sets, Nonspecificity of Fuzzy Sets, Fuzziness of Fuzzy Sets
Applications of Fuzzy Logic: Medicine and Economics (04)
Introduction to Neuro Fuzzy Systems, Architecture of a Neuro Fuzzy systems (04)
RECOMMENDED BOOKS
PO
a b c d e f g h i
CO
CO1 1 2 2 2
CO2 1 2 2 2 1
CO3 1 2 2 2 1
CO4 1 2 2 2 1
96
COURSE INFORMATION SHEET
SYLLABUS
Note: Examiner shall set eight questions, four from Part-A and four from Part-B of the
syllabus. Candidate will be required to attempt any five questions selecting at least two
questions from Part-A and two from Part-B.
97
SECTION-A Hours
SECTION-B
Input and Output: Classification of forms: (04)
Input/output forms design, User-interface design, Graphical interfaces
Modular and structured design: (05)
Module specifications, coupling and cohesion , Top-down and bottom-up design
System Implementation and Maintenance: (05)
Planning considerations, Conversion methods, producers and controls, System
acceptance criteria, System evaluation and performance, Testing and validation,
Maintenance activities and issues
System Audit and Security: (03)
Computer system as an expensive resource: Data and strong media procedures and
norms for utilization of computer equipment, Audit of computer system usage, Audit
trails
Types of threats to computer system and control measures: (04)
Threat to computer system and control measures, Disaster recovery and contingency
planning
RECOMMENDED BOOKS
98
COs POs
a b c d e f g h i
CO1 2 1 2
CO2 1
CO3 2
CO4 1 2
99
COURSE INFORMATION SHEET
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION-A Hours
RECOMMENDED BOOKS
PO
a b c d e f g h i
CO
1 2
CO1
1 2 2
CO2
1 2
CO3
1 2 1
CO4
CO5 2 1
101
COURSE INFORMATION SHEET
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION-A Hours
102
SECTION-B
Introduction to Unix System Administration (04)
Daily Tasks of a System Administrator, Startup and Shutdown, Periodic Processes,
Managing File Systems, Responsibilities to the users, Hardware responsibilities, Types
of SunOS Systems.
System Configuration (07)
Kernel configuration; Adding Hardware Special Files in Solaris 10.0, IRIX 5.X, Digital
UNIX and Ultrix, Systems Directories,/ -root/ etc- systems. Creating networks and
subnets, configuring network interfaces, obtaining network statistics, routing , /user-
system programs, libraries, etc; User accounts-admittance, login procedure, Password
Aging.
Security (07)
System Security Concerns, Need for security, Security Programs, Security Response
Teams, The password and group files, File and Directory Permissions, EEPROM
Security, Secure the console port, Security Loopholes, Additional Security features in
Solaris 10.0, Secure Shell, SSII, SSII Programs, Control Files, Setting up the Service,
Login Process.
RECOMMENDED BOOKS
PO
a b c d e f g h i
CO
CO1 1 1 1
CO2 1 2 1
CO3 1 1
CO4 1 2 1
103
COURSE INFORMATION SHEET
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
104
SECTION-A Hours
(7)
Computer forensics fundamentals : Introduction: Basics of computer forensics, Use
of computer forensics in law enforcement,Computer forensics assistance to human
resources /employment proceedings, Computer forensics services, Benefits of
professional forensics methodology SLC:Steps taken by computer forensics specialists
Types of computer forensics technology (7)
Types of military computer forensic technology, Types of law enforcement, Computer
forensictechnology, Types of business computer forensic technology, Occurrence of
cybercrime, Cyberdetectives, Fighting cyber crime with risk –management techniques,
Computer forensicsinvestigative services SLC: Forensic process improvement.
Data recovery (8)
Introduction of Data recovery, Data back-up and recovery, the role of back-up in data
recovery,data-recovery solution.
SECTION-B
(7)
Evidence collection and data seizure
Why collect evidence?, Collection options, Obstacles, Types of evidence, The rules of
evidence,Volatile evidence, General procedure, Collection and archiving, Methods of
collection, Artifacts,Collection steps, Preserving the digital crime scene, Computer
evidence processing scene, Legalaspects of collecting SLC: preserving computer
forensic evidence.
(8)
Computer image verification and authentication: Special needs of evidential
authentication, Practical consideration, Practical implementation, Electronic document
discovery:a powerful new litigation tool, Time travel, SLC: Forensics identification and
analysis of technical surveillance devices.
(8)
Reconstruction past events : How to become a digital detective, Useable file formats,
Unusable file formats, Converting files, Network forensics scenario, A technical
approach, Destruction of e-mail, Damaging computer evidence, Documenting the
intrusion on destruction of data SLC:System testing.
RECOMMENDED BOOKS
105
PO
a b c d e f g h i
CO
CO1 2 1
CO2 2 2 1
CO3 2 2 1
CO4 2 2 1 1
106
COURSE INFORMATION SHEET
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
107
SECTION-A Hours
RECOMMENDED BOOKS
S. No. NAME AUTHOR(S) PUBLISHER
1 Data Mining: Concepts and Techniques JiaweiHan&MichelineK Morgan
amber Kaufman
publishers
2 Data Mining Pieter Adrians, Addison
DolfZantinge Wesley
3 Data Warehousing, Data Mining and Alex Berson McGraw Hill
OLTP
108
PO
a b c d e f g h i
CO
CO1 2
CO2 2 1 1 1
CO3 1 1 1 1 1
CO4 1 1 2 1
109
SYLLABUS FOR B.E. (I.T.) SEVENTH SEMESTER
SYLLABUS
Note: The Semester question paper of a subject be of 50 Marks having 7 questions of equal
marks. First question, covering the whole syllabus and having questions of conceptual
nature, be compulsory. Rest of the paper will be divided into two parts having three
questions each and the candidate is required to attempt at least two questions from each
section.
110
SECTION-A Hours
RECOMMENDED BOOKS
111
PO a b c d e f g h i
CO
CO1 1 1 1
CO2 1 2 2 1 1
CO3 1 2 2 1 1
CO4 1 1 2 1 1
112
COURSE INFORMATION SHEET
SYLLABUS
113
COURSE INFORMATION SHEET
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from Part
A and three questions from Part B of the syllabus. Candidate is required to attempt at least two
questions from each part. All the course outcomes must be covered by the question paper.
SECTION A Hours
RECOMMENDED BOOKS
a b c d e f g h i
PO
CO
CO1 2 1 1 1
CO2 2 1 2 1 1
CO3 1 1 1 2 1 1
CO4 1 2 1 1 1 2 1 1
115
COURSE INFORMATION SHEET
SYLLABUS
116
COURSE INFORMATION SHEET
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION-A Hours
Introduction (05)
Compilers and Translators; The phases of the compiler – Lexical Analysis, Syntax
Analysis, Intermediate Code Generation, Optimization, Code generation, Bookkeeping,
Error handling.
Lexical Analysis (05)
The role of the lexical analyzer, Tokens, Patterns, Lexemes, Input buffering,
Specifications of a token, Recognition of a tokens, Finite automata: Regular
expressions, NFA, DFA.Design of a lexical analyzer generator.
Syntax Analysis (12)
117
The role of a parser, Context free grammars, Writing a grammar, Top down Parsing:
Recursive decent parser, Predictive parser, Bottom up Parsing: Handles, Viable
prefixes, Operator precedence parsing, LR parsers: SLR, LALR, CLR. Parser generator
(YACC).Error Recovery techniques for different parsers.
SECTION-B
Syntax directed translation (04)
Syntax directed definitions, Synthesized and inherited attributes, Construction of
syntax trees.
Run time environments (06)
Source language issues (Activation trees, Control stack, scope of declaration, Binding
of names), Storage organization (Subdivision of run-time memory, Activation records),
Storage allocation strategies, Symbol tables: storage, data structures used.
Intermediate code generation (03)
Intermediate languages, Graphical representation, Three-address code, Implementation
of three address statements (Quadruples, Triples, Indirect triples).
Code optimization and code generation (10)
Introduction, Basic blocks & flow graphs, DAG, principle sources of optimization:
loop optimization, eliminating induction variable, eliminating common sub-expression,
loop unrolling, loop jamming etc., Issues in the design of code generator, a simple code
generator, Register allocation & assignment, Peephole optimization.
RECOMMENDED BOOKS
PO a b c d e f g h i
CO
CO1 1 2 2
CO2 1 1 2 2 1
CO3 1 1 2 2 1 1
CO4 1 1 2 2 1 1
118
Elective-II
COURSE INFORMATION SHEET
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION-A Hours
SECTION-B
Overview of Cloud Security: (06)
Explain the security concerns in Traditional IT, Introduce challenges in Cloud
Computing in terms of Application Security, Server Security, and Network Security.
Security reference model, Abuse and Nefarious Use of Cloud Computing
RECOMMENDED BOOKS
CO1 1 1
CO2 1 2 2
CO3 1 1 1
CO4 1 1 2
121
COURSE INFORMATION SHEET
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION-A Hours
Introduction: (06)
Artificial Intelligence and its applications, Artificial Intelligence Techniques, criteria of
success, Intelligent Agents, Nature and structure of Agents, Learning Agents
Problem solving techniques: (09)
State space search, control strategies, heuristic search, problem characteristics,
production system characteristics., Generate and test, Hill climbing, best first search,
122
A* search, Constraint satisfaction problem, Mean-end analysis, Min-Max Search,
Alpha-Beta Pruning, Additional refinements, Iterative Deepening
Knowledge representation: (08)
Mapping between facts and representations, Approaches to knowledge representation,
procedural vs declarative knowledge, Forward vs. Backward reasoning, Matching,
conflict resolution, Non-monotonic reasoning, Default reasoning, statistical reasoning,
fuzzy logic Weak and Strong filler structures, semantic nets, frame, conceptual
dependency, scripts
SECTION-B
Planning: (06)
The Planning problem, planning with state space search, partial order planning,
planning graphs, planning with propositional logic, Analysis of planning approaches,
Hierarchical planning, conditional planning, Continuous and Multi Agent planning
Learning : (10)
Forms of Learning, inductive learning, Decision trees, Computational learning theory,
Logical formulation, knowledge in learning, Explanation based and relevance based
learning, statistical learning, Learning with complete data and hidden variables,
instance based learning, Neural Networks
Introduction to Natural Language processing and Expert system: (06)
Basic Tasks of Natural Language processing, Expert systems, Expert system examples,
Expert System Architectures, Rule base Expert systems, Non Monotonic Expert
Systems, Decision tree base Expert Systems.
RECOMMENDED BOOKS
123
PO a b c d e f g h i
CO
CO1 1 2 1 2 1
CO2 1 2 1 2 1
CO3 1 1 1 2
CO4 1 2 1 2 1
124
COURSE INFORMATION SHEET
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION-A Hours
Introduction (03)
The communication process, Block diagram of a general communication system.
Probability and Random Signal Theory (09)
Probability basics, Conditional Probability, Random Variables, Discrete Random
Variables, Continuous Random Variables, Variance, Standard deviation, Moments,
Binomial, and Gaussian distribution
Noise (08)
Sources of Noise, Shot Noise, resistor Noise, White Noise, Noise Temperature, Signal-
to-Noise Ratio, Noise Figure.
SECTION-B
Information Theory (10)
125
Unit of Information, Entropy, Rate of Information, Joint entropy and Conditional
Entropy, Mutual Information, Channel Capacity, Shannon’s Theorem
Coding (08)
Need for Coding, Coding Efficiency, Shannon Fano Coding, Huffman Coding
Types of Communications (07)
Basics of Fiber Optic Communication, Principles of Satellite communication,
Fundamentals of Wireless communications
RECOMMENDED BOOKS
Pos
COs a b c d e f g h I
CO1 2 1
CO2 2
CO3 2 1 1
CO4 1 1
126
COURSE INFORMATION SHEET
Course Code ITE795
Course Title Project-1
Type of Course Core
LT P 004
Credits 02
Course Assessment Methods:
End Semester Assessment (University Exam.) 00
Continuous Assessment (Practical) 100
Course Prerequisites Nil
Course Objectives 1. Students learning skills to tackle realistic
problems as they would be solved in the
real world.
2. Teachers serving as facilitators help in
clarity of objectives to be achieved.
3. Students (usually, but not always)
working in pairs or groups.
Course Outcomes After the completion of this course, the
students are able to:
I. Understand the requirements for real
life engineering and societal problems.
II. Analyze and apply skills and knowledge
to solve real life problem.
PO
a b c d e f g h i
CO
CO 1 1 2 1 2 1 1 2
CO2 2 2 1 2 1 1 1
CO3 1 1 1 2 1 2
127
COURSE INFORMATION SHEET
Course Code ITE796
Course Title Industrial Training (after 6th Semester)
Type of Course Core
LT P 000
Credits 01
Course Assessment Methods:
End Semester Assessment (University Exam.) 00
Continuous Assessment (Practical) 50
Course Prerequisites Nil
Course Objectives 1. To enable students to integrate theory
with practice.
2. To introduce students to work culture
and industrial practices.
3. To provide opportunity to students to
hands on current problems industrial
practitioners are dealing with.
Course Outcomes After the completion of this course, the
students are able to:
I. Analyze practical aspects of a problem
and designing its solution.
II. Apply skills and knowledge of recent
technologies to implement solution for a
real life problem.
III. Demonstrate interpersonal skills and
ability of team work and documentation
and reporting.
PO a b c d e f g h i
CO
CO1 2 1 2 1 1
CO2 1 2 2 2
CO3 1 2 1 2
128
DEPARTMENTAL HONOURS COURSES - III, IV and V
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION-A Hours
129
exposed terminals, Near and far terminals), SDMA, FDMA, TDMA, CDMA.
Mobile Network Layer: Mobile IP (Goals, assumptions, entities and terminology, IP (6)
packet delivery, agent advertisement and discovery, registration, tunneling and
encapsulation, optimizations), Dynamic Host Configuration Protocol (DHCP).
Mobile Transport Layer : Traditional TCP, Indirect TCP, Snooping TCP, Mobile (6)
TCP, Fast retransmit/fast recovery, Transmission /time-out freezing, Selective
retransmission, Transaction oriented TCP.
SECTION-B
Database Issues: Hoarding techniques, caching invalidation mechanisms, client server
computing with adaptation, power-aware and context-aware computing, transactional (6)
models, query processing, recovery, and quality of service issues.
Data Dissemination: Communications asymmetry, classification of new data delivery (5)
mechanisms, pushbased mechanisms, pull-based mechanisms, hybrid mechanisms,
selective tuning (indexing) techniques.
Mobile Ad hoc Networks (MANETs): Overview, Properties of a MANET, spectrum (5)
of MANET applications, routing and various routing algorithms, security in MANETs.
Protocols and Tools: Wireless Application Protocol-WAP. (Introduction, protocol (6)
architecture, and treatment of protocols of all layers), Bluetooth (User scenarios,
physical layer, MAC layer, networking, security, link management) and J2ME.
RECOMMENDED BOOKS
S. NAME AUTHOR(S) PUBLISHER
No.
1. Mobile Communication Jochen Schiller Pearson
Education
2. Handbook of Wireless Networks and Stojmenovic and Cacute Wiley
Mobile Computing, 2002.
PO
a b c d e f g h i
CO
CO1 2 1 1
CO2 1 1 1
CO3 1 1 1
CO4 1 1 1
130
COURSE INFORMATION SHEET
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
131
SECTION-A Hours
RECOMMENDED BOOKS
132
Arnold Rudorfer Media, 2009
5. Managing Software Requirements: A Dean Leffingwell, Don First Edition by
Use Case Approach Widrig Pearson 2003
6. Software Architecture: A Case Based VasudevVerma Pearson 2009
Approach
7. Software Testing Principles And Srinivasan Desikan, First Edition by
Practices Gopalaswamy Ramesh Pearson 2006
PO
a b c d e f g h i
CO
CO 1 1 2 2 2 1 1 1
CO2 1 1 2 1 1 1 1
CO3 1 1 2 2 1 2
CO4 1 1 1 1 1 1
133
COURSE INFORMATION SHEET
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION-A Hours
SECTION-B
Sprucing up mobile apps (08)
Graphics and animation - custom views, canvas, animation APls, multimedia -
audio/video playback and record, location awareness, and native hardware access
(sensors such as accelerometer and gyroscope).
Testing mobile apps (08)
Debugging mobile apps, White box testing, Black box testing, and test automation of
mobile apps, JUnit for Android, Robotium, Monkey Talk.
Taking apps to Market (05)
Versioning, signing and packaging mobile apps, distributing apps on mobile market
place.
RECOMMENDED BOOKS
S. NAME AUTHOR(S) PUBLISHER
No.
1 Mobile Apps Development, Edition I, Anubhav Pradhan Anil V
2013 Deshpande
2 Android Application Development All Barry Burd John Wiley &
in one for Dummies, Edition: I Sons
3 Teach Yourself Android Application Carmen Delessio, Lauren SAMS
Development In 24 Hours, Edition: I Darcey, Shane Conder
PO
a b c d e f g h i
CO
CO1 1 1
CO2 1 2 2 1
CO3 1 1 1 1 1
CO4 1 2 1 1 1
135
COURSE INFORMATION SHEET
Course Code ITE750
Course Title Machine Learning
Type of Course Elective
LT P 400
Credits 04
Total Lectures 45
Course Assessment Methods:
End Semester Assessment (University Exam.) 50
Continuous Assessment (Sessional) 50
Course Prerequisites Discrete Structures
Course Objectives The objective is to familiarize the students
with some basic learning algorithms and
techniques and their applications, as well as
general issues related to analyzing and
handling data.
Course Outcomes I. To understand the fundamental
issues and challenges of machine
learning: data, model selection,
model complexity.
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set
from Part A and three questions from Part B of the syllabus. Candidate is required to
attempt at least two questions from each part. All the course outcomes must be covered
by the question paper.
SECTION-A Hours
Introduction 02
Overview of machine learning, related areas, applications, software tools
Parametric regression 05
Linear regression, polynomial regression, locally weighted regression, numerical
optimization, gradient descent, kernel methods
Generative learning 05
136
Gaussian parameter estimation, maximum likelihood estimation, MAP estimation,
Bayesian estimation, bias and variance of estimators, missing and noisy features,
nonparametric density estimation, Gaussian discriminant analysis, naive Bayes
Discriminative learning 04
Linear discrimination, logistic regression, logit and logistic functions, generalized
linear models
Neural networks 07
The perceptron algorithm, multilayer perceptrons, backpropagation, multiclass
discrimination, training procedures, localized network structure, Support vector
machines
SECTION-B
Graphical and sequential models 08
Bayesian networks, conditional independence, Markov random fields, inference in
graphical models, belief propagation, Markov models, hidden Markov models,
decoding states from observations, learning HMM parameters
Unsupervised learning 06
K-means clustering, expectation maximization, Gaussian mixture density
estimation, mixture of naive Bayes, model selection
Dimensionality reduction 08
Feature selection, principal component analysis, linear discriminant analysis, factor
analysis, independent component analysis, multidimensional scaling
RECOMMENDED BOOKS
S. NAME AUTHOR(S) PUBLISHER
No.
1 Elements of Statistical Learning T. Hastie, R. Springer, 2001
Tibshirani and J.
Friedman
2 Machine Learning E. Alpaydin MIT Press, 2010
PO a b c d e f g h i
CO
CO1 2 1
CO2 2 1
CO3 2 2 1 1
CO4 2 2 2 1
137
COURSE INFORMATION SHEET
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION-A Hours
RECOMMENDED BOOKS
139
PO
a b c d e f g h i
CO
CO1 2 1
CO2 2 1 2
CO3 2 2
CO4 1 1
140
COURSE INFORMATION SHEET
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set
from Part A and three questions from Part B of the syllabus. Candidate is required to
attempt at least two questions from each part. All the course outcomes must be covered
by the question paper.
SECTION-A Hours
SECTION-B
Streams and Templates 05
C++ Streams, C++ Stream Classes, Unformatted I/O Operations, Formatted I/O
Operations, Manipulators, Templates.
File Streams 05
Classes for File Stream Operation, Opening and Closing a File, Detecting End-of-
File, File Pointers and Manipulators, Functions- put() and get(), write() and read().
Object Oriented Analysis and Object Oriented Design 08
Object Oriented Notations and Graphs, Steps in Object Oriented Analysis, Steps in
Object Oriented Design, System analysis, System Design, Object Design
Object Oriented Methodologies 04
OMT methodology, Object Model, Dynamic Model, Function Model, Relationship
among models, Jacksons Model, Booch’s OOA and OOD approach.
RECOMMENDED BOOKS
S. NAME AUTHOR(S) PUBLISHER
No.
1 The C++ Programming Language Bjarne Addison Wesley,
Stroustrup
2 Objecting Modeling and Design James, PHI
Rumbaugh,
Michael Blaha,
William
Premerlani,
Frederick Eddy
and William
Lorensen
PO a b c d e f g h I
CO
CO1 2 2 2 1
CO2 2 2 2 1
CO3 2 2 2 1
CO4 2 2 2 1
143
Minor Specialization Course-III
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set
from Part A and three questions from Part B of the syllabus. Candidate is required to
attempt at least two questions from each part. All the course outcomes must be covered
by the question paper.
SECTION-A Hours
Introduction 02
Overview of machine learning, related areas, applications, software tools
144
Parametric regression 05
Linear regression, polynomial regression, locally weighted regression, numerical
optimization, gradient descent, kernel methods
Generative learning 05
Gaussian parameter estimation, maximum likelihood estimation, MAP estimation,
Bayesian estimation, bias and variance of estimators, missing and noisy features,
nonparametric density estimation, Gaussian discriminant analysis, naive Bayes
Discriminative learning 04
Linear discrimination, logistic regression, logit and logistic functions, generalized
linear models
Neural networks 07
The perceptron algorithm, multilayer perceptrons, backpropagation, multiclass
discrimination, training procedures, localized network structure, Support vector
machines
SECTION-B
Graphical and sequential models 08
Bayesian networks, conditional independence, Markov random fields, inference in
graphical models, belief propagation, Markov models, hidden Markov models,
decoding states from observations, learning HMM parameters
Unsupervised learning 06
K-means clustering, expectation maximization, Gaussian mixture density
estimation, mixture of naive Bayes, model selection
Dimensionality reduction 08
Feature selection, principal component analysis, linear discriminant analysis, factor
analysis, independent component analysis, multidimensional scaling
RECOMMENDED BOOKS
145
PO a b c d e f g h i
CO
CO1 2 1
CO2 2 1
CO3 2 2 1 1
CO4 2 2 2 1
146
Minor Specialization Course-IV
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from Part
A and three questions from Part B of the syllabus. Candidate is required to attempt at least two
questions from each part. All the course outcomes must be covered by the question paper.
SECTION A Hours
RECOMMENDED BOOKS
a b c d e f g h i
PO
CO
CO1 2 1 1 1
CO2 2 1 2 1 1
CO3 1 1 1 2 1 1
CO4 1 2 1 1 1 2 1 1
148
Minor Specialization Course-V
COURSE INFORMATION SHEET
Course Code ITE753
Course Title Project
Type of Course Elective
LT P 004
Credits 04
Course Assessment Methods:
End Semester Assessment (University Exam.) 00
Continuous Assessment (Practical) 100
Course Prerequisites Nil
Course Objectives 1. Students learning skills to tackle realistic
problems as they would be solved in the
real world.
2. Teachers serving as facilitators help in
clarity of objectives to be achieved.
3. Students (usually, but not always)
working in pairs or groups.
Course Outcomes After the completion of this course, the
students are able to:
I. Understand the requirements for real
life engineering and societal
problems.
PO
a b c d e f g h i
CO
CO 1 1 2 1 2 1 1 2
CO2 2 2 1 2 1 1 1
CO3 1 1 1 2 1 2
149
SYLLABUS FOR B.E. (I.T.) EIGHTH SEMESTER
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION-A Hours
150
Intensity transform functions, histogram processing, Spatial filtering, fourier transforms
and its properties, frequency domain filters, Pseudo coloring, color transforms, Basics
of Wavelet Transforms.
Image Restoration: (6)
Image degradation and restoration process, Noise Models, Noise Filters, degradation
function, Inverse Filtering, Homomorphic Filtering.
SECTION-B
Image Compression: (6)
Coding redundancy, Interpixel redundancy, Psycho-visual redundancy, Huffman
Coding, Arithmetic coding, Lossy compression techniques, JPEG Compression
Image Segmentation & Representation: (12)
Point, Line and Edge Detection, Thresholding, Edge and Boundary linking, Hough
transforms, Region Based Segmentation, Boundary representation, Boundary
Descriptors, Regional Descriptors
Object Recognition: (2)
Patterns and Patterns classes, Recognition based on Decision Theoretic methods
RECOMMENDED BOOKS
PO
a b c d e f g h i
CO
CO1 2 1 1
CO2 2 2 1 2
CO3 1 1 2 2 2
CO4 1 1 2 2 1
151
COURSE INFORMATION SHEET
SYLLABUS
2. Converting color images into monochrome images, Image color enhancements using
Note: Students are required to complete any 10 practicals by implementing them in any of the
programming language such as Java, C/C++, C#, MATLAB.
152
COURSE INFORMATION SHEET
SYLLABUS
Note: The Semester question paper of a subject will be of 50 Marks having 7 questions of
equal marks. First question, covering the whole syllabus and having questions of conceptual
nature, be compulsory. Rest of the paper will be divided into two parts having three
questions each and the candidate is required to attempt at least two questions from each
153
section.
SECTION-A Hours
RECOMMENDED BOOKS
154
a b c d e f g h i
PO
CO
CO1 1 1 1
CO2 1 2 2 1 1 2
CO3 1 2 2 1 1 2
CO4 1 2 2 1 1 2
SYLLABUS
155
COURSE INFORMATION SHEET
Course Code ITE843
LT P 403
Credits 4
Total Lectures 45
156
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION-A Hours
RECOMMENDED BOOKS
157
PO a b c d e f g h i
CO
CO1 2 1
CO2 2 1
CO3 2 1 2 1
CO4 2 1
158
COURSE INFORMATION SHEET
159
ELECTIVE- III
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION-A Hours
RECOMMENDED BOOKS
161
PO a b c d e f g h i
CO
CO1 2 1
CO2 2 1 1
CO3 1 1 2
CO4 2 1 1
162
COURSE INFORMATION SHEET
Course Code ITE845
Course Title Soft Computing (Theory)
Type of Course Elective
LT P 310
Credits 04
Total Lectures 45
Course Assessment Methods:
End Semester Assessment (University Exam.) 50
Continuous Assessment (Sessional) 50
Course Prerequisites Discrete Structures
Course Objectives 1. To introduce students to soft
computing concepts and techniques and
foster their abilities in designing.
2. To implement soft computing based
solutions for real-world problems.
Course Outcomes After the completion of this course, the
students are able to:
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set from
Part A and three questions from Part B of the syllabus. Candidate is required to attempt at
least two questions from each part. All the course outcomes must be covered by the question
paper.
SECTION-A Hours
RECOMMENDED BOOKS
PO
a b c d e f g h i
CO
CO1 1 2 2 2
CO2 1 2 2 2 1 1
CO3 1 2 2 2 1 1
CO4 1 2 2 2 1 1
164
COURSE INFORMATION SHEET
Course Code ITE 847
Course Title Natural Language Processing (Theory)
Type of Course Elective
LT P 310
Credits 04
Total Lectures 45
Course Assessment Methods:
End Semester Assessment (University Exam.) 50
Continuous Assessment (Sessional) 50
Course Prerequisites Discrete Structures
Course Objectives The students should be able to study
language and the tools that are available to
efficiently study and analyze large
collections of text. They should learn about
and discuss the effects of electronic
communication on our language.
Course Outcomes After completion of this course, the
students are able to:
I. Understand different levels of
natural language processing.
II. Relate and analyze the concepts
learned earlier like: regular
expressions, finite automata, context
free grammar and parsing in the
study of natural language systems.
III. Apply the concepts of natural
language processing for creating
intelligent language systems.
IV. Develop in depth knowledge of
language generation tasks.
SYLLABUS
Note: The examiner shall set seven questions of 10 marks each. First question has to be
compulsory, having parts covering the whole syllabus. Three questions have to be set
from Part A and three questions from Part B of the syllabus. Candidate is required to
attempt at least two questions from each part. All the course outcomes must be covered
by the question paper.
SECTION-A Hours
INTRODUCTION
A computational framework for natural language, description of English or an (08)
Indian language in the frame work, lexicon, algorithms and data structures for
implementation of the framework, Finite state automata, The different analysis
levels used for NLP (morphological, syntactic, semantic, pragmatic and discourse).
Applications like machine translations.
165
WORD LEVEL AND SYNTACTIC ANALYSIS
Word Level Analysis: Regular Expressions, Finite-State Automata, Morphological (10)
Parsing, Spelling Error Detection and correction, Words and Word classes, Part-of
Speech Tagging. Syntactic Analysis: Context-free Grammar, Constituency,
Parsing-Probabilistic Parsing. Machine-readable dictionaries and lexical databases,
RTN, ATN.
SEMANTIC ANALYSIS
Semantic Analysis: Meaning Representation, Lexical Semantics, Ambiguity, Word (10)
Sense Disambiguation. Discourse Processing: cohesion, Reference Resolution,
Discourse Coherence and Structure. Knowledge Representation, reasoning.
SECTION-B
NATURAL LANGUAGE GENERATION (10)
Natural Language Generation (NLG): Architecture of NLG Systems, Generation
Tasks and Representations, Application of NLG. Machine Translation: Problems in
Machine Translation, Characteristics of Indian Languages, Machine Translation
Approaches, Translation involving Indian Languages.
INFORMATION RETRIEVAL AND LEXICAL RESOURCES (07)
Information Retrieval: Design features of Information Retrieval Systems,
Classical, Nonclassical, Alternative Models of Information Retrieval, valuation
Lexical Resources:WordNet,Frame Net, Stemmers, POS Tagger.
RECOMMENDED BOOKS
S. NAME AUTHOR(S) PUBLISHER
No.
1 Natural Language Understanding James Allen Pearson Education
2 NLP: A Paninian Perspective AksharBharati, Prentice Hall
Vineet
Chaitanya, and
Rajeev Sangal
3 Meaning and Grammar G. Chirchia MIT Press
and S.
McConnell
Ginet
4 An Introduction to Natural Language Daniel Pearson Education
Processing, Computational Linguistics, Jurafsky and
and Speech James H.
Recognition Martin
5 Natural language processing in Prolog Gazdar, Addison-Wesley
&Mellish
166
PO a b c d e f g h i
CO
CO1 1 2 2 1 1
CO2 1 1 2 1
CO3 2 2 2 1 1 1
CO4 1 1 2 1
167
COURSE INFORMATION SHEET
PO
a b c d e f g h i
CO
CO1 1 1 1 2 1 1 1
CO2 2 1 2 2
168
COURSE INFORMATION SHEET
PO
a b c d e f g h i
CO
CO 1 1 2 1 2 1 1 2
CO2 2 2 1 2 1 1 1
CO3 1 1 1 2 1 2
169
COURSE INFORMATION SHEET
Course Code ITE899
Course Title Industrial Training
Type of Course Core
Duration 6 months
Credits 22
Course Assessment Methods:
Marks 400
Internal Assessment 300
Course Prerequisites Nil
Course Objectives 1. To enable students to integrate theory
with practice.
2. To introduce students to work culture and
industrial practices.
3. To provide opportunity to students to
hands on current problems industrial
practitioners are dealing with.
Course Outcomes After the completion of this course, the
students are able to:
I. Analyze practical aspects of a problem
and designing its solution.
II. Apply skills and knowledge of recent
technologies to implement solution for a
real life problem.
III. Demonstrate interpersonal skills and
ability of team work and documentation
and reporting.
PO a b c d e f g h i
CO
2 1 2 1 1
CO1
1 2 2 2
CO2
1 2 1 2
CO3
170