proposed teaching scheme for b.tech semester ......2 hs501 ap titude skill building-i 0 0 0 1 - 1 0...

101
PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER - I [ IT, CE,EC,BM&I,MARINE] Effective from Academic year 2014-15 Sem Subject Code Name of Subject Teaching Scheme Credit Examination Scheme Hrs. L T P Total L T P Total Theory Practical /TW Ass. Grand Total Int. Asses Sem End Hrs Total I 2HS101 Calculus 3 1 0 4 3 1 0 4 40 60 3 100 0 100 2EC101 Physics 2 0 2 4 2 0 1 3 40 60 3 100 50 150 2CI101 Elements of Civil Engineering 3 0 2 5 3 0 1 4 40 60 3 100 50 150 2ME102 Engineering Graphics 3 0 2 5 3 0 1 4 40 60 3 100 50 150 2CE101 Computer Programming 2 0 4 6 2 0 2 4 40 60 3 100 50 150 2ME103 Workshop Practice (Mechanical & Electrical) 0 0 4 4 0 0 2 2 - - - - 50 50 2HS104 Creative & Critical Thinking 2 0 0 2 0 0 0 0 0 0 0 0 0 0 TOTAL 15 1 14 30 13 1 7 21 PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER - II [ IT, CE,EC,BM&I,MARINE] Effective from Academic year 2014-15 Sem Subject Code Name of Subject Teaching Scheme Credit Examination Scheme Hrs. L T P Total L T P Total Theory Practical /TW Ass. Grand Total Int. Asses Sem End Hrs Total II 2HS102 Linear Algebra 3 1 0 4 3 1 0 4 40 60 3 100 0 100 2HS103 Communication Skills 2 0 2 4 2 0 1 3 40 60 3 100 50 150 2EE101 Elements of Electrical Engineering 3 0 2 5 3 0 1 4 40 60 3 100 50 150 2ME101 Elements of Mechanical Engineering 3 0 2 5 3 0 1 4 40 60 3 100 50 150 2CI102 Engineering Mechanics 3 0 2 5 3 0 1 4 40 60 3 100 50 150 2CI103/ 2BM101* Environmental Studies & Disaster Management/ Basic Biology* 3 0 0 3 3 0 0 3 40 60 3 100 0 100 2HS105 Ethics and Values 2 0 0 2 0 0 0 0 0 0 0 0 0 0 TOTAL 19 1 8 28 17 1 4 22 *Subject is offered in BM&I Branch only

Upload: others

Post on 23-Jan-2021

2 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER - I [ IT, CE,EC,BM&I,MARINE] Effective from Academic year 2014-15

Sem Subject Code Name of Subject

Teaching Scheme Credit Examination Scheme

Hrs.

L T P Total L T P Total Theory

Practical /TW Ass.

Grand Total Int.

Asses Sem End Hrs Total

I

2HS101 Calculus 3 1 0 4 3 1 0 4 40 60 3 100 0 100 2EC101 Physics 2 0 2 4 2 0 1 3 40 60 3 100 50 150 2CI101 Elements of Civil Engineering 3 0 2 5 3 0 1 4 40 60 3 100 50 150 2ME102 Engineering Graphics 3 0 2 5 3 0 1 4 40 60 3 100 50 150 2CE101 Computer Programming 2 0 4 6 2 0 2 4 40 60 3 100 50 150

2ME103 Workshop Practice (Mechanical & Electrical) 0 0 4 4 0 0 2 2 - - - - 50 50

2HS104 Creative & Critical Thinking 2 0 0 2 0 0 0 0 0 0 0 0 0 0

TOTAL 15 1 14 30 13 1 7 21

PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER - II [ IT, CE,EC,BM&I,MARINE] Effective from Academic year 2014-15

Sem Subject Code Name of Subject

Teaching Scheme Credit Examination Scheme

Hrs.

L T P Total L T P Total Theory Practical

/TW Ass. Grand Total

Int. Asses

Sem End Hrs Total

II

2HS102 Linear Algebra 3 1 0 4 3 1 0 4 40 60 3 100 0 100 2HS103 Communication Skills 2 0 2 4 2 0 1 3 40 60 3 100 50 150 2EE101 Elements of Electrical Engineering 3 0 2 5 3 0 1 4 40 60 3 100 50 150 2ME101 Elements of Mechanical Engineering 3 0 2 5 3 0 1 4 40 60 3 100 50 150 2CI102 Engineering Mechanics 3 0 2 5 3 0 1 4 40 60 3 100 50 150

2CI103/ 2BM101*

Environmental Studies & Disaster Management/ Basic Biology*

3 0 0 3 3 0 0 3 40 60 3 100 0 100

2HS105 Ethics and Values 2 0 0 2 0 0 0 0 0 0 0 0 0 0

TOTAL 19 1 8 28 17 1 4 22 *Subject is offered in BM&I Branch only

Page 2: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

TEACHING SCHEME FOR B.TECH SEMESTER I (ME, MC, Civil,EE), Effective from Academic year 2014-15

Sem Subject Code Name of Subject

Teaching Scheme Credit Examination Scheme

Hrs.

L T P Total L T P Total Theory Practical

/TW Ass.

Grand Total Int.

Asses Sem End Hrs Total

I

2HS101 Calculus 3 1 0 4 3 1 0 4 40 60 3 100 0 100

2HS103 Communication Skills 2 0 2 4 2 0 1 3 40 60 3 100 50 150 2EE101 Elements of Electrical Engineering 3 0 2 5 3 0 1 4 40 60 3 100 50 150 2ME101 Elements of Mechanical Engineering 3 0 2 5 3 0 1 4 40 60 3 100 50 150 2CI102 Engineering Mechanics 3 0 2 5 3 0 1 4 40 60 3 100 50 150

2CI103 Environmental Studies & Disaster Management 3 0 0 3 3 0 0 3 40 60 3 100 0 100

2HS104 Creative & Critical Thinking 2 0 0 2 0 0 0 0 0 0 0 0 0 0

TOTAL 19 1 8 28 17 1 4 22

TEACHING SCHEME FOR B.TECH SEMESTER II (ME, MC, Civil,EE), Effective from Academic year 2014-15

Sem Subject Code Name of Subject

Teaching Scheme Credit Examination Scheme

Hrs.

L T P Total L T P Total Theory Practical

/TW Ass.

Grand Total Int.

Asses Sem End Hrs Total

II

2HS102 Linear Algebra 3 1 0 4 3 1 0 3 40 60 3 100 0 100 2EC101 Physics 2 0 2 4 2 0 1 3 40 60 3 100 50 150 2CI101 Elements of Civil Engineering 3 0 2 5 3 0 1 4 40 60 3 100 50 150 2ME102 Engineering Graphics 3 0 2 5 3 0 1 4 40 60 3 100 50 150

2CE101 Computer Programming 2 0 4 5 2 0 2 3 40 60 3 100 50 150

2ME103 Workshop Practice (Mechanical & Electrical) 0 0 4 4 0 0 2 2 - - - - 50 50

2CI105 Ethics and Values 2 0 0 2 0 0 0 0 0 0 0 0 0 0

TOTAL 15 1 14 30 13 1 6 20

Page 3: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER - III B.Tech Semester III [Computer Engineering] Effective from Academic year 2015-16

Sem Subject

Code Name of Subject

Teaching Scheme Credit Examination Scheme

Hrs.

L T P Total L T P Total

Theory Practical

/TW Ass.

Grand

Total Int.

Asses

Sem

End Hrs Total

III

2HS301 Discrete Mathematics & Probability 4 0 0 4 4 0 0 4 40 60 3 100 - 100

2CE302 Digital Electronics 3 0 2 5 3 0 1 4 40 60 3 100 50 150

2CE303 Internet Programming 3 0 4 7 3 0 2 5 40 60 3 100 50 150

2CE304 Object Oriented Programming 3 0 4 7 3 0 2 5 40 60 3 100 50 150

2CE305 Database Management System-I 3 0 2 5 3 0 1 4 40 60 3 100 50 150

Audit Course 2 0 0 2 0 0 0 0 0 0 0 0 00 0

TOTAL 18 0 10 28 16 0 5 22 200 300 15 500 200 700

PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER - IV [Computer Engineering] Effective from Academic year 2015-16

Sem Subject

Code Name of Subject

Teaching Scheme Credit Examination Scheme

Hrs.

L T P Total L T P Tot

al

Theory Practical

/TW Ass.

Grand

Total

Int.

Asses

Sem

End Hrs Total

IV

2HS401

Mathematics for Computer

Engineering & Information

Technology

4 0 0 4 4 0 0 4 40 60 3 100 - 100

2CE402 Operating System 3 0 2 5 3 0 1 4 40 60 3 100 50 150

2CE403 Database Management System-II 3 0 2 5 3 0 1 4 40 60 3 100 50 150

2CE404 Data Structures 4 0 4 8 4 0 2 6 40 60 3 100 50 150

2CE405 Application Development

Tools 2 0 4 6 2 0 2 4 40 60 3 100 50 150

Audit Course 2 0 0 2 0 0 0 0 0 0 0 0 00 0

TOTAL 18 0 12 30 16 0 6 22 200 300 15 500 200 700

Page 4: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY

TEACHING AND EXAMINATION SCHEME Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester V

Effective from Academic Year 2016-17 Effective for the batch Admitted in July 2014

Subject Code

Subject Name

Teaching scheme Examination scheme (Marks)

Credit Hours (per week) Theory Practical

Lecture(DT) Practical(Lab.) Lecture(DT) Practical(Lab.) CE SEE Total CE SEE Total L TU Total P TW Total L TU Total P TW Total

2CE501

Object Oriented Analysis and Design

3 0 3 1 - 1 3 0 3 2 - 2 40 60 100 30 20 50

2CE502 Design and Analysis of Algorithms

3 0 3 1 - 1 3 0 3 2 - 2 40 60 100 30 20 50

2CE503 Computer Architecture

3 0 3 1 - 1 3 0 3 2 - 2 40 60 100 30 20 50

2CE504 Computer Networks

4 0 4 1 - 1 4 0 4 2 - 2 40 60 100 30 20 50

2CE505 Seminar 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50

2CE5E* Elective I 3 0 3 1 - 1 3 0 3 2 - 2 40 60 100 30 20 50

2HS501 Aptitude Skill Building-I

0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50

Total 16 0 16 7 - 7 16 0 16 14 - 14 200 300 500 210 140 350

NOTE: * indicates any number from the following set of subjects in given order

Elective I

2CE506 : Advance Java

2CE507 : Web Technology

Page 5: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY

TEACHING AND EXAMINATION SCHEME Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VI

Effective from Academic Year 2016-17

Effective for the batch Admitted in July 2014

Subject Code

Subject Name

Teaching scheme Examination scheme (Marks)

Credit Hours (per week) Theory Practical

Lecture(DT) Practical(Lab.) Lecture(DT) Practical(Lab.) CE SEE Total CE SEE Total

L TU Total P TW Total L TU Total P TW Total

2CE601 Theory of Computation

3 0 3 1 - 1 3 0 3 2 - 2 40 60 100 30 20 50

2CE602 Software Engineering

3 0 3 1 - 1 3 0 3 2 - 2 40 60 100 30 20 50

2CE603 Information System Security

3 0 3 1 - 1 3 0 3 2 - 2 40 60 100 30 20 50

2CE604 Application Development Lab

0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50

2CE6E* Elective II 3 0 3 1 - 1 3 0 3 2 - 2 40 60 100 30 20 50

2CE6E* Elective III 3 0 3 1 - 1 3 0 3 2 - 2 40 60 100 30 20 50

2HS601 Aptitude Skill Building–II

0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50

Total 15 0 15 7 - 7 15 0 15 14 - 14 200 300 500 210 140 350

NOTE: * indicates any number from the following set of subjects in given order

Elective II Elective III

2CE605 : Mobile Application Development 2CE607 : Network Programming

2CE606 : Microprocessor and Interfacing 2CE608 : Computer Graphics

2CE609 : Cloud Computing

Page 6: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY

TEACHING AND EXAMINATION SCHEME Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VII

Effective from Academic Year 2017-18 Effective for the batch Admitted in July 2014

Subject Code

Subject Name

Teaching scheme Examination scheme (Marks)

Credit Hours (per week) Theory Practical

Lecture(DT) Practical(Lab.) Lecture(DT) Practical(Lab.) CE SEE Total CE SEE Total

L TU Total P TW Total L TU Total P TW Total

2CE701 Compiler Design 3 - 3 1 - 1 3 - 3 2 - 2 40 60 100 30 20 50

2CE702 Artificial Intelligence 3 - 3 1 - 1 3 - 3 2 - 2 40 60 100 30 20 50

2CE703 Minor Project - - - 4 - 4 - - - 8 - 8 - - - 60 40 100

Elective-IV 3 - 3 1 - 1 3 - 3 2 - 2 40 60 100 30 20 50

Elective-V 3 - 3 1 - 1 3 - 3 2 - 2 40 60 100 30 20 50

2CE712 Soft Skills - - - 2 - 2 - - - 4 4 0 0 0 60 40 100

Total 12 - 12 10 - 10 12 - 12 20 - 20

Elective-IV Elective-V

2CE704 Fundamentals of Image Processing 2CE708 Parallel Processing & Architecture

2CE705 Internet of Things 2CE709 Big data Analytics

2CE706 Mobile Computing 2CE710 Public Key Infrastructure

2CE707 Machine Learning 2CE711 Data Mining and Data Warehousing

Page 7: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY

TEACHING AND EXAMINATION SCHEME Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VIII

Effective from Academic Year 2017-18 Effective for the batch Admitted in July 2014

Subject Code

Subject Name

Teaching scheme Examination scheme (Marks)

Credit Hours (per week) Theory Practical

Lecture(DT) Practical(Lab.) Lecture(DT) Practical(Lab.) CE SEE

Total

CE SEE Total L TU Total P TW Total L TU Total P T

W Total

2CE801 Major Project - - - 16 - 16 - - - 32 - 32 - - - 200 200 400

Total - - - 16 - 16 - - - 32 - 32 - - - 200 200 400

Page 8: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

1

2HS101 : Calculus [ 3 1 0 4 ]

Learning Outcomes:

Upon completion of this course, students will be able to :

• Understand all basic fundamentals of Differentiation and Integration. • Prepare him/herself for finding Area and Volume. • Apply mathematical formulas in various subjects of his/her branch.

Syllabus:

Unit No Topics

1 Differential Calculus : Review of the prerequisites such as limits of sequences and functions, continuity, uniform continuity and differentiability. Successive differentiation, Leibniz’s theorem(without proof), Taylor's & Maclaurin's expansions of single variable, Indeterminate forms.

2 Partial differentiation and its applications : Partial and total differential coefficient, Euler’s theorem, Transformations, Geometrical interpretation of partial derivatives, Tangent plane and Normal line, Jacobians, Taylor’s expansion for two variables, Errors and approximations, Maxima and Minima of functions of two variables ,Lagrange method of undetermined multipliers to determine stationary values.

3 Integral Calculus : Reduction Formulae: Reduction formulae of the type sinn x dx∫ ,

cosn x dx∫ , sin cosm nx x dx∫ , tann x dx∫ and cotn x dx∫ . Beta & Gamma function, Error function, Elliptic integrals. Application of integration- Length of a curve, Area of a bounded region, volume & surface area of a solid of revolution for Cartesian, parametric & polar form.

4 Multiple integrals : Double integral, change of order of integration, transformation of variables by Jacobian only for double integration, change into polar co-ordinates in double integrals only ,Triple integral, Application of multiple integration to find areas, volumes, C.G., M.I. and mean values.

Text Books:

1. Higher Engineering Mathematics by Dr. B. S. Grewal

Reference Books:

1. Higher Engineering Mathematics Vol. I & II by Dr. K. R. Kachot. 2. Calculus and analytical geometry by G. B. Thomas and R. L. Finney

Page 9: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

2EC101 Physics [2 2 2 1]

Learning Outcomes:

After completion of the course, students will • Able to understand, necessary parameters of different materials in different domains. • Demonstrate the behavior of material in different fields based on their Properties. • Enrich their experimental knowledge. • Enhance practical capability and skills for modules using different materials and selectionof

material for system designs. Syllabus:

Units No. Topics

1 Thermal Physics

Introduction, thermometry, Resistance thermometer, thermoelectric thermometer, conduction, convection, radiation, thermal conductivity of material

2 Optics

Introduction, different theories based on the properties of light, reflection, refraction, classification of fibers, absorption, dispersion, Lasers and LED its operation and applications.

3 Acoustics

Introduction, Parameter associated with sound wave, Doppler effect, ultrasonic and its applications.

4 Magnetics

Magnetic moment, Magnetic dipole, Magnetic Filed strength, Magnetic fluxdensity, Intensity of magnetization, Magnetic dipole moment, Magnetic field Intensity, Magnetic permeability, magnetic susceptibility, Bohr magnetron, classification of magnetic materials, hysteresis,Skin effect, application of magnetic materials,.

5 Semiconductor Physics

Conductors, Insulator, semiconductors, silicon crystals, intrinsic semiconductor, doping, type of semiconductor, biasing, breakdown, energy level and hill, barrier potential.

6 Modern Physics

Introduction, nucleus, application of plasma physics, superconductive materials, Nano-materials, Bio-materials, X-rays.

Text Books

1. “Engineering Physics” by V Rajendran, Tata McGraw Hill Education 2. “Modern Engineering Physics” by Vasudeva, Pub: S. Chand. 3. “Electronic Principles” by A.P. Malvino, Pub: TMG

Reference Books

1. “Engineering Physics” John Wiley Publication 2. “Engineering Physics” by Naidu, Pearson Education India 3. “A Text Book of Engineering Physics” by M. N. Avadhunuly, P.G. Kshirsagar, Pub. S. Chand

Page 10: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

2CI101: Elements of Civil Engineering [3 2 3 1]

Learning Outcomes: Upon completion of this course, students will acquire knowledge aboutthe basic areas of civil engineering like water resources engineering, transportation engineering, surveying & levelling, materials used in construction and engineering aspects related to the construction of structures.

Syllabus:

Unit No.

Topics

1 Introduction :

Branches & Scope of civil engineering, Various engineering structures, Role of Civil Engineers, Importance of Planning, Scheduling and Construction management.

2 Construction Materials:

Introduction, Stones, Bricks, Lime, Cement, Sand, Aggregates, Mortar, Concrete & Timber.

3 Surveying & Levelling

Introduction: Purpose, use and principles of surveying, Introduction of Plan, Scale & map, Plane & Geodetic surveying, Classification of survey.

Linear Measurements: Instruments used in chaining, Ranging out of Survey lines, Chaining on sloping grounds, Obstacle in chaining.

Angular Measurements: Introduction, Prismatic & Surveyors Compass, Types of Bearings and Meridians, Whole Circle Bearing and Reduced Bearings, Fore bearing & Back bearing, Calculation of Angles from bearings and bearings from angle, Included Angles, Magnetic Dip and Declination, Local Attraction, Closing error.

Elevation Measurements: Introduction Dumpy Level, Levelling staff, Methods of leveling, Recording and Reducing of levels & numerical based on them, Contour Survey.

Modern Tools of Surveying: Introduction to Theodolite, Electronic Distance Measurement Instruments, Total Station, Global Positioning System, Remote Sensing and Geographic Information System

4 Building, Planning & Construction: Principles of planning, Requirements of building, Plan, Elevation & Section, Building Components (Superstructure & Substructure).

5 Water Resources and Hydraulics:

Hydrological Cycle, Importance of Hydrology, Classification of Water resources & Requirement of water for various uses, Water shed management.

6 Transportation Engineering:

Role of Transportation in National development, Transportation Ways, Transportation Systems, Traffic control devices, Types of roads, Components of road pavement.

Laboratory Work: This shall consist of field and laboratory work based on above content.

Term Work: Term work shall consist of Drawing Sheets, Field Book, and assignment consisting theories and Numerical based on above content

Page 11: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

Text Books

1 Surveying – I By B. C. Punmia: LaxmiPub.House

2 Elements of Civil Engineering Author: Dr. R.K. Jain and Dr. P.P. Lodha Publisher: McGraw Hill Education, India Pvt. Ltd.

Reference Books

1 Building Construction – By B. C. Punmia: LaxmiPub.House

2 Materials of Construction By D. N. Ghose Publisher: McGraw Hill Education, India Pvt. Ltd.

3 Highway Engineering - Khanna S.K and Justo C.E.G.,Khanna Publishers , Delhi

4 Hydrology and Water Resources Engineering- By Santosh Kumar Garg, Publisher, Khanna Publishers

5 Fundamentals of Surveying – By S.K.Roy, PHI Publication

Page 12: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

2ME102: Engineering Graphics [3231]

Learning Outcomes:

After learning the course the students should be able to

• To know and understand the conventions and the method of engineering drawing. • Interpret engineering drawings using fundamental technical mathematics. • Construct basic and intermediate geometry. • To improve their visualization skills so that they can apply these skill in developing new

products. • To improve their technical communication skill in the form of communicative drawings. • Comprehend the theory of projection.

Syllabus: Unit No.

Topics

1 Introduction: Importance of Engineering Drawing, Engineering Drawing,Instruments and uses, B.I.S

and I.S.O. Conventions for drawings, Use of plane scales and Representative Fraction PLANE GEOMETRY 2 Loci of Point: Path of the points moving on simple arrangements and simple Mechanism, Slider Crank

Mechanism, Four bar Chain Mechanism etc. 3 Engineering Curves: Classification of Engineering Curves, Construction of Conics curves, Cycloidal Curves,

Involutes and Spirals along with normal and tangent to each curve

SOLID GEOMETRY 4 Projection of Points and Straight Lines: Introduction to principal planes of projections, Notation System- Points in First, Second,

Third and Fourth quadrants, Projections of line Parallel to Two and Perpendicular to one of the principal planes, Line parallel to one and inclined to two principal planes, Line inclined to all the three principal planes, True length of the line and its inclination with the reference planes.

5 Projection of Planes: Concept of different planes, Projections of planes with its inclination to one principal

plane and with two principal planes. Concept of auxiliary plane method for projections of the plane.

6 Projection of Solids and Sections of Solids: Classifications of Solids, Projections of right and regular solids with their axis Parallel to

Two and Perpendicular to one of the principal planes, axis parallel to one and inclined to two principal planes, axis inclined to all the three principal planes. Section of solids and the true shape of the section.

7 Development of surfaces: Methods of development of lateral surface of right solids, Parallel line development,

Radial line development. 8 Interpenetration of Solid:

Page 13: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

line of interaction, line/generator method and section plane method, intersection of two prisms, two cylinder, interaction of cone and cylinder.

9 Orthographic Projections & Sectional Orthographic Projections: Principle of projection, Principal planes of projection, Projections from the pictorial

view of the object on the principal planes for View from Front View from Top View from Side using first angle projection method and third angle projection method, Full Sectional View.

10 Isometric Projections and Isometric View or Drawing: Isometric Scale, Conversion of orthographic views into isometric projection, isometric

view or drawing.

Text Books

1. A Text Book of Engineering Graphics ByP.J.ShahS.Chand& Company Ltd., New Delhi

Reference Books

1. Engineering Graphics – I and II By Arunoday Kumar Tech – Max Publication, Pune 2. Elementary Engineering Drawing By N.D.BhattCharotar Publishing House, Anand 3. A text book of Engineering Drawing By R.K.DhawanS.Chand& Company Ltd., New Delhi 4. A text book of Engineering Drawing By P.S.GillS.K.Kataria& sons, Delhi 5. Engineering Drawing and Graphics, Venugopal 6. Engineering Drawing with an Introduction to AutoCAD By D.A.Jolhe Tata McGraw-Hill

Publishing Co. Ltd., New Delhi 7. Engineering Drawing & Graphics using Auto CAD 2000 By T. Jeyapoovan

Vikas Publishing House Pvt. Ltd., New Delhi

Page 14: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

2CE101: Computer Programming [2 4 2 2]

Learning Outcomes:

Upon completion of this course, students will acquire knowledge about:

• Able to implement the algorithms and draw flowcharts for solving Mathematical and Engineering problems.

• Demonstrate an understanding of computer programming language concepts. • To be able to develop C programs on linux platform. • Ability to design and develop Computer programs, analyzes, and interprets the concept of

pointers, declarations, initialization, operations on pointers and their usage. • Able to define data types and use them in simple data processing applications also he/she

must be able to use the concept of array of structures. Student must be able to define union and enumeration user defined data types.

• Develop confidence for self education and ability for life-long learning needed for Computer language.

Syllabus: Unit No.

Topics

1 Introduction to Programming Basic computer organization, operating system, editor, compiler, interpreter, loader,

linker, program development. Variable naming, basic function naming, indentation, usage and significance of comments for readability and program maintainability. Types of errors, debugging, tracing/stepwise execution of program, watching variables values in memory.

Constants, Variables and data Types Character Set, C tokens, Keywords and Identifiers, Constants, Variables, Data types,

Declaration of Variables, Assigning values to variables, typedef, and Defining symbolic constants. printf & scanf function.

2 Operators and Expression Introduction, Arithmetic Operators, Relational Operators, Logical Operators, Assignment

Operators, Increment and Decrement Operators, Conditional Operators,Special Operators, Evaluation of expressions, Precedence of arithmetic operators,Type conversions in expressions, Operator precedence and associativity.

Management Input and Output Operators Introduction, reading a character, writing a character, formatted input, formatted output.

3 Decision Making branching Introduction, Decision making with IF statement, the IF.. ELSE statement, nesting of IF

… ELSE statements, The ELSE IF ladder, The switch statement, and the turnery (?:) Operator, the GOTO statement.

Looping

Page 15: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

Introduction, the WHILE statement, the DO statement, The FOR statement, Break and Continue.

4 Array Introduction, One-dimensional arrays, Two-dimensional arrays, arrays, Concept of

Multidimensional arrays.

Handling of Character strings Introduction, Declaring and initializing string variables, Reading string from terminal,

Writing string to screen, String, atoi(), Operations: String Copy, String Compare, String Concatenation And String Length(using predefined functions & without using them), Table of strings.

5 User-Defined Functions Introduction, Need for user-defined functions, The form of C function, elements of UDF,

Return values and their types, Calling a function, category of functions, Nesting of functions, Recursion , Functions with arrays, The scope and Lifetime of variables in functions, multifile program.

Structures and Unions Introduction, Structure definition, declaring and initializing Structure variables,

accessing Structure members, Copying & Comparison of structures, Arrays of structures, Arrays within structures, Structures within Structures, Structures and functions, Unions.

6 Pointers Introduction, Understanding pointers, Accessing the address of variable, Declaring and

initializing pointers, Accessing a variable through its pointer,Pointer expressions, Pointer increments and scale factor, Pointers and arrays, Pointers & character strings, Pointers & Functions, Function returning multiple values,Pointers and structures.

File Management in C and CONSOLE I/O Introduction, Defining files and its Operations, Error handling during I/O operations,

Random access files, Command line arguments. Types of files, File vs. Console, File structure, File attributes, Standard i/o, Formatted i/o, Sample programs.

 

Text Books

1. Programming in ANSI-C By E. Balagurusami, TMH Publication 2. Let us C By YashwantKanetkar, BPB Publication

Reference Books

1 C Programming language By Kernighan, Brian, W, Retchie, Dennis, PHI Publication 2 Programming in C, SchaumOutline, McGraw-Hill 3 Lab Manual for Basic Linux commands, to be provided by the department.

Page 16: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

2ME103: Workshop Practice (Mechanical & Electrical) [0 4 0 2]

Learning Outcomes:

Upon completion of this course, students will acquire knowledge about:

• To acquire skills in basic engineering practice. • To identify the hand tools and instruments. • To acquire measuring skills. • To acquire practical skills in the trades. • To provides the knowledge of job materials in various shops. • To provides the knowledge of core technical subjects for making and working of any type of

project. • Students will be able to analyze the material on the basis of their properties and thus assigning

different weight age to their use for technical purposes. • Understand modern manufacturing operations, including their capabilities, limitations, and how to

design economically. • Gain insight into how designers influence manufacturing schedule and cost, and cost of different

components. • Learn how to analyze products and be able to improve their manufacturability and make the cost

effectively. • The students will be able to assess the working conditions of any machining process and thus

calculating the actual forces involved. • Students are expected to learn the physical recognition of different electrical & Electronics

components like Resistances, Inductances, Capacitances, diodes, transistors and their ratings.

• Students are expected to connect electric circuits, and be able to use electric instruments to perform experiments

• Students are expected to be able to check ratings of commonly used house hold electrical appliances.

• Students are expected to be able to understand the different wiring schemes used around them like in their homes, shops, college, etc.

• Students are expected to recognize the importance of safety while dealing with electrical equipments.

• Students are expected to be able to identify and solve the small problems occurring in their house-hold devices like fan, iron, washing machine, electric kettle, mixer, etc.

• Students are expected to be able to calculate their energy bill and apply some energy conservation to reduce it.

Syllabus:

Unit No.

Topics(A)Mechanical

1 Instruction and Demonstration :

Instruction should be given for each of following shops which include importance of the shop in engineering, new materials available, use of each tool / equipment, methods of processing any special machines, power required etc.

2 Carpentry Shop:

Study of tools & operations and carpentry joints, Simple exercise using jack plane, Simple exercise on woodworking lathe.

Page 17: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

3 Fitting Shop:

Study of tools & operations, Simple exercises involving fitting work, Make perfect male-female joint, Simple exercises involving drilling/tapping/dieing.

4 Smithy Shop:

Study of tools & operations, Simple exercises base on smithy operations such as upsetting, drawing down, punching, bending, fullering & swaging.

5 Plumbing Shop:

Study of Tools and Operations, Simple exercises of piping.

6 Welding Shop:

Study of tools & operations of Gas welding & Arc welding, Simple butt and Lap welded joints, Oxy-acetylene flame cutting.

7 Sheet-metal Shop:

Study of tools & operations, making sheet metal component using ‘soldering’. Ex: Funnel, tool-box, tray, electric panel box etc.

8 Machine Shop:

Study of machine tools and operations, Demonstrations of basic machine tools like Lathe, Shaper, drilling machine with basic operations etc.

9 Foundry Shop:

Study of tools & operations like Pattern making, Mould making with the use of a core. Various Casting processes

Topics(B) Electrical

10 Identification of electrical and electronics components:

Resistors, Capacitors, Inductors, Diodes, Transistors.

11 Domestic and Industrial Electrical wiring:

Wiring of different lamp control, Staircase circuits, Cleat wiring and conduit wiring, Working of fluorescent tube light, Compact Fluorescent Light, Electronic Ballast, Connection of table fan and ceiling fan with regulators.

12 Operation of Protective & Safety devices:

Fuse, MCB, ELCB, Relay.

13 Troubleshooting of domestic devices:

Dismantling, Repairing, Assembling and testing of domestic appliance like electric iron, Room heater, Electric toaster, Water heater, Electric kettle, Electric oven, Ceiling fan, Table Fan, Regulators, Alarm bell.

14 Electrical Energy meter:

1-Φ & 3-Φ Energy meter, Measurement & Calculation of Electrical Energy, Calibration of Energy Meter

15 Motor:

Demo model of Motor Principle, Assembly & Disassembly of different motors, Basic Troubleshooting of different motors, Voltage, Current, Power & Speed measurement of various motors

16 Earthing:

Page 18: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

Measurement of Earth resistance, Earthing methods, Domestic Earthing.

17 Batteries & Cells

Types of Cells, Charging & Discharging Phenomena of Batteries, Applications of various batteries

Text Books

1. Work shop technology by Hajra Chaudhary 2. Elements of Mechanical Engineering by Hajra Chaudhary 3. Elements of Mechanical Engineering by Mathur & Mehta 4. Work shop technology by Chapmen 5. Electronics principle by A. Malvino 6. S. L. Uppal , “ Electrical wiring, estimating and costing “, Khanna Publication 7. K. B. Bhatia, “ Fundamentals of Maintenance of Electrical Equipments”, Khanna Publication 8. Dr N. K. Jain, “ A Text Book of Practicals in Electrical Engineering “, Dhanpat Rai Publishing

Company

Page 19: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

2HS104: Critical and Creative Thinking [2 0 0 0]

Learning Outcomes:

On successful completion of the course, the students will be:

• able to enhance their creative and innovative thinking skills • familiar with processes and methods of creative problem solving: observation, definition,

representation, ideation, evaluation and decision making • able to take better decisions • able to evaluate facts in an argument • learnthe Art of Questioning • able to be better thinkers

Syllabus:

Unit No.

Topics

1 Creativity, Innovation & Critical thinking Introduction to Creativity and Innovation, Differentiation between creative and critical

thinking, Thinking styles and common mistakes in thinking, Thinking about information and emotions, truth and knowledge, Evaluating arguments by asking the right questions about issues, conclusions, reasons, assumptions, evidence, etc.

2 Techniques for improving Creativity Brainstorming, Lateral Thinking, List of Mental Associations, Random Combinations,

Matrix of Ideas, Use of Manipulative verbs, Tree of Possibilities, Abstraction, Transformation, Use of mind stimulation: games, brain-twisters and puzzles

3 Creativity in problem solving: Problem Definition, Understanding, Representing, Pattern Breaking, Thinking differently,

Changing your point of view, Watching for paradigm shift, Challenging conventional wisdom, Lateral thinking, etc.

Reference Books: 1. Asking the right Questions by M.Neil Browne & Stuart M. Keeley, Pearson, Prentice Hall 2. Teach Yourself to Think by Edward de Bono, Penguin 3. Lateral Thinking by Edward de Bono, Penguin 4. Six Thinking Hats by Edward de Bono, Penguin 5. Selected videos showcasing cases and arguments  

Page 20: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

1

2HS102: Linear Algebra[ 3 1 0 4 ]

Learning Outcomes:

Upon completion of this course, students will be able to :

• Understand all basic fundamentals of Matrices and Vectors. • Prepare him/herself for Solving a Linear equation. • Prepare him/herself for Learning Advance Mathematics in coming semester. • Apply knowledge of matrices and vectors in various applications of his/her

branch.

Syllabus:

UnitNo Topics 1 Matrix Algebra:

Review of algebra of matrices & elementary transformations Rank of a matrix, inverse of a matrix by Gauss-Jordan method,normal form of a matrix, Solution of system of algebraic simultaneous equations, Linear dependent and Linear independent vectors. Eigen values and Eigen vectors, Eigen values and Eigen vectors of: Symmetric, Skewsymmetric, Hermitian, Skewhermitian,Unitary and Normal matrix, Algebraic and Geometric multiplicity, Diagonalization ,Spectral theorem for real symmetric matrices,Application of Quadratic forms.

2 Vector Space : Vectors in Rn and its properties ,Dot product ,Norm and Distance properties in Rn ,Pythagorean theorem in Rn ,Definition and Examples of vector spaces,Vector subspace , Linear Independence and dependence ,Linear span of set of vectors,Basis of subspaces,Extension to basis.

3 Linear Transformation : Definition and basic properties,Types of linear transformation (Rotation,reflection,expansion,contraction,shear,projection),Matrix of linear transformations,Change of basis and similarity,Rank nullity theorem

4 Infinite Series : Definition, Comparison test, Cauchy’s integral test, ratio test, root test, Leibniz’s rule for alternating series, power series, range of convergence, uniform convergence.

Text Books:

1. Higher Engineering Mathematics by Dr. B. S. Grewal 2. Vector Calculus and Linear Algebra by Dr. A.R.Patel&Dr.H.C.Patel

Reference Books:

1. Higher Engineering Mathematics Vol. I & II by Dr. K. R. Kachot. 2. Advanced Engineering Mathematics (Fifth Edition), Erwin Kreyszig. 3. Applied mathematics for engineering by Dr. R. C. Shah.

Page 21: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

2HS103: Communication Skills [2 2 2 1]

Learning Outcomes:

On successful completion of the course, the students will be able to:

• Understand the basic concepts of communication skills for engineers.

• Acquire satisfactory competency in use of four basic skills of English language (lsrw).

• Handle various professional communication situations more effectively and fruitfully.

• Use English in real life and in authentic context.

Syllabus:

Unit No. Topics

1 Basics of Communication: Definition, Principles, Process, Functions, and Forms of communication (Formal –

Informal, Verbal – Non-verbal, Electronic and Visual)

Barriers to communication with remedies

2 Introduction to Functional Grammar in English Verb Forms, collocations, homophones and homonyms, conjunctions, abbreviations

& acronyms and Introduction to English Sounds

3 Receptive Language Skills: Listening Skill:

Definition and process of listening skill, Pre-requisites of effective listening, Modes of listening, Causes of poor listening, Tips for effective listening, Traits of a good listening

Reading Skill:

Definition and types of reading, Techniques for effective reading comprehension, Purposes of Reading

4 Productive Language Skill – I (Oral Communication): Presentation Skills:

Definition of presentation, Components of presentation, Planning to prepare effective presentation, Steps for preparing effective presentation, Boredom Factors in presentation, Attention grabbers in presentation

Group Discussion: Definition and nature of group discussion, Pre-requisites for group discussion, Objectives of group discussion, Characteristics of group discussion, How to prepare for group discussion, Dos and don’ts in group discussion

Page 22: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

Job Interviews: Definition, purpose and types of interview, Types of job interview, Process of job interview, Tips and techniques of job interview, success and failure factors in job interview

5 Productive Language Skills – II (Written Communication) Significance of written communication for professionals, Fundamentals of good

writing, Guidelines for effective writing – Selection of words, Framing sentences and Composing paragraphs.

Precis Writing, Paragraph Composition, Advertisement drafts with special reference to Engineering & Technology

Letter writing: Structure and layout of a business letter, Types of business letters – inquiry, reply, complaint and adjustment letter, sales promotion, Job application with resume

Report writing: Purpose of a report, types of reports, Structure and style of reports, Committee report, Individual report

Reference Books:

1. Technical Communication – Principles and Practice by Meenaksi Raman & Sangeeta

Sharma (Oxford University Press)

2. Effective Technical Communication by M Ashraf Rizvi (TMH Publication)

3. Business Communication by V. K. Jain and Omprakash Biyani (S. Chand & Company)

4. A Communicative Grammar of English by Geoffery Leech and Fan Svartvik (Pearson

Longman)

5. New International Business English by Jones & Alexander (Oxford University Press)

6. Professional English in Use: Engineering with Answers: Technical English for Professionals

by Mark Ibbotson, Cambridge Uni. Press

7. Oxford English for Electrical and Mechanical Engineering by Eric H. Glendinning and

Norman Glendinning

8. Oxford English for Careers: Technology 1: Student's Book by Eric Glendinning

9. Oxford English for Information Technology: Audio CD by Eric Glendinning and John

McEwan

10. English for Specific Purposes (Resource Books for Teachers) by Keith Harding

Page 23: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

2EE101: Elements of Electrical Engineering [3 2 3 1]

Learning Outcomes:

Upon completion of this course, students will acquire knowledge about:

• Learn to predict the behavior of any electrical and magnetic circuits. • Distinguish between DC, AC, single phase and three-phase AC supply systems, highlighting the

advantages and disadvantages of the different systems. • Apply basic electric laws in solving circuit problems and able to perform power calculation. • Identify the types of capacitors and know the practical applications of various types of capacitors. • Understand the basic concepts of Electromagnetic Induction and Electrical Generation principle. • Understand the Economic Aspects of Electrical Engineering and apply this knowledge to work

with better power factor leading to Energy Conservation. • Develop the concept of Work, Power & Energy with Electrical Engineering perspective. • Know the concept of Illumination from engineering point of view. 

Syllabus:

Unit No.

Topics

1 D.C. Circuits :

Source Transformation, Star-Delta Transformation, Application of Kirchhoff’s Law, Superposition Theorem, Thevenin’s Theorem, Norton’s & Maximum Power Transfer Theorem.

2 Capacitor :

Types of Capacitor, Capacitance of Multiple Parallel Plate Capacitor, Energy stored in a Capacitor, Charging & Discharging of Capacitor & Time constant.

3 Magnetic circuit :

Law of Magnetic Circuit, Series & parallel Magnetic Circuits and Calculation, Comparison of magnetic & Electric Circuit, Magnetization Curves.

4 Electromagnetic Induction :

Review of Faraday’s Law, Lenz’s Law, Self & Mutual Inductance, Inductance of coupled circuits, Rise and Decay of Current in Inductive circuit & Time Constant, Magnetic Hysterisis, Hysterisis Loss, Eddy Current Loss.

5 A.C.Circuits :

Generation of A.C. Voltage , Equation of A.C. Voltage, Average value, R.M.S. Value, Form Factor, Peak Factor, Phase & Phase Difference, Vector Representation of A.C. Voltage and Current. Addition and Subtraction of Vectors, Mathematical Representation of Vectors, Complex Algebra, Polar & Exponential form, Pure Resistive, Pure Inductive, Pure Capacitive and combination of R-L-C Circuits, Active -Reactive and Apparent power & Power Factor, Resonance in R-L-C Series Circuit, Q-factor, Solution of Parallel circuit by Admittance, Phasor & Complex Algebra methods, Resonance in Parallel circuit.

Page 24: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

6 3-Phase Circuits :

Generation of 3-phase voltage, Phase Sequence , Interconnection of three phase, Star – Delta, Voltage ,Current & Power relationship in balanced 3-Phase Circuits, Measurement of power in 3-phase circuit and Effect of power factor on Wattmeter readings.

7 Economic Aspects :

Tariff & its types, Causes and effects of low power factor, Methods of improving power factor.

8 Work, Power, Energy :

Heating Effect of Electric Current and Joule’s law , Thermal Efficiency, Electrical Units of Power and Energy , Calculation of Power & Energy .

9 Illumination :

Definition and important terms, Laws of illumination, Requirement of good lighting, Types of lighting scheme, Street lighting, Factory and Flood lightning.

Text Books 1. U.A.Patel , “Elements of Electrical & Electronics Engineering “ ,Atul Prakashan. 2. B.L.Thereja,”Electrical Technology “, S.ChandVolume-I.

Reference Books

1. V.N.Mittal,”Basic Electrical Engineering”, Tata Mc Grawhill, New Delhi. 2. V.K.Mehta,”Principles of Power Systems “, Pub. By S.Chand. .

Page 25: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

2ME101: Elements of Mechanical Engineering [3 2 3 1]

Learning Outcomes:

After learning this course one will be able to:

• Understand about the working, functions and applications of equipments used in daily life. • Identify the broad context of Mechanical engineering problems, including describing the

problem conditions and identifying possible contributing factors • Understand the fundamental elements of Mechanical engineering systems, system

components and processes, with a good understanding of associated safety, quality, schedule and cost considerations.

• Employ mathematics, science, and computing techniques in a systematic, comprehensive, and Rigorous manner to support the study and solution of Mechanical engineering problems.

• Synthesize analysis results to provide constructive and creative engineering solutions that reflect social and environmental sensitivities.

• Exhibit good teamwork skills and serve as effective members of multidisciplinary project teams.

Syllabus: Unit No.

Topics

1 Introduction: I Prime movers, Sources of energy, Types of prime movers, Force and mass, Pressure,

Work, Power, Energy, Heat, Temperature, Units of heat, Specific heat capacity, Interchange of heat, Change of state, Mechanical equivalent of heat, Internal energy, Enthalpy, Entropy, Efficiency, Statements of Laws of Thermodynamics, Calorific values

Properties of gases: Gas laws, Boyle's law, Charle's law, Combined gas law, Gas constant, Internal energy,

Relation between Cp and Cv, Enthalpy, Non flow process, Constant volume process, Constant pressure process, Isothermal process, Poly-tropic process, Adiabatic process.

2 Properties of Steam: Introduction, Steam formation, Types of Steam, Enthalpy, Specific volume of steam and

dryness fraction of steam, Internal energy, Steam tables, Non-flow process. Measurement of dryness fraction, Throttling calorimeter, Separating calorimeter, Combined calorimeter.

3 Steam Boilers: Introduction, Classification, Simple vertical boiler, Cochran boiler, Lancashire boiler,

Locomotive boiler, Babcock and Wilcox boiler, Hi-Pressure boiler, functioning of different mountings and accessories.

Internal Combustion Engines: Introduction, Classification, Engine details, otto four-stroke cycle, Diesel-four-stroke

cycle, Difference between otto cycle and Diesel cycle, Two-stroke cycle, Difference between two-stroke and four-stroke cycle, indicated power (ip), Brake Power (bp),Efficiencies. Governors, I.C. Engine governing, Fly wheel.

4 Air Compressors:

Page 26: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

Introduction, Uses of Compressed air, Reciprocating compressors, Operation of a compressor, multistage reciprocating compressors, Rotary compressors

Pumps: Introduction, Reciprocating pump, types and operation, Bucket pump, Air Chamber,

Centrifugal pumps, Types and Priming, Rotary pumps.

5 Refrigeration & Air Conditioning: Introduction, Refrigerant, Types of refrigerators, Vapour compression refrigerating

system, Vapour absorption refrigerating system, Window and split air conditioners.

Couplings, Clutches and Brakes: Introduction, Couplings, Clutches, Brakes, Types of brakes. Difference between a brake

and a clutch

6 Important Engineering Materials: Properties of materials, Ferrous & Nonferrous materials and other important engineering

materials such as Timber, Abrasive material, silica

Text Books

1. Elements of Mechanical Engineering, S.M. Bhatt, H.G. Katariya, Books India publication 2. Thermal Science and Engineering by Dr. D.S. Kumar, S.K. Kataria& sons, Publication New

Delhi 3. Elements of Mechanical Engineering, Desai &Soni , AtulPrakashan

Reference Books

1. Basic Mechanical Engineering by Pravin Kumar, Pearson 2. Fundamental of Mechanical Engineering by G.S. Sawhney, PHI Publication New Delhi 3. Elements of Mechanical Engineering by Sadhu Singh S. Chand Publication 4. Introduction to Engineering Materials by B.K. Agrawal Tata McgraHill Publication, New Delhi

Page 27: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

2CI102: Engineering Mechanics [3 2 3 1]

Learning Outcomes:

Upon completion of this course, students will acquire knowledge aboutFundamentals of engineering principles, concept of centre of gravity and moment of inertia, importance of frictional force in real world problems, advantages of using machines, and effect of forces for different phenomenon when the bodies are in motion.

Syllabus:

Unit No.

Topics

1 INTRODUCTION:

Definition of Statics, Kinetics and Kinematics, Scalar, Vector quantities, Fundamental principle of engineering mechanics, System of units.

2 FUNDAMENTAL OF STATICS:

Force and Effect of forces, Types of force and force systems, Moment, Couple and its characteristics, Law of parallelogram of forces , Law of polygon of forces , Varignon;s principle Types of Supports and Loads, Support reactions and problems related to theories.

3 CENTRE OF GRAVITY:

Definition of Centroid centre of gravity, Moment area method for finding out centre of gravity for 1D, 2D and 3D problems, Composite sections, PappusGuldinus theorems I &II.

4 MOMENTOFINERTIA:

Concept of MI, Methods for finding out MI, Theorem of Parallel Axis and Perpendicular axis and related problems.

5 EQUILLIBRIUM:

Concept of Free body diagram, Lami’s theorem and its applications.

6 FRICTION:

Terminology, Friction on inclined smooth and rough surfaces, Ladder friction.

7 SIMPLE LIFTING MACHINES:

Terminology, Conditions of reversibility of machines, Law of machine, method for finding out velocity ratio of simple wheel and axle, Differential wheel and axle, Single purchase crab winch, Double purchase crab winch, Simple screw jack and differential screw jack, related problems.

8 KINEMATICS:

Terminology, Combined motion of rotation and translations, Case of Crank and Shaft, Instantaneous centre and its location, Single degree free vibrations

9 KINETICS:

Newton’s law of motions, De-Alembert’s Principle, Motion of connected bodies on plane and inclined surfaces, Related problems.

Laboratory Work: This shall consist of field and laboratory work based on above content.

Term Work: Term work shall consist of 8 to 10 experiments and assignments consisting theoriesand numerical based on above syllabus

Page 28: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

Text Books

1 Engineering Mechanics :S. Ramamarutham, Dhanpatray Publishing House

2 Mechanics of Solids :P. J. Shah, S.Chand Publication

Reference Books

1 Engineering Mechanics(Statics) Beer and Johnston,Tata-McGraw-Hill publications

2 Applied Mechanics: Junarkar S. B and H.J.Shah,Charotar Publishing House,Pvt Ltd.

3 Engineering Mechanics : A K Thayal, Umesh Publications  

Page 29: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

2CI103: Environmental Studies & Disaster Management [3 0 3 0]

Learning Outcomes:

Upon completion of this course, students will acquire knowledge about

• Understand the natural environment and its relationships with human activities. • Characterize and analyze human impacts on the environment. • Integrate facts, concepts, and methods from multiple disciplines and apply to environmental problems. • Capacity to integrate knowledge and to analyse, evaluate and manage the different public health aspects

of disaster events at a local and global levels. • Capacity to obtain, analyse, and communicate information on risks, relief needs and lessons learned from

earlier disasters in order to formulate strategies for mitigation in future scenarios.

Syllabus:

Unit No.

Topics

1 Introduction to Environment:

Definition, Components of Environment, Relationship between different components, Man- Environment relationship, Impact of Technology on the environment, Environmental Degradation, Sustainable Development, Environmental Education.

2 Ecology & Ecosystems:

Introduction: Ecology- Objectives and Classification, Concepts of an ecosystem- structure & function of ecosystem, Components of ecosystem- Producers, Consumers, Decomposers,

Energy flow in the ecosystem - Ecological succession. - Food chains, food webs and ecological pyramids. - Introduction, types, characteristic features, structure and function of the following ecosystem:

a. Forest ecosystem

b. Grassland ecosystem

c. Desert ecosystem

d. Aquatic ecosystems (ponds, streams, lakes, rivers, oceans, estuaries)

Bio-Geo- Chemical Cycles- Hydrological Cycle, Carbon cycle, Oxygen Cycle, Nitrogen Cycle, Sulfur Cycle.

3 Environmental Pollution:

Air Pollution: Composition of air, Structure of atmosphere, Ambient Air Quality Standards, Classification of air pollutants, Sources of common air pollutants like SPM, SO2, NOX – Natural & Anthropogenic Sources, Effects of common air pollutants, Air Pollution Episodes

Noise Pollution: Introduction, Sound and Noise measurements, Sources of Noise Pollution, Ambient noise levels, Effects of noise pollution, Noise pollution control measures.

Water Pollution: Introduction – Water Quality Standards, Sources of Water Pollution, Classification of water pollutants, Effects of water pollutants, Eutrophication, Water Pollution Episodes

Current Environmental Global Issues: Global Warming and Green Houses Effect, Acid Rain, Depletion of Ozone Layer.

4 Energy Resources:

Renewable &Nonrenewable Resources: Renewable Resources, Nonrenewable Resources,

Page 30: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

Destruction versus Conservation.

Energy Resources: Energy Resources - Indian Scenario , Conventional Energy Sources & its problems, non-conventional energy sources- Advantages and its Limitations

5 Types of Disaster

Introduction, Types of Natural Disasters, Accidental Disasters, Impact of Disasters on Trade and International Trade

6 Natural Disasters:

Introduction, Earthquakes, Hurricanes, Tornadoes, Floods, Drought, Tsunami, Volcanoes, Cyclones and Storms, Forest Fires, Severe Heat Waves, Landslides and Avalanches, Epidemics and Insect Infestations

7 Technological and Social Disasters:

Introduction, Types of Technological Hazards, Hazardous Materials, Social Disasters, Political and Crowd Disasters,War and Terrorism

8 Disaster Management:

Components of Disaster Management, Government’s Role in Disaster Management through Control of Information, Actors in Disaster Management, Organizing Relief measures at National and Local Level, Psychological Issues, Carrying Out Rehabilitation Work, Government Response in Disaster

Text Books

1 Basics of Environmental Studies by Dr. N. S. Varandani, Books India Publications

2 Disaster Management by MukeshDhunna, Vayu Education of India, Delhi Publication

Reference Books

1 Environmental Studies by R. Rajagopalan, Oxford University Press Publication

2 Environmental Science by Richard T Wright & Bernard J Nebel, Prentice Hall India Publication

3 Environmental Science by Daniel B Botkin& Edward A Keller, Wiley Publications

 

Page 31: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

2BM101: Basic Biology [3 0 3 0]

Learning Outcomes:

The educational objectives of the course are to educate students to attain the following:

Develop the understanding of the human biological system to the newly admitted biomedical students who do not have the background in biology.

Students will understand basics of molecular and cellular biology concepts. The course contents will enable the students for the investigative study of biological science required for Biomedical Engineers.

The contents will allow the students to fill the gap of knowledge to relate the Human Anatomy and Physiology with tissue level biology.

SYLLABUS

Unit

No.

Topics

Introduction to the overview and importance of the course.

1 Structure of Molecules

Atomic Structure, Chemical Bonding and Molecular Structure: Ionic Bonding: General characteristics of ionic bonding. Energy considerations in ionic bonding, lattice energy and solvation energy and their importance in the context of stability and solubility of ionic compounds Chemistry of Life Water and life, Properties of water, Ionization of water. Carbon and life, Organic chemistry-the study of carbon compounds; Properties of organic compounds

2 Homeostasis in Human body Ionic Equilibrium: Strong, moderate and weak electrolytes, degree of ionization, factors affecting degree of ionization, ionization constant and ionic product of water. Ionization of weak acids and bases, pH scale, common ion effect, pH for different salts. Buffer solutions. Acid – base balance. Edema and other ion imbalance diseases.

3 Biological Macromolecules Proteins: Amino acids – classification, peptides, protein structure, globular proteins (Hemoglobin) & fibrous protein (Keratin), structure of proteins, types of bonds contributing to protein structure, Enzymes. Carbohydrates: Structure, chemical & physical properties of monosaccharides, disaccharides (maltose, sucrose, lactose), polysaccharides (starch, glycogen & cellulose). Lipids: Classification of lipids (simple, derived & complex with one example each)

Page 32: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

Nucleic acids: Nomenclature of nucleotides& nucleosides, structure of nucleic acids, the structure of DNA itself to its function as hereditary molecule Vitamins, Hormones, Electrolyte: Important diseases related to macromolecules

4 The Cell Cell Membrane Cell Membrane: Membrane models Membrane junctions – Tight, gap, septate, desmosomes. Membrane Transport – Diffusion, osmosis, passive & active transport. Endocytosis & Exocytosis. Cytoplasm Ribosomes, Endoplasmic Reticulum– Structure, role in protein synthesis. Golgi apparatus: Structure, origin & relationship to endoplasmic reticulum. Role in synthesis, storage, & secretion of zymogens & glycoprotein. Lysosomes. Mitochondria: Structure of inner, outer membranes & the matrix. Cytoskeletal elements: Microfilaments: Structure & function in striated muscle fibers, Microtubules: Structure as in cilia/flagella, mechanism in movement. Function in mitotic spindle

Nucleus Nucleus: Structure of Inter phase nucleus – nuclear membrane, nucleolus, nucleosome model. Genetic material: DNA and RNA their structure function and type.RNA polymerase- various types; initiation, elongation and termination of RNA chains. Translation. Cell cycle & cell division, Cell cycle. Mitosis, meiosis & their significance.

5 The Tissue Tissues of the body – epithelial, muscular, connective and nervous: Their type, structure and function.

6 Body Fluids Intracellular and Extracellular body fluids, Fluid balance, Introduction to blood.

Reference Books:

1. David Nelsaon, Michael Cox, Lehninger Principles of Biochemistry, W. H. Freeman Publishers (4th Edition).

2. Cooper, G.M., Hausman, R.E. The Cell: A molecular approach. ASM Press and Sinauer Associates (sixth Edition).

3. De Robertis, E.D.P. Cell and Molecular Biology. Lippincott Williams and Williams(eighth Edition).

4. Anatomy and physiology in Health and Illness by Ross and Wilson, Pub: Churchill Livingstone (Elsevier).

5. Human anatomy and Physiology with Health Education by Padma B Sanghani, Pub: McGrawHill.

Page 33: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

2HS105: Ethics and Values [2 0 0 0]

Learning Outcomes:

On successful completion of the course, the students are expected to:

Be aware and understand importance of Engineering Ethics and Human Values Understand social responsibilities of an engineer Appreciate ethical dilemma while discharging duties in professional life.

Syllabus:

Unit No. Topics

1 Human Values: Morals, Values and Ethics – Integrity – Work Ethic – Honesty – Courage –Empathy –

Self-Confidence – Character = Continuous Happiness and Prosperity- A look at basic Human Aspirations, Understanding and living in harmony at various levels

2 Engineering Ethics: Senses of 'Engineering Ethics' - variety of moral issued - types of inquiry - moral

dilemmas - moral autonomy - Kohlberg's theory - Gilligan's theory - consensus and controversy – Models of Professional Roles - theories about right action - Self-interest - customs and religion - uses of ethical theories. Valuing Time – Co-operation – Commitment.

3 Engineering as Social Experimentation: Engineering as experimentation - engineers as responsible experimenters - codes of ethics

- a balanced outlook on law - the challenger case study 4 Safety, Responsibilities and Right: Safety and risk - assessment of safety and risk - risk benefit analysis and reducing risk -

the Three Mile Island and Chernobyl case studies. 5 Global Issues: Multinational corporations - Environmental ethics - computer ethics - weapons

development - engineers as managers-consulting engineers-engineers as expert witnesses and advisors -moral leadership

Reference Books: 1. A Textbook on Professional Ethics and Human Values by Naagarazan, R.S, New Age Pub. 2. Ethics in Engineering by Mike Martin and Roland Schinzinger, McGraw-Hill, New York 3. Engineering Ethics by Govindarajan M, Natarajan S, Senthil Kumar V. S, Prentice Hall

Page 34: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

2HS301: Discrete Mathematics & Probability [4 0 0 4 0]

Learning Outcomes: After successful completion of this course, student will be able to

Understand discrete mathematical preliminaries

Apply discrete mathematics in formal representation of various computing constructs

Recognize the importance of analytical problem solving approach in engineering

problems

Topics Minimum

Hours

1] Group Theory :

Definition and Examples of Groups &Semi groups, Monoids and Groups,

Abelian Group, Cyclic Group, Subgroup, Permutation Groups, Coset

Decomposition of Groups, Normal Subgroups, Lagrange’s Theorem.

09

2] Graph Theory :

Basic Concept of Graph Theory, Some Basic Definitions of Graphs, Paths,

Reachability and Connectedness, Matrix Representation Of Graphs, Trees.

09

3] Fuzzy Sets:

Basic Definitions of Fuzzy sets, Basic Operations On Fuzzy Sets, Image and

Inverse Images, I-V Fuzzy Sets, Fuzzy Relations.

06

4] Correlation:

Definition of Correlation, Types of Correlation, Scatter Diagram Method,

Karl Person’s Correlation Coefficients, Correlation Coefficients for

Bivariate frequency distribution, Probable error for Correlation Coefficients,

Rank Correlation Co-efficient.

08

6] Regression:

Definition of Regression, Regression lines, Regression Coefficients,

Properties of regression Coefficients, Fitting of regression lines and

estimation for Bivariate frequency distribution.

07

7]Probability Distributions:

Binomial Distribution :

Introduction, Probability mass function of Binomial distribution, Mean and

Variance of Binomial distribution, Properties of Binomial Distribution, Uses

of Binomial Distribution.

Poisson Distribution :

Introduction, Probability mass function of Poisson distribution, Mean and

Variance of Poisson distribution, Properties of Poisson Distribution,

Applications of Poisson Distribution.

Normal Distribution :

Introduction, Probability density function of Normal distribution, Properties

of Normal distribution, Importance of Normal Distribution.

09

Text Book:

1 Discrete Mathematical Structures With Application To Computer ScienceBy Tremblay, J.P.

&Manohar ,Mcgraw Hill - New DelhiTextbook of engineering mathematics

By A.B.Mathur and V.P.Jaggi.

Page 35: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

Reference Books:

2 Discrete Mathematics and Its Applications

By Rosen,KennethL.Mcgraw Hill - New Delhi

3 Discrete Mathematical Structures For Computer Science

By Kolman, B& Busby R.C,Prentice Hall Of India PvtLtd.,New Delhi

4 Applied Discrete Structures For Computer Science

By Alan Doerr&Kenneth ,GalgotiaPub.Pvt.Ltd. New Delhi

5 Fuzzy Sets and Fuzzy Logic. Theory and Applications

By Georgr J. Klir/Bo Yuan

6 Fundamental of Applied Statistics

By S.C. Gupta & V.K. Kapoor , Sultan Chand Publication

7 Probability, Statistics and Random Process

By T Veerarajan, TMH

Page 36: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

2CE302: Digital Electronics [3 0 2 3 1] Learning Outcomes:

To learn various number systems and their conversion used in digital components

To introduce significant evolution in digital electronics

To understand basic digital components for circuit design

To design basic electronics circuit for various applications and their analysis

Topics Minimum

Hours

1] Binary Systems:

Digital Computer & Systems,

Binary Numbers, Number Base conversions,

Different Number systems &theirrelations, Complements, Binary codes,

Binary storage & registers.

6

2] Digital Integrated Circuits:

RTL, DTL circuits, I2L Logic, TTL, ECL, MOS & CMOS circuits & their

characteristics,

source current & sink current.

5

3] Boolean Algebra & Logic Gates:

Basic definitions, Axiomatic definition of Boolean Algebra, Basic Theorems

& Properties,

Boolean functions, Canonical & Standard forms, Logic operations, Digital

Logic gates & Logic families.

5

4] Simplification of Boolean Functions:

Map method, Two, Three, Four, Five & Six variable maps, Products of Sum

& Sum of Products simplification,

NAND, NOR & Other two level Implementations,

Don't care conditions, Tabulation method.

7

5] Combinational Logic:

Design Procedure, Address, Subtractors, Code Conversion,

Analysis Procedure,

Multilevel NAND & NOR circuits,

Exclusive-OR & Equivalence functions.

6

6] Combinational Logic with MSI & LSI:

Binary Parallel Adder, Decimal Adder,

Magnitude Comparator, Decoders, Multiplexers,

ROMs, PLAs,

Introduction of PLDs, CPLDs and FPGA..

7

7] Sequential Logic:

Latch, Flip Flops, difference between latch and flip flop,

Triggering of Flip flops,

Analysis of clocked sequential circuits, State reduction & assignment,

Flip Flop Excitation tables, Design of Sequential circuits,

Design of counters, Design using state equations.

7

8] Registers and Counters:

Registers, Shift registers,

Ripple Counters,

Synchronous Counters, Memory.

3

Page 37: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

Text Book:

1. Digital Logic and Computer Design

By Morris Mano

Reference Books:

2. Digital Electronics Circuits & Systems

By V. K. Puri

3. Digital Fundamentals

By Floyd

4. Digital Electronic

By Y R. P. Jain

Page 38: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

2CE303: Internet Programming [3 04 3 2]

Learning Outcomes:

After successful completion of this course, student will be able to

Understand basics of internet and to develop different web applications.

Understand java script and its usage

Be able to create simple web pages using HTML and CSS

Be able to write simple programs using JavaScript

To have hands on experience for HTML using CSS, PHP this will help them to prepare

website and web base application.

Topics Minimum

Hours

1] Introduction to Internet & Internet Programming:

Basics of Internet, Internet programming and its applications

Website & its Types with Example

Main Objectives and study purpose of HTML,CSS & JavaScript

02

2] Hypertext Markup Language -- HTML Basic:

Introduction of HTML

Elements of HTML

HTML Basic Tags

HTML Formatting

HTML Entities

HTML Links,

HTML Images

HTML Frames

HTML Tables

HTML Lists

HTML Forms

Meta-tags and search engine

05

3] Cascaded Style Sheet – CSS:

Introduction to CSS

CSS Syntax & How to Insert a Style Sheet

CSS Background

CSS Text

CSS Font

CSS Border

CSS Margin & Padding

CSS List

CSS Tables

CSS Dimension

CSS Pseudo Class

CSS Image Opacity

06

4] Basics of Java Script and Advance JavaScript:

Introduction to JavaScript

How to Insert a JavaScript

JavaScript Variable

JavaScript Operator

JavaScript Conditional Statement

18

Page 39: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

JavaScript Popup Boxes

JavaScript Function

JavaScript Loop Statement

JavaScript Break and continue Statement

JavaScript Events

JavaScript try, catch & throw Statement

JavaScript Object

JavaScript Form Validation

JavaScript Cookies

JavaScript Browser

JSON

5] Introduction to HTML5 & CSS3 (In Lecture):

Introduction to HTML 5.0 and its tags.

Introduction to CSS 3.0 and its properties.

02

6] Introduction to Web Design and Development Tool:

Design and Deployment of Website. (on Local and real IP) 02

7] Introduction to PHP:

PHP Introduction, advantages, drawbacks, comparison with other language,

Installation, PHP Syntax, PHP Variables, String, Printing statements,

Operators, If...Else, Switch, Looping, Arrays, Functions, Forms, ways to

passing information : $_GET, $_POST etc, Date, Include, File, File Upload,

Cookies, Sessions

05

Text Book:

1. Introduction to Internet and HTML scripting

By Bhaumik Shroff

Reference Books:

2. Teach yourself HTML in 24 hours

By Techmedia

3. HTML4 BIBLE

By BraynOmdex

4. ABC of JavaScript

By Purcell lee BPB publication

5. Pure java Script

By Gilliam Johnson Techmedia

6. Introduction to web Technology

By Uttam K. Roy

7. Programming PHP

By RasmusLerdorf, Kevin Tatroe& Peter MacIntyre

Web References:

www.w3school.com

www.tutorialspoint.com

Page 40: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

2CE304: Object Oriented Programming [3 0 4 3 2]

Learning Outcomes: After successful completion of this course, student will be able to

Understand and describe the basic principles and constructs of object-oriented

programming

Understand the significance of object oriented tools and technologies for modular

development

Design, develop, execute, debug and validate programs in object oriented programming

environment

Topics Minimum

Hours

1] Introduction:

Object Oriented Programming Concepts (Encapsulation, Inheritance &

Polymorphism),

Features Of JAVA Language,

Types Of JAVA Programs,

JAVA Architecture

4

2] Literals, Data Types And Variables:

Literals (Integer Literals, Floating Point Literals, Character Literals, String

Literals, Boolean Literals),

Data Types (Integer Types, Floating Point Types, Character Type, Boolean

Type), Variables.

1

3] The Structure Of a Java Program:

Structure Of a Java Program, Comments,

Expressions and Statements,

Type Conversion,

Block Statements and Scope.

3

4] Operators:

Arithmetic Operators, Bitwise Operators, Relational Operators, Boolean

Logical Operators, Ternary Operator,

Operator Precedence

1

5] Control Statements:

The if...else Statement, The switch Statement,

The while Statement, The do...while Statement, The for...Statement,

The break Statement,

The continue Statement,

The comma Statement

2

6] Arrays:

One-Dimensional Array, Multi-Dimensional Array 3

7] Classes:

Defining a Class, The new Operator and Objects, The dot operator,

Method Declaration and Calling,

Constructors, Instance Variable Hiding, this in Constructor,

Method Overloading, Passing Objects as Parameters to Methods

6

8] Inheritance:

Creating Subclasses, Method Overriding, Final Class,

Final Variables, Object Destruction and Garbage Collection,

Recursion, Static Methods,

Block and Variables (Static Class, Static Variables, Static Block), Abstract

5

Page 41: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

Classes.

9] Packages and Interfaces:

Package, The import Statement, Access Modifier, Interfaces (Defining

Interfaces, Implementing an Interface)

4

10] Exceptions:

Type Of Exceptions, Catching Exceptions (Nested try Blocks, Hierarchy Of

Multiple Catch Blocks),

Rethrowing Exceptions, Creating Your Own Exceptions,

Broadcasting that a Method Throws Exception, The finally Block, Checked

and Unchecked Exceptions

4

11] Input And Output Classes:

I/O Streams, The File Class, Byte Stream (InputStream, OutputStream),

Disk File Handling (FileInputStream, FileOutputStream),

Memory Handling (ByteArrayInputStream, ByteArrayOutputStream),

Filtered Byte Streams (BufferedInputStream, BufferedOutputStream,

DataInputStream, DataOutputStream), SequenceInputStream,

ObjectOutputStream, ObjectInputStream, Random Access File,

Character Stream(CharArrayReader, CharArrayWriter,

InputStreamReader, Output StreamWriter, FileWriter, FileReader,

BufferedReader, BufferedWriter)

2

12] Strings:

The String Class( Equality Operator and equals Method, String

Concatenation with +), The StringBuffer Class

3

13] Applets:

Applet Basics, Methods of Building an Applet, Some General Methods of

Applet,

Displaying Text in Status Bar, Embedding Applet Information,

The HTML Applet Tag, Reading Parameters into Applets, Colors in Applet,

Getting Documentbase and Codebase,

Interfaces in Applet, Multimedia in Applet (Playing Audio Clips, Images in

Applet,

Applet Showing Other HTML Pages)

3

14] Event Handling:

Delegation Event Model, Events (The ActionEvent Class, The

AdjustmentEvent Class, The ComponentEvent Class, The ItemEvent Class,

The KeyEvent Class, The MouseEvent Class, The TextEvent Class, The

WindowEvent Class),

Event Listeners, Registering Listners with Source,

Adapter Classes

1

Text Book:

1. Java - The Complete Reference

By Herbet Shield, Tata Mc-Graw Hill Publication

Reference Books:

2. Programming with Java – A primer

By E. Balagurasamy, Tata Mc-Graw Hill Publication.

3. Programming in Java2

By Dr. K. Somasundaram, Jaico Book

Page 42: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

2CE305: Database Management System-I [4 0 2 4 1]

Learning Outcomes: After successful completion of this course, student will be able to

Distinguish between data and information and Knowledge.

Distinguish between Traditional file processing system and DBMS.

Understand the needs for and uses of database management systems in business

Study the physical and logical database designs, database modeling, relational,

hierarchical, and network models.

Understand the components of a computerized database information system (application)

like, database languages, users etc

Describe data models, schemas and instances.

To design a correct, new database information system for a business functional area and

implement the design

To understand and use of data manipulation language to query, update, and manage a

database.

Describe basic storage, data and file organizations.

Topics Minimum

Hours

1] Introduction:

Database system applications

Database Systems versus File Systems

View of Data

Database Languages

Database Users and Administrators

Database System Structure

5

2] Relational Data Model:

Structure of Relational Databases

The Relational Algebra

Extended Relational Algebra Operations

Modifications of the Database Views

The Tuple Relational Calculus

The Domain Relational Calculus

6

3] SQL:

Background , Basic Structure

Set Operations Aggregate Functions

Null Values

Nested Subqueries , Views, Complex Queries ,

Modification of Database, Joined Relations

Data-Definition Language

Other SQL Features

Domain Constraint

Referential Integrity

Authorization

8

4] Database Design & E-R Model :

Basic Concepts

Constraints, Keys

Design Issues

Entity Relationship Diagram, Weak Entity Sets,

7

Page 43: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

Extended E-R Features

Design of an E-R Database Schema

Reduction of an E-R Schema to Tables

5] Relational Database Design:

Data redundancy and inconsistency

Normalization

Normal Forms: 1NF, 2NF, 3NF,

Functional Dependency

Functional Dependencies Decomposition

Desirable Properties of Decomposition

More Normal Forms: BCNF, 4 NF

8

6] Storage and File Structure :

Overview of Physical Storage Media

Magnetic Disks, RAID , Tertiary Storage

Storage Access , File Organization

Organization of Records in Files

Data-Dictionary Storage

6

Text Book:

1. Database System Concepts 5th Edition,

By Silberschatz, Korth and Sudarshan

Reference Books:

2. An Introduction to Database Systems:7th Edition

By C. J. Date.

3. Practical Book: - SQI, PL/SQL: 3rd Edition.

By Ivan Bayross

Page 44: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

2HS401: Mathematicsfor Computer Engineering & Information Technology

[4 0 0 4 0]

Learning Outcomes:

After successful completion of the course, student will be able to

Express physical phenomenon in mathematical formulation

Understand and solve differential equations

Basic knowledge of widely used Fourier transform techniques and their applications in

computer and IT Engineering

Topics Minimum

Hours

1] Laplace Transforms:

Definition, Laplace transform of elementary functions. Formulas of Laplace

transform, Inverse Laplace transforms. Laplace transform of derivatives,

Laplace transform of integration. Multiplication by tn, Division by t,

Convolution theorem, Unit step and Heaviside’s unit function, Dirac-delta

function. Periodic functions, Solution of ordinary linear differential

equations, simultaneous equation with constant co-efficient applied to

electrical circuits

10

2] Fourier Series:

Definition of periodic function, Euler’s formula, Functions having points of

discontinuity, Change of intervals, Odd and Even functions, Expansion of

odd or even periodic functions, Half range sine and cosine series, Elements

of harmonic analysis.

10

3] Fourier Transforms:

Definition, Fourier integral, Fourier sine and cosine integration, complex

form of Fourier integral, Fourier sine transform, Fourier cosine transform,

Inverse Fourier transforms.

04

4] Theory Of Complex Variables:

Analytic functions, Cauchy-Riemann equation, Line integral, Cauchy’s

theorem and Cauchy’s integral formula, Simple form of conformal

transformation with application of the solution of two-dimensional

problems.

08

5] Finite Differences And Difference Equations:

Finite differences interpolation, Newton’s and LaGrange’s formula,

Difference equation with constants co-efficient, Solution of ordinary and

partial differential equations with boundary conditions by finite difference

method.

07

6] Numerical Methods:

Roots of algebraic equations, Solution of linear simultaneous equations,

Numerical differentiation and Numerical integration, Numerical methods to

solve first order, first degree ordinary differential equations.

09

Text Book:

1. Higher engineering mathematics

By B.S.Grewal.

Page 45: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

Reference Books:

2. Engineering mathematics

By Srivastava.

3. Textbook of engineering mathematics

By A.B.Mathur and V.P.Jaggi.

4. Theory of functions of complex variables

By Shanti Narayan.

5. Introductory Methods of Numerical Analysis

By S.S.Sastry.

6. Advanced engineering mathematics

By Erwin Kreyzing.

Page 46: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

2CE402: Operating System [3 0 2 3 1]

Learning Outcomes:

To give the fundamental knowledge of how operating system works, manages the

applications that are running.

To give fundamental principles of operating system design and its components

To understand process management, memory management including virtual memory,

protection and security management.

Topics Minimum

Hours

1] Introduction:

What is an OS? Evolution Of OS, services, Types of OS, Different view of

OS, Basics of memory and architecture

04

2] Process Management:

Process, Process Control Block, Process States

Threads, Types of Threads, Multithreading

04

3] Inter process Communication:

Race Conditions, Critical Section, Mutual Exclusion

Hardware Solution, Strict Alternation, Peterson’s Solution

The Producer Consumer Problem, Semaphores, Event Counters, Monitors

Message Passing and Classical IPC Problems: Reader’s & Writer Problem,

Dinning Philosopher Problem etc., Scheduling, Scheduling Algorithms.

06

4] Deadlock:

Deadlock Problem, Deadlock Characterization

Deadlock Detection, Deadlockrecovery

Deadlock avoidance: Banker’s algorithm for single & multiple resources

Deadlock Prevention.

06

5] Memory Management:

Paging: Principle Of Operation, Page Allocation, H/W Support For Paging

Multiprogramming With Fixed partitions

Segmentation

Swapping

Virtual Memory: Concept, Performance Of Demand Paging, Page

Replacement Algorithms, Thrashing, Locality

11

6] Input Output Management:

I/O Devices, Device Controllers, Direct Memory Access

Principles Of Input/outputs, Interrupt Handler, Device Driver, Device

Independent

I/O Software Disks: RAID levels, Disks Arm Scheduling Algorithm

Error Handling

04

7] File Systems:

File Naming, File Structure, File Types, File Access, File Attributes, File

Operations, Memory Mapped Files

Directories: Hierarchical Directory System, Pathnames, Directory

Operations

File System Implementation, Contiguous Allocation, Linked List Allocation,

Linked List Using Index, Inodes, Implementing Directories In C, MS-DOS,

and UNIX. Shared Files

Disk Space Management

04

Page 47: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

File System Reliability

File System Performance

8] Case Study:

File System of Unix Operating System and Linux, Role Of Kernel

& Function Of Kernel, Design Structure of Unix Operating System, System

Calls, Elementary Shell Programming, Directory Structure, System

Administration.

04

Text Book:

1. Operating System Concepts

ByAviSilberschatz, Peter Baer Galvin, Greg Gagne, Ninth Edition, Wiley

Reference Books:

2. Modern Operating Systems

By Andrew S. Tanenbaum, Third Edition PHI

3. Operating Systems, D.M.Dhamdhare, TMH

4. Operating Systems Internals and Design Principles , William Stallings , Seventh Edition,

Prentice Hall

5. Unix System Concepts & Applications, Sumitabha Das, TMH

6. Unix Shell Programming, YashwantKanitkar

By BPB Publications

Page 48: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

2CE403: Database Management System- II [3 0 2 3 1]

Learning Outcomes:

Enhance the previous knowledge of database systems by deepening the understanding of

the theoretical and practical aspects of the database technologies.

Apply the principles of query optimization to a database schema.

Understand basic principles of database transaction processing and managing concurrent

execution environment.

Explain the various types of locking mechanisms utilized within database management

systems.

Explain the different types of database failures as well as the methods used to recover

from these failures

Describe various database architectures and distributed database management system.

Get familiar with the currently available database processing environment (client –server

model)and query language to build business applications and services

Develope practical skills in the use of this model and approach to be able to select and

apply the appropriate methods for a particular.

Be able to apply learned skills to solving practical database related tasks

This course introduces students to PL/SQL and helps them to understand the benefits of

this powerful programming Language. Students learns to create PL/SQL blocks of

application code and are introduced various database objects. They learn about declaring

variables, trapping exceptions and they also learn to declare and control cursors. Students

learn to develop, execute and manage PL\SQL stored program units like procedures,

functions, packages and database triggers.

Topics Minimum

Hours

1] Query Processing & Query Optimization:

Overview

Query Evaluation

Measure of Query Cost

Query Optimization Overview

03

2] Transaction:

Transaction concepts

Transaction state

ACID Property

Implementation of Atomicity & Durability

Concurrent executions

Serializibility

Conflict serializability

View serializability

Recoverability

Recoverable schedules

Cascade less schedules

07

3] Concurrency control:

Lock based protocols

Locks

Granting of locks

Two phase locking protocol

Implementation of locking

08

Page 49: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

Graph based protocols

Timestamp based protocols

Timestamps

Timestamp ordering protocol

Thomas’ write rules

Multiple granularity

Deadlock handling

Deadlock prevention

4] Recovery system:

Failure classification

Storage structure

Storage type

Stable storage implementation

Data access

Recovery & atomicity

Log based recovery

Deferred database modification

Immediate database modification

Checkpoints

Shadow paging.

05

5] Database system architecture:

Centralized & client server architectures

Centralized systems

Client server system

Server system architecture

Transaction server process structure

Data servers

Parallel systems

Speedup & scale up

Interconnection networks

Parallel database architectures

Shared memory

Shared Disk

Shared nothing

Hierarchical

Distributed systems

An example of a distributed database

06

6] Distributed databases:

Homogeneous & heterogeneous databases.

Distributed data storage

Data replication

Data fragmentation

Transparency

Distributed transactions

System architecture

System failure modes

Commit protocols

Two phase commit protocol.

Commit protocol

Handling of failures

Three phase commit protocol

06

Page 50: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

7] PL/SQL:

Theoretical Fundamentals 05

Text Book:

1. Database System Concepts5th Edition By, Silberschatz, Korth and Sudarshan

Reference Books:

2. An Introduction to Database Systems: 7th Edition

By C. J. Date.

3. Practical Book : - SQI, PL/SQL 2nd Edition

By Ivan Bayross

Page 51: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

2CE404: Data Structures [4 0 4 4 2]

Learning Outcomes:

To explain concepts of Data structure such as stack, link list, tree, queue, searching and

sorting.

To explain importance and applications of data structures.

Topics Minimum

Hours

1] Overview of C:

Arrays, Functions

Strings

Structures

Pointers

4

2] Introduction to Data Structures:

Importance

Applications

Algorithm & Algorithmic Notation

2

3] Stack:

Definition & Concept

Operations on Stacks (Push, Pop, Peep, Change -Algorithm &

Implementation).

Applications of Stack.

Polish expression and Conversions

8

4] Queue:

The queue and its sequential representation.

Simple Queue, Circular Queue, Double ended Queue, Priority Queue

5

5] Sorting:

Elementary sorts: Bubble sort, Quick sort, Selection sort, Insertion sort,

Merge sort, Radix sort

Worst case and average behavior

7

6] Searching:

Basic search techniques-Sequential searching,

Binary Search

2

7] Linked List:

Concept.

Sequential Allocation method Vs linked Allocation method.

Dynamic Data structure Vs Static Data structure.

Pointer and Linked Allocation.

Singly Linked List Storage Structures & Basic Operations.

Circular Linked List Storage Structures & Basic Operations.

Doubly Linked List Storage Structures & Basic Operations.

Application of Linked List Storage Structures.

12

8] Graph Theory:

Definition

Graph Representation.

Graph Terms

Graph Traversal

3

9] Tree: 5

Page 52: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

Tree & Graph

Binary trees

Binary tree representation

Binary tree traversals

Threaded binary tree

Different binary tree

Tree applications

Text Book:

1. An Introduction to Data Structures with Application

By Jean-Paul Tremblay ,Paul G. Sorenson (second Edition)

Reference Books:

2. Data Structures using C and C++

By Aaron M. Tenenbaum, Moshe J. Augenstein, YedidyahLangsam (Second Edition)

3. Classic Data Structure

By D. Samanta

Page 53: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

2CE405: Application Development Tools [2 0 4 2 2]

Learning Outcomes: The main objectives for offering the course are:

Explain the architecture of .NET Framework.

Explain features of C# using Console Application.

Develop Windows based applicationusing MicrosoftVisual Studio.

Develop ADO.net based database driven .NET application

Develop simple web application.

Topics Minimum

Hours

1] Introduction To .Net Framework:

The Common Language Runtime

Compilation in .NET (MSIL and JIT), CTS, CLS

Cross language Integration

Garbage Collection

Assemblies, Name spaces

Versioning and deployment

Framework class Library

5

2] C# Basics using Console Application:

Variables and Constants

Data Types, Scope of variables

Formatting Data

Handling Exceptions

Conditions

Input Validation

Loops,Arrays

Functions

9

3] Windows Forms and Controls:

Creating Windows Forms, Windows Forms Properties and Events

Controls (Properties and Events of Controls):Button, Label, TextBox,

NumericUpDown, CheckBox, RadioButton, DateTimePicker, GroupBox

ListBox, ListView, ComboBox, TabControl, PictureBox, ProgressBar

ToolTips, RichTextbox, Timer

DatagridView

8

4] Working With ADO.NET:

Introduction to ADO.NET, ADO.NET Architecture

Understanding SqlConnection, SqlCommands, SqlDataReaders

DataSet and DataAdapter

5

5] Introduction to ASP.NET:

Introduction to ASP.NET, Working with Web and HTMLControls 5

References Books:

1. Beginning Visual C# Programming

By Wrox publication

2. Professional C# and .NET

By Wrox Publication

Page 54: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester V Version 2.0.0.0

Effective from Academic Year 2016-17 Effective for the batch Admitted in July 2014

Subject code 2CE501 Subject Name Object Oriented Analysis and Design

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 3 0 1 - 4 Theory 40 60 100

Hours 3 0 2 - 5 Practical 30 20 50

Pre-requisites:

Object Oriented Programming

Learning Outcome:

After successful completion of this course, student will be able to demonstrate the importance of modelling in the software development life cycle. become familiar with the Unified modelling Language. understand the object-oriented approach to analysing and designing systems and software solutions. employ the Unified modelling Language notations to create effective and efficient system designs. understand the difference between writing programs for the software and doing analysis and design.

Problem formulation and decomposition (analysis) and solution building (design) will be covered.

Theory syllabus

Unit Content Hrs

1

Introduction to OOAD and UML: Overview of Software Development Life Cycle (Waterfall Model), Introduction to Object Oriented analysis and design, overview of model with types and UML, UML structure: building blocks and architecture, Overview of static and dynamic UML diagrams

03

2

Use case Model: Introduction to use case diagram, Elements of use case diagram with notations: association/uses, include, extend, generalization

05

3

Class & Object Model: Basics of object oriented concepts, Introduction to class and object diagram, identify the elements based on noun phrase method, Elements of class diagram with notations: object, class, link, association, multiplicity, link attributes, association end names, association classes, qualified association, association ends, N-ray association, aggregation and composition, generalization, abstract class

10

4

Sequence & Collaboration Model : Introduction to Sequence & Collaboration diagram, Elements, Elements of sequence diagram Collaboration diagram with notations: object, messages, activation, lifeline, destroying objects, guard condition

06

5

Activity and Swim lane Model: Introduction to Activity and Swim lane diagram, Elements, Elements of Activity and Swim lane diagram with notations: initial state or start point, activity or action state, action flow, decisions and branching, guard condition, Synchronization (fork and join), time event, merge event, swim lanes, final state or end point

06

6

State Model: Introduction to State Diagram, Event ,Change Event, Signal Event, Call Event, Time Event , States, Transition & Conditions, Transition, Guard Condition, Action, State Diagrams, One shot State Diagram, Creating State Diagram ,State Diagram Behaviour, Activity, Do-activity, Entry Activity, Exit Activity, Nested State Diagram, Nested States, Signal Generalization, Concurrency

08

7

Component and Deployment Model: Introduction to Component and deployment Diagram, Elements of Component and deployment Diagram

01

Page 55: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

8 Forward & Reverse Engineering: Introduction to Forward & Reverse Engineering using UML

01

Practical content

Experiments/Practicals/Simulations would be carried out based on syllabus

Text Books

1 Object Oriented Modelling and Design with UML: by J. Rambaugh, et al., Second Edition Pearson

Reference Books

1 Magnifying object-oriented analysis and design by ArpitaPatil and Netra,PHI

2 UML 2 and the Unified Process: Practical Object-Oriented Analysis and Design by Jim Arlow / Ila Neustadt

3 The UML Users guide by Grady Booch, J. Rambaugh, Ivar Jacobson, Pearson Education

4 Object Oriented System Development by Ali Bahrami, McGraw Hill

Page 56: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEERING& TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester V Version 2.0.0.0

Effective from Academic Year 2016-17 Effective for the batch Admitted in July 2014

Subject code 2CE502 Subject Name Design and Analysis of Algorithms

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 3 0 1 - 4 Theory 40 60 100

Hours 3 0 2 - 5 Practical 30 20 50

Pre-requisites:

Data Structures

Learning Outcome:

After successful completion of this course, student will be able to decide best algorithm out of various alternatives. analyse the performance of the algorithms for the best, average and worst case. find out the time and space requirements for various algorithms and represent it using various

mathematical notations. understand and derive the recurrence relationship for algorithms. develop various algorithms for the same problem using different design paradigms. understand the different classes of the problems.

Theory syllabus

Unit Content Hrs

1

Introduction: Definition and characteristics of an algorithm, problems & instances, best, average and worst case analysis, need to look for efficiency

03

2

Analysis of Algorithms: Performance analysis (time & space complexity), Growth of functions,asymptotic notations (Big-oh, Omega and Theta),Sorting Algorithms and analysis (Bubble sort, Selection sort, Insertion sort),Sorting in linear time:Radix sort and Counting sort

08

3

Solving Recurrences: Iteration method, homogeneous recurrences, inhomogeneous recurrences, change ofvariable, recurrence trees, master method & master theorem

08

4

Divide and Conquer: Characteristics, the general template, applications: binary search, merge sort, quick sort, randomized quick sort, counting inversions, min-max problem

06

5

Graph Algorithms: Depth-first search, breadth-first search, topological ordering & sorting, backtracking, applications of backtracking, knapsack problem, branch & bound, application: the assignment problem

04

6

Greedy Algorithms: General characteristics of greedy algorithms and examples, applications: making change problem, Kruskal’s and Prim’salgorithms, shortest path problem, knapsack problem, scheduling problem

05

7

Dynamic Programming: General characteristics and examples, principle of optimality, applications: binomial coefficients,making change, knapsack problem, chained matrix multiplication

05

8

Computational Complexity: Introduction, information-theoretic arguments: complexity and sorting, complexity and algorithmic, introduction to NP completeness, the classes P and NP, polynomial reductions, NP complete problems

03

Practical content

Page 57: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

Experiments/Practicals/Simulations would be carried out based on syllabus

Text Books

1 Introduction to Algorithms by Cormen, Leiserson, Rivest, Prentice Hall of India

Reference Books

1 Fundamentals of Algorithms by Brassard & Bratley, Prentice Hall of India

2 Ellis Horowitz, SartajSahni, Fundamentals of computer algorithms, Computer Science Press

Page 58: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester V Version 2.0.0.0

Effective from Academic Year 2016-17 Effective for the batch Admitted in July 2014

Subject code 2CE503 Subject Name Computer Architecture

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 3 0 1 - 4 Theory 40 60 100

Hours 3 0 2 - 5 Practical 30 20 50

Pre-requisites:

Digital Electronics

Learning Outcome:

After successful completion of this course, student will be able to understand the organization of a Computer system. apply the knowledge of combinational and sequential logical circuits to design computer architecture. understand the input / output and Memory related concepts.

Theory syllabus

Unit Content Hrs

1

Overview of register transfer and micro operations: Register Transfer Language, Register transfer, Bus and Memory transfer, Arithmetic Micro-operations, Logic Micro-operations, Shift Micro operations, Arithmetic Logic Shift Unit

05

2

Basic computer organization and design: Instruction codes, Computer registers, computer instructions, Timing and Control, Instruction cycle, Memory-Reference Instructions, Input-output and interrupt, Complete computer description, Design of Basic computer, design of Accumulator Unit

05

3

Micro programmed control: Control Memory, Address sequencing, Microprogram Example, design of control Unit 04

4

Central processing unit: Introduction, General Register Organization, Stack Organization, Instruction format, Addressing Modes, data transfer and manipulation, Program Control, Reduced Instruction Set Computer (RISC)

05

5

Pipeline and vector processing: Parallel Processing, Pipelining, Arithmetic Pipeline, Instruction, Pipeline, RISC Pipeline, Vector Processing, Array Processors

04

6

Input – Output organization: Input-output interface, Asynchronous Data Transfer, Modes of Transfer, Priority Interrupt, DMA, Input-Output Processor (IOP), CPUIOP communication, Serial Communication

07

7

Memory Organization: Memory Sub System, Memory hierarchy, Main memory, Auxiliary memory, Flash memory, Associative memory, Cache memory, Virtual memory, Memory management hardware

06

Practical content

Experiments/Practicals/Simulations would be carried out based on syllabus

Text Books

1 Computer System Architecture: By M. MorrisMano, Pearson Publlication

Reference Books

1 Structured Computer Organization: By Tanenbaum, PHI Publication

Page 59: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

2 Computer Organization and Architecture By Stallings, Pearson Publication

3 Computer Organization and Design by P. Pal Chaudhury, PHI Publication

4 Computer Architecture and Organization By Hayes, Tata McGraw Hill

Page 60: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester V Version 2.0.0.0

Effective from Academic Year 2016-17 Effective for the batch Admitted in July 2014

Subject code 2CE504 Subject Name Computer Networks

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 4 0 1 - 5 Theory 40 60 100

Hours 4 0 2 - 6 Practical 30 20 50

Pre-requisites:

Operating System

Learning Outcome:

After successful completion of this course, student will be able to describe and analyse the hardware, software, components of a network and the interrelations. explain networking protocols and their hierarchical relationship hardware and software, compare

protocol models and select appropriate protocols for a particular design. manage multiple operating systems, systems software, network services and security, evaluate and

compare systems software and emerging technologies. develop solutions for networking and security problems, balancing business concerns, technical issues

and security. explain concepts and theories of networking and apply them to various situations, classifying

networks, analysing performance and implementing new technologies.

Theory syllabus

Unit Content Hrs

1

Overview: Basics of Computer Networks, Network Hardware, Network software, Uses of computer networks, Network categories: LAN, MAN, WAN, Examples of Networks and Protocols,Reference Models: OSI, TCP/IP

06

2

The Physical Layer: Transmission Media: magnetic media, twisted pair, baseband & broadband, fiber optics. WirelessTransmission: radio, microwave,infrared & light wave. Narrowband ISDN, Broadband ISDN & ATM. Cellular Radio: Paging systems, cordless telephones,analog&digital telephones

10

3

Data Link Layer: Design Issues: Services Provided to Network Layer, Framing, Error Control, Flow Control, Error Detecting Codes, Error-Correcting Codes, Stop and Wait Protocol, Go Back nProtocol, Selective RepeatProtocol, Ethernet, Wifi, Medium Access: Multiple Access Protocols, ALOHA, CSMA/CD, Collision Free Protocols, Wide Area Networks: Circuit Switching & Packet Switching, Switching Networks, Packet Switching Principles

14

4

Network Layer: Design Issues, Introduction to Routing, Virtual Circuits, Connectionless Internetworking, Fragmentation, IP Addressing Scheme, IP, Sub networking, IPv6. ARP, RARP, Routing Algorithms, Congestion Control Mechanisms

10

5

Transport Layer: Process to Process Delivery, Client-server Paradigm, Addressing, Multiplexing and De multiplexing,establishing a Connection, Releasing a Connection, UDP, TCP: Service Model,Connection Management, Silly Window Syndrome, Performance Issues

10

6 Application Layer: Introduction to Application layer protocols, DNS, SMTP, E-mail, SMTP 06

Practical content

Experiments/Practicals/Simulations would be carried out based on syllabus

Text Books

1 Data Communication & Networking: By Behrouz A. Forouzan. Tata McGraw Hill.

Page 61: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

2 Computer Networks By Andrew S. Tanenbaum. Prentice Hall India.

Reference Books

1 Computer Networks: A Top Down Approach, By Behrouz A. Forouzan. Tata McGraw Hill

2 Data & Computer Communications: By William Stallings. Prentice Hall India.

Page 62: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester V Version 2.0.0.0

Effective from Academic Year 2016-17 Effective for the batch Admitted in July 2014

Subject code 2CE505 Subject Name Seminar

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 0 0 1 - 1 Theory - - -

Hours 0 0 2 - 2 Practical 30 20 50

Pre-requisites:

Communication Skills

Learning Outcome:

After successful completion of this course, student will be able to

build their presentation skills on emerging topics of computer engineering and information technology

Theory syllabus

-

Practical content

Unit Content Hrs

1 Students have to choose seminar topic from recent trends and technology and at the end of semester they have to give presentation 26

Page 63: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester V Version 2.0.0.0

Effective from Academic Year 2016-17 Effective for the batch Admitted in July 2014

Subject code 2CE506 Subject Name Advance Java

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 3 0 1 - 4 Theory 40 60 100

Hours 3 0 2 - 5 Practical 30 20 50

Pre-requisites:

Object Oriented Programming

Learning Outcome:

After successful completion of this course, student will be able to developevent driven programs using graphical user interface components. develop database driven java programs using JDBC. develop web applications using Servlets, Java Server Pages and JDBC. developenterprise applications using Enterprise Java Beans.

develop web applications using framework.

Theory syllabus

Unit Content Hrs

1

Introduction to Java EE Platform and Architecture: Java EE Platform, Enterprise Application and Architecture, Java EE Containers and Components, Java EE Technologies,Java EE Application Deployment

03

2

Java Database Connectivity (JDBC): Introduction, JDBC Architecture: API and Drivers, Types of JDBC Statements,Types of Result sets, Batch Processing, Transactions, JDBC Exception Types, Metadata

06

3

Swing Programming: Introduction,limitations of AWT, Swing Components and Containers, Look and Feel for Swing Components, MVC Architecture

04

4

Servlet: Introduction, Servlet API and Interface, Generic Servlet, HTTP Servlet, Servlet Lifecycle, Servlet Container, Servlet Request, Servlet Collaboration, Servlet Context, Session Management

06

5

JSP: Introduction, Advantages of JSP, Working and Lifecycles of JSP, Directives, Scripting elements,Action Elements, Implicit Objects, Java Beans, Various scope in JSP, JSTL

06

6 JavaMail: Overview, Mail protocols, JavaMail API, JavaMail Exception, Sending and Receiving Messages 02

7 Enterprise Java Beans (EJB): Introduction to EJB,Entity Beans,Session Beans, Message driven Beans 04

8 JPA: Introduction, Entities, Entity Relationships,JPA - ORM Components,Entity Manager 04

9

Hibernate: Introduction, Hibernate Architecture, Hibernate Mapping Types, Hibernate Configuration, Hibernate Sessions, Persistent Class & Mapping Files, Hibernate O/R Mapping,Hibernate Annotations, Hibernate Query Language

06

Practical content

Experiments/Practicals/Simulations would be carried out based on syllabus

Text Books

1 J2EE Unleashed by Joseph J. Bambara, BPB publications

Page 64: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

2 Java Server Programming Java EE5 Black Book,Dreamtech Press

Reference Books

1 Professional Java Server Programming Volume I and II, Wrox Publication

2 The complete Reference J2EE by Jim Keogh,Mcgraw Hill Education Pvt. Ltd

3 Head first Servlets and JSPs,byBryan Basham, Kathy Sierra, Bert Bates,O’Rilley Media

4 Professional Java Server Programming: J2EE 1.4 edition by Allamaraju, Shroff Publication

Page 65: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester V Version 2.0.0.0

Effective from Academic Year 2016-17 Effective for the batch Admitted in July 2014

Subject code 2CE507 Subject Name Web Technology

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 3 0 1 - 4 Theory 40 60 100

Hours 3 0 2 - 5 Practical 30 20 50

Pre-requisites:

Internet Programming

Learning Outcome:

After successful completion of this course, student will be able to

demystify programming, enjoy python scripting.

explore object-oriented programming.

discover python document programming.

interact websites and load data from them (web Scripting).

manage SQL and NoSQL databases with python.

explore test and debug python GUI based Program.

Theory syllabus

Unit Content Hrs

1

Introduction: Why Python? Python Concepts, Dynamic vs. Static Types, Procedural vs. Object-Oriented Programming, Comparing Programming Languages: C,C++,JAVA, C#, Python, Python Interpreter

06

2

Programming with Python: Launching Python programs, Types and Operators, Python Syntax ,Indentation, Multiple Line Spanning, Python Object Types, Python Numbers ,Strings and string operations, Regular expressions Lists, Conditional statements, Loops, pass statements, break-continue, try-catch-finally-raise statements

10

3 Dictionaries and Tuples: Concept of dictionary and basic operations, Use of Tuples, Sequence unpacking 04

4

File handling: Files, File Operations, Files and Streams, Creating a File ,Reading From a File, Iterating Through Files, Writing file

06

5 Object oriented programming with python: Learning Python Classes, Inheritance, Operator Overloads, Class Methods 07

6 Working with Databases: Working With a Databases, Using SQL to Query a Database,Python and SQLite, Creating an SQLite Database,Pulling Data from a DB

07

Practical content

Experiments/Practicals/Simulations would be carried out based on syllabus

Text Books

1 Learning program to Python by Cody Jackson 2nd edition

Reference Books

1 Beginning Python by James Payne, Wrox Publication

2 Beginning Python by Magnus Lie Hetland,Apress Publication

Page 66: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEEIRNG AND TECHNOLOGY Programme Bachelor of Technology Branch/Spec. ALL

Semester V Version 2.0.0.0

Effective from Academic Year 2016-17 Effective for the batch Admitted in June 2016

Subject code 2HS501 Subject Name Aptitude skill building I

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit - - 1 1 Theory - - -

Hours - - 2 2 Practical 25 25 50

Pre-requisites:

Basic engineering mathematics and English

Learning Outcome:

After learning this course each student would be able to:

Understand and develop basic skill requires to solve fundamental practical problems related to maths

Acquire satisfactory competency in use of two basic skills (Quantitative Ability and Logical Reasoning).

Solve campus placements and various competitive aptitude papers covering Quantitative Ability and Logical reasoning

Syllabus

Unit Content Hrs

1 Quantitative ability I : Height and Distance and time problems like trains, boats etc., Algebra, Inequalities and absolute values, Functions-formulas, Sequences,Fractions and Decimals

06

2 Quantitative ability II : Percents, Divisibility and primes, Exponents and roots, Word problems, two variables problems, Rates and work, Ratios, Averages, Allegations and Mixtures, pipes and cistern

06

3 Verbal Reasoning: Vocabulary, Text Completions and Verbal Reasoning, Reading Comprehension, Logical Sequence of Words, Blood Relation Test, Venn Diagrams

06

4 Logical Reasoning: Number Series, Letter and Symbol Series, Artificial Language, Matching Definitions, Logical Problems, Logical Games& Puzzles

06

5 Presentation skill: Preparing a Presentation, Organising the Presentation Material, Writing Your Presentation, Working with Visual Aids, Presenting Data, Managing the Event, Dealing with Questions

04

Text Books

1. Aggrawal R.S., “Quantitative Aptitude for Competitive Examinations”, S Chand,20th edition (2013)

2. Sharma Arun, “How to Prepare for Verbal Ability and Reading Comprehension for CAT”, McGraw Hill Education (India) Private Limited; 2014 edition (2014)

Reference Books

1. GuhaAbhijit, “Quantitative Aptitude for Competitive Examination”, McGraw Hill Education India Private Limited, 5th edition (2014)

2. Aggrawal R.S., “A Modern Approach to Logical Reasoning”,S Chand, 1st edition (2007)

3. Kumar Ajay, Kumar Anand, “General Aptitude Theory and Practice”, Pathfinder Publication, 2016 edition (2016)

4. GKP, “GATE Engineering & Mathematics General Apptitude 2016”, G.K. PUB, 12th edition (2015)

5. Lewis Norman, “Word Power Made Easy”, Goyal, Reprint edition (2011)

6. Anderson Marilyn, “Critical Thinking, Academic Writing and Presentation Skills: Mg University Edition”, Pearson Education; 1st edition (2010)

Page 67: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VI Version 2.0.0.0

Effective from Academic Year 2016-17 Effective for the batch Admitted in July 2014

Subject code 2CE601 Subject Name Theory of Computation

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 3 0 1 - 4 Theory 40 60 100

Hours 3 0 2 - 5 Practical 30 20 50

Pre-requisites:

Basic Understanding of Mathematics

Learning Outcome:

After successful completion of this course, student will be able to demonstrate advanced knowledge of formal computation and its relationship to languages. distinguish different computing languages and classify their respective types. recognize and comprehend formal reasoning about languages. show a competent understanding of the basic concepts of complexity theory.

Theory syllabus

Unit Content Hrs

1

Review of Mathematical Background: Sets, Functions, Logical statements, Proofs, Relations, Languages, The Principal of Mathematical induction, the strong principle of Mathematical induction, Recursive definitions, Structural Induction

06

2

Regular Languages And Finite Automata: Regular expressions, Regular languages, Memory required to recognize a language, Finite automata, Distinguishable strings, Union, intersection and complement of regular languages

08

3

Nondeterminism And Kleen’s Theorem: Non-deterministic finite automata, Non deterministic finite automata with ^ transitions, Kleen's theorem

05

4

Regular And Non Regular Language: Minimization of Finite automata, Non-regular and regular languages, Pumping Lemma, Decision problems and decision algorithms, Regular languages in relation to programming languages.

07

5

Context-Free Languages and Push-Down Automata: Context-free languages, Regular Grammars, Derivation tree and ambiguity, An Unambiguous CFG , Simplified and Normal forms, Chomsky normal form

07

6

Pushdown Automata and CFL: Push -Down Automata, Definition and examples, Deterministic PDA, Types of acceptances and their equivalence, Equivalence of CFG and PDA, Introduction to parsing, Top-down and bottom up parsing, Non-CFL and CFL, Pumping Lemma for CFL, Intersection and Complement of CFL

06

7

Turing Machine: Models of computation, TM definition, Combining TMs, Computing a function with TMs. Variations on Turing Machines, Doubly infinite and more than one Tapes, Non-deterministic and Universal TM

05

Practical content

Experiments/Practicals/Simulations would be carried out based on syllabus

Page 68: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

Text Books

1 Introduction to Languages and Theory of Computation: By John C. Martin

Reference Books

1 Computation: Finite and Infinite: By Marvin L. Minsky, Prentice-Hall, 1967

2 Introduction to formal languages: By G. E. Reevsz, Mc-graw hill.

3 Formal language theory: By M. H. Harrison

Page 69: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEERING& TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VI Version 2.0.0.0

Effective from Academic Year 2016-17 Effective for the batch Admitted in July 2014

Subject code 2CE602 Subject Name Software Engineering

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 3 0 1 - 4 Theory 40 60 100

Hours 3 0 2 - 5 Practical 30 20 50

Pre-requisites:

Object Oriented Analysis & Design

Learning Outcome:

After successful completion of this course, student will be able to

understand lifecycle for software development.

analyze the requirements systematically and develop the model using Unified Modeling language.

develop a quality software product through effective team-building, planning, scheduling and risk assessment.

Theory syllabus

Unit Content Hrs

1

Introduction to Software and Software Engineering: FAQ about Software Engineering ,Software characteristics ,The Changing Nature of Software, Software Myths

02

2

Process Models (Software Development Life Cycle): What is Software Process?, What is Software Development Life Cycle (SDLC)?,Prescriptive models, The water fall model (classical life cycle model), Incremental Process model, Evolutionary process model, The unified process

04

3

Building the Analysis Model: Requirement Analysis, Analysis Modeling Approaches, Data Modeling Concepts, Object Oriented Analysis, Scenario Based Modeling, Class Based Modeling, Crating a Behavioral Model, Flow Oriented Modeling Entity Relationship Diagram (E-R Diagram)

04

4 Requirements Analysis and Specification or Requirement Engineering: Requirement Engineering ,Requirement Elicitation, Requirement Analysis, Requirement Documentation (SRS) ,Requirement Gathering and Analysis, Software Requirement Engineering

04

5

Software Project Management: Introduction, Responsibility of Software Project Manager, Project Planning Activities, Project planning, SPMP Document, Metrics for Project Size Estimation ,Project Estimation Techniques, Scheduling

06

6

Coding and Testing: Coding Standards and Guidelines, Coding Review, What is Testing,Error- Faults-Failures ,Test cases, Test suites, Verification versus Validation, Design of Test Cases, Alpha and Beta Testing, Testing in Small and Testing in Large, Black Box Testing, White Box Testing (Structural Testing),Integration testing, System Testing

06

7 Software Design: Design Framework, Conceptual Design and Technical Design ,Quality Attributes (FURPS) (Hewlett – Packard),Modularity, Strategy of Design, Function Oriented Design, Object Oriented

04

Page 70: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

Design Approach (OOD)

8

Unified Modeling Language (UML): Overview of object oriented concepts, Advantage of OOD, Unified modeling language (UML), UML diagrams, Use Case Diagram, Class Diagram, Sequence, collaboration Diagram, Activity Diagram, State chart Diagram

02

9 Function oriented software design: Overview of SA/SD methodology Structured analysis, Data flow diagrams(DFDs),Structure design

04

10 Architectural design: Software architecture, Data design, Architectural styles and patterns, Architectural design 04

Practical content

Experiments/Practicals/Simulations would be carried out based on syllabus

Text Books

1 Software engineering a practitioner’s approach (7th edition) by Roger S. Pressman

Reference Books

1 Software Engineering (8th edition) by Sommerville

2 Fundamentals of Software Engineering (4th edition) by Rajib Mall

3 Fundamentals of Software Engineering (3rd edition) by K.K.Agrawal

4 Object – Oriented Modeling and Design with UML (2nd edition) by Rumbaugh, Blaha

Page 71: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VI Version 2.0.0.0

Effective from Academic Year 2016-17 Effective for the batch Admitted in July 2014

Subject code 2CE603 Subject Name Information System Security

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 3 0 1 - 4 Theory 40 60 100

Hours 3 0 2 - 5 Practical 30 20 50

Pre-requisites:

Computer Networks

Learning Outcome:

After successful completion of this course, student will be able to

list and briefly describe security risks and mitigation strategies for an organization that is about to connect its network to the Internet and communicate with other companies via email.

explain the differences between the three major goals of information security: confidentiality, integrity and availability, and can list and explain one technique for ensuring each.

explain how public key cryptography can be used to ensure the identity of the sender of an encrypted message.

Theory syllabus

Unit Content Hrs

1 Introduction: Security goals, attacks, Security services, security mechanisms

04

2 Cryptographic Mathematics: Modular arithmetic, linear congruence, Algebraic structure, checking of primeness, primality testing, Chinese remainder theorem, quadratic congruence

07

3 Classical Ciphers: Symmetric cipher model, substitution ciphers, transposition ciphers, steganography 06

4

Modern symmetric key ciphers: Modern block ciphers, modern stream ciphers, Data Encryption standard, advanced encryption standard, Electronic code book mode, CBC, cipher feedback mode, output feedback mode

07

5 Public key cryptography: RSA, RSA proof, RSA attacks, Rabin cryptosystem, Key management: Diffie Hellman 05

6

Message Authentication and Hash functions: Authentication requirements, functions, Message authentication codes (MAC), Hash functions, security of Hash functions

05

7 Hash algorithms: SHA- 512

03

8 Digital Signatures: Basics, digital signature standards 03

9 IP Security:

02

Practical content

Experiments/Practicals/Simulations would be carried out based on syllabus

Page 72: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

Text Books

1 William Stallings: “Cryptography and Network Security – Principles and Practice”, 4/E,PearsonEducation, 2005.

Reference Books

1 Bruce Scheneir: “Applied Cryptography”, 2/E, John Wiley, 1996

2 Behrouz Forouzan: “Cryptography & Network Security”, 1/E, TMH, 2007.

Page 73: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VI Version 2.0.0.0

Effective from Academic Year 2016-17 Effective for the batch Admitted in July 2014

Subject code 2CE604 Subject Name Application Development Lab

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 0 0 1 - 1 Theory - - -

Hours 0 0 2 - 2 Practical 30 20 50

Pre-requisites:

Understanding of Tools & Technology and Database Management System

Learning Outcome:

After successful completion of this course, student will be able to

develop an application using different technology

learn how to work in a team.

think and apply new ideas in developing an application.

Theory syllabus

-

Practical content

Unit Content Hrs

1

Students have to carry out an application development work under the guidance of faculty member using the knowledgeof subjects that he/she has learned up to 6thsemester. Students have to submit a report with code at the end of the semester

26

Page 74: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VI Version 2.0.0.0

Effective from Academic Year 2016-17 Effective for the batch Admitted in July 2014

Subject code 2CE605 Subject Name Mobile Application Development

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 3 0 1 - 4 Theory 40 60 100

Hours 3 0 2 - 5 Practical 30 20 50

Pre-requisites:

Object Oriented Programming

Learning Outcome:

After successful completion of this course, student will be able to

describeandroid and understand different versions of android.

explain concepts and theories of android’s various components and apply them to various situations in android application development.

work with Database, Google map, Menus etc.

Theory syllabus

Unit Content Hrs

1 Introduction to Android: History of Mobile Software Development, Open Handset Alliance, What is an Android, Difference between I-phone OS (apple) and Android OS,Define term HTML,XML and WML

03

2 Setting Up Your Android Development Environment: Configuring Your Development Environment, Difference between JVM and DVM, Android platform Architecture, Advantage of DVM over JVM, Android Emulator

02

3

Building your first Android Application: Creating and Configuring a New Android Project, Core Files and Directories of the Android Application, Creating an AVD for Your Project, Creating Launch Configurations for Your Project, Running Your Android Application in the Emulator, Debugging Your Android Application in the Emulator, Adding Logging Support to Your Android Application, Adding Some Media Support to Your Application, Adding Location-Based Services to Your Application, Debugging Your Application on the Hardware

02

4 Understanding the Anatomy of an Android Application: What is the meaning of an Anatomy? , Explain the activity with their states? , What are the methods used in android activity life cycle? , Explain the Android activity life cycle

03

5

Defining your Application using the Android Manifest file: Core files and Directories of the Android Application, What are the contents of the Android Manifest file? , How to edit the Android manifest file?, Registering Activities and Other in Application

03

6

Managing Application Resources: What Are Resources?, Storing Application Resources , Understanding the, Resource Directory Hierarchy, Resource Value Types, Setting Simple Resource Values Using Eclipse, Working with String, String Arrays, Boolean, Integer,Colors, Dimensions, Drawables, Images resources etc…, Working with Layouts, Using Layout Resources Programmatically

04

7 Exploring User Interface Screen Elements: Introducing the Android View, Android Control, Android Layout, Displaying Text to Users with TextView, Configuring Layout and Sizing, Using Buttons, Check Boxes, Radio Groups, spinner,

03

Page 75: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

ProgressBar etc.

8 Designing User Interfaces with Layouts: Creating User Interfaces in Android, Creating Layouts Using XML Resources and Programmatically, Scrollview, GridView, ListView, Spinner etc.

02

9 Drawing and Working with Animation: Design Working with Canvases and Paints, Drawing Ovals and Circles, Frame by frame & tween animation etc.

03

10 Explore Data Storage Techniques: Working with SharedPreferences, What is SQLite, features of SQLite, store data in SQLite 03

11 Explore Google Map: Feature of Google map, version of Google map APIs, integration of google map in android application

02

12 Working with other components: Use of TimePicker&DatePicker, Different Dialogboxs, Option menu & context menu, Send/read SMS, JSON & Application with JSON

03

13 IPhone OS: Introduction to iPhone Architecture, Essential COCOA TouchClasses, Interface Builder, Nib File, COCOA and MVC Framework, Overview of features of latest ios

06

Practical content

Experiments/Practicals/Simulations would be carried out based on syllabus

Text Books

1 Android Wireless Application Development, second edition by Shane Conder& Lauren Darcey. Pearson

Reference Books

1 Android Application Development (with Kitkat Support), Black Book by Pradeep Kothari-Dreamtech

2 Head First Android Development by Dawn Griffiths and David Griffiths- O'Reilly

3 Android Programming: The Big Nerd Ranch Guide, 2/e by Bill Phillips, Chris Stewart, Brian Hardy, Kristin Marsicano -Big Nerd Ranch Guides

4 Android Application Development in 24 Hours, 4/e by Carmen Delessio, Lauren Darcey, Shane Conder - Sams Teach Yourself

5 iPhone In Action, by Christopher Allen, Shannon Appelcline.

Page 76: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VI Version 2.0.0.0

Effective from Academic Year 2016-17 Effective for the batch Admitted in July 2014

Subject code 2CE606 Subject Name Microprocessor and Interfacing

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 3 0 1 - 4 Theory 40 60 100

Hours 3 0 2 - 5 Practical 30 20 50

Pre-requisites:

Computer Architecture

Learning Outcome:

After successful completion of this course, student will be able to:

understand and analyze various components of IT Infrastructure and emerging technologies used in business.

analyze how to develop and coordinate IT systems strategies, plans and management initiatives within small, medium and large corporate enterprises.

analyze the performance and operational excellence in business.

Study concerns in business like ethics, security, finance in corporate IT systems.

Theory syllabus

Unit Content Hrs

1

Introduction: Introduction to 8-bit and 16- bit microprocessors, internal architecture and pin diagram of 8085/8086 microprocessor, Minimum and maximum mode, IEEE Floating point representation Timing Diagrams, Read and write machine cycles, Address decoding, Even and Odd memory banks, accessing Memory and I/O ports.

07

2

Programming: Programmers model of 8085/86 - Addressing Modes, accessing data in the memory, instruction set, Instruction encoding format, Introduction to assembly language programming, Assembler, linker, Locator, debugger, emulator concepts. Assembler directives, 8086 programming examples to implement while - do, Repeat - Until, if-then-else constructs etc, String operations, Array, far and near procedures, macros. Timing and delay loops.

10

3

Interrupt Handling: Introduction to interrupt ,8086 interrupt structure, Interrupt Service Routine, Interrupt Vector Table (IVT) - location of IVT in the memory, contents of IVT, 8254 software programmable Timer/counter, 8259A priority interrupt controller, Hardware interrupts and Software interrupts, priority of 8086 interrupts. 8259A priority interrupt controller,

10

4

Microcontroller 8051 micro controller hardware, input/output pins , ports, ports and circuits, external memory, counters and timers, serial data i/o, interrupts.

06

5

8051 Instruction set and Programming External data moves, code memory read PUSH and POP op codes, data exchanges, Byte-level logical operations, bit-level logical operations, rotate and swap operations, Flags, incrementing and decrementing, addition, subtraction, multiplication and division, decimal arithmetic, Jump and call program range, jumps, calls and subroutines, interrupts and returns.

06

Practical content

Page 77: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

Experiments/Practicals/Simulations would be carried out based on syllabus

Text Books

1 D. Hall, "Microprocessors and Interfacing", 3’rd edition, 1992, McGraw-Hill, ISBN - 0 - 07 - 100462- 9.

Reference Books

1 Y. Liu, G. Gibson. “Microcomputer Systems: The 80867 8088 Family, Architecture, Programming and Design", 2nd Edition, Prentice-Hall of India, 1986, ISBN 0 -87692 - 409 7.

2 M. Rafiquzzaman, "Microprocessors - Theory and applications: Intel and Motorola", Revised edition, 2002, Prentice Hall, (Chapters 5. 7, 8) ISBN 81 - 203 - 0848 - 4P.

3 P. Abel, "Assembly Language Programming", 5th edition, Pearson Education, 2002, ISBN 81 - 203 -1037 - 3.

4 R. Denkon, "Advanced MS-DOS Programming", 2nd edition, BPB Publications, 2002, ISBN 81 -7029 - 485 - 1 (Chapters 2, 3, 4, 14).

5 The 8051 Microcontroller and Embedded Systems By Mazidi&Mazidi (PHI)

Page 78: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VI Version 2.0.0.0

Effective from Academic Year 2016-17 Effective for the batch Admitted in July 2014

Subject code 2CE607 Subject Name Network Programming

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 3 0 1 - 4 Theory 40 60 100

Hours 3 0 2 - 5 Practical 30 20 50

Pre-requisites:

Computer Networks

Learning Outcome:

After successful completion of this course, student will be able to

demonstrate advanced knowledge of networking.

make use of various solutions to perform inter-process communications.

demonstrate knowledge of protocols and languages used in Web and multimedia delivery.

demonstrate advanced knowledge of programming for network communications.

describe major technologies used in network communications

Theory syllabus

Unit Content Hrs

1 Introduction: The OSI Model and the TCP/IP Protocol Suite, Underlying Technologies

03

2

IP Addresses: Classful Addressing, Classless Addressing, Delivery, Forwarding, and Routing of IP Packets,ARP and RARP, Internet Protocol (IP), Internet Control Message Protocol (ICMP), Internet Group Management Protocol (IGMP), User Datagram Protocol (UDP), Transmission Control Protocol (TCP), Stream Control Transmission Protocol (SCTP)

06

3 Unicast Routing Protocols: RIP, OSPF, and BGP 05

4 Multicasting and Multicast Routing Protocols, Host Configuration: BOOTP and DHCP 04

5 Domain Name System (DNS): 02

6 Remote Login: TELNET

03

7 File Transfer: FTP and TFTP 04

8 Electronic Mail: SMTP, POP, and IMAP 06

9 Network Management: SNMP 05

10 World Wide Web: HTTP 04

Practical content

Experiments/Practicals/Simulations would be carried out based on syllabus

Page 79: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

Text Books

1 TCP/IP Protocol Suite, 3/e By Behrouz Forouzan, Tata-mc-graw hill.

Reference Books

1 TCP/IP Illustrated, Volume I By W. Richard Stevens, Low Price Edition

2 Internetworking with tcp/ip: principles, protocols, and architecture vol. I By comer, douglas

Page 80: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VI Version 2.0.0.0

Effective from Academic Year 2016-17 Effective for the batch Admitted in July 2014

Subject code 2CE608 Subject Name Computer Graphics

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 3 0 1 - 4 Theory 40 60 100

Hours 3 0 2 - 5 Practical 30 20 50

Pre-requisites:

Computer Programming

Learning Outcome:

After successful completion of this course, student will be able to

know application of Computer Graphics in various fields.

use the underlying algorithms, mathematical concepts, supporting computer graphicsand fill the color inside the object.

explain about how picture is display and produce color picture on the display device.

able to apply 2D – 3D alteration on the objects and perform clipping on object.

Theory syllabus

Unit Content Hrs

1 Introduction: What is Computer Graphics? Application of Computer Graphics 01

2 Overview of Graphics System: Video Display Devices, Raster Scan System, Random Scan System 03

3 Output Primitives: Points and Lines, DDA Algorithm, Bresenham’s Line Algorithm, Midpoint Circle Algorithm, Midpoint Ellipse Algorithm, Boundary fill algorithm, Flood fill algorithm

07

4

2 D Geometric Transformations: Basic Transformations, Matrix Representation and Homogeneous Coordinates, Composite Transformation, Reflection, Shear, Transformation between Coordinate System, Raster Methods for Transformation

08

5 D Viewing: Window-to-View port Coordinate Transformation, Line Clipping Algorithms, Curve Clipping Text Clipping, Exterior Clipping

05

6 3 D Concepts: Parallel Projection, Perspective Projection, Depth Cueing, Surface Rendering, Three-Dimensional and Stereoscopic Views

01

7 3 D Geometric Transformation: Translation, Rotation, Scaling, Reflection, Shears, Composite Transformations 05

8 Color models: Properties of light, XYZ, RGB, YIQ and CMY Color models, Conversion between color models 04

9 Advanced topics: Antialiasing, Visible surface detection concepts, back-face detection, depth buffer method illumination methods (ambient, diffuse reflection, specular reflection), Computer Animation

08

Practical content

Experiments/Practicals/Simulations would be carried out based on syllabus

Page 81: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

Text Books

1 Computer Graphics C version By Donald Hearn and M.Pauline Baker

Reference Books

1 Computer Graphics By ZhigangXizng and Roy Plastock

2 Graphics: Principles And Practice. By J.Foley, A. Van Dam, S. Feiner, and J. Hughes

Page 82: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VI Version 2.0.0.0

Effective from Academic Year 2016-17 Effective for the batch Admitted in July 2014

Subject code 2CE609 Subject Name Cloud Computing

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 3 0 1 - 4 Theory 40 60 100

Hours 3 0 2 - 5 Practical 30 20 50

Pre-requisites:

Computer Networks

Learning Outcome:

At the end of the course, students will have achieved the following learning objectives.

understand the hardware, software concepts and architecture of cloud computing.

realize the importance ofCloud Virtualization, Abstractions and Enabling Technologies.

explore the Programming for Applications on Cloud.

Theory syllabus

Unit Content Hrs

1

Introduction: Cloud Computing, Layers and Types of Clouds, Cloud Infrastructure Management, Challenges and Applications. Virtualization: Virtualization of Computing, Storage and Resources. Cloud Services: Introduction to Cloud Services IaaS, PaaS and SaaS

08

2

Software as a Service (SaaS): Evolution of SaaS, Challenges of SaaS Paradigm, SaaS Integration Services, SaaS Integration of Products and Platforms.Infrastructure As a Services (IaaS): Introduction, Background & Related Work, Virtual Machines Provisioning and Manageability, Virtual Machine Migration Services, VM Provisioning and Migration in Action. Platform As a service (PaaS): Integration of Private and Public Cloud,Technologies and Tools for Cloud Computing, Resource Provisioning services

09

3

MapReduce Programming models and Implementations: Introduction, Map Reduce Programming Model, Major Map Reduce Implementations for the Cloud, Map Reduce Impacts.Migrating into a Cloud: Cloud Services for Individuals, CloudServices Aimed at the Mid- Market, Enterprise Class Cloud Offering, Introduction to File System & Hadoop

07

4 Management and Monitoring: Accounts Monitoring, User profiles in Cloud, Resource Allocation and Pricing in Cloud 04

5

Security: Introduction, Cloud Storage: from LANs to WANs, Technologies for Data Security in Cloud Computing, Security Concerns, Legal issues and Aspects, Securing the Private and Public Cloud Architecture

04

6 Cloud Middleware: OpenStack, Eucaluptus, Windows Azure, CloudSim, EyeOs, Aneka, Google App Engine

08

Practical content

Experiments/Practicals/Simulations would be carried out based on syllabus

Page 83: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

Text Books

1 RajkumarBuyya, James Broberg, Andrzej M Goscinski, Cloud Computing: Principles and Paradigms, Wiley publication

2 Toby Velte, Anthony Velte, Cloud Computing: A Practical Approach, McGraw-Hill Osborne Media.

Reference Books

1 George Reese, Cloud Application Architectures: Building Applications and Infrastructure in the Cloud, O'Reilly Publication

2 John Rhoton, Cloud Computing Explained: Implementation Handbook for Enterprises, Recursive Press

Page 84: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEEIRNG AND TECHNOLOGY Programme Bachelor of Technology Branch/Spec. ALL

Semester VI Version 2.0.0.0

Effective from Academic Year 2016-17 Effective for the batch Admitted in June 2016

Subject code 2HS601 Subject Name Aptitude skill building II

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit - - 1 1 Theory - - -

Hours - - 2 2 Practical 25 25 50

Pre-requisites:

Basic engineering mathematics and English

Learning Outcome:

After learning this course each student would be able to:

Understand and develop more skills that are required to solve fundamental practical problems related to maths

Acquire satisfactory competency in use of two advanced skills (Quantitative Ability and Logical Reasoning).

Solve campus placements and various competitive aptitude papers covering Quantitative Ability and Logical reasoning

Syllabus

Unit Content Hrs

1 Quantitative ability I: Averages, weighted averages, median and mode, standard deviation, permutation and combination, probability

06

2 Quantitative ability II: Simple Interest, Compound Interest, Profit and Loss and discount,area and volume of polygon, cylinders and all other geometry, coordinate and mixed geometry

06

3 Verbal Reasoning: Vocabulary, sentence equivalence, Logic based Reading comprehensive, multiple blank text completion

06

4 Logical Reasoning: Analysing Arguments, Statement and Assumption, Course of Action, Statement and Conclusion, Theme Detection, Cause and Effect, Statement and Argument, Logical Deduction

05

5 Date interpretation: Pie Charts, Line Charts, Table Charts, Bar Charts

05

Text Books

1. Aggrawal R.S., “Quantitative Aptitude for Competitive Examinations”, S Chand,20th edition (2013)

2. Sharma Arun, “How to Prepare for Verbal Ability and Reading Comprehension for CAT”, McGraw Hill Education (India) Private Limited; 2014 edition (2014)

Reference Books

1. GuhaAbhijit, “Quantitative Aptitude for Competitive Examination”, McGraw Hill Education India Private Limited, 5th edition (2014)

Page 85: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

2. Aggrawal R.S., “A Modern Approach to Logical Reasoning”,S Chand, 1st edition (2007)

3. Kumar Ajay, Kumar Anand, “General Aptitude Theory and Practice”, Pathfinder Publication, 2016 edition (2016)

4. GKP, “GATE Engineering & Mathematics General Apptitude 2016”, G.K. PUB, 12th edition (2015)

5. Lewis Norman, “Word Power Made Easy”, Goyal, Reprint edition (2011)

6. Anderson Marilyn, “Critical Thinking, Academic Writing and Presentation Skills: Mg University Edition”, Pearson Education; 1st edition (2010)

7. Grockit, “Grockit 1600+ Practice Questions for the GRE: Book + Online (Grockit Test Prep)”, Kaplan Publishing; Pap/Psc edition (2015)

Page 86: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VII Version 2.0.0.0

Effective from Academic Year 2017-18 Effective for the batch Admitted in July 2014

Subject code 2CE701 Subject Name Compiler Design

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 3 0 1 - 4 Theory 40 60 100

Hours 3 0 2 - 5 Practical 30 20 50

Pre-requisites:

Regular expression, finite automata, grammar, context free grammar

Learning Outcome:

Upon successful completion of the course, the student should be able to:

Perform lexical analysis and various parsing techniques.

Construct compiler Theory syllabus

Unit Content Hrs

1. 1 Introduction: Introduction to translators- Assembler, Compiler, Interpreter, Difference between Compiler and Interpreter, Linker, Loader , one pass compiler, multi pass compiler, cross compiler , The components of Compiler, Stages of Compiler: Front end, Back end, Qualities of Good Compiler

8

2. 2 Lexical Analysis: The Role of the Lexical Analyzer, Specification of Lexemes, Tokens and pattern. Recognition of Tokens

4

3. Syntax Analysis: The Role of the Parser, Types of grammar, CFG, Left most derivation , Right most derivation, Parse Tree, Restriction on CFG, Ambiguous grammar, Top-Down Parsing, Issues of CFG, Recursive Decent Parser, Construction of Predictive Parsing Table , LL (1) Grammar, String Parsing using M-Table, Bottom-Up Parsing: Handle, Shift-reduce parser, LR parsers: LR (0), SLR (1), LALR (1), CLR (1), String parsing procedure using LR parser, R-R and S-R Conflicts

12

4. Syntax-Directed Translation: Syntax Directed Definitions, construction of syntax tree, L-Attributed Definitions, Bottom up evaluation of S-attribute definition

5

5. 3 Intermediate Code Generation: Implementation of Three Address Code, Intermediate code for all constructs of programming languages (expressions, if-else, loops, switch case etc.)

4

6. 4 Code Optimization: Introduction, Optimization of Basic Blocks, Loop Optimization Techniques 4

7. Code Generation: Introduction to Code Generation, Machine architecture currently in use, Major issues of code generations

4

8. 6 Error Detection and Recovery: Functions of error handler, Classification of Errors: Run time error & Compile time error: Lexical , Syntax & Semantic phase error

4

Practical content

Experiments/Simulation would be carried out based on the Syllabus

Text Books

1. Compilers: Principles, Techniques and Tools By Aho, Sethi, and Ullman, Addison-Wesley, 1986

Reference Books

1. 1 Concept of Compiler Design, By Adesh K. Pandey

2. Compiler Design By O G Kakade, 4th Edition

Page 87: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VII Version 2.0.0.0

Effective from Academic Year 2017-18 Effective for the batch Admitted in July 2014

Subject code 2CE702 Subject Name Artificial Intelligence

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 3 0 1 - 4 Theory 40 60 100

Hours 3 0 2 - 5 Practical 30 20 50

Pre-requisites:

Basics of Programming Language and Algorithms

Learning Outcome:

Upon successful completion of the course, the student should be able to:

Identify problems those are amenable to solution by AI methods and which AI methods may be suited to solving given problems.

Implement various AI Algorithms.

Theory syllabus

Unit Content Hrs

1. 1 Introduction of AI 3

2. 2 Problems and Problem Spaces & Search: AI Problems, Underlying Assumptions, The Level Of the Model, Criteria for success, Defining the Problem as State Space Search, Production Systems, Problem Characteristics, Issues in the Design of Search Programs, Problems

4

3. Heuristic Search Techniques Generate & Test, Hill Climbing, Best First Search, Problem Reduction, Constraint Satisfaction, Means-Ends Analysis

7

4. Game Playing Mini-Max Search Procedure, Alpha-Beta Pruning

2

5. 3 Expert System Architecture & Tools: Introduction, Rule Based System Architecture, Nonproduction System Architecture, Dealing with Uncertainty, Knowledge Acquisition & Validation, System Building Tools

4

6. 4 Languages For AI Problems Prolog

3

7. Probabilistic Reasoning: Fuzzy Logic

3

8. 6 Artificial Neural Networks Biological Motivation, Neural Network Representation, Appropriate Problems for Neural Network Learning, Perceptron

6

9. Supervised Learning Decision Tree, Bayesian Decision Theory

4

10. Unsupervised Learning Clustering, Nonparametric Methods

5

11. Evolutionary computing Different Genetic Algorithms And Its Applications, Genetic Programming

4

Practical content

Experiments/Simulation would be carried out based on the Syllabus

Text Books

1. Artificial Intelligence, By Rich E. & Kevin Knight, Tata McGraw Hill.

Page 88: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

Reference Books

1. 1 Machine Learning, By Tom M. Mitchell, Tata McGraw-Hill.

2. Genetic Algorithms in Search, Optimization, and Machine Learning, D. E. Goldberg, Addison-Wesley.

3. Neural Networks: A Comprehensive Foundation, S. Haykin, PHI.

4. Introduction to Turbo Prolog, Townsend, Carl.

Page 89: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VII Version 2.0.0.0

Effective from Academic Year 2017-18 Effective for the batch Admitted in July 2014

Subject code 2CE703 Subject Name Minor Project

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit - - 4 - 4 Theory - - -

Hours - - 8 - 8 Practical 60 40 100

Pre-requisites:

Understanding of Tools & Technology and Database Management System

Learning Outcome:

After successful completion of this course, student will be able to

Develop an application using different technology

Learn how to work in a team.

Think and apply new ideas in developing a project. Practical content

Sr. No.

Content

1 Students have to carry out an project development work under the guidance of faculty member using the knowledge of subjects that he/she has learned up to 6th semester. Students have to submit a report with code at the end of the semester

Page 90: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VII Version 2.0.0.0

Effective from Academic Year 2017-18 Effective for the batch Admitted in July 2014

Subject code 2CE704 Subject Name Fundamentals of Image Processing

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 3 0 1 - 4 Theory 40 60 100

Hours 3 0 2 - 5 Practical 30 20 50

Pre-requisites:

Back ground of computer programming and Algorithms

Learning Outcome:

Upon successful completion of the course, the student should be able to:

Understand the fundamental concepts of image processing

Perform image enhancement and restoration

Apply the concepts of image segmentation

Theory syllabus

Unit Content Hrs

1. 1 Introduction: Overview, examples of fields that use Digital Image Processing, fundamental steps in Digital Image Processing, components of an Image Processing System.

05

2. 2 Digital Image Fundamentals: Elements of visual perception, light and the electromagnetic spectrum, image sensing and acquisition, image sampling and quantization, basic relationships between Pixels, linear and nonlinear operations.

07

3. Image Enhancement in the Spatial Domain: Background, some basic gray level transformations, histogram processing, enhancement using arithmetic/logic operations, basics of spatial filtering, smoothing spatial filters, sharpening spatial filters, combining spatial enhancement methods.

12

4. Introduction to Image Restoration: Image degradation/restoration model, noise models 05

5. 3 Morphological Image Processing: Preliminaries, dilation and erosion, opening and closing, the Hit-or-Miss transformation, some basic morphological algorithms.

05

6. 4 Image Segmentation: Detection of discontinuities, edge linking and boundary detection, thresholding, region-based segmentation.

06

7. Representation and Description: Representation, boundary descriptors, regional descriptors 05

Practical content

Experiments/Simulation would be carried out based on the Syllabus

Text Books

1. Digital Image Processing By Rafael C. Gonzalez and Richard E. Woods.

Reference Books

1. 1 Digital Image processing By S. Sridhar, (Oxford University Press)

2. Fundamental of Image Processing by Anil K. Jain

Page 91: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VII Version 2.0.0.0

Effective from Academic Year 2017-18 Effective for the batch Admitted in July 2014

Subject code 2CE705 Subject Name Internet of Things

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 3 0 1 - 4 Theory 40 60 100

Hours 3 0 2 - 5 Practical 30 20 50

Pre-requisites:

Fundamentals of computer network, wireless sensor network, communication & internet technology, web technology, information security

Learning Outcome:

After successful completion of this course, student will be able to

Use of Devices, Gateways and Data Management in IoT.

Applications of IoT in Industrial Automation and Real World. Theory syllabus

Unit Content Hrs

1. 1 Overview and Introduction : Internet of Things (IoT) and Web of Things (WoT): What's WoT?, The Internet of Things Today, Time for Convergence, Towards the IoT Universe, Internet, of Things Vision, IoT Strategic Research and Innovation Directions, IoT Applications, Future Internet Technologies, Infrastructure, Networks and Communication, Processes, Data Management, Security, Privacy & Trust, Device Level Energy Issues, IoT Related Standardization, Recommendations on Research Topics.

10

2. 2 M2M to IoT – A Basic Perspective: Introduction, Some Definitions, M2M Value Chains, IoT Value Chains, An emerging industrial structure for IoT, The international driven, global value chain and global information monopolies.

05

3. M2M to IoT-An Architectural Overview: Building architecture, Main design, principles and needed capabilities, An IoT architecture outline, standards considerations.

06

4. IoT Architecture -State of the Art: Introduction, State of the art, Architecture Reference Model- Introduction, Reference Model and architecture, IoT reference Model, IoT Reference Architecture- Introduction, Functional View, Information View, Deployment and Operational View, Other Relevant architectural views.

09

5. 3 IoT Applications for Value Creations: Introduction, IoT applications for industry: Future Factory Concepts, Brownfield IoT, Smart Objects, Smart Applications, Four Aspects in your Business to Master IoT, Value, Creation from Big Data and Serialization, IoT for Retailing Industry, IoT For Oil and Gas, Industry, Opinions on IoT Application and Value for Industry, Home Management, eHealth.

07

6. 4 Internet of Things Privacy, Security and Governance: Introduction, Overview of Governance, Privacy and Security Issues, Contribution from FP7 Projects, Security, Privacy and Trust in IoT-Data-Platforms for Smart Cities, First Steps Towards a Secure Platform, Smartie Approach.

08

Practical content

Experiments/Practical’s/Simulations would be carried out based on syllabus

Page 92: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

Text Books

1. From Machine-to-Machine to the Internet of Things: Introduction to a New Age of Intelligence: By Jan Holler, Vlasios Tsiatsis, Catherine Mulligan, Stefan Avesand, Stamatis Karnouskos, David Boyle, 1st Edition, Academic Press, 2014.

Reference Books

1. 1 Internet of Things (A Hands-on-Approach), by Vijay Madisetti and Arshdeep Bahga, 1st Edition, VPT, 2014.

2. Getting Started with the Internet of Things: by Cuno Pfister, O‟Reilly Media, 2011

3. Rethinking the Internet of Things: A Scalable Approach to Connecting Everything, by Francis daCosta, 1st Edition, Apress Publications, 2013

Page 93: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VII Version 2.0.0.0

Effective from Academic Year 2017-18 Effective for the batch Admitted in July 2014

Subject code 2CE706 Subject Name Mobile Computing

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 3 0 1 - 4 Theory 40 60 100

Hours 3 0 2 - 5 Practical 30 20 50

Pre-requisites:

Computer Networks

Learning Outcome:

Upon successful completion of the course, the student should be able to:

Understand mobile adhoc network, wireless network and cellular network

Theory syllabus

Unit Content Hrs

1. 1 Introduction: Challenges in mobile computing, coping with uncertainties, resource poorness, bandwidth, etc. Cellular architecture, co-channel interference, frequency reuse, capacity increase by cell splitting. Evolution of mobile system: CDMA, FDMA, TDMA, GSM, Introduction to 3G and 4G Standards.

12

2. 2 Mobility Management: Cellular architecture, Co-channel interference, Mobility: handoff, types of handoffs; location management, HLR-VLR scheme, hierarchical scheme, predictive location management schemes. Mobile IP, cellular IP.

10

3. Publishing & Accessing Data In Air: Pull and push based data delivery models, data dissemination by broadcast, broadcast disks, directory service in air, and energy efficient indexing scheme for push based data delivery.

06

4. Ad hoc Network Routing Protocols: Ad hoc network routing protocols, destination sequenced distance vector algorithm, cluster based gateway switch routing, global state routing, dynamic source routing, ad hoc on-demand routing, location aided routing, zonal routing algorithm.

12

5. 3 Mobile Transaction and m-Commerce: Models for mobile transaction, Recovery model for mobile transactions. Electronic payment and protocols for mobile commerce

05

Practical content

Experiments/Practical’s/Simulations would be carried out based on syllabus

Text Books

1. Mobile Computing By Talukder and Yavagal, Tata McGraw Hill

Text Books

1. Mobile Communication By J.Schiller

Page 94: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Information Technology

Semester VII Version 2.0.0.0

Effective from Academic Year 2017-18 Effective for the batch Admitted in July 2014

Subject code 2CE707 Subject Name Machine Learning

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 3 0 1 - 4 Theory 40 60 100

Hours 3 0 2 - 5 Practical 30 20 50

Pre-requisites:

Back ground of Mathematics and Programming

Learning Outcome:

Upon successful completion of the course, the student should be able to:

Understand the fundamental issues and challenges of machine learning.

Understand the strengths and weaknesses of many popular machine learning approaches.

Theory syllabus

Unit Content Hrs

1. 1 Introduction of Machine Learning

Basic definitions, types of learning, Parameter Learning, hypothesis space and inductive bias, evaluation, cross-validation

05

2. 2 Classification and Regression Classification, Hypothesis Representation, Decision Boundary, Linear and Logistic Regression, Multiclass classification

05

3. Neural Network Introduction, Application, Perceptron, Single layer Network, multi-layer network, backpropagation, introduction to deep neural network

06

4. Generative Models Probability, Bayes Rule, Naïve Bayes, MAP and Bayesian learning

04

5. 3 Evaluating a Learning Algorithm 04

6. 4 Support Vector Machines and Kernel Methods 05

7. Unsupervised Learning: Introduction, Clustering, K-means Algorithm, Optimization Objective,

Random Initialization, Adaptive hierarchical clustering

04

8. 6 Supervised Learning: Decision Tree, Bayesian Decision Theory 04

9. Density Estimation: Problem Motivation, Gaussian Distribution 04

10. Evolutionary computing Different Genetic Algorithms And Its Applications, Genetic Programming

04

Practical content

Experiments/Practical’s/Simulations would be carried out based on syllabus

Text Books

1. Understanding Machine Learning: From Theory to Algorithms, Shai Shalev-Shwartz and Shai Ben-David, Published 2014 by Cambridge University Press.

Reference Books

1. 1 Classification and regression trees, Leo Breiman, Wadsworth International Group, 1984

2. Machine Learning, By Tom M. Mitchell, Tata McGraw-Hill

3. Genetic Algorithms in Search, Optimization, and Machine Learning, D. E. Goldberg, Addison-Wesley

4. Neural Networks: A Comprehensive Foundation, S. Haykin, PHI

Page 95: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VII Version 2.0.0.0

Effective from Academic Year 2017-18 Effective for the batch Admitted in July 2014

Subject code 2CE708 Subject Name Parallel Processing & Architecture

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 3 0 1 - 4 Theory 40 60 100

Hours 3 0 2 - 5 Practical 30 20 50

Pre-requisites:

Back ground of Computer Fundamentals and Programming. Learning Outcome:

Upon successful completion of the course, the student should be able to:

Describe different parallel processing architectures based on relationships between processing elements, instruction sequence, memory and interconnected network.

Identify algorithms, which require parallelization as part of system design or performance enhancement.

Design and develop parallel algorithms for shared and distributed memory models.

Theory syllabus

Unit Content Hrs

1. 1 Introduction: Von Neumann architecture, Why do we need high speed computing? How do we increase the speed of computers? Some interesting features of parallel computers.

03

2. 2 Solving Problems in Parallel: Temporal parallelism, Data Parallelism, Combined temporal and data parallelism, Data parallelism with dynamic assignment, Data parallelism with quasi-dynamic assignment, Comparison of Temporal and Data Parallel Processing.

04

3. Instruction level Parallel Processing: Pipelining of Processing Elements, Delays in Pipeline Execution, Delay due to resource constraints, Delay due to data dependency, Pipeline delay due to branch instructions, Hardware modification to reduce delay due to branches, software modification to reduce delay due to branches, Difficulties in Pipelining

04

4. Parallel Algorithms: Models of Computation, random access machine, parallel random access machine, Interconnection networks, combinational circuits, Analysis of Parallel Algorithms, Running time, Number of processors and cost

03

5. 3 Introduction to Parallel Processing: Architectural Classification schemes, Multiplicity of instruction – data stream, Serial versus parallel processing, Parallelism versus pipelining, Parallel Processing Applications

03

6. 4 Principles of Pipelining and Vector Processing: Principles of designing Pipeline Processors, Instruction prefetch and branch handling, Data buffering and busing structures, Internal forwarding and register tagging, Hazard detection and resolution.

04

7. Structures and Algorithms for Array Processors: SIMD Array Processors, SIMD computer organization, Masking and data routing mechanisms, Inter PE communications, SIMD Interconnection Networks, Static versus dynamic networks, Mesh connected Iliac network

04

8. 6 Multiprocessor Architecture and Programming: Multiprocessor Operating Systems, Classification of Multiprocessor operating systems, Software requirements for Multiprocessors, Operating system requirements.

03

9. Processes, Shared Memory and Simple Parallel Programs: Introduction, Processes and processors, Shared memory–1, Forking-Creating Processes, Shared memory-2, Processes are randomly scheduled – Contention

03

10. Basic Parallel Programming Techniques: Introduction, Loop splitting, Ideal speedup, Spin-locks, Contention and Self-scheduling, Histogram.

04

Page 96: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

11. Barriers and Race Conditions: Introduction, The Barrier Calls, Expression splitting. 04

12. Introduction to scheduling – Nested loops: Introduction, Variations on loop splitting, Variation on self – scheduling, Indirect scheduling.

03

13. Overcoming Data Dependencies: Introduction, Induction variable, Forward dependency, Block scheduling and forward dependency, Backward dependency, Split table loops, Special scheduling – Assign based on condition.

03

Practical content

Experiments/simulation based on the syllabus.

Text Books

1. Computer Architecture and Parallel Processing -By Kai Hwang, McGraw Hill International Edition

Reference Books

1. 1 Parallel Computers – Architecture and Programming -By V. Rajaraman and C. Siva Ram Murthy, PHI Publication

2. Introduction to Parallel Programming -By Steven Brawer, Academic Press Inc.

3. Computer Architecture and Organization -By Hayes, Tata McGraw Hill

4. \ Computer Organization and Architecture -By Stallings, Pearson Publication

Page 97: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VII Version 2.0.0.0

Effective from Academic Year 2017-18 Effective for the batch Admitted in July 2014

Subject code 2CE709 Subject Name Big data Analytics

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 3 0 1 - 4 Theory 40 60 100

Hours 3 0 2 - 5 Practical 30 20 50

Pre-requisites:

Fundamentals of Mathematics and SQL

Learning Outcome:

Upon successful completion of the course, the student should be able to:

Identify and distinguish big data analytics applications

Describe big data analytics tools

Explain big data analytics techniques

Present cases involving big data analytics in solving practical problems

Theory syllabus

Unit Content Hrs

1. 1 Introduction To Big Data Introduction– distributed file system–Big Data and its importance, Four Vs, Drivers for Big data, Big data analytics, and Big data applications. Algorithms using map reduce.

07

2. 2 Big Analytic Tools And Techniques Big Data – Apache Hadoop & Hadoop EcoSystem, Moving Data in and out of Hadoop – Understanding inputs and outputs of MapReduce -, Data Serialization, Introduction to Data Analysis with Spark.

12

3. HDFS, HIVE AND HIVEQL, HBASE HDFS-Overview, Installation and Shell, Java API; Hive Architecture and Installation, Comparison with Traditional Database, HiveQL Querying Data, Sorting And Aggregating, Map Reduce Scripts, Joins & Sub queries, HBase concepts, Advanced Usage, Schema Design, Advance Indexing, PIG, Zookeeper , how it helps in monitoring a cluster, HBase uses Zookeeper and how to Build Applications with Zookeeper.

12

4. NoSQL What is it?, Where It is Used Types of NoSQL databases, Why NoSQL?, Advantages of NoSQL, Use of NoSQL in Industry, SQL vs NoSQL, NewSQL

08

5. 3 Case Studies 06

Practical content

Experiments/simulation based on the syllabus.

Text Books

1. Big Data and Analytics by Seema Acharya,Subhashini Chellappan,Paperback,2015.

Reference Books

1. 1 Anand Rajaraman and Jeffrey David Ullman, Mining of Massive Datasets, Cambridge University Press, 2011. Ron Bekkerman, Mikhail Bilenko and John Langford, Scaling up Machine Learning: Parallel and Distributed Approaches, Cambridge University Press, 2011.

2. Tom White, Hadoop: The Definitive Guide, O‟Reilly Media, Third Edition, 2012.

3. Bill Franks, Taming The Big Data Tidal Wave: Finding Opportunities in Huge Data Streams with Advanced Analytics, Wiley, 2012.

4. Michael Minelli, Michele Chambers, and Ambiga Dhiraj, Big Data, Big Analytics: Emerging Business Intelligence and Analytic Trends for Today's Businesses, Wiley, 2013.

5. Frank J. Ohlhorst, Big Data Analytics: Turning Big Data into Big Money, Wiley, 2012.

Page 98: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VII Version 2.0.0.0

Effective from Academic Year 2017-18 Effective for the batch Admitted in July 2014

Subject code 2CE710 Subject Name Public Key Infrastructure

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 3 0 1 - 4 Theory 40 60 100

Hours 3 0 2 - 5 Practical 30 20 50

Pre-requisites:

Cryptography, Network Security

Learning Outcome:

Upon successful completion of the course, the student should be able to:

Understand public key infrastructures

Understand centralized and decentralized infrastructure

Understand concept of digital certificates

Learn various secured services provided by internet

Theory syllabus

Unit Content Hrs

1. 1 Cryptography Basics 03

2. 2 Public Key Infrastructure: Introduction, Components of PKI, CA Functions, Digital Certificate, Certificate Management, Private Key Management, Public Key Cryptography Standards

06

3. PKI Architecture: Introduction, Types of PKI Architecture: Single CA Architecture (Basic Trust List Model, Certificate Path Construction in a Single CA and Basic Trust List Architecture ), Enterprise PKI Architecture, Hierarchical PKI Architecture (Certificate Path Construction in a Hierarchical PKI Architecture), Mesh PKI Architecture(Certificate Path Construction in a Mesh PKI Architecture), Hybrid PKI Architecture (Certificate Path Construction in a Bridge PKI Architecture)

06

4. Internet Security Protocols: Introduction, Basic Concepts, Secure Socket Layer ,Secure Electronic Transaction, SSL Vs. SET, 3-D Secure Protocol, Email Security: PEM,PGP,S/MIME

07

5. 3 User-Authentication Mechanisms: Authentication Basics ,Passwords, Authentication Tokens, Certificate Based Authentication Biometric Authentication, Kerberos; Entity Authentication mechanism: Challenge response Protocol, Zero knowledge protocol

06

6. 4 Digital Signature, Message Digest Algorithm – MD5 05

7. Symmetric Key Algorithm: Advanced Encryption Standard (AES) 03

8. 6 Asymmetric Key Algorithm: Knapsack Algorithm, Elgamal Crypto System 04

9. Key Management: Introduction, Key Distribution Center (KDC), A Simple Protocol using KDC, Needham–Schroeder Symmetric Key Protocol, Otway-Rees Protocol

05

Practical content

Experiments/simulation based on the syllabus.

Text Books

1. Public Key Infrastructure Implementation and Design By Suranjan Choudhury, Kartik Bhatnagar, and Wasim Haque

Reference Books

1. 1 Cryptography and Network Security By Atul Kahate (3rd Edition)

2. Cryptography and Network Security By Forouzan

Page 99: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VII Version 2.0.0.0

Effective from Academic Year 2017-18 Effective for the batch Admitted in July 2014

Subject code 2CE711 Subject Name Data Mining and Data Warehousing

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit 3 0 1 - 4 Theory 40 60 100

Hours 3 0 2 - 5 Practical 30 20 50

Pre-requisites:

Basics of database and data warehouse

Learning Outcome:

Upon successful completion of the course, the student should be able to:

Understand the difference between database and data warehouse

Learn how to pre-process data before applying data mining techniques

Able to Choose the data-mining task (classification, regression, clustering, Association Rules etc.).

Understand mathematical foundations of data mining tools

Interpret the results produced by data mining

Theory syllabus

Unit Content Hrs

1. 1 Introduction: Basics of data mining, related concepts, Data mining techniques. 06

2. 2 Data Pre-Processing: Handling noise & outliers - Integration, Discretization, Smoothing, Transformation, 3-4-5 rule etc.

06

3. Association Rule Mining: Support & Confidence heuristic, Apriori algorithm, Enhancement to Apriori (DIC, Hashing, Partitioning, Sampling etc), FP-Tree & FP-Growth algorithm, Criticize to Support & Confidence, Interest & Lift, Extended association rule mining (Hierarchical, Multimedia, Text, Quantitative etc)

06

4. Clustering: Cluster Analysis, Types of Data in Cluster Analysis, Interval-Scaled Variables, Categorical, Ordinal, and Ratio-Scaled Variables, Categorization of Major Clustering Methods, Partitioning Methods, Hierarchical Methods, Density-Based Methods

10

5. 3 Classification: Decision Tree Classification, Info-Gain criteria to select best split, Naive Bayes Classifier, Precision & Recall evaluating performance of classifier accuracy, Confusion matrix for evaluating performance of classifier accuracy, Correlation analysis, Chi-square statistic

06

6. 4 Web Mining: Introduction to Web Mining, Web content mining, - Web usage mining, - Web Structure mining, Web log structure and issues regarding web logs

05

7. 6 Data Warehousing: OLAP & OLTP, Data warehouse & Data mart, OLAM architecture, Extraction, Transform & Loading (ETL) concept for generic, two-tier, three -tier architecture, Data warehousing schema - Star, Snowflake, Fact Constellation (Galaxy) - Data Cube , Operations on Data cube (slicing, roll up, roll down, drill up etc)

06

Practical content

Experiments/simulation based on the syllabus.

Text Books

1. Han, Kamber ,“Data Mining Concepts and Techniques”, Morgan Kaufmann

Reference Books

1. 1 Paulraj Ponniah, “Data Warehousing Fundamentals”, John Wiley.

2. M.H. Dunham, “Data Mining Introductory and Advanced Topics”, Pearson Education.

3. Ralph Kimball, “The Data Warehouse Lifecycle toolkit”, John Wiley.

Page 100: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VII Version 2.0.0.0

Effective from Academic Year 2017-18 Effective for the batch Admitted in July 2014

Subject code 2CE712 Subject Name Soft Skills

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit - - 2 - 2 Theory 0 0 0

Hours 0 0 4 0 4 Practical 60 40 100

Pre-requisites:

Nil

Learning Outcome:

Upon successful completion of the course, the student should be able to:

Develop interpersonal skills and be effective goal oriented team player

To be professional with idealistic, practical and moral values.

To develop communication and problem solving skills.

To re-engineer attitude and understand its influence on behaviour.

Practical Contents

Sr. No.

Content Hrs

1. 1 Self-Analysis: SWOT analysis, who am I, attributes, importance of self-confidence, self-esteem. 06

2. 2 Attitude: Factors influencing attitude, challenges and lessons from attitude, etiquette. 06

3. Motivation: Factors of motivation, self-talk, intrinsic & extrinsic motivators. 05

4. Goal setting: Wish list, smart goal, blue print for success, short term, long term, life time goals 05

5. 3 Time management: value of time, diagnosing time management, weekly planner to do list, prioritizing work

05

6. 4 Gratitude: Understanding the relationship between Leadership Networking & Team work. Assessing Interpersonal Skills Situation description of Interpersonal Skill. Team Work: Necessity of Team Work Personally, Socially and Educationally

11

7. Leadership: Skills for a good leader, assessment of leadership skills 05

8. Stress management: Causes of stress and its impact, how to manage & distress, circle of control, stress busters.

06

9. Emotional Intelligence: What is emotional intelligence, emotional quotient, why emotional intelligence matters, emotion scales, managing emotions.

06

10. Conflict resolution: Conflicts in human relations – reasons case studies, approaches to conflict resolution.

05

Text Books

Reference Books

1. 1 Covey Sean, Seven Habit of Highly Effective Teens, New York, Fireside Publishers, 1998.

2. Carnegie Dale, How to win Friends and Influence People, New York: Simon & Schuster, 1998.

3. SOFT SKILLS, 2015, Career Development Centre, Green Pearl Publications

Page 101: PROPOSED TEACHING SCHEME FOR B.TECH SEMESTER ......2 HS501 Ap titude Skill Building-I 0 0 0 1 - 1 0 0 0 2 - 2 - - - 30 20 50 Total 1607 - 14 200 300 500 210 140 350 NOTE: * indicates

GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY Programme Bachelor of Technology Branch/Spec. Computer Engineering

Semester VIII Version 2.0.0.0

Effective from Academic Year 2017-18 Effective for the batch Admitted in July 2014

Subject code 2CE801 Subject Name Major Project

Teaching scheme Examination scheme (Marks)

(Per week) Lecture(DT) Practical(Lab.) Total CE SEE Total

L TU P TW

Credit - - 16 - 16 Theory - - -

Hours - - 32 - 32 Practical 200 200 400

Pre-requisites:

Understanding of Tools & Technology studied up to semester VII

Learning Outcome:

Upon successful completion of the course, the student should be able to

Get the exposure of real time environment of the industry.

Understand and fulfil the requirements of industry.

Guidelines for Industrial Project:

Students have to do project work individually / in the team.

Individual evaluation will be done.

Students will have to come for first reporting within first four weeks of semester.

Thereafter, students will have to come for reporting once in 2 weeks.

There will be 2 midterm evaluation along with presentation. First midterm evaluation will be

within 6 weeks and second midterm evaluation will be within 10 weeks from starting of the

semester.

Final evaluation will be done by external examiner.

Students need to follow the department guidelines strictly.