Bachelor of Technology in Computer Science & Engineering (Data … · 2020. 5. 18. · CSE Course...

Bachelor of Technology in

Computer Science & Engineering

(Data Science & Artificial Intelligence & Machine

Learning, IoT & Automation)

July 2019

GSFC University, Vadodara

Bachelor of Technology (B. Tech.) Program in Computer Science & Engineering

(Data Science & Artificial Intelligence & Machine Learning, IoT & Automation)

Curriculum (2019-2020)

Code Course Title L-T-P Credits Code Course Title L-T-P Credits

I Semester

II Semester

BTEC101 Basics of Electrical &

Electronics

3-0-2 4

BTCE201 Object oriented

Programming with C++

3-0-2 4

BTEN102 Communication Skills 3-0-0 3

BTCE202 Data Structures &

Algorithms

3-0-2 4

BTMA103 Mathematics - I 3-1-0 4

BTCE203 Web Technologies 3-0-2 4

BTCS104 Computer

Programming

3-0-2 4

BTCE204 Mathematics - II

3-1-0 4

BTPY105 Engineering Physics 3-0-2 4

BTCE205 Digital Electronics 2-0-0 2

BTME106 Workshop 0-0-2 1

BTEC206 Disaster Management 3-0-2 4

BTFC107 Foundation Course 2-0-0 2

BTCE207 Emerging Technologies 2-0-0 0

BTFS108 Safety, Health &

Environment

2-0-0 0

BTCE208

Student Industrial

Training - II 0-0-0 2

19BTCS109 Student Industrial

Training – I 0-0-0 2

Total 28 24

Total 28 24

Code Course Title L-T-P Credits Code Course Title L-T-P Credits

III Semester

IV Semester

BTCE301 Discrete Mathematics 3-1-0 4

BTCE401 Mathematics for

Specialization

3-1-0 4

BTCE302 Object Oriented

Programming with

JAVA

3-0-2 4

BTCE402

Computer Networks

3-0-2 4

BTCE303 Operating System 3-0-2 4

BTCE403 Microprocessor &

Interfacing

3-0-2 4

BTCE304 Computer

Organization

3-1-0 4

BTCE404 Web Architecture and

Application

3-0-2 4

BTCE305 DBMS 3-0-2 4

BTCE405 Software Engineering 3-0-2 2

BTCE306 Specialized Track

Elective – I

3-0-2 4

BTCE406 Specialized Track Elective

– II

3-0-2 4

BTCE307 Student Industrial

Training – III 0-0-0 2 BTCE407

Student Industrial Training

– IV 0-0-0 2

Total 28 26

Total 29 24

Semester - I Semester I B. Tech Computer Science & Engineering

Sr.

No Course Code Course Name

Teaching Scheme Exam Scheme

L T P C Hrs/W

k.

Theory Practical Total

Marks MS ES CE LW LE/ Viva

1 BTEC101 Basics of Electrical &

Electronics 3 0 2 4 5 20 50 30 25 25 150

2 BTEN102 Communication Skills 3 0 0 3 3 20 50 30 -- -- 100

3 BTMA103 Mathematics – I 3 1 0 4 4 20 50 30 -- -- 100

4 BTCS104 Computer Programming 3 0 2 4 5 20 50 30 25 25 150

5 BTPY105 Engineering Physics 3 0 2 4 5 20 50 30 25 25 150

6 BTME106 Workshop 0 0 2 1 2 20 50 30 25 25 50

7 BTFC107 Foundation Course 2 0 0 2 2 -- -- -- -- -- 100

8

BTFS108 Safety, Health &

Environment 2 0 0 0 2 -- -- -- -- -- P/F

9 BTCS109

Student Industrial Training

– I 0 0 0 2 0 -- -- -- -- -- 100

Total 19 1 8 22 28 900

MS - Mid Semester, ES - End Semester, CE - Continuous Evaluation, LW - Laboratory Work, LE - Laboratory Exam

CSE Course Curriculum

SCHOOL OF TECHNOLOGY – COMPUTER SCIENCE & ENGINEERING

BRANCH NAME - COURSE NAME- YEAR

COURSE CODE

BTEC101

COURSE NAME

BASICS OF ELECTRICAL AND

ELECTRONICS

L T P C

3 0 2 4

Total Credits:4 Total Hours in semester :45 Total Marks: 100

1 Course Pre-requisites: Nil

2 Course Category: Ability Enhancement Courses / Skill Enhancement Courses/Core Courses /

Professional or Discipline Specific Elective /Generic Elective /Open Elective

3 Course Revision/ Approval Date:

4 Course Objectives :It is an introductory course which emphasize the

fundamental concepts and overview of

Electrical Engineering & Electronics. The course work aims in

imparting fundamental knowledge on electronic components and

communication engineering concepts.

4.1 Emphasize the fundamental concepts and overview of Electrical Engineering &

Electronics.

4.2 Imparting fundamental knowledge on electronic components

4.3 To provide brief idea about electrical machines

4.4 To aware about communication engineering concepts.

4.5 To gain knowledge about test equipment’s of electrical and electronics.

Course Content Weightage Contact hours Pedagogy

Unit 1:

Theory: Electrical Engineering

Study of voltage, current, power &

energy. Application of Ohm’s law,

Kirchhoff’s law, Lenz law.

Electromagnetic induction through

working of a transformer.

Practical: (Symbols of Electrical and

Electronics equipment, Basics of

Electrical safety & Study of Electrical

Safety rules)

20% 10 Chalk and

Duster and

PPT, Notes

Unit 2:

Theory: Concept of 1-phase, 3- phase

AC supply. Introduction of terms like

RMS value, average value. Familiarity

with components like resistors,

capacitors, diodes, LED’s, their

25% 10 Chalk and

Duster and

PPT, Notes




application, uses, industrial specification.

Introduction to component data sheets.

Practical: (Patch cords, Digital

Multimeter (DMM), Familiarization

with Digital multi-meter(DMM))

Unit 3:

Theory: Electrical Machines Understanding the construction, type,

principle of operation of various motors

like DC, Stepper, Servo, AC.

Introduction to the concepts of motor

selection and sizing.

Practical: (Measurement of AC

Voltage at 230 V AC Mains plug,

Measurement of DC Voltage for cell

phone battery of 3.8 V DC,

Measurement of Resistance of Current

coil & Potential coil of Energy meter,

Measurement of Continuity of any

wire/fuse.)

25% 10 Chalk and

Duster and

PPT, Notes

Unit 4:

Theory: Electronics Engineering Introduction of electronic components

like diodes, LED’s, transistors, OpAmps,

Gates Industrial specification and data

sheets of the components. Characteristics

and usage of the components. Signals:

Analog & Digital. Introduction to

industrial data acquisition

Practical: (Study the basics of 1-phase

control transformer & verify its

turn-ratio, Familiarization with Digital

Storage Oscilloscope (DSO).)

20% 10 Chalk and

Duster and

PPT, Notes

Unit 5:

Theory: Test Equipment Introduction to Multimeter and

Oscilloscope

10% 5 Chalk and

Duster and

PPT, Notes




Practical: (Understand the

construction & working of energy

meter, Load Test on 1 Phase AC

CSCR Type AC Motor, Load Test on

DC Shunt Motor.)

Learning Resources

1. Textbooks:1. Albert Paul Malvino,” Electronic Principles”, Tata Mcgraw

Hill,2002

2. Reference Books: 1. Simon Haykin, “Communication Systems”, Wiley

Eastern, Third Edition,19

3. Journals & Periodicals:

5. Other Electronic Resources:

Evaluation Scheme Total Marks: 100

Mid semester Marks 30

End Semester Marks 50

Continuous Evaluation

Marks

Attendance 5 marks

Quiz 5 marks

Skill enhancement activities / case

study

5 marks

Presentation/ miscellaneous

activities

5 marks

Course Outcomes

1. Identify the working of an electrical component in any

machine..

2. The students will be able to appreciate the applications

of electrical component.

3. Analyze use and importance of electrical machines in

industries.

4.Able to understand how industries are working with

electrical machines.

5. Apply test equipment’s in electrical projects.




COURSE CODE

BTEN102

COURSE NAME

COMMUNICATION SKILLS

L T P C

3 0 0 3

Total Credits: 3 Total Hours in semester : 45 Total Marks:100

1 Course Prerequisites: NIL




4 Course Objectives :

4.1 To acquaint students with English Grammar

4.2 To enhance communication skills.

4.3 To magnify their listening skills

4.4 To escalate speaking skills

4.5 To enhance students’ proficiency in English language


Unit 1:

Theory: Grammar & Vocabulary

20% 15 Chalk and Duster and

PPT, Notes

Unit 2:

Theory: Communication Skills


PPT, Notes

Unit 3:

Theory:

Listening Skills


PPT, Notes

Unit 4:

Theory: Speaking Skills


PPT, Notes

Unit 5:

Theory: Reading - Writing Skills


PPT, Notes

Learning Resources

1. Textbooks: High School English Grammar and Composition by Wren and




martin

'Essential English Grammar by Raymond Murphy.

2. Reference Books: Cambridge English Pronouncing Dictionary, Cambridge

University Press, India, 2012

Word Power made easy

3. Journals & Periodicals: Dhanavel, S.P. 2009. English and Communication

Skills for Students of Science and Engineering. Units 1-5. Chennai: Orient

Blackswan Ltd. Meenakshi Raman and Sangeetha


Evaluation Scheme Total Marks 100




Marks

Attendance 5 marks

Quiz 5 marks


study

5 marks


activities

5 marks

Course

Outcomes

1. Grammar will help to write and speak English fluently

2. The communication skills will help to enhance their skills and explore

the world.

3. L-S-R-W will help them to be fluent English User like native

4. Able to communicate flawlessly

5. Apply their skills in formal and informal writing and reading.




COURSE CODE

BTMA103

COURSE NAME

MATHEMATICS-I

L T P C

3 1 0 4

Total Credits:4 Total Hours in semester :45 Total Marks:100

1 Course Pre-requisites: Differentiation and Integration (Basic calculus),

Trigonometry

2 Course Category: Core Ability Enhancement Courses / Skill Enhancement Courses/Core Courses /




4.1 Gives a clear understanding of the ideas of calculus as a solid foundation for

subsequent courses in mathematics and other disciplines.

4.2 Comprehensive focus on teaching calculus based on concepts as well as procedures.

4.3 Enables students to apply their knowledge and solve practical problems in physical

sciences and engineering.

4.4 understanding basic concepts of linear algebra (systems of linear equations, matrix

calculus, vectors and basic vector operations)

4.5 solving computational problems of linear algebra


Unit 1:

Theory: Review of limits, continuity,

and differentiability of function of single

variable; indeterminate forms and

L’Hospitals Rule.

20% 7 Chalk and

Duster and

PPT,Notes

Unit 2:

Theory: Sequences and series, Tests for

convergence of series (nth term,

Comparison, limit comparison, Ratio,

Root, Integral, Geometric series,

Alternating series), Power Series, Taylor

Series, Maclaurin’s Series.

20% 10 Chalk and

Duster and

,Notes

Unit 3:

Theory: Partial Derivatives:Limit and

continuity of functions of two variable,

20% 10 Chalk and

Duster and

,Notes




chain rule, total derivatives, Taylor’s

series expansion of function of two

variables.

Unit 4:

Theory: Applications of Partial

Derivatives: Maxima and minima,

Lagrange multipliers, errors and

approximation, implicit functions,

tangent plane and normal to a surface.

20% 08 Chalk and

Duster and

PPT ,Notes

Unit 5:

Theory: Linear Algebra:

Elementary operations and their use in

getting the Rank, Inverse of a matrix and

solution of linear simultaneous

equations. Orthogonal, Symmetric,

Skew-symmetric,Hermitian,Skew-

Hermitian, Normal & Unitary

matrices and their elementary properties.

Characteristic polynomials, Eigen-

values and Eigenvectors of a matrix,

Cayley Hamilton theorem (without

proof) and its use in finding inverse of a

matrix. Applications of Matrices.

20% 10 Chalk and

Duster and

PPT,Notes

Learning Resources

1. Textbooks:Veerarajan T., Engineering Mathematics for first year, Tata

McGraw-Hill,New Delhi, 2008.

2. Reference Books: Thomas, G.B., Finney, R.L., Calculus and Analytic

Geometry, 9th Ed.,Wesley/Narosa, (1998).



Evaluation Scheme Total Marks







Marks

Attendance 5 marks

Quiz 5 marks


study

5 marks


activities

5 marks

Course Outcomes

1.Apply the concepts of limits, continuity and derivatives

to solving problems.

2.Determine convergence or divergence of sequences and

series

3.Use Taylor and MacLaurin series to represent

functions. Solve application problems.

4.Understand functions of several variables, limits,

continuity, partial derivatives.Identify and solve some

system of linear equations.

5.To deal with functions of several variables that is

essential in most branches of engineering.The essential

tool of matrices and linear algebra in a comprehensive

manner.




COURSE CODE

BTCS104

COURSE NAME

COMPUTER PROGRAMMING-I

L T P C

3 0 2 4


1 Course Pre-requisites: Basic Computer knowledge

2 Course Category: Core



4.1 To provide basics of programming components.

4.2 To develop logics for array and string which will help them to create applications in C

4.3 To familiar students about functions and pointers.

4.4 To give brief idea about structures in c programming

4.5 To gain knowledge about file handling using c language.


Unit 1: BASICS OF C

PROGRAMMING

Theory: Introduction to programming

paradigms - Structure of C program

- C programming: Data Types,

Storage classes, Constants,

Enumeration Constants, Keywords,

Operators: Precedence and

Associativity, Expressions, Input /

Output statements, Assignment

statements, Decision making

statements, Control structures, Pre-

processor directives, Compilation

process.

Practical:

1. Program to print “Hello GSFC

University”. 2. Program to find the sum

of the 2 numbers. 3. Program to find area

and circumference of the circle. 4.

Program to find simple interest. 5.

Program to convert degree centigrade to

Fahrenheit. 6. Program to calculate sum

of 5 objects and print average. 7.

Program to show swapping of 2 numbers

without using third variable. 8. Program

to show swapping of 2 number using

third variable. B. Control Structures: IF,

20% 09 Chalk –

Talk,

Presentatio

n




Switch, Loops 9. Program to show

reverse of given number. 10. Program to

find greatest among 3 numbers. 11.

Repeat program 10 with conditional

operator. 12. Program to find that entered

year is Leap year or not. 13. Program to

find given number is even or odd. 14.

Program to use Switch statement,

Display percentage of student. 15.

Program to display arithmetic operation

using Switch. 16. Program to display first

15 natural numbers and their sum using

For Loop. 17. Program to print Patterns:

18. Program to print Fibonacci series till

40. 19. Program to find factorial of given

number. 20. Program to find whether a

given number is prime or not.

Unit 2: ARRAYS AND STRINGS Theory:

Introduction to Arrays: Declaration,

Initialization, One dimensional

array, Two dimensional arrays,

Addition, Scaling, Determinant and

Transpose, String operations:

length, compare, concatenate, copy,

bubble sort, linear and binary

search.

Practical:

21. Program to create an array of 10

elements. Show the sum and average of

10 elements entered by the user. 22.

Program to find maximum number in

given Array. 23. Program to display

matrix. 24. Program to find sum of two

Matrices. 25. Program to find subtraction

of two matrices. 26. Program to find

multiplication of two matrices. 27. Write

a program to read a series words using

scanf(). 28. Write a program to copy one

string into another and count the number

of characters copied. 29. Write a program

to concatenate strings. 30. Write a

program to demonstrate String handling

functions

20% 09 Chalk –

Talk,

Presentatio

n

Unit 3: FUNCTIONS AND

POINTERS

20% 09 Chalk –

Talk,




Theory: Introduction to functions:

Function prototype, function

definition, function call, Built-in

functions (string functions, math

functions), Recursion, Pointer, pointer

operators, Pointer arithmetic: Arrays

and pointers, Array of pointers,

Parameter passing: Pass by value,

Pass by reference

Practical:

31. Program for swapping of two

numbers using functions. 32. Program to

find factorial of given number using

function. 33. Program to show table of

given number using function. 34.

Program to show call by value. 35.

Program to show call by reference. 36.

Program to find the largest among two

using functions. 37. Write a program to

show how similar name variables can be

used in different functions. 38. Write a

program to return more than one value

from a function. 39. Program for passing

array from main function to display

function. 40. Write a program in C to

show the basic declaration of pointer. 41.

Write a program in C to demonstrate

how to handle the pointers in the

program. 42. Write a program in C to

demonstrate the use of &(address of) and

*(value at address) operator. 43. Write a

program in C to add two numbers using

pointers. 44. Write a program in C to add

numbers using call by reference. 45.

Write a program in C to store n elements

in an array and print the elements using

pointer. 46. Write a program in C to

swap elements using call by reference.

47. Write a program in C to compute the

sum of all elements in an array using

pointers.

Presentatio

n

Unit 4: STRUCTURES

Theory:

Structure: Nested structures, Pointer

20% 09 Computer

based

learning,

Chalk –




and Structures, Array of structures,

Self-referential structures, typedef,

Dynamic memory allocation:

malloc, clloc, realloc, free()

Practical:

48. Write a program to demonstrate

declaration of structures. 49. Write a

program to store student information

using Structure. 50. Write a program to

add two distances. 51. Write a program

to store 10 student’s information using

structures. 52. Write a program to

demonstrate nested structures. 53. Write

a program to demonstrate how pointers

will be used to create and access

structures.

Talk,

Presentatio

n

Unit 5: FILE PROCESSING

Theory:

Files and file handling operations,

Types of file processing: Sequential

access, Random access, Sequential

access file, Command line

arguments

Practical:

54. Write a program to create a file and

store information. 55. Write a program to

read contents from a file. 56. Write a

program to append content at the end of

file. 57. Write a program to find the size

of a file using file handling functions. 58.

Write a program to update the contents

of a file.

20% 09 Computer

based

learning,

Chalk –

Talk,

Presentatio

n

Learning Resources

1. Textbooks:

1. Programming in ANSI C, 7th

Edition by Balaguruswamy

2. C Programming: Test Your Skills, 1/e by Ashok Kamthane

2. Reference Books:

1. Let Us C,16th

Edition, by Yashwant Kanetkar

2. Programming with C, 2nd

Edition by Gottfried, McGraw-Hill.

3. Understanding Pointers in C, 5th

edition by Yashwant Kanetkar










Marks

Attendance 5 marks

Quiz 5 marks


study

5 marks


activities

5 marks

Course Outcomes

1. Gain basic understanding of basic components of

programming language

2. Understand any other programming language with the

knowledge of array and string.

3. Apply function concept in real time applications.

4. Analyze working of structure in c or other

programming language programs.

5. Students will be able to develop applications using C

programming




BTPY 105

ENGINEERING PHYSICS

L T P C

3 0 2 4

Total Credits: 4 Total Hours in Semester: 45 Total Marks: 100

1 Course Pre-requisites: NIL

2 Course Category: Core Professional

3 Course Revision/ Approval date

4 Course Objectives

4.1 To familiarize with basics of Noise, Vibrations and Oscillations

4.2 To inculcate fundamental knowledge of Electromagnetism and its

engineering applications

4.3 To develop basic understanding for different applications of optical

phenomena

4.4 To embrace optical technologies and understand their functioning

4.5 To familiarize with introductory quantum physics and its importance

Course Content Weightag

e

Contact

hours

Pedagogy

Unit 1: Noise and Vibrations

Theory: Concept of Noise and its sources.

Noise Terminology. Definition of Harshness,

acceptable levels and perception. Sources of

Vibrations. Simple harmonic motion.

Damped harmonic oscillator and its energy

decay, Quality factor. Forced harmonic

oscillator and its steady-state motion. Power

absorbed by oscillator. Resonance. Analogy

between electrical and mechanical

oscillations. Mathematical modeling of

vibrations.

25% 09 Chalk-Talk,

Power point

Presentation,

Group

Discussion




Practical:

1) To determine the frequency of vibrations

on a string using Melde’s experiment

2) To determine the frequency of the A.C.

mains source using a Sonometer

Unit 2: Electromagnetism

Theory: Laws of Electrostatics. Polarization

and corresponding classification of materials.

Permittivity and Dielectric constants. Laws of

Magnetostatics. Magnetization and

corresponding classification of materials,

Permeability and susceptibility. Hysteresis.

Maxwell’s equations. Continuity equation.

Practical:

1) To determine magnetic hysteresis

properties of ferromagnetic materials.

2) To find the horizontal component of

earth’s magnetic field using tangent

galvanometer (Virtual Lab).

3) To determine the magnetic dipole moment

of a bar magnet and horizontal intensity of

earth’s magnetic field using a deflection

magnetometer.

4) To study the variation in magnetic field

with distance along the axis of rotation of a

circular coil.

20% 09 Chalk-Talk,

Group

Discussion,

Role Play

Unit 3: Modern Optics - I

Theory: Superposition of waves and

20% 09 Chalk-Talk,

Animations,




Interference. Concept of Diffraction and

types of Diffraction. Fraunhofer diffraction of

single and multiple slits. Types and

applications of Diffraction gratings. Bragg’s

law.

Practical:

1) To determine the wavelength of

Monochromatic source using diffraction

gratings.

2) To determine the dispersive power of a

grating.

3) To determine wavelength of light using

Newton’s rings setup.

4) To determine refractive index of liquids

using Newton’s Ring (Virtual Lab)

Unit 4: Modern Optics - II

Theory: Concept of Polarization and types of

Polarization. Polarization using reflection,

double refraction, and scattering. Optical

activity. Concept of Lasers, working and

different types of Lasers, safety aspects, using

lasers as sensors.

Practical:

1) To determine the specific rotation of sugar

using polarimeter (using setup/virtual lab).

15% 09 Chalk-Talk,

Animations

Unit 5: Quantum Physics

Theory: Black body radiation and concept of

20% 09 Chalk-Talk




Photons, Photoelectric effect, de Broglie

hypothesis, wave-particle duality,

Interpretation of wave-function, Uncertainty

relations, Schrodinger's wave-equation,

Particle in a box.

Practical:

1) To determine Planck’s constant using

photoelectric effect setup.

2) To determine work function of the given

material using photoelectric effect setup.

Learning Resources

1. Textbooks

1. VIBRATIONS AND WAVES by George C. King, Willey (For Unit

1)

2. Engineering Physics by H K Malik and A K Singh, Tata McGraw-

Hill Education (For All Unit 2, 3 and 4)

2. Reference books

1. A Textbook of Engineering Physics by M N Avadhanulu, S CHAND

2. Textbook of Engineering Physics by Dr. P. S. Aithal and Dr. H. J.

Ravindra, ACME Learning

3. ENGINEERING PHYSICS by S K Nayak and K.P. Bhuvana, Tata

McGraw-Hill Education

3. Journals

4. Journal of Applied Physics, AIP Publication, ISSN: 0021-

8979 (print) 1089-7550 (Online)

5. Journal of Engineering Physics and Thermophysics, SPRINGER

Publication, ISSN: 1062-0125 (Print) 1573-871X (Online)

6. Current Applied Physics, ELSEVIER Publication, ISSN: 1567-1739

(Print) 1567-1739 (Online)

4. Periodicals

5. Other Electronic resources


https://www.worldcat.org/search?fq=x0:jrnl&q=n2:0021-8979






Course Outcomes

1. Understanding of the basic knowledge of harmonic

motions.

2. Conceptualization of different electric and magnetic

properties of materials

3. Understanding different engineering applications of

optical fundamentals.

4. Conceptualization of construction and working of

lasers

5. To embrace the concept of the quantum physics and

have basic understanding of its principles.

Additional Information to

enhance learning

NIL

7. Mid semester

Marks

30

8. End Semester

Marks

50

9. Continuous

Evaluation Marks

Attendance 5 marks

Quiz 5 marks

Skill enhancement

activities / case study

5 marks

Presentation/

miscellaneous activities

5 marks




BTME106

ENGINEERING WORKSHOP

PRACTICES

L T P C

0 0 2 1

Total Credits: 1 Total Hours in semester : 30 Total Marks: 50

1 Course Pre-requisites: Zeal to learn the subject

2 Course Category: Skill Enhancement Courses.



4.1 To give basic training on fitting, carpentry, sheet metal, machine shop, and black

smithy.

4.2 To enable students to understand and practice joining techniques.

4.3 To train students to handle various machine tools.

4.4 To enable students to understand basic mechanical engineering concepts.

4.5 To enable students to fabricate components with their own hands.

Course Content Weighta

ge

Contact

hours

Pedagog

y

Unit 1: Introduction

Theory: Introduction, Workshop layout, Importance of

various sections/shops of workshop, Types of jobs done

in each shop. General safety rules and work procedure

in workshop. Measuring Instruments.

Practical:

1. Introduction to Engineering Workshop. Know

general safety rules and work procedure of

engineering workshop.

2. Sketch the layout of engineering workshop.

20% 06 Hands on

activities/

Job

preparati

ons




Study the different shops and types of jobs done

in each shop of engineering workshop.

3. Study about basic Measuring Instruments used

in workshop.

Unit 2: Welding

Theory: Overview of arc and spot welding operations.

Practical:

1. Study of Arc welding machine and its

accessories.

2. Demonstrate and perform job by using Arc

welding machine.

20% 04 Hands on

activities/

Job

preparati

ons

Unit 3: Fitting

Theory: Overview of fitting operations

Practical:

1. Study of Fitting tools.

2. Demonstrate and perform job by using Fitting

tools.

20% 04 Hands on

activities/

Job

preparati

ons

Unit 4: Black smithy

Theory: Overview of smithy processes

Practical:

1. Study of Black smithy tools.

2. Demonstrate and perform job by using Black

smithy tools.

3. Study of Tin smithy tools.

4. Demonstrate and perform job by using Tin

smithy tools.

20% 08 Hands on

activities/

Job

preparati

ons

Unit 5: Machining

Theory: Overview of Lathe and shaper machines.

Practical:

1. Study of Lathe machine.

2. Demonstrate different operations on Lathe

20% 08 Hands on

activities/

Job

preparati

ons




machine.

3. Study of Shaper machine.

4. Demonstrate different operations on Shaper

machine.

Learning Resources

1. Textbooks:

1. Hajra Choudhary, S. K., Elements of Workshop Technology,

Media Promotors& Publishers Pvt. Ltd, 12thEdition, (2002).

2. Chapman, W.A.J., Workshop Technology, ELBS Low Price

Text, Edward Donald Pub. Ltd., (1961).

2. Reference Books:

1. Singh, D.K., Fundamentals of Manufacturing Engineering, Ane

Books Pvt. Ltd, New Delhi, 2nd Edition, (2009).

2. Raghuwanshi, B.S., Course in Workshop Technology,

DhanpatRai& Sons, New Delhi, (1991).

3. Schey, J.A., Introduction to Manufacturing Process, 3rd.Edition,

McGraw Hill, (2000).


1. Journal of Manufacturing Processes

2. Procedia Manufacturing

3. Manufacturing Letters


http://www.weldingtechnology.org

http://www.piehtoolco.com/

http://sourcing.indiamart.com/engineering/articles/materials-used-hand-tools/

Course Outcomes

1. Upon completion of this laboratory course,

students will be able to read and use a manufacturing

drawing as a definition for the manufacturing of a

part.

2. Able to fabricate components with their own

hands.

3. Understand the practical difficulties encountered in

industries during any assembly work.

4. Will also get practical knowledge of the

dimensional accuracies and dimensional tolerances

http://www.weldingtechnology.org/

http://www.piehtoolco.com/

http://sourcing.indiamart.com/engineering/articles/materials-used-hand-tools/




possible with different manufacturing processes.

5. By assembling different components, they will be

able to produce small devices of their interest.





Marks

Attendance 5 marks

Quiz 0 marks

Skill enhancement activities / job

preparations

45 marks


activities

0 marks




Semester – II Semester II B. Tech (Common for All Branches)

Sr. No Course Code Course Name


L T P C Hrs/Wk. Theory Practical Total


1 BTCE201 Object oriented

Programming with C++ 3 0 2 4 5 20 50 30 25 25 150

2 BTCE202 Data Structures &

Algorithms 3 0 2 4 5 20 50 30 25 25 150

3 BTCE203 Web Technologies 3 0 2 4 5 20 50 30 25 25 150

4 BTCE204

Mathematics - II 3 1 0 4 4 20 50 30 -- -- 100

5 BTCE205 Digital Electronics 3 0 2 4 2 20 50 30 25 25 150

6 BTEC206 Disaster Management 2 0 0 2 5 20 50 30 -- -- 100

7 BTCE207 Emerging Technologies 0 0 2 0 2 -- -- -- -- -- P/F

8 BTCE208 Student Industrial Training -

II 0 0 0 2 0 -- -- -- -- -- 100

Total 17 1 10 24 28 900




BTCE201

Object oriented Programming

with C++

L T P C

3 0 2 4


1 Course Pre-requisites: C Programming





4.1 To aware students about basics of OOP for every O-O based programming language.

4.2 To familiar students with class and object with function

4.3 To make student understand working and importance of constructor and destructor

4.4 To give brief idea about inheritance

4.5 To provide an overview of file handling and templates


Unit 1:

Principles of OOP:

Programming Paradigms, Basic

concepts, Benefits of OOP,

Applications of OOP.

Introduction to C++, History of

C++, Structure of C++, Basic

data types, Derived data types,

Symbolic constants. Dynamic

initialization, Type modifiers,

Type Casting, Operator and

control statements, Input and

Output statements in C++.

20% 9 Chalk –

Talk,

Presentatio

n

Unit 2:

Classes and objects, class

specification, member function

specification, scope resolution

operator, Access qualifiers,

Instance creation, Member

functions. Function prototyping,

Function components, and

Passing parameters, call by

reference, Return by reference,

Inline functions, Default

20% 9 Chalk –

Talk,

Presentatio

n



arguments, Overloaded

function.

Unit 3:

Theory:

Array of objects, pointers to

objects, this pointer, Dynamic

allocation operators, Dynamic

objects. Constructors,

parameterized constructors,

Overloaded constructors,

Constructors with default

arguments, copy constructors,

static class members and static

objects. Operator Overloading,

Overloading unary and binary

operator, Overloading the

operator using friend function,

stream operator overloading,

data conversion.

Practical: (Give the list of

Experiments)

20% 9 Chalk –

Talk,

Presentatio

n

Unit 4:

Theory:

Inheritance, Defining derived

classes, Single inheritance,

protected data with private

inheritance, multiple

inheritance, multi-level

inheritance, hierarchical

inheritance, hybrid inheritance,

multipath inheritance,

Constructors in derived and

base class, Abstract classes,

virtual function and dynamic

polymorphism, virtual

destructor. Exception Handling,

principle of Exception handling,

Exception handling mechanism,

multiple catch, Nested try,

Rethrowing the exception.

Practical: (Give the list of

Experiments)

20% 9 Computer

based

learning,

Chalk –

Talk,

Presentatio

n



Unit 5:

Theory:

Streams in C++, Stream classes,

Formatted and Unformatted

data, manipulators, User defined

manipulators, file streams, file

pointer manipulation, file open

and close. Templates, Template

functions and Template classes.

Practical: ( Give the list of

Experiments)

20% 9 Computer

based

learning,

Chalk –

Talk,

Presentatio

n

Learning Resources

1. Text Books:

1. C++ Primer by Barbara E. Moo, Josée Lajoie, Stanley B.

Lippman, 5th Edition

2. Starting Out with C++ - From Control Structures through

Objects by Tony Gaddis,

3. Accelerated C++: Practical Programming by Example by

Andrew Koenig, 1st Edition

2. Reference Books:

1. Object-Oriented Programming with C++ by E Balagurusamy,

Seventh edition

2. Let US C++ by Yashwant Kanetkar, 2nd Edition

3. Video Tutorial

https://www.studytonight.com/courses/cpp-video-tutorial/

4 NPTEL MOOC

https://nptel.ac.in/courses/106/101/106101208/










Marks

Attendance 5 Marks

Quiz 5 Marks


study

5 Marks


activities

5 Marks

Course Outcomes

1. Understand object-oriented programming features in

C++,

2. Apply these features to program design and

implementation,

3. Understand object-oriented concepts and how they are

supported by C++,

4. Understand implementation issues related to object-

oriented techniques

5. Apply templates and O-O concepts in developing real

time applications,



BTCE202

Data Structures and

Algorithms

L T P C

3 0 2 4


1 Course Prerequisites: NIL





4.1 To give brief idea bout data and how it is stored in memory structure.

4.2 To aware students about array and stack used in different programming languages.

4.3 To familiar with soring and searching techniques.

4.4 To make student understand about tree and graph structures,

4.5 To elaborate testing approach with data structure.

Course Content Weightage Contact

hours

Pedagogy

Unit 1:

Theory:

Introduction to Data Structures &

Algorithms: Arrays and Strings,

Algorithm Development,

Complexity analysis, Recursion

20% 9 Chalk – Talk,

Presentation

Unit 2:

Theory:

Linear Data Structures: Stacks:

Operations and Applications,

Queues: Operations and

Applications, Circular Queues:

Operations and Applications,

Links Lists: Operation –

Creations, insertion, Deletion,

Circular Lists, Doubly Linked


Presentation



List

Unit 3:

Theory:

Sorting & Searching: Insertion

Sort, Merge Sort, Quick Sort,

Binary Search, Linear Search,

Selection Sort


Presentation

Unit 4:

Theory:

Non Linear Data Structures:

Graphs I: Representation and

Traversal, Representation: Matrix,

Adjacency list, Traversal: Depth

First Search, Breadth First Search,

Graphs II: Basic Algorithms,

Minimum Spanning Tree,

Shortest Path, All pairs Shortest

Path, Transitive Closer, Binary

Trees, Representation,

Operations: Insert, Delete,

Traversal: Preorder, Inorder,

Postorder, Heap Sort, Method and

Complexity, Priority Queue,

Search Trees, AVI-trees, B-tree,

External Search,

20% 9 Computer based

learning, Chalk –

Talk,

Presentation

Unit 5:

Hashing Techniques, String

algorithms: Hashing Techniques,

Pattern Matching, Text Editor


learning, Chalk –

Talk,

Presentation



Unit 6

Program Development, Testing &

Verification: Program

Specification, Pre and post

Condition, Program

Documentations, Testing

Methods, Verification Procedures


learning, Chalk –

Talk,

Presentation

Learning Resources

1. Text Books:

1. Data Structures Using C by Reema Thareja, 2nd Edition

2. Fundamentals Of Data Structures in C++ by Horowitz, Sartaj Sahni,

2nd Edition

3. Data Structure Through C by Yashwant Kanetkar, 2nd Edition

2. Reference Books:

1. An Introduction to Data Structures with Application by Jean-Paul

Tremblay & Paul Sorenson, 2nd edition

2. Data Structures and Algorithms Made Easy: Data Structures and

Algorithmic Puzzles by Narasimha Karumanchi, 5th Edition

3 Video Tutorial

https://www.youtube.com/playlist?list=PL2_aWCzGMAwI3W_JlcBbtY

TwiQSsOTa6P

4 . NPTEL MOOC





https://www.youtube.com/playlist?list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P

https://www.youtube.com/playlist?list=PL2_aWCzGMAwI3W_JlcBbtYTwiQSsOTa6P





Marks

Attendance 5 Marks

Quiz 5 Marks


study

5 Marks


activities

5 Marks

Course

Outcomes

1. Understand and use the process of abstraction using a

programming language such as' C++.

2. Analyze step by step and develop algorithms to solve real world

problems.

3. Implementing various data structures viz. Stacks, Queues, Linked

Lists, Trees and Graphs

4. Understanding various searching & sorting techniques.

5. Implement testing approach in real time programming.



BTCE203

Web Technologies

L T P C

3 0 2 4


1 Course Pre-requisites: Basic Programming

2 Course Category: Core Ability Enhancement Courses / Skill Enhancement Courses/Core Courses /




4.1 To provide brief idea about html for web page development

4.2 To aware students about CSS to design web page

4.3 To elaborate working of JavaScript

4.4 To make student understand regarding how jquery can enhance look and feel of web

page

4.5 To familiar students with components and working of bootstrap


Unit 1:

Theory:

HTML

Introduction, Elements, Tags,

Formatting, Links, Font, Images, Tables,

Web Forms, Form Elements, Formatting

Tags.

HTML5

Semantic Elements, Form

Elements, Form Attributes, Form

Input Types, Media Elements,

Canvas, SVG

20% 9 Chalk –

Talk,

Presentatio

n

Unit 2:

Theory:

CSS

CSS3 Introduction, Borders,

Backgrounds, Text Effects,

Text, Transitions, Animations,

Multiple Columns, Transforms

20% 9 Chalk –

Talk,

Presentatio

n



Unit 3:

Theory:

JAVASCRIPT

Introduction, Operators, Function &

Object, Methods, Conditional Statement

& Looping Statement, Event Types

20% 9 Chalk –

Talk,

Presentatio

n

Unit 4:

Theory:

JQuery

Introduction, Retrieving Page

Content, Manipulating Page

Content, Working with Events,

JQuery Animations and Effects,

Using the jQuery UI Plug Ins

20% 9 Computer

based

learning,

Chalk –

Talk,

Presentatio

n

Unit 5:

Theory:

Bootstrap

Introduction, Bootstrap Grid,

Bootstrap Components

20% 9 Computer

based

learning,

Chalk –

Talk,

Presentatio

n

Learning Resources

1. Text Books:

HTML 5 Black Book, Dreamtech Press

Eric Freeman, Head First HTML5 Programming

2. Reference Books:

Jake Spurlock, Bootstrap, O'Reilly Media

3. HTML, CSS, JAVASCRIPT

https://www.youtube.com/playlist?list=PL41lfR-6DnOruqMacTfff1zrEcqtmm7Fv

4. JQuery

https://www.youtube.com/playlist?list=PLZdjW012sjggL_nRyanevMkgu51

https://www.youtube.com/playlist?list=PL41lfR-6DnOruqMacTfff1zrEcqtmm7Fv

https://www.youtube.com/playlist?list=PLZdjW012sjggL_nRyanevMkgu51xehoQr



xehoQr

Bootstrap

https://www.youtube.com/watch?v=aTLRdrRQyN4





Marks

Attendance 5 Marks

Quiz 5 Marks


study

5 Marks


activities

5 Marks

Course Outcomes

1. Students will be able to understand the

importance and need of client side

scripting.

2. Students will be able to develop static and

dynamic web applications.

3. Students will be able to Develop

Responsive websites.

4. Enhance their web page with jquery

5. Apply Bootstrap in real time web

application development.

https://www.youtube.com/watch?v=aTLRdrRQyN4



BTCE204

Maths - II

L T P C

3 1 0 4


1 Course Pre-requisites: NiL

2 Course Category:



4.1 Aware students about probability.

4.2 Give brief idea about distributions in mathematics.

4.3 To give brief idea about Statistical methodology


Unit 1:

Theory:

Probability:

Random Experiment; Sample space;

Random Events; Probability of events.

Axiomatic definition of probability;

Frequency Definition of probability;

Finite sample spaces and equiprobable

measure as special cases; Probability of

Non-disjoint events (Theorems).

Counting techniques applied to

probability problems; Conditional

probability; General Multiplication

Theorem; Independent events; Bayes’

theorem and related problems. 10L

Random variables (discrete and

continuous); Probability mass function;

Probability density function and

distribution function.

32% 14 Chalk –

Talk,

Unit 2:

Theory:

Distributions:

Binomial, Poisson, Uniform,

Exponential, Normal. Expectation and

Variance (t and χ 2 excluded);

33% 15 Chalk –

Talk,



Transformation of random variables

(One variable); Chebychev inequality

(statement) and problems.

Unit 3:

Theory:

Statistical Methods:

Classification of data, Frequency tables –

exclusive & inclusive, relative

percentage and cumulative distribution

table, visualization of data, various

measures of central tendency, measure of

dispersion, skewness, their

interpretation and comparative

applications.

Frequency distributions, Data analysis,

Expectations and moments, Corelation

and regression, Trend analysis, Seasonal

effects, Cyclical Fluctuation, Moving

average, MSE, Predictions. Non-

parametric statistics. Computer-based

resampling techniques. Confidence

intervals and statistical significance.

34% 16 Chalk –

Talk,

Learning Resources

1. W. Navidi, Statistics for Engineers and Scientists, McGraw Hill.

2. Miller & Freund’s Probability and Statistics for Engineers – By Richard A

Johnson., PHI.

3. Mood, Graybill and Boes, Introduction to the theory of Statistics, 3rd

Edition, McGraw Hill, 1974.

4. Sharma, Business Statistics, 2nd

Edition, Pearson Education, 2007.



5. Orris, Basic Statistics Using Excel and MegaStat, McGraw Hill. 2006.

6. Spiegel, Schllier and Srinivasan, Schaum's Outline of Probability and

Statistics, McGraw – Hill.

7. Hogg, Mckeain and Craig, Introduction to Mathematical Statistics, 7th

Edition, Pearson Education, 2012.





Marks

Attendance 5 Marks

Quiz 5 Marks


study

5 Marks


activities

5 Marks

Course Outcomes

11. Organize & present quantitative data and think

critically with respect to quantitative information

characterized by the centre, spread, and skewness of data

21. Develop the concept of a sampling distribution

and infer some characteristics of a population by

examining a portion of the population and to make

informed decision in a probabilistic environment

3.1. Express quantitatively the degree and direction of

association between two linearly related variables and fit

a regression model to the data as well as investigating the

explained portion.



BTCE205

Digital Electronics

L T P C

3 0 2 4


1 Course Pre-requisites: Basics of electronics





4.1 To aware students about number system,

4.2 To familiar student with Boolean algebra

4.3 To make student understand regarding combinational circuit

4.4 To elaborate sequential circuits

4.5 To provide knowledge about memory devices.


Unit 1:

Theory:

Data and number systems, Binary

representation, Codes and their

conversions: BCD, Octal, Hexadecimal,

ASCII, EBDIC, Gray, Signed binary

number representation with 1’s and 2’s

complement methods.

20% 9 Chalk –

Talk,

Presentatio

n

Unit 2:

Theory:

Binary arithmetic Boolean algebra, Venn

diagram, logic gates and circuits,

Minimization of logic expressions by

algebraic method, Kmap method and

Quine Mc Clauskey method

20% 9 Chalk –

Talk,

Presentatio

n

Unit 3:

Theory:

Combinational circuits- adder,

subtractor, encoder, decoder, comparator,

multiplexer, de-multiplexer, parity

generator, etc Design of combinational

circuits-Programming logic devices and

gate arrays

20% 9 Chalk –

Talk,

Presentatio

n



Unit 4:

Theory:

Sequential Circuits- Flip Flops, various

types of Registers and counters and their

design, Irregular counter, State table and

state transition diagram, sequential

circuits design methodology

20% 9 Computer

based

learning,

Chalk –

Talk,

Presentatio

n

Unit 5:

Theory:

Memory devices- ROM, RAM, EPROM,

EEPROM, etc Different types of A/D

and D/A conversion techniques Different

Logic families- TTL, ECL, MOS and

CMOS, their operation, design and

specifications

20% 9 Computer

based

learning,

Chalk –

Talk,

Presentatio

n

Learning Resources

1. Text Books:

1. Digital Logic and Computer Design by Morris Mano

2. Fundamental of Digital Circuits by A. Anandkumar

2. Reference Books:

1. Digital Electronics by R. P. Jain

3. Video Reference:

https://www.youtube.com/playlist?list=PLBlnK6fEyqRjMH3mWf6kwqiTbT7

98eAOm

4. NPTEL MOOC

https://nptel.ac.in/courses/117106086/




https://www.youtube.com/playlist?list=PLBlnK6fEyqRjMH3mWf6kwqiTbT798eAOm

https://www.youtube.com/playlist?list=PLBlnK6fEyqRjMH3mWf6kwqiTbT798eAOm




Marks

Attendance 5 Marks

Quiz 5 Marks


study

5 Marks


activities

5 Marks

Course Outcomes

1. Able to understand number system.

2. Apply Boolean algebra for K-maps

3. Analyze combinational circuits

4. Understand working of sequential circuit.

5. Comprehend understanding of memory structure.



BTEC206

Disaster Management

L T P C

2 0 0 2

Total Credits: 2 Total Hours in semester : 30 Total Marks: 50

1 Course Pre-requisites: Zeal to learn the subject

2 Course Category: Skill Enhancement Courses.



4.1 To introduce disasters and how it affects humanity.

4.2 To elaborate fundamentals of disaster

4.3 To make students understand a process of managing disaster

4.4 To aware students about how disaster management has been done in India

4.5 To gain knowledge about role of science and technology to handle disaster.

Course Content Weightag

e

Contact

hours

Pedagogy



Unit 1:

Theory:

Introduction to Disasters

Understanding the Concepts and

Definitions of Disaster, Hazard,

Vulnerability, Risk, Capacity –

Disaster and Development, and

Disaster Management.

20% 9 Chalk –

Talk,

Presentatio

n

Unit 2:

Theory:

Fundamental of Disasters

a) Types, Trends, Causes, Consequences

and Control: Geological Disasters,

Hydro-Meteorological Disasters,

Biological Disasters, Technological

Disasters, and Man-made Disasters.

b) Global Disaster Trends –

Emerging Risks of Disasters –

Climate Change and Urban

Disasters.

20% 9 Chalk –

Talk,

Presentatio

n

Unit 3:

Theory:

Disaster Management Cycle and Framework

Disaster Management Cycle –

Paradigm Shift in Disaster

Management,

Pre-Disaster – Risk Assessment and

Analysis, Risk Mapping, Zonation

and Microzonation, Prevention and

Mitigation of Disasters, Early

20% 9 Chalk –

Talk,

Presentatio

n



Warning System; Preparedness,

Capacity Development; Awareness.

During Disaster – Evacuation –

Disaster Communication – Search

and Rescue – Emergency Operation

Centre – Incident Command System

– Relief and Rehabilitation.

Post-disaster – Damage and Needs

Assessment, Restoration of Critical

Infrastructure – Early Recovery –

Reconstruction and Redevelopment;

IDNDR, Yokohama Strategy,

Hyogo Framework of Action,

Sendai framework.

Unit 4:

Theory:

Disaster Management in India

Disaster Profile of India – Mega

Disasters of India and Lessons

Learnt, Disaster Management Act

2005 – Institutional and Financial

Mechanism, National Policy on

Disaster Management, National

Guidelines and Plans on Disaster

Management; Role of Government

(local, state and national), Non-

Government and Inter-

Governmental Agencies.

20% 9 Computer

based

learning,

Chalk –

Talk,

Presentatio

n



Unit 5:

Theory:

Role of Science and Technology in Disaster Management

Geo-informatics in Disaster

Management (RS, GIS, GPS and

RS), Disaster Communication

System (Early Warning and Its

Dissemination), Land Use Planning

and Development Regulations,

Disaster Safe Designs and

Constructions, Structural and Non-

Structural Mitigation of Disasters,

S&T Institutions for Disaster

Management in India.

Disaster Case Studies

Various Case Studies on Disaster

and Development, Disaster

Prevention and Control, Risk

Analysis and Management

20% 9 Computer

based

learning,

Chalk –

Talk,

Presentatio

n

Learning Resources

1. Text Books:

2. Alexander, D., Natural Disasters, Kluwer Academic

London.

3. Asthana, N.C., Asthana P., Disaster Management,

Aavishkar Publishers.

4. Carter, N., Disaster Management: A Disaster

Manager's Handbook, Asian Development Bank,

Manila Philippines.

5. Collins, A.E., Disaster and Development, Routledge.

6. Coppola, D.P., Introduction to International Disaster

Management, 2nd Edition, Elsevier Science.

7. Goyal, S.L., Encyclopedia of Disaster Management



(Vols. 1-3), Deep & Deep, New Delhi.

8. Gupta, A.K., Nair, S.S., Environmental Knowledge for

Disaster Risk Management, NIDM, New Delhi.

Reference Books:

1. Ibrahimbegovic, A., Zlatar, M., Damage Assessment

and Reconstruction after War or Natural Disaster,

Springer.

2. Menshikov, V.A., Perminov, A.N., Urlichich, Y.M.,

Global Aerospace Monitoring and Disaster

Management.

3. Modh, S., Introduction to Disaster Management,

Macmillian Publishers India.

4. National Institute of Disaster Management (NIDM)

and National Disaster Management Authority

(NDMA) publications.

5. Srivastava, H.N., Gupta, G.D., Management of Natural

Disasters in Developing Countries, Daya Publishers,

Delhi.




Mid semester

Marks

00

End Semester

Marks

00



Continuous

Evaluation Marks

Attendance 5 marks

Quiz 0 marks

Skill enhancement

activities / job

preparations

45 marks

Presentation/

miscellaneous activities

0 marks

Course Outcomes

1. Upon completion of this laboratory course,

students will be able to read and use a

manufacturing drawing as a definition for the

manufacturing of a part.

2. Able to fabricate components with their own

hands.

3. Understand the practical difficulties

encountered in industries during any assembly

work.

4. Will also get practical knowledge of the

dimensional accuracies and dimensional

tolerances possible with different manufacturing

processes.

5. By assembling different components, they will

be able to produce small devices of their interest.



Semester - III Semester I B. Tech Computer Science & Engineering

Sr.



L T P C Hrs/W

k.



1 BTCE301 Discrete Mathematics 3 1 0 4 4 20 50 30 -- -- 100

2 BTCE302 Object Oriented

Programming with JAVA 3 0 2 4 5 20 50 30 25 25 150

3 BTCE303 Operating System 3 0 2 4 5 20 50 30 25 25 150

4 BTCE304 Computer Organization 3 1 0 4 4 20 50 30 -- -- 100

5 BTCE305 DBMS 3 0 2 4 5 20 50 30 25 25 150

6 BTCE306 Specialized Track Elective –

I 3 0 2 4 5 20 50 30 25 25 150

7 BTCE307 Student Industrial Training

– III 0 0 0 2 0 -- -- -- -- -- 100

Total 18 2 8 26 28 900


Discrete Mathematics



COURSE CODE


L T P C

3 1 0 4


1 Course Pre-requisites: Basic Mathematics

2 Course Category: Engineering Specific Elective



4.1 To help students to gain basics of set theory

4.2 To provide depth knowledge about propositional calculus

4.3 To make students familiar about recursion and recurrence relation.

4.4 To inculcate understanding of algebraic structure

4.5. To aware students about graph and functions


hours

Pedagogy

Unit 1:

Set Theory

Introduction to set theory, Set operations,

Algebra of sets, Duality, Finite and

Infinite sets, Classes of sets, Power Sets,

Multi sets, Cartesian Product,

Representation of relations, Types of

relation, Equivalence relations and

partitions , Partial ordering relations and

lattices, Function and its types,

Composition of function and relations,

Cardinality and inverse relations.


Presentation

Unit 2:

Propositional Calculus

Basic operations: AND(^), OR(v),

NOT(~), Truth value of a compound

statement, propositions, tautologies,

contradictions.


Presentation

Unit 3:

Recursion and Recurrence Relation

Polynomials and their evaluation,

Sequences, Introduction to AP, GP and

AG series, partial fractions, linear

recurrence relation with constant

coefficients, Homogeneous solutions,


Presentation




Particular solutions, Total solution of a

recurrence relation using generating

functions..

Unit 4:

Algebraic

Structures

Definition and examples of a monoid,

Semigroup, Groups and rings,

Homomorphism, Isomorphism and

Automorphism, Subgroups and Normal

subgroups, Cyclic groups, Integral

domain and fields, Cosets, Lagrange’s

theorem

.


learning, Chalk –

Talk,

Presentation

Unit 5:

Graphs And Trees

Introduction to graphs, Directed and

Undirected graphs, Homomorphic and

Isomorphic graphs, Subgraphs, Cut

points and Bridges, Multigraph and

Weighted graph, Paths and circuits,

Shortest path in weighted graphs,

Eurelian path and circuits, Hamilton

paths and circuits, Planar graphs, Euler’s

formula, Trees, Spanning trees, Binary

trees and its traversals


learning, Chalk –

Talk,

Presentation

Learning Resources

1. Textbooks:

1. C.L Liu, “Elements of Discrete Mathematics”, Tata McGraw Hill ,

1986

2. Kenneth H. Rosen, “Discrete Mathematics and Its Applications”,

Tata McGraw Hill, 2007

3. Narsingh Deo,’’Graph Thyeory with Aplications to Engineering and

Computer Science”

2. Reference Books:

1. Jean Paul Trembley, R Manohar, “Discrete Mathematical Structures

with Application to Computer Science”, Tata McGraw Hill, 1997




2. R.P. Grimaldi, “Discrete and Combinatorial Mathematics”, Addison

Wesley, 2003

3. B. Kolman, R.C. Busby, and S.C. Ross, “Discrete Mathematical

Structures”, PHI Publications, 2010

4. Johnson Bough R., “Discrete Mathematics”, 5th

Edition, PEA, 2001.

5. Ronald Graham, Donald Knuth and Oren Patashik, “Concrete

Mathematics: A Foundation for Computer Science”, Addison-

Wesley, 1989.

6. Judith L. Gersting, “Mathematical Structures for Computer Science”,

Computer Science Press, 2001.

7. A. Chtewynd and P. Diggle, “Discrete Mathematics”, (Modular

Mathematics series), Edward Arnold, London, 1995.



Course Outcomes

1.Understand the concept of sets

2.Analyze use of propositional theory in real time

scenario

3. Apply recurrence relations in other applications,

4. Apply generation of functions in algebraic structures.

5.Comprehend the use of graph theory in other domains





Marks

Attendance 5 marks

Quiz 5 marks


study

5 marks


activities

5 marks

Object Oriented Programming with JAVA



COURSE CODE

Object Oriented Programming with

JAVA

L T P C

3 0 2 4

Total Credits:4 Total Hours in semester : 45 Total Marks:100

1 Course Pre-requisites: Basic C Programming




4.1 To make students familiar about basics of java programming

4.2 To give brief knowledge about constructor and inbuilt function

4.3 To make students understand about inheritance and different packages

4.4 To inculcate students about layout handing and other GUI based commands.

4.5 To aware students about an advance technologies of java programming.


hours

Pedagogy

Unit 1: Basics of Java programming,

Data types, Variables, Operators, Control

structures including selection, Looping,

Java methods, Overloading, Math class,

Arrays in java.


Presentation

Unit 2: Basics of objects and classes in

java, Constructors, Finalizer, Visibility

modifiers, Methods and objects, Inbuilt

classes like String, Character,

StringBuffer, File, this reference


Presentation

Unit 3: Inheritance in java, Super and

sub class, Overriding, Object class,

Polymorphism, Dynamic binding,

Generic programming, Casting objects,

Instance of operator, Abstract class,

Interface in java, Package in java, UTIL

package


Presentation

Unit 4: Event handling in java, Event

types, Mouse and key events, GUI

Basics, Panels, Frames, Layout

Managers: Flow Layout, Border Layout,

Grid Layout, GUI components like

Buttons, Check Boxes, Radio Buttons,

Labels, Text Fields, Text Areas, Combo

Boxes, Lists, Scroll Bars, Sliders,

Windows, Menus, Dialog Box, Applet

and its life cycle, Introduction to swing.


learning, Chalk –

Talk,

Presentation




Unit 5: Text and Binary I/O, Binary I/O

classes, Object I/O, Random Access

Files. Thread life cycle and methods,

Runnable interface, Thread

synchronization, Exception handling

with try-catch-finally, Collections in

java, Introduction to JavaBeans and

Network Programming


learning, Chalk –

Talk,

Presentation

Learning Resources

1. Textbooks:

1 Introduction to Java Programming (Comprehensive Version), Daniel

Liang, Seventh Edition, Pearson.

2 Programming in Java, Sachin Malhotra & Saurabh Chaudhary, Oxford

University Press

2. Reference Books:

1 Murach’s Beginning Java 2, Doug Lowe, Joel Murach and Andrea

Steelman, SPD.

2 Core Java Volume-I Fundamentals, Eight Edition, Horstmann & Cornell,

Pearson Education.

3 The Complete Reference, Java 2 (Fourth Edition), Herbert Schild, TMH.

4 Java Programming, D. S. Malik, Cengage Learning.

5. http://nptel.ac.in



1. Understand basic java programming

2. Analyze how inbuilt functions are working





Marks

Attendance 5 marks

Quiz 5 marks


study

5 marks


activities

5 marks

http://nptel.ac.in/




Course Outcomes 3. Comprehend use of inheritance in real time

applications.

4. Able to develop and handle GUI based applications

5. Apply network programming with java based

applications.

Operating System



COURSE CODE

Operating System

L T P C

3 0 2 4


1 Course Pre-requisites: Basic Computer Knowledge




4.1 To aware student about different operating systems.

4.2 To make student understand about basic functions of memory and process handling.

4.3 To provide brief idea about process synchronization,

4.4 To elaborate understanding of memory management.

4.5 To gain knowledge about inter-process communication,


hours

Pedagogy

Unit 1: Introduction-OS Concepts –

Evolution of OS, OS Structures- Kernel,

Shell, General Structure of MSDOS,

Windows 2000, Linux. Introduction-

UNIX and ANSI Standards: The ANSI C

Standard, The ANSI/ISO C++ Standards,

Difference between ANSI C and C++,

The POSIX Standards. Process

Management-Process & Threads –

Process States - Process Control Block –

Process Scheduling – Operations on

Processes, Threads, CPU Scheduler –

Preemptive and Non- Preemptive;

Dispatcher, Scheduling Criteria,

Scheduling Algorithms – Process

Management in UNIX.


Presentation

Unit 2: GaUNIX Processes: The

Environment of a UNIX Process:

Introduction, main function, Process

Termination, Command-Line Arguments,

Environment List, Memory Layout of a

C Program, Shared Libraries, Memory

Allocation, Environment Variables,

setjmp and longjmp Functions, getrlimit,

setrlimit Functions, UNIX Kernel

Support for Processes. Process


Presentation

Operating System



Controlme

Unit 3: Process Synchronization & Inter

process Communication-Concurrent

Processes, Co-operating Processes,

Precedence Graph, Hierarchy of

Processes, Critical Section Problem –

Two process solution, Synchronization

Hardware, Semaphores – Deadlock-

detection, handling, prevention,

avoidance, recovery, Starvation, Critical

Regions, Monitors, Inter process

communication.


Presentation

Unit 4: Memory Management-

Objectives and functions, Simple

Resident Monitor Program (No design),

Overlays – Swapping; Schemes – Paging

– Simple, Multi-level Paging; Internal

and External Fragmentation; Virtual

Memory Concept, Demand Paging –

Page Interrupt Fault, Page Replacement

Algorithms; Segmentation – Simple,

Multi-level, Segmentation with Paging,

Memory Management in UNIX.


learning, Chalk –

Talk,

Presentation

Unit 5: Inter process Communication –

1: Overview of IPC Methods, Pipes,

popen, pclose Functions, Coprocesses,

FIFOs, System V IPC, Message Queues,

Semaphores. Interprocess

Communication – 2: Shared Memory,

Client-Server Properties, Stream Pipes,

Passing File Descriptors, An Open

Server-Version 1, Client-Server

Connection Functions. Information

Management-Files and Directories –

Directory Structure –Directory

Implementation – Linear List - Hash

Table. Device Management: Dedicated,

Shared and Virtual Devices - Serial

Access Devices, Direct Access Devices,

Direct Access Storage Devices –

Channels and Control Units – Disk

Scheduling methods.


learning, Chalk –

Talk,

Presentation

Learning Resources

Operating System



1. Textbooks:

1. Operating Systems Concepts – Silberschatz, Galvin, Wiley Publications

(2008)

2. Modern Operating Systems - Andrew S. Tenenbaum, Pearson Education

Asia / PHI (2005)

3.UNIX System Programming Using C++,by Terrence Chan: Prentice Hall

India, 1999.

4. Advanced Programming in UNIX Environment, by W. Richard Stevens:

2nd Ed, Pearson Education, 2005.

2. Reference Books:

1.Operating Systems – William Stallings, Pearson Education Asia (2002)



Course Outcomes

1. Understand basic technical difference between

different operating systems.

2. Analyze how command line argument works.

3. Able to handle different processes at the same time.

4. Apply memory management in real time applications.

5. Comprehend scheduling of different processes based

on priority.





Marks

Attendance 5 marks

Quiz 5 marks


study

5 marks


activities

5 marks

Computer Organization



COURSE CODE


L T P C

3 1 0 4

Total Credits:4 Total Hours in semester : 45 Total Marks:100





4.1 To understand basic organization of computer.

4.2 To gain knowledge about machine instructions.

4.3 To aware student about representation of an information.

4.4 To give brief idea about different memory technologies.

4.5 To familiar students about input output processes.


hours

Pedagogy

Unit 1: Basic organization of computers,

Block level description of the functional

units as related to the execution of a

program; Fetch, decode and execute

cycle


Presentation

Unit 2: Machine instructions, Instruction

set architectures, Assembly language

programming, addressing modes,

instruction cycles, registers and storage,

addressing modes; discussions about

RISC versus CISC architectures; Inside a

CPU


Presentation

Unit 3: Information representation,

Floating point representation (IEEE 754),

computer arithmetic and their

implementation; Fixed-Point Arithmetic:

Addition, Subtraction, Multiplication and

Division, Arithmetic Logic Units control

and data path, data path components,

design of ALU and data path, controller

design; Hardwired and Micro

programmed Control


Presentation

Unit 4: Memory Technology, static and

dynamic memory, Random Access and

Serial Access Memories, Cache memory

and Memory Hierarchy, Address


learning, Chalk –

Talk,

Presentation




Mapping, Cache updation schemes,

Virtual memory and memory

management unit.

Unit 5: I/O subsystems: Input-Output

devices such as Disk, CD-ROM, Printer

etc.; Interfacing with IO devices,

keyboard and display interfaces; Basic

concepts Bus Control, Read Write

operations, Programmed IO, Concept of

handshaking, Polled and Interrupt-driven

I/O, DMA data transfer; Pipeline

Processing, Instruction and Arithmetic

Pipeline, Pipeline hazards and their

resolution, Parallel Processing


learning, Chalk –

Talk,

Presentation

Learning Resources

1. Textbooks:

1. Computer Organization by V. Carl Hamacher, Safwat G. Zaky and

Zvonko G. Vranesic , McGraw-Hill series (2002)

2. Reference Books:

1. Computer Organization and Design, by David Patterson and John

Hennessey, ” Elsevier. 2008.

2.Computer System Architecture by Mano, M.M.,, Prentice Hall of India,

New Delhi, 1992

3.Computer Systems Design and Architecture (2nd Edition) by Vincent P.

Heuring and Harry F. Jordan (Dec 6, 2003)

4.Computer Architecture and Organization, by Hayes, J.P.1998,McGraw-

Hill



Evaluation Scheme Total Marks100






Course Outcomes

1. Understand how fetch-decode and execute cycle

works.

2. Analyze inside mechanism of computer

3. Apply different information representation in

intermediate code generation,

4. Able to manage memory for different purposes.

5. Comprehend input output organization of computer

with different storage devices,


Marks

Attendance 5 marks

Quiz 5 marks


study

5 marks


activities

5 marks

Database Management System



COURSE CODE


L T P C

3 0 2 4


1 Course Pre-requisites: Basic Computer knowledge




4.1 To gain knowledge about basic concepts of DBMS.

4.2 To aware students about structure of DBMS.

4.3 To give brief idea about transaction processing

4.4 To understand different rules to design database.

4.5 To inculcate understanding of distributed database,


hours

Pedagogy

Unit 1: Basic Concepts - Purpose of

database systems-Components of DBMS

– DBMS Architecture and Data

Independence- Data modeling - Entity

Relationship Model, Relational –

Network- Hierarchical and object

oriented models-Data Modeling using the

Entity Relationship Model.


Presentation

Unit 2: Structure of relational databases

– relational databases – relational

algebra- tuple relational calculus. Data

definition with SQL, insert, delete and

update statements in SQL –views – data

manipulation with SQL


Presentation

Unit 3: Introduction to Transaction

Processing- Transaction and System

Concepts Desirable properties of

Transactions- Schedules and

Recoverability- Serializability of

Schedules-Query processing and

Optimization-Concurrency Control- -

assertions – triggers. Oracle case study:

The basic structure of the oracle system –

database structure and its manipulation in

oracle- storage organization in oracle -

Programming in PL/SQL- Cursor in

PL/SQL


Presentation




Unit 4: Database Design– Design

guidelines– Relational database design –

Integrity Constraints – Domain

Constraints- Referential integrity –

Functional Dependency Normalization

using Functional Dependencies, Normal

forms based on primary keys- general

definitions of Second and Third Normal

Forms. Boyce Codd Normal Form–

Multivalued Dependencies and Forth

Normal Form – Join Dependencies and

Fifth Normal Form – Pitfalls in

Relational Database Design.


learning, Chalk –

Talk,

Presentation

Unit 5: Distributed databases:

Distributed Database Concepts- Data

Fragmentation, Replication and

Allocation Techniques- Different Types-

Query Processing – semijoin -

Concurrency Control and Recovery.


learning, Chalk –

Talk,

Presentation

Learning Resources

1. Textbooks:

1. Fundamentals of Database System Elmasri and Navathe (4rd Edition),

Pearson Education Asia (2008)

2. Database System Concepts - Henry F Korth, Abraham Silbershatz, Mc

Graw Hill 2nd edition. (2005)

2. Reference Books:

1.An Introduction to Database Systems - C.J.Date (7th Edition) Pearson

Education Asia (2006)

2.An Introduction to Database Systems – Bibin C. Desai ,Galgotia

Publications , (2000)









Course Outcomes

1.Understand importance of DBMS

2. Able to manipulate structure of DBMS

3. Apply PL/SQL in real time applications,

4. Design database with all necessary constrains

5. Analyze concurrency and redundancy in distributed

database.


Marks

Attendance 5 marks

Quiz 5 marks


study

5 marks


activities

5 marks

Python Programming for IOT



COURSE CODE


L T P C

3 0 2 4


1 Course Pre-requisites: Introduction to Programming




4.1 To understand the nature of programming as human activity and learn and experience

main components of programming process

4.2 To inculcate students about main control structures of procedural programming

languages

4.3 To provide depth knowledge about List, Tuple & Dictionaries

4.4 To aware students about python utility and basic function

4.5 To make student familiar about function and its use in recent technologies of IOT


hours

Pedagogy

Unit 1: Installation and Working with

Python, Essentials of a Python program,

Program Structure of Python, Basic

Syntax, Variables and Identifiers, Built-

In Data Types. Variable definition,

Operators And Expressions, Constants

And Literals, Basic Input/output

Statement.


Presentation

Unit 2: Decision Making - Conditions,

Relational Operators, Logical

Connectives, If-Else , Nested If-Else

Statement, Replacement of switch case

Loops: While loop, Do-while, For loop,

Nested loops , Break, Continue and pass

Statements. Arrays – One dimensional

and multidimensional array, Array

processing. String Manipulation -

accessing Strings, Basic Operations,

String slices and Function and Methods


Presentation

Unit 3: Lists: Introduction, accessing

list, Operations, Working with lists,

Function and Methods. Tuple:

Introduction, accessing tuples,

Operations, Working, Functions and


Presentation




Methods. Dictionaries: Introduction,

Accessing values in dictionaries,

Working with dictionaries, Properties,

Functions

Unit 4: Dates and Time: Basic date and

time classes, Different time formats,

Converting between formats, Formatting

dates and times, Parsing date/time

information, Binary Data: What is Binary

Data? , Binary vs. text, Using the Struct

module. Defining a function, Python

Built-in Functions , Calling a function,

Types of functions, Function Arguments,

Default Argument, Anonymous

functions, Global and local variables,

Custom Functions vs. Standard

Functions, Refactoring, Making

Functions Reusable, Functions as Data.


learning, Chalk –

Talk,

Presentation

Unit 5: An Introduction to libraries used

for IOT: numpy, matplotlib, pandas,

opencv, tinker, tensorflow, mraa, sockets,

mysqldb, requests, paho-mqtt,


learning, Chalk –

Talk,

Presentation

Learning Resources

1. Textbooks:

1. John V Guttag. “Introduction to Computation and Programming Using

Python”, Prentice Hall of India

2. R. Nageswara Rao, “Core Python Programming”, dreamtech

2. Reference Books:

1. Wesley J. Chun. “Core Python Programming - Second Edition”,

Prentice Hall

2. Kenneth A. Lambert, “Fundamentals of Python – First Programs”,

CENGAGE Publication

3. Luke Sneeringer, “Professional Python”, Wrox






http://nptel.ac.in/




Course Outcomes

1. Able to understand basics of python programming

2. Understand the concepts of loops and control

structures for different purposes.

3. Comprehend about working of list and dictionaries.

4. Design python application with the use of date-time

and other functions.

5.Apply in development of real time applications of IOT



Marks

Attendance 5 marks

Quiz 5 marks


study

5 marks


activities

5 marks

Python Programming for AI & ML



COURSE CODE


L T P C

3 0 2 4


1 Course Pre-requisites: Introduction to Programming




4.1 To understand the nature of programming as human activity and learn and experience

main components of programming process

4.2 To inculcate students about main control structures of procedural programming

languages

4.3 To provide depth knowledge about List, Tuple & Dictionaries

4.4 To aware students about python utility and basic function

4.5 To make student familiar about function and its use in recent technologies of AI


hours

Pedagogy

Unit 1: Installation and Working with

Python, Essentials of a Python program,

Program Structure of Python, Basic

Syntax, Variables and Identifiers, Built-

In Data Types. Variable definition,

Operators And Expressions, Constants

And Literals, Basic Input/output

Statement.


Presentation

Unit 2: Decision Making - Conditions,

Relational Operators, Logical

Connectives, If-Else , Nested If-Else

Statement, Replacement of switch case

Loops: While loop, Do-while, For loop,

Nested loops , Break, Continue and pass

Statements. Arrays – One dimensional

and multidimensional array, Array

processing. String Manipulation -

accessing Strings, Basic Operations,

String slices and Function and Methods


Presentation

Unit 3: Lists: Introduction, accessing

list, Operations, Working with lists,

Function and Methods. Tuple:

Introduction, accessing tuples,

Operations, Working, Functions and


Presentation




Methods. Dictionaries: Introduction,

Accessing values in dictionaries,

Working with dictionaries, Properties,

Functions

Unit 4: Dates and Time: Basic date and

time classes, Different time formats,

Converting between formats, Formatting

dates and times, Parsing date/time

information, Binary Data: What is Binary

Data? , Binary vs. text, Using the Struct

module. Defining a function, Python

Built-in Functions , Calling a function,

Types of functions, Function Arguments,

Default Argument, Anonymous

functions, Global and local variables,

Custom Functions vs. Standard

Functions, Refactoring, Making

Functions Reusable, Functions as Data.


learning, Chalk –

Talk,

Presentation

Unit 5: An Introduction to libraries used

for AI and ML: numpy, matplotlib,

pandas, opencv, tinker, tensorflow, keras,

tensorflow, Theano, Sci-kit learn,

PyTorch


learning, Chalk –

Talk,

Presentation

Learning Resources

1. Textbooks:

1. John V Guttag. “Introduction to Computation and Programming Using

Python”, Prentice Hall of India

2. R. Nageswara Rao, “Core Python Programming”, dreamtech

2. Reference Books:

1.Wesley J. Chun. “Core Python Programming - Second Edition”, Prentice

Hall

2. Kenneth A. Lambert, “Fundamentals of Python – First Programs”,

CENGAGE Publication

3.Luke Sneeringer, “Professional Python”, Wrox






http://nptel.ac.in/




Course Outcomes

1. Able to understand basics of python programming

2. Understand the concepts of loops and control

structures for different purposes.

3. Comprehend about working of list and dictionaries.

4. Design python application with the use of date-time

and other functions.

5.Apply in development of real time applications of AI

and ML



Marks

Attendance 5 marks

Quiz 5 marks


study

5 marks


activities

5 marks




Semester - IV Semester I B. Tech Computer Science & Engineering

Sr.



L T P C Hrs/W

k.



1 BTCE401 Mathematics for

Specialization 3 1 0 4 4 20 50 30 -- -- 100

2 BTCE402 Computer Networks 3 0 2 4 5 20 50 30 25 25 150

3 BTCE403 Microprocessor &

Interfacing 3 0 2 4 5 20 50 30 25 25 150

4 BTCE404 Web Architecture and

Application 3 0 2 4 5 20 50 30 25 25 150

5 BTCE405 Software Engineering 3 0 2 4 5 20 50 30 25 25 150

6 BTCE406 Specialized Track Elective –

II 3 0 2 4 5 20 50 30 25 25 150

7 BTCE407 Student Industrial Training

– IV 0 0 0 2 0 -- -- -- -- -- 100

Total 18 2 8 26 28 950


Mathematics for Specialization



COURSE CODE


L T P C

3 1 0 4


1 Course Pre-requisites: Basic Mathematics




4.1 To aware students about algebraic and linear equations

4.2 To give brief idea about interpolation

4.3 To comprehend working of numerical calculus

4.4 To provide information regarding curve fitting

4.5 To elaborate linear programming


hours

Pedagogy

Unit 1:

Solution Algebraic and Transcendental

Equations: Bisection, False position,

Newton Raphson Method, Secant

Method. Solution using Matlab.

Solution of system of Linear

Equations: Gauss Elimination method,

LU decomposition method, Gauss Seidel

method. Solution using MATLAB. Eigen

values and Eignvectors using MATLAB.


Presentation

Unit 2:

Interpolation: Newton’s forward and

backward interpolation, Newton’s

divided difference interpolating

polynomials, Lagrange Interpolating

polynomials. Solution using MATLAB.


Presentation

Unit 3:

Numerical Differentiation: First and

second order differentiation Equations of

Equally Spaced Data.

Solution using MATLAB.

Numerical Integration: Trapezoidal

rule, Simpson’s one third and 3/8th rule.

Solution using MATLAB


Presentation




Numerical methods for Solution of

ordinary differential equation: Taylor’s

Series method, Euler’s method, Runge

Kutta forth ordered method, Milne’s

Predictor Corrector Method. Finite

element method to solve second order

ODE. Solution using MATLAB

Unit 4:

Curve Fittings: General Linear Least

Squares-forcasting method, Fitting of

quadratic and exponential curves.

Solution using MATLAB


learning, Chalk –

Talk,

Presentation

Unit 5:

Linear Programming

Formulation of LPP, Solving LPP using

graphical method, areas of applications.

Fourier series: Periodic functions,

Fourier series, Euler’s formulae, Fourier

series of even and odd functions, Fourier

series of periodic functions with arbitrary

periods. Introduction to Harmonic

analysis, Applications to computer

science, Application in field of Periodic

Signals


learning, Chalk –

Talk,

Presentation

Learning Resources

1. Textbooks:

1. Kevin Night and Elaine Rich, Nair B., “Artificial Intelligence (SIE)”, Mc-

Graw Hill- 2008.

2. Dan W. Patterson, “Introduction to AI and ES”, Pearson Education, 2007.

2. Reference Books:

1. Peter Jackson, “Introduction to Expert Systems”, 3rd Edition, Pearson

Education, 2007.

2. Stuart Russel and Peter Norvig “AI – A Modern Approach”, 2nd Edition,

Pearson Education 2007.

3. Deepak Khemani “Artificial Intelligence”, Tata Mc Graw Hill Education

2013.





http://nptel.ac.in/




Course Outcomes

1. Organize & present quantitative data and think

critically with respect to quantitative information

characterized by the centre, spread, and skewness of data.

2. Develop the concept of a sampling distribution and

infer some characteristics of a population by examining a

portion of the population and to make informed decision

in a probabilistic environment

3. Express quantitatively the degree and direction of

association between two linearly related variables and fit

a regression model to the data as well as investigating the

explained portion

4. Understand optimization problems particularly

constrained linear models

5. Apply knowledge of linear programming in real

scenarios




Marks

Attendance 5 marks

Quiz 5 marks


study

5 marks


activities

5 marks

Computer Networks



COURSE CODE

Computer Networks

L T P C

3 0 2 4






4.1 To give brief knowledge of computer network components.

4.2 To aware students about protocols at different layers.

4.3 To inculcate students about network layer functionalities.

4.4 To make student understand regarding transportation among the different components.

4.5 To familiar students about security aspects of network architecture.


hours

Pedagogy

Unit 1: Introduction -Hardware and

software, Data communication,

Networking, Protocols and Protocol

architecture, standards. Data

transmission concepts. Analog and

digital transmission. Transmission

impairments. Layered Architecture of

Computer Networks, OSI and TCP/IP

architectures Physical Layer- Guided

transmission media and wireless

transmission, Data encoding - Digital and

analog data and signals, spread spectrum.

Data communication interface -

asynchronous and synchronous

transmission, line configuration and

interfacing. Data link control - Flow

control. Error detection and error control.

HDLC and other data link protocols.

Multiplexing – Frequency-division,

synchronous time-division, and statistical

time-division multiplexing


Presentation

Unit 2: Link Layer :Medium Access

Control: CDMA, ALOHA, and Ethernet;

Link Layer Addressing and Forwarding;

Spanning Trees; The Channel Allocation

Problem, Multiple Access Protocols,


Presentation

Computer Networks



Ethernet, Wireless LANs, Broadband

Wireless, Bluetooth, Data Link Layer

Switching, Switched networks. Circuit-

switched networks. Switching concepts.

Routing in circuit-switched networks.

Control signaling. Packet switching

principles. Routing and congestion

control, x.25 protocol standard. LAN

Technology - LAN architecture. Bus/tree,

ring, star, and wireless LANs. LAN

Systems - Ethernet and Fast Ethernet

(CSMA/CD) Token ring and FDDI, ATM

LANs, Fiber channel, wireless LANs.

Bridges - Bridge operation and routing

with bridges.

Unit 3: Network Layer:Network layer

design issues. Routing algorithms ,

Flooding, Shortest path routing, Link

Sate routing, Hierarchical routing,

Broadcast and multicast routings,

Routing in the Internet, Path Vector

routing, OSPF routing. The network

layer in the Internet: IP protocol,ARP

and RARP, BOOTP, ICMP, DHCP,

Network Address Translation(NAT)

Internetworking


Presentation

Unit 4: Transport Layer:TCP

introduction, Reliable/Un- Reliable

Transport ,TCP , UDP, Congestion

Control,Intra-Domain Routing: Distance-

Vector, Intra-Domain Routing: LinkState,

Wireless Networks: 802.11 MAC,

Efficiency considerations Module6:

Application Layer: DNS-The Domain

Name System,Electronic Mail, HTTP,

FTP, Simple network management

protocol (SNMP)


learning, Chalk –

Talk,

Presentation

Unit 5: Web and Multimedia: The World

Wide Web – client and server side of

www, HTML and webpages, JAVA

language, Locating on the web.

Multimedia- Audio & Video, Data

compression, Video on demand,

Multicast backbone. Security:

Introduction, Cryptography and

Cryptanalysis, Public Key Cryptography


learning, Chalk –

Talk,

Presentation

Computer Networks



Algorithms, RSA Algorithm, DES,

Authentication and Authorization.

Learning Resources

1. Textbooks:

1. Computer Networks, by Andrew S Tanenbaum, PHI. (2010)

2. Data and Computer Communications , by Walliam Stallings, PHI. (2002)

2. Reference Books:

1.Data Communications, Computer networking on OSI , by Fred Halsall,

Addison Wesley Publishing Co.1998

2. Computer Networking -A Top-Down Approach Featuring the Internet ,

James F. Kurose and Keith W. Ross Addison Wesley Publishing Co. 2004

3.Computer Networks: Protocols standards and interfaces , by Uyless Black,

Prentice Hall.2002

4. Data communication & Networks , by Behrou A. Forouzan, Tata McGraw

Hill. 2002



Course Outcomes

1. Able to analyze any networks configuration.

2. Understand TCP/IP protocol for different layers.

3. Visualize network traffic and their communication.

4. Comprehend the working of transport layer

5. Apply security encryption aspects in different

technologies.





Marks

Attendance 5 marks

Quiz 5 marks


study

5 marks


activities

5 marks

Microprocessor & Interfacing



COURSE CODE


L T P C

3 0 2 4


1 Course Pre-requisites: Logic gates and basic computer hardware knowledge




4.1 To make student understand about basic components of micro-processor.

4.2 To aware students about 8085 architecture

4.3 To familiar students about assembly language.

4.4 To give brief knowledge about an architecture of 8086

4.5 To inculcate students for ARM Processor.


hours

Pedagogy

Unit 1: Introduction to Microprocessor,

Components of a Microprocessor:

Registers, ALU and control & timing,

System bus (data, address and control

bus), Microprocessor systems with bus

organization. Microprocessor

Architecture and Operations, Memory,

I/O devices, Memory and I/O operations


Presentation

Unit 2: 8085 Microprocessor

Architecture, Address, Data And Control

Buses, 8085 Pin Functions, De-

multiplexing of Buses, Generation Of

Control Signals, Instruction Cycle,

Machine Cycles, T-States, Memory

Interfacing. Assembly Language

Programming Basics, Classification of

Instructions, Addressing Modes, 8085

Instruction Set, Instruction And Data

Formats, Writing, Assembling &

Executing A Program, Debugging The

Programs


Presentation

Unit 3: Writing 8085 assembly language

programs with decision, making and

looping using data transfer, arithmetic,

logical and branch instructions. Stack &

Subroutines, Developing Counters and


Presentation




Time Delay Routines, Code Conversion,

BCD Arithmetic and 16-Bit Data

operations. Interfacing Concepts, Ports,

Interfacing Of I/O Devices, Interrupts In

8085, Programmable Interrupt Controller

8259A, Programmable Peripheral

Interface 8255A

Unit 4: 8086 logical block diagram and

segments, 80286: Architecture, Registers

8 20% (Real/Protected mode), Privilege

levels, descriptor cache, Memory access

in GDT and LDT, multitasking,

addressing modes, flag register 80386:

Architecture, Register organization,

Memory access in protected mode,

Paging 80486 : Only the technical

features Pentium : Architecture and its

versions


learning, Chalk –

Talk,

Presentation

Unit 5: SUN SPARC Microprocessor:

Architecture, Register file, data types and

instruction format. ARM Processor:

Architecture features, Logical block

diagram of ARM7 architecture


learning, Chalk –

Talk,

Presentation

Learning Resources

1. Textbooks:

1. Microprocessor Architecture, Programming, and Applications with the

8085, Ramesh S. Gaonkar Pub: Penram International.

2. Microprocessors and Interfacing, N. Senthil Kumar, M. Saravanan, S.

Jeevanathan, S. K. Shah, Oxford

3. Advanced Microprocessors, Daniel Tabak, McGrawHill

2. Reference Books:

1. Microprocessor & Interfacing - Douglas Hall, TMH

2. 8086 Programming and Advance Processor Architecture, Savaliya M. T.,

WileyIndia

3. The 8088 and 8086 Microprocessors, Triebel & Singh, Pearson Education






http://nptel.ac.in/




Course Outcomes

1.Understand working of each components in

microprocessor

2. Comprehend architecture of 8085 with its instruction

and addressing formats.

3. Able to write assemble code and understand the

working of 8255A

4. Analyze various components of 8086 components and

how it is different from 8085

5. Apply the knowledge regarding ARM processor in real

time applications.



Marks

Attendance 5 marks

Quiz 5 marks


study

5 marks


activities

5 marks

Web Architecture and Application



COURSE CODE


L T P C

3 0 2 4


1 Course Pre-requisites: Basic Programming




4.1 To understand the basic concepts of web designing

4.2 To aware students about advance HTML Scripting and CSS

4.3 To familiar students about javascript and XML

4.4 To introduce php backend for serverside scripting

4.5 To inculcate students regarding database communication through application.


hours

Pedagogy

Unit 1: Concept of WWW, Internet and

WWW, HTTP Protocol : Request and

Response, Web browser and Web servers,

Features of Web 2.0. Concepts of

effective web design, Web design issues

including Browser, Bandwidth and

Cache, Display resolution, Look and Feel

of the Website, Page Layout and linking,

User centric design, Sitemap, Planning

and publishing website, Designing

effective navigation


Presentation

Unit 2: Basics of HTML, formatting and

fonts, commenting code, color,

hyperlink, lists, tables, images, forms,

XHTML, Meta tags, Character entities,

frames and frame sets, Browser

architecture and Web site structure.

Overview and features of HTML5. Need

for CSS, introduction to CSS, basic

syntax and structure, using CSS,

background images, colors and

properties, manipulating texts, using

fonts, borders and boxes, margins,

padding lists, positioning using CSS,

CSS2, Overview and features of CSS3


Presentation

Unit 3: Client side scripting with 20% 9 Chalk – Talk,




JavaScript, variables, functions,

conditions, loops and repetition, Pop up

boxes, Advance JavaScript: Javascript

and objects, JavaScript own objects, the

DOM and web browser environments,

Manipulation using DOM, forms and

validations, DHTML : Combining

HTML, CSS and Javascript, Events and

buttons. Introduction to XML, uses of

XML, simple XML, XML key

components, DTD and Schemas, Using

XML with application. Transforming

XML using XSL and XSLT

Presentation

Unit 4: Introduction and basic syntax of

PHP, decision and looping with

examples, PHP and HTML, Arrays,

Functions, Browser control and

detection, string, Form processing, Files,

Advance Features: Cookies and Sessions,

Object Oriented Programming with PHP


learning, Chalk –

Talk,

Presentation

Unit 5: Basic commands with PHP

examples, Connection to server, creating

database, selecting a database, listing

database, listing table names, creating a

table, inserting data, altering tables,

queries, deleting database, deleting data

and tables, PHP myadmin and database

bugs


learning, Chalk –

Talk,

Presentation

Learning Resources

1. Textbooks:

1. Ralph Moseley and M. T. Savaliya , “Developing Web Applications”,

Wiley-India

2. Reference Books:

1. “HTML 5, Black Book”, Dreamtech Press.






http://nptel.ac.in/




Course Outcomes

1. Able to understand basic concepts for web scripting

2. Analyze use of HTML in real-time applications

3.Comprehend the working of Javascript and XML

4. Visualize server side scripting

5.Design web application with database connection.



Marks

Attendance 5 marks

Quiz 5 marks


study

5 marks


activities

5 marks

Software Engineering



COURSE CODE


L T P C

3 0 2 4






4.1 To aware students about basic concepts of software engineering and its evolution.

4.2 To familiar students regarding designing of diagrams

4.3 To give brief knowledge about software testing fundamentals.

4.4 To inculcate students about project management.

4.5 To introduce students with different cost time relations.


hours

Pedagogy

Unit 1: Evolution and impact of

Software engineering, software life cycle

models: Waterfall, prototyping,

Evolutionary, and Spiral models.

Feasibility study, Functional and Non-

functional requirements, Requirements

gathering, Requirements analysis and

specification.


Presentation

Unit 2: Basic issues in software design,

modularity, cohesion, coupling and

layering, function-oriented software

design: DFD and Structure chart, object

modeling using UML, Object-oriented

software development, user interface

design. Coding standards and Code

review techniques.


Presentation

Unit 3: Fundamentals of testing, White-

box, and black-box testing, Test coverage

analysis and test case design techniques,

mutation testing, Static and dynamic

analysis, Software reliability metrics,

reliability growth modeling.


Presentation

Unit 4: Software project management,

Project planning and control, cost

estimation, project scheduling using

PERT and GANTT charts.


learning, Chalk –

Talk,

Presentation




Unit 5: Cost-time relations: Rayleigh-

Norden results, quality management, ISO

and SEI CMMI, PSP and Six Sigma.

Computer aided software engineering,

software maintenance, software reuse,

Component-based software development


learning, Chalk –

Talk,

Presentation

Learning Resources

1. Textbooks:

1. Fundamentals of Software Engineering by Rajib Mall, – PHI-3rd Edition,

2009.

2. Reference Books:

1.Software Engineering, by Ian Sommerville, Pearson Education Inc., New

Delhi, (2009).

2. Software Engineering: A Practitioner‟s Approach”, by Roger S. ressman,

McGraw-Hill. (2005)



Course Outcomes

1. Understand the basic concepts of software engineering.

2. Design various diagrams based on the software

planning.

3. Apply white and black box testing on developed

software.

4. Comprehend project management during entire

software development phase.

5. Visualize relationship among different componenets.





Marks

Attendance 5 marks

Quiz 5 marks


study

5 marks


activities

5 marks

IoT Architecture and Protocols




L T P C

3 0 2 4

Total Credits:4 Total Hours in semester : 45 Total Marks: 100

1 Course Pre-requisites: Basic of electronics

2 Course Category: Specialization Track



4.1 To facilitate students to understand IoT and its architecture

4.2 To help students to gain a basic understanding of basic application of IoT protocols

4.3 To inculcate working knowledge of various IoT application layer protocols

4.4 To inculcate understanding of application of IP based protocols and Authentication

Protocols for IoT

4.5 To use of open source IoT Platforms


hours

Pedagogy

Unit 1: Theory: Introduction to IOT,

Applications of IOT, Open Source IoT

Platforms, Use cases of IOT

20% 9 Computer

Based

Learning,

Chalk – Talk,

Presentation

Unit 2:

Theory: The IoT Architectural

Reference Model as Enabler, IoT in

Practice: Examples: IoT in Logistics and

Health, IoT Reference Model: Domain,

information, functional and

communication models;

20% 9 Computer

based

learning,

Chalk – Talk,

Presentation

Unit 3:

Theory:

IoT Reference Architecture: Architecture,

Functional, information, deployment and

operation views; SOA based

Architecture, API-based Architecture,

OPENIoT Architecture for IoT/Cloud

Convergence.


Presentation

Unit 4:

Theory:

Application Protocols for IoT: UPnP,

CoAP, MQTT, XMPP. SCADA,

20% 9 Computer

based

learning,

Chalk – Talk,




WebSocket; IP-based protocols:

6LoWPAN, RPL; Authentication

Protocols; IEEE 802.15.4.

Presentation

Unit 5:

Theory:

Case study: Cloud-Based Smart-

Facilities Management, Healthcare,

Environment Monitoring System.

20% 9 Computer

based

learning,

Chalk – Talk,

Presentation

Learning Resources

1. Textbooks:

1. 1. Bassi, Alessandro, et al, “Enabling things to talk”, Springer-

Verlag Berlin An, 2016.

2. 2. David Hanes, Gonzalo Salgueiro, Patrick Grossetete, Robert

Barton, Jerome Henry, “IoT Fundamentals: Networking Technologies,

Protocols, and Use Cases for the Internet of Things”, CISCO Press, 2017

2. Reference Books:

1. 1. Hersent, Olivier, David Boswarthick, and Omar Elloumi. The

internet of things: Key applications and protocols. John Wiley & Sons,

2011.

2. 2. Buyya, Rajkumar, and Amir Vahid Dastjerdi, eds. Internet of

Things: Principles and paradigms. Elsevier, 2016.



1. Comprehend the essentials of IoT and its applications



End Semester Marks


Marks

Attendance 5 marks

Quiz 5 marks


study

5 marks


activities

5 marks




Course Outcomes

2. Understand the concepts of IoT Architecture

Reference model and IoT reference architecture

3. Analyze various IoT Application layer Protocols.

4. Apply IP based protocols and Authentication Protocols

for IoT

5. Design IoT-based systems for real-world problems.

NoSQL Database



NoSQL Database

L T P C

3 0 2 5

Total Credits:4 Total Hours in semester : 45 Total Marks: 100

1 Course Pre-requisites: Prior knowledge required of RDBMS

2 Course Category: Specialization Track



4.1 To facilitate students to understand NOSQL Database

4.2 To help students to gain a basic understanding of relation databases to new NOSQL

4.3 To inculcate working knowledge of NoSQL tools and techniques

4.4 To inculcate understanding of the detailed architecture, define objects, load data,

query data

4.5 To use of query data and performance tune Document-oriented NoSQL databases


hours

Pedagogy

Unit 1: Theory: Overview,and History of

NoSQL Databases Definition of the Four

Types of NoSQL Database, The Value of

Relational Databases, Getting at

Persistent Data, Concurrency,

Integration, Impedance Mismatch,

Application and Integration Databases,

Attack of the Clusters, The Emergence of

NoSQL, Key Points

20% 9 Computer

Based

Learning,

Chalk – Talk,

Presentation

Unit 2:

Theory: Comparison of relational

databases to new NoSQL stores,

MongoDB, Cassandra, HBASE, Neo4j

use and deployment, Application,

RDBMS approach, Challenges NoSQL

approach, Key-Value and Document

Data Models, Column-Family Stores,

Aggregate-Oriented Databases

20% 9 Computer

based

learning,

Chalk – Talk,

Presentation

Unit 3:

Theory: Replication and sharding,


Presentation

NoSQL Database



MapReduce on databases. Distribution

Models, Single Server, Sharding, Master-

Slave Replication, Peer-to-Peer

Replication, Combining Sharding and

Replication

Unit 4: Theory: NoSQL Key/Value databases

using MongoDB, Document Databases,

What Is a Document Database? Features,

Consistency, Transactions, Availability,

Query Features, Scaling, Suitable

Use Cases, Event Logging, Content

Management Systems, Blogging

Platforms, Web Analytics or

Real-Time Analytics, E-Commerce

Applications, When Not to Use,

Complex Transactions

Spanning Different Operations, Queries

against Varying Aggregate Structure.

20% 9 Computer

based

learning,

Chalk – Talk,

Presentation

Unit 5: Theory: Column- oriented NoSQL

databases using Apache HBASE,

Column-oriented NoSQL databases

using Apache Cassandra, Architecture of

HBASE, What Is a Column-Family Data

Store? Features, Consistency,

Transactions, Availability, Query

Features, Scaling, Suitable Use Cases,

Event Logging, Content Management

Systems, Blogging Platforms, Counters,

Expiring Usage, When

Not to Use

20% 9 Computer

based

learning,

Chalk – Talk,

Presentation

Learning Resources

1. Textbooks:

1. Sadalage, P. & Fowler, M. (2012). NoSQL Distilled: A Brief Guide

to the Emerging World of Polyglot Persistence. (1st Ed.). Upper

Saddle River, NJ: Pearson Education, Inc. ISBN- 13: 978-

0321826626 ISBN- 10: 0321826620

2. Reference Books:

1. Redmond, E. & Wilson, J. (2012). Seven Databases in Seven Weeks:

NoSQL Database



A Guide to Modern Databases and the NoSQL Movement (1st Ed.).

Raleigh, NC: The Pragmatic Programmers, LLC. ISBN-13: 978-

1934356920 ISBN-10: 1934356921







Marks

Attendance 5 marks

Quiz 5 marks


study

5 marks


activities

5 marks

Course Outcomes

1. Define, compare and use the four types of NoSQL

Databases (Document-oriented, KeyValue Pairs,

Columnoriented and Graph).

2. Demonstrate an understanding of the detailed

architecture, define objects, load data, query data

and performance tune Key-Value Pair NoSQL

databases

3. Demonstrate an understanding of the detailed

architecture, define objects, load data, query data

and performance tune Column-oriented NoSQL

databases.

4. Explain the detailed architecture, define objects,

load data, query data and performance tune

Document-oriented NoSQL databases

5. Evaluate NoSQL database development tools and

programming languages.

Date post:	28-Nov-2020
Category:	Documents
Upload:	others
View:	1 times
Download:	0 times

Bachelor of Technology in Computer Science & Engineering (Data … · 2020. 5. 18. · CSE Course...

Documents