be-it-ii-ii-iv-2015-17

SYLLABUS

BACHELLOR OF ENGINEERING

INFORMATION TECHNOLOGY (Semester Scheme)

FOR YEAR INTEGRATED COURSE

B.E. Second Examination, 2015

B.E. Third Examination, 2016

B.E. Final Examination, 2017

JAI NARAIN VYAS UNIVERSITY JODHPUR

Contents

GENERAL INFORMATION FOR STUDENTS

LIST OF TEACHING STAFF

TEACHING AND EXAMINATION SCHEME

B.E. SECOND: SEMESTER III

B.E. SECOND: SEMESTER IV


B.E. THIRD: SEMESTER V

B.E. THIRD: SEMESTER VI


B.E. FOURTH: SEMESTER VII

B.E. FOURTH: SEMESTER VIII

NOTIFICATION

In compliance to decision of the Hon’ble High Court all students are

required to fulfil the 75% attendance in each subject and there must

be 75% attendance of the student before he/she could be permitted to

appear in the examination

REGISTRAR (ACADEMIC)

BACHELOR OF ENGINEERING (SEMESTER SCHEME)

FOUR YEAR INTEGRATED COURSE

ACADEMIC REGULATIONS

1. Admission:

A candidate for admission to the four year degree programme for B.E (Civil,

Chemical, Computer Science & Engineering, Electrical, Electronics & Communication,

Information Technology, Mechanical, Mining, Production and Industrial Engineering)

must have passed (10+2) Senior Secondary (with English, Physics, Chemistry &

Mathematics) of a board situated in the State of Rajasthan or other examinations

recognized as equivalent or higher thereto and selected through PET or otherwise as per

the procedure laid down by the University from time to time.

2. The course of study shall extend over a period of four years (eight semesters as an

integrated course). A student shall follow the prescribed courses as given in the teaching

and examination scheme of the courses to which he is admitted.

3. There shall be a theory examination (Main Examination) at the end of each

Semester in Civil, Chemical, Computer Science & Engineering, Electrical, Electronics &

Communication, Information Technology, Mechanical, Mining, Production and

Industrial Engineering, viz.,

At the end of First Semester

First B.E., First Semester Examination

At the end of Second Semester

First B.E., Second Semester Examination

At the end of Third Semester

Second B.E., First Semester Examination

At the end of Fourth Semester

Second B.E., Second Semester Examination

At the end of Fifth Semester

Third B.E., First Semester Examination

At the end of Sixth Semester

Third B.E., Second Semester Examination

At the end of Seventh Semester

Final B.E., First Semester Examination

At the end of Eighth Semester

Final B.E., Second Semester Examination

4. The attendance requirement in the Faculty of Engineering shall be same as per

ordinance as follows:

O. 78-A: (1) For all regular Candidates in the Faculties of Arts, Education and Social

Sciences, Science, Law, Commerce and Engineering the minimum attendance

requirement shall be that a candidate should have attended at least 70% of the lectures

delivered and the tutorials held taken together as well as 70% for the practical and

sessionals from the date of her/his admission.

(2) Condonation of shortage of attendance:

The Shortage of attendance up to the limits specified below may be condoned on

valid reasons:

(i) Upto 6% in each subject plus 5 attendances in all aggregate of subject/papers may

be condoned by the Vice-Chancellor on the recommendation of the

Dean/Director/Principal for undergraduate students and on the recommendation of the

Head of the Department for the Post-graduate classes.

(ii) The N.C.C./N.S.S. cadets sent out to parades and camps and such students who

are deputed by the University to take part in games, athletics or cultural activities may for

purposes of attendance be treated as present for the days of these absence in connection

with the aforesaid activities and that period shall be added to their subject wise

attendance.

5. (a) A candidate who has attended a regular course of study in the Faculty of

Engineering for the first semester of first B.E. shall be eligible for appearing at the first

semester examination of first B.E. for the B.E. degree which shall be common to all

branches.

(b) Every candidate appearing for the first semester of first B.E. examination shall

be required to show a competent knowledge of the subjects as per examination and

teaching scheme.

(c) A candidate who has attended a regular course of study for the second semester of

first B.E. and has appeared in the first semester examination shall be eligible for

appearing at the second semester examination of first B.E. for the B.E. degree, which

shall be common to all branches.

(d) Every candidate appearing for the second semester of first B.E. examination shall be

required to show a competent knowledge of the subjects as per examination and teaching

scheme.

6. (a) The course of study for the second B.E. Examination shall be separate for all

branches of study.

A candidate who after passing I & II semester (combined) of 1st B.E. examination with

regular course of study in a particular branch of Engineering shall be eligible for

appearing at the first semester examination of second B.E. in that branch of study.

(b) Every candidate appearing for the first semester of second B.E. examination shall


teaching scheme.

(c) A candidate who has attended a regular course of study for the Second semester of

second B.E. and has also appeared in the first semester examination of second B.E. shall

be eligible for appearing at the second semester examination of second B.E. in that

branch of study.

(d) Every candidate appearing for the second semester of second B.E. examination shall


teaching scheme.

7. (a) A candidate who after passing III & IV Semester of second B.E. examination

and has attended a regular courses of study in a particular branch of Engineering for the

first semester of Third B.E. shall be eligible for appearing at the first semester

examination of third B.E. in that branch of study.

(b) Every candidate appearing for the first semester of third B.E. examination shall


teaching scheme.

(c) A candidate who has attended a regular course of study for the second semester

of third B.E. and also has appeared in the first semester examination of third B.E. shall be

eligible for appearing at the second semester examination of third B.E. in that branch of

study.

(d) Every candidate appearing for the second semester of third B.E. examination

shall be required to show a competent knowledge of the subjects as per examination and

teaching scheme.

8. (a) A candidate who after passing V and VI semester of third B.E.

examination and has attended a regular courses of study in a particular branch of

Engineering for the first semester of final B.E. shall be eligible for appearing at the first

semester examination of final B.E. in that branch of study.

(b) Every candidate appearing for the first semester of final B.E. examination shall be

required to show a competent knowledge of the subjects as per examination and teaching

scheme.

(c) A candidate who has attended a regular courses of study for the second semester of

final B.E. and has also appeared in the first semester examination of final BE shall be

eligible for appearing at the second semester examination of final B.E. in that branch of

study.

(d) Every candidate appearing for the second semester of final B.E. examination shall


teaching scheme.

9. Every candidate is required to undergo practical training in a workshop, factory,

mine or engineering works/design office approved by the Dean of the Faculty for a period

as mentioned below:

(a) Civil Engineering after

II and III Year 40+60=100 days

(b) Chemical Engineering after

II and III Year 40+60= 100 days

(c) Computer Science & Engineering after

II and III Year 40+60= 100 days

(d) Electrical Engineering after


(e) Electronics & Comm. Engineering after


(f) Mechanical Engineering after


(g) Mining Engineering after


(h) Production & Indl Engineering after


(i) Information Technology after


10. (i) The candidate has to pass individually in all subjects of each semester from III

to VIII semesters. The result of I, III, V and VII semester shall be declared without

awarding the division. The division will be awarded on the basis of combined

performance of I & II semesters, III & IV semesters, V & VI semesters and VII & VIII

semesters respectively.

(ii) For first B.E. examination, if a candidate fails in not more than 3 units he/she

shall be allowed to keep term (ATKT) in the next higher i.e., third semester. For the

purpose of this clause each theory paper (Part I & Part II taken together) and each

practical and sessional shall be counted as one unit. He/She shall be required to appear

in those unit(s) in which he/she has failed, alongwith the corresponding semester

examinations of next academic year. Candidates failing in English/Social Science shall

be allowed one additional unit to keep term in higher semesters.

(iii) For III to VII Semester examinations, if a candidate fails in not more than three

units in a semester examination he/she shall be allowed to keep term (ATKT) in the next

higher semester, subject to the provision of clause 6(c), 7(c) and 8(c). He/She shall

appear in those unit(s) alongwith regular candidates whenever examination of that

semester is held and pass in the unit(s) in which he/she has failed. For the purpose of this

clause, each written paper and each practical and sessional of a semester shall be counted

as a separate unit.

NOTE: A candidate who is unable to appear at the semester examination in some papers,

practicals and sessionals due to any reason what so ever, shall be considered as having

failed in those Paper(s), Practical(s) and Sessional(s).

(iv) All theory and practical examinations of first and second semester of each year will

be held at the end of each respective semester except First year where practicals of first

and second semester will be held at the end of second semester.

11. No candidate shall be permitted to pursue a regular course of study of Fourth BE

(VII and VIII semesters) unless he/she has passed all the units of First BE

examination. However, the unit of English/Social Science of First BE is exempted

for this purpose.

12. Ex-student:

(i) For II, III and Final BE, if a candidate fails in more than 3 units in a semester

examination, he/she shall be declared as failed in that semester. For First BE, if a

candidate fails in more than 3 units (excluding English/Social Science) he/she shall be

declared failed.

(ii) If a candidate fails in either of the semester or both semesters of a particular year

(III and IV semester of II BE, or V and VI semester of III BE, or VII and VIII semester of

Final BE) he/she shall be declared failed in that year. Such candidate shall have to

pursue his/her study as a regular student as per following clause(s):-

(a) A candidate failed in both semesters of a year shall have to pursue his/her

study as a regular student in both semester, and shall have to take admission

as a regular student.

(b) A candidate failed in either semester of a year shall have to take admission

as regular student in that semester. The other semester, in which he/she has

been declared passed, shall be exempted from repeating and the marks

obtained in that semester shall be carried over. However, for VIII semester

clause 17 shall apply.

(c) A candidate who has passed in all practicals and sessionals but has failed in

more than 3 units of written papers in a semester (III-VII) shall appear in

that semester examination as Ex-student in all written papers. His practical

and sessional marks of that semester shall be carried over.

However, such an ex-student can apply for regular course of study in the

semester(s) in which he/she has failed. Being a regular student he/she shall

appear in all the examinations of theory, practical and sessionals.

(d) Where a candidate fails in Practical and Sessionals and is given the benefit

of ATKT as per clause 10 (ii) and (iv), he/she may choose to attend

laboratory/sessional classes and submit a revised laboratory

record/sessional. Such a candidate shall have to pay Rs. 1000/- for doing

each practical and sessional during the semester.

13. A candidate may be permitted to change his/her branch of study after passing B.E.

I Year, strictly on the basis of merit secured in B.E. I year examination (First and Second

Semester examination taken together) depending upon the vacancies available in a

particular branch of study which shall be determined as follows:

The maximum strength of a branch should not increase by more than 10 percent

of sanctioned strength and the minimum strength of a branch should not be decreased to

less than 80 percent of the sanctioned strength.

The sanctioned strength of a branch shall be reckoned to the number of candidates

who have been promoted to the second year (Third Semester).

14. Award of Division:

(a) First B.E. to Third B.E.

First Class : If a candidate secure a minimum of 60 percent

Second Class : If a candidate secure a minimum of 50 percent

Pass Class : If a candidate secures a minimum of 45 percent

(b) Final B.E.: For the declaration of Final B.E. result, marks shall be totalled up as

follows:

First B.E. 50% of the Marks secured

Second B.E. 75% of Marks secured

Third B.E. 100% of the Marks secured

Final B.E. 100% of the Marks secured

( c) For determining merit position of the candidates at the final year level the marks

obtained by them in the second, third and final year as described above shall only be

considered.

(d) A candidate shall be awarded a degree with Honours if she/he secures a minimum of

70 per cent of aggregate marks. A candidate shall be awarded a degree with first class if

she/he secures a minimum of 60 per cent of aggregate marks. A candidate shall be

awarded a degree with second class if she/he secures a minimum of 50 per cent of

aggregate marks. The rest of the successful candidates will be awarded pass class.

15. Requirement of additional degree:

(a) An engineering graduate of the Jai Narain Vyas University, Jodhpur who wishes to

qualify for an additional degree of Engineering of the University will be considered by a

committee consisting of the Dean and the Head of the Department concerned.

(b) He/She will be admitted in Third B.E. class of that branch. The Theory papers and

practicals and sessionals which he/she has to appear at the various examination in that

branch will be decided by the above committee.

(c) He/She will be awarded division as follows:

(i) 100 per cent of marks of the papers and practical and Sessionals and Project if any, in

which he/she appears for Third B.E.

(ii) and 100 per cent of the papers and Practical and Sessionals and Project if any, in

which he/she appears for Final Year.

(d) His/her marks for the training which he/she has undergone after Third B.E.

He/She will be awarded division in Final year as per regulation.

He/She will not be awarded any position in the class.

(e) Mention will be made in the certificate that he/she has qualified for the additional

degree.

16. The medium of Instructions and Examination in all Engineering Examinations of

Theory/Practical and Sessionals, shall continue to be English as hitherto.

17. Make up Examination for VII & VIII Semester:

(a) There shall be a Make up Examination for the VII & VIII Semester held at suitable

interval of time after declaration of the result of the VIII Semester Examination.

Candidates, who fail in this or are unable to appear in this Examination, may appear in

the immediate subsequent Semester Examination.

(b) Candidates who have failed in the VIII Semester Examination but have passed in

project, practical training and tour, shall be exempted from re-examination in, practical

training and tour and shall be required to pass the examination in the rest of the subjects

only.

(c) A candidate who passes in a limited number of Theory papers/Practical and

Sessionals/Project in VIII Semester Examination shall be awarded division with a

mention of “Pass in more than one attempt” on the mark sheet with asterisks on the

respective Theory papers / Practical and Sessionals / Project.

18. For diploma passed candidates admitted to B.E.:

(a) The diploma passed candidates admitted in the Second B.E. (all branches) shall be

required to undergo a regular course of study in Special Mathematics during the

academic session and shall have to appear and pass in this Paper along with other Theory

units of the Main Examination. For this subject, combined marks obtained in III & IV

Semester shall be counted for pass.

(b) No candidate of this category shall be permitted for regular course of study in Final

B.E. unless he/she has passed the special Mathematics paper.

LIST OF TEACHING STAFF

ASSOCIATE PROFESSOR

1. Dr. N.C. Barwar B.E., ME, Ph.D.,MISTE, MIE

2. Dr. Rajesh Purohit (HEAD) B.E., ME, Ph.D., MISTE, MIE

3. Dr. Anil Gupta BE (Hons), M.Tech., Ph.D., MCSI, MISTE

ASSISTANT PROFESSOR

1. Shri Shrwan Ram B.E., M.E.

2. Dr. (Mrs). Rachna MCA,Ph.D.

3. Dr. Alok Singh Gahlot B.E., MS, Ph.D

B.E. II YEAR (INFORMATION TECHNOLOGY)

SEMESTER III EXAMINATION SCHEME 2015

A. THEORY PAPER

Subject Nomenclature

Subject

Lec

ture

(L

)

Tuto

rial

(T

)

Pra

ctic

al (

P)

Conta

ct

Cre

dit

Unit

Exam

. H

rs.

Marks

Theory

Practicals

&

Sessionals

Total

Ma 201A Advanced Engineering Mathematics-I (CSE/IT) 3 1 - 4 4 ¾ 3 60 - 60

CSE 211A Discrete Structures (CSE/IT) 3 1 - 4 4 ¾ 3 60 - 60

CSE 212A Object Oriented Programming (CSE/IT) 3 1 2 6 5 1 3 60 - 60

CSE 213A Data Structures and Algorithms (CSE/IT) 3 1 2 6 5 1 3 60 - 60

CSE 214A Logic Design (CSE/IT) 3 1 2 6 5 1 3 60 - 60

CSE 215A Computer Oriented Statistical Methods (CSE/IT) 3 1 - 4 4 ½ 3 60 - 60

Total (A) 18 6 6 30 27 5 - 360 - 360

B. PRACTICALS AND SESSIONALS

CSE 212B Object Oriented Programming Laboratory (CSE/IT) 2 - 60 60

CSE 213B Data Structures and Algorithm Laboratory (CSE/IT) 2 - 60 60

CSE 214B Logic Design Laboratory (CSE/IT) 2 - 60 60

CSE 216B Scripting Languages Laboratory (CSE/IT) 2 2 1 ¼ - 60 60

Total (B) 8 2 1 ¼ - 240 240

Total of Semester (A+B) 18 6 8 32 28 5 - 360 240 600

For a pass, a candidate must obtain:

(a) 35 percent in each of the written paper

(b) 50 percent in each of practical and sessionals, and

(c) 45 percent in the Grand Total

THIRD SEMESTER

Ma 201 A – ADVANCED ENGINEERING MATHEMATICS – I (CSE/IT)

3L,1T 3 Hours, 60 Marks

Section-A

Differential Equations: Simultaneous differential equations, Total differential equation,

Partial differential equation of the first order (Langrange’s and Charpit’s Methods),

Linear partial differential equations with constant coefficients. Partial differential

equations of the second order; classification, Monge’s methods. Solution of Wave, Heat

(one dimension) and Laplace equations (two dimensional) by separation of variables

method.

Section-B

Complex Analysis: Analytic functions, complex integration, Cauchy’s integral theorem,

Cauchy’s integral formula. Taylor’s and Laurent’s theorems. Singularities of an analytic

function, Pole, Residue, Cauchy residue theorem, Use of calculus residues to evaluate

integrals of the types ∫ f(x) dx and ∫ f(x) dx. Conformal and bilinear transformations.

Section-C

Vector Calculus: Definitions of Gradient, divergence and curl. Various identities

involving them. Green Gauss and Stoke’s theorems (statement and verification only).

Calculus of Variation: Classical problems, Euler-Langrange equations, Isoperimetric

problem.

Statistics: Concept of probability; Binomial, Poisson and normal distributions.

Coefficient of correlation and lines of regression.

CSE 211 A - DISCRETE STRUCTURES (CSE/IT)

3L, 1T 3 Hours, 60 Marks

Introduction to Discrete Mathematical Structures, Formal Methods: Induction and

Analogy, Abstraction.

Sets, sequences, empty set, power set, operations on sets, Venn diagram, ordered pair,

principle of inclusion and exclusion. Counting and Combinatorics.

Introduction to mathematical logic, statements and notations, well-formed formulas,

tautologies, tautological implications, normal forms, the theory of Inference for statement

calculus, predicate logic.

Graph Terminology, Degrees of Nodes, Isomorphic Graphs, Dijkstra’s Shortest Path

Algorithm, Planar Graphs, Eulerian Graphs, Hamiltonian Graphs, Traveling Salesman

Problem.

Trees, Introduction, Rooted and Other Trees, Representation of Prefix Codes,

representation of Arithmetic Expression, Representation of Prefix Codes, Spanning

Trees, Traversing Binary Trees, Binary Search Trees.

Relations, matrix and graph representation of relation, properties of relations, partitions.

Equivalence Relations, Compatibility Relations, Composition of Binary Relations,

Transitive and symmetric closures, partially ordered set, lattices. Recurrence relations.

Functions, Matrix representation of functions, composition of function, inverse function.

Algebraic Structures, General properties of algebraic systems, groupoids, semigroup,

monoids, group, rings. Applications of algebra to control structure of a program.

Homomorphism, congruences, admissible partitions. Groups and their graphs.

CSE 212 A - OBJECT ORIENTED PROGRAMMING (CSE/IT)


A review of C. Concepts of object oriented programming using C++. Data types:

elementary and derived data types, literals.

Operators and expressions: operators, association and precedence rules of operators,

expressions using unary, binary and ternary operators.

Statements: declarations as statements, selection statements, iteration statements, go to

statement, break statement, continue statement, return statement, try-catch block.

Functions: void functions, functions with return value, call by value and call by reference

parameter passing, default parameters, recursive functions, inline functions.

Classes: classes, objects, friend functions, classes within a class, local classes, global

classes, constructors, destructors.

Derived classes: single and multiple derivation of classes, multilevel and hybrid

derivation of classes, constructors, destructors.

Polymorphism: function and operator overloading, virtual functions.

Streams: input and output of built-in data types, manipulators.

File streams: opening a file, accessing a file, closing a file.

Exceptions: catching exceptions, rethrowing the exception, standard exceptions.

Templates: defining a template, template instantiation, function templates, class

templates.

Elementary case study of an object oriented database in C++.

CSE 213 A - DATA STRUCTURES AND ALGORITHMS (CSE/IT)


Introduction to data structure, String storage representation and manipulation. Markov

algorithm and primitive data structures.

Concepts of non primitive data structures. Linear data structure. Array, stack, queue,

their applications and implementations using sequential storage representation and

linked representation.

Linear linked list, double linked list, circular linear linked list and generalised lists and

applications.

Concept of non-linear data structures, Tree, graph, set and their representation,

Binary Tree, Threaded tree, different techniques of tree traversal, breadth first search,

depth first search, application of tree and graph such that Polish notation, concepts of

heap.

Sorting, searching algorithms and comparative study of different sorting and

searching techniques such that selection sort, heap sort, bubble sort, quick sort, merge

sort and radix sort. Linear search and binary search, hashing. External sorting.

Time and space complexity of the algorithms – Big-O,θ,Ω, and small-o, Asymptotic

complexity, Upper and Lower bound time and space trade offs.

CSE 214 A - LOGIC DESIGN (CSE/IT)


Introduction to number systems, concept of logic gates, boolean algebra and

simplification of boolean expressions, K-map, tabular method, combinational circuits,

half adder, full adder, flip flops, transfer circuits, clocks, shift registers and binary and

BCD counters.

Multiplexer, demultiplexer, encoder, decoder.

Analysis and design of synchronous sequential systems, finite memory and flow chart

method of design, State assignment, races and hazards, Introduction to threshold logic &

relay circuits, sequential adder.

Introduction to switching devices, positive and negative logic. OR, AND, NOR, NAND,

Exclusive OR and Exclusive NOR gates, RTL, DCL, DCTL, TTL, RCTL, ECL, HTL,

MOS AND CMOS logic circuit and their realization. Fan-in and Fan-out capacity. Speed

and delay in logic circuit.

CSE 215 A - COMPUTER ORIENTED STATISTICAL METHODS (IT)


Frequency distribution, Class interval, limit, boundaries, class mark, histograms and

frequency polygon, relative frequency distribution, cumulative frequency distribution

curves, Frequency curves.

Measure of central tendency, mean, arithmetic and weighted arithmetic and their

properties, median, mode, the Empirical relation between mean, median and mode,

geometric mean, harmonic mean. The root mean square (RSM). Quartiles, Deciles, and

Percentiles.

Measures of Dispersions, range, mean deviation, standard deviation. Variance, properties

of standard deviation , Empirical relation between measure of dispersions, Absolute and

relative dispersion , coefficient of variation.

Moments for grouped data, relations between moments, computations. Skewness,

Kurtosis, Population moments.

Probability theory, conditional probability, independent, dependent and mutually

exclusive events. Probability distribution . Mathematical expectations. Combinations

and permutations.

Sampling theory , random samples, random numbers, sampling distribution of means,

preposition, differences and sums, Standard errors.

Decision theory, statistical decision, hypotheses, tests of hypotheses and significance.

Decision rules, Type I, II, errors, level of significance. Special tests. Tests involving

binomial and normal distribution, two tail and one tail test Curve fitting, equations of

approximations curve, free hand method of curve fitting, the straight line.

Subject approach shall be algorithmic.

CSE 216B – SCRIPTING LANGUAGES LABORATORY (CSE/IT)

2P 60 Marks

PEARL, PYTHON, AWK, SHELL. Data types, variables, and control structures. Basic

introduction to PEARL, PYTHON, AWK, SHELL, simple application programme,

followed by 200-300 LOC application development.

B.E. II YEAR (INFORMATION TECHNOLOGY)

SEMESTER IV EXAMINATION SCHEME 2015

A. THEORY PAPER

Subject

Nomenclature Subject

Lec

ture

(L

)

Tuto

rial

(T

)

Pra

ctic

al (

P)

Conta

ct

Cre

dit

Unit

Exam

. H

rs.

Marks

Theory

Practicals

&

Sessionals

Total

Ma 202A Advanced Engineering Mathematics-II (CSE/IT) 3 1 - 4 4 ½ 3 60 - 60

CSE 221A Principles of Programming Languages (CSE/IT) 3 1 2 6 5 1 3 60 - 60

CSE 223A Database & File Systems (CSE/IT) 3 1 2 6 5 1 3 60 - 60

CSE 224A Computer Architecture & Microprocessors (IT) 3 1 2 6 5 1 3 60 - 60

CSE 225A Communication Engineering (CSE/IT) 3 1 2 6 5 1 3 60 - 60

Total (A) 15 5 8 28 24 4½ - 300 - 300


CSE 221B Programming Laboratory (CSE/IT) 2 - 60 60

CSE 223B Database & File Systems Laboratory (CSE/IT) 2 - 60 60

CSE 224B Computer Architecture & Microprocessor Laboratory (IT) 2 - 60 60

CSE 226B Unix/Linux Laboratory (CSE/IT) 2 2 1 ¼ - 60 60

CSE 225B Communication Engineering Laboratory (CSE/IT) 2 - 60 60

Total (B) 10 2 1 ¼ 300 300


Total of year 660 540 1200

Joint award for III & IV Semesters (Marks not counted for award of division / degree)

FE 223 Co-curricular Activities - 2 2 2 1 ½ - 100





FOURTH SEMESTER

Ma 202 A – ADVANCED ENGINEERING MATHEMATICS – II (CSE/IT)


Section-A

Integral transforms: Laplace transform, various theorems, Inverse Laplace transform,

Applications to solutions of ordinary and simultaneous differential equations. Infinite Fourier

transform, various theorems and application to solution of first order partial differential

equation.

Section-B

Special Functions: Solutions of Bessel and Legendre’s differential equations. Bessel function

and Legendre polynomial of first kind. Their generating functions, recurrence relations,

orthogonality, Rodrigue’s formulae, and other properties. Solution of Hypergeometric

differential equation, Gauss hypergeometric function, its integral, representation, Gauss

summation theorem, their transformations.

Section-C

Numerical Methods: Newton –Gregory formula, Langrange’s method, Gauss backward,

Gauss forward, Stirling’s methods for interpolation. Newton-Gregory, Stirling methods for

numerical differentiation. Trapezoidal and Simpson’s 1/3 and 3/8 rule for numerical

integration. Numerical solution of ordinary differential equations of first and second order by

Euler, Taylor, Milne’s, Runge-Kutta methods. Bisection, Regula-falsi, secant, Newton-

Raphson methods for solution of algebraic and transcendental equations. Matrix

representation of simultaneous equations. Gauss elimination, Jordan Jacobi, Gauss-Siedal

methods for simultaneous linear algebraic equations.

CSE 221 A - PRINCIPLES OF PROGRAMMING LANGUAGES (CSE/IT)


Importance of programming languages, brief history , features of good programming

language. Translators, Syntax, semantics, virtual computers. Binding and binding time.

Elementary and structured data types, their specifications and implementation. Type

checking and type conversion, vectors arrays, records, character string, variable size

data structures. Sets, input and output files.

Evolution of the concept of data type, abstraction, encapsulation and information

binding, subprograms, type definition and abstract data types.

Implicit and explicit sequence control, sequence control within expression and between

statements. Subprogram sequence control, Recursive subprograms, Exception and

exception handlers, Coroutines and scheduled subprograms. Task and concurrency

exception.

Names and referencing environments, Static, dynamic and block structure, Local data and

local referencing environments.

Dynamic and static scope of shared data, Block structure, parameters and their

transmission. Tasks and shared data. Storage requirement for major run-time elements.

Program and system controlled storage management. Static and stack-based storage

management. Fixed size and variable-size heap storage management.

CSE 223 A - DATABASE AND FILE SYSTEMS (CSE/IT)


Introduction to database systems. A historical perspective, file systems v/s DBMS,

advantages of a DBMS, Data abstraction, models, instances and schemes. Data

independency. Data definition and manipulation languages. Database manager,

administration and users. Overall system structure.

Entities and entity sets. Relationships and relationship sets. Attributes, mapping, keys, E-R

diagram and its conversion to tables. Design of an E-R database scheme.

Structure of relational database. The relational algebra. The tuple and domain relational

calculus. Modification of databases and views.

Query languages, SQL and query by examples. Security of databases against misuse.

Domain constraints, referential integrity, functional dependencies, assertions and

triggers. Pitfall in relational database design. Normalization using functional, multi

valued and join dependencies. Domain key normal form. Alternative approaches to

database design.

Data storage, Physical storage media, files organization, organisation of records into blocks,

sequential files , mapping relational data to files, data dictionary storage, buffer management,

Basic concept of indexing and hashing, properties of indexes, index specification in SQL,.

B+ - Tree and B-Tree index files. Hash base indexing, static hash functions, dynamic hash

function.

CSE 224 A –COMPUTER ARCHITECTURE AND MICROPROCESSORS (IT)


Stored program concept, Von-Newman Architecture, Harvard Architecture.

Construction of ALU, number representation, floating point number system, and

arithmetic operations on floating point numbers.

Concept of control unit, execution of instructions, Hardwired and Microprogrammed

control unit, Microinstructions, Horizontal and vertical format, Microprogramming, Wilkes

control .

Memory element, Hierarchy of memories, Associative memory, cache memory, Data transfer

technique, DMA, Interrupts.

Introduction to Microprocessors, 8085 Architecture, Flag Register, general purpose registers,

Instruction format, Instruction set, Addressing modes, timing diagrams.

Assembly language programming, subprograms, Interrupt programming, Interfacing

concepts, I/O mapped I/O and Memory mapped I/O.

CSE 225A – COMMUNICATION ENGINEERING (CSE/IT)


Introduction to analog and digital techniques for electrical communication. Concept of

baseband and carrier transmission. Elementary study of AM, DSBSC SSB, FM and PM.

Sampling theorem and principle of pulse analog modulation. Elements of PCM,

fundamentals of digital carrier modulation techniques for data communication.

Concept of FDM and TDM. Meaning of synchronous and asynchronous transmission.

Principle of models. Effects of noise in communication systems.

General structure of telecommunication networks. Simplex, duplex and half-duplex lines,

concepts of centralized and common control switching in telephone networks.

Qualitative study of radio-wave propagation. Introductory study of microwave LOS

tropospheric scatter, satellite and optical communications.

B.E. III YEAR (INFORMATION TECHNOLOGY)

SEMESTER V EXAMINATION SCHEME 2016

A. THEORY PAPER

Subject Nomenclature

Subject

Lec

ture

(L

)

Tuto

rial

(T

)

Pra

ctic

al (

P)

Conta

ct

Cre

dit

Unit

Exam

. H

rs.

Marks

Theory

Practicals

&

Sessionals Total

CSE 311A Theory of Computation (CSE/IT) 3 1 - 4 4 ½ 3 60 - 60

CSE 312A Database Management System (CSE/IT) 3 1 2 6 5 1 3 60 - 60

CSE 313A System Programming (CSE/IT) 3 1 2 6 5 1 3 60 - 60

CSE 315A Java Programming (CSE/IT) 3 1 2 6 5 1 3 60 - 60

CSE 316A Computer Networks (CSE/IT) 3 1 2 6 5 1 3 60 - 60

CSE 317A Human Computer Interaction (IT) 3 1 - 4 4 ½ 3 60 - 60

Total (A) 18 6 8 32 28 5 - 360 - 360


CSE 312B Database Management System Laboratory (CSE/IT) 2 - 60 60

CSE 313B System Programming Laboratory (CSE/IT) 2 - 60 60

CSE 315B Java Programming Laboratory (CSE/IT) 2 - 60 60

CSE 316B Computer Networks Laboratory (CSE/IT) 2 - 60 60

CSE 317B Human Computer Interaction Laboratory (IT) 2 60 60

Total (B) 10 - 300 300






FIFTH SEMESTER

CSE 311 A – THEORY OF COMPUTATION (CSE/IT)


Introduction to Automata theory, description of finite automata, transition Systems.

Properties of transition functions, acceptability of a string by a FA.

Non-deterministic finite state machine. Conversion from NDFA to DFA. The equivalence

of DFA and NDFA. Finite automata. Mealy & Moore machine with outputs. Conversion

from a Moore machine to Mealy machine and vice-versa. Minimization of finite automata.

Regular set and regular grammar. Regular expression, finite automata and regular

expressions, transition system and regular expression. Equivalence of two finite automata.

Equivalence of two regular expressions. Kleen’s closure theorem. Construction of finite

automata equivalence to a regular expression.

Context free languages and derivation trees. Left most and right most derivations. Normal

forms of context free grammars (i) Chomsky-normal form (ii) Greibach-normal form.

Push down automata, acceptance by PDA, PDA and context free languages.

Introduction to Linear bounded automata, acceptance by LBA, LBA and context sensitive

language.

Turing machine model, representation of TMs, languages acceptability by TMs, design of

TMs, universal TMs and other modifications of TM, and Chomsky-Hierarchy grammar.

CSE 312 A – DATABASE MANAGEMENT SYSTEM (CSE/IT)


Review of Database Models. Basic concepts of object oriented model, New data base

applications, object structure, class hierarchy, Multiple inheritance, object identity, object

containment, physical organization, object oriented queries, scheme modification.

Comparison between RDBMS and OODBMS, crash recovery. Failure classification, storage

hierarchy.

Transaction model , log-based recovery, Buffer Management , check points, shadow paging ,

failure with loss of non-volatile storage, stable storage implementation, concurrency control

schedule, Testing for serializability, lock-based protocols, Time stamp based protocols,

validation techniques, multiple Granularity, Multiversion schemes, Insert and Delete

operations.

Basics of XML, Schema, Syntax and Sementics, view, manipulations, query, design,

constraints, translation from Relational database, applications.

Security and Integrity violations, Authorizations and views, security specification in SQL,

Encryption, statistical databases. Introduction to distributed databases, Internet data bases.

Data base Design case study.

CSE 313 A - SYSTEM PROGRAMMING (CSE/IT)


System Software and Machine Architecture, General register level architecture, VAX,

Pentium, RISC Machines – Power PC, instruction and data formats.

Assemblers: Basic functions, Algorithm and Data Structures.

Machine dependent assembler features: Instruction formats and addressing modes, program

relocation.

Machine Independent features: Literals, symbol definitions.

Program blocks, control sections and Linking.

Assembler design, one pass and multi-pass assemblers, MASM, and SPARC assemblers.

Loaders and Linkers: Loaders functions, absolute loader, boot strap-loader, Machine

dependent and independent features, relation and lining. Data structures and algorithm of

loader, Library Search, Linkage editors, Dynamic and Static Linking. Specific examples.

Macroprocessors: Functions, algorithms and data astructures, macro-expansion. Macros of

HLLs, specific examples and macroprocessors.

Basic idea of compilers, phases/posses of compiles. Interpreters, compiler-compilers. Sun

OS complier, lex, yacc, gcc.

Operating System, its functions, types of OS, User interface, run time environment, interrupt

processing, process scheduling, memory management, file processing, job scheduling,

protection.

CSE 315 A - JAVA PROGRAMMING (CSE / IT)

3L, IT 3 Hours, 60 Marks

Evolution of programming languages, generation of programming languages, type of

programming languages.

Basic feature of Java, flow control, classes, objects, interfaces, exception and packages.

Java classes and object, access control and inheritance, constructions, inheritance and

overloading. Extension of classes.

Data type, control-flow, basics of exception handling, operations on data types.

Introductory idea of threads and their applications.

Basic I0 packages and standard utilities. Application of Java for system programming.

Introduction to LINUX shell, variables, condition and control structures.

Introduction to TCL/TK programming language.

CSE 316A- COMPUTER NETWORKS (CSE/IT)


Introduction to Computer Networks, advantages, LAN, MAN, WAN, Network topologies.

OSI reference model, Basic concepts, services and layers of OSI model. Physical layer

protocols- RS 232C,RS-449, X.21, X.24, Ethernet, Data link layer- basic link protocols,

character and bit oriented protocols, Flow control, Error detection, Error control, High level

Data Link control (HDLC).

Network layer- Virtual circuit, X.25 specification, Data grams, Transport, Session,

Presentation and Application layers. Connection less and connection oriented protocols,

circuit, message and packet switching.

Introductory study of TCP/IP protocol suit, LAN Topologies and transmission media, twisted

pairs, coaxial, optical fibers. LAN access techniques, random access method, ALOHA,

CSMA, CSMA/CD, Controlled access schemes.

Introduction to Network interconnections, Bridges and Routers.

INTERNET and WWW. Domain name system, E-mail, HTML, TELNET and file transfer

protocol (FTP).

Introduction to Wireless Networks.

Basic idea of information and Network Security – Encryption, Decryption, DES, RSA,

Digital Signatures, Firewalls, BGP.

CSE 317 A - HUMAN COMPUTER INTERACTION (IT)


Evolution of HCI. Introduction to computer graphics, models of interactive graphics system,

display file, problems of picture transformation, taxonomy of display system. Introduction to

picture structures and transformations.

Display Processor - typical CRT specification, display file and picture file organization,

language concepts of interactive computer graphics.

Usability Engineering Methods and Concepts : :Emergence of usability, user centered

system development. Strategic Use of Complex Computer Systems, strategies in the

intermediate layers of knowledge, Evidence for the effects of aggregation strategies on

performance, possible explanations of inefficient computer usage.

Human factors in programming and software development.

User Interface design activities. User Interface software tools, Themes in evaluating tools.

Input devices and techniques, Underlying principles, interaction tasks; 1, 2 and 3 dimension

locators; various body movements for control of input devices. Output Devices and

techniques. Visual displays, resolution, color vision, and displays, Virtual reality displays.

Interactive techniques and their characteristics. Basic interaction styles, command language,

menus, direct manipulations. interaction objects for graphical user interface, navigation,

components of GUI, Multimedia, interfaces and types. Multimedia hardware requirements,

applications of multimedia techniques, effects of multimedia on user performance.

B.E. III YEAR (INFORMATION TECHNOLOGY)

SEMESTER VI EXAMINATION SCHEME 2016

A. THEORY PAPER

Subject


Lec

ture

(L

)

Tuto

rial

(T

)

Pra

ctic

al (

P)

Conta

ct

Cre

dit

Unit

Exam

. H

rs.

Marks

Theory

Practicals

&

sessionals

Total

CSE 322A Operating System Design (CSE/IT) 3 1 2 6 5 1 3 60 - 60

CSE 323A Engineering Management & Economics (CSE/IT) 3 1 - 4 4 ½ 3 60 - 60

CSE 325A Artificial Intelligence (CSE/IT) 3 1 2 6 5 1 3 60 - 60

CSE 327A Computer Oriented Optimization (IT) 3 1 - 4 4 ½ 3 60 - 60

CSE 328A Robotics (CSE/IT) 3 1 2 6 5 1 3 60 - 60

Total (A) 15 5 6 26 23 4 - 300 - 300


CSE 322B Operating System Design Laboratory (CSE/IT) 2 - 60 60

CSE 325B Artificial Intelligence Laboratory (CSE/IT) 2 - 60 60

CSE 326B Information System Project Laboratory (IT) 2 - 60 60

CSE 328B Robotics Laboratory (CSE/IT) 2 - 60 60

Total (B) 8 - 240 240



Joint award for V& VI Semesters (Marks not counted for award of division / degree)

FE 223E Co-curricular Activities - 2 2 2 1 ½ - 100





SIXTH SEMESTER

CSE 322A – OPERATING SYSTEM DESIGN (CSE/IT)


Introduction to operating system, operating system functions, batch processing systems,

multiprogramming systems, time sharing systems, real time operating systems.

Process management, process concept, process scheduling, operation on processes, cooperating

processes, interprocess communication.

CPU scheduling, scheduling algorithms – first come first served, shortest job first, priority

based, round robin, multilevel queue, multilevel feedback queue.

Process synchronization, critical section problem, semaphores, monitors. Deadlocks, deadlock

prevention, deadlock avoidance, deadlock detection.

Memory management, contiguous allocation, paging, segmentation, virtual memory, demand

paging, page replacement, page replacement algorithms – first in first out algorithm, optimal

algorithm, least recently used algorithm.

File concepts, directory structure, file protection, allocation of disk space.

I/O systems, I/O hardware – polling, interrupts, direct memory access. Disk scheduling, disk

scheduling algorithms – first come first served algorithm, shortest seek time first algorithm,

SCAN algorithm, C-SCAN algorithm, C-LOOK algorithm.

Protection and security in an operating system, access matrix, capabilities.

Case studies of Windows / LINUX operating System.

CSE 323A – ENGINEERING MANAGEMENT AND ECONOMICS (CSE/IT)


Principle and Techniques of Management: Management function, theories of management and

their application to Indian and International conditions. Responsibility, authority, leadership,

motivation, co-ordination and co-operation. Change agent. Importance of organization charts

and their application to Computer Industries.

Forms of Business: Proprietorship, partnership, joint stock companies, joint sectors and co-

operative movements.

Financial Management: Objectives, functions and importance of financial management, Book-

keeping, journals and ledgers, Balance sheet, profit and loss accounts, fund flows and financial

ratios, sources of finance and Financial Institutions Interest and depreciation, Salvage value.

Cost Accountancy: Various types of costs, profit, volume ratio, Break even analysis and

marginal costing.

Marketing Management: Concept of marketing and its various components.

Stores and Purchase Management: Function of store and purchase management. Economic

order quantity, A-B-C analysis. Inventory control and management. Purchase procedure in

Government, Public and Private undertakings. Floating of tenders. Contracts.

Production Planning and Control: Job, Batch and Mass production, Production efficiency,

productivity. Site selection, Production planning, Routing, scheduling and follow up.

Elements of time and motion study. Quality control and quality assurance.

Nature and Scope of Economics: Basic concepts of managerial economics. Supply and

demand, free competition, monopoly and oligopoly. Health of Indian Economics and factors

affecting it.

Feasibility Reports: Preparation of feasibility, techno-economic and project reports.

Government Organizations: Department of Electronics, NASSCOM , STPI, Free trade zones

for Electronics and computer industries, ministry of IT and its role.

CSE 325A – ARTIFICIAL INTELLIGENCE (CSE/IT)

3L, IT 3 Hours, 60 Marks

Defining artificial intelligence (AI), historical foundations, development of logic, turing test,

AI application areas.

Prepositional calculus, syntax and semantics, Predicate calculus syntax and semantics.

Inferencing and unification.

Searching structures and strategies for state space search, using the state space to represent

reasoning with the predicate calculus. Heuristic searches and algorithms and use of heuristics

in games. Control and implementations of state space search, recursion-based search, pattern

directed search and Production systems.

Languages for AI, problem solving, introduction to Prolog, its syntax, abstract data types,

production system and designing of alternative search strategies.

Overview of expert system, knowledge engineering process, conceptual models. Framework

of organization and applying human knowledge. Managing uncertainty in expert system—

concepts of Bayesion probability theory, non-monotonic logic and reasoning with belief, fuzzy

logic and Dempster/Shafer approaches to uncertainty. Case studies of typical expert system.

Knowledge representation and its issues, network representation, conceptual graphs and

structured representation.

Automated reasoning, resolution theorem proving issues and design of automated reasoning

programs.

CSE 326A– ANALYSIS AND DESIGN OF INFORMATION SYSTEM (IT)


Information management – types of information, management structure, management and

information requirements, quality of information, examples of information systems.

Information systems analysis overview. Information gathering – strategy, information sources

and examples.

Requirements specifications–data dictionaries, steps and stages in requirements specifications,

modularization of requirements. Feasibility studies- deciding projects goals, alternative

solution, cost-benefit analysis and feasibility reports.

Data flow diagrams, describing a system with DFSs, leveling of the DFDs, type DFDs .

Process specifications and its methods. Decision tables, their type and applications.

Logical database design – entity relationship model, cardinality and partcipation, relations and

normalization, second and third normal forms. Boyce code normal form.

Design files, files organizations and processing of various types of files.

Database management system and their comparisons with file based systems.

Data input methods, coding techniques, detection of errors. Design of output.

Security, disaster / recovery.

Ethics in system development.

Case studies of typical information systems.

CSE 327A – COMPUTER ORIENTED OPTIMIZATION (IT)


Linear functions and linear equations, matrix algebra, quadratic functions, exponential and

logarithmic functions, sequences, series and limits, derivatives and applications.

Analysis of allocation problems with Mathematical Programming: Methods of formulating and

solving linear programming problems. Linear programming as an aid to planning the

allocation of interdependent resources. Value of models in the sensitivity testing of

formulations. Evolutionary nature of large models as a decision making aid.

Characterization of Scheduling Situations: Characterization of a set of in or look in activities

as a network. Algorithms for formulating and solving critical path models.

Problems of manipulating estimates and range of accuracy measurements, job scheduling and

dispatching rules. Use of network models for control of projects. Scheduling in operating

systems.

Dynamic Programming: The principle of optimality, Decision Trees, Determinatic problems,

Probabilistic Problems.

CSE 328A- ROBOTICS (CSE/IT)


Introduction: Automation and Robotics, CAD/CAM for Robotics – An overview of Robotics –

present and future applications – classification by coordinate system and control system.

Components of the Industrial Robotics: Function line diagram representation of robot arms,

common types of arms. Components, Architecture, number of degrees of freedom –

Requirements and challenges of end effectors, determination of the end effectors, comparison

of Electric, Hydraulic and Pneumatic types of locomotion devices.

Motion Analysis: Homogeneous transformations as applicable to rotation and translation

numerical problems. Manipulator Kinematics: Specifications of matrices, D-H notation joint

coordinates and world coordinates. Forward and inverse kinematics numerical problems.

Trajectory planning and avoidance of obstacles, path planning, Skew motion, joint integrated

motion –straight line motion – Robot programming, languages and software packages.

Robot actuators and Feed back components: position sensors – potentiometers, resolvers,

encoders – Velocity sensors.

Introduction to Microcontroller Families, Introduction to AVR microcontrollers, Interfacing of:

LEDs, Switches, Relays, LCD, 7 Segment Display, ADC, Stepper Motors, DC Motors, IR

Sensors, Serial Communication, GSM module, GPS module, I2C devices, PWM Techniques

Software tools for robot programming, Cross Compilers. Machine vision and image processing

Robot Application in Manufacturing: Material Transfer - Material handling, loading and

unloading-

Processing - spot and continuous arc welding & spray painting - Assembly and Inspection.

Mini software simulation project

B.E. FINAL YEAR (INFORMATION TECHNOLOGY)

SEMESTER VII EXAMINATION SCHEME 2017

A. THEORY PAPER

Subject


Lec

ture

(L

)

Tuto

rial

(T

)

Pra

ctic

al (

P)

Conta

ct

Cre

dit

Unit

Exam

. H

rs.

Marks

Theory

Practicals

&

sessionals

Total

CSE 411A Design & Analysis of Algorithms (CSE/IT) 3 1 - 4 4 1 3 60 - 60

CSE 413A Software Engineering (CSE/IT) 3 1 2 6 5 1 3 60 - 60

CSE 414A Principles of Compiler Design (CSE/IT) 3 1 2 4 4 1 3 60 - 60

CSE 416A Data Warehousing & Data Mining (IT) 3 1 2 6 5 1 3 60 - 60

CSE A Elective - I 3 1 2 6 5 1 3 60 - 60

Total (A) 15 5 8 26 23 5 - 300 - 300


CSE 413B Software Engineering Laboratory (CSE/IT) 2 - 60 60

CSE 414B Compiler Design Laboratory (CSE/IT) 2 60 60

CSE 416B Data Warehousing & Data Mining Laboratory (IT) 2 - 60 60

CSE B Elective – I Laboratory 2 - 60 60

CSE 418 D Seminar (IT) 2 2 1 ½ - - 60 60

Total (B+D) - - 8 - - - - - 300 300

Total of Semester (A+B+D) 15 5 8 26 23 5 - 300 300 600


(a) 35 percent in each of the written paper, (b) 50 percent in each of practical and sessionals, and (c) 45 percent in the Grand Total

List of Elective –I:

CSE 441A – Geographic Information System (IT)

CSE 442A – E-Commerce (IT)

CSE 443A – E-Governance (IT)

CSE 444A – Enterprise Resource Planning (IT)

CSE 452A – Image Processing (CSE/IT)

CSE 453A – Client-Server Technology (CSE/IT)

CSE 454A – Multimedia Technology (CSE/IT)

CSE 456A – Web Technology (CSE/IT)

CSE 457A – Digital Signal Processing (CSE/IT)

SEVENTH SEMESTER

CSE 411A - DESIGN AND ANALYSIS OF ALGORITHMS (CSE/IT)


Review of Algorithm and its specification, performance analysis and Randomized Algorithms.

Random access machines (RAM), computational complexity of RAM program. Time and

Space complexity, Asymptotic notations (Big-O,θ,Ω, and small-o).

Design of Efficient Algorithms: Designing Methods. Divide and conquer: Binary Search,

finding maximum and minimum, Merge Sort, Quick Sort. Greedy methods: Knapsack problem,

tree vertex splitting, minimum cost spanning tree. Dynamic programming: Matrix Chain

Multiplication, Longest Common Subsequence, Multi Stage Graph and 0/1 Knapsack Problem.

Branch and Bound: Traveling Salesman Problem and Lower Bound Theory.

Sorting and Comparative study: Algorithms and comparisons of Radix sort, Heap sort, Merge

sort and Quick sort. Order statistics and expected time for order statistics.

Matrix multiplication and related operations: Strassen’s Matrix Multiplication Algorithm,

inversion of matrices, LUP decomposition of matrices and its applications.

Advanced Trees: Definitions Operations on Weight Balanced Trees (Huffman Trees), 2-3

Trees and Red- Black Trees. Augmenting Red-Black Trees to Dynamic Order Statistics and

Interval Tree Applications.

Graph Theory Algorithms: Algorithms for Connectedness, Finding all Spanning Trees in a

Weighted Graph and Planarity Testing, Breadth First and Depth First Search, Vertex cover

problem.

Problem Classes: NP, NP-Hard and NP-Complete. Decision Problems. Polynominal

reductions. Cook's Theorem. Proving NP-Complete Problems - Satisfiability problem.

Randomized Algorithms: Randomized Turing machine and its complexity. Las Vegas

algorithms, Monte Carlo algorithms, randomized algorithm for Min-Cut, randomized algorithm

for 2-SAT.

CSE 413A- SOFTWARE ENGINEERING (CSE/IT)


Introduction, software characteristics and software crisis. The software engineering approach;

software process & process maturity. Various software development models. Software life

cycle concept.

The software project management concepts and team organization. Software process and

project metrics. Software measurement. Metrics for software quality and its integration with

the software process.

Software scope/project estimation – the COCOMO model and the Function Point approach.

Software quality assurance. Software reviews, cost impact and software defects. Formal

Technical Reviews, software reliability.

Conventional methods for software engineering. Analysis concepts and principles. The

software requirements specifications. Software prototyping.

Software design and software engineering, software architecture. Effective modular design—

functional independence, cohesion and coupling concepts. Component level/procedural design.

Software testing techniques and strategies.

CSE 416A – DATA WAREHOUSING AND DATA MINING (IT)


Expanding Universe of data, data mining v/s Query tools, and practical applications.

Self-learning computer system, machine learning and concept learning.

Introduction to data mining and data warehousing, Data mining tools and techniques, real life

applications of data mining, data warehouse Design issues, architecture of data warehouse.

Object oriented data warehousing and their performance monitoring.

Decision support system, component of decision support, designing decision support system.

Integration with data mining, cost justification.

Concept of multidimensional database technology.

Knowledge discovery process, data selection, cleaning, enrichment, coding, mining

Visualization techniques, likelihood and distance, K-nearest neighbor methods, association

rules.

Neural networks and genetic algorithms applications in data mining.

Aspects learning algorithms, Learning compression of data sets, Information

Content of message, Noise and redundancy, significance of noise, fuzzy databases from

Relation to tables, from keys to statistical dependencies.

Knowledge management system, definition, functionalities, search engine and data mining.

Text mining, text analysis techniques. Web analysis, multimedia data mining. Future

Prospectus.

CSE 414 A - PRINCIPLES OF COMPILER DESIGN (CSE/IT)


Introduction to translators , compilers, interpreters, compilation process.

Lexical analyzer, input buffering, specification and recognition of tokens, regular expressions

to NFA, minimization of DFA, keywords and reserve word policies, LEX - the lexical analyzer

generator.

Syntax analyzer, context free grammars, top down parsing, Brute force parser, recursive

descent parser, LL (1) parser. Bottom up parsing, operator precedence parsing, LR parser,

LALR parser, YACC - the parser generator.

Syntax directed translation schemes, implementation of syntax directed translators, synthesized

attributes, inherited attributes, construction of syntax trees, bottom up evaluation of S-

attributed definitions, L- attributed definitions, top down translation of L - attributed

definitions.

Errors, lexical phase errors, syntactic phase errors.

Intermediate languages, postfix notation, syntax trees, parse trees, three address code-

quadruples, triples and indirect triples.

Translation of assignment statements, boolean expressions, statements that alter flow of

control, array references, procedure calls, declarations, case statement, record structures.

Symbol tables, operation on symbol tables, symbol table organization for non-block structured

languages, symbol table organization for block-structured languages.

Run time storage management, storage allocation and referencing data in block structured

languages, storage allocation in FORTRAN.

Code optimization, sources of optimization, loop optimization, DAG and optimization of basic

blocks.

Code generation, a machine model, next use information, register allocation and assignment, a

simple code generator, code generation from DAG's, peephole optimization.

ELECTIVE-I

CSE 442 A - E-COMMERCE (IT)


Introduction to electronic commerce, need of e-Commerce, Economic consideration.

Infrastructure for E-Commerce, Intranets and Extranets and various Internet protocols.

Tools for E-Commerce: Introduction to web Server hardware and Web server Software.

Introduction of mark-up languages, web portals, search engines, push technology.

E-Commerce software Requirements- Catalogue display, shopping cart, transaction

processing, and catalogue customization. E-Commerce software development tools and

hosting services.

Security Threats to E-Commerce: Introduction to web hacking. E-Commerce Security threats-

Intellectual Property threat, client threat, communication channel threat and server threat.

Policy for Protecting E-Commerce Assets. Ensuring transaction Integrity and security.

Electronic payment systems: Introduction to Electronic cash, Electronic Wallets, Smart cards,

Credit and Charge Cards.

Business strategies for web: Creating effective web presence, Identifying and reaching

customers, creating and maintaining brands on web. Business models for selling on web.

Introduction to purchasing, logistics and support activities on web.

Introduction to Electronic data Interchange and web auction. Supply Chain Management.

Planning and management of e-commerce projects. Legal, language, ethical and taxation

issues of e-commerce.

CSE 443 A – E-GOVERNANCE (IT)


Principles of public administration. Basic premise – meaning, scope, nature of public

administration and its role. Evolution of public administration, politics & administration and

the new public administration.

Theories of organization – the bureaucratic/classical model, behavioural model, decision model

and systems approach. Organisational effectiveness.

Principles of organizations, structure of organization, Administrative behaviour, Accountability

and control, people participation in administration.

Re-engineering. Role of IT in business process re-engineering (BPR), Business Process

outsourcing (BPO). Process identification and mapping. Process improvement and process re-

design. System security, legal and statutory/sovereign considerations. Re-organising

people and managing change. Best practices.

Delivery of governance through technology.

Improving citizen – government interface, Govt-to-Govt coordination, workflow automation.

Use of video-conferencing, DSS, web-technologies and enterprise wide computing paradigms.

Domain knowledge and technology expertise – case studies.

CSE 453A – CLIENT-SERVER TECHNOLOGY (CSE/IT)


Introduction: Client/Server architecture, Benefits, application, centralize multiuser, Distributed

single user architecture, distributed computing environment.

Approach to Distribution: Distributed models, multi tiered environment, cooperative

processing, application components, and distribution points. Presentation distribution,

distributed processing, distributed function and transaction processing, data distribution.

Client technologies: Function, Application and tools, operating system, hardware plate forms,

database access, interprocess communication tools.

Server technologies: Function, server operating system, hardware plate forms, data access,

distributed data access, database engines.

System networks Architectures: Components, layers, pear-to-pear communication between

SNA layers.

Data Management: Distributed data management, method of the distribution, distributed data

access. Database transaction management.

Distributed DBMS: Architecture, storing data in a distributed DBMS, Distributed catalog,

management, Distributed query processing, Update distributed data. Introduction to distributed

transactions, distributed concurrency control, and distributed recovery.

CSE 454 A – MULTIMEDIA TECHNOLOGY (CSE/IT)


Introduction to multimedia and its applications, Basic requirements for multimedia,

Multimedia building blocks - Text, Sound, Images, Animation, Video and related tools.

Multimedia Hardware: SCSI, MCI, Memory and storage devices, Output Hardware,

Communication devices.

Multimedia Software: Basic tools - Painting and drawing tools, 3-D modelling and animation

tools, Images and editing tools, OCR software, Sound Editing programs, Animation, Video and

Digital Movies, Video Formats, Compressing movie files.

Multimedia Authoring tools: Selecting a right tool based on various features, card and page

based authoring tools, Icon based authoring tools, Time based authoring tools, Object -

Oriented Tools.

Assembling and delivering a project: The multimedia team, Planning and costing, designing

and producing.

Multimedia and the internet: working of internet, Tools for www - web page makers and

editors, HTML and Multimedia, Video on demand, Images, sound and animation for the web.

B.E. FINAL YEAR (INFORMATION TECHNOLOGY)

SEMESTER VIII EXAMINATION SCHEME 2017

A. THEORY PAPER

Subject


Lec

ture

(L

)

Tuto

rial

(T

)

Pra

ctic

al (

P)

Conta

ct

Cre

dit

Unit

Exam

. H

rs.

Marks

Theory

Practicals

&

sessionals

Total

CSE 426A Computer Network Management (IT) 3 1 2 6 5 1 3 50 - 50

CSE 427A Information and Network Security (IT) 3 1 2 6 5 1 3 50 - 50

CSE A Elective – II 3 1 - 4 4 ½ 3 50 - 50

CSE A Elective – III 3 1 - 4 4 ½ 3 50 - 50

Total (A) 12 4 4 20 18 3 - 200 - 200


CSE 426B Network Management Laboratory (IT) 2 - 50 50

CSE 427B Information and Network Security Laboratory (IT) 2 - 50 50

CSE B Elective –II Labaoratory 2 - 50 50

CSE B Elective – III Laboratory 2 - 50 50

CSE 432D Project (IT) 6 6 3 ½ - 100 100

CSE 433C Practical Training (IT) 1½ - 75 75

CSE 434C Educational Tour (IT) ½ - 25 25

Total (B+C+D) 14 - 400 400

Total of Semester (A+B+C+D) 12 4 14 28 22 6 200 400 600


Joint award for VII& VIII Semesters (Marks not counted for award of division / degree)

FE 223E Co-curricular Activities - 2 2 2 1 ½ - 100


(b) 35 percent in each of the written paper, (b) 50 percent in each of practical and sessionals, and (c) 45 percent in the Grand Total

List of Elective – II List of Elective – III

CSE 451A – Medical & Health Information System (IT) CSE 456A – Social, Ethical Issues and IT Laws (IT) CSE 452A – Virtual Reality (IT) CSE 461A – Intelligent Database System (CSE/IT) CSE 453A – Project Management and Software Tools (IT) CSE 462A – Object Oriented DBMS (CSE/IT) CSE 454A – Knowledge Management (IT) CSE 463A – Object Oriented Software Engineering (CSE/IT) CSE 455A – Decision Support & Executive Information System (IT) CSE 465A – Information Theory & Coding (CSE/IT) CSE 466A – Graph Theory (CSE/IT) CSE 468A – Mobile Computing (CSE/IT) CSE 470A - Computational Science (CSE/IT) CSE 469A – Bioinformatics (CSE/IT)

EIGHTH SEMESTER

CSE 426 A - COMPUTER NETWORK MANAGEMENT (IT)


Introduction to network management, challenges of information Technology managers. Network

management goals, organization and functions. Network operations and NOC (Network operation

center).

Network installation, Maintenance, current status, Network management standards, models,

organization model, Information model, management information tree.

Internet Organizations and standards, Internet documents.

SNMP model, communication model, architecture, protocol Specifications, operations.

Introductory idea of ISDN, ATM based network and management.

Network management tools and systems, BERT (Berkeley e-mail replacement tool), Basic software

tools, SNMP and MIB (management information base) Tools, protocol analyzer, Traffic load

Monitoring.

Web based management, Web interface and Web Management. Local and remote access. Embedded

Web Based management.

Network management applications, configuration management Inventory management, fault

management, fault detection, fault location and isolation Techniques.

Security management policies and procedures, Resource to prevent security Breaches, Report

Management, Policy Based management.

CSE 427A - INFORMATION AND NETWORK SECURIY (IT)


Introduction to Cryptography: Simple substitution ciphers, divisibility and greatest common

divisions, prime numbers and unique factorization, cryptography before computer age.

Discrete Logarithms and Diffie-Hellman: Public Key cryptography, groups, discrete logarithm

problem and its hardness, Diffie-Hellman key exchange, Chinese remainder theorem.

Integer Factorization and RSA: Euler’s formula, RSA Public Key Crypto System, implementation

and security issues, primality testing.

Digital signature, Hash functions, modern symmetric crypto systems: DES and AES.

Computer Security overview.

Common attacks and Detense Mechanisms; Evesdropping, cryptoanalysis, password pilfering,

Identity spoofing, Buffer-overflow, Repudiation, intrusion & IDS system Traffic analysis, DOS

attacks, Malicious software.

Basic Security models and Security resources.

Network Perimeter Security. Packet Filters, Circuit Gateways, Application Gateways, Trusted

Systems, Firewall Configurations.

ELECTIVE – II

CSE 466 A - GRAPH THEORY (CSE/IT)


Introduction to graphs, applications, representation of graphs. Walk, Paths and circuits.

Isomorphism, connectedness, Euler graph, subgraph, operations on graph, Hamiltonian Paths and

Circuits, Traveling Salesman problem, algorithm of graph traversals, connectedness.

Tree, Spanning tree, Fundamental Circuits, Cut-sets, Connectivity and Separability,

1-isomorphism, 2-Isomorphism, Network flow, Algorithm for spanning tree, cut vertex.

Planar and Dual graphs, Kuratowski's two graph, representations of planar graph, algorithm for

detection of planarity, geometric and combinatorial dual graph, thickness and crossings.

Matrix representation of graphs, incident matrix circuit matrix, cutset matrix, path matrix, adjacency

matrix. Coloring, covering and partitioning, chromatic number, chromatic polynomial, matching,

bipartite graph, four color problem.

Directed graphs, types, binary relations, connectedness, Euler digraph, tree, fundamental circuits,

adjacency matrix, tournaments, acyclic digraph, decyclization, algorithm for finding directed

circuits.

CSE 470A – COMPUTATIONAL SCIENCE (CSE/IT)


Modeling and Simulation: Definition of simulation and modeling; relationship between simulation

and modeling, Purpose including benefits and limitations: role – addressing performance,

optimization; supporting decision, making, forecasting, safety considerations.

Application areas: healthcare (including assisting with diagnostics); economics and finance; city and

urban simulations; simulation in science and in engineering.

Types of simulations – physical, human in the loop, interaction, computer, virtual reality. The

simulation process. simplifying, assumptions; validation of outcomes.

Model building: use of mathematical formula or equation, graphs, constraints. Methodologies and

techniques. Use of time stepping for dynamic systems.

Theoretical considerations; Monte Carlo methods, stochastic processes, queuing theory. Software in

support of simulation and modeling; packages, languages.

Operations Research: Linear programming: Integer programming, The Simplex method,

Probabilistic modeling, Queuing theory, Markov models and chains, Prediction and estimation,

Decision analysis, Forecasting, Risk management.

Software tools for Simulations and Modeling.

ELECTIVE - III

CSE463A–OBJECT ORIENTED SOFTWARE ENGINEERING (CSE/IT)


Object-oriented concepts and principles. Identifying the elements of an object model. Object

oriented projects metrics and estimation.

Object-oriented analysis: Domain analysis, the OOA process, the object-relationship model.

Design for object- oriented systems. The system design process.

Object-oriented testing - testing OOA and OOD models. The object-oriented testing strategies. Inter

class testing.

Technical metrics for O-O systems. Class-oriented metrics & metrics for O-O projects.

Advanced topics in software engineering. Component-based software engineering and development.

Classifying and retrieving components.

Review of CASE tools.

CSE 465 A - INFORMATION THEORY AND CODING (CSE/IT)


Uncertainty, information, measure of information, average information, entropy, property of entropy,

information rate. Discrete memoryless source, Source coding theorem,

Discrete memoryless channel, self and Mutual information, properties, channel capacity, channel

coding theorem, Shannon – Hartley theorem, Information capacity theorem.

Data compaction, prefix coding, Huffman coding, Lempal-Ziv coding. Compression of information.

Type of errors, codes, error control coding, linear block code, error detection and correction codes,

syndrome decoding, cyclic codes, hamming code, BCH, convolution codes, encoders and decoders,

performance of codes.

CSE 469A-BIOINFORMATICS (CSE/IT)


Introduction to Molecular Biology and Biological chemistry: Genetic material, Gene structure and

information content, protein structure and functions, nature of chemical bonds, molecular biology

tools, genomic information content.

Data Searches and pair-wise alignments: Dot plots, Gaps, Dynamic Programming, database searches

and family of algorithms –BLAST and FASTA.

Substitution patterns: Pattern substitution with in genes, estimating substitution numbers, variation

of evolutionary rates between genes, molecular clocks.

Phylogenetics: Its history, phylogentic trees, distance matrix methods. Character-based methods –

parsimony, ancestral sequences. Strategies for faster searches – branch and bound, heuristic.

Consensus trees, parametric tests. The tree of life.

Genomics and gene Recognition: prokaryotic and eukaryotic genomes and their structures, open

reading frames, gene expression.

Protein and RNA structure prediction: Amino-acids, polypeptide composition, structure. Algorithms

for modeling protein folding, and reverse protein folding.

Information integration for life science discovery: Nature of biological data, data sources, challenges

in information integration.

be-it-ii-ii-iv-2015-17

Documents

semester examination

semester final

semester v

examination scheme

final examination

industrial engineering

faculty of engineering

computer science engineering