Scheme of examination



Yüklə 1,11 Mb.
səhifə3/12
tarix08.08.2018
ölçüsü1,11 Mb.
#61216
1   2   3   4   5   6   7   8   9   ...   12

M: Mandatory for award of degree

Note: Minimum of 4-6 weeks of industrial training related to CSE will be held after 6th semester; however, viva-

voce will be conducted in 7th Semester (ETIT 461).



Imp:- Elective Paper will be floated in 7th Semester, if one-third of the total students opt for the same. It is advised that the decision about the elective subject for 7h Semester is done before 15th April every year before end of 6th semester.


BACHELOR OF TECHNOLOGY

(INFORMATION TECHNOLOGY)

SEVENTH SEMESTER EXAMINATION

Code No.

Paper ID

Paper

L

T/P

Credits

THEORY PAPERS

ETIT-401




Advanced Computer Networks

3

1

4

ETIT-403




Cryptography and Network Security

3

0

3

ETEC-405




Wireless Communication

3

0

3

ELECTIVE (SELECT ANY TWO, ONE FROM EACH GROUP))

GROUP-A

ETEC-401




Embedded Systems

3

0

3

ETEC-403




Optoelectronics and Optical Communication

3

0

3

ETIT-407




Cloud Computing

3

0

3

ETIT-409




Distributed Databases

3

0

3

ETIT-411




Semantic Web Technologies

3

0

3

ETIT-413




Software Testing

3

0

3

ETIT-415




Digital Signal Processing

3

0

3

GROUP-B

ETIT-419




.NET and C# Programming

3

0

3

ETIT-421




Enterprise Computing in Java

3

0

3

ETIT-423




System and Network Administration

3

0

3

ETIT-425




Grid Computing

3

0

3

ETIT-427




Advanced Database Administration

3

0

3

ETIT-429




Probablistic Graphical Models

3

0

3

ETHS-419




Sociology and Elements of Indian History for Engineers

3

0

3

PRACTICAL/VIVA VOCE

ETIT-453




Advanced Computer Networks Lab

0

2

1

ETIT-455




Cryptography and Network Security Lab

0

2

1

ETEC-463




Wireless Communication Lab

0

2

1

ETIT-459




Lab based on Elective Group– A or B

0

2

1

ETIT-461




Summer Training / Industrial workshop / Certification

0

0

1

ETIT-463




Minor Project+

0

6

3

TOTAL__15__15__24__Imp'>TOTAL

15

15

24

Imp:- Elective Paper will be floated if one-third of the total students opt for the same. It is advised that the decision about the elective subject for 8th Semester is done before 15th November every year before end of seventh semester. New Electives may be added as per requirement after getting it duly approved by BOS and AC respectively.

+ The student will submit a synopsis at the beginning of the semester for approval from the departmental committee in a specified format, thereafter he/she will have to present the progress of the work through seminars and progress reports.



BACHELOR OF TECHNOLOGY

(INFORMATION TECHNOLOGY)

EIGHTH SEMESTER EXAMINATION

Code No.

Paper ID

Paper

L

T/P

Credits




THEORY PAPERS

ETIT 402




Mobile Computing

3

1

4

ETEC 406




Ad hoc and Sensor Networks

3

0

3

ETHS 402




Human Values and Professional Ethics-II

1

0

1

ELECTIVE (SELECT ANY TWO, ONE FROM EACH GROUP)

GROUP A

ETIT-406




Big Data Analytics

3

0

3

ETIT-408




Social Network Analysis

3

0

3

ETIT-410




Soft Computing

3

0

3

ETIT-412




Bio Informatics

3

0

3

ETIT-414




Web Application development using .NET

3

0

3

ETIC-414




VLSI Design

3

0

3

ETIT-416




Information Theory and Coding

3

0

3

ETCS-404




Human Computer Interaction

3

0

3

GROUP B

ETIT418




Digital Image Processing

3

0

3

ETIT420




Next Generation Networks

3

0

3

ETIT422




GPS and GIS

3

0

3

ETEC404




Satellite Communication

3

0

3

ETIT428




E-Commerce and M-Commerce

3

0

3

ETIT430




Distributed Systems

3

0

3

ETIT 432




Selected Topics of Recent Trends in Information Technology **

3

0

3

PRACTICAL/VIVA VOCE

ETIT 452




Mobile Computing Lab

0

2

1

ETEC-458




Ad hoc and Sensor Networks Lab

0

2

1

ETIT 456




Lab based on Elective - I

0

2

1

ETIT 458




Lab based on Elective - II

0

2

1

ETIT-460




*Major Project

0

12

8

TOTAL

13

21

26

*The student will submit a synopsis at the beginning of the semester for approval from the departmental committee in a specified format, thereafter he/she will have to present the progress of the work through seminars and progress reports. Seminar related to major project should be delivered one month after staring of Semester. The progress will be monitored through seminars and progress reports.

**Syllabus may be revised after 2 years.



NOTE:

  1. The total number of the credits of the B.Tech. (IT) Programme = 215.

  2. Student shall be required to appear in examinations of all courses. However, to award the degree a student shall be required to earn a minimum of 200 credits including mandatory papers (M).

FOR LATERAL ENTRY STUDENTS:

  1. The total number of the credits of the B.Tech. (IT) Programme = 161.

  2. Each student shall be required to appear for examinations in all courses Third Semester onwards. However, for the award of the degree a student shall be required to earn a minimum of 150 credits, including mandatory papers (M).

NOMENCLATURE OF CODES GIVEN IN THE SCHEME OF

B.TECH AND M.TECH

  1. ET stands for Engineering and Technology.

  2. PE stands for Power Engineering.

  3. ME stands for Mechanical Engineering.

  4. MT stands for Mechatronics.

  5. AT stands for Mechanical and Automation Engineering.

  6. EE stands for Electrical and Electronics Engineering.

  7. EL stands for Electrical Engineering.

  8. IT stands for Information Technology

  9. CS stands for Computer Science and Engineering

  10. CE stands for Civil Engineering

  11. EC stands for Electronics and Communications Engineering.

  12. EN stands for Environmental Engineering

  13. TE stands for Tool Engineering

  14. MA stands for Mathematics

  15. HS stands for Humanities and Social Sciences

  16. SS stands for Social Services



APPLIED MATHEMATICS-III
Paper Code: ETMA-201 L T/P C

Paper: Applied Mathematics-III 3 1 4

INSTRUCTIONS TO PAPER SETTERS: Maximum Marks : 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or short answer type questions. It should be of 25 marks.

2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should have two questions. However, student may be asked to attempt only 1 question from each unit. Each question should be 12.5 marks.


UNIT-I

Fourier series: Definition, Euler’s formula, conditions for Fourier expansion, functions having points of discontinuity, change of intervals, even and odd functions ,half range series, Harmonic analysis. Fourier Transforms: Definition, Fourier integral, Fourier transform, inverse Fourier transform, Fourier sine and cosine transforms, properties of Fourier transforms (linearity, scaling, shifting, modulation), Application to partial differential equations.



[T2][No. of hrs 11]

UNIT-II

Difference equation: Definition, formation, solution of linear difference equation with constant coefficients ,simultaneous difference equations with constant coefficients, applications of difference equations .Z- transform: Definition, Z- transform of basic functions, properties of Z-transform (linearity, damping, shifting, multiplication),initial value theorem, final value theorem, convolution theorem, convergence of Z- transform, inverse of Z- transform, Application to difference equations.



[T2][No. of hrs 11]

UNIT-III

Numerical Methods: Solution of algebraic and transcendental equations using bisection method, Regula-Falsi method and Newton – Raphson method. Solution of linear simultaneous equations using Gauss-Jacobi’s iteration method and Gauss-Seidal’s iteration methods.Finite differences: Forward differences, backward differences and Central differences. Interpolation: Newton’s interpolation for equi-spaced values. Stirling’s central difference interpolation formula, Divided differences and interpolation formula in terms of divided differences , Lagrange’s interpolation formula for unequi-spaced values.

[T1,T2] [No. of hrs 11]

UNIT-IV

Numerical Differentiation, maxima and minima of a tabulated function. Numerical Integration: Newton-Cote’s quadrature formula, Trapezoidal rule, Simpson’s one-third rule and Simpson’s three-eighth rule .Numerical solution of ordinary differential equations: Picard’s method, Taylor’s method,Euler’s method, modified Euler’s method, Runge-Kutta method of fourth order.



[T1,T2][No. of hrs 11]

Text Books:

[T1] R.K. Jain and S.R.K. Iyengar,” Numerical methods for Scientific and Engineering Computation”,

New Age Publishing Delhi-2014.

[T2] B. S. Grewal,”Higher Engineering Mathematics” Khanna Publications, 2014 Edition.


Reference Books:

[R1] E. kresyzig,” Advance Engineering Mathematics”, Wiley publications

[R2] P. B. Patil and U. P. Verma, “ Numerical Computational Methods”, Narosa

[R3]. Partial Differential Equations” Schaum’s Outline Series, McGraw Hill.

[R4] Michael Greenberg, “ Advance Engineering mathematics” , Pearson.

[R5] Schaum’s Outline on Fourier Analysis with Applications to Boundary Value Problem, Tata McGraw-Hill



FOUNDATION OF COMPUTER SCIENCE

Paper Code: ETCS-203 L T/P C

Paper: Foundation of Computer Science 3 1 4


INSTRUCTIONS TO PAPER SETTERS: Maximum Marks: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or short answer type questions. It should be of 25 marks.

2. Apart from Question No. 1, the rest of the paper shall consist of four units as per the syllabus. Every unit should have two questions. However, the student may be asked to attempt only 1 question from each unit. Each question should be 12.5 marks.



Objective: To give basic knowledge of combinatorial problems, algebraic structures and graph theory.



UNIT- I

Formal Logic: Preposition, Symbolic Representation and logical entailment theory of Inferences and tautologies, Predicates, Quantifiers, Theory of inferences for predicate calculus, resolution. Techniques for theorem proving: Direct Proof, Proof by Contraposition, proof by contradiction.



[T1,T2][No. of hrs. 10]

UNIT- II

Overview of Sets and set operations, permutation and combination, principle of inclusion, exclusion (with proof) and pigeonhole principle (with proof), Relation, operation and representation of a relation, equivalence relation, POSET, Hasse Diagrams, extremal Elements, Lattices, composition of function, inverse, binary and n-ary operations.



Yüklə 1,11 Mb.

Dostları ilə paylaş:
1   2   3   4   5   6   7   8   9   ...   12




Verilənlər bazası müəlliflik hüququ ilə müdafiə olunur ©genderi.org 2024
rəhbərliyinə müraciət

    Ana səhifə