COMPUTER SCIENCE AND ENGINEERING · 5.7 Internship: All the students shall undergo the internship period of 4 weeks and the students have an option of choosing their own industry

AR - 13

ACADEMIC REGULATIONS

COURSE STRUCTURE

AND

DETAILED SYLLABUS

COMPUTER SCIENCE AND ENGINEERING

for

B.TECH. FOUR YEAR DEGREE PROGRAMME

(Applicable for the batches admitted from 2013 - 2014)

ADITYA INSTITUTE OF TECHNOLOGY AND MANAGEMENT

(AUTONOMOUS)

Approved by AICTE,

Recognised under 2(f) 12(b) of UGC,

Permanently Affiliated to JNTU Kakinada.

K.Kotturu, Tekkali, Srikakulam – 532201, Andhra Pradesh.

AR - 13 - B.Tech. - CSE

Aditya Institute of Technology And Management – Tekkali.

Vision of the Institute

To evolve into a premier engineering institute in the country by continuously

enhancing the range of our competencies, expanding the gamut of our activities and

extending the frontiers of our operations.

Mission of the Institute

Synergizing knowledge, technology and human resource, we impart the best quality

education in Technology and Management. In the process, we make education more

objective so that the efficiency for employability increases on a continued basis..

Vision of the Department

To become a pioneer in providing high quality education and research in the area of

computer science and engineering.

Mission of the Department:

M1: Enrich society and advance computer science and engineering by preparing

graduates with the knowledge, ability, and skill to become innovators and leaders

who are able to contribute for the aspirations of the country and society.

M2: Benefit humanity through research, creativity, problem solving, and application

development.

M3: Share knowledge and expertise to benefit the country, the region, and beyond

while inspiring people to engage in computing fields.


Aditya Institute of Technology And Management – Tekkali.

Program Outcomes (PO’s)

a. An ability to apply knowledge of computing, mathematics and science to solve

engineering problems appropriate to CSE.

b. An ability to analyze a problem, and identify and define the computing requirements

appropriate to its solution.

c. An ability to design, implements, and evaluate a computer-based system, process,

component, or program to meet desired needs.

d. An ability to function effectively on teams to accomplish a common goal.

e. An ability to identify, formulates, analyze and solve problems and substantiate the

conclusions.

f. An understanding of professional, ethical, legal, security and social issues and

responsibilities.

g. An ability to communicate the engineering activities effectively with a range of

audience.

h. An ability to analyze the local and global impact of computing on individuals,

organizations, and society.

i. An ability to apply engineering management principles and economic decision making

knowledge to manage projects

j. An ability to continuously update their knowledge on contemporary issues.

k. An ability to use current techniques, skills, and tools necessary for computing practice.

l. An ability to qualify in competitive examinations like GATE, IES etc., and to engage in

continuing professional development through life-long learning.

Program Educational Objectives (PEO’s)

PEO1. Be employed as a practicing engineer in fields such as design, development, testing and

research or undertake higher studies.

PEO2. Engage in lifelong self-directed learning, a capacity that is vital for success in today’s

global and rapidly changing engineering environment.

PEO3. Create new methods / processes to meet the society needs with their knowledge.

PEO4. Conduct themselves as ethical and responsible professionals with good communication

skills and demonstrate leadership skills.


Aditya Institute of Technology And Management – Tekkali. 1

ADITYA INSTITUTE OF TECHNOLOGY AND MANAGEMENT

(AUTONOMOUS)

Approved by AICTE, Recognized under 2(f) and 12(b) of UGC,

Permanently Affiliated to JNTUK, Kakinada,

K.Kotturu, Tekkali, Srikakulam-532201, Andhra Pradesh.

Academic Regulations 2013 for B. Tech.

(Effective for the students admitted into I year from the Academic Year 2013-2014 and onwards)

1. Award of B.Tech. Degree

A student will be declared eligible for the award of the B. Tech. Degree if he/she fulfills the

following academic regulations.

(a) Pursued a course of study for not less than four academic years and not more than

(b) Registered for 180 credits and he/she must secure total 180 credits.

2. Students, who fail to complete their Four years Course of study within 8 years or fail to acquire

the 180 Credits for the award of the degree within 8 academic years from the year of their

admission, shall forfeit their seat in B. Tech course and their admission shall stand cancelled.

3. Courses of study

The following courses of study are offered at present with specialization in the B.Tech. Course.

Sl. No. Branch Code-Abbreviation Branch

01 01-CE Civil Engineering

02 02-EEE Electrical and Electronics Engineering

03 03-ME Mechanical Engineering

04 04-ECE Electronics and Communication

Engineering

05 05-CSE Computer Science and Engineering

06 12-IT Information Technology

And any other course as approved by the authorities of the University from time to time.

4. Credits (Semester system from I year onwards):

Sl. No Course Credits

1 Theory Course 02/03

2 Laboratory Course 02

3 Advanced Laboratory Course 03

4 Self Study Course/Internship 01

5 Employability skills 02

6 Project 06



5. Evaluation Methodology:

The performance of a student in each semester shall be evaluated subject – wise with a Maximum

of 100 marks for theory course and 75 marks for laboratory and other courses. The project work

shall be evaluated for 200 marks.

5.1 Theory course:

For theory courses the distribution shall be 30 marks for internal midterm evaluation and 70

marks for the External End - Examinations.

Out of 30 internal midterm marks 25 marks are allotted for descriptive exam and 5 marks for

assignments.

(i) Pattern for Internal Midterm Examinations (25 marks):

For theory courses of each semester, there shall be 3 Midterm descriptive/Objective exams. Each

descriptive / objective exam is consists of 120 minutes duration for 25 marks. The average of the

best two out of three Mid exams will be taken for the assessment of internal marks.

The first Midterm examination to be conducted usually after 5 weeks of instruction, the second

Midterm examination to be conducted usually after 11 weeks of instructions and the third

Midterm examination will be conducted usually after 17 weeks of instructions.

Each Midterm question paper shall contain 4 questions, out of 4 questions first question is

objective type which contains 10 questions with 1 mark each (10 x 1 = 10M) and remaining 3

questions are descriptive type (3 x 10 = 30). The student should answer all 4 questions.

(ii) Pattern for External End Examinations (70 marks):

(a) There shall be an external examination for every theory course and consists of two parts

(part-A and part-B). The duration of the time for this end examination is 3 hours.

(b) Part-A shall contain 10 marks , which is compulsory. It has 10 short questions with 1

mark each (10x1=10M). Two questions will be given from each unit.

(c) Part-B of the question paper shall have descriptive type questions for 60 marks. There

shall be one question from each unit with internal choice. Each question carries 12

marks. Each course shall consist of 5 units of syllabus.

5.2. Laboratory Course:

(i) (a) For practical subjects there shall be continuous evaluation during the semester for 25 internal

marks and 50 semester end examination marks. Out of the 25 marks for internal: 10 marks for day

to day work, 5 marks for record and 10 marks to be awarded by conducting an internal laboratory

test. The end examination shall be conducted by the teacher concerned and external examiner

from outside the college.



(b) For the benefit of the students, two advanced labs are introduced with some specialized areas in

each B.Tech. Program.

(ii.) For the course having design and / or drawing, (such as Engineering Drawing, Machine Drawing)

and estimation, the distribution shall be 30 marks for internal evaluation (15 marks for day–to–day

work, and 15 marks for internal tests) and 70 marks for end examination. There shall be two internal

tests in a Semester and the average of the two shall be considered for the award of marks for internal

tests.

5.3 Project Work:

Out of a total of 200 marks for the project work, 60 marks shall be for Project Internal Evaluation

and 140 marks for the End Semester Examination. The End Semester Examination (Viva – Voce)

shall be conducted by the committee. The committee consists of an external examiner, Head of

the Department and Supervisor of the Project. The evaluation of project work shall be made at the

end of the IV year. The Internal Evaluation shall be made on the basis of two seminars given by

each student on the topic of his project which was evaluated by an internal committee.

5.4 Self Study Course:

Four Periods per week (which includes library, e-learning, Internet and presentation) are

allotted for this course. Self Study shall be evaluated for 75 Marks.

Out of 75 Marks, 25 marks for day-to-day evaluation and 50 marks on the basis of end

examination conducted by internal committee consisting of Head of the Department, Two

Senior faculty Members of the department concerned. There shall be no external examination

for self-study.

5.5 Audit Course:

Audit course is one among the compulsory courses and does not carry any credits. The audit

courses will start from the II year I- semester onwards. The lists of audit courses are shown

below:

i) Professional Ethics and Morals

ii) Intellectual Property Rights & Patents

5.6 Employability Skills:

Employability skills shall be evaluated for 75 marks. 25 marks for day-to-day evaluation and 50

marks on the basis of end (internal) examination. There is no external examination for

employability skills.



5.7 Internship:

All the students shall undergo the internship period of 4 weeks and the students have an option of

choosing their own industry which may be related to their respective branch. A self study report

for the internship shall be submitted and evaluated during the IV year II-Semester and will be

evaluated for a total of 75 marks consists of 25 marks for internal assessment and 50 marks for

end examination.

Internal assessment for 25 marks shall be done by the internship supervisor. Semester end

examination for 50 marks shall be conducted by committee consists of Head of the Department,

internal supervisor and an external examiner.

6. Attendance Requirements:

(i.) A student shall be eligible to appear for End Semester examinations, if he/she acquires a minimum

of 75% of attendance in aggregate of all the subjects.

(ii.) Condonation of shortage of attendance in aggregate up to 10% (65% and above and below 75%)

in each semester with genuine reasons and shall be approved by a committee duly appointed by

the college. The condonation approved otherwise it can be reviewed by the College academic

committee.

(iii.) A Student will not be promoted to the next semester unless he satisfies the attendance

requirement of the present semester. They may seek re-admission for that semester when offered

next.

(iv.) Shortage of Attendance below 65% in aggregate shall in NO case be condoned.

(v.) Students whose shortage of attendance is not condoned in any semester are not eligible to take

their end examination of that class and their registration shall stand cancelled.

(vi.) A fee stipulated by the college shall be payable towards condonation of shortage of attendance.

7. Minimum Academic Requirements:

7.1 Conditions for pass and award of credits for a course:

a) A candidate shall be declared to have passed in individual course if he/she secures a minimum of

40% aggregate marks i.e 40 out of 100, 30 out of 75 (Internal & Semester end examination

marks put together), subject to a minimum of 35% marks i.e 24 marks out of 70 and 17 out of 50

in semester end examination.

b) On passing a course of a programme, the student shall earn assigned credits in that Course.



7.2 Method of Awarding Letter Grades and Grade Points for a Course.

A letter grade and grade points will be awarded to a student in each course based on his/her

performance as per the grading system given below.

Table: Grading System for B.Tech. Programme

Percentage Grade Points Letter Grade

90 - 100% 10 S

80 - 89% 9 A

70 - 79% 8 B

60 - 69% 7 C

50 - 59% 6 D

40 - 49% 5 E

< 40% 0 F (Fail)

7.3. Calculation of Semester Grade Points Average (SGPA)* for semester

The performance of each student at the end of the each semester is indicated in terms of SGPA.

The SGPA is calculated as below:

ΣCR

GP)Σ(CRSGPA

(for all courses passed in semester)

Where CR = Credits of a Course

GP = Grade points awarded for a course

*SGPA is calculated for the candidates who passed all the courses in that semester.

7.4, Calculation of Cumulative Grade Points Average (CGPA) and Award of Division for Entire

Programme.

The CGPA is calculated as below:

ΣCR

GP)Σ(CRCGPA

(For entire programme)

Where CR = Credits of a course

GP = Grade points awarded for a course



Table: Award of Divisions

CGPA DIVISION

≥ 7.75 First Class with distinction

≥ 6.75 and < 7.75 First Class

≥ 5.75 and < 6.75 Second Class

≥ 5.00 and < 5.75 Pass Class

< 5 Fail

7.5 Supplementary Examinations:

Supplementary examinations will be conducted in every semester.

7.6 Conditions for Promotion:

(i.) A student will be promoted to second year, if he/she put up the minimum attendance requirement.

(ii.) A student shall be promoted from II to III year only if he fulfills the academic requirement of

total 50% credits (if number credits is in fraction, it will be rounded off to lower digit) from

regular and supplementary examinations of I year and II year examinations, irrespective of

whether the candidate takes the examination or not.

(iii.) A student shall be promoted from III year to IV year only if he fulfills the academic requirements

of total 50% credits (if number of credits is in fraction, it will be rounded off to lower digit) from

regular and supplementary examinations of I Year, II Year and III Year examinations,

irrespective of whether the candidate takes the examinations or not.

(iv.) A student shall register and put up minimum attendance in all 180 credits and earn all 180 credits,

marks obtained in 180 credits shall be considered for the calculation of percentage of marks.

8. Course pattern:

(i.) The entire course of study is of four academic years and each year will have TWO Semesters

(Total EIGHT Semesters).

(ii.) A student is eligible to appear for the end examination in a subject, but absent for it or failed in

the end examinations may appear for that subject’s supplementary examinations, when offered.



(iii.) When a student is detained due to lack of credits / shortage of attendance, he may be re-admitted

when the semester is offered after fulfillment of academic regulations. Whereas the academic

regulations hold good with the regulations he/she first admitted.

9. Minimum Instruction Days:

The minimum instruction days for each semester shall be 95 clear instruction days.

10. There shall be no branch transfer after the completion of admission process.

11. General:

(i.) Where the words “he” “him” “his”, occur in the regulations, they include “she”, “her”, “hers”.

(ii.) The academic regulation should be read as a whole for the purpose of any interpretation.

(iii.) In the case of any doubt or ambiguity in the interpretation of the above rules, the decision of the

principal is final.

(iv.) The College may change or amend the academic regulations or syllabi at any time and the

changes or amendments made shall be applicable to all the students with effect from the dates

notified by the college.

*********



ADITYA INSTITUTE OF TECHNOLOGY AND MANAGEMENT: TEKKALI

SRIKAKULAM-532201, Andhra Pradesh (India)

Academic Regulations 2013 (AR-13) for B. Tech. (Lateral Entry Scheme)

(Effective for the students getting admitted into II year from the Academic Year 2014- 2018 and onwards)

1. Award of B. Tech. Degree

A student will be declared eligible for the award of the B. Tech. Degree if he/she fulfills the

following academic regulations.

(a.) Pursued a course of study for not less than three academic years and not more than six academic

years.

(b.) Registered for 131 credits and must secure 131 credits.

2. Students, who fail to complete their three year Course of study within six years or fail to acquire

the 131 Credits for the award of the degree within 6 academic years from the year of their

admission, shall forfeit their seat in B. Tech course and their admission shall stand cancelled.

3. Promotion Rule:

(a.) A lateral entry student will be promoted to II year to III year if he puts up the minimum required

attendance in II year.

(b.) A student shall be promoted from III year to IV year only if he fulfills the academic requirements

of total 50% of credits (if number of credits is in fraction, it will be rounded off to lower digit)

from the II Year and III Year examinations , whether the candidate takes the examinations or not.

4. Minimum Academic Requirements:

4.1 Conditions for pass and award of credits for a course:

a) A candidate shall be declared to have passed in individual course if he/she secures a minimum of

40% aggregate marks (Internal & Semester end examination marks put together), subject to a

minimum of 35% marks in semester end examination.

b) On passing a course of a programme, the student shall earn assigned credits in that Course.

4.2 Method of Awarding Letter Grades and Grade Points for a Course.

A letter grade and grade points will be awarded to a student in each course based on his/her

performance as per the grading system given below.



Table: Grading System for B.Tech. Programme

Percentage Grade Points Letter Grade

90 - 100% 10 S

80 - 89% 9 A

70 - 79% 8 B

60 - 69% 7 C

50 - 59% 6 D

40 - 49% 5 E

< 40% 0 F (Fail)

4.3 Calculation of Semester Grade Points Average (SGPA)* for semester

The performance of each student at the end of the each semester is indicated in terms of SGPA.

The SGPA is calculated as below:

ΣCR

GP)Σ(CRSGPA

(for all courses passed in semester)

Where CR = Credits of a Course GP = Grade points awarded for a course

*SGPA is calculated for the candidates who passed all the courses in that semester.

4.4 Calculation of Cumulative Grade Points Average (CGPA) and Award of Division for Entire

Programme.

The CGPA is calculated as below:

ΣCR

GP)Σ(CRCGPA

(for entire programme)

Where CR = Credits of a course GP = Grade points awarded for a course

Table: Award of Divisions

CGPA DIVISION

≥ 7.75 First Class with distinction

≥ 6.75 and < 7.75 First Class

≥ 5.75 and < 6.75 Second Class

≥ 5.00 and < 5.75 Pass Class

< 5 Fail

5. All other regulations as applicable for B. Tech. Four- year degree course (Regular) will hold good

for B. Tech. (Lateral Entry Scheme)



DISCIPLINARY ACTION FOR MALPRACTICES / IMPROPER CONDUCT IN EXAMINATIONS

Nature of Malpractices/Improper conduct Punishment

1 (a)

If the student possesses or keeps accessible in

examination hall, any paper, note book,

programmable calculators, Cell phones, pager,

palm computers or any other form of material

concerned with or related to the subject of the

examination (theory or practical) in which he is

appearing but has not made use of (material shall

include any marks on the body of the student which

can be used as an aid in the subject of the

examination)

Expulsion from the examination hall and cancellation of the performance in that subject only.

(b) If the student gives assistance or guidance or receives it from any other student orally or by any other body language methods or communicates through cell phones with any student or students in or outside the exam hall in respect of any matter.

Expulsion from the examination hall and cancellation of the performance in that subject only of all the students involved. In case of an outsider, he will be handed over to the police and a case is registered against him.

2 If the student has copied in the examination hall from any paper, book, programmable calculators, palm computers or any other form of material relevant to the subject of the examination (theory or practical) in which the student is appearing.

Expulsion from the examination hall and cancellation of the performance in that subject and all other subjects the student has already appeared including practical examinations and project work and shall not be permitted to appear for the remaining examinations of the subjects of that Semester/year.

3 If the student impersonates any other student in connection with the examination.

The student who has impersonated shall be expelled from examination hall. The student is also debarred and forfeits the seat. The performance of the original student, who has been impersonated, shall be cancelled in all the subjects of the examination (including practicals and project work) already appeared and shall not be allowed to appear for examinations of the remaining subjects of that semester/year. The student is also debarred for two consecutive semesters from class work and all semester end examinations. The continuation of the course by the student is subject to the academic regulations in connection with forfeiture of seat. If the imposter is an outsider, he will be handed over to the police and a case is registered against him.



4 If the student smuggles in the Answer book or additional sheet or takes out or arranges to send out the question paper during the examination or answer book or additional sheet, during or after the examination.

Expulsion from the examination hall and cancellation of performance in that subject and all the other subjects the student has already appeared including practical examinations and project work and shall not be permitted for the remaining examinations of the subjects of that semester/year. The student is also debarred for two consecutive semesters from class work and all semester end examinations. The continuation of the course by the student is subject to the academic regulations in connection with forfeiture of seat.

5 If the student uses objectionable, abusive or offensive language in the answer paper or in letters to the examiners or writes to the examiner requesting him to award pass marks.

Cancellation of the performance in that

subject.

6 If the student refuses to obey the orders of the Chief Superintendent/Assistant -Superintendent / any officer on duty or misbehaves or creates disturbance of any kind in and around the examination hall or organizes a walk out or instigates others to walk out, or threatens the officer-in charge or any person on duty in or outside the examination hall of any injury to his person or to any of his relations whether by words, either spoken or written or by signs or by visible representation, assaults the officer-in-charge, or any person on duty in or outside the examination hall or any of his relations, or indulges in any other act of misconduct or mischief which result in damage to or destruction of property in the examination hall or any part of the College campus or engages in any other act which in the opinion of the officer on duty amounts to use of unfair means or misconduct or has the tendency to disrupt the orderly conduct of the examination.

In case of students of the college, they shall

be expelled from examination halls and

cancellation of their performance in that

subject and all other subjects the

candidate(s) has (have) already appeared and

shall not be permitted to appear for the

remaining examinations of the subjects of

that semester/year. The students also are

debarred and forfeit their seats. In case of

outsiders, they will be handed over to the

police and a police case is registered against

them.

7 If the student leaves the exam hall taking away answer script or intentionally tears off the script or any part thereof inside or outside the examination hall.

Expulsion from the examination hall and cancellation of performance in that subject and all the other subjects the student has already appeared including practical examinations and project work and shall not be permitted for the remaining examinations of the subjects of that semester/year. The student is also debarred for two consecutive semesters from class work and all University examinations. The continuation of the course by the candidate is subject to the academic regulations in connection with forfeiture of seat.



8 If the student possesses any lethal weapon or firearm in the examination hall.

Expulsion from the examination hall and

cancellation of the performance in that

subject and all other subjects the student has

already appeared including practical

examinations and project work and shall not

be permitted for the remaining examinations

of the subjects of that semester/year. The

student is also debarred and forfeits the seat.

9 If student of the college, who is not a candidate for the particular examination or any person not connected with the college indulges in any malpractice or improper conduct mentioned in clause 6 to 8.

Student of the college, expulsion from the examination hall and cancellation of the performance in that subject and all other subjects the student has already appeared including practical examinations and project work and shall not be permitted for the remaining examinations of the subjects of that semester/year. The candidate is also debarred and forfeits the seat. Person(s) who do not belong to the College will be handed over to police and. a police case will be registered against them.

10 If the student comes in a drunken condition to the

examination hall.

Expulsion from the examination hall and

cancellation of the performance in that


already appeared including practical

examinations and project work and shall not

be permitted for the remaining examinations

of the subjects of that semester/year.

11 Copying detected on the basis of internal evidence,

such as, during valuation or during special scrutiny.

Cancellation of the performance in that


appeared including practical examinations

and project work of that semester/year

examinations.

AR - 13 - B.Tech – CSE

Aditya Institute of Technology and Management, Tekkali 13

ADITYA INSTITUTE OF TECHNOLOGY & MANAGEMENT, TEKKALI – 532201

(AUTONOMOUS)

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

AR-13 REGULATION B.Tech COURSE STRUCTURE

I YEAR I SEMESTER

S.No. CODE COURSE L T P Credits Internal External

1 13HS1001 English-I 3 1 0 3.0 30 70

2 13BS1001 Engineering Mathematics-I 3 1 0 3.0 30 70

3 13BS1002 Engineering Mathematics-II 3 1 0 3.0 30 70

4 13CS1001 Computer Programming 3 1 0 3.0 30 70

5 13ME1001 Engineering Drawing 1 0 3 3.0 30 70

6 13BS1004 Engineering Physics 3 1 0 3.0 30 70

7 13CS1101 Computer Programming Lab 0 0 3 2.0 25 50

8 13BS1101 Engineering Physics Lab 0 0 3 2.0 25 50

9 13ME1101 Engineering Workshop 0 0 3 2.0 25 50

Total Periods 16 5 12 24 255 570

I YEAR II SEMESTER

S.No

. CODE COURSE L T P Credits

Internal External

1 13HS1002 English-II 2 1 0 2.0 30 70

2 13BS1003 Engineering Mathematics-III 3 1 0 3.0 30 70

3 13HS1003 Environmental Studies 3 1 0 3.0 30 70

4 13CS1002 Data Structures 3 1 0 3.0 30 70

5 13ME1003 Engineering Mechanics 3 1 0 3.0 30 70

6 13BS1005 Engineering Chemistry 3 1 0 3.0 30 70

7 13HS1101

Basic English Language

Communication Skills Lab 0 0 3 2.0 25 50

8 13CS1102 Data Structures Lab 0 0 3 2.0 25 50

9 13BS1102 Engineering Chemistry Lab 0 0 3 2.0 25 50

10 13CS1103

Information Technology

Workshop Lab 0 0 3 2.0 25 50

Total Periods 17 6 12 25 280 620



II YEAR I SEMESTER

S.No CODE COURSE L T P Credits Internal External

1 13BS2006 Probability and Statistics 3 1 0 3.0 30 70

2 13CS2003

Math. Foundation of Computer

Science 3 1 0 3.0 30 70

3 13CS2004 Advanced Data Structures 3 1 0 3.0 30 70

4 13EC2006 Digital Logic Design 3 1 0 3.0 30 70

5 13EE2003

Electrical & Electronics

Engineering 3 1 0 3.0 30 70

6 13CS2104 Advanced Data Structures Lab 0 0 3 2.0 25 50

7 13EC2104 Digital Logic Design Lab 0 0 3 2.0 25 50

8 13EE2103

Electrical & Electronics

Engineering Lab 0 0 3 2.0 25 50

9 13HS2102

Advanced English Language

Communication Skills Lab 0 0 3 2.0 25 50

10 13CS2201 Self Study Course-1 (4 Periods) 0 0 0 1.0 75 -

Total Periods 15 5 12 24.0 325 550

II YEAR II SEMESTER


1 13CS2005 Software Engineering 3 1 0 3.0 30 70

2 13CS2006 Object Oriented Programming 3 1 0 3.0 30 70

3 13CS2007 Database Management Systems 3 1 0 3.0 30 70

4 13CS2008

Computer Organization and

Architecture 3 1 0 3.0 30 70

5 13CS2009

Formal Languages & Automata

Theory 3 1 0 3.0 30 70

6 13CS2010

Principles of Programming

Languages 3 1 0 3.0 30 70

7 13CS2105 Object Oriented Programming Lab 0 0 3 2.0 25 50

8 13CS2106

Database Management Systems

Lab 0 0 3 2.0 25 50

9 13HS2201 Professional Ethics & Morals 2 0 0 0.0 - -

Total Periods 20 6 6 22.0 230 520

*2 Periods which includes library, e-learning, internet and presentation.



III YEAR I SEMESTER


1 13HS3006 Industrial Management Science 3 1 - 3.0 30 70

2 13CS3011 Compiler Design 3 1 - 3.0 30 70

3 13CS3012 Computer Networks 3 1 - 3.0 30 70

4 13CS3013 Design and Analysis of Algorithms 3 1 - 3.0 30 70

5 13CS3014 Operating Systems 3 1 - 3.0 30 70

6 13CS3107 Compiler Design Lab - - 3 2.0 25 50

7 13CS3108 Operating Systems Lab - - 3 2.0 25 50

8 13CS3109 Computer Networks Lab - - 3 2.0 25 50

9 13CS3202 Self Study Course - 2 ( 4 Periods ) - - - 1.0 75 -

Total Periods 15 5 9 22.0 300 500

*2 Periods which includes library, e-learning, internet and presentation.

III YEAR II SEMESTER

S.No. CODE COURSE L T P Credits Internal External

1 13CS3015 Data Warehousing & Data Mining 3 1 0 3.0 30 70

2 13CS3016 Web Technologies 3 1 0 3.0 30 70

3 13CS3017 Network Security & Cryptography 3 1 0 3.0 30 70

4 13CS3018 Computer Graphics 2 1 0 3.0 30 70

5 13CS3019 Unix Programming 3 1 0 3.0 30 70

6 xxxxxxxx Elective - I : 3 1 0 3.0 30 70

7 13CS3110 Web Technologies Lab 0 0 4 3.0 25 50

8 13CS3111 UNIX Programming Lab 0 0 3 2.0 25 50

9 13HS3202 Intellectual Property Rights &

Patents 2 0 0 0.0 - -

Total Periods 20 6 7 23.0 230 520

S.No Elective – I

i) 13CS3024 Software Project Management

ii) 13CS3025 Advanced Computer Architecture

iii) 13CS3026 Advanced Databases

iv) 13CS3027 Information Retrieval Systems

v) 13CS3028 Artificial Intelligence



IV YEAR I SEMESTER


1 13CS4020 UML & Design Patterns 3 1 0 3.0 30 70

2 13CS4021 Mobile Computing 3 1 0 3.0 30 70

3 13CS4022 Open Source Software 3 1 0 3.0 30 70

4 xxxxxxxx Elective - II 3 1 0 3.0 30 70

5 xxxxxxxx Open Elective 3 1 0 3.0 30 70

6 13CS4112 UML & Design Patterns Lab 0 0 3 2.0 25 50

7 13CS4113 Mobile Application Development Lab 0 0 4 3.0 25 50

8 13CS4114 Open Source Software Lab 0 0 3 2.0 25 50

9 13HS4203 Employability Skills 0 0 3 2.0 75 -

Total Periods 15 5 13 24.0 300 500

S.No Open Elective Elective - II

i) 13OE4001 Air Quality Management 13CS4029 Bio Informatics

ii) 13OE4002 Cyber laws 13CS4030 Cloud Computing

iii) 13OE4003 Entrepreneurial Development 13CS4031 Image Processing

iv) 13OE4004

Industrial safety And

Environment

13CS4032

Neural Networks and Soft

Computing

v) 13OE4005

Micro Electrical mechanical

Systems

13CS4033 Multimedia Computing

vi) 13OE4006 Optimization Techniques

vii) 13OE4007 Renewable Energy

viii) 13OE4008 Advanced materials

ix) 13OE4009 Total quality management

IV YEAR II SEMESTER


1 13CS4023 Software Testing Methodologies 3 1 0 3.0 30 70

2 xxxxxxxx Elective - III 3 1 0 3.0 30 70

3 xxxxxxxx Elective – IV 3 1 0 3.0 30 70

4 13CS4203

Internship 0 0 0 1.0 25 50

5 13CS4204

PROJECT WORK 0 0 0 6.0 60 140

Total Periods 9 3 0 16.0 175 400

S.No Elective – III Elective - IV

i) 13CS4034 Human Computer Interaction 13CS4039

Social Networks and the

Semantic Web

ii) 13CS4035 E-Commerce 13CS4040 Advanced Operating Systems

iii) 13CS4036 Parallel Computing & Algorithms 13CS4041 Simulation Modeling

iv) 13CS4037 Embedded Real Time Systems 13CS4042 Computer Forensics

v) 13CS4038 Machine Learning 13CS4043

Mobile Adhoc and Sensor

Networks

AR - 13 - B.Tech – CSE I Year I Semester

Aditya Institute of Technology and Management - Tekkali 17

ENGLISH-I

(Common for All Branches)

Credits : 3 External Marks : 70

Subject Code: 13HS1001 Internal Marks : 30

Course Objectives

• To improve the language proficiency of a technical under-graduate in English with

emphasis on LSRW skills.

• To provide learning environment to practice listening, speaking, reading and writing

skills.

• To assist the students to carry on the tasks and activities through guided instructions

and materials.

• To effectively integrate English language learning with employability skills and

training.

• To provide hands-on experience through case-studies, mini-projects, group and

individual presentations.

• To expose the students to a variety of self-instructional modes of language learning.

• To develop learner autonomy.

Course Outcomes

1. Students will be able to use English language in their day-to-day life.

2. Students will be able to employ LSRW skills within and beyond the classroom

environment.

3. Students will be able to integrate English Language Learning with employability

skills.

4. Students will be able to relate classroom language learning to the real life situations.

5. Students will be able to interpret things and draw inferences accordingly.

Unit – I :

Lost Forests by Johannes V Jensen

Reading – Vocabulary – Essential Grammar – Writing – Classroom activities.

Unit – II :

More than 100 million women missing by Amartya Sen


Unit – III :

Three Days to See – Helen Keller




Unit – IV :

Reaching the Stars – Kalpana Chawla


Unit – V :

Kalahandi by Jagannath Prasad Das


References:

1. Musings on Vital Issues” Ed. P. J. George Pub: Orient Blackswan

2. My Story by Helen Keller

3. Kalpana Chawla: A Life – Padmanabhan, Anil

4. Word Power Made Easy – Norman Lewis



ENGINEERING MATHEMATICS-I

(Common to All Branches)

Credits: 3 External Marks: 70

Subject Code: 13BS1001 Internal Marks: 30

Course Objectives

• To identify & solve the 1st order differential equations and apply in Engineering.

• To understand the process of solving a 2nd and higher order differential equation and

solve it. Identify a 2nd and higher order differential equation & solve it in engineering

topics.

• To identify and solve Laplace and Inverse Laplace transforms of different functions,

apply the knowledge of its properties in Engineering.

• To understand the generalized mean value theorems & their use to find the series

expansions of functions and in turn their application in finding the maxima and minima

of two variable functions.

• Apply the properties of curves in applications of single integral, solve the multiple

integrals and to develop the capacity to understand the applications of multiple

integrals.

Course Outcomes

1. Can solve the 1st order differential equations choosing suitable method and apply to

estimate population, temperature, quantity and trajectory.

2. Can solve a 2nd and higher order differential equations with constant coefficients,

choosing suitable rule & apply to LCR Circuits and Simple Harmonic equations.

3. Can identify Taylor series and Mc Laurent’s series for two variable functions and

calculate extreme values of two variable functions, three variable functions with

constraints.

4. Can solve the single, multiple integrals, calculate surface and volume of solids

choosing suitable integral, and calculate the moment of inertia.

5. Can calculate gradient, divergence, curl of a function, solve line, surface and volume

integrals and apply to calculate work done, area, volume. Evaluate the multiple

integrals by integrating suitable vector integral theorems.

Unit – I

Linear Differential Equations of first order:

Linear differential equations of first order and first degree – exact, linear and Bernoulli.

Applications: Newton’s Law of cooling, Law of natural growth and decay, orthogonal

trajectories.

Unit-II

Linear Differential Equations of Second and higher order:

Linear differential equations of second and higher order with constant coefficients- Complete

solution, Operator D, Rules for finding complementary function, Inverse operator D, Rules

for finding particular integral with RHS term of the type e ax , Sin ax, cos ax, polynomials in

x, e ax V(x), xV(x). Method of variation of parameters.

Applications: LCR circuit, Simple Harmonic motion



Unit-III

Partial Differentiation:

Introduction-Total derivative - Chain rule - Generalized Mean Value theorem for single

variable (without proof)-Taylors and Mc Laurent’s series for two variables – Functional

dependence – Jacobian.

Application: Maxima and Minima of functions of two variables with constraints and without

constraints.

Unit-IV

Multiple Integrals:

Applications of Integration to Lengths, Volumes and Surface areas of revolution in Cartesian

and Polar Coordinates.

Multiple integrals - double and triple integrals – change of variables – Change of order of

Integration-Cartesian and Polar coordinates.

Application: Moment of inertia

Unit-V

Vector Calculus:

Vector Differentiation: Gradient- Divergence- Curl - Laplacian and second order operators-

Vector identities.

Vector Integration - Line integral – work done – Potential function – area- surface and

volume integrals. Vector integral theorems: Greens, Stokes and Gauss Divergence Theorems

(Without proof) and related problems.

Applications: Work done, Force.

Text Books:

1. Higher Engineering Mathematics, 42nd edition, 2012 - B. S. Grewal, Khanna

Publishers, New Delhi.

2. Engineering Mathematics, Volume-I, 11th editions respt., 2012, Dr. T.K.V.Iyengar &

others, S. Chand Publishers.

Reference Books:

1. Engineering Mathematics, 4th edition, 2009 - B. V. Ramana, Tata McGraw Hill, New

Delhi.

2. A Text Book of Engineering Mathematics – I & II, 2nd edition, 2011, U. M. Swamy &

others – Excel Books, New Delhi.

3. Advanced Engineering Mathematics, 8th edition, 2009, Erwin Kreyszig- Shree

Maitrey Printech Pvt.Ltd, Noida.



ENGINEERING MATHEMATICS – II


Credits: 3 External Marks : 70


Course Objectives

• Identify, formulate, and solve the algebraic and transcendental equations. Solve the

problems under curve fitting.

• To identify and solve Laplace and Inverse Laplace transforms of different functions,

apply the knowledge of its properties in Engineering.

• Approximate an unknown function y = f(x) tabulated at evenly or unevenly spaced

points by a polynomial. Develop the capacity to find the numerical solution of an

ordinary differential equation and evaluate definite integrals.

• Solve linear and non-linear 1st order partial differential equations. Solve the wave,

heat and Laplace equations by the method of separation of variables.

Course Outcomes

1. Can solve the algebraic and transcendental equations by different numerical

methods and estimate a linear and non-linear curve to the given data by the method

of least squares.

2. Can calculate the value of dependent variable for a particular x by deducing the

unknown function y = f(x) for an evenly or unevenly spaced points, estimate the

value of derivatives, evaluate the definite integrals using different numerical

methods.

3. Can calculate the numerical solution of an ordinary differential equation i.e IVP

4. Can deduce Laplace transform of continuous functions using Laplace transform

formulae & properties. Apply Laplace transform to solve I.V.P & B.V.P

5. Can solve linear and non-linear 1st order partial differential equation. Evaluate

wave equations & heat equations using method of separation of variables.

Unit – I

Algebraic and Transcendental Equations and Curve fitting:

Solution of Algebraic and Transcendental Equations: Introduction – The Bisection Method –

The Method of False Position – The Iteration Method – Newton-Raphson Method.

Curve fitting: Fitting a straight line –Second degree curve-exponential curve-power curve by

method of least squares.

Unit-II

Interpolation and Numerical Differentiation and Integration:

Interpolation: Introduction – Finite differences- Forward Differences – Backward differences

–Central differences – Symbolic relations and separation of symbols-Differences of a

polynomial – Newton’s formulae for interpolation – Interpolation with unevenly spaced

points – Lagrange’s Interpolation formula.



Numerical Differentiation and Integration – Differentiation using finite differences –

Trapezoidal rule – Simpson’s 1/3 Rule –Simpson’s 3/8 Rule.

Unit-III

Numerical solution of Ordinary Differential equations:

Solution by Taylor’s series – Picard’s Method of successive Approximations – Euler’s and

Modified Euler’s Method – Runge – Kutta Methods – Predictor – Corrector Methods –

Milne’s Method.

Unit-IV

Laplace and Inverse Laplace transforms:

Laplace transforms of standard functions – Shifting Theorems, Transforms of derivatives and

integrals – Unit step function – Dirac’s delta function – Inverse Laplace transforms –

Convolution theorem.

Application: Solution of ordinary differential equations using Laplace transforms.

Unit-V

Partial Differential equations:

Formation of partial differential equations by elimination of arbitrary constants and arbitrary

functions – solutions of first order linear (Lagrange) equation and non-linear (standard type)

equations. Solution of linear Partial differential equations with constant coefficients – Method

of Separation of Variables.

Applications: One dimensional Wave and Heat equations.

Text Books:


Publishers, New Delhi.

2. Ravindranath, V. and Vijayalaxmi, A., 2nd edition, 2012, A Text Book on

Mathematical Methods, Himalaya Publishing House, Bombay.

Reference Books:

1. Mathematical Methods, 6th edition, 2011, Dr. T. K.V.Iyengar & others S. Chand

Publications.

2. Engineering Mathematics, 4th edition, 2009 - B. V. Ramana, Tata McGraw Hill, New

Delhi.

3. Engineering Mathematics Volume-II, 6th edition, 2012, T.K.V Iyengar, &others,

S.Chand Co. New Delhi.



COMPUTER PROGRAMMING



Subject Code : 13CS1001 Internal Marks : 30

Course Objectives

• To impart adequate knowledge on the need of programming languages and problem

solving techniques.

• To develop programming skills using the fundamentals and basics of C Language.

• To enable effective usage of arrays, structures, functions, pointers and to implement

the memory management concepts.

• To teach the issues in file organization and the usage of file systems.

• To impart the knowledge about pointers which is the backbone of effective memory

handling

• To study the advantages of user defined data type which provides flexibility for

application development

• To teach the basics of preprocessors available with C compiler.

Course Outcomes

1. Understand the fundamentals of C programming.

2. Choose the loops and decision making statements to solve the problem.

3. Implement different operations on arrays and solve problems using

functions.

4. Understand pointers, structures and unions.

5. Implement file operations in C programming for a given application.

UNIT I:

Problem Solving: Definition of a Problem, A Framework for Problem Solving,

Classification of Problems, Algorithms / Pseudo code- Definition, Properties, Flowchart-

Introduction, Introduction to RAPTOR Tool, Flowchart examples for simple computational

problems, Program Development Steps, Computer Languages- Machine, Symbolic and High-

level, Creating and Running Programs: writing, editing, compiling, linking and executing.

C Fundamentals, Character set, C tokens (Identifier and Keywords, Data types, Constants,

variables), Declarations, Expressions, Statements

C Operators: Arithmetic, Unary, Relational and Logical, Assignment and Conditional

Operators, Library Functions. Bit Operations and Boolean Logic

UNIT II:

CONTROL STRUCTURES: if statement, if…else statement-various forms of if, nested if.

ITERATIVE LOOPS: while, do-while and for statements, initialization and updating, event

and counter controlled loops, looping applications, break statement, continue statement, goto

statement, switch statement, nested switch statement, comma statement.



UNIT III:

FUNCTIONS – MODULAR PROGRAMMING: Functions, basics, parameter passing,

Storage classes- extern, auto, register, static, scope rules, block structure, user defined

functions, standard library functions, recursive functions, Recursive solutions, header files,

example c programs. Passing 1-D arrays, 2-D arrays to functions, parameter passing

mechanisms (passing by value), storage classes (auto, register, extern, static), scope of

variable

ARRAYS: Arrays - concepts, declaration, definition, accessing elements, storing elements,

Strings concepts, String handling functions and string manipulations, 1-D arrays, 2-D arrays

and character arrays, Multidimensional arrays , Array applications: Matrix Operations

UNIT IV:

POINTERS: Pointer definition, pointers concepts, initialization of pointer variables, pointers

and function arguments, passing by address, dangling memory, address arithmetic, Character

pointers and functions, pointers to pointers, pointers and multidimensional arrays, dynamic

memory management functions, command line arguments.

ENUMERATED, STRUCTURE AND UNION TYPES: Derived types- structures-

declaration, definition and initialization of structures, accessing structures, nested structures,

arrays of structures, structures and functions, pointers to structures, self referential structures,

unions, typedef, bit-fields, program applications.

UNIT V:

FILE HANDLING: Input and output – concept of a file, Creating, processing, opening and

closing – Bitwise Operations, text files and binary files, Formatted I/o, file I/o operations,

example programs. C pre-processor

Text Books:

1. “The C – Programming Language”, B.W. Kernighan, Dennis M. Ritchie, PHI

2. “Let Us C”, Yashwant Kanitker, Second Edition

Reference Books:

1. “C and data structures: A Snap Shot Oriented Treatise Using Live Engineering

Examples” by Dr. N.B. Venkateswarlu, S Changd & Co, New Delhi.

2.“C Programming: A Problem- Solving Approach”, Forouzan, E. V. Prasad, Giliberg,

Cengage, 2010.

3. “Programming in C”, Stephen G. Kochan, 3/e Pearson, 2007

4. Web-link http://raptor.martincarlisle.com/

***

http://raptor.martincarlisle.com/



ENGINEERING DRAWING

(Common to all Branches)


Subject Code: 13ME1001 Internal Marks: 30

Course Objectives:

• Able to develop drawing skill and representation of I angle and III angle projection,

isometric Projection, Isometric drawing.

Course Outcomes:

1. Construct polygons, ellipse and scales (plain, diagonal, vernier).

2. Draw orthographic projection of points and straight lines in any quadrant,

and determine its true length and true inclination.

3. Draw projections of plane surfaces inclined to either one or both reference

planes.

4. Draw projections of simple solids inclined to one reference plane.

5. Convert orthographic views into isometric projections and vice-versa.

UNIT I

Lettering and Dimensioning: Introduction to various terms; instruments IS 9609 provision,

lettering practice. Elements of dimensioning and systems of dimensioning.

Construction of scales: Plain Scale, Diagonal & Vernier Scales.

Geometric Constructions and Engineering Curves: Construction of Polygons,

Construction of Conic sections–parabola, ellipse and hyperbola using General Method,

construction of ellipse using oblong, arc’s of circles and concentric circles methods.

UNIT II

Orthographic Projections: First and Third Angle Projections:

Projections of Points. Projections of Straight Lines inclined to one reference plane.

UNIT III

Projections of planes - Perpendicular planes & planes inclined to one reference plane and

both reference planes.

UNIT IV

Projections of solids: Classification of solids. Projections of Prism, Cylinder, Pyramid &

Cone inclined to one reference plane.

UNIT V

Conversion of Orthographic Projections to Isometric Projections: Conversion of

Orthographic View to Isometric views

Conversion of Isometric Projection to Orthographic Projections: Conversion of Isometric

view to Orthographic views

Text Books:

1. Engineering Drawing, by N. D. Bhat & V. M Panchall, Charotar Publishing House.

2. Engineering Drawing, by K.L.Narayana & P.Kanniah

Reference Books:

1. K. Venugopal, Engineering Drawing and Graphics, 2nd Ed. New Age International.

2. Luzadder, Warren, J. and Jon. D. M., “Fundamentals of Engineering Drawing”, 11th

Edition, Prentice Hall India.



ENGINEERING PHYSICS


Credits : 3 External Marks:70

Subject Code : 13BS1004 Internal Marks :30

Course Objectives

• To realize the principles of optics in designing optical devices

• To comprehend the Principles of Lasers and Fiber Optics

• To appreciate general principles of crystal and molecular structures and infer X-ray

diffraction as an experimental method for determining crystal structures

• To possess an insight on Magnetic Properties and Dielectric Materials pertaining to

Material Fabrication

• To define the shortcoming of classical physics and describe the need for modifications

to classical theory

Course Outcomes

1. Apply the principles of optics in designing optical devices

2. Outline the Principles of Lasers and Fiber Optics

3. Explain general principles of crystal and molecular structures and infer X-ray

diffraction as an experimental method for determining crystal structure

4. Interpret the knowledge of Magnetic Properties and Dielectric Materials in Material

Fabrication

5. Resolve the discrepancies in classical estimates through quantum principles

UNIT- I: WAVE OPTICS

Interference

Introduction, Principle of Superposition of Waves, Coherence –Young’s Double Slit

Experiment – Intensity Distribution and Fringe Width, Interference in Plane Parallel Film due

to Reflected Light, Newton’s Rings under Reflected Light - Determination of Wavelength of

Monochromatic Source of Light.

Diffraction

Introduction, Types of Diffraction [Fresnel & Fraunhofer], Fraunhofer Diffraction due to

Single Slit – Intensity Distribution Differences between Interference and Diffraction,

UNIT-II: LASERS & FIBER OPTICS

Lasers

Introduction, Characteristics of Lasers- Coherence, Directionality, Monochromacity and High

Intensity, Principle of Laser – Absorption, Spontaneous and Stimulated Emission; Einsteins’s

Coefficients, Population Inversion, Optical Resonator and Lasing Action, Ruby Laser,

Helium-Neon Laser, Applications of Lasers in Industry, Scientific and Medical Fields.

Fiber Optics

Introduction, Principle of Optical Fiber – Total Internal Reflection, Conditions for Light to

Propagate - Numerical Aperture and Acceptance Angle, Optical Fiber Construction, Types of

Optical Fibers – Step Index Fibers and Graded Index Fibers, Differences between Step Index

Fibers and Graded Index Fibers, Differences between Single Mode Fibers and Multimode

Fibers, Advantages of Optical Fibers in Communications.



UNIT-III: INTRODUCTORY SOLID STATE PHYSICS

Crystal Structure

Introduction, Basic Terms – Lattice, Basis, Crystal Structure, Coordination Number, Atomic

Radius, Packing Fraction, Free Volume, Lattice Parameters, Unit Cell and Primitive Cell,

Crystal Systems and Bravais Lattices, Structure and Packing Fractions of Simple Cubic,

Body Centered Cubic and Face Centered Cubic Crystal Structures.

X-Ray Diffraction

Crystal Planes, Directions and Miller Indices, Distance of Separation between successive hkl

Planes – Inter Planar Spacing, Diffraction of X-Rays by Crystal Planes – Bragg’s Law;

UNIT-IV: ESSENTIALS OF MATERIAL SCIENCE

Magnetic Properties

Introduction, Basic Terms – Magnetic Flux (φ), Magnetic Flux Density or Magnetic Field

Induction (B), Magnetic Field Intensity or Magnetic Field Strength (H), Intensity of

Magnetization (I), Permeabilty (µ) & Relative Permeability (µr) and Susceptibility (χ),

Relation between B, H & I, Relation between Relative Permeability and Susceptibility,

Origin of Magnetic Moment – Bohr Magneton, Classification of Magnetic Materials – Dia,

Para and Ferro, Domain Theory of Ferromagnetism – Hysteresis Curve; Soft and Hard

Magnetic Materials.

Dielectric Properties

Introduction, Basic Terms – Electric Field (E), Electric Dipole, Electric Dipole Moment (µe),

Polarizability (α), Polarization Vector (P), Displacement Vector (D), Permittivity (ε) and

Relative Permittivity or Dielectric Constant (εr), and Electric Susceptibility (χe), Relation

between D, E & P, Relation between Relative Permittivity and Susceptibility, Electronic

Polarizability, Ionic Polarizability, Orienational Polarizability and Total Polarizability,

Definitions of Ferro Electricity and Piezoelectricity.

UNIT-V: FREE ELECTRON THEORY & PRELIMINARY QUANTUM

MECHANICS

Free Electron Theory

Introduction, Classical Free Electron Theory, Mean free path, Relaxation time, Drift velocity,

Mobility, Current Density and Electrical Conductivity,

Preliminary Quantum Mechanics

Introduction, Waves and Particles, Wave Particle Duality and De-Broglie Hypothesis,

Experimental Verification – G. P. Thomson Experiment, Time independent Schrödinger

wave equation, Physical Significance of Wave Function, Particle in One Dimensional

Potential Box.

Text Books:

1. Engineering Physics by Mani Naidu, Pearson Publications Chennai

2. A Text Book Of Engineering Physics by Ksheera Sager and Avadhanulu

3. Engineering Physics by Gaur and Gupta

Reference Books:

1. University Physics by Young and Freedman 12th Edition.

2. Fundamental of Physics by Resnick, Halliday and Walker



COMPUTER PROGRAMMING LAB



Subject Code: 13CS1101 Internal Marks : 25

Course Objectives

• To provide the student with the necessary skills to write and debug programs using

the C programming language

• To provide coverage of basic structure of c programming language

• To provide an understanding of the major modules of c programming language

Course Outcomes

1. Solve the given problem using the syntactical structures of C language

2. Develop , execute solution for various problems using the Control

structures of C language

3. Design programs involving arrays.

4. Implement modularity and code reusability concepts using functions.

5. To read and write C program that uses pointers, structures and Unions

6. Implement the C programs using files

Exercise 1

a) Write C programs for calculating • Temperature conversions • Income tax • Area of

triangle

a) Write a C program that reads an integer ‘n’ and rotate ‘n’ bit positions

b) Write a C program to swap contents of two variables without using third variable.

Exercise 2

a) Write a C program to find the student’s grade for given marks.

b) Write a C program to find the greatest of 3 given numbers.

c) Write a C program which takes two integer operands and one operator from the user,

perform the operation and then prints the result. (Consider the operators +,-,*, /, % and

use Switch Statement)

Exercise 3

a) Write a C program to find the sum of individual digits of a positive integer.

b) Write a C program to generate the first ‘n’ terms of the Fibonacci sequence.

c) Write a C program to generate all the prime numbers between 1 and ‘n’.

d) Write a C program to find the reverse a given number.

Exercise 4

a) Write a C program for Addition and multiplication of two Matrices.

b) Write a C program to find the transpose of a matrix in in-place manner.

Exercise 5

Write a C program that uses functions to perform the following operations:

a) To insert a sub-string in to given main string from a given position.

b) To delete n Characters from a given position in a given string.

c) Simple programming examples to manipulate strings.

d) Verifying a string for its palindrome property



Exercise 6

Write C programs that use both recursive and non-recursive functions for the following

a) To find the factorial of a given integer.

b) To find the GCD (greatest common divisor) of two given integers.

Exercise 7

a) Write a C functions to find both the largest and smallest number of an array of

integers.

b) Write a C function that uses functions to perform the following:

i) that displays the position/ index in the string S where the string T begins, or –1 if S

doesn’t contain T.

ii) to count the lines, words and characters in a given text.

Exercise 8

a) Write a C function to generate Pascal’s triangle.

b) Write a C function to construct a pyramid of numbers.

c) Write a C function to read in two numbers, x and n, and then compute the sum of this

geometric progression: 1+x+x2+x3+………….+xn

Exercise 9

a) Write a C program Pointer based function to exchange value of two integers using

passing by address.

b) Write a C program which explains the use of dynamic arrays.

c) Write a C program to enlighten dangling memory problem (Creating a 2-D array

dynamically using pointer to pointers approach.

Exercise 10

Write a C programs for Examples which explores the use of structures, union and other

user defined variables

Exercise 11

Write a C program that uses functions to perform the following operations using

Structure:

a) Reading a complex number b) Writing a complex number

c) Addition of two complex numbers d) Multiplication of two complex

numbers

Exercise 12

a) Write a C program which copies one file to another.

b) Write a C program to reverse the first n characters in a file. (Note: The file name and n

are specified on the command line)

Reference Books:

1. C and data structures – Dr. N.B Venkateswarlu, B.S. Publications.

2. C Programming: A Problem - Solving Approach, Forouzan, E. V. Prasad, Giliberg,

Cengage, 2010.

3. Programming in C, Stephen G. Kochan, 3/e Pearson, 2007

4. The C – Programming Language’ B.W. Kernighan, Dennis M. Ritchie, PHI

***



ENGINEERING PHYSICS LAB



Subject Code: 13BS1101 Internal Marks : 25

Course Objectives

• To Interpret the results of mechanical parameters such as modulus of elasticity and

acceleration due to gravity through simple oscillatory experiments using torsional

pendulum or physical pendulum

• To use classic experimental techniques to understand the Phenomenon of resonance with

equipment such as sonometer, Melde’s apparatus and volume resonator to measure

desired properties

• To operate optical systems and design Instrumentation thereof with targeted accuracy

with physical measurements

• To attain ability to use Techniques and Skills associated with Modern Engineering Tools

such as Lasers and Fiber Optics

• To characterize magnetic, dielectric and semiconducting material devices

Course Outcomes

Will be able to

1. Infer the results of mechanical parameters such as modulus of elasticity and

acceleration due to gravity through simple oscillatory experiments using torsional

pendulum or physical pendulum

2. Apply classic experimental techniques to comprehend the Phenomenon of resonance

with equipment such as sonometer, Melde’s apparatus and volume resonator to

measure desired properties

3. Demonstrate the ability to measure properties of optical systems and design

Instrumentation thereof with targeted accuracy for physical measurements

4. Illustrate Techniques and Skills associated with Modern Engineering Tools such as

Lasers and Fiber Optics

5. Evaluate characteristics of magnetic, dielectric and semiconducting material devices

LIST OF EXPERIMENTS (Any Twelve Experiments have to be completed)

1. Determination of Rigidity Modulus of the Material of Wire using Torsional Pendulum

2. Verification of Laws of Transverse vibrations in Stretched Strings using Sonometer

3. Wedge method – Determination of Thickness of Thin Object (hair)

4. Determination of Numerical Aperture and Bending Loss of an Optical Fiber

5. Determination of Acceleration due to Gravity (g) using Compound Pendulum

6. Determination of Energy Band Gap using the given Semiconductor Diode

7. Newton’s Rings – Determination of the Radius of Curvature of given Convex Lens



8. Slit Width Determination with Single Slit Diffraction Phenomena using LASER

9. Determination of Thermal Coefficient using Thermistor

10. Determination of Wavelength of Monochromatic Source using LASER Diffraction

11. Determination of the Frequency of the given Tuning Fork using Volume Resonator

12. Study of the variation of Magnetic Field along the axis of a Circular Coil using Stewart

and Gee’s Method.

13. Diffraction Grating - Normal Incidence Method; Determination of Wavelength of given

Source of Light using Spectrometer

14. Melde’s Experiment – Determination of the Frequency of the Electrically Driven Tuning

Fork

15. AC Sonometer – Determination of Frequency of AC Supply

Manual / Record Book

1. Manual cum Record for Engineering Physics Lab, by Prof. M. Rama Rao, Acme Learning.

2. Lab Manual of Engineering Physics by Dr.Y. Aparna and Dr. K. Venkateswara Rao

(VGS books links, Vijayawada)



ENGINEERING WORKSHOP



Subject Code: 13ME1101 Internal Marks: 25

Course Objectives:

• The Engineering Workshop Practice for engineers is a training lab course spread over

entire year. The modules include training on different trades like Fitting, Carpentry, Black

smithy etc… which makes the students to learn how various joints are made using wood

and other metal pieces.

Course Outcomes:

1. Make half-lap, mortise & tenon, corner dovetail or bridle wooden joints.

2. Develop sheet metal into objects like square tray, taper side tray, conical funnel or

elbow pipe.

3. Forge MS rod from round to square cross-section, or into L- or S- bend.

4. Fabricate MS pieces into either a straight, square, dovetail or V-fit.

5. Connect a staircase or a tube light house-wiring electrical circuit.

I. Wood Working Technology - Familiarity with different types of woods used and tools

used in wood Working technology.

Tasks to be performed:

1) To make Half – Lap joint 2) To make Mortise and Tenon joint

3) To make Corner Dovetail joint 4) To make Briddle joint.

II. Sheet Metal Working – Familiarity with different types of tools used in sheet metal

working, developments of sheet metal jobs from GI sheets, knowledge of basic concepts of

soldering.


1) To make Square Tray 2) To make Taper side Tray

3) To make Conical Funnel 4) To make Elbow Pipe.

III. Forging Technology – Familiarity with different types of tools used in forging

technology. Knowledge of different types of furnaces like coal fired, electrical furnaces etc...


1) To make round M.S rod to square

bar

2) To make L bend in given M.S. Rod.

3) To make S bend in given M.S. Rod. 4) To perform heat treatment tests like annealing,

normalizing etc...

IV. Fitting Technology – Familiarity with different types of tools used in fitting technology.


1) To make “V” – fitting 2) To make square fitting

3) To make Dovetail fitting 4) To make Straight fitting

V.HOUSE WIRING

1) Tube light connection

2) Staircase connection

Note: Any two jobs from each trade must be performed by the student.

AR - 13 - B.Tech – CSE I Year II Semester

Aditya Institute of Technology and Management – Tekkali 33

ENGLISH-II



Subject Code : 13HS1002 Internal Marks : 30

Course Objectives

• To improve the language proficiency of a technical under-graduate in English with

emphasis on LSRW skills.

• To provide learning environment to practice listening, speaking, reading and writing

skills.

• To assist the students to carry on the tasks and activities through guided instructions and

materials.

• To effectively integrate English language learning with employability skills and training.

• To provide hands-on experience through case-studies, mini-projects, group and individual

presentations.

• To expose the students to a variety of self-instructional modes of language learning.

• To develop learner autonomy.

Course Outcomes

1. Students will be able to use English language in their day-to-day life.

2. Students will be able to employ LSRW skills within and beyond the classroom

environment.

3. Students will be able to integrate English Language Learning with employability

skills.

4. Students will be able to relate classroom language learning to the real life situations.

5. Students will be able to interpret things and draw inferences accordingly.

Unit – I : Globalization by Joseph Stiglitz


Unit – II : My Early Days by Dr. A. P. J. Abdul Kalam


Unit – III : I have a Dream by Martin Luther King


Unit – IV: The Cop and the Anthem by O. Henry


Unit – V: Telephone Conversation by Wole Soyinka


Reference Books:

• Musings on Vital Issues” Ed. P. J. George Pub: Orient Blackswan

• Wings of Fire – APJ Abdul Kalam

• Short Stories – O. Henry

• 30 days to a more Powerful Vocabulary by Norman Lewis and Wilfred Funk.



ENGINEERING MATHEMATICS – III




Course Objectives

• Calculate the rank of a matrix, solve linear system of equations by different

methods and apply the knowledge to find the current in an electric circuit.

• Understand the concept of eigen values, eigen vectors, Cayley’s Hamilton

theorem and its applications. Also to acquire the knowledge of reduction of

quadratic to canonical form and its applications.

• Acquire the knowledge of Fourier & Inverse Fourier transforms, their properties,

and solving problems.

• Perform the Fourier series expansion of different functions in different intervals.

Also to acquire the knowledge of half range series.

• Acquire the knowledge of z- transforms and inverse z-transforms, their properties

and their applications to solve difference equations.

• Study the Beta and Gamma functions, their properties and their applications to

solve improper integrals.

Course Outcomes

1. Can calculate the rank of a matrix, solve a linear system of equations and apply the

knowledge to calculate the current in a electrical circuit.

2. Can calculate the eigen values, eigen vectors, use Cayley’s Hamilton theorem to

calculate inverse and powers of a matrix. Reduce a quadratic form to canonical form

and find its nature and calculate solution of free vibration of two mass systems.

3. Can find the Fourier series, half range series expansion of different functions in

different intervals, Fourier & inverse Fourier transforms of different functions and

apply to solve definite integrals.

4. Can calculate the z- transforms and inverse z-transforms of different functions and

apply the same to solve the difference equations.

5. Can apply Beta and Gamma functions to solve improper integrals.

UNIT – I

Matrices:

Rank of Matrix- Echelon form, Normal form – Solution of Linear System of equations –

Direct methods, Gauss elimination, Gauss Jordan and Gauss Seidal Methods.

UNIT – II

Eigen values - Eigen vectors – Properties – Cayley -Hamilton Theorem - Inverse and powers

of a matrix by using Cayley-Hamilton theorem

Quadratic forms- Reduction of quadratic form to canonical form – Rank - Positive, negative

definite - semi definite - index – signature.

Applications: Free vibration of a two mass system.



UNIT – III

Fourier series and Fourier Transforms:

Fourier series: Determination of Fourier coefficients (without proof) – Fourier series – even

and odd functions – Fourier series in an arbitrary interval– Half-range sine and cosine series.

Fourier integral theorem (only statement) – Fourier sine and cosine integrals - Fourier

transform – sine and cosine transforms – properties – inverse Fourier transforms – Finite

Fourier transforms.

UNIT – IV

Z- Transforms:

Z-transform – properties – Damping rule – Shifting rule – Initial and final value theorems -

Inverse z-transform – Partial fractions, Convolution theorem.

Application: Solution of Difference equations by Z-transforms.

UNIT – V

Special functions:

Gamma and Beta Functions – Properties - Relation between Beta and Gamma functions-

Evaluation of improper integrals.

Application: Evaluation of integrals.

Text Books:


Publishers, New Delhi

2. Engineering Mathematics Volume - II, 6th editions respt., 2012, T.K.V Iyengar, &

others, S.Chand Co. New Delhi.

Reference Books:

1. Mathematical Methods, 4th edition, 2009, B.V Ramana, Tata McGraw Hill, New

Delhi.

2. Ravindranath, V. and Vijayalaxmi, A., 2nd edition, 2012, A Text Book on

Mathematical Methods, Himalaya Publishing House, Bombay.

3. Dean G. Duffy, Advanced engineering mathematics with MatLab, CRC Press.

4. Advanced Engineering Mathematics, 8th edition, 2009, Erwin Kreyszig- Shree

Maitrey Printech Pvt.Ltd, Noida.



ENVIRONMENTAL STUDIES



Subject Code: 13HS1003 Internal Marks: 30

Course Objectives:

1) Human development and societal development is inevitable. This development is entirely

depends on science and Technological advancement through using resource assets of

nature. In order to reduce the impacts of the technological development, the environmental

studies creating awareness among the engineering graduates. So that we can have a healthy

environment Present and future.

2) The course covers the aspects like general awareness, Resources’ utilization and

conservation, Healthy sustenance of life, pollution control, social aspects, etc. All these

areas will provide and habituate the students towards conservation and sustainable

development.

Course Outcomes:

1. Recognize the general issues of environment and know how to conserve the

environment. They would distinguish the environmental setup and speaks better on

the structural issues of Atmosphere, Lithosphere, Hydrosphere and Biosphere.

Students will list out the variety of resources, their present status and the better

usage of natural resources.

2. Explain the components of ecosystems; the interdependency of life patterns in the

ecosystem and will demonstrate the structural and functional aspects of various

ecosystems. They will classify and appraise the diversity of life on the earth and

their importance; students will differentiate the various conservation methods of

Biodiversity.

3. Examine the various types of pollutants and their impacts on environment and on

health of human beings along with their control methods. Students will review the

different types of e-wastes, their impacts on environment and on health of human

beings and their eco-friendly disposal methods. They can predict the biodegradable

and non-biodegradable materials and know how to reduce non-biodegradable e-

waste.

4. List out the social issues, better judge on the social responsibility and translate the

concept of sustainable development and how to achieve this through green

technologies. They would experiment on the environmental management systems

for clean, green, safe and healthy environment through clean development

mechanisms.

5. Evaluate the changing trends of population curves among different nations and

they would discuss on how to limit the current population size to achieve the

resourceful rich and pollution free earth. Students will collect and compose the

information to document the environmental assets for conservation across different

ecosystems on the earth.



UNIT – I

Multidisciplinary nature of Environmental Studies: Definition, Scope and Importance – Need

for Public Awareness. Environmental components– Atmosphere– Hydrosphere–

Lithosphere– Biosphere. Natural Resources: Resources classification – Natural resources and

associated problems – Forest resources – Use and over – exploitation, deforestation, case

studies – Water resources – Use and over utilization of surface and ground water – Floods,

drought, conflicts over water, dams – benefits and problems on Tribal population &

Environment - Mineral resources: Use and exploitation, Tribal & environmental effects of

extracting and using mineral resources, case studies. - Food resources: World food problems,

changes caused by agriculture and overgrazing, effects of modern agriculture, fertilizer-

pesticide problems, water logging, salinity – concept of sustainable agricultural methods, case

studies. – Energy resources:

Growing energy needs, non-renewable energy sources - coal, crude oil, natural gas - use of

renewable and alternate energy sources.

Case studies. Land resources: Land as a resource, land degradation, man induced landslides,

soil erosion and desertification. Role of an individual in conservation of natural resources.

UNIT – II

Ecosystems: Concept of an ecosystem. - Structure and function of an ecosystem. - Producers,

consumers and decomposers. Food chains, food webs and ecological pyramids. - Energy flow

and nutrient flow in the ecosystems - Ecological succession - Introduction, types,

characteristic features, structure and function of the following ecosystem: a. Forest

ecosystem b. Grassland ecosystem c. Desert ecosystem d. Aquatic ecosystems

(lakes, rivers, oceans, estuaries) Biodiversity and its conservation: Introduction - Definition:

genetic, species and ecosystem diversity. - Bio-geographical classification of India - Value of

biodiversity: consumptive use, productive use, social, ethical, aesthetic and option values -

India as a mega-diversity nation - Hot-sports of biodiversity - Threats to biodiversity: habitat

loss, poaching of wildlife - Endangered and endemic species of India – Conservation of

biodiversity: In-situ and Ex-situ conservation of biodiversity. Case studies.

UNIT – III

Environmental Pollution: Definition, Cause, effects and control measures of :

a. Air pollution b. Water pollution c. Soil pollution

d. Marine pollution e. Noise pollution

f. Thermal pollution g. Nuclear hazards

Solid waste Management: Causes, effects and control measures of urban, Industrial

and bio-medical wastes. - Pollution case studies. Role of individual in prevention of

pollution - Disaster management: floods, earthquake, cyclone and landslides.

UNIT – IV

Social Issues and the Environment: Concept of Unsustainable and Sustainable development –

Urbanization and Urban problems related to energy -Water conservation, rain water

harvesting, watershed management -Resettlement and rehabilitation of people; its problems

and concerns. Case Studies - Climate change, global warming, acid rain, ozone layer

depletion, nuclear accidents and holocaust. Case Studies. -World summits on environment. -

Wasteland reclamation. EIA methodologies. – Environment Protection Act. -Air (Prevention

and Control of Pollution) Act. –Water (Prevention and control of Pollution) Act -Wildlife

Protection Act -Forest Conservation Act -Issues involved in enforcement of environmental

legislation.



UNIT – V

Human Population and the Environment: Population growth, variation among nations.

Population problems and control -Environment and human health. Role of information

Technology in Environment and human health. – Case Studies. Field work: Visit to a local

area to document environmental assets River/forest/ grassland/hill/mountain -Visit to a local

polluted site Urban/Rural/industrial/ Agricultural - Study of common plants, insects, birds. -

Study of simple ecosystems pond, river, hill slopes, etc.

Text Books:

1. Bharucha, E. 2005, Text book of Environmental Studies, First edition, Universities Press

(India) Pvt., Ltd., Hyderabad.

2. Dr. S. Keerthinarayana & Dr. C. Daniel Yesudian. 2004, Principles of Environmental

Science and Engineering, First edition, Anuradha Publications (P) Ltd., Kumbakonam.

3. P. Anandan & R. Kumaravelan. 2010, Environmental Science & Engineering, Sixth

reprint, Scitech Publications (India) (P) Ltd., Chennai.

4. Anubha Kaushik & C. P. Kaushik. 2011, Environmental Studies, Third edition, New Age

International (P) Ltd., New Delhi.

5. Dr. Surinder Deswal & Dr. Anupama Deswal. 2008-09, A Basic Course in Environmental

Studies, Second revised edition, Dhanpat Rai & Co (P) Ltd., New Delhi.

Reference:

1. Odum, E.P. 1971, Fundamentals of Ecology, Third edition, W.B. Saunders & Co (P) Ltd.,

Philadelphia.

2. P.D. Sharma. 1996, Ecology and Environment, Revised edition, Rastogi Publications (P)

Ltd.,

3. Cunningham, W.P., Cunningham, M.A., Principles of Environmental Science. TMH.

4. Peavy, Rowe and Tchobanoglous, Environmental Engineering, Mc Graw – Hill

International edition.

5. Dr. Suresh K. Dhameja. 2006-07, Environmental Studies, Third revised edition, S.K.

Kataria & Sons (P) Ltd., New Delhi.

6. Graedel, T.E., Allenby, B.R., Industrial Ecology and Sustainable Engineering, Pearson

Publications.



B.Tech (Computer Science & Engineering )

DATA STRUCTURES

(Common to CSE, IT Branches)



Course Objectives

• Be familiar with basic techniques of algorithm analysis

• Be familiar with writing recursive methods

• Master the implementation of linked data structures such as linked lists and binary

trees

• Be familiar with advanced data structures such as balanced search trees.

• Be familiar with several sub-quadratic sorting algorithms including quick-sort, merge-

sort.

• Be familiar with some graph algorithms such as shortest path and minimum spanning

tree

• Master the standard data structure library of a major programming language.

• Master analyzing problems and writing program solutions to problems using the

above techniques

Course Outcomes

1. Analyze algorithms to determine correctness and time complexity of simple

algorithms with loops and conditionals, simple recursive methods.

2. Distinguish between the organizations of the following data structures: array-

based-list, double/singly-linked-list, stack, and queue.

3. Apply and implement learned algorithm design techniques and data structures to

solve problems like searching and sorting, conduct performance analysis.

4. Demonstrate the use of binary tree traversals, and Paraphrase the underlying

organization of the following data structures: binary trees, binary search trees.

5. Study an undirected graph and a directed graph using matrix and lists. Also

Develop traversal algorithms like DFS, BFS, Dijkstra’s, MST on graphs.

UNIT–I: INTRODUCTION:

Preliminaries of algorithm, algorithm analysis and complexity; Recursion: definition,

design methodology and implementation of recursive algorithms, linear and binary

recursion, examples; definition of data structure, operations, type of data structures: Linear

& Non-Linear.

UNIT – II: LINEAR DATA STRUCTURES:

Stacks: operations and implementation; Queues: operations and implementation. Linked-

Lists: Singly linked lists, doubly linked lists, circular linked lists, Operations, Applications

and Comparison of Merits and Demerits of Linked Lists; Representing stacks and queues

using arrays and linked lists.

UNIT – III: SEARCHING & SORTING:

SEARCHING: Def., Linear and binary search.

SORTING: basic concepts, Selection Sort, Insertion Sort, Bubble Sort, Quick Sort, Merge

Sort, Comparison of various Sorting techniques.



UNIT – IV: NON-LINEAR DATA STRUCTURES – I:

TREES: basic concepts, terminology, Binary Tree, representation, traversals (In-Order, Pre-

Order, Post-Order); Binary Search tree operations: insertion, deletion, balanced binary

trees.

UNIT – V: NON-LINEAR DATA STRUCTURES – II:

GRAPHS: Basic Concepts, representation and storage of graphs: Adj. Matrices and Adj.

Lists, graph traversals, implementation of DFS and BFS, Shortest-Path Algorithm:

Dijkstra’s Algorithm, Minimum Spanning Tree.

TEXT BOOKS

1. “Computer science, A structured programming approach using C”, B.A. Forouzan and R.F.

Gilberg, Third edition, Thomson.

2. “Data Structures Using C” - A.S.Tanenbaum, Y. Langsam, and M.J. Augenstein,

PHI/Pearson education.

REFERENCE BOOKS :

1. “C and Data Structures” – Dr. N.B Venkateswarlu, B.S. Publications.

2. “C & Data structures” – P. Padmanabham, B.S. Publications.

3. “The C Programming Language”, B.W. Kernighan, Dennis M.Ritchie, PHI/Pearson

Education

***



ENGINEERING MECHANICS

(Common to CSE, IT, EEE, ECE & Civil branches)


Subject Code: 13ME1003 Internal Marks : 30

Course Objectives:

• To provide knowledge on system of forces, free body diagram.

• To provide knowledge on friction between two matting surfaces.

• To provide knowledge on centre of gravity and moment of inertia for different sections.

Course Outcomes:

1. Solve problems using vectorial and scalar representation of forces and moments.

2. Draw free-body diagrams and solve statics problems using resultant force,

moment about a point and equations of equilibrium

3. Comprehend the effect of friction on equilibrium.

4. Calculate centre of gravity and moment of inertia for different cross sections

5. Calculate velocities and accelerations of a particle having rectilinear or curvilinear

motion.

UNIT I

SYSTEMS OF FORCES: Introduction – parallelogram law – Forces and components -

Resultant of coplanar concurrent forces – component forces - vector notation – moment of

force – principle of moments – couples - Resultant of planar force systems.

UNIT II

EQUILIBRIUM OF FORCE SYSTEMS: Equilibrium – free body diagrams – Equations of

equilibrium – equilibrium of planar systems – graphical methods and analytical methods for

equilibrium of planar systems – Moment of a Force and its applications, Varignon’s theorem

UNIT III

FRICTION: Introduction, limiting friction – types of friction and friction laws – application

of friction - Inclined plane, friction of screw and nuts – screw jack.

CENTROIDS AND CENTERS OF GRAVITY: Centre of gravity – centroids of area and

lines – determination of centroids by integration – centroids of composite figures – theorems

of Pappus.



UNIT IV

AREA MOMENT OF INERTIA : Moment of inertia – polar moment of Inertia – Radius of

gyration - Transfer theorem for moment of Inertia – Moment of inertia of composite areas –

product of inertia – Transfer formula for product of Inertia.

MASS MOMENT OF INERTIA : Moment of inertia of masses –Radius of gyration –

Transfer formula for mass moment of inertia – Mass moment of Inertia by Integration.

UNIT V

KINEMATICS : Rectilinear motion-curvilinear motion – Rectangular components of

curvilinear motion - Normal and Tangential components of acceleration, Radial and

transverse components - Kinematics of rigid bodies - angular motion – fixed axis rotation –

Definition and analysis of plane motion.

KINETICS: Kinetics of rigid bodies – equation of planes motion – fixed axis rotation –

rolling bodies (simple examples) - general plane motion (Simple examples).

Text Books:

1. I.B. Prasad: Applied Mechanics, Khanna Publishers, 19th Edition, 2009.

2. Ferdinand L. Singer: Engineering Mechanics, Harper Collins Publishers India, 3rd Edition,

2008.

3. A.K. Tayal: Engineering Mechanics, Umesh Publishers, 13th Edition, 2008.

References Books :

1. Irving. H. Shames: Engineering Mechanics, PHI Publishers, 4th Edition, 2008.

2. Timoshenko & Young: Engineering Mechanics, MGH Publishers, 4th Edition, 2010.

3. K.L. Kumar, Engineering Mechanics, TMH Publishers, 3rd Edition, 2009.

4. Engineering Mechanics by S. Timoshenko and D.H.Young, McGraw-Hill.

5. Engg. Mechanics / S.S. Bhavikati & J.G. Rajasekharappa.



ENGINEERING CHEMISTRY




Course Objectives:

• Acquired sufficient information to ensure that they have an appreciation of polymer

science and the typical role of the polymer scientist in today’s society.

• Leaned about what is meant by corrosion of metals including different forms of metal

degradation and the application of preventative procedures.

• Understand the principles of toxicology, the molecular mechanisms of how chemicals

affect human health and the environment, and the resources to identify and assess

molecular hazards.

• Novel technology materials are almost prepared from rubber material which is very useful

by learning it in this modern civilization.

• Learned about the many scientific, ethical, social and political issues arising from the

development of nanotechnology.

• Understand societal impact and managing possible risks of nanotechnology: present and

future.

• Understand basic interdisciplinary nature of nanotechnology; (physics, chemistry,

electronic and mechanical properties, bio-nanotechnology).

• Evaluate the effectiveness of various types of management practices related to treatment

of drinking water and treatment and disposal of related wastewater.

• Describe the current alternative fuels in use today and the science involved in developing

alternate fuels.

Course Outcomes:

1. Students can able to determine D.O., Turbidity etc of water sample.

2. Students can explain the importance of viscosity, Flash point and Acid value of a

lubricant.

3. Students will determine the amount of acid or base by pH metric and

conductometric titrations.

4. Students have the capacity to determine the hardness of various water samples.

5. Students can able to operate all the instruments in the chemistry laboratory.

UNIT-I: POLYMERS:

Polymerization reactions – Basic concepts, types of polymerisation – addition and

condensation polymerisations, plastics – thermosetting and thermoplastics –

differences.Compounding and Moulding of plastics – Compression, injection, transfer and

extrusion moulding methods. Preparation, properties and engineering uses of the following:

PE, PVC, Teflon, Bakelite, Nylon, Polyesters.

BUILDING MATERIALS: Cement – Classification; Portland cement – raw materials,

manufacture of Portland cement, chemical constitution of Portland cement, Setting and

Hardening of Portland Cement.



UNIT-II: WATER TECHNOLOGY:

Introduction – Hardness of Water – Temporary and Permanent hardness, Units and inter

conversions of Units. Estimation of hardness by EDTA Methods.Problems on Temporary

and Permanent hardnesses. Disadvantages of Hard Water, Methods of Treatment of Water

for Domestic Purposes – Sedimentation, Coagulation, Filtration, Disinfection – Sterilization,

Chlorination, Break Point chlorination, Ozonisation –Industrial Water Treatment –

Desalination, Reverse Osmosis Treatment - Lime-Soda Process, Zeolite Process, Ion-

Exchange Process.

UNIT-III: SCIENCE OF CORROSION:

Definition, examples, Types of corrosion: Theories of corrosion and Mechanism – Dry

corrosion (Direct chemical attack), Wet corrosion (Electrochemical theory) Principles of

corrosion, Galvanic series, Galvanic corrosion, Concentration cell corrosion, mechanism of

wet corrosion – Hydrogen evolution type, oxygen absorption type. Factors influencing

corrosion control of corrosion – proper design, use of pure metal and metal alloys, passivity,

cathodic protection – Sacrificial anode and impressed current. Modifying the environment,

use of inhibitors.

UNIT-IV: FUEL TECHNOLOGY:

Introduction to Liquid Fuels-Classification of Crude Oil-Fractional Distillation-Cracking

(Thermal &Catalytic), Synthetic Petrol (Fischer-Tropschs & Bergius Process) -

Polymerization-Refining &Reforming –Knocking –Anti Knocking Agents-Octane & Cetane

Number.

LUBRICANTS: Principle and functions of lubricants – Types of lubrication and mechanism

– Thick film or Hydrodynamic lubrication, Thin film lubrication, extreme pressure

lubrication. Classification and properties of lubricants – Viscosity, flash and fire points,

cloud and pour points, aniline points, neutralization number and mechanical strength.

UNIT-V: SOLAR ENERGY:

Introduction – harnessing solar energy – photo voltaic cells – Concentrated Solar

Power Plants – green house concepts.

GREEN CHEMISTRY: Introduction-12 principles of green chemistry – green synthesis -

Engineering Applications

NANO CHEMISTRY: Introduction to Nano materials-preparation of few Nano materials

(Carbon Nano Tubes,Fullerenes etc)- Top down and Bottom up concepts - Properties of Nano

materials- Silver and Gold Nano particles - Engineering & Biomedical applications.

Text Books:

• “Engineering Chemistry”, P.C.Jain and Monica Jain, DhanpatRai Publications, Co., New

Delhi 15th Edition.

• “A Text Book of Engineering Chemistry”, S.S. Dara, S.S.Umare, S.Chand& Co., Ltd.,

12th Edition.

Reference Books:

• “A Text Book of Engineering Chemistry” by Dr.Sunita Rattan, S.K. Kataria& Sons

(2012).

• “A Text Book of Engineering Chemistry”, by S. Nagarajan, R. Gopalan,

D.Venkatappayya, 3rd edition, Vikas Publishing House.

• “Engineering Chemistry” by Wiley India Editorial Team, Wiley Publishers (2011).

• “A Text Book of Nano Science and Nano technology”, by T. Pradeep, Tata Mc.Graw

Hills (2012).



BASIC ENGLISH LANGUAGE COMMUNICATION SKILLS LAB




Course Outcomes

• To improve the communication skills through Listening & Practising the structures of

language.

• To make the students to adopt themselves to the situations and converse using their

spontaneity.

• To make the students acquiring the language proficiency.

• To provide the real life situations to emulate the language properly.

• To make them realize the importance of Stress, Intonation and Rhythm of language.

• To make the students to improve pronunciation, vocabulary, language skills,

communication skills, body language and grammar to fulfill the demands of the

employer.

• Students will be able to master Technical and Communicative English Language &

LSRW skills, both Verbal (Oral & Written) & Non- verbal.

Course Objectives

1. Students will be able to transform themselves into effective speakers of

English.

2. Students will be able to emulate the language properly and relate it to the real

life situations.

3. Students will be able to acquire and make use of LSRW skills rather

productively.

4. Students will be able to point out stress on the words and apply rhythm in

their speech.

5. Students will be able to apply know-how of vocabulary efficiently depending

on the context words are used in.

List of Sessions

Unit – I: Introduction to Phonetics, Sentences and its applications and listening skills.

Unit – II: Consonant Sounds, Parts of Speech & Speaking skills.

Unit – III: Vowel Sounds, Tenses & Writing skills.

Unit – IV: Syllable & Stress, voice & Writing skills.

Unit – V: Rhythm & Intonation, Reported Speech & Situational Dialogues.

Text Books:

• “Speak Well” by K. Nirupa Rani, Jayashree Mohan Raj, B. Indira, Orient Blackswan,

Hyderabad (2012)

• “Strengthen your Steps” by Dr. M. Hari Prasad, Dr. John Varghese, Dr. R. Kishore

Kumar, Maruthi Publications, Hyderabad (2010)

Reference Books:

1. A Text Book of English Phonetics: For Indian Students by T. Balasubramanian,

Macmillan Publishers India (2000)

2. Better English pronunciation by J.D. O’Connor, Cambridge Unviersity Press, 23-Oct-

1980.

3. Practical English Usage by Michael Swan.



DATA STRUCTURES LAB

(Common to CSE, IT Branches)



Course Objectives:

• To develop skills to design and analyze simple linear and non linear data

structures

• To strengthen the ability to identify and apply the suitable data structure for

the given real world problem

• To gain knowledge in practical applications of data structures

Course Outcomes:

1. Develop Programs as recursive solutions for basic routine problems.

2. Design programs that use data structures such as: arrays, linked lists, stacks, and

queues.

3. Demonstrate different strategies to solve the most common searching and sorting

algorithms.

4. Develop Programs for implementing various operations on Binary Trees and

Binary Search Trees.

5. Solve problems using the fundamental graph algorithms, including depth-first and

breadth- first search, minimum spanning tree algorithm, and single-source shortest

path.

List of Experiments:

1. (a) Write C programs to generate a Fibonacci series using recursive function.

(b) Write C programs to find the GCD of given numbers.

(c) Write C programs to find the factorial of given number.

2. (a) Write a C program that implement stack operations using arrays.

(b)Write a C program that implement queue operations using arrays.

3. (a)Write a C program to implement various operations (like Create, Display, Count,

Insert, Delete, Search, Copy, Reverse, Sort)on a single linked list.

(b)Write a C program to implement various operations on a double linked list.

(c)Write a C program to implement various operations on a circular linked list.

4. Write a C program that implement stack operations using linked lists.

5. Write a C program that implement queue operations using linked lists.

6. (a)Write a C program to perform linear search for a key value in a given list.

(b)Write a C program that use both recursive and non recursive functions to perform

Binary search for a key value in a given list.

7. (a) Write C programs that implement Selection Sort to sort a given list of integers.

(b) Write C programs that implement Bubble Sort to sort a given list of integers.

(c) Write C programs that implement Insertion Sort to sort a given list of integers.



8. (a) Write C programs that implement Quick Sort to sort a given list of integers.

(b) Write C programs that implement Merge Sort to sort a given list of integers.

9. (a) Write a C program to implement Binary tree traversals using iterative functions.

(b) Write a C program to implement Binary tree traversals using recursive functions.

10. Write a C program to implement the Create, Insert and Delete operations on a Binary

Search Tree.

11. (a)Write a program in C to implement Breadth First search

(b)Write a program in C to implement Depth first search

12. Write a C program to compute the shortest path of a graph using Dijkstra’s algorithm.



ENGINEERING CHEMISTRY LAB



Subject Code : 13BS1102 Internal Marks : 25

Course Objectives:

The students completing this course are expected to understand:

• Determination of hardness, D.O., Turbidity of water.

• Determination of viscosity, flash point and acid value of oil.

• Determination of concentration of a solution pH metrically and conductometrically.

• Synthesis of polymers and preparation of compounds.

Course Outcomes:

1. Students can able to determine D.O., Turbidity etc of water sample.

2. Students can explain the importance of viscosity, Flash point and Acid value of a

lubricant.

3. Students will determine the amount of acid or base by pHmetric and conductometric

titrations.

4. Students have the capacity to determine the hardness of various water samples.

5. Students can able to operate all the instruments in the chemistry laboratory.

List Of Experiments : (Any Twelve)

▪ Introduction to Engineering Chemistry Laboratory.

1) Determine the Acid Value present in the given lubricating oil.

2) Determine the Flash and Fire points of given Oil Sample.

3) Determine the Kinematic Viscosity of a given oil sample by using Viscometer.

4) Estimate the amount of Dissolved Oxygen present in the given water sample by Modern

Winkler’s Method.

5) Determine the Total Hardness present in the given water sample by using EDTA

Method.

6) Estimate the amount of Turbidity present in the given water sample by using Turbidity

meter.

7) Estimate the Viscosity of an Organic Solvent by using Ostwald Viscometer.

8) Prepare Phenol-Formaldehyde Resin and calculate its weight.

9) pH metric Titrations between Strong acid and Strong base.

10) pH metric Titrations between Strong acid and Weak base.

11) Conductometric Titrations between Strong acid and strong base.

12) Conductometric Titrations between Strong acid and Weak base.

13) Colorimetric estimation of Iron (III).

14) Estimate the amount of Calcium present in given cement sample.



Text Books:

1. Practical Engineering Chemistry by K.Mukkanti, etal. B.S.Publications, Hyderabad

(2011)

2. “Lab Manual on Engineering Chemistry” by Dr.Sudharani, DhanpatRai Publications,

Co., New Delhi. (2010)

Reference Books:

1. Engineering Chemistry Lab Manual: SCITECH, ShuchiTiwari (2010)

2. “Vogel Text Book of Quantitative Chemical Analysis”, 6th Edition by G.J.Jeffery,

J.Bassett, J.Mendham, R.C. Denney, Longman Scientific & Technical Publications,

Newyork.

3. “A Text Book of Engineering Chemistry” by R.N.Goyal and HarmendraGoel, Ane

Books, India.

4. “A Text Book on experiments and calculations Engineering, S.S. Dara”, S.Chand&

Co., Ltd., (2003)

5. Instrumental methods of Chemical Analysis, Chatwal, Anand, 5th Edition, Himalaya

Publications.



INFORMATION TECHNOLOGY WORKSHOP LAB




Course Objectives:

• The IT Workshop for engineers is a 6 training lab course spread over 60 hours.

The modules include training on PC Hardware, Internet & World Wide Web and

Productivity tools including Word, Excel, Power Point and Publisher.

• PC Hardware introduces the students to a personal computer and its basic

peripherals, the process of assembling a personal computer, installation of system

software like MS Windows , Linux and the required device drivers. In addition

hardware and software level troubleshooting process, tips and tricks would be

covered.

• Internet & World Wide Web module introduces the different ways of hooking the

PC on to the internet from home and workplace and effectively usage of the

internet. Usage of web browsers, email, newsgroups and discussion forums would

be covered. In addition, awareness of cyber hygiene, i.e., protecting the personal

computer from getting infected with the viruses, worms and other cyber attacks

would be introduced.

• Productivity tools module would enable the students in crafting professional word

documents, excel spread sheets, power point presentations and personal web sites

using the Microsoft suite of office tools and LaTeX.

Course Outcomes:

1. Identify the peripherals of a computer, assemble and disassemble the computer

system

2. Complete the Installation of operating system and solve problems related to

hardware and software in computer system

3. Create, Edit, Format word documents and power point presentations

4. Create ,Organize and analyze data within an Excel spreadsheet

5. Develop a basic understanding of technologies and protocols used on the Internet,

and how to effectively use Internet tools technologies including current web-based

applications, e-mail, search engines

PC Hardware

Week 1 – Task 1 : Identify the peripherals of a computer, components in a CPU and its

functions. Draw the block diagram of the CPU along with the configuration of each

peripheral and submit to your instructor. Every student should disassemble and

assemble the PC back to working condition. Lab instructors should verify the work and

follow it up with a Viva. Also students need to go through the video which shows the

process of assembling a PC. A video would be given as part of the course content.

Week 2 – Task 2 : Every student should individually install MS windows on the personal

computer. Lab instructor should verify the installation and follow it up with a Viva.



Week 3 – Task 3 : Every student should install Linux on the computer. This computer

should have windows installed. The system should be configured as dual boot with both

windows and Linux. Lab instructors should verify the installation and follow it up with

a Viva. Several mini tasks would be that covers Basic commands in Linux and Basic

system administration in Linux which includes: Basic Linux commands in bash, Create

hard and symbolic links, Text processing, Using wildcards

Week 4 – Task 4 : Hardware Troubleshooting : Students have to be given a PC which does

not boot due to improper assembly or defective peripherals. They should identify the

problem and fix it to get the computer back to working condition. The work done

should be verified by the instructor and followed up with a Viva.

Software Troubleshooting : Students have to be given a malfunctioning CPU due to

system software problems. They should identify the problem and fix it to get the

computer back to working condition. The work done should be verified by the

instructor and followed up with a Viva.

Internet & World Wide Web

Week 5 - Task 1 : Orientation & Connectivity Boot Camp : Students should get connected to

their Local Area Network and access the Internet. In the process they configure the

TCP/IP setting. Finally students should demonstrate, to the instructor, how to access the

websites and email. If there is no internet connectivity preparations need to be made by

the instructors to simulate the WWW on the LAN.

Task 2 : Web Browsers, Surfing the Web : Students customize their web browsers

with the LAN proxy settings, bookmarks, search toolbars and pop up blockers. Also,

plug-ins like Macromedia Flash and JRE for applets should be configured.

Week 6 - Task 3 : Search Engines & Netiquette : Students should know what search engines

are and how to use the search engines. A few topics would be given to the students for

which they need to search on Google. This should be demonstrated to the instructors.

Task 4 : Cyber Hygiene : Students would be exposed to the various threats on the

internet and would be asked to configure their computer to be safe on the internet. They

need to first install antivirus software, configure their personal firewall and windows

update on their computer. Then they need to customize their browsers to block pop ups,

block active x downloads to avoid viruses and/or worms.

Word

Week 7 – Word Orientation : The mentor needs to give an overview of Microsoft/

equivalent (FOSS) tool word : Importance of MS/ equivalent (FOSS) tool Word as

word Processors, Details of the four tasks and features that would be covered in each,

Using word – Accessing, overview of toolbars, saving files, Using help and resources,

rulers, format painter in word.

Task 1 : Using word to create project certificate. Features to be covered:-Formatting

Fonts in word, Drop Cap in word, Applying Text effects, Using Character Spacing,

Borders and Colors, Inserting Header and Footer, Using Date and Time option in both

Word.



Week 8 - Task 2 : Creating project abstract Features to be covered:-Formatting Styles,

Inserting table, Bullets and Numbering, Changing Text Direction, Cell alignment,

Footnote, Hyperlink, Symbols, Spell Check , Track Changes.

Task 3 : Creating a Newsletter : Features to be covered:- Table of Content,

Newspaper columns, Images from files and clipart, Drawing toolbar and Word Art,

Formatting Images, Textboxes and Paragraphs

Week 9 - Task 4 : Creating a Feedback form - Features to be covered- Forms, Text Fields,

Inserting objects, Mail Merge in Word.

Excel

Week 10 - Excel Orientation : The mentor needs to tell the importance of MS/ equivalent

(FOSS) tool Excel as a Spreadsheet tool, give the details of the four tasks and features

that would be covered in each. Using Excel –Accessing, overview of toolbars, saving

excel files, Using help and resources

Task 1 : Creating a Scheduler - Features to be covered:- Gridlines, Format Cells,

Summation, auto fill, Formatting Text

Week 11 - Task 2 : Calculating GPA - .Features to be covered:- Cell Referencing, Formulae

in excel – average, std. deviation, Charts, Renaming and Inserting worksheets, Hyper

linking, Count function, LOOKUP / VLOOKUP

Task 3 : Performance Analysis - Features to be covered:- Split cells, freeze panes,

group and outline, Sorting, Boolean and logical operators, Conditional formatting

Week 12 - Task 4 : Cricket Score Card - Features to be covered:-Pivot Tables, Interactive

Buttons, Importing Data, Data Protection, Data Validation

MS/equivalent (FOSS) tool Power Point

Week 13 - Task1 : Students will be working on basic power point utilities and tools which

help them create basic power point presentation. Topic covered during this week

includes :- PPT Orientation, Slide Layouts, Inserting Text, Word Art, Formatting Text,

Bullets and Numbering, Auto Shapes, Lines and Arrows in Power-point.

Week 14 - Task 2 : Second week helps students in making their presentations interactive.

Topic covered during this week includes: Hyperlinks, Inserting –Images, Clip Art,

Audio, Video, Objects, Tables and Charts, Master Layouts (slide, template, and notes),

Types of views (basic, presentation, slide slotter, notes etc), Inserting – Background,

textures, Design Templates, Hidden slides.

Week 15 - Task 3 : Entire week concentrates on presentation part of power point. Topic

covered during this week includes -Using Auto content wizard, Slide Transition,

Custom Animation, Auto Rehearsing.



Publisher

Week 16 : Help students in preparing their personal website using Microsoft/ equivalent

(FOSS) tool publisher. Topic covered during this week includes - Publisher Orientation,

Using Templates, Layouts, Inserting text objects, Editing text objects, Inserting Tables,

Working with menu objects, Inserting pages, Hyper linking, Renaming, deleting,

modifying pages, Hosting website.

TEXT BOOKS:

1. “Comdex Information Technology course tool kit” : Vikas Gupta, WILEY Dreamtech

2. “The Complete Computer upgrade and repair book”, 3rd edition Cheryl A Schmidt,

WILEY Dreamtech

3. “Introduction to Information Technology”, ITL Education Solutions limited, Pearson

Education.

4. “PC Hardware and A+ Handbook” – Kate J. Chase PHI (Microsoft)

5. All others related material is available at

(a) www.sssolutions.in

(b) www.sontisoftsolutions.org

AR - 13 - B.Tech – CSE II Year I Semester


PROBABILITY AND STATISTICS

(Common to CSE and IT)



Course Objectives:

• Understand the concepts of probability, random variables and their distributions, in

particular the binomial distribution and normal distributions.

• Understand the concepts of estimation (confidence intervals) and hypothesis testing

for population averages and percentages

• Use appropriate tabular and graphical formats for displaying univariate (bivariate)

data sets and carry out correlation, regression and chi-square analyses.

• Design and perform hypothesis tests and other evaluative tests

• Analyze a problem in which you are able to apply at least 3 different topics from this

class.

• To learn queuing models and pure birth and death process.

Course Outcomes:

1. Can apply Baye’s theorem to solve industry related problems, understand the

properties of Discrete and Continuous distributions.

2. Can calculate the characteristics of probability distribution under different

conditions using Binomial, Poisson and Normal.

3. Can define the hypothesis, identify appropriate test and apply in a range of

statistical test.

4. Can construct relation between two sets of data, identify and draw control charts

and comment on the data.

5. Can identify and apply the queuing model in our day to day life.

UNIT I :

Probability: Sample space and events – Probability – The axioms of probability - Some

elementary theorems - Conditional probability – Baye’s theorem. Random variables and their

properties: Discrete Random variable, Continuous Random variable, Probability Distribution

their properties, Mathematical expectations, probability generating functions.

UNIT II :

Probability Distributions: Binomial, Poisson, Exponential distributions and their properties

(Definition, mean, variance, moment generating function and its properties, fitting a

distribution) Normal distribution and their properties.

Sampling distribution: Populations and samples - Sampling distributions of mean (known)

proportions, sums and differences.

UNIT III :

Test of Hypothesis : Type I and Type II errors. One tail, two-tail tests -Tests of significance -

Means and proportions – Hypothesis concerning one and two means – Student’s t-test, F-test,

χ 2 test. ANOVA – One way and Two way classification.



UNIT - IV :

Statistical Quality Control, Correlation and Regression: The method of least squares –

Inferences based on the least squares estimation – linear and curvilinear regression –

correlation for univariate and bivariate distributions. Statistical Quality Control Methods for

variable and attribute charts (x-bar, R, p, np charts).

UNIT-V :

Queuing theory: Queue description, characteristics of a queuing model, study state solutions

of M/M/1 Models (finite and infinite population).

TEXT BOOKS:

1. S.P Gupta and V.K Kapoor, Fundemental of Mathematical Statistics, S.Chand

Publications

2. Miller and John E.Freund, Probability and statistics for engineers, Prentice Hall of

India.

3. Dr. T. K.V.Iyengar, Dr. B. Krishna Gandhi, S. Ranganatham, Dr. M.V.S.N. Prasad,

Probability and Statistics, S. Chand Publications.

4. Probability and Statistics, D. K. Murugeson & P. Guru Swamy, Anuradha Publishers.

REFERENCE BOOKS:

1. S.P Gupta and V.K Kapoor, Fundemental of Applied Statistics, S.Chand Publications.

2. Probability, Statistics and Random processes. T. Veerrajan, Tata Mc.Graw Hill, India.

3. Probability, Statistics and Queuing theory applications for Computer Sciences 2 ed,

Trivedi, John Wiley.



MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE


Subject code: 13CS2003 Internal Marks: 30

Course Objectives:

Students are expected to learn:

• The syntax and semantics of propositional and predicate logic.

• How basic concepts in Algebra can be applied in computer science.

• Proof techniques such as Mathematical Induction and Contradiction, these techniques

will come in handy for courses such as Analysis of Algorithms and Automata Theory.

• Understanding of Number Theory will help in Cryptanalysis.

Course Outcomes:

1. Apply equivalence formula and tautological implications in finding normal forms,

theory of inference and differentiate propositional logic and predicates.

2. Explain basic properties, theorems of number theory and mathematical induction

and apply the same in solving problems.

3. Identify the basic properties of graphs and related structures and solve the related

problems.

4. Explain the basic properties, theorems in algebraic systems(Groups and its

homomorphism, co-set decomposition),POSETS, LATTICES and apply the same

in solving the problems.

5. Solve and formulate recurrence relations(Linear and Homogeneous)

UNIT I

Mathematical logic: Propositional calculus: statements and notations, connectives,

Truth tables, Tautologies, Equivalence of formulas, Tautological implications, Normal

forms, Theory of inference for statement calculus.

Predicate Calculus: predicate logic, statement functions, variables and quantifiers, free

and bound variables.

UNIT II

Number Theory: Properties of integers, Division Theorem, The greatest Common

Divisor, Euclidean Algorithm, Least Common Multiple, Testing Prime numbers, The

Fundamental Theorem of Arithmetic (Fermat’s Theorem and Euler’s Theorem)

Mathematical induction– Principle of Mathematical Induction, Exercises.

UNIT III

Graph Theory : Basic Concepts of Graphs, Matrix representation of graphs: Adjacency

Matrices, Incidence Matrices, Isomorphic Graphs, Paths and Circuits, Eulerain graphs,

Planar Graphs, Graph coloring, spanning trees.

UNIT IV

Algebraic Structures:

Algebraic systems – Semi groups and monoids, Homomorphism of Semi group and

Monoids, Groups, Cosets.

Partial ordering – Posets – Lattices as Posets



UNIT V

Recurrence Relations : Generating Function of Sequences, Partial Fractions,

Calculating coefficient of Generating Functions recurrence relations. Formulation as

Recurrence relations, solving Linear homogeneous recurrence relations by substitution.

TEXT BOOKS:

1. Trembly J.P. and Manohar R, “Discrete Mathematical Structures with Applications to

Computer Science”, Tata McGraw–Hill Pub. Co. Ltd, New Delhi, 30th Re-print (2007).

2. Discrete Mathematics for Computer Scientists & Mathematicians, 2/e Mott, Kandel, Baker,

PHI

REFERENCE BOOKS:

1. Kenneth H.Rosen, “Discrete Mathematics and its Applications”, 6th Edition, Special

Indian edition , Tata McGraw – Hill Pub. Co. Ltd., New Delhi, (2007).

2. Ralph. P. Grimaldi, “Discrete and Combinatorial Mathematics: An Applied Introduction”,

Fourth Edition, Pearson Education Asia, Delhi, (2002).

3. Thomas Koshy, ”Discrete Mathematics with Applications”, Elsevier Publications, (2006).

4.. Seymour Lipschutz and Mark Lipson, ”Discrete Mathematics”, Schaum’s Outlines, Tata

McGraw – Hill Pub. Co. Ltd., New Delhi, 2007,Second edition, Fifth reprint.



ADVANCED DATA STRUCTURES



Course Objectives:

The objective of this course is to teach students various data structures and to explain

them algorithms for performing various operations on these data structures. More specifically

the students will able to

• Understand the role of key preprocessing algorithms in hashed data structures.

• Identify various memory models to represent static and dynamic Hashed

structures.

• Study how to balance a Binary Search trees and 2-3 and so on other Trees

• Distinguishes various graph algorithms and techniques for finding minimum path.

• Generalize the binomial heap and binary heap using special tree structures by

combining each other.

• Understand the mapping of real-world problems to algorithmic solutions.

• Know the fact that there is no need to provide a hash function or to change hash

functions as more keys are added to a trie.

Course Outcomes:

1. Demonstrate and Paraphrase open and closed hashing.

2. Analyze how to balance a binary search tree using rotation methods and color

changing methods

3. Solve problems using graph algorithms, including single-source and all-pairs

shortest paths, and minimum spanning tree algorithms.

4. Describe and implement of priory queues and binomial queues

5. Generates new searching algorithms for websites to match the specified string,

numeric or both in an application.

UNIT I:

Dictionaries –Sets, Hash tables representation, hash functions (Division Method,

Multiplication Method, Universal Hashing), collision resolution-separate chaining, open

addressing-linear probing, quadratic probing, double hashing, rehashing. Skip lists and

analysis of Skip List.

UNIT II:

Balanced Trees: AVL Trees- Maximum Height of an AVL Tree, Insertions and Deletions,

Splay trees, 2-3 trees, 2-3-4 trees, Red-black trees Insertion, Deletion.

UNIT III:

Graph algorithms: Minimum-Cost Spanning Trees- Prim's Algorithm, Kruskal'sAlgorithm

Shortest Path Algorithms: Dijkstra's Algorithm, All Pairs Shortest Paths Problem: Floyd’s

Algorithm, Wars hall’s Algorithm,

UNIT-IV:

Priority Queues: Binary Heaps: Implementation of Insert and Delete min, Creating Heap.

Binomial Queues: Binomial Queue Operations, Binomial Amortized Analysis, Lazy

Binomial Queues.



UNIT V:

Text Processing: Pattern matching algorithms-Brute force, the Boyer Moore algorithm, the

Knuth-Morris-Pratt algorithm.

Tries: Definition and concepts of digital search tree, Binary trie, Patricia, Multi-way trie.

TEXT BOOKS :

1. Data structures, Algorithms and Applications in C++, S.Sahni, University Press (India)

Pvt.Ltd, 2nd edition, Universities Press Orient Longman Pvt. Ltd.

2. Data structures and Algorithms in C++, Michael T.Goodrich, R.Tamassia and .Mount,

Wiley student edition, John Wiley and Sons.

REFERENCE BOOKS :

1. Data structures and Algorithm Analysis in C++, Mark Allen Weiss, Pearson Education.

Ltd., Second Edition.

2. Data structures and algorithms in C++, 3rd Edition, Adam Drozdek, Thomson

3. Data structures using C and C++, Langsam, Augenstein and Tanenbaum, PHI.

4. Problem solving with C++, The OOP, Fourth edition, W.Savitch, Pearson education.



DIGITAL LOGIC DESIGN


Credits: 3 External marks: 70

Subject code: 13EC2006 Internal marks: 30

Course Objectives:

The course is designed with the objective to:

• Make the students acquire the knowledge about simplifying the circuits by different

methods.

• Let them learn different sequential circuits.

• Develop analyzing memory devices.

• Make them go through different types of design tools

Course Outcomes:

1. Understand the conversions in number system and Develop the logic circuits

using logic gates.

2. Minimize the boolean logic circuits using K-map and Analyze the operation

of combinational arithmetical circuits like adders, subtractors, carry look

ahead adder and binary multiplier.

3. Consrtuct and analyze the operation of combinational logic circuits like Mux,

Demux, Encoder, Decoder and Comparator etc..

4. Develop the various programmable logic devices like PLA,PAL and PROM.

5. Develop the various types of sequential logic circuits like flip flops, registers

and counters.

UNIT I

Number Systems: Binary, Octal, Decimal, Hexadecimal Number Systems. Conversion Of

Numbers from One Radix to another Radix , r’s Complement and (r-1)’s Complement

Subtraction Of Unsigned Numbers, Problems, Signed Binary Numbers, Weighted and Non-

weighted codes

Logic Gates and Boolean Algebra: Basic Gates: NOT, AND, OR, Boolean Theorems,

Universal Gates, Ex-OR and Ex-NOR Gates, Compliment and dual of logic functions.

Minimizations Of Logic Functions, Multilevel Realization Of Logic Functions. Parity

Checking, Generating Circuits. Introduction to Verilog HDL and Verilog programming for

minimized logic functions.

UNIT II

Gate-Level Minimization: Karnaugh Map Method (K-Map): Minimization Of Boolean

Functions upto four variables, POS and SOP Simplifications with don’t care conditions using

K map

Combinational Arithmetic Logic Circuits: Design Of Half Adder, Full Adder, Half

Subtractor, Full Subtractor, Ripple Adders and Subtractors, Ripple Adder/Subtractor Using

Ones and Twos Complement Method. Serial Adder, Carry Look Ahead Adder, Binary

Multiplier.

UNIT III

Combinational Logic Circuits: Design of Decoders, Encoders, Multiplexers,

Demultiplexers, Higher Order Demultiplexers and Multiplexers, Realization Of Boolean



Functions Using Decoders and Multiplexers, Priority Encoders, Code Converters, Magnitude

Comparator.

UNIT IV

Programmable Logic Devices: PLA, PAL, PROM. Realization of Switching Functions

Using PROM, PAL and PLA. Comparison of PLA, PAL and PROM. Programming Tables

of PLA, PAL and PROM.

UNIT V

Introduction to Sequential Logic Circuits:

Classification, Basic Sequential Logic Circuits: Latch and Flip-Flop, RS- Latch. RS, JK, T

and D Flip flops, truth tables & excitation tables. Conversion of Flip Flops. Flip Flops with

Asynchronous Inputs (Preset and Clear).

Registers and Counters:

Design of Registers, Buffer Register, Control Buffer Registers, Bidirectional Shift Registers,

Universal Shift Register, Design of Ripple Counters, Synchronous Counters and Variable

Modulus Counters, Ring Counter, Johnson Counter.

TEXT BOOKS:

1. Digital Design ,4/e, M.Morris Mano, Michael D Ciletti, PEA

2. Fundamentals of Logic Design, 5/e, Roth, Cengage

REFERENCE BOOKS:

1. Switching and Finite Automata Theory,3/e,Kohavi, Jha, Cambridge.

2. Digital Logic Design, Leach, Malvino, Saha,TMH

3. Verilog HDL primer, Jaya Bhaskar, PEA



ELECTRICAL AND ELECTRONICS ENGINEERING



Subject Code: 13EE2003 Internal Marks : 30

Course Objectives:

The course is designed with the objective to provide students:

• basic practical knowledge of electric devices and components.

• knowledge about DC and AC machines.

• knowledge about Instruments.

• knowledge about the characteristics of devices like PN junction diode.

Course Outcomes:

Students are expected to:

1. Solve simple electrical DC circuits

2. Generalize different DC machines.

3. Generalize different AC machines.

4. Summarize different measuring instruments.

5. Design simple electronics circuits

UNIT-I

ELECTRICAL CIRCUITS: Basic definitions, Types of elements, Ohm’s Law, elements R,

Land C and their V-I relationships & symbols, Resistive networks, Kirchhoff’s Laws,

Inductive networks, Capacitive networks, Series, Parallel circuits and Star-delta and delta-star

transformations, simple problems.

UNIT II

DC MACHINES : Principle of operation of DC Generator, construction, emf equation, types

& characteristics of DC generators, Principle of operation of DC motor, types, torque

equation, characteristics losses, efficiency, testing of DC motors, applications, three point

starter.

UNIT III

TRANSFORMERS & AC MACHINES: Principle of operation of single phase

transformers, emf equation, losses, efficiency and regulation. Principle of operation of

alternator, emf equation, regulation by synchronous impedance method. Principle of

operation of induction motor, slip, torque characteristics, applications.

UNIT IV

INSTRUMENTS: Basic Principle of indicating instruments, types of instruments, operation

of permanent magnet moving coil and moving iron instruments.



UNIT V

DIODE AND TRANSISTOR CHARACTERISTICS

P-N junction diode, symbol, V-I Characteristics, Diode Applications, Rectifiers – Half wave,

Full wave and Bridge rectifiers(simple Problems). P-N-P and N-P-N Junction transistor,

Transistor as an amplifier, SCR characteristics and applications.

TEXT BOOKS:

1. Essentials of Electrical and Computer Engineering by David V. Kerns, JR. J. David Irwin

2. Principles of Electrical and Electronics Engineering by V.K.Mehta, S.Chand& Co.

REFERENCE BOOKS:

1. Introduction to Electrical Engineering – M.S Naidu and S. Kamakshaiah, TMH Publ.

2. Basic Electrical Engineering by Kothari and Nagarath, TMH Publications, 2nd Edition.



ADVANCED DATA STRUCTURES LAB



Course Objectives:

The main objectives of this course are:

• Solve real-world problems by reasoning about data structure choices, choose

appropriate implementations, and analyze the costs associated with those choices.

• Identify the strengths and weaknesses of different data structures

• To make the students write various programs and ADTS for all data structures.

• Students will learn to write, debug, and test large programs systematically.

• Think critically for improvement in solutions.

• Be familiar with writing recursive methods.

• Determine which algorithm or data structure to use in different scenarios.

Course Outcomes:

The above exercise shall make the students competent in the following ways and will be

able to learn following parameters at the end of the course.

1. Apply critical thinking skills and creativity to solve the problems.

2. Design of hash tables, including collision avoidance and resolution schemes.

3. Demonstrate the use of balanced trees and Paraphrase the underlying organization

of the AVL, 2-3 trees.

4. Develop shortest path algorithms like Warshall’s, Floyd’s, Dijkstra’s on graphs

5. Generates searching algorithms for websites to match the specified string, numeric

or both in an application.

LIST OF EXPERIMENTS

1. Write a program to implement Set operations.

2. Write a program to implement functions of Dictionary using Hashing (division method,

Multiplication method, Universal hashing).

3. Write a program to implement skip list.

4. Write a program to perform various operations i.e, insertions and deletions on AVL trees

5. Write a program to perform various operations i.e., insertions and deletions on 2-3 trees.

6. Write a program to implement Prim’s algorithm to generate a min-cost spanning tree.

7. Write a program to implement Kruskal’s algorithm to generate a min-cost spanning tree.

8. Write a program to implement Floyd’s algorithm.

9. Write a program to implement Warshall’s algorithm

10. Write a program to implement operations on binary heap (min).

11. Write a program to implement pattern matching using Boyer-Moore algorithm.

12. Write a program to implement the Knuth-Morris-Pratt pattern matching algorithm.

TEXT BOOKS :

1. Data Structures and Algorithms in C++, Third Edition, Adam Drozdek, Thomson.

2. Data Structures using C++, D.S. Malik, Thomson

REFERENCE BOOKS:

1. Horowitz, Sahni, and Mehta, "Fundamentals of Data Structures in C++".

2. Roberge, J., "Data Structures in C++: A Laboratory Course".



DIGITAL LOGIC DESIGN LAB

(Common to ALL Branches)


Subject Code: 13EC2104 Internal Marks : 25

Course Objectives:

This course is designed to develop the skill and knowledge required for designing digital

circuits that are used in low cost, high speed, innovative and programmable devices for real

time embedded applications.

The objective of this course is to introduce students to entire circuit designs, services and

business models of Electronics Commerce related applications. The course aims are

• To provide students in-depth practical base of the Digital Electronics.

• To familiarize the students regarding designing of different types of the Digital

circuits.

• To provide the computational details for Digital Circuits.

Course Outcomes:

1. Develop the logic circuits using logic gates.

2. Consrtuct and analyze the operation of combinational logic circuits like Mux,

Demux, Encoder, Decoder and Comparator etc..

3. Develop the various types of sequential logic circuits like flip flops and

counters.

4. Analyze the various types of registers.

5. Describe the operation of RAM

LIST OF EXPERIMENTS:

1. Logic gates

2. 3-8 Decoder -74138

3. 8 x 1 Multiplexer -74151 and 2x4 Demultiplexer-74155

4. 4bit comparator – 7485

5. D Flip-Flop – 7474

6. Decade counter – 7490

7. 4bit counter – 7493

8. Shift registers – 7495

9. Universal shift register – 74194/195

10. RAM (16x4) – 74189 (Read and Write operations)

11. Stack and queue implementation using RAM

12. ALU design

TEXT BOOKS :

1. Digital Design ,4/e, M.Morris Mano, Michael D Ciletti, PEA

2. Fundamentals of Logic Design, 5/e, Roth, Cengage

REFERENCE BOOKS:

1. Switching and Finite Automata Theory,3/e,Kohavi, Jha, Cambridge.

2. Digital Logic Design, Leach, Malvino, Saha,TMH

3. Verilog HDL primer, Jaya Bhaskar, PEA



ELECTRICAL AND ELECTRONICS ENGINEERING LAB



Subject Code: 13EE2103 Internal Marks: 25

Course Objectives:

To understand the working of different DC machines, AC Machines, Transformers and

their performance characteristics with the help of suitable tests.

Course Outcomes:

1. Identify different speed control methods and predetermine the performance of dc

shunt motor.

2. Analyze the performance of three phase induction motors and find the regulation

of alternator.

3. Draw the equivalent circuit of transformer.

4. Draw the characteristics of CB, CE Amplifier and Zener diode.

5. Determine the response of full wave rectifiers with and without filters and RC

phase shift oscillator.

The following experiments are required to be conducted as compulsory experiments:

1. Swinburne’s test on D.C. Shunt machine. (Predetermination of efficiency of a given D.C.

Shunt machine working as motor and generator).

2. OC and SC tests on single phase transformer (Predetermination of efficiency and

regulation at given power factors)

3. Brake test on 3-phase Induction motor (Determination of performance characteristics)

4. Regulation of alternator by Synchronous impedance method.

5. Speed control of D.C. Shunt motor by

a) Armature Voltage control b) Field flux control method

6. Brake test on D.C Shunt Motor

7. Full wave Rectifier with and without filters.

8. RC Phase Shift Oscillator

9. Characteristics of Zener diode and regulator

10. Characteristics of Common Base Configuration

11. Characteristics of Common Emitter Configuration

12. Class A Power Amplifier

TEXT BOOKS:

1. Essentials of Electrical and Computer Engineering by David V. Kerns, JR. J. David Irwin

2. Principles of Electrical and Electronics Engineering by V.K.Mehta, S.Chand& Co.

REFERENCE BOOKS :

1. Basic Electrical Engineering, K.B. Madhusahu, Scitech Publications.

2. Introduction to Electrical Engineering – M.S Naidu and S. Kamakshaiah, TMH Publ.

3. Basic Electrical Engineering by Kothari and Nagarath, TMH Publications, 2nd Edition.



ADVANCED ENGLISH LANGUAGE COMMUNICATION SKILLS LAB




Course Objectives:

• To improve the communication skills through Listening & Practicing the structures of

language.

• To make the students acquiring the language proficiency.

• To provide the real life situations to emulate the language properly.

• To make them realize the importance of Stress, Intonation and Rhythm of language.

• To make the students to improve pronunciation, vocabulary, language skills,

communication skills, body language and grammar to fulfill the demands of the

employer.

Course Outcomes:

1. Students will be able to recognize and compare various socio-cultural and

professional contexts appropriately.

2. Students will be able to evaluate their own performance participating well in

GDs and other language-related activities.

3. Students will be able to experiment language more effectively and carry out

various competitive examinations well.

4. Students will be able to compose the ideas relevantly and coherently.

5. Students will be able to discuss and report various situations efficiently.

List of Sessions

Unit – I: Vocabulary Development

Unit – II: Reading Comprehension

Unit – III: Presentation Skills

Unit – IV: Group Discussions

Unit – V: Resume Writing & Interview Skills

TEXT BOOKS:

• “Speak Well” by K. Nirupa Rani, Jayashree Mohan Raj, B. Indira, Orient Blackswan,

Hyderabad (2012)

• “Strengthen your Steps” by Dr. M. Hari Prasad, Dr. John Varghese, Dr. R. Kishore

Kumar, Maruthi Publications, Hyderabad (2010)

REFERENCE BOOKS :

• A Text Book of English Phonetics: For Indian Students by T. Balasubramanian,

Macmillan Publishers India (2000)

• 30 days to a more Powerful Vocabulary by Norman Lewis and Wilfred Funk.

• How to Prepare for Verbal Ability and Reading Comprehension for CAT by Arun

Sharma



SELF STUDY COURSE - I

Credits : 1


Course Objectives:

This course is designed to

• Identify the sources of information.

• Collect relevant information.

• Interpret information.

• Move from problem to solution.

Course Outcomes:

The students shall be able to

1. Acquire the ability to locate different sources of information.

2. Acquire the ability to filter and select relevant information.

3. Acquire the ability to apply information to real world problems and solve

them.

METHODOLOGY / PROCEDURE:

Self study course – I (4 periods per week) includes referring library books, e–

learning, internet accessing and presentation.

• Latest and advanced topics shall be identified in the interested area.

• Literature survey shall be conducted on the selected topic.

• Required information shall be collected related to the topic as a soft / hard copy.

• A brief report shall be prepared on the topic.

• An oral presentation shall be given on the report before the Committee.

AR - 13 - B.Tech – CSE II Year II Semester


SOFTWARE ENGINEERING


Subject Code: 13CS2005 Internal Marks: 30

Course Objectives:

The objectives of this course are to

• Give the basic knowledge in Software Engineering process, focusing on the different

process models.

• Comprehend different user conceptual models and discrimination for a better

specifications constructing different system models and their contrasting requirements

and constructing different system models.

• Categorize different design concepts and architecture styles, evaluating the steps for

designing a good model.

• Demonstrate testing, cost estimation and evaluation product metrics.

• Focus on risk and quality management.

Course Outcomes:

At the successful completion of the course, the student will be able to :

1. Understand the engineering issues that form the background to develop complex

and evolving software-intensive systems.

2. Apply an effective software engineering process, based on knowledge of widely

used development life cycle models.

3. Analyze and translate requirements specification into an implementable design,

following a structured and organized process.

4. Formulate a testing strategy for a software system, employing techniques such as

black box and white box testing strategies.

5. Evaluate the quality of the requirements, analysis and design work done during

the module.

UNIT I:

Introduction to Software Engineering

The evolving role of software, Changing Nature of Software, Software myths.

A Generic view of process: Software engineering- A layered technology, a process

framework, The Capability Maturity Model Integration (CMMI)

Process models: The waterfall model, Incremental process models, Evolutionary process

models, The Unified process.

UNIT II:

Software Requirements: Functional and non-functional requirements, User requirements,

System requirements, Interface specification, the software requirements document.

Requirements engineering process: Feasibility studies, Requirements elicitation and

analysis,

Requirements validation, Requirements management.

System models: Context Models, Behavioral models, Data models, Object models,

structured methods.



UNIT III:

Design Engineering: Design process and Design quality, Design concepts, the design model.

Creating an architectural design: Software architecture, Data design, Architectural styles

and patterns, Architectural Design.

Object-Oriented Design: Objects and object classes, An Object-Oriented design process,

Design evolution.

Performing User interface design: Golden rules, User interface analysis and design,

interface analysis, Interface design steps, Design evaluation.

UNIT IV:

Testing Strategies: A strategic approach to software testing, test strategies for conventional

software, Black-Box and White-Box testing, Validation testing, System testing, the art of

Debugging.

Product metrics: Software Quality, Metrics for Analysis Model, Metrics for Design Model,

Metrics for source code, Metrics for testing, Metrics for maintenance

Software Cost Estimation: Function models, COCOMO Model, Putnam Model.

UNIT V:

Software Management

Risk management: Reactive vs. Proactive Risk strategies, software risks, Risk identification,

Risk projection, Risk refinement.

Quality Management: Quality concepts, Software quality assurance, Software Reviews,

Formal Technical reviews, Statistical Software quality Assurance, The ISO 9000 quality

standards.

TEXT BOOKS:

1. Software Engineering, A practitioner’s Approach- Roger S. Pressman,

6thedition.McGrawHill International Edition.

2. Software Engineering- Sommerville, 7th edition, Pearson education.

REFERENCE BOOKS:

1. Software Engineering- K.K. Agarwal & Yogesh Singh, New Age International Publishers

2. Software Engineering, an Engineering approach- James F. Peters, Witold Pedrycz, John

Wiely.

3. Systems Analysis and Design- Shely Cashman Rosenblatt,Thomson Publications.

4. Software Engineering principles and practice- Waman S Jawadekar, The McGraw-Hill

Companies



OBJECT ORIENTED PROGRAMMING



Course Objectives

• Be able to explain the difference between object oriented programming and

procedural programming

• Its main objective is to teach the basic concepts and techniques which form the object

oriented programming paradigm

• Cover issues related to the definition, creation and usage of classes, objects and

methods.

• Discuss the principles of inheritance and polymorphism and demonstrate though

problem analysis assignments how they relate to the design of methods, abstract

classes and interfaces.

Course Outcomes

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

1. Illustrate the concept of OOP as well as the purpose and usage principles of

inheritance, polymorphism, and encapsulation.

2. Identify classes, objects, members of a class and the relationships among them

needed for a specific problem.

3. Design and develop programs using packages and interfaces.

4. Develop the mechanism of exceptional handling and multithread

5. Implements the concept of event handling and GUI interface using Java swings

UNIT-I:

Introduction: OOP Principles, Encapsulation, Inheritance and Polymorphism, data types,

variables, declaring variables, scope and life time of variables, arrays, operators, control

statements, type conversion and casting.

UNIT-II:

Classes and Objects : Concepts of classes and objects, class fundamentals Declaring objects,

introducing methods, constructors, usage of static with data and methods, access control, this

key word, garbage collection, overloading methods and constructors, parameter passing – call

by value, recursion..

UNIT-III:

Inheritance: Basic concepts, member access rules, usage of super key word, types of

inheritance, method overriding, abstract classes, dynamic method dispatch, final keyword.

Packages and Interfaces : Defining, Creating and Accessing a Package, Understanding

CLASSPATH,importing packages, differences between classes and interfaces, defining an

interface, implementing interface, applying interfaces, variables in interface and extending

interfaces.

UNIT-IV

Exception Handling and Multithreading : Concepts of Exception handling, types of

exceptions, usage of try, catch, throw, throws and finally keywords, Built-in exceptions,

creating own exception sub classes, Concepts of Multithreading, differences between process



and thread, thread life cycle, creating multiple threads using Thread class, Runnable interface,

Synchronization, thread priorities, inter thread communication, deadlocks.

UNIT-V:

Event Handling: Events, Event sources, Event classes, Event Listeners, Delegation event

model, handling mouse and keyboard events, Adapter classes.

Applets and swings: Applets – Concepts of Applets, differences between applets and

applications, life cycle of an applet, types of applets, creating applets, passing parameters to

applets, graphics class

Swings – JApplet, JFrame and JComponent, Icons and Labels, text fields, buttons –The

JButton class, Check boxes, Radio buttons, Combo boxes, Tabbed Panes, Scroll Panes, Trees,

andTables.

TEXT BOOKS:

1. The Complete Reference Java J2SE 5th Edition, Herbert Schildt, TMH Publishing

Company Ltd, New Delhi.

2. “Learn Object Oriented Programming Using Java: An UML Treatment using Live

Examples from Science and Engineering,” Dr. N.B. Venkateswarlu, Dr. E.V. Prasad, S

Chand, New Delhi.

3. Big Java 2nd Edition, Cay Horstmann, John Wiley and Sons.

REFERENCE BOOKS:

1. Java How to Program, Sixth Edition, H.M.Dietel and P.J.Dietel, Pearson Education/PHI

2. Core Java 2, Vol 1, Fundamentals, Cay.S.Horstmann and Gary Cornell, Seventh Edition,

Pearson Education.

3. Core Java 2, Vol 2, Advanced Features, Cay.S.Horstmann and Gary Cornell, Seventh

Edition, Pearson Education.

4. Beginning in Java 2, Iver Horton, Wrox Publications.

5. Java, Somasundaram, Jaico.

.



DATABASE MANAGEMENT SYSTEMS



Course Objectives:

• To provide a sound introduction to DBMS

• To present SQL and Procedural interfaces to SQL comprehensively

• To give an introduction to Systematic Database Design

• To present the concepts and techniques relating to query processing by SQL engines

• To introduce the concepts of transactions and transaction processing

• To present the issues and techniques relating to concurrency and recovery in multi-

user database environments

• To introduce various data structures for external data storage.

Course Outcomes :

1. Recognize the Advantages and applications of DBMS.

2. Design and implement a Database Schema for a given Problem-domain

3. Construct Queries using SQL to retrieve required information from Database

4. Use Normalization Techniques on given Database Design to avoid Anomalies

5. Summarize Concurrent Executions, Serializability, Recoverability of Transactions

6. Identify Database Recovery Techniques in case of failures

UNIT I :

Data base System Applications, data base System VS file System – View of Data – Data

Abstraction –Instances and Schemas – data Models – the ER Model – Relational Model –

Other Models – Database Languages – DDL – DML – database Access for applications

Programs – data base Users and Administrator – Transaction Management – data base

System Structure – Storage Manager – the Query Processor

UNIT II :

History of Data base Systems. Data base design and ER diagrams – Beyond ER Design -

Entities,

Attributes and Entity sets – Relationships and Relationship sets – Additional features of ER

Model – Concept Design with the ER Model – Conceptual Design for Large enterprises.

Introduction to the Relational Model – Integrity Constraint Over relations – Enforcing

Integrity constraints – Querying relational data – Logical data base Design – Introduction to

Views – Destroying /altering Tables and Views. Relational Algebra – Selection and

projection set operations – renaming – Joins – Division

UNIT III:

Form of Basic SQL Query – Examples of Basic SQL Queries – Introduction to Nested

Queries –

Correlated Nested Queries Set – Comparison Operators – Aggregative Operators – NULL

values – Comparison using Null values – Logical connectivity’s – AND, OR and NOT –

Impact on SQL Constructs – Outer Joins – Disallowing NULL values – Complex Integrity

Constraints in SQL Triggers and Active Data bases.



UNIT IV :

Schema refinement – Problems Caused by redundancy – Decompositions – Problem related

to decomposition – reasoning about FDS – FIRST, SECOND, THIRD Normal forms –

BCNF – Lossless join Decomposition – Dependency preserving Decomposition – Schema

refinement in Data base Design – Multi valued Dependencies – FORTH Normal Form.

Transaction Concept- Transaction State- Implementation of Atomicity and Durability –

Concurrent – Executions – Serializability- Recoverability – Implementation of Isolation –

Testing for serializability- Lock –Based Protocols – Timestamp Based Protocols- Validation-

Based Protocols – Multiple Granularity

UNIT V :

Recovery and Atomicity – Log – Based Recovery – Recovery with Concurrent Transactions

– Buffer Management – Failure with loss of nonvolatile storage-Advance Recovery systems-

Remote Backup systems. Data on External Storage – File Organization and Indexing –

Cluster Indexes, Primary and Secondary Indexes – Index data Structures – Hash Based

Indexing – Tree base Indexing – Comparison of File Organizations – Indexes and

Performance Tuning- tree Indexes – Indexed Sequential Access Methods (ISAM) – B+

Trees: A Dynamic Index Structure. Introduction to database security and authorization,

access control, discretionary access control, mandatory access control, security for internet

applications

TEXT BOOKS :

1. Data base Management Systems, Raghurama Krishnan, Johannes Gehrke, 3/e ,TATA

McGrawHill

2. Data base System Concepts, Silberschatz, Korth, 5/e McGraw hill

REFERENCE BOOKS :

1. https://www.coursera.org/course/db

2. Data base Systems design, Implementation, and Management, Peter Rob & Carlos Coronel

7th

Edition.

3. Fundamentals of Database Systems, Elmasri Navrate Pearson Education

4. Introduction to Database Systems, C.J.Date Pearson Education



COMPUTER ORGANIZATION AND ARCHITECTURE



Course Objectives:

The objective of this course is to introduce students to entire circuit designs, services and

business models of Electronics Commerce related applications. The course aims are

• A student should grasp the basic concepts of computer architecture and organization,

and understand the key skills of constructing cost-effective computer systems.

• A student should learn how to quantitatively evaluate different designs and

• organizations, and provide quantitative arguments in evaluating different designs.

• A student should be able to articulate design issues in the development of processor or

other components that satisfy design requirements and objectives.

• In addition, A student should experience use of design tools to model various

• alternatives in computer design.

• A student should understand the basics of technical writing, and is able to construct a

detailed tutorial paper on a selected topic related to computer engineering.

Course Outcomes:

The above exercise shall make the students competent in the following ways and will be able

to learn following parameters at the end of the course.

1. Describe computer components and understand instruction execution, instruction

format and addressing mode.

2. Explain central processing unit and ability to implement different arithmetic

operation on digital computer and know the design of arithmetic and logic unit.

3. Ability to understand different types of memory unit and input output unit and

knowledge of how memory unit, input and output unit will be connected to CPU

and mode of data transfer from CPU to memory.

4. Ability to understand different type of input output unit and knowledge of how

input and output unit will be connected to CPU and mode of data transfer from

CPU to memory.

5. Distinguish parallel processing and multiprocessor in computer system and

knowledge of interconnection structure of multiprocessor.

Unit-I

Introduction:

Number representation; fixed and floating point number representation, IEEE standard for

floating point representation. Error detection and correction codes: computer types and

classifications, functional units and their interconnections, buses, bus architecture, types of

buses and bus arbitration.

Register Transfer language. Register Transfer Bus and memory transfers, Arithmetic

Micro-operations, logic micro operations, shift micro operations, Arithmetic logic shift unit.

Unit-II

Central Processing Unit:

Addition and subtraction of signed numbers, look ahead carry adders. Multiplication:

Signed operand multiplication, Booths algorithm and array multiplier. Division and logic



operations. Floating point arithmetic operation Processor organization, general registers

organization, stack organization and addressing modes. Instruction types, formats, instruction

cycles and sub cycles (fetch and execute etc).

Unit-III Memory:

Basic concept and hierarchy, semiconductor RAM memories, 2D & 2 1/2D memory

organization. ROM memories. Cache memories: concept and design issues & performance,

address mapping and replacement) Auxiliary memories: magnetic disk, magnetic tape and

optical disks Virtual memory: concept implementation.

Unit-IV

Input / Output:

Peripheral devices, I/O interface, Modes of Data Transfer: Programmed I/O, interrupt

initiated I/O and Direct Memory Access., Synchronous & asynchronous communication,

IOP.

UNIT V

Parallel Processing & Multiprocessors

Instruction pipelining; Trends in computer architecture: CISC, RISC, VLIW, Introduction to

ILP; Pipeline Hazards: Structural, data and control; reducing the effects of hazards.

Multiprocessor Interconnection structure, arbitration Procedure.

TEXT BOOKS :

1. Patterson, Computer Organization and Design, Elsevier Pub. 2009.

2. Computer Systems Architecture – M. Morris Mano, Third Edition, Pearson/PHI

REFERENCE BOOKS :

1. Vravice, Hamacher & Zaky, “Computer Organization”, TMH.

2. John P Hays, “Computer Organization”, McGraw Hill.

3. William Stalling, “Computer Organization”, PHI.

4. Tannenbaum,” Structured Computer Organization’, PHI.

5. P Pal chaudhry, ‘Computer Organization & Design’, PHI.



FORMAL LANGUAGES AND AUTOMATA THEORY



Course objectives:

• Understand the relationship between languages and models.

• Understand the relationship between languages and their grammars.

• To study the capabilities of the abstract machines.

• Understand the theoretical limits of computation.

• Classify machines by their power to recognize languages.

Course outcomes:

1. Construct the finite automata with & without output and minimize the finite

automata

2. Convert finite automata into regular expression and vice versa

3. Design grammars & recognizers for different formal languages

4. Explain the equivalence between CFG and PDA & equivalence between

acceptance by final state and acceptance by empty stack of PDA

5. Design and Classify Turing Machines and determine the decidability of

computational problems.

UNIT – I

Finite Automata : Strings, Alphabet, Language, Operations, Finite state machine,

definitions, finite automaton model, acceptance of strings, and languages, deterministic finite

automaton and non deterministic finite automaton, transition diagrams and Language

recognizers. NFA with Epsilon transitions - Significance, acceptance of languages.

Conversions and Equivalence: Equivalence between NFA with and without Epsilon

transitions, NFA to DFA conversion, minimization of FSM, equivalence between two FSM’s,

Finite Automata with output- Moore and Mealy machines.

UNIT – II

Regular Languages : Regular sets, regular expressions, identity rules, Constructing finite

Automata for a given regular expressions, Conversion of Finite Automata to Regular

expressions. Pumping lemma of regular sets, closure properties of regular sets (proofs not

required).

UNIT – III

Grammar Formalism: Regular grammars-right linear and left linear grammars, equivalence

between regular linear grammar and FA, inter conversion, Context free grammar, derivation

trees, sentential forms. Right most and leftmost derivation of strings, Ambiguity in context

free grammars, minimisation of Context Free Grammars.Chomsky normal form, Greibach

normal form, Enumeration properties of CFL (proofs omitted).

UNIT – IV

Push Down Automata: Push down automata, definition, model, acceptance of CFL,

Acceptance by final state and acceptance by empty stack and its equivalence. Equivalence of

CFL and PDA, interconversion (Proofs not required).



UNIT – V

Turing Machine & Computability Theory: Turing Machine, definition, model, design of

TM, Computable functions, recursively enumerable languages. Church’s hypothesis, counter

machine, types of Turing machines (proofs not required). Chomsky hierarchy of languages,

linear bounded automata and context sensitive language, Universal Turing Machine,post

correspondence problem, Turing reducibility, Definition of P and NP problems, NP complete

and NP hard problems.

TEXT BOOKS:

1. “Introduction to Automata Theory Languages and Computation”. Hopcroft H.E. and

Ullman J. D.Pearson Education

2. Introduction to Computer Theory, Daniel I.A. Cohen, John Wiley.

REFERENCE BOOKS :

1. Introduction to languages and the Theory of Computation, John C Martin, TMH

2. “Elements of Theory of Computation”, Lewis H.P. & Papadimition C.H. Pearson /PHI.

3. Theory of Computer Science – Automata languages and computation -Mishra and

Chandrashekaran, 2nd edition, PHI

4. Introduction to Theory of Computation –Sipser 2nd edition Thomson



PRINCIPLES OF PROGRAMMING LANGUAGES



Course Objectives

• Choose the most appropriate language for a given task,

• Learn a new language with ease,

• Choose among alternative features and constructs in a language

• To introduce formal languages for specifying syntax and semantics of programming

languages

• To provide an exposure to core concepts and principles in contemporary programming

languages

• To explore various important programming methodologies, such as functional

programming, logic programming, programming with abstract data types, and object-

oriented programming.

Course Outcomes

Students will be able to

1. Explain program translation process and specify syntax.

2. Explain and differentiate scope, bindings and specify semantics of a programming

language.

3. Select among various data types and control flow constructs in a language.

4. Describe various concurrency, synchronization and control abstraction

mechanisms

5. Design a program in object oriented programming language, functional language

and logic program language.

Unit I

The Art of Language Design, Programming Language categories, Why Study Programming

Languages, Compilation and Interpretation, Programming Environments, over view of

Compilation

Programming language syntax, Specifying Syntax: Regular Expressions and Context -Free

Grammars, Scanning, Parsing.

Unit II

Names, Scopes and Bindings: The Notion of Binding Time, Object Lifetime and Storage

Management, Scope Rules, Implementing Scope, Meaning of Names within a Scope, The

Binding of Referencing Environments, Macro Expansion, Separate Compilation

Semantic Analysis: Role of Semantic Analyzer, Attribute Grammars, Evaluating Attributes,

Action Routines, Space Management for Attributes, Decorating a Syntax Tree

Unit III

Control flow: Expression Evaluation, Structured and Unstructured Flow, Sequencing,

Selection, Iteration, Recursion, Non determinacy

Data Types: Type Systems, Type Checking, Records(Structures) and Variants(Unions)

,Arrays, Strings, Sets, Pointers and Recursive Types, Lists, Files and input/output, Equality

Testing and Assignment



Unit IV

Subroutines and Control Abstraction: Review of stack Layout, Calling Sequences,

Parameter Passing, Generic Subroutines and Modules, Exception Handling, Co-routines,

Events

Concurrency: Concurrency Basics, Implementing Synchronization, Language Level

Mechanisms, Message Passing, Run Time Program Management, Late Binding of Machine

Code, Inspection/Introspection

Unit V

Data Abstraction and Object Orientation: Object Oriented Programming, Encapsulation,

Inheritance, Initialization, Finalization, Dynamic Method Binding, Multiple Inheritance

Functional and Logic Languages: Functional Programming Concepts, Overview of

Scheme, Evaluation Order Revisited, Higher Order Functions,

Logic Programming concepts, Prolog

TEXT BOOKS:

1.Proggramming Language Pragmatics, 3/e, Michael Scott, Elsevier, Morgan

KaufMann,2009

2.Concepts of Programming Languages,Sebesta, 8/e, PEA

REFERENCE BOOKS:

1. https://www.coursera.org/course/proglang

2. Programming Languages Design and Implementation,4/e,Pratt Zelkowitz,PHI

3. .Programing Languages,Louden, 2/e, Cengage, 2003

4. .Fundamentals of Programming Languages, Horowitz, Galgotia



OBJECT ORIENTED PROGRAMMING LAB



Course Objectives:

• Understand fundamentals of programming such as variables, conditional and iterative

execution, methods, etc.

• Understand fundamentals of object-oriented programming in Java, including defining

classes, invoking methods, using class libraries, etc.

• Be aware of the important topics and principles of software development.

• Have the ability to write a computer program to solve specified problems.

• Be able to use the Java SDK environment to create, debug and run simple Java

programs.

Course Outcomes

1. Able to write, compile and execute simple java programs.

2. Understand and apply Object Oriented features to solve well specified problems

3. Able to make use of reusability on scenario based and define ADT for business

problems

4. Able to create user defined packages and handle exceptions at run time.

5. Apply Threading concept based on application requirement

6. Design Applet programming that includes graphic components.


1.a) Write a java program to print factorial value of given integer.

b)The Fibonacci sequence is defined by the following rule: The first two values in the

sequence are 1and 1.Every subsequent value is the sum of the two values preceding it.

Write a java program that uses both recursive and non recursive functions to print

the nth value in the Fibonacci sequence..

2.a) Write a java program that prompts the user for an integer and then prints out all prime

numbers up to that integer.

b) Write a java program that checks whether given string is palindrome or not.

3.a) Write a java program to illustrate overloading and overriding.

b) Write a java program to create and demonstrate packages

4.a) Write a java program to implement inheritance concept

b) Write a java program to implement concept of interfaces and abstract classes.

5. a)Write a java program that illustrates how java achieved run time polymorphism

b)Write a java program to implement Exception handling mechanism.

6. a)Write a java program to illustrate multithreading and thread synchronization.

b)Write a java program that displays the number of characters, lines and words in a text

file.

7.Write a java program develop an applet that displays the simple message.

8.Write a Java program for Handling Mouse Events

9. Write a java program that allows the user to draw lines, rectangles and ovals.

10 Write a java program that creates three threads. First thread displayed “good morning”

every one second ,the second thread displays “hello” every two seconds and the

third thread displays” welcome” every three seconds



11. WAJP, using StringTokenizer class, which reads a line of integers and then displays each

integer and the sum of all integers.

12. Develop an applet that receives an integer in one text field, and computes its factorial

value and returns it in another text field, when the button named “compute” is clicked.

TEXT BOOKS:

1. The Complete Reference Java J2SE 5th Edition, Herbert Schildt, TMH Publishing

Company Ltd, New Delhi.

2. “Learn Object Oriented Programming Using Java: An UML Treatment using Live

Examples from Science and Engineering,” Dr. N.B. Venkateswarlu, Dr. E.V. Prasad, S

Chand, New Delhi.

3. Big Java 2nd Edition, Cay Horstmann, John Wiley and Sons.

REFERENCE BOOKS:

1. Java How to Program, Sixth Edition, H.M.Dietel and P.J.Dietel, Pearson Education/PHI

2. Core Java 2, Vol 1, Fundamentals, Cay.S.Horstmann and Gary Cornell, Seventh Edition,

Pearson Education.

3. Core Java 2, Vol 2, Advanced Features, Cay.S.Horstmann and Gary Cornell, Seventh

Edition, Pearson Education.

4. Beginning in Java 2, Iver Horton, Wrox Publications.

5. Java, Somasundaram, Jaico.



DATA BASE MANAGEMENT SYSTEMS LAB



Course Objectives:

• Creating and Altering Tables with necessary constraints ,keys and data types

• Inserting data and manipulating data as per needs

• Writing SQL Queries to retrieve required information from single/multiple tables .

• Creating views and manipulating them as needed

• Implementing Operations on relations (tables) using PL/SQL

• Writing triggers for implementing automatic operations and implementing constraints

• Writing Cursors, Functions and Procedures for various tasks on tables

• To Teach Exception handling, Assertions and Packages .

• To Teach how to Generate Reports.

Course Outcomes:

Students will be able to

1. Design Logical Database Schema without Anomalies.

2. Compose complex Queries to retrieve required information from Database

3. Devise Triggers to implement various complex Database Constraints

4. Compose PL/SQL Procedures using cursors

5. Design Procedures, Functions and Packages for required Database tasks.

LIST OF EXPERIMENTS

1. Execute a single line and group functions for a table.

2. Create tables for various relations in SQL with necessary integrity constraints,

keys, data types

3. Implement the Queries in SQL for a) insertion b) retrieval c) updating d) deletion

4. Creating Views

5. Execute DCL and TCL Commands.

6. Write PL/SQL procedure for an application using Exception handling.

7. Write PL/SQL procedure for an application using Cursors.

8. Generate Reports using suitable SQL statements.

9. Writing row and statement Triggers for implement various Database constraints

10. Write a PL/SQL block for transaction operations of a typical application using

Package.

11. Writing Assertions to implement integrity constraints on multiple tables

12. Write Procedures and functions to perform various database tasks.

13. Design and develop an application using any front end and back end tool (make

use of ER diagram and DFD).



Typical Applications –

o Banking

o Electricity Billing

o Library management

o Pay roll processing

o Insurance

o Inventory etc.

TEXT BOOKS :

1. Data base Management Systems, Raghurama Krishnan, Johannes Gehrke, TATA

McGrawHill 3rdEdition

2. Data base System Concepts, Silberschatz, Korth, McGraw hill, V edition.

REFERENCE BOOKS:

1. Data base Systems design, Implementation, and Management, Peter Rob &

Carlos

Coronel 7th Edition.

2. Fundamentals of Database Systems, Elmasri Navrate Pearson Education

3. Introduction to Database Systems, C.J.Date Pearson Education



PROFESSIONAL ETHICS AND MORALS

Subject Code: 13HS2201

Course Objectives:

• Learn the importance and utility of honesty, integrity, character and values.

• Learn how mind operates and how to control evil tendencies.

• Importance of ethical decision making in business environment.

• Learn how bribery, extortion, grease payments, nepotism destroy individual,

economy, and country.

• Learn the impact of non-performance of remedial action when failure is anticipated in

near future.

Course Outcomes:

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

1. Understand the significance and benefits of ethical character and values.

2. Understand the thinking process and use discrimination and dispassion to control evil

tendencies.

3. Understand how to withstand external pressure and still be ethical in performing one’s

duty.

4. Understand how to resist temptation or fear due to bribery, extortion, nepotism.

5. Understand the impact of timely action and cost of negligence.

Unit 1:

Introduction to Values and Morals

–– Theory of Evolution, Ethics as a necessity for spiritual evolution –– Description of Human

Values Morals –– Values: Integrity, Honesty, Courage, Empathy, Personality, Character,

Self-Confidence, Respect for Others, 7 Ways of Misusing Truth –– Work Culture, Social

Responsibility, Responsibilities as a Citizen, Cooperation and Commitment, Caring and

Sharing –– Religion vs. Spirituality, Philosophy, Customs and Practices –– Impediments to

Responsibility – Self-Interest, Fear, Self-Deception, Ignorance, Ego, Narrow Vision,

Uncritical Acceptance of Authority, Group Thinking.

Unit 2:

Mind and Its Mysteries

–– What is Mind? Mind and Body, Mind and Food –– Mental faculties, Theory of perception,

Memory, Tendencies, Thought Creates the World –– Power of Thought, Thought-Culture,

Desires, Pleasure and Pain –– Cultivation of Virtues, Control of Senses and Mind ––

Discrimination, Dispassion, Sacrifice –– Concentration, Meditation and Enlightenment

Unit 3:

Risk, Safety and Environment

–– Difficulties in Estimating Risk –– Approach to Acceptable Risk, Regulator’s Approach to

Risk –– Engineer’s Liability, Changing Legal Rights of the Employees –– Organizational

Disobedience: by Contrary Action, by Non-Participation, by Protest –– Environmental Laws

and Judicial Intervention in Related Matters –– Environmental Movements



Unit 4:

Non-Ethical Practices in Vogue

–– Engineer’s Responsibility for Rights - Respect for Authority – Conflict of Interests,

Occupational crime –– Global Issues: How Multinational Corporations Influence

Government Decisions, Risk and Public Policy –– Engineers as Managers, Advisors and

Experts, Engineers as Moral Leaders –– Problem of Bribery, Extortion, Grease Payments,

Nepotism –– Nexus between Politicians and Industrialists –– Case Study: Chinese Minister

Sentenced to Death for Corruption

Unit 5:

Case Studies – Variety of Moral Issues in Profession

–– Chernobyl –– Air bags, Cadillac Chips –– Nuclear Power Generation Plant –– Highway

Safety

–– Microwaves, Renewable Energy –– Training Fire Fighters

TEXT BOOKS:

1. Charles E Harris, Micheal J Rabins, “Engineering Ethics, Cengage Learning

2. Mike Martin and Roland Schinzinger, “Ethics in Engineering” McGraw Hill

REFERENCE BOOK:

1. Mind, Its Mysteries and Control, Swami Sivananda, Divine Life Society.

AR - 13 - B.Tech – CSE III Year I Semester


INDUSTRIAL MANAGEMENT SCIENCE


Subject Code: 13HS3006 Internal Marks: 30

Course Objectives:

• To develop better understanding of principles of management, leadership style and social

responsibility of an organization.

• To develop an understanding on Business and new economic environment and its

importance on capital budgeting.

• To develop an understanding of managerial economics.

• To develop an understanding on law of demand, elasticity of demand and concept on

demand forecasting techniques.

• To make an understanding on theory of production and cost analysis and its application

in business.

• To develop an understanding of market structure, different types of competition and

pricing strategies.

Course Outcomes:

1.Help students to learn the overview of principles of management and its applications.

2.Enable the student to understand the business and new economic environment and its

applications in capital budgeting.

3.Help students to learn the overview of managerial economics and its applications.

4.Familiarize students with theory of production and cost concept.

5.Help students to understand the concept of market structures, types of competition and

pricing strategies.

Unit I

Concepts of Management and organization: Nature, importance and Functions of

Management, Taylor’s Scientific Management Theory, Fayol’s Principles of Management,

Mayo’s Hawthorne Experiments, Maslow’s Theory of Human Needs, Douglas McGregor’s

Theory X and Theory Y, Herzberg’s Two-Factor Theory of Motivation, Systems Approach to

Management, Leadership Styles, Social responsibilities of Management.

Unit II

Business & New Economic Environment: Characteristic features of Business, Features and

evaluation of Sole Proprietorship, Partnership, Joint Stock Company, Public Enterprises and

their types.

Capital and Capital Budgeting : Capital and its significance, Types of Capital, Estimation

of Fixed and Working capital requirements, Methods and sources of raising finance, Nature

and scope of capital budgeting, features of capital budgeting proposals, Methods of Capital

Budgeting: Payback Method, Accounting Rate of Return (ARR) and Net Present Value

Method (simple problems).

Unit III

Introduction to Managerial Economics: Definition, Nature and Scope Managerial

Economics–Demand Analysis: Demand Determinants, Law of Demand and its exceptions,

Elasticity of Demand: Definition, Types, Measurement and Significance of Elasticity of



Demand, Demand Forecasting- Factors governing demand forecasting, methods of demand

forecasting (survey methods, statistical methods, expert opinion method, test marketing,

controlled experiments, judgmental approach to demand forecasting).

Unit IV

Theory of Production and Cost Analysis: Production function in Isoquants and Isocosts,

MRTS, Least Cost Combination of Inputs, Production function, Laws of Returns, Internal

and External Economies of Scale.

Cost Analysis: Cost concepts, Opportunity cost, Fixed & Variable costs, explicit costs &

Implicit costs, Out of pocket costs & Imputed costs, Break-even Analysis (BEA),

Determination of Break-Even Point (simple problems), Managerial Significance and

limitations of BEA.

Unit V

Introduction to Markets & Pricing Strategies: Market structures: Types of competition,

Features of Perfect competition, Monopoly and Monopolistic Competition, Price-Output

Determination in case of Perfect Competition and Monopoly, Concept on different pricing

strategies.

TEXT BOOKS:

1. Varshney & Maheswari, Managerial Economics, Sultan & Chand, New Delhi, 2003

2. Ramaswamy,T: “Principles of Management”, Himalaya Publishing House, Mumbai,

2008.

3. Phillip Kotler & Kevin Lane Keller (2006), Marketing Management (12th Edition).

PHI Learning Private Limited.

4. P.Subba Rao , Personnel and Human Resource Management – Text and Cases,

Himalaya Publishing Houses, Mumbai

REFERENCE BOOKS:

1. Dwivedi, Managerial Economics, Vikas Publications, 6th Edition, 2009

2. Managerial Economics - Yogesh Maheswari, PHI, 2nd Ed., 2nd Ed. 2005.

3. P. L. Mehatha, Managerial Economics Analysis- Analysis, Problems & Cases,, Sultan

Chand & Co,New Delhi.

4. Koonz, Weihrich and Aryasri: “Principles of Management”, Tata McGraw Hill, 2004.

5. Tapan K. Panda, Marketing Management-Texts & Cases, 2nd Edition, Excel Books,

2008 (Reprint).

6. Rajan Saxena, Marketing Management, 4th Edition Tata Mc.Graw Hill, 2009.

7. Aswathappa, Human Resource Management, Mc Graw Hill, 2009.

8. Edwin B.Flippo, Personnel Management, Mc Graw Hill, 2003.



COMPILER DESIGN



Course Objectives:

• Describe the steps and algorithms used by language translators.

• Introduces students to compiler construction and issues related to software

compilation. Students become familiar with make, lex, and yacc as a part of the

course and are required to implement one compiler project in their favorite computer

programming language.

• Recognize the underlying formal models such as finite state automata, push-down

automata and their connection to language definition through regular expressions and

grammars.

• Discuss the effectiveness of optimization.

• Explain the impact of a separate compilation facility and the existence

• Of program libraries on the compilation process.

Course Outcomes:

By the completion of the course, the students will be able to

1. Understand the theory and practice of compilation, in particular, the lexical

analysis, syntax, and semantic analysis, code generation and optimization

phases of Compilation. 2. Apply lexical rules and grammars for a programming language.

3. Analyze and implement a lex without using Flex or any other lex generation

tools.

4. Develop a parser such as a bottom-up SLR parser without using YACC or any

other compiler-generation tools.

5. Design semantic rules into a parser that performs attribution while parsing.

Unit-I:

Overview of Compilation: Phases of Compilation – Lexical Analysis, Regular Grammar and

regular expression for common programming language features, pass and Phases of

translation, interpretation, bootstrapping, data structures in compilation – LEX lexical

analyzer generator.

Unit II

Top down Parsing: Context free grammars, Top down parsing – Backtracking, LL (1),

recursive descent parsing, Predictive parsing.

Bottom up parsing: Shift Reduce parsing, LR and LALR parsing, Error recovery in parsing ,

handling ambiguous grammar, YACC – automatic parser generator.

Unit III

Semantic analysis: Intermediate forms of source Programs – abstract syntax tree, polish

notation and three address codes. Attributed grammars, Syntax directed translation,

Conversion of popular Programming languages language Constructs into Intermediate code

forms, Type checker.



Symbol Tables: Symbol table format, organization for block structures languages, hashing,

tree Structures representation of scope information. Block structures and non block structure

storage allocation: static, Runtime stack and heap storage allocation, storage allocation for

arrays, strings and records.

Unit IV

Code optimization: Consideration for Optimization, Scope of Optimization, local

optimization, loop optimization, frequency reduction, DAG representation.

Data flow analysis: Flow graph, data flow equation, global optimization, redundant sub

expression elimination, Induction variable elements, Live variable analysis, Copy

propagation.

Unit V

Code generation: Object code forms, machine dependent code optimization, register

allocation and assignment generic code generation algorithms, DAG for register allocation.

TEXT BOOKS:

1. Principles of compiler design -A.V. Aho. J.D.Ullman; Pearson Education.

2. Modern Compiler Implementation in C- Andrew N. Appel, Cambridge University Press.

REFERENCE BOOKS:

1. Lex &yacc – John R. Levine, Tony Mason, Doug Brown, O’reilly

2. Modern Compiler Design- Dick Grune, Henry E. Bal, Cariel T. H. Jacobs,Wiley

dreamtech.

3. Engineering a Compiler-Cooper & Linda, Elsevier.

4. Compiler Construction, Louden, Thomson.



COMPUTER NETWORKS

Credits : 3 External marks : 70

Subject Code : 13CS3012 Internal marks : 30

Course Objectives:

• To educate concepts, vocabulary and techniques currently used in the area of

computer networks.

• To interpret the layering concepts in computer networks.

• Familiarize the student with the basic taxonomy and terminology of the computer

networking area.

• To study protocols, network standards, the OSI model, IP addressing.

• To accumulate existing state-of-the-art in network protocols and applications.

• To analyze the functions of each layer and gain knowledge in different applications

that use computer networks.

• Introduce the student to advanced networking concepts, preparing the student for

entry advanced courses in computer networking.

Course Outcomes:

1. Identify and enumerate different types of network topologies, protocols and the layers

of the OSI and TCP/IP models and explain the functions of each layer.

2. Explain the protocols of Data Link Layer and MAC Sublayer and illustrate how a

network can detect and correct transmission errors.

3. Classify and compare the major routing and congestion control algorithms and

understand how a packet is routed over the internet.

4. Describe how TCP and UDP function, its uses and summarize the differences

between them.

5. Analyze the features and operations of various Application layer protocols such as

http, DNS, and SMTP.

Unit-I:

Introduction: Data Communication, components, data representation, data flow;

Networks: distributed processing, network criteria, physical structures, network models,

categories of network, inter connection of networks; The Internet: brief history, internet

today, Protocols &standard layers: protocols, standards, standard organization, internet

standards, Layered Tasks: sender, receiver, carrier, hierarchy.

The OSI models: layered architecture, peer to peer process, encapsulation, Layers in OSI

model: physical layer, data link layer, Network layer, transport layer, session layer ,

presentation layer , application layer , TCP/IP protocol suite: physical and data link layers,

network layer, transport layer, application layer, Addressing: physical address, logical

address, port address, specific address.

Unit-II

Data Link Layer: Design Issues- Services Provided to the Network Layer, Framing, Error

Control and Flow Control, Error Detection And Correction- Error Correcting codes, Error

Detecting codes, Elementary Data Link Protocols, Sliding Window Protocols- A one- bit

sliding window protocol, A Protocol Using GO BACK N, An Protocol Using Selective

Repeat, Examples Data Link Protocols- HDLC- High Level Data Link Control.



The Medium Access Control Sublayer: Multiple Access Protocol- ALOHA, Carrier Sense

Multiple Access Protocols, Collision- Free Protocol, Limited – contention Protocols, Wave

length Division Multiple Access Protocols, LAN Bridges- Transparent Bridges, Source

Routing Bridges, Remote Bridges.

Unit-III

The Network Layer: Network Layer Design Issues- Services Provided to The Transport

Layer, Implementation Of Connection Less Services, Implementation of Connection –

Oriented Services, Comparison of Virtual- Circuit and Datagram Subnets, Routing

Algorithms- The Optimality Principle, Shortest Path Routing, Flooding, Distance Vector

Routing, Link State Routing, Hierarchical Routing, Broad Cast Routing, Multicast Routing,

Congestion Control Algorithms- General Principles of Congestion Control, Congestion

Prevention Policies, The Network Layer in The Internet- The IP Protocol, IP Address- IPV4,

IPv6.

Unit-IV

The Transport Layer: The Transport Services- Services Provided to The Upper Layer,

Transport Services primitives, Elements of Transport Protocols- Addressing, Connection

Establishment, Connection Release, Flow Control and Buffering, Multiplexing, Crash

Recovery, The Internet Transport Protocols (UDP & TCP).

Unit-V

The Application Layer: DNS- Domain Name System- The DNS Name Space, Resource

Records, Name Servers, SNMP, Electronic Mail- Architecture And Services, The User

Agent, Message Format, Message Transfer, Final Delivery, The World Wide Web-

Architectural Overview, Static Web Document, Dynamic Web Document, Hyper Text

Transfer Protocol (HTTP).

TEXT BOOKS:

1) Computer Networks, 4th Edition, Andrew S Tanenbaum, Pearson Education.

2) Data Communications and Networking, 4th Edition, Behrouz A Forouzan, McGraw-Hill

REFERENCE BOOKS:

1) An Engineering approach to computer Networking, 2nd Edition, S Keshav, Pearson

Education.

2) Computer Networking a Top-Down approach featuring the internet, 2nd Edition,

J.F.Kurose, K.W.Ross, Pearson Education.



DESIGN AND ANALYSIS OF ALGORITHMS



Course Objectives:

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

• Analyze the asymptotic performance of algorithms.

• Write rigorous correctness proofs for algorithms.

• Demonstrate a familiarity with major algorithms and data structures.

• Apply important algorithmic design paradigms and methods of analysis.

• Synthesize efficient algorithms in common engineering design situations.

Course Outcomes:

Upon completion of the Course, students will be able to:

1. Measure the performance and calculate the Time & Space complexities of algorithms.

2. Design effective algorithms based on Divide and Conquer and Greedy methods.

3. Discuss various problems suitable to Dynamic programming.

4. Construct a state space tree to solve different problems using Backtracking technique.

5. Find an optimal solution by applying different Branch and Bound techniques and

illustrate Non-deterministic algorithms.

UNIT I

Introduction: Algorithm,Psuedo code for expressing algorithms,Performance Analysis-Space

complexity,Time complexity, Asymptotic Notation- Big oh notation, Omega notation, Theta

notation and Little oh notation,Probabilistic analysis, Amortized analysis.

Disjoint Sets- disjoint set operations, union and find algorithms, connected components and

biconnected components. Graph Algorithms with implementation issues; Depth-First Search

and its applications, shortest-path and spanning tree problems.

UNIT II

Divide and conquer: General method , applications-Binary search, Quick sort, Merge sort,

Strassen’s matrix multiplication.

Greedy method: General method, applications-Job sequencing with dead lines, 0/1 knapsack

problem, Minimum cost spanning trees, Single source shortest path problem.

UNIT III

Dynamic Programming: General method, applications-Matrix chain multiplication, Optimal

binary search trees, 0/1 knapsack problem, All pairs shortest path problem,Travelling sales

person problem, Reliability design.

UNIT IV

Backtracking: General method, applications-n-queen problem, sum of subsets problem, graph

coloring, Hamiltonian cycles. Traveling method - Traveling Salesperson problem.

Algebraic simplification and transformation, the general method, evaluation and

interpolation, the fast Fourier transform, modular arithmetic.



UNIT V

Branch and Bound: General method, applications - Travelling sales person problem, 0/1

knapsack problem- LC Branch and Bound solution, FIFO Branch and Bound solution.

NP-Hard and NP-Complete problems: Basic concepts, non deterministic algorithms, NP -

Hard and NPComplete classes, Cook’s theorem.

TEXT BOOKS:

1. Fundamentals of Computer Algorithms, Ellis Horowitz,Satraj Sahni and Rajasekharam,

Galgotia publications pvt. Ltd.

2. Algorithm Design: Foundations, Analysis and Internet examples, M.T.Goodrich and

R.Tomassia,John wiley and sons.

REFERENCE BOOKS :

1. Introduction to Algorithms, secondedition,T.H.Cormen,C.E.Leiserson, R.L.Rivest,and

C.Stein,PHI Pvt. Ltd./ Pearson Education

2. Introduction to Design and Analysis of Algorithms A strategic approach, R.C.T.Lee,

S.S.Tseng, R.C.Chang and T.Tsai, Mc Graw Hill.

3. Data structures and Algorithm Analysis in C++, Allen Weiss, Second edition, Pearson

education.

4. Design and Analysis of algorithms, Aho, Ullman and Hopcroft,Pearson education.

5. Algorithms – Richard Johnson baugh and Marcus Schaefer, Pearson Education



OPERATING SYSTEMS



Course Objectives:

The student will:

• understand structures and history of operating systems

• understand process management concepts including scheduling, synchronization and

deadlocks

• Know memory management including virtual memory

• Summarize the full range of considerations in the design of file systems

Course Outcomes

By the completion of the course, the students will be able to:

1. Explain the different structures of operating system and design various scheduling

algorithms

2. Propose solutions for achieving process synchronization and design deadlock

prevention, detection, avoidance algorithms

3. Compare and contrast various memory management schemes

4. Design and Implement file system

5. Familiarize with disk scheduling, device drivers, protection and security mechanisms

UNIT I:

Basics: Operating System Functionalities, Types of Operating Systems.

Process Management: Process concept-Process Scheduling, Uniprocessor scheduling

algorithms, scheduling Algorithms evaluation, Multi Thread programming model.

UNIT II:

Process Synchronization - Peterson's Solution, Bakery Algorithm, Hardware Support to

Process Synchronization, Semaphores, Critical Regions, Monitors.

Principals of deadlock-Deadlock prevention, deadlock avoidance and Deadlock Detection

and Recovery - Bankers Algorithm.

UNIT III:

Memory Management: contiguous memory allocation, paging, Segmentation and space

allocation, Basics of linking and loading, Demand Paging, Page replacement algorithms,

Analysis of page allocation policies - Working Set.

UNIT IV:

File System Interface: the concept of a file, Access Methods, Directory structure, File

system mounting, File system mounting, file sharing, protection.

File System implementation: File system structure, file system implementation, directory

implementation, allocation methods, free-space management.



UNIT V:

I/O System: Disk Scheduling, Device drivers - block and character devices, streams,

Character and Block device switch tables

Protection and Security - Accessibility and Capability Lists

TEXT BOOKS:

1. Operating System Concepts - Operating System Concepts, Sixth Edition, Abraham

Silberschatz, Peter Baer Galvin, Greg Gagne, John Wiley & Sons Inc.

2. Operating Systems - Operating System: Internals and Design Principles (4th edition),

William Stallings

REFERENCE BOOKS:

1. Modern Operating Systems- Andrew S Tanenbaum, Prentice Hall

2. Operating Systems - System Programming and Operating Systmes D M Dhamdhere,

tata Mc Graw Hill

3. Operating Systems - Operating Systems: A Modern Perspective, 2/E, Gary Nutt,

Addison Wesley

4. Operating Systems - Operating Systems, Achyut S Godbole, Tata Mc Graw Hill



COMPILER DESIGN LAB



Course Objectives:

The course aims are:

• To introduce the major concept areas of language translation and compiler design.

• To enrich the knowledge in various phases of compiler ant its use, code optimization

techniques, machine code generation, and use of symbol table.

• To extend the knowledge of parser by parsing LL parser and LR parser.

• To provide practical programming skills necessary for constructing a compiler.

Course Outcomes

1. Understand and apply the knowledge of lex tool & YACC tool to develop a

scanner & parser

2. Design & conduct experiments for Intermediate Code Generation in compiler.

3. Analyze and translate the knowledge of patterns, tokens & regular expressions

for solving problems.

4. Identify the new code optimization techniques to improve the performance of

a program in terms of speed & space.

5. Apply the new tools and technologies used for designing a compiler.

6. Develop program to solve complex problems in compiler

LIST OF EXPERIMENTS

1. Write a program to find the number of characters, words, digits, lines form the given

input.

2. Design a Lexical analyzer. The lexical analyzer should ignore redundant spaces, tabs

and newlines. It should also ignore comments.

3. Implement the lexical analyzer using either JLex, flex or lex or other lexical analyzer

generating tools.

4. Write a program to compute FIRST function for the given grammar.

5. Write a program to compute FOLLOW function for the given grammar.

6. Write a program to implement a predictive parser.

7. Design LALR Bottom up Parser.

8. Write a program to find the operators and operands in a given input string.

9. Convert the BNF rules into Yacc form and write code to generate abstract syntax tree.

10. Write program to generate machine code from the abstract syntax tree generated by

the parser.

11.Write a program to implement for top down parser with back tracking.

TEXT BOOKS:

1. Alfred Aho, Ravi Sethi, Jeffrey D Ullman, “Compilers Principles, Techniques and

tools”, Pearson Education Asia, 2003

2. Linux Programming Tools Unveild, NB Venkateswarulu, BS Pub, Hyd

REFERENCE BOOKS:

1. Allen I. Houlb “Compiler Design in C”, Prentice Hall of India, 2003

2. C. N. Fischer and R.J. LeBalnc, “Crafitng a compiler with C ”, benjamin Cummings,

2003



OPERATING SYSTEMS LAB

Credits: 2 External marks : 50

Subject Code: 13CS3108 Internal marks : 25

Course Objectives:

• understand structures and history of operating systems

• understand process management concepts including scheduling, synchronization and

deadlocks

• Know memory management including virtual memory

• Summarize the full range of considerations in the design of file systems

Course Outcomes:

1. To use of an operating system to develop software

2. To write software systems based on multiple cooperating processes or threads

3. To implement file organization techniques

4. To implement file allocation strategies

5. To implement process scheduling & synchronization algorithms

6. To implement memory management scheme like best fit, worse fit etc.

LIST OF EXPERIMENTS

1) Simulate the following CPU scheduling algorithms

a) Round Robin b) SJF

2) Simulate the following CPU scheduling algorithms

a) FCFS b) Priority

3) Simulate all file allocation strategies

a) Sequential b) Indexed c) Linked

4) Simulate MVT and MFT

5) Simulate all File Organization Techniques

a) Single level directory b) Two level

6) Simulate all File Organization Techniques

a) Hierarchical b) DAG

7) Simulate Bankers Algorithm for Dead Lock Avoidance

8) Simulate Bankers Algorithm for Dead Lock Prevention

9) Simulate all page replacement algorithms

a) FIFO b) LRU c) LFU Etc. …

10) Simulate Paging Technique of memory management.

11) Simulate the dining philosophers problem

12) Simulate the producer-consumer problem

TEXT BOOKS :

1. Operating System Principles- Abraham Silberchatz, Peter B. Galvin, Greg Gagne 7th

Edition, John Wiley.

2. Operating Systems’ – Internal and Design Principles Stallings, Fifth Edition–2005, Pearson

education/PHI

REFERENCE BOOKS:

1. Operating System A Design Approach-Crowley, TMH.

2. Modern Operating Systems, Andrew S Tanenbaum 2nd edition Pearson/PHI.



COMPUTER NETWORKS LAB

Credits : 2 External marks : 50

Subject Code : 13CS3109 Internal marks : 25

Course Objectives:

• Analyze the different layers in networks.

• Define, use, and differentiate such concepts as OSI-ISO, TCP/IP.

• Build an understanding of the fundamental concepts of computer networking.

• To be familiar with contemporary issues in networking technologies.

• To know that how the routing algorithms worked out in network layer.

• Allow the student to gain expertise in maintenance of individual networks.

Course Outcomes:

1. To apply knowledge of different techniques of error detection and correction to

detect and solve error bit during data transmission.

2. Familiarity with the basic protocols of computer networks, and how they can be

used to assist in network design and implementation.

3. Understand and building the skills of routing mechanisms during packet delivery.

4. To explain the congestion control algorithms and understand how a packet is routed. 5. To be familiar with network tools and network programming.

LIST OF EXPERIMENTS

1) Implement a data link framing method for counting characters in a given frame.

2) Implement a data link framing methods for the bit stuffing & character stuffing in a

frame.

3) Implement a data link framing methods for even and odd parity.

4) Implement the CRC-12, CRC-16 in data link layer.

5) Implement the data link protocols : Unrestricted simplex protocol

6) Implement of one bit sliding window protocol.

7) Implement Dijkstra’s algorithm to compute the shortest path thru a graph.

8) Take an example subnet graph with weights indicating delay between nodes. Now

obtain Routing table each node using distance vector routing algorithms.

9) Implement a Hierarchial routing algorithm.

10) Take an example subnet of hosts. Obtain broadcast tree for it.

11) Implement the Token Bucket Congestion control algorithm.

12) Implement the Leaky Bucket Congestion control algorithm

TEXT BOOKS:

1) Computer Networks, 4th Edition, Andrew S Tanenbaum, Pearson.

2) Data Communications and Networking, 4th Edition, Behrouz A Forouzan, McGraw-

Hill

REFERENCE BOOKS:

1) An Engineering approach to computer Networking, 2nd Edition, S Keshav, Pearson

Education.

2) Computer Networking a Top-Down approach featuring the internet, 2nd Edition,

J.F.Kurose, K.W.Ross, Pearson Education.



SELF STUDY COURSE - II

Credits : 1


Course Objectives:

This course is designed to

• Identify the sources of information.

• Collect relevant information.

• Interpret information.

• Move from problem to solution.

Course Outcomes:

The students shall be able to

1. Acquire the ability to locate different sources of information.

2. Acquire the ability to filter and select relevant information.

3. Acquire the ability to apply information to real world problems and solve

them.

METHODOLOGY / PROCEDURE:

Self study course – II (4 periods per week) includes referring library books, e–

learning, internet accessing and presentation.

• Latest and advanced topics shall be identified in the interested area.

• Literature survey shall be conducted on the selected topic.

• Required information shall be collected related to the topic as a soft / hard copy.

• A brief report shall be prepared on the topic.

• An oral presentation shall be given on the report before the Committee

AR - 13 - B.Tech – CSE III Year II Semester


DATA WAREHOUSING AND DATA MINING



Course Objectives:

• Introduce basic concepts, principles, major techniques and algorithms in Data

Warehousing and Data Mining. These include concepts and techniques for data

preprocessing, OLAP, association rule mining, data classification, and data clustering.

• Discuss applications, Emerging Areas in Data Mining and the role of it in Society.

Course Outcomes:

1. Recognize types of Data, Data Quality, need of preprocessing and different measures

of similarity and dissimilarity.

2. Differentiate between methods for modeling multidimensional data, design and

implement Data Warehouse.

3. Explain in detail major techniques and algorithms involved in data mining, including

techniques and algorithms for data preprocessing, association rule mining, data

classification, and data clustering.

4. Evaluate the performance of a classifier.

5. Compare and contrast Partitioning, Hierarchical and Density based Clustering

Algorithms.

UNIT – I

Introduction to Data Mining: What is data mining, motivating challenges, origins of data

mining, data mining tasks, Types of Data-attributes and measurements, types of data sets,

Data Quality (Tan)

Data Preprocessing, Measures of similarity and Dissimilarity: Basics, similarity and

dissimilarity between simple attributes, dissimilarities between data objects, similarities

between data objects, examples of proximity measures: similarity measures for binary data,

Jaccard coefficient, Cosine similarity, Extended Jaccard coefficient, correlation, Exploring

data: Data set, summary statistics (Tan).

UNIT – II

Data Warehouse and OLAP Technology: Data Warehouse, Multidimensional Data Model,

Data Warehouse Architecture, Data Warehouse Implementation, From Data Warehousing to

Data Mining (Han).

Concept Description - Characterization and Comparison: Data Generalization and

Summarization-Based Characterization, Analytical Characterization: Analysis of Attribute

Relevance, Mining Class Comparisons: Discriminating between Different Classes. (Han).

UNIT – III

Association analysis problem definition, Frequent item–set generation. The apriori principle,

frequent item set generation in the Apriori algorithm, candidate generation and pruning,

support counting (eluding support counting using a Hash tree), Rule generation compact

representation of frequent item sets, FP–Growth algorithm (Tan)



UNIT – IV

Classification and Prediction: Issues Regarding Classification and Prediction, Classification

by Decision Tree Induction, Bayesian Classification, Rule-Based Classification,

Classification by Back propagation, Prediction, Accuracy and Error Measures, Evaluating the

Accuracy of a Classifier or Predictor, Increasing the Accuracy (Han).

UNIT – V

Cluster Analysis:

Overview- types of clustering basic K–means, K-means – additional issues, bisecting k-

means k-means and different types of clusters, strengths and weaknesses, k-means as an

optimization problem.

Agglomerative hierarchical clustering, basic agglomerative hierarchical clustering algorithm,

specific techniques, DBSCAN: traditional density: center–based approach, strength and

weaknesses (Tan)

TEXT BOOKS:

1. Introduction to Data Mining, Pang Ning Tan, Michael Steinbach, Vipin Kumar,

Pearson (Tan).

2. Data Mining Concepts and Techniques, 3/e, Jiawei Han & Micheline Kamber,

Elsevier (Han).

REFERENCE BOOKS:

1. Introduction to Data Mining with Case Studies, 2/e, GK Gupta, PHI

2. Data Mining: Introductory and Advanced Topics, Dunham, Sridhar, Pearson Data

Warehousing, Data Mining and OLAP, Alex Berson, Stephen Smith, TMH



WEB TECHNOLOGIES



Course Objectives:

The main objectives of this course are

• Understanding the concept of web technologies.

• Creating web pages by using HTML

• Applying JavaScript validations

• Understanding the use of XML in Advanced Web Technologies

• Understanding the importance of Java Beans in Architectures like MVC

• Creating interactive web pages by Using Servlets.

• Understanding the advantages of JSP over Servlets and MVC Architecture

• Understanding Database Connectivity

Course Outcomes:

The above exercise shall make the students competent in the following ways and will be

able to learn following parameters at the end of the course.

1. Understand and build Web pages using HTML

2. Apply styles to web pages and validate the forms using JavaScript

3. Design and Develop a parser that retrieve data from XML Files.

4. Apply their computer science skills to the create a website with some understanding

of the legal, security, commercial, marketing and other issues involved.

5. Understand ways of using different web technologies

UNIT-I:

HTML Introduction, Common tags - Lists, Tables, images, forms, Frames; Cascading Style

sheets; Introduction to Java Script, Events & Objects in Java Script, Dynamic HTML with

Java Script

UNIT-II:

XML: Document Type Definition, XML Schemas, Document Object Model, Presenting

XML,

Using XML Processors: DOM and SAX

UNIT-III:

Installing the Java Software Development Kit, Tomcat Server & Testing Tomcat

Introduction to Servlets: Lifecycle of a Servlet, The Servlets API, The javax.servlet Package,

Reading Servlets parameters, Reading Initialization parameters, The javax.servlet.http

package, Handling HttpRequest & Responses, Using Cookies & Session Tracking, Security

Issues,

Introduction to JSP: The Problem with Servlets, The Anatomy of a JSP Page, JSP Processing.

JSP Application Design with MVC.

UNIT-IV:

JSP Application Development: Generating Dynamic Content, Using Scripting Elements,

Implicit JSP Objects, Conditional Processing – Displaying Values Using an Expression to Set

an Attribute, Declaring Variables and Methods Error Handling and Debugging Sharing Data

Between JSP pages, Requests, and Users Passing Control and Date between Pages



UNIT - V

Database Access: Database Programming using JDBC, Studying Javax.sql package,

accessing a Database from a JSP Page, Application Specific Database Actions

TEXT BOOKS:

1. Web Programming, building internet applications, Chris Bates 2nd edition, WILEY

Dreamtech

2. The complete Reference Java 2 Fifth Edition by Patrick Naughton and Herbert Schildt.

TMH (Chapters: 25)

3. Java Server Pages –Hans Bergsten, SPD O’Reilly

REFERENCE BOOKS:

1. Programming world wide web-Sebesta, Pearson

2. Internet and World Wide Web – How to program by Dietel and Nieto PHI/Pearson

Education Asia.

3. An Introduction to web Design and Programming –Wang-Thomson

4. Web Applications Technologies Concepts-Knuckles,John Wiley




NETWORK SECURITY AND CRYPTOGRAPHY



Course Objectives:

The course is designed with the objective:

• To clearly recognize the different Security Attacks, Security Services and Security

Mechanisms.

• To list out the importance and applications of Non-Cryptographic and Software

Vulnerabilities.

• To demonstrate the basic categories of Cryptographic Systems.

• To compute different Conventional Encryption Algorithms.

• To describe the important public-key cryptosystems.

• To analyze the authentication by studying different authentication applications.

• To describe the security approaches related to Electronic Mail

• To express the overall structure of IPSec

• To categorize Intrusions and intrusion detection techniques.

• To develop the different firewall principles.

Course Outcomes:

At the end of this course the student will be able to:

1. Recall different Security Attacks, Services and Mechanisms.

2. Classify and explain categories of different encryption and decryption techniques.

3. Identify the authentication applications such as Kerberos and x.509 directory services.

and Analyze the usage of PGP and S/MIME.

4. Familiar with the importance of IP Security and Web Security.

5. Exposed to viruses and related threats and design principles of firewalls.

UNIT-I

Introduction: Security Attacks, Security Services and Security Mechanisms, A Model for

Network security.

Non-Cryptographic Protocol Vulnerabilities: Dos, Session Hijacking and Spoofing.

Software Vulnerabilities: Buffer Overflow, Format String Attacks and SQL Injection.

Basics of Cryptography: Substitution Techniques, Transposition Techniques, Block and

Stream Ciphers.

UNIT-II

Conventional Encryption and Message Confidentiality: Conventional Encryption

Principles, Algorithms: DES, Triple DES, Blowfish, IDEA and AES, Cipher Block Modes of

Operations, Location of Encryption Devices, Key Distribution.

Public-Key Cryptography and Message Authentication: Approaches to Message

Authentication, Secure Hash Functions and HMAC, Public Key Cryptography Principles,

Algorithms: RSA, Diffie-Hellman Key Exchange, Introduction to Elliptic Curve

Cryptography, Digital Signatures.



UNIT-III

Authentication Applications - Kerberos: Motivation, Requirements, Version 4, Differences

between V4 and V5. X.509 Authentication Service: Certificate Formats, Obtaining User

Certificate, Revocation of Certificates, Authentication Procedures.

Electronic Mail Security - Pretty Good Privacy: Notation, Operational Description.

S/MIME: RFC 822, Limitations of SMTP, MIME Overview, MIME Content Types, MIME

Transfer Encodings, S/MIME Functionality.

UNIT-IV

IP Security: Overview, Architecture, AH, ESP, Combining Security Associations, Key

Management.

Web Security: Considerations, SSL: Architecture, Record Protocol, Change Cipher Spec

Protocol, Alert Protocol, Handshake Protocol, TLS, SET: Overview, Dual Signatures,

Payment Processing.

UNIT-V

Intruders: Intrusion Techniques, Password Protection, Intrusion Detection.

Viruses and Related Threats: Malicious Programs, The Nature of Viruses, Types of

Viruses.

Firewalls: Design Principles, Characteristics, Types of Firewalls, Firewall Configurations.

Trusted Systems.

TEXT BOOKS:

1. Network Security Essentials: Applications and Standards, William Stallings, Pearson

Education.

2. Cryptography and Network, 2nd Edition, Behrouz A. Fourouzan and Debdeep

Mukhopadhyay, McGraw-Hill, 2010.

REFERENCE BOOKS:

1. Cryptography and Network Security: Principles and Practice, William Stallings,

Pearson Education.

2. Principles of Information Security, Whitman, Thomson.

3. Introduction to Cryptography, Buchmann, Springer.



COMPUTER GRAPHICS



Course Objectives:

The objective of this course is

• To enlighten the working principles of display devices, and concepts of resolution.

• To understand the fundamental data-structures and algorithms used for output primitives.

• To design graphics programmes using mathematical and theoretical foundations.

• To hypothesize 3D models of objects.

• To organize steps and plan for generation of animations.

Course Outcomes:

After successfully completing this course, the student will be able to

1. Identify and describe what resolution and type of graphics routines are used in any

given graphics display.

2. Demonstrate routines for generating different output primitives including: drawing

lines, conic sections, polygons, other routines for polygon filling.

3. Apply 2D transformations like translate, rotate, and scale to manipulate images, and

also perform clipping. Also implement Pipeline phases in 2D.

4. Generate 3D computer graphics using interpolation and approximation functions. And

derive Projection Transformations.

5. Detect visible surfaces using various routines, thus hiding back faces in 3D graphics,

and generate Computer Animation.

UNIT I

Graphics Primitives: Display Files, Display processors, Pixels and frame buffers, types of

display devices, Geometry and line Generation: Points, Lines, Planes.

UNIT II

Output Primitives: DDA and Bresenham’s Line Algorithms, Mid-Point algorithms for circle

generation, algorithm for ellipse generation. Algorithms for polygon generation, Polygon

filling algorithms, NDC (Normalized device co-ordinates).

UNIT III

2D Transformations: Scaling, Rotation, translation, homogenous for ordinates, rotation about

arbitrary point Reflections. Windowing and Clipping: Window, viewport, viewing

transformation, Line clipping: Cohen-Sutherland and mid-point subdivision, Polygon

clipping: Sutherland-Hodgeman algorithm.

UNIT IV

3D Graphics: 3D primitives, Curves and surfaces: Generation of curves and surfaces using

Hermite, Beziere and BSplines, 3D Transformations: Projections: Types, General parallel and

perspective transformations.



UNIT V

Visible surface detection algorithms: Back-face, Z-buffer, Scan-line algorithm, Painter’s

algorithm, Warnock’s algorithm. Animation: Steps in design sequence, animation languages,

morphing.

TEXT BOOKS:

1. Donald Hearn and M.Paulin Baker, “Computer Graphics- C Version”, 2nd edition. INDIA:

Pearson Ed. 2013.

2. David F Rogers, “Procedural Elements for Computer Graphics”, McGraw-Hill.

REFERENCE BOOKS:

1. Newman & Sproul – Principles of Interactive Computer Graphics.

2. David F Rogers and Adams – Mathematical Elements for Computer Graphics.

3. Foley, Vandam, Feiner & Huges – Computer Graphics Principles and Practice – Addison

Wesley.

[reference number] Author(s),Book Title ,Edition number.Place of Publication: Publisher,

Year.

4 A. Iosevich,A View From the Top: Analysis, Combinatorics and Number Theory, Rhode

Island: American Mathematical Society, 2007

.



UNIX PROGRAMMING



Course Objectives:

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

• Understand the components and architecture of the UNIX operating system and basic

UNIX utilities.

• Use selected features of the various shells and environment variables for program structure

and layout to write simple shell scripts.

• Review library calls and system calls and also organize and manipulate files and directories

by using system calls.

• Paraphrase the UNIX process model and Use various types of signals for a handling of

process and Paraphrase the system calls for handling signals.

• To become fluent with the systems calls provided in the UNIX Inter process

communication including shared memory, pipes and messages.

Course Outcomes:

1. Work confidently on writing shell scripts by using shell environment.

2. Tell the difference between conventional function calls versus system calls in UNIX

and Classify system calls in UNIX.

3. Describe the relation of a concept of a process and handle a process by using signals.

4. Define mechanisms for local and remote inter-process communication in UNIX and

implement the client-server paradigm of computing with mechanisms of IPC.

5. Identify the System calls for synchronization, protection, and interrupts of any UNIX.

UNIT – I

Introduction to unix file system, vi editor, file handling utilities, security by file permissions,

process utilities, disk utilities, networking commands, cp, mv, ln, rm, unlink, mkdir, rmdir,

du,df, mount, umount, find, umask, ulimit, ps, who, w, finger, arp, ftp, telnet, rlogin,text

processing utilities and backup utilities , detailed commands to be covered are cat,tail, head ,

sort, nl, uniq, grep, egrep, fgrep, cut, paste, join, tee, pg, comm, cmp, diff, tr, awk, tar, cpio.

UNIT – II

What is a shell, shell responsibilities, pipes and input Redirection, output redirection, here

documents, the shell as a programming language, shell meta characters, shell variables, shell

commands, the environment, control structures, shell script examples.

UNIT – III

Unix file structure, directories, files and devices, System calls, library functions, low level

file access, usage of open, creat, read, write, close, lseek, stat, fstat, umask, dup and dup2, the

standard i/o (fopen, fopen, fclose,fflush, fseek, fgetc, getc, getchar, fputc, putc, putchar, fgets,

gets ),formatted I/O, stream errors, streams and file descriptors, file and directory

maintenance (chmod, chown,unlink, link, symlink, mkdir, rmdir, chdir, getcwd) .



UNIT –IV

Process and Signals : What is process, process structure, starting new process, Waiting for a

process, zombie process, process control, process identifiers, fork, Vfork, exit, wait,exec,

Signal functions, unreliable signals, interrupted system Calls, kill and raise functions, alarm,

pause functions, abort, system, sleep functions.

UNIT – V

Inter-Process communication: Pipe, Process Pipes, the pipe call, parent-child process, named

pipes, Semaphores, message queues and shared memory and applications of IPC.

TEXT BOOKS:

1. Unix Network Programming, W.R.Stevens Pearson/PHI.

2. Unix the ultimate guide, Sumitabha Das, TMH.

REFERENCE BOOKS:

1. Advanced UNIX Programming. Dr. .B.Venkateswarlu.B.S.Publications.2e

2. Advanced programming in the Unix environment, W.R.Stevens, Pearson education.

3. Unix Internals the New Frontiers, U.Vahalia, Pearson Education.

4. Unix for programmers and users, 3rd edition, Graham Glass, King Ables, Pearson

Education.



SOFTWARE PROJECT MANAGEMENT

(ELECTIVE-I)



Cousre Objectives:

• Discuss the basic concepts and issues of software project management.

• Plan your software projects.

• Implement your project plans through managing people, communications and change.

• Select and employ mechanisms for tracking your software projects

• Control your software projects.

Course Outcomes:

1. Define, plan and monitor the work and resources required to achieve an agreed outcome

2. Control project change

3. Ensure fit for purpose project outputs.

4. Engage and motivate the stakeholders of the project

5. The software development lifecycle.

6. The implications and consequences of having multiple software systems in places of work

7. A systematic understanding of knowledge and a critical awareness of current problems in

their field of study or area of professional practice.

8. A comprehensive understanding of research methods and techniques appropriate to

defining, planning and carrying out a research project within your chosen specialist area

within the management of software projects.

UNIT – I

Conventional Software Management:

The waterfall model, conventional software Management performance.

Evolution of Software Economics: Software Economics, pragmatic software cost estimation.

UNIT – II

Improving Software Economics: Reducing Software product size, improving software

processes, improving team effectiveness, improving automation, Achieving required quality.

The old way and the new: The principles of conventional software Engineering, principles of

modern software management, transitioning to an iterative process.

Life cycle phases: Engineering (inception, Elaboration) and production stages (construction,

transition phases).

UNIT – III

Artifacts of the process: The artifact sets.

Model based software architectures: A Management perspective and technical perspective.

Work Flows of the process: Software process workflows, Iteration workflows.

Checkpoints of the process: Major mile stones, Minor Milestones, Periodic status

assessments.



UNIT – IV

Iterative Process Planning:

Work breakdown structures, planning guidelines, cost and schedule estimating.

Project Organizations and responsibilities: Line-of-

Business Organizations, Project Organizations, evolution of Organizations.

Process Automation: The Project Environment.

UNIT – V

Project Control and Process instrumentation: The seven core Metrics (Management

indicators, quality indicators), pragmatic Software Metrics, Metrics automation.

Tailoring the Process: Process discriminates.

Case Study: The command Center Processing and Display system- Replacement (CCPDS-R).

TEXT BOOKS:

1. Software Project Management, Walker Royce: Pearson Education, 2005.

2. Software Project Management, Bob Hughes and Mike Cotterell: Tata McGraw-Hill

Edition.

REFERENCE BOOKS:

1. Software Project Management, Joel Henry, Pearson Education.

2. Software Project Management in practice, Pankaj Jalote, Pearson Education.2005.



ADVANCED COMPUTER ARCHITECTURE

(ELECTIVE - I)



Cousre Objectives:

• Understand the advanced concepts of computer architecture and it discusses the main

components of the computer and the basic principles of its operation.

• Analyze the memory hierarchy design and the relationship between computer design

and application requirements, cost/performance tradeoffs and how to improve cache

performance.

• Understand the linear & nonlinear scheduling processes in pipelining and identify the

different architectural and organizational design issues that can affect the performance

of a computer such as instruction set design, pipelining architecture.

• Explore advanced concepts and state-of-the-art developments in computer

architecture such as multiprocessor memory architectures & multiprocessor,

interconnection networks.

• Synthesize the cache coherence and how to solve the problem and the message

passing system to avoiding the inconsistency & reducing traffic.

Cousre Outcomes:

1. Infer knowledge on Hardware and System Design concepts and to reconstruct the

CM-2 architecture and its functionality.

2. Design E-cube routing in Hypercube computers and X-Y routing in 2-D mesh.

3. Justify identify permissible latencies and forbidden latencies for the given non-linear

pipeline.

4. Learning about the different architectures like CISC & RISC and distinguish between

the RISC and CISC architectures.

5. Design the input-output connections in an Omega Network using perfect shuffle

method.

UNIT – I

Parallel Computer: State of computing, Elements of modern computer, Flynn’s classification

of parallel processors, System attributes to performance, Multiprocessors and Multicomputer,

Shared memory multiprocessors, Distributed memory multiprocessors.

UNIT – II

Memory Hierarchy Design:Basic memory hierarchy,Optimization of cache performance,

Small and simple first level cache to reduce hit time and power,Way prediction to reduce hit

time, Pipelined cache access to increase cache band width, Non-blocking cache to increase

cache band width.

UNIT – III

Linear and Non-Linear Pipeline Processors:Asynchronous and synchronous models,Clocking

and timing control,Speedup,Efficiency and Throughput,Non-Linear Pipeline Processors-

Reservation and latency analysis problems,Collision free scheduling problems,instruction

execution phases

.



UNIT – IV

Multiprocessors and Multivector Computers: Inter connection structure-Crossbar switch and

multiport memory,Multistage and combining network routing,Hot-spot problem.

Multivector computers- Vector processing principles,Vector instruction types,Vector access

memory schemes.

UNIT – V

Cache coherence and Message Passing Mechanisms:Cache coherence problems-Two

protocol approach,Snoopy protocol,Directory based protocol,Message Passing Mechanisms-

Message routing schemes,Deadlock virtual channels,Flow control strategies,Multicast routing

algorithm.

TEXT BOOK:

1. “Advanced Computer Architecture-parallelism,Scalability,Programmability” Kai Hwang

and Naresh Jotwani, McGraw-Hill Publications.

REFERENCE BOOKS :

1.“Computer Architecture and parallel Processing” Kai Hwang and A.Briggs International

Edition McGraw-Hill.

2. “Computer Architecture A quantitative approach” 3rd edition John L. Hennessy & David

A. Patterson Morgan Kufmann.



ADVANCED DATABASES

(ELECTIVE - I)



Course Objectives:

• To clearly describe the difference of Centralized database and Distributed database

and enable the students to design/model a distributed database.

• Understand reliability concepts and measures in the context of Distributed Databases

• Explain the potential advantages and risks associated with distributed databases.

• Describe the salient characteristics of the variety of distributed database

environments.

• Ideally the user is unaware of the distribution of data, and all data in the network

appear as single logical database stored at one site. In ideal case, a single query can

join data from tables in multiple sites as if the data were all in one site.

• Outline the steps involved in processing a query in a distributed database and several

approaches used to optimize distributed query processing.

Course Outcomes:

1. By the end of this course student will have good knowledge of the issues and

challenges faced while designing distributed database systems.

2. Understand the fundamental principles and architecture of distributed database

systems.

3. Familiar with the different methods and techniques distributed query processing.

4. Develop the understanding of choosing the optimized query execution plan for

distributed queries.

5. Have a broad picture of distributed transaction management and concurrency Control

and distributed DBMS reliability and replication techniques.

6. They will be able to design a multidatabase Systems and can resolve problems of

heterogeneous multidatabase systems in database integration strategies.

UNIT-I

Introduction; Distributed Data Processing, Distributed Database System, Promises of DDBSs,

Problem areas. Overview of Relational DBMS: Relational Database Concepts,

Normalization, Integrity rules, Relational data languages.

UNIT-II

Distributed DBMS Architecture: Architectural Models for Distributed DBMS, DDMBS

Architecture. Distributed Database Design: Alternative Design Strategies, Distribution

Design issues, Fragmentation, Allocation.

UNIT-III

Query Processing and decomposition: Query Processing Objectives, Characterization of

query processors, layers of query processing, query decomposition, Localization of

distributed data.

Distributed query Optimization: Query optimization, centralized query optimization,

Distributed query optimization algorithms.

Distributed concurrency control: Serializability, concurrency control Mechanisms &

Algorithms, Time stamped & Optimistic concurrency control Algorithms, Deadlock

Management



UNIT-IV

Distributed DBMS Reliability: Reliability concepts and Measures, fault-tolerance in

Distributed systems, failures in Distributed DBMS, local & Distributed Reliability Protocols,

site failures and Network partitioning. Parallel Database Systems: Database Series, Parallel

Architecture, Parallel DBMS Techniques, Parallel exception problems, Parallel Execution for

Hierarchical architecture.

UNIT-V

Distributed object Database Management Systems: Fundamental object concepts and Models,

Object Distributed Design, Architectural Issues, Object Management, Distributed Object

storage, Object query Processing.

Object Oriented Data Model : Inheritance, Object identity, persistent programming

languages, persistence of objects, comparing OODBMS and ORDBMS

TEXT BOOKS:

1. M.Tamer OZSU and Pauck Valduriez: Principles of Distributed Database Systems,

Pearson Edn. Asia, 2001.

2. Stefano Ceri and Willipse Pelagatti: Distributed Databases, McGraw Hill.

3. Henry F Korth, A Silberchatz and Sudershan : Database System Concepts, MGH

4. . Raghuramakrishnan and Johhanes Gehrke: Database Management Systems, MGH

REFERENCE BOOKS:

1. Concurrency Control and Reliability in Distributed Systems, Van Nostrand and

Reinhold Publishers by Bharat Bhargava (Ed.), 1987

2.Transaction Processing: Concepts and Techniques, Morgan Kaufmann, Jim Gray and

Andreas Reuter, 1992 (Copy on reserve in LWSN reception office book shelf)



INFORMATION RETRIEVAL SYSTEMS

(ELECTIVE - I)



Course Objectives:

• To outline basic terminology and components in information storage and retrieval

systems

• To identify basic theories and analysis tools as they apply to information retrieval

• To develop understanding of problems and potentials of current IR systems

• To articulate fundamental functions used in information retrieval such as automatic

indexing, abstracting, and clustering

• To learn and appreciate different retrieval algorithms and systems

• To critically evaluate information retrieval system effectiveness and improvement

techniques

• To describe current trends in information retrieval such as information visualization.

Course Outcomes:

After undergoing the course, Students will be able to

1. Understand and apply fundamental concepts of information retrieval techniques

2. Understand the limitations of different information retrieval techniques

3. Use different information retrieval techniques in various application areas

4. Apply IR principles to locate relevant information in large collections of data

5. Analyze performance of retrieval systems

6. Implement retrieval systems for web search tasks

7. Evaluate search engines

UNIT-I:

Introduction: Definition, Objectives, Functional Overview, Relationship to DBMS, Digital

libraries and Data Warehouses.

Information Retrieval System Capabilities: Search, Browse, Miscellaneous Cataloging and

Indexing: Objectives, Indexing Process, Automatic Indexing, Information Extraction.

UNIT-II:

Data Structures: Introduction, Stemming Algorithms, Inverted file structures, N-gram data

structure, PAT data structure, Signature file structure, Hypertext data structure.

UNIT-III:

Automatic Indexing: Classes of automatic indexing, Statistical indexing, Natural language,

Concept indexing, Hypertext linkages

Document and Term Clustering: Introduction, Thesaurus generation, Item clustering,

Hierarchy

of clusters.

UNIT-IV:

User Search Techniques: Search statements and binding, Similarity measures and ranking,

Relevance feedback, Selective dissemination of information search, Weighted searches of

Boolean systems, Searching the Internet and hypertext.



UNIT-V:

Information Visualization: Introduction, Cognition and perception, Information visualization

technologies.

Text Search Algorithms: Introduction, Software text search algorithms, Hardware text search

systems. Information System Evaluation: Introduction, Measures used in system evaluation.

TEXT BOOKS:

1. Kowalski, Gerald, Mark T Maybury: Information Retrieval Systems: Theory and

Implementation, Kluwer Academic Press, 1997.

2. Modern Information Retrieval By Yates Pearson Education.

REFERENCE BOOKS:

1. Frakes, W.B., Ricardo Baeza-Yates: Information Retrieval Data Structures and

Algorithms, Prentice Hall, 1992.

2. Information Storage & Retrieval By Robert Korfhage – John Wiley & Sons.



ARTIFICIAL INTELLIGENCE

(ELECTIVE - I)



Course Objectives:

This course has been designed to:

• Explain how heuristics offer ways to pursue goals in exponentially large search spaces

• Describe the representation and use of knowledge in inference-based problem solving

by knowledge-based agents

• Apply probability theory to describe and model agents operating in uncertain

environments

• Describe ways to supervise agents to learn and improve their behavior

• Explain adaptive learning from the environment

• Relate theories of mind and the future of AI to ethical issues raised by artificial

cognitive systems

Course Outcomes:

A student completing this course will be able to:

1. Explain the basic knowledge representation, problem solving, and learning methods

of Artificial Intelligence

2. Assess the applicability, strengths, and weaknesses of the basic knowledge

representation, problem solving, and learning methods in solving particular

engineering problems

3. Develop intelligent systems by assembling solutions to concrete computational

problems

4. Understand the role of knowledge representation, problem solving, and learning in

intelligent-system engineering

5. Develop an interest in the field sufficient to take more advanced subjects

UNIT I:

Introduction to artificial intelligence: Introduction, history, intelligent systems, foundations of

AI, applications, tic-tac-tie game playing, development of AI languages, current trends in AI.

Problem solving: state-space search and control strategies : Introduction, general problem

solving, characteristics of problem, exhaustive searches, heuristic search techniques,

iterative-deepening a*, constraint satisfaction.

UNIT II:

Logic concepts: Introduction, propositional calculus, proportional logic, natural deduction

system, axiomatic system, semantic tableau system in proportional logic, resolution refutation

in proportional logic, predicate logic.

UNIT III:

Knowledge representation: Introduction, approaches to knowledge representation, knowledge

representation using semantic network, extended semantic networks for KR, knowledge

representation using frames advanced knowledge representation techniques:



UNIT IV:

Expert system and applications: Introduction phases in building expert systems, expert

system versus traditional systems, rule-based expert systems, truth maintenance systems.

Uncertainty measure: probability theory: Introduction, probability theory, Bayesian belief

networks, certainty factor theory, Dempster-Shafer theory

UNIT V:

Machine learning paradigms: Introduction, machine learning systems, supervised and

unsupervised learning, inductive learning, deductive learning, clustering, support vector

machines, case based reasoning and learning. Artificial neural networks: Introduction,

artificial networks, single layer feed forward networks, multi layered forward networks,

design issues of artificial neural networks

TEXT BOOKS:

1. Artificial Intelligence- Saroj Kaushik, CENGAGE Learning,

2. Artificial intelligence, A modern Approach , 2nd ed, Stuart Russel, Peter Norvig, PEA

3. Artificial Intelligence- Rich, Kevin Knight,Shiv Shankar B Nair, 3rd ed, TMH

4. Introduction to Artificial Intelligence, Patterson, PHI

REFERENCE BOOKS:

1. Artificial intelligence, structures and Strategies for Complex problem solving,

George.F.Lugar, 5th edition, PEA

2. Introduction to Artificial Intelligence, Ertel, Wolf Gang, Springer

3. Artificial Intelligence, A new Synthesis, Nils J Nilsson, Elsevier



WEB TECHNOLOGIES LAB



Course Objectives:

The main objectives of this course are

• To make students to create a Complete Web technology solution through creating an

online book Store website.

• Understand the importance of Java Script in creating a web Application

• Understand the importance of CSS in creating a web Application

• Understand the advantage of Java Beans in creating web applications.

• Creating Server Side Web Applications by using Servlets.

• Understanding the concept of reading Servlet parameters.

• Understanding the advantage of using JSP over Servlets in creating applications

• Creating Database connectivity Applications.

Course Outcomes:

The above exercise shall make the students competent in the following ways and will be able

to learn following parameters at the end of the course.

1. Understand and build a complete website using HTML ,

2. Apply CSS and JavaScript for creation and validation of developing web pages.

3. Design and Develop applications to store and retrieve data from XML files.

4. Implement a dynamic website by using the Servlets and JSP

5. Design and develop database applications

6. Apply a database and associate it with a website.

Design the following static web pages required for an online book store web site.

1) HOME PAGE:

The static home page must contain three frames.

Top frame : Logo and the college name and links to Home page, Login page, Registration

page,

Catalogue page and Cart page (the description of these pages will be given below).

Left frame : At least four links for navigation, which will display the catalogue of respective

links.For e.g.: When you click the link “CSE” the catalogue for CSE Books should be

displayed in the Right frame.

Right frame: The pages to the links in the left frame must be loaded here. Initially this page

contains description of the web site.



2) Login page

3. REGISTRATION PAGE:

Create a “registration form “with the following fields

1) Name (Text field)

2) Password (password field)

3) E-mail id (text field)

4) Phone number (text field)

5) Sex (radio button)

6) Date of birth (3 select boxes)

7) Languages known (check boxes – English, Telugu, Hindi, Tamil)

8) Address (text area)

4) CATOLOGUE PAGE:

The catalogue page should contain the details of all the books available in the web site in a

table.

The details should contain the following:

1. Snap shot of Cover Page.

2. Author Name.

3. Publisher.

4. Price.

5. Add to cart button.

5. VALIDATIONS:

Write JavaScript to validate the following fields of the above registration page.

1. Name (Name should contains alphabets and the length should not be less than 6

characters).

2. Password (Password should not be less than 6 characters length).

3. E-mail id (should not contain any invalid and must follow the standard pattern



[email protected])

4. Phone number (Phone number should contain 10 digits only).

Note : You can also validate the login page with these parameters.

6. CSS

Design a web page using CSS (Cascading Style Sheets) which includes the following:

1) Use different font, styles:

In the style definition you define how each selector should work (font, color etc.).

Then, in the body of your pages, you refer to these selectors to activate the styles

7. Write an XML file which will display the Book information which includes the following:

1) Title of the book

2) Author Name

3) ISBN number

4) Publisher name

5) Edition

6) Price

Write a Document Type Definition (DTD) to validate the above XML file.

8. Install TOMCAT web server and APACHE.

While installation assign port number 4040 to TOMCAT and 8080 to APACHE. Make sure

that these ports are available i.e., no other process is using this port.

2) Access the above developed static web pages for books web site, using these servers by

putting the web pages developed in experiment-1 and experiment-2 in the document root.

Access the pages by using the urls : http://localhost:4040/online/books.html (for tomcat)

http://localhost:8080/books.html (for Apache)

9. Write servlet program to read parameters from web.xml

10. Write a servlet program using cookie management

11. write servlet program to illustrate HttpSession

12. Create tables in the database which contain the details of items (books in our case like

Book name , Price, Quantity, Amount ) of each category. Modify your catalogue page in such

a way that you should connect to the database and extract data from the tables and display

them in the catalogue page using JDBC.

TEXT BOOKS:

1. Web Programming, building internet applications, Chris Bates 2nd edition, WILEY

Dreamtech

2. The complete Reference Java 2 Fifth Edition by Patrick Naughton and Herbert Schildt.

TMH (Chapters: 25)

3. Java Server Pages –Hans Bergsten, SPD O’Reilly

REFERENCE BOOKS:


2. Internet and World Wide Web – How to program by Dietel and Nieto PHI/Pearson

Education Asia.

3. An Introduction to web Design and Programming –Wang-Thomson

4. Web Applications Technologies Concepts-Knuckles, John Wiley



UNIX PROGRAMMING LAB



Course Objectives:

Upon completion of this course, students will be able to

• Paraphrase the major components and describe the architecture of UNIX operating

system

• Organize and manipulate files and directories

• Control the resources with various commands.

• Use I/O redirection, pipes, quoting and file name expansion mechanisms

• Write programs using File systems and File structures

• Compare and contrast various inter-process communication facilities

Course Outcomes:

After the completion of this course the student will

1. Remember how Unix File Structure is organized, familiarize with UNIX commands,

and implement shell scripts.

2. Classify system calls in UNIX

3. Analyze the concepts of process, threads, and file structure.

4. Implement IPC using pipes, semaphores, Shared Memory and messages.

5. Create Client / Server applications using sockets

List Of Experiments

1. Write a shell script to generate a multiplication table.

2. Write a shell script that copies multiple files to a directory.

3. Write a shell script which counts the number of lines and words present in a given file.

4. Write a shell script which displays the list of all files in the given directory.

5. Write a C program that counts the number of blanks in a text file.

6. Implement in C the following Unix commands using system calls.

a) cat b) ls c) mv

7. Write a program that takes one or more file/directory names as command line input and

reports the following information on the file:

a) File type. b) Number of links.

b) Time of last access. d) Read, Write and Execute permissions.

8. Write a C program that illustrates how to execute two commands concurrently with a

command pipe.

9. Write a C program that illustrates the creation of child process using fork system call.

10. Write a C program that displays the real time of a day every 60 seconds.

11. Write a C program that illustrates the following.

a) Creating a message queue.

b) Writing to a message queue.

c) Reading from a message queue.

12. Write a C program that illustrates inter process communication using shared memory

system calls.



TEXT BOOKS:

1. Unix Network Programming, W.R.Stevens Pearson/PHI.

2. Unix the ultimate guide, Sumitabha Das, TMH.

REFERENCE BOOKS:

1. Advanced UNIX Programming. Dr. .B.Venkateswarlu.B.S.Publications.2e

2. Advanced programming in the Unix environment, W.R.Stevens, Pearson education.

3. Unix Internals the New Frontiers, U.Vahalia, Pearson Education.

4. Unix for programmers and users, 3rd edition, Graham Glass, King Ables, Pearson

Education.



INTELLECTUAL PROPERTY RIGHTS AND PATENTS

Subject Code: 13HS3202

Course Objectives:

• Core concepts: Students will have a basic competence in the core concepts of each of the

forms of intellectual property (Patents, Copyright and Related Rights, Trademarks,

Industrial Designs and Integrated Circuits, Geographical Indications, Protections Against

Unfair Competitions, and Traditional Knowledge), including the nature and extent of the

rights that are available to protect them.

• Applying disciplinary contexts: Students will be familiar with all the important

doctrines of the field of laws and treaties governing intellectual property, and will have a

good understanding of the most important standards for registering, obtaining, and enforcing

intellectual property rights at national, regional, and international levels.

• Connections: Students will begin to see the connections between intellectual property

rights protection and development of world economy. In addition, students will understand

how intellectual property rights make it possible for the creators of innovations to establish

themselves more readily.

Course Outcomes:

1. Understand the scope of intellectual property rights.

2. Understand the reasons behind the existence of intellectual property law.

3. Understand the process of the historical development of intellectual property rights.

4. Understand the distinct contribution of intellectual property law to the protection of

human creativity, innovation, and effort.

Unit I

Introduction to Intellectual Property Law – The Evolutionary Past – The IPR Tool Kit- Para -

Legal Tasks in Intellectual Property Law – Ethical obligations in Para Legal Tasks in

Intellectual Property Law - Introduction to Cyber Law – Innovations and Inventions Trade

related Intellectual Property Right

Unit II

Introduction to Trade mark – Trade mark Registration Process – Post registration procedures

– Trade mark maintenance - Transfer of Rights - Inter parts

Unit III

Intellectual Property Law Basics – Types of Intellectual Property – Agencies responsible for

Intellectual Property Registration - Cyber crime and E-commerce – International Aspects of

Computer and Online Crime

Unit IV

Introduction to Patent Law – Rights and Limitations – Rights under Patent Law – Patent

requirements - Ownership - Transfer - Patents Application Process – Patent Infringement -

Patent Litigation



Unit V

International Patent Law – Double Patenting – Patent Searching – Patent Law Treaty - New

developments in Patent Law – Invention Developers and Promoters

TEXT BOOKS:

1. Deborah E.Bouchoux: “Intellectual Property”. Cengage learning , New Delhi

2. Kompal Bansal & Parishit Bansal “Fundamentals of IPR for Engineers”, BS Publications

(Press)

3. Cyber Law. Texts & Cases, South-Western’s Special Topics Collections

REFERENCE BOOKS :

1. Prabhuddha Ganguli: ‘Intellectual Property Rights” Tata Mc-Graw –Hill, New Delhi

2.Richard Stim: “Intellectual Property”, Cengage Learning, New Delhi.

AR - 13 - B.Tech – CSE IV Year I Semester


UML AND DESIGNS PATTERNS



Course Objectives:

The course content enables students to:

• Develop the different UML diagrams for a software system based on the given

requirements.

• Apply forward engineering to convert diagram to code and reverse engineering to

convert code to diagram.

• Analyze & design a s/w system in object oriented approach, using unified modeling

language.

• Understand different types of Design patterns

• Learn advanced design techniques, principles, practices, and approaches in solving

problems

Course Outcomes:

At the end of the course students are able to:

1. Illustrate the use of unified modeling language for object oriented analysis and design

2. Know the syntax of different UML diagrams.

3. Apply object oriented analysis and design to build a software system.

4. Classify and document design patterns.

5. Paraphrase patterns to manage algorithms and assign responsibilities to objects.

UNIT – I

Introduction to UML: Importance of modeling, principles of modeling, object oriented

modeling, conceptual model of the UML, Architecture, Software Development Life Cycle.

Basic Structural Modeling: Classes, Relationships, common Mechanisms, and diagrams.

Class & Object Diagrams: Terms, concepts, modeling techniques for Class & Object

Diagrams.

UNIT – II

Basic Behavioral Modeling-I: Interactions, Interaction diagrams.

Basic Behavioral Modeling-II: Use cases, Use case Diagrams, Activity Diagrams.

UNIT-III

Advanced Behavioral Modeling: Events and signals, state machines, processes and

Threads, time and space, state chart diagrams.

Architectural Modeling: Component, Deployment, Component diagrams and Deployment

diagrams.

UNIT – IV

Introduction: What Is a Design Pattern? Design Patterns in Smalltalk MVC, Describing

Design Patterns, How to Select a Design Pattern, How to Use a Design Pattern.



UNIT – V

Creational Patterns: Abstract Factory, Singleton,

Structural Pattern : Adapter, Bridge, Composite.

Behavioral Patterns: Chain of Responsibility, Command,.

TEXT BOOKS:

1. The unified Modeling language user guide by Grady Booch, James Rambaugh, Ivar

Jacobson, PEA.

2. Design Patterns By Erich Gamma, Pearson Education.

REFERENCE BOOK:

1. Satzinger: Object Oriented Analysis and Design, CENGAGE.



MOBILE COMPUTING



Course Objectives:

• To introduce the characteristics, basic concepts and systems issues in mobile

communications

• To illustrate architecture and protocols in mobile computing and to identify the trends

and latest development of the technologies in the area

• To design successful mobile computing applications and services

• To evaluate critical design tradeoffs associated with different mobile technologies,

architectures, interfaces and business models and how they impact the usability,

security, privacy and commercial viability of mobile and pervasive computing

services and applications

Course Outcomes:

1. Discover the characteristics of in mobile communications including the major

network components and architectures of the networks systems

2. Analyze the calling system of mobile computing systems

3. Explore the characteristics of different types of MAC on the performance of a

mobile computing system

4. Analyze and compare the performance of different MANET routing

algorithms for mobile real-time applications

5. Develop an attitude to propose solutions with comparisons for problems

related to Mobile computing system through investigation

6. Categorize mobile wireless short range networks and mobile internet for

which support quality of service for secure data transfer.

UNIT- I

Introduction to Mobile Communications:Types of Transmissions: Guided Transmission,

.Un Guided Transmission,novel applications, limitations of mobile computing, mobile

computing Architecture, mobile system networks.

Unit - II

Introduction to GSM:GSM Services and system architecture, Radio interface, Protocols,

Localization and call handling, Handover.

Unit - III

(Wireless) Medium Access Control:Motivation for a specialized MAC (Hidden and

exposed terminals, Near and far terminals), ALOHA, CSMA,IMT-2000 3G wireless

Communication standards,WCDMA 3G Communication standards ,CDMA-2000

Communication standards, features of 4G networks.

Unit - IV

Mobile Network Layer:Mobile IP (Goals, assumptions, entities and terminology, IP packet

delivery, agent advertisement and discovery, registration, tunneling and encapsulation,

optimizations), Dynamic Host Configuration Protocol (DHCP).



Unit -V

Mobile Transport Layer and MANETs:Traditional TCP, Indirect TCP, Snooping TCP,

Mobile TCP, Fast retransmit/fast recovery, Transmission /time-out freezing, Selective

retransmission, Transaction oriented TCP. Mobile Ad hoc Networks (MANETs): Overview,

Properties of a MANET, spectrum of MANET applications, routing and various routing

algorithms, security in MANETs.

TEXT BOOKS:

1. Jochen Schiller, “Mobile Communications”, Pearson Education, Second Edition, 2008

2. Raj Kamal, “Mobile Computing”, OXFORD UNIVERSITY PRESS

3. Handbook of Wireless Networks and Mobile Computing, Stojmenovic , Cacute, Wiley,

2002

REFERENCE BOOKS:

1. Asoke K Talukder, et al, “Mobile Computing”, Tata McGraw Hill, 2008.

2. Matthew S.Gast, “802.11 Wireless Networks”, SPD O’REILLY.

3. Ivan Stojmenovic, “Handbook of Wireless Networks and Mobile Computing”, Wiley,

2007.

4. Kumkum Garg, “Mobile Computing”, Pearson

5. Mobile Computing Principles: Designing and Developing Mobile Applications with

UML and XML, Reza



OPEN SOURCE SOFTWARE



Course Objectives:

• To identify different open source technologies and its advantages

• To create more awareness about alternates of programming

• To develop projects with the help of open sources

• To identify the impact of open sources on development

• To identify the importance of Linux, PHP,MySQL etc.,.

Course Outcomes:

1. Design and configure the Linux system

2. Able to work in Linux platform.

3. Configure the different categories of servers.

4. Able to develop web applications in open source environment.

5. Able to develop own software modules by customizing the existing open source

software

UNIT I

Introduction to Open sources Need of Open Sources Advantages of Open Sources

Application ofOpenSources. Open source operatingsystems : LINUX: Introduction –

General Overview –Kernel Mode and user mode – Process– Advanced Concepts –

Scheduling – Personalities – Cloning – Signals – Development with Linux.

UNIT II

MySQL: IntroductionSettingupaccountStarting,terminatingand writing your own SQL

programs RecordselectionTechnology– Workingwithstrings – Dateand Time – Sorting

Query Results Generating Summary – Working with metadata – Using sequences –

MySQL and Web.

UNIT III

PHP: Introduction – Programminginwebenvironment–variables–constants–Data;types –

operators – Statements– Functions– Arrays–OOP–StringManipulationandregularexpression–

File handlinganddatastorage – PHP and SQL database – PHPandLDAP – PHPConnectivity –

Sending and receiving E-mails – Debugging and errorhandling – Security – Templates.

UNIT IV

Syntax and Style–PythonObjects – Numbers–Sequences – Strings–Lists and Tuples –

Dictionaries –Conditionals and Loops – Files – Input and Output – Errors and Exceptions –

Functions –Modules – Classes and OOP – Execution Environment.

UNIT V

Perl backgrounder – Perl overview– Perl parsing rules – Variables and Data –Statements and

Control structures–Subroutines, Packages, and Modules- Working with Files –

Data Manipulation.



TEXT BOOKS:

1. Remy Card, Eric Dumas and Frank Mevel, “The Linux Kernel Book”, WileyPublications,

2003

2. Steve Suchring, “MySQL Bible”, John Wiley, 2002

REFERENCE BOOKS:

1. Rasmus Lerdorf and Levin Tatroe, “Programming PHP”, O’Reilly, 2002

2. Wesley J. Chun, “Core Phython Programming”, Prentice Hall, 2001

3. Martin C. Brown, “Perl: The Complete Reference”, 2nd Edition, Tata McGraw-Hill

Publishing Company Limited, Indian Reprint 2009.

4. Steven Holzner, “PHP: The Complete Reference”, 2nd Edition, Tata McGraw-

Hill Publishing Company Limited, Indian Reprint 2009.

6. Vikram Vaswani, “MYSQL: The Complete Reference”, 2nd Edition, Tata McGraw –

Hill Publishing CompanyLimited, Indian Reprint 2009.



BIO INFORMATICS

(ELECTIVE – II)



Course Objectives:


• Understand the theoretical basis behind bioinformatics.

• Search databases accessible on the WWW for literatue relating to molecular biology

and Biotechnology.

• Find homologues, analyze sequences, construct and interpret evolutionary trees.

• Understand homology modelling

• Retrieve protein structures from databases.

Course Outcomes:


1. Extract information from different types of bioinformatics data (gene, protein,

disease, etc.), including their biological characteristics and relationships

2. Analyze processed data with the support of analytical and visualization tools

3. Carry out bioinformatics research under advisement, including systems biology,

structural bioinformatics and proteomics

4. Manipulate DNA and protein sequences using stand-alone PC programs and programs

available on the WWW.

UNIT –I

Introduction: Definitions, Sequencing, Biological sequence/structure, Genome Projects,

Pattern recognition an prediction, Folding problem, Sequence Analysis, Homology and

Analogy.

Protein Information Resources: Biological databases, Primary sequence databases, Protein

Sequence databases, Secondary databases, Protein pattern databases, and Structure

classification databases.

Unit-II

Genome Information Resources: DNA sequence databases, specialized genomic resources.

DNA Sequence Analysis: Importance of DNA analysis, Gene structure and DNA sequences,

Features of DNA sequence analysis, EST (Expressed Sequence Tag)searches, Gene hunting,

Profile of a cell, EST analysis, Effects of EST data on DNA databases

Unit-III

Pair Wise Alignment Techniques: Database searching, Alphabets and complexity,

Algorithm and programs, Comparing two sequences, sub-sequences, Identity and similarity,

The Dotplot, Local and global similarity, different alignment techniques, Dynamic

Programming, Pair wise database searching.

Multiple Sequence Alignment : Definition and Goal, The consensus, computational

complexity, Manual methods, Simultaneous methods, Progressive methods, Databases of

Multiple alignments and searching



Unit-IV

Secondary Database Searching:

Importance and need of secondary database searches, secondary database structure and

building a sequence search protocol

Unit-V

Analysis packages: Analysis package structure, commercial databases, commercial software,

comprehensive packages, packages specializing in DNA analysis, Intranet Packages.

TEXT BOOKS:

1. Introduction to Bioinformatics, by T K Attwood &D J Parry-Smith Addison Wesley

Longman

2. Bioinformatics- A Beginner’s Guide by Jean-Michel Claveriw, CerdricNotredame,

WILEY dreamlech India Pvt. Ltd

REFERENCE BOOK:

1. Introduction to Bioinformatics by M.Lesk OXFORD publishers (Indian Edition).



CLOUD COMPUTING

(ELECTIVE – II)



Course Objectives:

• To understand the emerging area of "cloud computing" and how it relates to the

corporate world .

• To gain competence in cloud services and search engines Specifically

• To understand and be able to cloud environment is collaborating with various

webmail services and databases .

• To understand how virtualization is well-known in cloud computing

• To gain competence in Cloud Security and Open Cloud delivering highly-interactive

Web applications.

Course Outcomes:

1. Articulate the basic concepts, key technologies, strengths,and limitations of cloud

computing and the possible applications for state-of-the-art cloud computing

2. Identify the architecture and infrastructure of cloud computing, including SaaS, PaaS,

IaaS, public cloud, private cloud, hybrid cloud, etc.

3. Identify the Collaborations of Cloud and evaluate webmail services .

4. provide the appropriate cloud computing solutions and recommendations according to

the applications used.

5. Attempt to generate new ideas and innovations based on Virtualization in cloud

computing.

6. Provide Security for cloud applications

UNIT - I

CLOUD INTRODUCTION :Cloud Computing Basics : Cloud Computing definition, Types

of cloud, Cloud services: Benefits and tasks of cloud computing, Evolution of Cloud

Computing, usage scenarios and Applications, Business models around Cloud – Major

Players in Cloud Computing – Trendy in Cloud .

UNIT -II

CLOUD SERVICES AND FILE SYSTEM : Types of Cloud services: Software as a

Service -Platform as a Service – Infrastructure as a Service - Database as a Service -

Monitoring as a Service –Communication as services. Service providers- Google App

Engine, Amazon EC2, Microsoft Azure, Sales force. Introduction to Map Reduce , GFS,

HDFS, Hadoop Framework.

UNIT- III

COLLABORATING WITH CLOUD ENVIRONMENT : Collaborating on Calendars and

its applications, Schedules and Task Management – Collaborating on Event Management,

Contact Management, Project Management – Collaborating on Word Processing ,Databases

– Storing and Sharing Files- Collaborating via Web-Based Communication Tools –

Evaluating Web Mail Services – Collaborating via Social Networks – Collaborating via

Blogs and Wikis. Presenting on the Road Accessing Documents on the Road.



UNIT-IV

VIRTUALIZATION FOR CLOUD : Need for Virtualization – Pros and cons of

Virtualization – Types of Virtualization – System Vm, Process VM, Virtual Machine monitor

– Virtual machine properties - Interpretation and binary translation, HLL VM - Hypervisors –

Xen, KVM , VMWare, Virtual Box, Hyper-V.

FREESTANDING THE CLOUD:

Web mail services Evaluation, Elaborate instant messages, Evaluate web conference tools,

creating groups on social networks, Evaluating online groupware,collaborating via blogs and

wikis.

UNIT – V

SECURITY, STANDARDS, AND APPLICATIONS :

Security in Clouds: Cloud security challenges – Software as a Service Security, Common

Standards: The Open Cloud Consortium – The Distributed management Task Force –

Standards for application Developers – Standards for Messaging – Standards for Security,

End user access to cloud computing, Mobile Internet devices and the cloud.

TEXT BOOKS :

1. Bloor R., Kanfman M., Halper F. Judith Hurwitz “Cloud Computing for Dummies”

(Wiley

India Edition),2010 (Unit 1)

2. John Rittinghouse & James Ransome, “Cloud Computing Implementation

Management and

Strategy”, CRC Press, 2010. (Unit 1,2,3)

3. Antohy T Velte ,Cloud Computing : “A Practical Approach”, McGraw

Hill,2009(Unit -2,3,4)

4. Michael Miller, Cloud Computing: “Web-Based Applications That Change the Way

You Work

and Collaborate Online”, Que Publishing, August 2008.( Unit -3,4,5)

5. http://cloud-standards.org/wiki/index.php?title=Main_Page(Unit - 5)

6. James E Smith, Ravi Nair, “Virtual Machines”, Morgan Kaufmann Publishers, 2006.

REFERENCE BOOKS :

1. Haley Beard, “Cloud Computing Best Practices for Managing and Measuring

Processes for

On-demand Computing”, Applications and Data Centers in the Cloud with SLAs,

Emereo Pty Limited, July 2008

2. webpages.iust.ac.ir/hsalimi/.../89.../Cloud%20Common%20standards.ppt

opennebula.org

3. www.cloudbus.org/cloudsim/ , http://www.eucalyptus.com/

4. hadoop.apache.org

5. http://hadoop.apache.org/docs/stable/hdfs_design.html



IMAGE PROCESSING

(ELECTIVE – II)



Course Objectives:

• Cover the basic theory and algorithms that are widely used in digital image

processing.

• Expose students to current technologies and issues that are specific to image

processing systems.

• Hands-on experience in using computers to process images.

• Formulate solutions to general image processing problems

• Familiar with image manipulations and analysis

Course Outcomes:

1. Explain Basic Concepts in Image Processing and various color models

2. Apply Spatial Domain Techniques for Image Enhancement

3. List the Image Compression Techniques

4. Discuss Various Morphological Algorithms

5. Classify Various Image Segmentation Techniques

UNIT-I

Digital Image Fundamentals : Digital Image Processing - Examples of fields that Use

Image Processing, Fundamental Steps & Components in Digital Image Processing; Image

Sampling and Quantization- Basic Concepts of Digital Images, Spatial and Gray level

Resolution - Zooming and Shrinking; Basic Relationship Between Pixels.

Color Image Processing – Fundamentals, Color Models – RGB, CMYK, HIS, Pseudo

Color.

UNIT-II

Image Enhancement: Basic Gray level Transformations. Histogram processing,

Arithmetic/Logical Operations- Image Subtraction and Image Averaging, Basics of

Spatial Filtering. Smoothening Spatial Filters, Sharpening Spatial Filters.

UNIT-III

Image Compression : Redundancy- Coding, Inter Pixel, Psycho-Visual, Fidelity Criteria;

Image Compression Models-The Source Encoder and Decoder, The Channel Encoder and

Decoder; Error- Free compression-Variable Length Coding, LZW Coding, Bit-Plane

Coding, Image Compression Standard – JPEG

UNIT-IV

Image Morphology : Preliminaries- Basic Concepts from Set Theory, Logical

Operations Involving Binary Images, Dilation and erosion, opening and closing, The Hit

or Miss Transformation, Basic Morphological algorithms-Boundary Extraction, Region

Filling Extraction of Connected Components, Convex Hull, Thinning, Thickening,

Skeletons, Pruning.



UNIT-V

Image Segmentation : Detection of discontinuities-point detection, line detection, edge

detection, edge linking and boundary detection-local processing, global processing via

Graph-Theoretic techniques, Thresholding-Basic Global Thresholding, Basic Adaptive

Thresholding, Optimal Global and Adaptive Thresholding, Region- Based

Segmentation-Basic Formulation, Region growing, Region Splitting and Merging.

TEXT BOOKS :

1. Digital Image Processing – S Jayaraman, S Esakkirajan, T Veerakumar, Tata McGraw

Hill.

2. Digital Image Processing – R.C. Gonzalez & R.E. Woods, Addison Wesley / Pearson

Education, 3rd Edition, 2010.

3. Digital Image Processing and Computer Vision, Sonka, CENGAGE

REFERENCE BOOKS :

1. Digital Image Processing using MATLAB-Rafael C. Gonzalez, Richard E woods and

Steven L. Eddins, Tata McGraw Hill, 2010.

2. Fundamentals of Digital Image Processing-A.K. Jain, PHI.



NEURAL NETWORKS AND SOFT COMPUTING

(ELECTIVE – II)



Course Objectives:

By the end of this course, the student should be able to

• Explain the concepts of neural networks, fuzzy logic, and genetic algorithms.

• Solve problems that are appropriately solved by neural networks, fuzzy logic, and

Genetic algorithms.

Course Outcomes:

1. Explain the learning and adaptation capability of neural and fuzzy systems and

genetic algorithm.

2. Describe the learning and retrieval procedures of various neural networks.

3. Comprehend the fuzzy logic control and adaptive fuzzy logic and to design the fuzzy

control

using genetic algorithm.

UNIT-I

Neuron, Nerve structure and synapse, Artificial Neuron and its model, activation functions,

neural network architecture: single layer and multilayer feed forward networks, recurrent

Networks. Various learning techniques; perception and convergence rule, Auto-associative

and hetro-associative memory.

UNIT-II

Architecture: perceptron model, solution, single layer artificial neural network, multilayer

perception model; back propagation learning methods, effect of learning rule co-efficient;

back Propagation algorithm, factors affecting backpropagation training, applications.

UNIT-III

Basic concepts of fuzzy logic, Fuzzy sets and Crisp sets, Fuzzy set theory and operations,

Properties of fuzzy sets, Fuzzy and Crisp relations, Fuzzy to Crisp conversion.

UNIT-IV

Membership functions, interference in fuzzy logic, fuzzy if-then rules, Fuzzy implications

and Fuzzy algorithms, Fuzzyfications & Defuzzificataions, Fuzzy Controller, Industrial

applications.

UNIT-V

Basic concepts, working principle, procedures of GA, flow chart of GA, Genetic

representations,(Encoding) Initialization and selection, Genetic operators, Mutation,

Generational Cycle, applications.

TEXT BOOKS:

1. S. Rajsekaran & G.A. Vijayalakshmi Pai, “Neural Networks, Fuzzy Logic and Genetic

Algorithm: Synthesis and Applications” Prentice Hall of India.

2. N.P.Padhy,”Artificial Intelligence and Intelligent Systems” Oxford University Press.

REFERENCE BOOKS:

1. Siman Haykin,”Neural Networks” Prentice Hall of India.

2. Timothy J. Ross, “Fuzzy Logic with Engineering Applications” Wiley India.

3. Kumar Satish, “Neural Networks” Tata Mc Graw Hill.



MULTIMEDIA COMPUTING

(ELECTIVE – II)



Course Objectives:

• To introduce the basic concepts and multimedia software tools of multimedia

application development and different types of file formats.

• To discuss types of video signals and to identify the trends and latest development of

the technologies in the area

• To design successful multimedia applications and services with the concept of action

script.

• To judge critical design tradeoffs associated with different multimedia systems ,

architectures, interfaces and business models and how they impact the usability,

security, privacy and commercial viability of multimedia services and applications

Course Outcomes :

0. To identify the multimedia and the different multimedia software tools which are used

in thedevelopmentof multimedia applications?

1. To differentiate the strengths and limitations of the multimedia tools and devices for

multimedia computing.

2. To explore the characteristics of different types of video and audio signals in the

multimedia computing.

3. To analyze and compare the performance of different multimedia data compressions

techniques and algorithms for multimedia real-time applications

4. To develop an attitude to propose solutions with comparisons for problems related to

multimedia computing through investigation

5. To revise the multimedia networks which support quality of service for secure and on

demand data transfer.

UNIT I :

Fundamental concepts in Text and Image:

Multimedia and hypermedia, World Wide Web, overview of multimedia software tools.

Graphics and image data representation graphics/image data types, file formats, Color in

image and video: color science, color models in images, color models in video.

UNIT II:

Fundamental Concepts in Video and Digital Audio: Types of video signals, analog video,

digital video, digitization of sound, MIDI, quantization and transmission of audio.

UNIT III:

Action Script I: Action Script Features, Object-Oriented Action Script, Data types and Type

Checking, Classes, Authoring an Action Script Class.

UNIT IV: Action Script II : Inheritance, Authoring an Action Script 2.0 Subclass,

Interfaces, Packages, Exceptions.

http://jntukme.blogspot.com/2011/06/what-is-multimedia-multimedia-can-have.html

http://jntukme.blogspot.com/2011/06/overview-of-multimedia-software-tools.html

http://jntukme.blogspot.com/2011/06/image-data-types.html



UNIT V:

Multimedia Data Compression: Lossless compression algorithm: Run-Length Coding,

Variable Length Coding, Dictionary Based Coding, Arithmetic Coding, Lossless Image

Compression,

Lossy compression algorithm: Quantization, Transform CodingMultimedia

Networks:Basics of Multimedia Networks, Multimedia Network Communications and

Applications: Quality of Multimedia Data Transmission, Multimedia over IP, Multimedia

over ATM Networks.

TEXT BOOKS:

1. Fundamentals of Multimedia , Ze-Nian Li , Mark S. Drew, PHI/PEA

2. Multimedia Systems, Parag Havaldar, Gerard Medioni, cengage, 2009.

REFERENCE BOOKS:

1. Essentials Action Script 3.0, Colin Moock, SPD O, Reilly,2007.

2. Multimedia Applications, Steinmetz, Nahrstedt, Springer.

3. Digital Multimedia, Nigel Chapman, Jenny Chapman, Wiley-Dreamtech.

4. Multimedia & Communications Technology, Steve Heath, Elsevier .

5. Multimedia Technology & Applications, David Hilman , Galgotia.

6. Multimedia Technologies, Banerji, Mohan Ghosh, MGH.



AIR QUALITY MANAGEMENT

(OPEN ELECTIVE)


Subject Code: 13OE4001 Internal Marks: 30

Course Objectives:

• To identity different pollutants which are causing air pollution.

• To understand the thermodynamics and kinetics of air pollution.

• To apply the professional knowledge of air pollution to design pollution control systems.

• To aim for employment in pollution control organizations.

• To apply the professional, ethics, attitude, team work skills, multi disciplinary approach

to contribute the needs of society in the field of environmental protection.

Course Outcomes:

1. Able to solve air pollution problems of industries.

2. Able to create awareness among the public on the effects of air pollution at local level as

well as global level.

3. Able to manage the ambient air quality by maintaining emission standards.

4. Able to get successful employment in organizations working for the protection of

environmental.

5. Able to design air pollution control equipments for industries and other polluting sources.

UNIT – I

Air Pollution – Definitions, Scope, Significance and Episodes, Air Pollutants – Measurement

of Pollution Classifications – Natural and Artificial –Primary and Secondary, point and Non-

Point, Line and Areal Sources of air pollution- stationary and mobile sources.

UNIT – II

Effects of Air pollutants on man, material and vegetation: Global effects of air pollution –

Green House effect, Heat Islands, Acid Rains, and Ozone Holes-Effects of art treasures.

UNIT-III

Control of particulates – Control at Sources, Process Changes, Equipment modifications,

Design and operation of control. Equipment’s – Settling Chambers, Centrifugal separators,

Reverse Flow Cyclones, Fabric filters – Bag House, Dry and Wet scrubbers, Electrostatic

precipitators.

UNIT – IV

General Methods of Control of NO2 and SO2 emissions – In-plant Control Measures, process

changes, dry and wet methods of removal and recycling.

UNIT – V

Ambient Air Quality Management – Monitoring of SPM, SO; NO and CO Stack Monitoring

for the Flue gases –Micro meterological monitoring Emission Standards.

TEXT BOOKS:

1. Air pollution By M.N.Rao and H.V.N.Rao – Tata Mc.Graw Hill Company.

2. Air pollution and control by KVSG Murali Krishna.

REFERENCES BOOKS:

1. An introduction to Air pollution by R.K. Trivedy and P.K. Goel, B.S. Publications.

2. Air Pollution by Wark and Warner – Harper & Row, New York.



CYBER LAWS

(OPEN ELECTIVE)


Subject Code: 13OE4002 Internal Marks : 30

Course Objectives:

• To identify the emerging Cyber law trends

• To create more awareness about the newly emerging kinds of cybercrimes

• To identify the areas in cyber crimes where Cyber law needs to be further evolved

• To identify the impact of Cyber Law on Real World

• To identify the importance of cyber law and its professionals.

Course Outcomes:

1. Understand about security policies, latest crimes and different offences.

2. Analyze the activities of fraud prevention, monitoring, investigation and report.

3. Differentiate among the models, architectures, challenges and global legal constraints of

secure electronic commerce technologies.

4. Have knowledge of cyber law and ethics

5. Evaluate the interaction and relative impact of human factors, processes and technology in

cyber law infrastructure.

UNIT- I

The IT Act, 2000: A Critique: Crimes in this Millennium, Section 80 of the IT Act, 2000 –

A Weapon or a Farce?, Forgetting the Line between Cognizable and Non- Cognizable

Officers, Arrest for “About to Commit” an Offence Under the IT Act, A Tribute to Darco,

Arrest, But No Punishment.

UNIT- II

Cyber Crime and Criminal Justice: Penalties, Adjudication and Appeals Under the IT

Act, 2000: Concept of Cyber Crime and the IT Act, 2000, Hacking, Teenage Web Vandals,

Cyber fraud and Cyber Cheating, Virus on Internet Deformation, Harassment and E-mail

Abuse

UNIT- III

DE-Commerce Taxation - Real Problems in the Virtual World: A Tug of War on the

Concept of Permanent Establishment, Finding the PE in Cross Border E-Commerce, Source

versus residence and classification between Business Income and Royalty, The impact of the

internet on Customs duties, Taxation policies in India.

UNIT- IV

Digital Signatures, Certifying Authorities and E-Governance: Digital Signatures, Digital

Signature Certificate, Certifying Authorities and Liability in the Event of Digital Signature

compromise, E-Governance in the India. A Warming to Babudom



UNIT-V

Protection of Cyber Consumers in India : Are Cyber Consumers Covered under the

Consumer Protection, Goods and Services, Consumer Complaint, Defect in Goods and

Deficiency in Services, Restrictive and Unfair Trade Practices

TEXT BOOKS:

1. Cyber Law Simplified, Vivek Sood, Tata McGraw-Hill

2. Cyber Law. Texts & Cases, South-Western’s Special Topics Collections

REFERENCE BOOKS:

1. Law Relating to Computers Internet & E-Commerce By Nandan Kamath , 2nd

Edition, Universal Law Publishing Co.Pvt.Ltd.

2. Cyber Law in India by Farooq Ahmad – Pioneer Books.

3. Information Technology Law and Practice by Vakul Sharma – Universal Law

Publishing Co. Pvt. Ltd. The Indian Cyber Law by Suresh T Vishwanathan – Bharat

Law house New Delhi.

4. Hand book of Cyber & E-commerce Laws by P.M. Bakshi & R.K.Suri – Bharat Law

house, New Delhi.

5. Guide to Cyber Laws by Rodney D. Ryder – Wadhwa and Company Nagpur.The

Information Technology Act,2000 – Bare Act – Professional Book Publishers – New

Delhi.



ENTREPRENEURIAL DEVELOPMENT

(OPEN ELECTIVE)



Course Objective:

The objective of this course is to expose the students to the subject of entrepreneurial

development, so as to prepare them to establish a new enterprise and effectively manage the

enterprise.

Course Outcomes:

1. Understand the concept of Entrepreneurship and demonstrate the ability to provide a

self analysis on Entrepreneurship qualities in the context of an Entrepreneurial career.

2. Understanding Entrepreneurship Development programmes in INDIA and contents

for training for Entrepreneurial competencies.

3. Create appropriate Business Model and develop well presented business plan that is

feasible for the student.

4. Understanding how to manage effectively the selected business.

UNIT-I

Entrepreneur and Entrepreneurship :

Meaning of Business and components of Business. Concept of Entrepreneur, characteristics

of an Entrepreneur, distinguish between an Entrepreneur and Manager, functions of an

Entrepreneur, types of Entrepreneurs, Intrapreneur. Concept of Entrepreneurship, women

entrepreneurship and Rural entrepreneurship. Role of Entrepreneurship in Economic

development. Ethics and social responsibility of an entrepreneur. Future of Entrepreneurship

in India.

UNIT-II

Entrepreneurship Development in India :

Nature and development of Entrepreneurship in India - emergence of entrepreneurial class

in India, Environmental factors effecting entrepreneurship, local mobility of Entrepreneurs,

development of women Entrepreneurship, problems and remedies of women

Entrepreneurship. Entrepreneurship Development programme (EDP) - need and objectives of

EDPs , course contents, phases and evaluation of EDPs for existing and new entrepreneurs .

Institutions for EDP - NIESBUD, EDII, NAYE,TCOs, MSMEDI,DICs, commercial Banks,

Universities and Engineering colleges..

UNIT-III

Creating and starting the venture :

Types of start ups. Meaning of a project. Project Identification- Sources of new Ideas,

methods of generating ideas, creative problem solving, opportunity recognition. Project

selection - meaning of project report(business plan), Formulation of a project report, project

appraisal by economic analysis, financial Analysis, market analysis, technical Feasibility,

managerial competence.Project implementation. preparation of sample project report of any

one product and service. Steps to start an MSME



UNIT IV

Government and Institutional support to Entrepreneurs:

MSME Development Act-2006. AP Industrial policy (2015-20), incentives and subsides,

industrial estates, Technology Incubation Centre, Business Incubation Centre, National Skill

Development Corporation, AP Skill Development Corporation. Institutional finance –

sources of long term and short term capital, Venture capital. Role of IDBI, SIDBI, APIIC,

NSIC, APSFC, APITCO, EXIM Bank and commercial Banks.

UNIT V

Managing the venture:

Types of Ownership. Concepts of working capital management, Marketing management,

Human Resource management and TQM. Problems and prospects of MSME in India. Profile

of entrepreneurs.

TEXT BOOKS:

1. H.Nandan: Fundamentals of Entrepreneurship, PHI Learning, New Delhi, 2009

2. S.S.Khanka: Entrepreneurial Development, S.Chand & Company Ltd New Delhi 2009

3. Dr.C.B.Gupta and Dr.S.S.Khanka Entrepreneurship and Small Business Management:

Sultan Chand & Sons:,2010

4. Narayana Reddy: Entrepreneurship, Cengage learning, New Delhi, 2010

5. Rajeev Roy: Entrepreneurship, Oxford university press, New delhi,2010

6. Vasat Desai: The Dynamics of Entrepreneurial Development and Management, Himalaya

Publishing House, 2011.

REFERENCES BOOKS:

1. Robert D Hisrich, Michel P Peters, Dean A Sheperd: Entrepreneurship, Tata Mc Graw

Hill Education Private ltd,2009

2. Hisrich: Entrepreneurship, TMH, New Delhi,2009

3. Prasanna Chandra: Projects,TMH ,New Delhi,2012

4. K Nagarajan: Project Management,New Age International, New Delhi,2010



INDUSTRIAL SAFETY AND ENIVRONMENT

(OPEN ELECTIVE)



Course Objectives:

• To familiarize the student with fundamentals principals of safety management

• To impart knowledge on different type of industrial hazards

• To enable the student to know the various industrial safety acts

• To understand the environmental safety

Course Outcomes:

1. Attain the basic fundamentals safety management

2. Understand the safety various industrial safety acts

3. Acquire basic knowledge of different type of industrial hazards

4. Understand the concepts of environmental safety

UNIT –I

PRINCIPELS OF SAFTY MANAGEMENT

Concepts and techniques, safety audit- introduction, accident investigation and reporting,

safety performance monitoring, safety education and training

UNIT –II

ENVIRONMENTAL SAFETY

Air pollution, water pollution, hazardous waste management, environmental measurement

and control, pollution control in process industries

UNIT-III

Occupational health and industrial hygiene; physical hazards, chemical hazards, biological

and ergonomical hazards, occupational physiology

UNIT –IV

Industrial safety, health and environment acts; factories act– 1948, environment act– 1986,

manufacture, storage and import of hazardous chemical rules 1989

UNIT – V

International acts and standards, other acts and rules (indian boiler act 1923, static and mobile

pressure vessel rules (smpv), motor vehicle rules)

TEXT BOOKS:

1. Krishnan N.V. “Safety Management in Industry” Jaico Publishing House, Bombay,

1997.

2. Rao, CS, “Environmental pollution engineering:, Wiley Eastern Limited, New Delhi,

1992

REFERENCES BOOKS:

1. S.P.Mahajan, “Pollution control in process industries”, Tata McGraw Hill Publishing

Company, New Delhi, 1993.

2. Hand book of “Occupational Safety and Health”, National Safety Council, Chicago,

1982

3. The Factories Act 1948, Madras Book Agency, Chennai, 2000

4. The Environment Act (Protection) 1986, Commercial Law Publishers (India) Pvt.Ltd.

New Delhi.

5. Water (Prevention and control of pollution) act 1974, Commercial Law publishers

(India) Pvt.Ltd. New Delhi.



MICRO ELECTRICAL MECHANICAL SYSTEMS

(OPEN ELECTIVE)



Course Objectives:

• To understand various MEMS fabrications processes including additive, subtractive,

patterning, material modification processes and mechanical steps.

• To understand workings of MEMS mechanical and thermal sensors and actuators

• To understand mechanisms of MEMS magnetic sensors and actuators and Micro-

fluidic devices

• To understand mechanisms of MEMS optical and RF devices.

• To be exposed to MEMS simulation softwares, Multiscale simulations, CNT and

NEMS.

Course Outcomes:

On completion of this course, students should be able

1. To understand various MEMS fabrications processes including additive, subtractive,

patterning, material modification processes and mechanical steps.

2. To understand workings of MEMS mechanical and thermal sensors and actuators

3. To understand mechanisms of MEMS magnetic sensors and actuators and Micro-

fluidic devices

4. To understand mechanisms of MEMS optical and RF devices.

5. To be exposed to MEMS simulation softwares, Multiscale simulations, CNT and

NEMS.

UNIT I

Micro-Machining Processes:

Additive Processes – Spin coating, Evaporation, Sputtering, PVD, CVD, PECVD, Thermal

oxidation

Subtractive Processes – Plasma etching, Reactive ion etching, DRIE etching, Wet chemical

etching

Pattering Processes – Photolithography, X-ray Lithography, LIGA

Material Modification Processes – Ion implantation doping, Diffusion doping, Thermal

annealing

Mechanical Steps – Polishing, Wafer bonding, Wafer dicing, Wire bonding, Chip packaging

UNIT II

Mechanical Sensors and Actuators:

Principles of mechanical sensing and actuation – beam, plate, capacitive, piezo-electric.

Strain measurement, Pressure measurement, Flow measurement, Gyroscopes.

Specialized Actuators – Shear-mode piezo, Gripping piezo, Inchworm technology.

Thermal Sensors and Actuators:

Thermal transduction phenomena - Thermo-electric, Thermo-resistive, Pryo-electric effects.

Micro-machined thermo-couple probe, Peltier effect heat pump.

Thermal flow sensors, Micro-hot plate gas sensors, Thermo-vessels.



Pyro-electricity, Shape memory alloys, Electro-thermal actuator, Thermally activated MEMS

relay, Micro-spring thermal actuator, Data storage cantilever.

UNIT III

Magnetic Sensors and Actuators:

Magnetic properties of materials, Presence and detection of large objects, Magneto-restrictive

sensor, Hall effect sensor, Magneto-diode, Magneto-transistor, MEMS magnetic sensor,

Pressure sensor utilizing MOKE, MagMEMS actuators, Optical switches, Bi-directional

micro-actuator, Feedback circuit integrated magnetic actuator, Large force reluctance

actuator, Magnetic probe based storage device.

Micro-Fluidics

Introduction, Properties of fluids, Micro-fluidic design considerations.

Fluid actuation methods – Di-electro-phoresis, Electro-wetting, Electro-thermal, Thermo-

capillary, Electro-osmosis, Opto-electro-wetting.

Tuning of fiber optic cables using micro-fluidics, Micro-fluidic channel, Dispenser, Needle,

Molecular gate, Micro-pump,

UNIT IV

Optical Sensors and Actuators

Properties of light, Light modulators, Beam splitter, Micro-lens, Micro-mirror, Optical

switch.

Digital Micro Device (DMD) using Digital Light Processing (DLP) technology.

Diffraction grating, Grating light valve, Waveguide and tuning.

RF MEMS

Introduction to RF Communication and RF MEMS, MEMS inductors, Varactors,

Tuner/filter, Resonator, MEMS switches, Phase shifter.

UNIT V

MEMS SIMULATIONS

Atomistic to Continuum theory, Multiscale concept, Multiscale methods.

Softwares - Ansoft Designer, HFSS, DS/MEMS and CA/MEMS, FEMPRO, ANSYS

Multiphysics, SUGAR.

NEMS

Introduction to NEMS, Properties, Applications, fabrication methods, future development.

TEXT BOOKS:

1. MEMS, Nitaigour Premchand Mahalik, Tata McGraw Hill Pub.

REFERENCES BOOKS:

1. Foundations of MEMS, Chang Liu, Pearson Pub.

2. MEMS & Microsystems – Design and Manufacture, Tai-Ran Hsu, McGraw Hill Pub.



OPTIMIZATION TECHNIQUES

(OPEN ELECTIVE)



Course Objectives:

• To be able to formulate linear or nonlinear optimization problems as a solution for

industrial problems.

• To be able to solve various kinds linear and nonlinear, single and multiple variable,

unconstrained and constrained optimization problems using standard optimization

algorithms.

Course Outcomes:

1. Should be able to solve linear multivariable optimization using linear programming

and perform sensitivity analysis.

2. Should be able to solve single-variable, non-linear, unconstrained optimization

problems

3. Should be able to solve geometric programming optimization problems using standard

techniques for each case.

UNIT - I

Introduction to Classical Optimization Techniques:

Single variable optimization with and without constraints, multi – variable optimization

without constraints, multi – variable optimization with constraints – method of Lagrange

multipliers, Kuhn-Tucker conditions

UNIT - II

Linear programming: Two-phase simplex method, Big-M method, duality, interpretation,

Applications.

UNIT - III

Assignment problem: Hungarian’s algorithm, Degeneracy, applications, unbalanced

problems, traveling salesman problem.

UNIT - IV

One dimensional Optimization methods:

Elimination Methods: - Fibonacci, Golden Section.

Interpolation Methods: - Quadratic, Cubic.

Direct Root Methods: - Newton, Quasi-Newton, Secant Methods. Gradient of a function,

steepest descent method.

UNIT - V

GEOMETRIC PROGRAMMING: Polynomials – arithmetic - geometric inequality –

unconstrained G.P- constrained G.P

TEXT BOOKS:

1.Engineering Optimization, Theory and Applications, S.S. Rao, New Age International.

2.Optimization for Engineering Design – Kalyanmoy Deb, PHI Publishers

REFERENCES BOOKS:

1. Optimization Techniques, Theory and Practice, M.C.Joshi, K.M.Moudgalya, Narosa Pub.

2. Engineering Optimization, A Ravindran, K M Ragsdell, G V Reklaitis



RENEWABLE ENERGY

(OPEN ELECTIVE)



Course Objectives :

• To outline the concept regarding the physics of the sun

• To outline the concept regarding the collection of solar energy and storage of solar

energy

• To outline the concept regarding different types of wind mills and different types of

biogas digesters

• To outline the concept regarding geothermal energy conversion

• To outline the concept regarding direct energy conversion..

Course Outcomes:

After completion of this course, the student will able to

1. Define different kinds of solar radiation

2. Utilize different methods of collection of solar energy and storage of solar energy

3. Classify different types of wind mills and biogas digesters

4. Classify different types of geothermal energy sources and utilize different types of

extracting techniques

5. Distinguish different kinds of direct energy conversion techniques.

UNIT – I

PRINCIPLES OF SOLAR RADIATION:

Role and potential of new and renewable source, the solar energy option, Environmental

impact of solar power, physics of the sun, the solar constant, extraterrestrial and terrestrial

solar radiation, solar radiation on titled surface, instruments for measuring solar radiation and

sun shine, solar radiation data.

UNIT-II

SOLAR ENERGY COLLECTION,STORGAE AND APPLICATIONS

Flat plate and concentrating collectors, classification of concentrating collectors, orientation ,

advanced collectors. Different methods, Sensible, latent heat and stratified storage, solar

ponds. Solar Applications- solar heating/cooling technique, solar distillation and drying,

photovoltaic energy conversion.

UNIT-III

WIND AND BIOMASS ENERGY:

Sources and potentials, horizontal and vertical axis windmills, performance characteristics,

Betz criteria. Principles of Bio-Conversion, Anaerobic/aerobic digestion, types of Bio-gas

digesters, gas yield, combustion characteristics of bio-gas, utilization for cooking, I.C.Engine

operation and economic aspects.



UNIT-IV

GEOTHERMAL AND OCEAN ENERGY: Resources, types of wells, methods of

harnessing the energy, potential in India. OTEC, Principles utilization, setting of OTEC

plants, thermodynamic cycles. Tidal and wave energy: Potential and conversion techniques,

mini-hydel power plants, and their economics.

UNIT-V

DIRECT ENERGY CONVERSION:

Need for DEC, Carnot cycle, limitations, principles of DEC. Thermoelectric generators,

seebeck, peltier and joul Thomson effects, MHD generators, principles, hall effect, magnetic

flux, MHD accelerator, MHD Engine, power generation systems, electron gas dynamic

conversion. Fuel cells, principles, faraday’s law’s, selection of fuels and operating

conditions.

TEXT BOOKS:

1. Non-Conventional Energy Sources /G.D. Rai

2. Renewable Energy Technologies /Ramesh & Kumar /Narosa

REFERENCE BOOKS:

1. Renewable energy resources/ Tiwari and Ghosal/ Narosa.

2. Non-Conventional Energy / Ashok V Desai /Wiley Eastern.

3. Non-Conventional Energy Systems / K Mittal /Wheeler

4. Solar Energy /Sukhame



ADVANCED MATERIALS

(OPEN ELECTIVE)



Course Objectives:

• To know different types of composite materials.

• To Learn different manufacturing methods of the composite materials.

• Distinguish between the properties and uses of different reinforcement fibers.

• Explain the principles, types and applications of different functionally graded

materials and shape memory alloys.

• To know about the nano materials and nano technology.

Course Outcomes:


1. Understand the need and explain different types of composite materials.

2. Summarize the various methods for manufacturing of the composite materials.

3. Distinguish between the properties and uses of different reinforcement fibres.

4. Explain the principles, types and applications of different functionally graded

materials and shape memory alloys.

5. Outline the evolution, history, applications and impact of nanotechnology.

UNIT-I

Introduction to Composite Materials and Manufacturing processes: Introduction,

Classification: Polymer Matrix Composites, Metal Matrix Composites, Ceramic Matrix

Composites, Carbon-Carbon Composites, Fiber- Reinforced Composites.

Manufacturing Methods: Autoclave, tape production, moulding methods, filament winding,

manual layup, pultrusion.

UNIT-II

Reinforcements: Fibres- Glass, Silica, Kevlar, carbon, boron, silicon carbide, and born

carbide fibres.

Metal Matrix and Ceramic Matrix Composites: Manufacturing of ceramic matrix & metal

matrix composites and their applications, stress strain relations for MMC and CMC.

UNIT-III

Smart materials

Shape memory alloys, Piezoelectric materials, Electro-rheological fluid, Magneto-

rheological fluid

UNIT-IV

Biomaterials

Property requirement, Concept of biocompatibility, Cell-material interaction and body

response to foreign materials.



UNIT-V

Nano materials & technology

Definition, Types of nanomaterials including carbon nanotubes and nanocomposits, Methods

for creating nano structures, Processes for producing ultrafine powders - physical synthesis

and chemical synthesis, Physical and mechanical properties and their applications

TEXTBOOKS:

1.. Nano material by A.K. Bandyopadyay, New age 'publishers

2. Material science and Technology- Cahan

3. Engineering Mechanics of Composite Materials by Isaac and M Daniel, Oxford University

Press

4. The Science and Engineering of Materials-D. R. Askeland and P. P. Phule - Thomson

Publication

5. Advances in Material Science-R. K. Dogra and A. K. Sharma

6. Engineering Materials and Applications-R. A. Flinn and P. K. Trojan

7. An Introduction to biomaterials.jeffrey O.Hollinger, 2011by CRC press

REFERENCE BOOKS:

l. R. M. Jones, Mechanics of Composite Materials, Me Graw Hill Company, New York,

1975.

2.B. D. Agarwal and L. J. Broutman, Analysis and performance of fibre Composites, Wiley-

Interscience, New York, 1980



TOTAL QUALITY MANAGEMENT

(OPEN ELECTIVE)



Course Objectives:

• To understand the Total Quality Management concept and principles and the various

tools available to achieve Total Quality Management.

• To understand the statistical approach for quality control.

• To create an awareness about the ISO and QS certification process and its need for the

industries.

Course Outcomes:

1. Develop an understanding on quality management philosophies and frameworks.

2. Understand the fundamental principles of total quality management.

3. Choose approximate statistical techniques for improving processes.

4. Develop in-depth knowledge on various tools and techniques of quality management.

5. Know what cultural transformation is necessary for successful implementation of total

quality practices with his/her organization.

UNIT - I: INTRODUCTION

Introduction - Need for quality - Evolution of quality - Definition of quality - Dimensions of

manufacturing and service quality - Basic concepts of TQM - Definition of TQM – TQM

Framework - Contributions of Deming, Juran and Crosby – Barriers to TQM.

UNIT - II: TQM PRINCIPLES

Customer satisfaction - Customer Perception of Quality, Customer Complaints, Service

Quality, Customer Retention, Employee Involvement - Motivation, Empowerment, Teams,

Recognition and Reward, Performance Appraisal, Benefits, Continuous Process Improvement

- Juran Trilogy, PDSA Cycle, 5S, Kaizen, Supplier Partnership - Partnering, sourcing,

Supplier Selection, Supplier Rating, Relationship Development, Performance Measures -

Basic Concepts, Strategy, Performance Measure.

UNIT - III: STATISTICAL PROCESS CONTROL AND PROCESS CAPABILITY

Meaning and significance of statistical process control (SPC) – construction of control

charts for variables and attributes.

Process capability – meaning, significance and measurement – Six sigma concepts of process

capability.

Reliability concepts – definitions, reliability in series and parallel, product life characteristics

curve.Total productive maintenance (TMP)–relevance to TQM, Terotechnology. Business

process re-engineering (BPR) – principles, applications, reengineering process, benefits and

limitations.

UNIT - IV: TOOLS AND TECHNIQUES FOR QUALITY MANAGEMENT

Quality functions deployment (QFD) – Benefits, Voice of customer, information

organization, House of quality (HOQ), building a HOQ, QFD process. Failure mode effect

analysis (FMEA) – requirements of reliability, failure rate, FMEA stages, design, process and

documentation. Seven old (statistical) tools. Seven new management tools. Bench marking

and POKA YOKE.



UNIT - V: QUALITY SYSTEMS

Need for ISO 9000 and Other Quality Systems, ISO 9000:2000 Quality System - Elements,

Implementation of Quality System, Documentation, Quality Auditing, TS 16949, ISO 14000

- Concept, Requirements and Benefits.

TEXT BOOKS:

1. Dale H.Besterfield et al, Total Quality Management, Third edition, Pearson Education

(First Indian Reprints 2004).

2. Shridhara Bhat K, Total Quality Management – Text and Cases, Himalaya Publishing

House,

First Edition 2002.

REFERENCES BOOKS:

1. James R.Evans & William M.Lidsay, The Management and Control of Quality, (5th

Edition), South-Western (Thomson Learning), 2002 (ISBN 0-324-06680-5).

2. Feigenbaum.A.V. "Total Quality Management, McGraw Hill, 1991.

3. Oakland.J.S. "Total Quality Management Butterworth - Hcinemann Ltd., Oxford.

1989.

4. Narayana V. and Sreenivasan, N.S. Quality Management - Concepts and Tasks, New

Age International 1996.

5. Zeiri. "Total Quality Management for Engineers Wood Head Publishers, 1991.



UML & DESIGN PATTERNS LAB



Course Objectives:

This course is designed so as to make the students to:

• Know the practical issues of the different Object oriented analysis and design

concepts.

• Carry out the analysis and design of a system in an object oriented way.

• Create an object-oriented design using design patterns

• Compare design patterns with object-oriented designs

Course Outcomes:

After completion of the course, the students will be able to:

1. Create different UML diagrams for a software system.

2. Analyze and design a software system in an object oriented style using tools like

Rational Rose.

3. Classify and document different design patterns.

4. Apply design patterns to solve design problems.

List of Experiments:

1. 1.To create a UML diagrams of Library Managemernt System.

2. To create a UML diagrams of ATM Application.

3. To create a UML diagrams of Hospital Managemanent System.

4. To create a UML diagrams of Airline Reservation Systems.

5. 5.Using UML design Abstract Factory Design Pattern.

6. .Using UML design Bridge Design Pattern

7. 7.Using UML design Chain of Responsibility

TEXT BOOKS:

1. Meilir Page-Jones: Fundamentals of Object Oriented Design in UML, Pearson

Education.

2. Mark Priestley: Practical Object-Oriented Design with UML,TATAMcGrawHill .

REFERENCE BOOKS:

1. Design Patterns Explained By Alan Shalloway,Pearson Education

2. Head First Design Patterns By Eric Freeman-Oreilly-spd



MOBILE APPLICATION DEVELOPMENT LAB

(Advanced Lab)



Course Objectives :

• Learn the characteristics of mobile applications

• Understand the intricacies of UI required by mobile applications

• Study about the design aspects of mobile application

• Learn development and programming of mobile applications on the Android platform

Course Outcomes :

Upon Completion of the course, the students would be able to:

1. Design and implement the user interfaces of mobile applications

2. Design mobile applications that are aware of the resource constraints of the devices

3. Develop advanced mobile applications that accesses the databases and the web

4. Become experts on Google Android development.

LIST OF EXPEREMENTS :

1) Write a J2ME application that shows how to change font size and color

2)Write a J2ME program which creates following kind of menu

o Cut

o Copy

o Past

o Delete

o Select all

o Unselect all

3)Write J2ME program which creates following kind of menu[Event Handling]

o Cut can be on/off

o Copy can be on/off

o Past can be on/off

o Delete can be on/off

o Select all Put all four Options on

o Unselect all Put all four Options off

4) Create MIDP application which draws a bar graph to the display data values can be given at

int[]array. You can enter four data integers values to the input text field.

5)Write an android application program that accepts input from the user and displays the hello

name to the user in response as output using eclipse

6) Write an android application program that demonstrates different layouts in android.

7)Write an android application program that converts the temperature from Celsius to

Fahrenheit

8)Write an android application that shows how to use intents in mobile application

development

9)Write an Android application program that converts Text to Speech using Eclipse

10) Write an Android application program of notification and alert message.

11)Write an Android application program to display List view.

12)Write an android application program that displays Expanded List view.



TEXT BOOKS:

1. Jochen Schiller, “Mobile Communications”, Pearson Education, Second Edition, 2008

2. Handbook of Wireless Networks and Mobile Computing, Stojmenovic , Cacute,

Wiley, 2002

3. Adhoc Wireless Networks, 2/e, Sivaram murthy, Manoj, Pearson, 200

4. Dr. Sunilkumar, et al “Wireless and Mobile Networks: Concepts and Protocols”,

Wiley India.

5. Raj Kamal, “Mobile Computing”, OXFORD UNIVERSITY PRESS

REFERENCE BOOKS:

1. Asoke K Talukder, et al, “Mobile Computing”, Tata McGraw Hill, 2008.

2. Matthew S.Gast, “802.11 Wireless Networks”, SPD O’REILLY.

3. Ivan Stojmenovic, “Handbook of Wireless Networks and Mobile Computing”, Wiley,

2007.

4. Kumkum Garg, “Mobile Computing”, Pearson

5. Mobile Computing Principles: Designing and Developing Mobile Applications with

UML and XML, Reza



OPEN SOURCE SOFTWARE LAB



Course Objectives:

• To identify the difference between open sources vs free software

• To work in Linux environment.

• To develop websites with the help of open source - PHP

• To identify the importance of MYSQL as a database.

• To learn the scripting technologies like PYTHON.

Course Outcomes:

1. Have enough knowledge about available open sources

2. Able to work in open source environments.

3. Have enough knowledge about each open source technology and its importance.

4. Have knowledge of PHP, MySQL etc,

5. Able to find differences between open sources vs free software vs commercial...


1. Create any php web Application with Login & Registration Modules.

2. Implement PHP - MYSQL database connectivity and link the registration page with

database.

3. Validate the user 's login based on the data stored in the database and redirect the user to

the profile page on validation.(forward to the login page in case of validation failed).

4. Create 2 more web pages (except login, register, profile page ) and display the user's full

name on each of the page by using PHP Sessions.

5. Implement the PHP feedback page that sends the email on submission.

6. Implement any PYTHON program with database connectivity

7. Implement any PERL scripting program using regular expressions

8. Implement any Perl program to send a mail.

TEXT BOOKS:

1. Remy Card, Eric Dumas and Frank Mevel, “The Linux Kernel Book”, WileyPublications,

2003

2. Steve Suchring, “MySQL Bible”, John Wiley, 2002

REFERENCE BOOKS:

1. Rasmus Lerdorf and Levin Tatroe, “Programming PHP”, O’Reilly, 2002

2. Wesley J. Chun, “Core Phython Programming”, Prentice Hall, 2001

3. Martin C. Brown, “Perl: The Complete Reference”, 2nd Edition, Tata McGraw-Hill

Publishing Company Limited, Indian Reprint 2009.

4. Steven Holzner, “PHP: The Complete Reference”, 2nd Edition, Tata McGraw-

Hill Publishing Company Limited, Indian Reprint 2009.

5. Vikram Vaswani, “MYSQL: The Complete Reference”, 2nd Edition, Tata McGraw–

Hill Publishing CompanyLimited, Indian Reprint 2009.

AR - 13 - B.Tech – CSE IV Year II Semester


SOFTWARE TESTING METHODOLOGIES



Course Objectives:

• To discuss the distinctions between testing and defect testing

• To describe the principles of system component testing

• To describe strategies for generating test cases

• To understand the essential characteristics tool used for test automation

Course Outcomes:

1. Classify different types of bugs and able to explain the purpose of testing

2. Identify best approach during testing.

3. Calculate the mean processing time and weight.

4. Identify the states of a product whether good or bad.

5. Design optimal graph with node reduction procedure.

UNIT- I :

Introduction : Purpose of testing, Dichotomies, model for testing, consequences of bugs,

taxonomy ofbugs Flow graphs and Path testing : Basics concepts of path testing, predicates,

path predicates and achievable paths, path sensitizing, path instrumentation, application of

path testing.

UNIT-II :

Transaction Flow Testing : Transaction flows, transaction flow testing techniques. Dataflow

testing:-Basics of dataflow testing, strategies in dataflow testing, application of dataflow

testing.

UNIT-III :

Domain Testing: Domains and paths, Nice & ugly domains, domain testing, domains and

interfaces testing, domain and interface testing, domains and testability. Paths, Path products

and Regular expressions : Path products & path expression, reduction procedure,

applications, regular expressions & flow anomaly detection.

UNIT-IV :

Logic Based Testing : Overview, decision tables, path expressions, kv charts, specifications.

State, State Graphs and Transition testing : State graphs, good & bad state graphs, state

testing, Testability tips.

UNIT-V :

Graph Matrices and Application : Motivational overview, matrix of graph, relations, power

of a matrix, node reduction algorithm, building tools.

Usage of JMeter and Winrunner tools for functional / Regression testing, creation of test

script for unattended testing, synchronization of test case, Rapid testing, Performance testing

of a data base application and HTTP connection for website access.



TEXT BOOKS :

1. Software Testing techniques - Baris Beizer, Dreamtech, second edition.

2. Software Testing Tools – Dr.K.V.K.K.Prasad, Dreamtech.

REFERENCE BOOKS :

1. The craft of software testing - Brian Marick, Pearson Education.

2. Software Testing Techniques – SPD(Oreille)

3. Software Testing in the Real World – Edward Kit, Pearson.

4. Effective methods of Software Testing, Perry, John Wiley.

5. Art of Software Testing – Meyers, John Wiley.



HUMAN COMPUTER INTERACTION

(ELECTIVE – III)



Course Objectives :

• To facilitate communication between students of psychology, design, and computer

science on

user interface development projects.

• To provide the future user interface designer with concepts and strategies for making

design

decisions.

• To expose the future user interface designer to tools, techniques, and ideas for

interface design.

• To introduce the student to the literature of human-computer interaction.

• To stress the importance of good user interface design

Course Outcomes:

After completing this course students must be able to demonstrate the knowledge and ability

to:

1. Explain the human components functions regarding interaction with computer.

2. Describe what interaction design is and how it relates to human computer interaction

and other fields.

3. Explain Computer components functions regarding interaction with human.

4. Demonstrate Understanding of Interaction between the human and computer

components.

5. Describe how technologies can be designed to change people’s attitudes and behavior.

UNIT-I

Introduction:Importance of user Interface – definition, importance of good design. Benefits

of good design. Popularity of Graphics, Characteristics of GUI, Web user – Interface

popularity, characteristics- Principles of user interface.

UNIT-II

Design process:Human interaction with computers, importance of human characteristics in

design, Human interaction speeds. Understanding business functions-business definition and

requirement Analysis, Determining Basic Business functions, Design Standards or Style

Guides.

UNIT-III

Develop System Menus and Navigation schemes: Structure, Function, Content, Formatting

of Menus, Phrasing the Menu, Selecting Menu Choices, Navigating Menus, Kinds of

graphical Menus. Write Clear Text and Messages.

UNIT-IV

Select the Proper Kinds of Windows: Window Characteristics, Components of Windows,

Window Presentation Styles, Types of Windows, Windows Management, Organizing

Window Functions and Operations, Web Systems.Select the Proper Device-Based Controls.



UNIT-V:

Create Meaningful Graphics, Icons and Images:Icons, Multimedia Choose the Proper

Colors: Color-What Is It? Color Uses, Possible Problems with Color, Choosing Colors for

Textual Graphics Screens, Statistical Graphics Screens and Web Pages. Uses of Color to

Avoid.

TEXT BOOKS:

1. The essential guide to user interface design, Wilbert O Galitz, Wiley DreamaTech.

2. Designing the user interface. 3rd Edition Ben Shneidermann , Pearson Education

Asia.

REFERENCE BOOKS:

1. Human – Computer Interaction. ALAN DIX, JANET FINCAY, GRE GORYD,

ABOWD,

2. RUSSELL BEALG, PEARSON.

3. Interaction Design PRECE, ROGERS, SHARPS. Wiley Dreamtech,

4. User Interface Design, Soren Lauesen , Pearson Education.

5. The Essentials of Interaction Design , 3rd edition, Wiley 2007.

http://www.amazon.com/gp/product/0470084111?ie=UTF8&tag=hci01-20&linkCode=as2&camp=1789&creative=9325&creativeASIN=0470084111



E-COMMERCE

(ELECTIVE – III)



Course Objectives:

• To facilitate communication about current business trends and technology related

concepts

• To provide the concepts on Electronic Gateways and expose the future of Payment

Schemes and network access and security.

• To introduce the concepts of Smartcard applications and Email technologies over

Internet

• To gain competence in Customization and Organizational Commerce related to EDI

• To understand the concepts of Digital Library and Marketing over multimedia.

Course Outcomes:

After completing this course students must be able to demonstrate the knowledge and ability

to

1. Illustrate the major categories and trends of e-commerce applications

2. Define Various Electronic Payment types and associated security risks and the ways

to protect against them.

3. Discuss Several Factors and web store requirements and digital based systems needed

to succeed in e-commerce system .

4. Examine the essential process and networking access of an e-commerce system

5. Describe the various marketing strategies for an online Business .

UNIT-I

Electronic Commerce-Frame work, anatomy of E-Commerce applications, E- Commerce

Consumer applications, E-Commerce organization applications. Modes of Electronic

Commerce : Electronic Data Interchange, Migration to Open EDI , Mercantile Process

models.

UNIT-II

Electronic Cash and Electronic Payment Schemes: Intenet Monetary Payment, Electronic

Cash and Electronic Payment Schemes :Security Requirements,Payment and Purchase Order

Process :Online Electronic Cash Internet /Intranet Security Issues and Solutions:Need for

Computer Security ,Security Strategies,Security tools,Enterprise Networking and Access to

the Internet,Security Teams ,Secure Electronic Payment Protocol (SEPP),Master Card/Visa

Secure Electronic Transaction (SET).

UNIT-III

Introduction to Digital Token-Based, Smart Cards, Credit Cards,Risks in Electronic Payment

Systems, Business Requirements,Concepts,Secure Email Technologies for E-Commerce

Introduction to Means of Distribution,A Model for Message Handling,E-mail

working,MIME,Various Categories of Security Methods,MIME and related facilities for EDI

Over the Internet.



UNIT-IV

IntraOrganizational Commerce –Work flow, Automation Customization and Internal

Commerce,Supply Chain Management,Advertising and Marketing-Information Based

Marketing,Advertising on InternetInter Organizational Commerce - EDI, EDI

Implementation, Value added networks.

UNIT-V

Multimedia - key multimedia concepts, Digital Video and electronic Commerce, Desktop

video processings, Desktop video conferencing.

Electronic Commerce Strategies: PayPal, Amazon.com to exploit the value of digital business

Infrastructure, eBay -The Customer Marketplace, Net Flix-Everything is here

TEXT BOOKS:

1. Frontiers of electronic commerce - Kalakata, Whinston, Pearson.

2. E.M.Daniel Minoli,Web Commerce Technology Handbook-Tata Mc.Graw Hill-1999

3. E-Commerce Fundamentals and Applications ,Hendry Chan,Raymond Lee,Tharam

Dillon,John Wiley

4. E-Commerce,S.Jaiswal-Galgotia

5 Web Commerce Technology Hand Book Daniel Minoli

REFERENCES BOOKS:

1. Electronic Commerce - Gary P.Schneider - Thomson.

2. E-Commerce - Business, Technology, Society, Kenneth C.Taudon, Carol Guyerico

Traver.

3. E-Commerce, Efrain Turbon, Jae Lee, David King, H.Michael Chang.

4. A.B.W.Ravi Kalakotar ,Frontiers of Electronic Commerce : Pearson Education -1996

p.schneider, electronic commerce 8 ed.: cengage learning technologies

5. CaseStudies :Online Forums



PARALLEL COMPUTING AND ALGORITHMS

(ELECTIVE – III)



Course Objectives:

• To learn parallel and distributed algorithms development techniques for shared

memory and message passing models.

• To study the main classes of parallel algorithms.

• To study the complexity and correctness models for parallel algorithms

Course Outcomes:

Upon successful completion of the course students should be able to

1. Identify the need of Parallel Computing Algorithms.

2. Analyze the performance of the parallel algorithms.

3. Practice Vector matrix –Multiplications.

UNIT-I

Sequential model, need of alternative model, parallel computational models such as PRAM,

LMCC, Hypercube, Cube Connected Cycle, Butterfly, Perfect Shuffle Computers, Tree

model, Pyramid model, Fully Connected model, PRAM-CREW, EREW models, simulation

of one model from another one.

UNIT-II

Performance Measures of Parallel Algorithms, speed-up and efficiency of PA, Cost

optimality, Example to illustrate Cost-optimal algorithms- such as summation, Min/Max on

various models.

UNIT-III

Parallel Sorting Networks, Parallel Merging Algorithms on CREW/EREW/MCC/, Parallel

Sorting Networks on CREW/EREW/MCC/, linear array

UNIT-IV

Parallel Searching Algorithm, Kth element, Kth element in X+Y on PRAM, Parallel Matrix

Transportation and Multiplication Algorithm on PRAM, MCC, Vector-Matrix Multiplication,

Solution of Linear Equation, Root finding.

UNIT-V

Graph Algorithms - Connected Graphs, search and traversal, Combinatorial Algorithms-

Permutation, Combinations, Derangements.

TEXTBOOKS:

1. M.J. Quinn, “Designing Efficient Algorithms for Parallel Computer” by Mc Graw

Hill.

2. Algorithms, K.A.Berman and J.L.Paul, Cengage Learning.

REFERENCE BOOKS:

1. Distributed Algorithms, N.A.Lynch, Morgan Kaufmann Publishers, Elsevier.

2. Parallel Algorithms, Henri Casanova, A.Legrand, Y.Robert, Chapman &Hall/CRC,

Taylor and Francis Group.

3. Handbook of Parallel Computing, S.Rajasekaran, John Reif, Chapman &

Hall/CRC,Taylor and Francis Group.



EMBEDDED &REAL TIME SYSTEMS

(ELECTIVE – III)



Course Objectives:


• To introduce the basic concepts of Embedded Systems and the various techniques

used for Embedded Systems with real time examples.

• Technology capabilities and limitations of the hardware, software components

• Methods to evaluate design tradeoffs between different technology choices.

• concepts and theory for real-time systems

• programming, operating systems, and middleware for embedded systems, and

concepts, technologies, and protocols for embedded and real-time systems.

Course Outcomes:


1. To discuss the basics of embedded systems and the interface issues related to it.

2. To learn the different techniques on embedded systems.

3. To discuss the real time models, languages and operating systems.

4. To analyze real time examples.

Unit I

Introduction to Embedded systems:What is an embedded system Vs. General computing

system, history, classification, major application areas, purpose of embedded systems. Core

of embedded system, memory, sensors and actuators, communication interface, embedded

firmware, other system components, PCB and passive components.

UNIT II

8-Bit Microcontrollers Architecture:Characteristics, quality attributes, application specific,

domain specific, embedded systems. Factors to be considered in selecting a controller, 8051

architecture,memory organization, registers, oscillator unit, ports, source current, sinking

current, design examples.

Interrupt, timers and serial ports of 8051, 8051 interrupts, interfacing ADC 0801, Timers,

serial port, Reset circuit, power saving modes.

UNIT III

Programming the 8051Micro controller:Addressing modes, Instruction set, sata transfer

instructions, Arithmetic Instructions, Logical Instructions, Arithmetic Instructions, logical

instructions, Boolean, Program control transfer instructions.

UNIT IV

RTOS and Scheduling :Operating basics, types, RTOS, tasks, process and threads,

multiprocessing and multitasking, types of multitasking, non preemptive, preemptive

scheduling.Task communication of RTOSShared memory, pipes, memory mapped objects,

message passing, message queue, mailbox, signaling, RPC and sockets,

task communication/synchronization issues, racing, deadlock, live lock, the dining

philosopher’s problem.



UNIT V

The producer-consumer problem, Reader writers problem, Priority Inversion, Priority ceiling,

Task Synchronization techniques, busy waiting, sleep and wakery, semaphore, mutex, critical

section objects, events, device, device drivers, how to clause an RTOS, Integration and

testing of embedded hardware and fire ware.

TEXT BOOKS:

1. Introduction to Embedded Systems, Shibu K V, TMH,2009.

2. The 8051 Microcontroller and Embedded Systems, Mazidi, Mazidi, Pearson.

REFERENCE BOOKS :

1. Embedded Systems, Rajkamal, TMH,2009.

2. Embedded Software Primer, David Simon, Pearson.



MACHINE LEARNING

(ELECTIVE – III)



Course Objective:

• The objective of this course is to give students basic knowledge about the key

algorithms and theory that form the foundation of machine learning.

• Identify and apply the appropriate Machine learning technique to classification,

Pattern Recognition, and Optimization and Decision problems.

Course Outcomes:

Student will be able to

1. Identify the applications of Machine learning and able to state the developing of

Learning System.

2. Classify Decision Tree Learning Algorithms for learning of appropriate problems.

3. Use Learning Algorithms to classify text by applying various Classification

Algorithms.

4. Formulate Computational Learning Theory for Finite and Infinite hypothesis spaces.

5. Generate Rule Sets and setup First Order Rules.

UNIT-I

Introduction: Definition of learning systems, Goals and applications of machine learning.

Aspects of developing a learning system: training data, concept representation, function

approximation.

Inductive Classification: The concept learning task, Concept learning as search through a

hypothesis space, General-to-specific ordering of hypotheses, Finding maximally specific

hypotheses, Version spaces and the candidate elimination algorithm, learning conjunctive

concepts, the importance of inductive bias.

UNIT-II

Decision Tree Learning: Decision Tree Representation, Appropriate problems for decision

tree learning, The basic decision tree learning algorithm, Hypothesis space search in decision

tree learning, Inductive bias in decision tree learning, issues in decision tree learning.

UNIT-III

Bayesian Learning: Bayes Theorem and concept learning, Maximum likelihood and least

squared error hypothesis, Maximum likelihood hypothesis for predicting probabilities, Bayes

optimal classifier, Naive Bayes classifier, An example to classify text, Bayesian belief

networks.

UNIT-IV

Computational Learning Theory: Probability learning an approximately correct hypothesis,

Sample complexity for finite hypothesis spaces, Sample complexity for infinite hypothesis

spaces.

Instance-Based Learning: Constructing explicit generalizations versus comparing to past

specific examples, K-Nearest-neighbor algorithm, Case-based learning.



UNIT-V

Rule Learning: Propositional and First-OrderRulesSequential Covering Algorithms,

Learning Rule Sets: Learning First Order Rules, Learning Sets of First Order Rules: FOIL,

Learning Recursive Rules, Inverse Resolution.

TEXTBOOKS:

1. Machine Learning, Tom M.Mitchell, MGH

2. Machine Learning: A Guide to Current Research (The Springer International Series in

Engineering and Computer Science) Paperback – October 14, 2011

REFERENCE BOOKS:

1. Introduction to machine Learning, 2nd ed, Ethem Alpaydin, PHI

2. Baldi, P. and Brunak, S. (2002). Bioinformatics: A Machine Learning Approach.

Cambridge, MA: MIT Press.

3. Kearns, M. and Vazirani, U. (1994). Computational Learning Theory. Cambridge,

MA: MIT Press.



SOCIAL NETWORKS AND THE SEMANTIC WEB

(ELECTIVE – IV)



Course Objectives:

The student should be made to

• To understand semantic web.

• To understand the role of ontology and inference engines in semantic web.

• To be able to build semantic web applications with social network features.

• Will be able to differentiate semantic web from other.

• Will be able to use ontology and inference engines in semantic web development.

• Understand human behaviour in social web and related communities, Learn

visualization of social networks.

• To learn Social Network Analysis and semantic web.

Course Outcomes:

Upon completion of the course, the student should be able to:

1. Develop semantic web related applications

2. Understand semantic web basics, architecture and technologies.

3. Represent knowledge using ontology.

4. Predict human behaviour in social web and related communities.

5. Visualize social networks.

6. Able to discover the capabilities and limitations of semantic web technology for social

networks

UNIT-I

INTRODUCTION : Introduction to Semantic Web: Limitations of current Web –

Development of Semantic Web-Emergence of the Social Web – Social Network analysis:

Development of Social Network Analysis – Key concepts and measures in network analysis –

Electronic sources for network analysis: Electronic discussion networks, Blogs and online

communities – Web-based networks – Applications of Social Network Analysis.

UNIT-II

MODELLING,AGGREGATING AND KNOWLEDGE REPRESENTATION :

Ontology and their role in the Semantic Web: Ontology-based knowledge Representation –

Ontology languages for the Semantic Web: Resource Description Framework – Web

Ontology Language – Modelling and aggregating social network data: State-of-the-art in

network data representation – Ontological representation of social individuals -Ontological

representation of social relationships – Aggregating and reasoning with social network data –

Advanced representations.

UNIT-III

EXTRACTION AND MINING COMMUNITIES IN WEB SOCIAL NETWORKS:

Extracting evolution of Web Community from a Series of Web Archive – Detecting

communities in social networks – Definition of community – Evaluating communities –

Methods for community detection and mining – Applications of community mining

algorithms – Tools for detecting communities social network infrastructures and communities



– Decentralized online social networks – Multi- Relational characterization of dynamic social

network communities.

UNIT-IV

PREDICTING HUMAN BEHAVIOUR AND PRIVACY ISSUES:Understanding and

predicting human behaviour for social communities – User data management – Inference and

Distribution – Enabling new human experiences – Reality mining – Context – Awareness –

Privacy in online social networks – Trust in online environment – Trust models based on

subjective logic – Trust network analysis – Trust transitivity analysis – Combining trust and

reputation – Trust derivation based on trust comparisons – Attack spectrum and

countermeasures.

UNIT- V

VISUALIZATION AND APPLICATIONS OF SOCIAL NETWORKS:Graph theory –

Centrality – Clustering – Node-Edge Diagrams – Matrix representation – Visualizing online

social networks, Visualizing social networks with matrix-based representations – Matrix and

Node-Link Diagrams – Hybrid representations – Applications – Cover networks –

Community welfare – Collaboration networks – Co-Citation networks.

TEXT BOOKS:

1. Peter Mika, “Social Networks and the Semantic Web”, First Edition, Springer 2007.

2. Borko Furht, “Handbook of Social Network Technologies and Applications”, 1 st

Edition, Springer, 2010

REFERENCE BOOKS:

1. Liyang Yu, “A Developer's Guide to the Semantic Web”, Springer, First Edition,

2011.

2. John Hebeler, Matthew Fisher, Ryan Blace and Andrew Perez-Lopez, “Semantic Web

Programming”,Wiley, First Edition, 2009.

3. Guandong Xu ,Yanchun Zhang and Lin Li, “Web Mining and Social Networking –

Techniques and applications”, First Edition Springer, 2011.

4. Dion Goh and Schubert Foo, “Social information Retrieval Systems: Emerging

Technologies and Applications for Searching the Web Effectively”, IGI Global

Snippet, 2008. 3. Max Chevalier, Christine Julien and Chantal Soulé-Dupuy,

“Collaborative and Social Information Retrieval and Access: Techniques for

Improved user Modelling”, IGI Global Snippet, 2009.

5. John G. Breslin, Alexander Passant and Stefan Decker, “The Social Semantic Web”,

Springer, 2009



ADVANCED OPERATING SYSTEMS

(ELECTIVE – IV)



Course Objectives :

• To gain knowledge on Distributed operating system concepts that includes

architecture,

Mutual exclusion algorithms, Deadlock detection algorithms and agreement protocols

• To gain insight on to the distributed resource management components viz. the

algorithms for implementation of distributed shared memory, recovery and commit

protocols

• To know the components and management aspects of Real time, Mobile operating

Systems

Course Outcomes :

Upon Completion of the course, the students should be able to:

1. Discuss the various synchronization, scheduling and memory management issues

2. Demonstrate the Mutual exclusion, Deadlock detection and agreement protocols of

distributed operating system

3. Discuss the various resource management techniques for distributed systems

4. Identify the different features of real time and mobile operating systems

5. Install and use available open source kernel

6. Modify existing open source kernels in terms of functionality or features used

UNIT I:

DISTRIBUTED OPERATING SYSTEMS

Issues in Distributed Operating System – Architecture – Communication Primitives –

Lamport’s Logical clocks – Causal Ordering of Messages – Distributed Mutual Exclusion

Algorithms – Centralized and Distributed Deadlock Detection Algorithms – Agreement

Protocols.

UNIT II:

DISTRIBUTED RESOURCE MANAGEMENT

Distributed File Systems – Design Issues - Distributed Shared Memory – Algorithms for

Implementing Distributed Shared memory–Issues in Load Distributing – Scheduling

Algorithms – Synchronous and Asynchronous Check Pointing and Recovery – Fault

Tolerance – Two-Phase Commit Protocol – Nonblocking Commit Protocol – Security and

Protection.

UNIT III:

REAL TIME AND MOBILE OPERATING SYSTEMS

Basic Model of Real Time Systems - Characteristics- Applications of Real Time Systems –

Real Time Task Scheduling - Handling Resource Sharing - Mobile Operating Systems –

Micro Kernel Design - Client Server Resource Access – Processes and Threads - Memory

Management – File system.



UNIT IV:

CASE STUDIES

Linux System: Design Principles - Kernel Modules - Process Management Scheduling –

Memory Management - Input-Output Management - File System - Interprocess

Communication. iOS and Android: Architecture and SDK Framework - Media Layer -

Services Layer - Core OS Layer – File System

UNIT V:

CASE STUDIE AMOEBA

Introduction to AMOEBA - Objects and capabilities in AMOEBA - Process Management in

AMOEBA - Memory Management in AMOEBA - Communication in AMOEBA - The

AMOEBA servers

TEXT BOOKS :

1. Mukesh Singhal and Niranjan G. Shivaratri, “Advanced Concepts in Operating

Systems – Distributed, Database, and Multiprocessor Operating Systems”, Tata

McGraw-Hill, 2001.

2. Abraham Silberschatz; Peter Baer Galvin; Greg Gagne, “Operating System

Concepts”, Seventh Edition, John Wiley & Sons, 2004.

3. Andrew S. Tanenbaum ; “Distributed Operating systems”,Pearson Education

India,1995.

REFERENCE BOOKS:

1. Daniel P Bovet and Marco Cesati, “Understanding the Linux kernel”, 3rd edition,

O’Reilly, 2005.

2. Rajib Mall, “Real-Time Systems: Theory and Practice”, Pearson Education India,

2006.

3. Neil Smyth, “iPhone iOS 4 Development Essentials – Xcode”, Fourth Edition,

Payload media,2011.

https://www.google.co.in/search?tbo=p&tbm=bks&q=inauthor:



SIMULATION AND MODELING

(ELECTIVE – IV)



Course Objectives

• Educate students with fundamental knowledge of continuous and discrete system

models

• Gain some fundamental knowledge about system simulation techniques

• Gain idea about continuous system simulation and different models of continuous

system simulation

• Gain knowledge probability theory and probability functions.

• Acquire knowledge queuing theory with solutions

• gain knowledge on discrete system simulation and different models of discrete

system simulation

• Familiarize with discrete system programming tasks.

• Acquire knowledge about simulation programming techniques.

• Explain some elementary features of SIMSCRIPT and GPSS algorithms.

Course Outcomes:

This course will assist students in their career preparation as computer simulation and

modeling designer or managers. Upon successful completion of this course, students should

be able to:

1. Demonstrate continuous and discrete system models and describe system simulation

techniques.

2. Describe the steps involved in continuous system simulation, list and describe the

continuous system simulation models.

3. Analyze and critique stochastic variables and probability functions.

4. Articulate queuing disciplines with mathematical solutions.

5. Outline and recommend methods for discrete system simulation and assess problems

and propose solutions to discrete system simulation

6. Assess problems and propose solutions to SIMSCRIPT and GPSS algorithms.

Unit-I

Introduction to Modeling and Simulation

Nature of Simulation: Systems, Models and Simulation, Continuous and Discrete Systems,

system modeling, concept of simulation, Components of a simulation study, Principles used

in modeling, Static and Dynamic physical models, Static and Dynamic Mathematical models

Introduction to Static and Dynamic System simulation, Advantages, Disadvantages and

pitfalls of Simulation.

Unit-II

System Simulation and Continuous System Simulation

Types of System Simulation, Monte Carlo Method, Comparison of analytical and Simulation

methods, Numerical Computation techniques for Continuous and Discrete Models,

Distributed LagModels, Cobweb Model.Continuous System models, Analog and Hybrid

computers, Digital-Analog Simulators, Continuous system simulation languages, Hybrid

simulation, Real Time simulations.



Unit –III

System Dynamics & Probability concepts in Simulation

Exponential growth and decay models, logistic curves, Generalization of growth models,

System dynamics diagrams, Multi segment models, Representation of Time Delays.

Discrete and Continuous probability functions, Continuous Uniformly Distributed Random

Numbers, Generation of a Random numbers, Generating Discrete distributions, Non-Uniform

Continuously Distributed Random Numbers, Rejection Method.

Unit-IV

Simulation of Queuing Systems and Discrete System Simulation

Poisson arrival patterns, Exponential distribution, Service times, Normal Distribution

Queuing

Disciplines, Simulation of single and two server queue. Application of queuing theory in

computer system.

Discrete Events, Generation of arrival patterns, Simulation programming tasks, Gathering

statistics, Measuring occupancy and Utilization, Recording Distributions and Transit times.

Unit-V

Introduction to Simulation languages and Analysis of Simulation output

GPSS: Action times, Succession of events, Choice of paths, Conditional transfers, program

control statements.

SIMSCRIPT: Organization of SIMSCRIPT Program, Names & Labels, SIMSCRIPT

statements.

Estimation methods, Replication of Runs, Batch Means, Regenerative techniques, Time

Series Analysis, Spectral Analysis and Autoregressive Processes.

TEXT BOOKS :

1. Gorden G., System simulation, Prentice Hall.

2. Seila, Simulation Modeling, Cengage Learning

REFERENCE BOOKS:

1. Law. Simulation Modeling And Analysis, McGraw Hill.

2. Deo, System Simulation with Digital Computer, PHI.

3. Harrington, Simulation Modeling methods, McGraw Hill.

4. Severance, " System Modeling & Simulation, Willey Pub.



COMPUTER FORENSICS

(ELECTIVE – IV)



Course Objective:

• Explain about the computer forensics along with the responsibilities and liabilities of

a computer forensic investigator.

• Create a method for gathering, assessing and applying new and existing legislation

and industry trends specific to the practice of computer forensics.

• Demonstrate basic skills with software’s for recovering digital evidence from

computer storage devices.

• Can recover data that has been purposely hidden or deleted from a file system.

• Discuss about the role of email in investigation and data acquisition Procedure for

Cell Phones and Mobile Devices

Course Outcomes:

Upon successful completion of this course you should be able to:

1. Explain about computer forensics, procedure and approaches for carrying

investigations.

2. Demonstrate the different ways of data acquisition and storing the evidences.

3. Illustrate different software tools for validating and testing the evidences.

4. Recover data that has been purposely hidden or deleted from a file system

5. Discuss about the role of email in investigation and data acquisition Procedure for

Cell Phones and Mobile Devices

UNIT-I

Computer Forensics and Investigations: Understanding Computer Forensics, Preparing for

Computer Investigations, Taking a Systematic Approach, Procedure for Corporate High-Tech

Investigations, Understanding Data Recovery Workstations and Software.

UNIT-II

Data Acquisition: Understanding Storage Formats for Digital Evidence, Determining the

Best Acquisition Method, Contingency Planning for Image Acquisitions, Using Acquisition

Tools, Validating Data Acquisition, Performing RAID Data Acquisition, Using Remote

Network Acquisition Tools, Using Other Forensics Acquisition Tools

Processing Crime and Incident Scenes: Identifying Digital Evidence, Collecting the

Evidence in Private-Sector Incident Scenes, Processing law Enforcement Crime Scenes,

Preparing for a Search, Securing a Computer Incident or Crime Scene, Sizing Digital

evidence at the Scene, Storing Digital evidence, obtaining a Digital Hash.

UNIT- III

Current Computer Forensics Tools: Evaluating Computer Forensics Tool Needs,

Computer Forensics Software Tools, Computer Forensics Hardware Tools, Validating and

Testing Forensics Software.



Computer Forensics Analysis and Validation: Determining What Data to Collect and

Analyze, Validating Forensic Data, Addressing Data-Hiding Techniques, Performing Remote

Acquisitio

UNIT-IV

Recovering Graphics and Network Forensics: Recognizing a Graphics File, Understanding

Data Compression, Locating and Recovering Graphics Files, Understanding Copyright Issues

with Graphics, Network Forensic, Developing Standard Procedure for Network Forensics,

Using Network Tools, Examining Hiney Project

UNIT-V

E-mail Investigations Cell Phone and Mobile Device Forensics: Exploring the Role of E-

mail in Investigations, Exploring the Role of Client and Server in E-mail, Investigating E-

mail Crimes and Violations, Understanding E-mail Servers, Using Specialized E-mail

Forensics Tools, Understanding Mobile Device Forensics, Understanding Acquisition

Procedure for Cell Phones and Mobile Devices

TEXT BOOK:

1. Nelson, Phillips Enfinger, Steuart, “Computer Forensics and Investigations, Cengage

Learning.



MOBILE ADHOC AND SENSOR NETWORKS

(ELECTIVE – IV)



Course Objectives:

• Make observation of mobile ad hoc networks, design and implementation issues, and

available solutions.

• Discusses on routing mechanisms and the three classes of approaches.

• Discusses on clustering mechanisms and the different schemes that have been

• employed, e.g., hierarchical, flat, and leaderless.

• Prescribe the different ad hoc security issues.

• Make observation of sensor networks and their characteristics. This includes design

• of MAC layer protocols, understanding of power management, query processing, and

sensor databases.

• develop experience in designing and implementing sensor network

• functionality using network simulation tools.

• Prescribe of the different ad hoc security issues.

Course Outcomes:

1. Describe the principles of mobile ad hoc networks (MANETs) and what distinguishes

them from infrastructure-based networks.

2. Distinguish how routing protocols function and their implications on data

transmission delay and bandwidth consumption in ad hoc network.

3. Compute the different clustering algorithms and their usefulness for network

management and routing.

4. Operate the different ad hoc network security issues.

5. Describe the principles and characteristics of wireless sensor networks (WSNs).

6. Distinguish the sensor networks and their characteristics.

7. Compute how to simulate a mobile ad hoc and sensor network using ns-2 to develop

real-life applications.

UNIT-I

Cellular and Ad Hoc Wireless Networks, Characteristics of MANETs, Applications of

MANETs, Issues and challenges of MANETs.

Routing in MANTs: Classification of routing protocols, topology based versus position

based approaches, topology based routing protocols: position based routing other routing

protocols.

UNIT II

Data Transmission in MANETs: The Broadcast Storm, Multicasting, GEO casting, TCP

over Ad Hoc Networks – TCP Protocol overview, TCP and MANETs, Solutions for TCP

over Ad Hoc

UNIT III

Security in MANETs: Security in Ad Hoc Wireless Networks: Key management, Secure

Routing, Cooperations in MANETs, Intrusion Detection System.

Basics of Wireless sensors and Applications: The Mica Mote, Sensing and Communication

range, Design Issues, Energy consumption, Clustering of Sensors, Applications



UNIT IV

Data Retrieval in sensor Networks: Classification of WSNs, MAC Layer, Routing Layer,

High-Level Application Layer Support, Adapting to the Inherent Dynamic Nature of WSNs.

Sensor network Platforms and Tools: Sensor Node Hardware, Sensor Network

Programming Challenges, Node Level Software Platforms, Node Level Simulators.

UNIT V

Security in WSNs: Security in Wireless Sensor Networks, Key Management in Wireless

Sensor Networks, Secure Data Aggregation in Wireless Sensor Networks, Introduction to

Vehicular Ad Hoc Networks, Introduction to Wireless Mesh Networks.

TEXT BOOKS:

1. Ad Hoc and Sensor Networks: Theory and Applications, Carlos dc Morais Cordeiro

and Dharma Prakash Agrawal, World Scientific Publications / Cambridge University

Press, 2006.

2. Wireless Sensor networks: An information Processing Approach, Feng Zhao,

Leonidas Guibas, Elsevier Science Import Morgan Kauffman Publishers, 2005.

REFERENCE BOOKS:

1. Ad Hoc Wireless Networks: Architectures and Protocols, C.Siva Ram Murthy and

B.S.Manoj, Pearson Education, 2004.

2. Guide to Wireless Ad Hoc Networks, Sudip Misra, Isaac Woungang, and Subhas

Chandra Misra, Springer International Edition, 2011.

3. Guide to Wireless Sensor Networks, Sudip Misra, Isaac Woungang and Subhas

Chandra Misra, Springer International Edition, 2012.

4. Wireless Mesh Networking, Thomas Krag and Sebastin Buettrich, O’Reilly

Publishers, 2007.