R13it PDF
R13it PDF
R13it PDF
DETAILED SYLLABUS
Information Technology
An Autonomous Institute
Approved by AICTE & Affiliated to JNTUH
Accredited by NBA and NAAC with ‘A’ Grade
2
1.1 .1 Seats in each programme in the Institution are classified into Category A and
Category B as per the G.Os.
a) Category – A Seats
These seats will be filled through counseling as per the rank at the Common
Entrance Test (EAMCET) conducted by the State Government and as per
other admission criteria laid down in the G.Os.
1.1.2 Category - B Seats
These seats will be filled by the institute as per the G.Os Issued by State
Government from time to time.
1.1.3 Category: Lateral Entry
The candidate shall be admitted into the Third Semester, (2nd year, Ist
Semester) based on the rank secured by the candidate at Engineering
Common Entrance Test (ECET (FDH)) by the Convener, ECET.
2. Distribution and Weightage of Marks
i. The performance of a student in each Semester shall be evaluated subject –
wise with a maximum of 100 marks for theory and 100 marks for
practical subjects. In addition, an Industry oriented mini-project, Seminar,
Comprehensive viva-voce, and Project Work shall be evaluated for 100, 100,
100 and 200 marks respectively.
ii. For theory subjects the distribution shall be 30 marks for Mid Semester
Evaluation and 70 marks for the End Semester Examination.
For theory subjects, two mid examinations will be conducted in each
Semester as per the academic calendar. Each mid examination is evaluated
for 25 marks.
For the Mid-Examination the Distribution of Marks (25 Marks) as follows
Part-A: - 4 Marks (4X1 Marks) Compulsory
6 Marks (3X2 Marks) Compulsory
Part-B:- 15 Marks (3X5 Marks) 3 out of 4 Questions
Assignment Test/Assignment: - Two assignments are to be given to
students covering the syllabus of First Mid and Second Mid Examinations
respectively and are evaluated for 5 marks each.
The first assignment shall be submitted after first mid examinations and
second Assignment should be submitted after second mid examination.
At the end of the Semester, Internal Marks (Maximum 30) for the respective
subject is assigned as follows:
(a) 25 marks: 80% from the best performed mid examination and 20% from
the other mid examination.
(b) 5 marks: Average of the two assignments/assignment tests
3
iii. For practical subjects there shall be a continuous evaluation during the
Semester for 30 marks and 70 marks for end examination. Out of the 30
marks, day-to-day work in the laboratory shall be evaluated for 10
marks, and 10 marks for practical examination and 10 marks for laboratory
record.
NOTE: A. Student who is absent for any assignment/Mid-term examination for
any reason what so ever shall be deemed to have secured ‘zero’ marks
in the test/examination and no makeup test/examination shall be
conducted.
B. If any student absent for mid exam due to Medical/Acute illness
same may be reported in advance to Head of the Department in writing
with a request to reconduct the mid-term examination. The committee
consisting of HOD/Dean-Academics/Dean-Examinations will take the
final decision on the conduct of mid-term examination.
iv For the subjects having design and / or drawing, (such as Engineering
Graphics, Engineering Drawing, Machine Drawing, Production Drawing
Practice, and Estimation etc.,) the distribution shall be 30 marks for internal
evaluation (15 marks for day-to-day work and 15 marks for Mid
examination (the average of the two examinations will be taken into account)
and 70 marks for end semester examination.
V There shall be an industry-oriented mini-Project, in collaboration with an
industry of their specialization, to be taken up during the summer vacation
after III year II Semester examination. The industry oriented mini project
shall be evaluated during the IV year I Semester. The industry oriented
mini project shall be submitted in report form and should be presented before
a committee, which shall be evaluated for 100 marks. The committee
consists of Head of the Department, the supervisor of mini project and a
senior faculty member of the department. There shall be no mid-term
assessment for industry oriented mini project. However, attending the
shadow engineering program is a pre – requisite for evaluating industry
– oriented mini project. Students should submit a report on learning
outcomes of the shadow engineering and Engineer in Mirror. Every student
should attend shadow engineering and Engineer in Mirror programme in an
industry for not more than a week days during second year and third year
respectively.
vi. There shall be a Seminar presentation in IV year II Semester. For the
Seminar, the student shall collect the information on a specialized topic other
than the project topic and prepare a technical report, showing his
understanding of the topic, and submit to the department, which shall be
4
evaluated by a Departmental committee consisting of the Head of the
department, Seminar supervisor and a senior faculty member. The seminar
will be evaluated for 100 marks based on the report and presentation
made.
vii. There shall be a Comprehensive Viva-Voce in IV year II Semester. The
Comprehensive Viva-Voce will be conducted by a Committee consisting of
the Head of the Department and three Senior Faculty members of the
Department after submitting M.T.P record in complete. The
Comprehensive Viva-Voce is aimed to assess the student’s understanding in
various subjects studied during the B.Tech course of study. The
Comprehensive Viva-Voce is evaluated for 100 marks by the Committee.
There will be no Midterm assessment for the Comprehensive viva-voce.
viii. The Project work shall be started by the student in the beginning of the IV
year I Semester. Out of a total of 200 marks for the project work, 60 marks
shall be for Midterm Evaluation and 140 marks for the Semester end
Examination. The viva-voce shall be conducted by a committee comprising
of an external examiner, Head of the Department and the project supervisor
and one senior faculty. The evaluation of project work shall be conducted at
the end of the IV year II Semester. The Midterm Evaluation shall be on
the basis of three Seminars conducted during the IV year II Semester for
30 marks by the committee consisting of Head of the Department,
project supervisor and senior faculty member of the Department and for
30 marks by the supervisor of the project.
3. Semester end Examination
(a) Theory Courses
Each course is evaluated for 70 marks. Examination is of 3 hours duration.
Question Paper Pattern is as follows
Part A:- 30 Marks Compulsory
5X1Marks (One question from each unit)
5X2Marks (One question from each unit)
5X3Marks (One question from each unit)
Part B:- 40 Marks (4 out of 6 questions) (At least one question from
each unit)
(b) Practical Courses
Each lab course is evaluated for 70 marks. The examination shall be
conducted by the laboratory teacher and another senior teacher concerned
with the subject of the same/other department/Industry. One of examiner will
be appointed by the Controller of Examinations in consultation with HOD as
and when required and is evaluated as per standard format.
5
(c) Supplementary Examinations
Supplementary Examinations will be conducted for the current semester after
the declaration of the results of the regular examination of that semester.
4. Attendance Requirements
i. A student shall be eligible to appear for the Semester end examinations if he
/ she acquire a minimum of 75% of attendance in aggregate of all the
subjects for Semester.
ii. Condonation of shortage of attendance in aggregate up to 10% (65% and
above and below 75%) in a semester may be granted by Institute
Academic Committee.
iii. A student will not be permitted to write the end examination and not promoted
to the next Semester unless he satisfies the attendance requirement of the
present Semester, as applicable. He 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 / not paid the
stipulated fee in any Semester are not eligible to take their end semester
examination of that Semester.
5. Minimum Academic Requirements
The following academic requirements have to be satisfied in addition to the
attendance requirements mentioned in item No.4.
i. A student shall be deemed to have satisfied the minimum academic
requirements and earned the credits allotted to each theory or practical
design or drawing subject or project, if he secures not less than 35% (25 out
of 70 marks) of marks in the end examination and a minimum of 40% of
marks in the sum total of the Midterm evaluation and end semester
examination taken together.
ii. A student shall be promoted from II to III year only if he fulfills the academic
requirement of getting 50 credits from the examinations held upto II Year
II Semester including Supplementary examinations of II B.Tech II
Semester.
iii. A student shall be promoted from III year to IV year only if he fulfills the
academic requirement of getting a total of 75 credits from the
examinations held upto III Year II Semester including Supplementary
examinations of III B.Tech II Semester .
Iv. A student shall register and put up minimum academic requirement in all 200
credits and earn atleast 192 credits. Marks obtained in these credits shall be
6
considered for the calculation of Cumulative Grade Point Average (CGPA)
and percentage of marks.
v. The student should obtain two certificate courses during his/her course of
study
vi. Students who fail to earn atleast 192 credits as indicated in the course
structure within eight academic years from the year of their admission
shall forfeit their seat in B.Tech. Course and their admission stand
Cancelled.
6. Course pattern
i. The entire course of study is of four academic years. All I, II, III and IV years
are of Semester pattern.
ii. A student eligible to appear for the end semester examination in a subject,
but absent or has failed in the end semester examination may reappear for
that subject at the supplementary examination whenever conducted.
iii. When a student is detained due to shortage of attendance in any Semester,
he may be re-admitted into that Semester when it is offered next, with the
academic regulations of the batch into which he gets readmitted.
iv. When a student is detained due to lack of credits in any year, he may be
eligible for promotion to the next year after obtaining required number of
credits and fulfillment of the academic requirements.
Award of B.Tech. Degree and Class
A student will be declared eligible for the award of the B. Tech. Degree if
he/she fulfils the following academic regulations:
i) Pursued a course of study for not less than four academic years and not
more than eight academic years.
ii) Registered for 200 credits and secured a minimum of 192 credits with
compulsory subjects as listed in Table.
Table: Compulsory Subjects
Serial Number Subject Particulars
1. All Practical Subjects
2. Industry oriented mini project
3. Comprehensive Viva-Voce
4. Seminar
5. Project work
iii) The student should obtain two certificate courses during his/her course of
study
NOTE: Students, who fail to fulfill all the academic requirements for the award of
the degree within eight academic years from the year of their admission,
shall forfeit their seat in B.Tech. Course.
7
7. CGPA System:
Method of awarding absolute grades and grade points:
The absolute grading method is followed, based on the total marks obtained
in internal and external examinations. Grades and grade points are assigned as
per the Table given below
B.Tech Program: The Absolute Grading Method is followed, based on the total
marks obtained in internal and external examinations. Grades and Grade points
are assigned as given below
Marks Obtained Grade Description Grade Points(GP)
of Grade Value Per Credit
>=90 O Outstanding 10.00
>=80 and <89.99 A+ Excellent 9.00
>=70 and <79.99 A Very Good 8.00
>=60 and <69.99 B Good 7.00
>=50 and <59.99 C Fair 6.00
>=40 and <49.99 D Pass 5.00
<40 F Remedial
Not Appeared the N Absent
Exam(s)
The student is eligible for the award of the B.Tech degree with the class
as mentioned in the Table.
CGPA CLASS
>= 7.5 First Class with Distinction
>= 6.5 and <7.5 First class
>= 5.5 and < 6.5 Second Class
>=5.0 and < 5.5 Pass class
8
Where ‘Ci’ = Number of Credits allotted to particular subject ‘I’
‘Gi’ = Grade Point corresponding to the letter grade awarded in that subject ‘i”
‘i”= 1,2,…..P represent the number of subjects for that particular semester
* SGPA is calculated and awarded for the candidates who pass all the courses in
a semester.
Calculation of Cumulative Grade Point Average (CGPA) for Entire Programme.
The CGPA is calculated as below:
Assessment of the overall performance of a student is obtained by calculating
Cumulative Grade Point Average (CGPA), which is weighted average of the grade
points obtained in all subjects during the course of study.
9
10. Minimum Instruction Days
The minimum instruction days for each Semester shall be 90 instruction days.
11. There shall be no branch transfers after the completion of admission process.
12. The decision of the Institute Academic Committee will be final in respect
of equivalent subjects for those students who are transferred from other
colleges. The transfer of students from other college or from this institute
is to approved by the Governing Council.
13. General
i. Where the words “he”, “him”, “his”, occur in the regulations, they include “she”,
“her”, “hers”.
ii. The academic regulations should be read as a whole for the purpose of any
interpretation.
iii. In the case of any discrepancy/ambiguity/doubt arises in the above rules and
regulations, the decision of the Principal shall be final.
iv. The Chairmen Academic Council may change or amend any or all of the
academic regulations or syllabi at any time and the changes or amendments
made shall be applicable to all the students concerned with effect from the
dates notified by the College.
14. Academic Regulations for B.Tech. (Lateral Entry Scheme)
(Applicable for students admitted from the academic year 2013-2014)
(i) Registered for 150 credits and secured a minimum of 142 credits with
compulsory subjects as listed in table.
Table: Compulsory Subjects
Serial Number Subject Particulars
1. All Practical Subjects
2. Industry oriented mini project
3. Comprehensive Viva-Voce
4. Seminar
5. Project work
(ii) A student who fails to earn a minimum of 142 credits as indicated in the course
structure within six academic years from the year of their admission shall forfeit
their seat in B.Tech. programme and their admission stands cancelled.
(iii) The same attendance regulations are adopted as that of B.Tech. Four year
degree course.
(iv) A student shall be promoted from Third year to Fourth year only on fulfilling the
academic requirements of securing 50 credits from the examinations held upto
III B.Tech II Semester including Supplementary Examinations.
10
(v) All other regulations as applicable to B.Tech. four year degree course will hold
good for B.Tech. (Lateral Entry Scheme).
15. Malpractice Rules
Disciplinary Action for Malpractices/Improper Conduct in Examinations
Nature of Malpractices/Improper Punishment
conduct
If the candidate:
1. (a) Possesses or keeps accessible Expulsion from the examination hall and
in examination hall, any paper, note cancellation of the performance in that
book, programmable calculators, subject only.
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 candidate which
can be used as an aid in the
subject of the examination)
(b)Gives assistance or guidance or Expulsion from the examination hall and
receives it from any other candidate cancellation of the performance in that
orally or by any other body subject only of all the candidates involved.
language methods or In case of an outsider, he will be handed
communicates through cell phones over to the police and a case is registered
with any candidate or persons in or against him.
outside the exam hall in respect of
any matter.
2. Has copied in the examination hall Expulsion from the examination hall and
from any paper, book, cancellation of the performance in that
programmable calculators, palm subject and all other subjects the
computers or any other form of candidate has already appeared including
material relevant to the subject of practical examinations and project work
the examination (theory or and shall not be permitted to appear for
practical) in which the candidate is the remaining examinations of the subjects
appearing. of that Semester/year.
The Hall Ticket of the candidate is to be
cancelled.
11
3. Impersonates any other candidate The candidate who has impersonated shall
in connection with the examination. be expelled from examination hall. The
candidate is also debarred and forfeits the
seat. The performance of the original
candidate 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 candidate is also
debarred for two consecutive semesters
from class work and all end semester
examinations. The continuation of the
course by the candidate 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. Smuggles the Answer book or Expulsion from the examination hall and
additional sheet or takes out or cancellation of performance in that subject
arranges to send out the question and all the other subjects the candidate
paper during the examination or has already appeared including practical
answer book or additional sheet, examinations and project work and shall
during or after the examination. not be permitted for the remaining
examinations of the subjects of that
semester/year. The candidate is also
debarred for two consecutive semesters
from class work and all end semester
examinations. The continuation of the
course by the candidate is subject to the
academic regulations in connection with
forfeiture of seat.
15
Programme Educational Objectives (PEOs):
16
Program Outcomes:
19
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
B. TECH Information Technology
Total 19 14 25
20
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
B. TECH Information Technology
21
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
B. TECH Information Technology
Open Elective
13ITD011 Green IT
Total 19 13 25
22
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
B. TECH Information Technology
Elective – I
13ITD013 Network Programming
13CSE023 Semantic Web and Social Networks
13CSE025 Bio-Informatics 3 0 3
13ITD016 Computer Forensics
13CSE026 Design Patterns
Elective – II
13ITD021 Cloud Computing
23
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
B. TECH Information Technology
(R13)
13ITD007 M-Commerce
13CSE021 Advanced Business Analytics 3 0 3
24
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
25
UNIT IV VECTOR DIFFERENTIAL CALCULUS
Scalar and Vector point functions, Gradient, Divergence, Curl with geometrical &
physical interpretation, Directional derivatives, Properties.
UNIT V VECTOR INTEGRAL CALCULUS
Line integrals and application to Work done and Circulation, Scalar potential function,
Surface integrals and Volume integrals, Gauss divergence theorem, Green’s theorem,
Stokes’ theorem (theorems without proof).
TEXT BOOKS:
1. Higher Engineering Mathematics – by B. S. Grewal,Khanna publishers
2. Calculus and Analytic Geometry by Thomas and Finney, 9th edition;
Publisher: Pearson Education.
REFERENCE BOOKS:
1. Elementary Analysis: The Theory of Calculus by Kenneth Ross; Publisher:
Springer
2. Advanced Engineering Mathematics by Erwin Kreyszig, 8th edition; Publisher:
John Wiley.
3. Advanced Engineering Mathematics by Peter ‘O’ Neil, publisher: Cengage
Learning.
4. Advanced Engineering Mathematics by R.K.Jain and S.R.K.Iyengar; Narosa
Publications
26
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
27
UNIT-II: DIFFRACTION-II
Diffraction at double slit, circular aperture, and multiple slits (grating)( Qualitative
Approach), Resolution of spectral lines, Rayleigh criterion, and resolving power of
grating.
POLARIZATION
Polarization phenomenon, Brewster’s Law and Malus law, examples, types of
polarization, double refraction, Nicol prism, Quarter and Half wave plates
UNIT-III: LASERS:
Characteristics of Lasers – Spontaneous and Stimulated Emission of radiation, meta
stable state, population inversion, lasing action, Einstein’s coefficients and relation
between them –– Ruby Laser – Helium-Neon Laser –Semiconductor Laser –
Applications of lasers.
FIBER OPTICS:
Principle of optical fiber and properties – Acceptance angle and acceptance cone –
Numerical aperture –Types of fibers and refractive index profiles – Qualitative analysis
of attenuation in optical fibers –Application of optical fibers.
UNIT-IV: ELEMENTS OF STATISTICAL MECHANICS:
Maxwell-Boltzmann, Bose-Einstein and Fermi-Dirac statistics (non-mathematical
treatment); Photon gas, Planck’s law of black body radiation; Deduction of Wien’s law
and Rayleigh-Jeans law from Plank’s law.
PRINCIPLES OF QUANTUM MECHANICS:
Waves and particles – De Broglie hypothesis - Matter waves - Davisson and Germer
experiment –Heisenberg’s uncertainty principle - Schrodinger Wave Equation – Wave
function and its Physical Significance - Particle in one dimensional potential box(wave
functions, probability densities and energy states).
UNIT-V: FREE ELECTRON FERMI GAS:
Energy levels in one dimension, Effect of temperature on the Fermi-Dirac distribution,
Free electron gas in three dimensions, electrical conductivity & Ohm’s law, Electrical
Resistivity of Metals (Qualitative).
BAND THEORY OF SOLIDS:
Electron in a periodic potential; Bloch Theorem; Kronig-Penney model (non-
mathematical treatment); Origin of energy band formation in solids; Classification of
materials into conductors, semiconductors & Insulators; and Concept of effective mass
of an electron.
28
TEXT BOOKS:
1. Physics vol.2, by Halliday, Resnick and Krane; John Wiley & Sons
2. Concepts of Modern physics by Arthur Beiser, McGraw Hill Inc.
3. Introduction to Solid State Physics by Charles Kittel : John Wiley & Sons
REFERENCES BOOKS:
1. Engineering Physics by R.K.Gaur and S.L.Gupta; Dhanpat Rai and Sons
2. Applied Physics by P.K.Mittal, IK International Publishing House (P) Ltd.
3. Optics by Ghatak and Thyagarajan, Tata Mc Graw
4. Engineering Physics by G Sahashra Buddhe; University Press
5. Elements of Solid State Physics by J.P.Srivatsva, PHI Publishers
6. Introduction to Optical Communication by G. Keiser
7. Quantum Mechanics by Gupta Kumar Sharma
29
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
31
TEXT BOOKS:
1. Text Book of Engineering Chemistry by Y.Bharathi Kumari, Jyotsna
Cherukuri; Publisher: VGS Book Links.
2. Engineering Chemistry by P.C.Jain & Monica Jain, Publisher: Dhanpatrai
Publishing Company.
REFERENCE BOOKS:
1. Text Book of Engineering Chemistry by S.S. Dhara & Mukkanti; Publisher:
S.Chand & Co.
2. Engineering Chemistry by O G Palanna
3. Text Book of Engineering Chemistry by R.Gopalan, D.Venkappayya,
Sulochana Nagarajan; Publisher: Vikas Publishers.
4. Engineering Chemistry by R.P.Mani, S.N. Mishra, B.Rama Devi ,Cengage
Learning Publications.
32
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
I Year B.Tech-I SEM (Common to all Branches) L T/P/D C
3 0 3
(13ENG001) ENGLISH
Introduction
This is the age of information and communication technologies. Engineers and
technical professionals need to convey technical information in English for various
purposes.
Besides learning General English as an international language, engineering students
need to be equipped with adequate writing ability so that they can communicate
technical information clearly on at least a basic level. A good English writing proficiency
can be a contributing factor to professional recognition and career prospects. This
course teaches those writing strategies that scientists, engineers, and others will need
in order to write successfully on the job. It initiates the students into Technical Writing.
The purposes of technical writing are to inform and persuade. This program aims to
train students in writing clear, concise and effective English.
This Syllabus is therefore, a Pragmatic English Writing Program for engineering
students with intermediate proficiency. The program covers a syllabus outline and
instructional approaches on basic writing skills with particular reference to technical
writing.
Course Objectives:
1. To equip the students with all the LSRW skills for advanced writing and speaking.
2. To equip the students with basic grammar, infrastructural patterns and grammatical
constructions required of in technical writing.
3. To acquaint the students with the writing process, beginning with paragraph writing.
This would prepare them for academic and workplace writing.
Course Outcomes:
1. Comprehend technical writing produced in the engineering profession
2. Understand the writing process and create logical paragraphs
3. Use infrastructural patterns in writing and speaking
Methodology
A Task-based, process oriented methodology will be used by the teachers to give a
practical orientation to the teaching of language. An inductive approach will be used to
demonstrate the use of language in context. This should enable the students to
internalize the language structures and vocabulary used in context. Students will be
exposed to numerous examples and ample practice will be given in the contextual use
of language structures.
33
Syllabus Outline
Unit I : Review of Grammar
i) Common Errors v) Use of Articles and Prepositions
ii) Subject-Verb Agreement vi) Conjunctions
iii) Adverbs vii) pronoun reference
iv) Transitional elements
Unit II : Prose 1
1. Heaven’s Gate by Pico Iyer
2. The Connoisseur by Nergis Dalal
Unit III Reading and Writing Skills
i) Reading Comprehension -- Skimmimg & Scanning
ii) Reading Comprehension -- Intensive Reading
iii) Reading Comprehension -- Critical Analysis
iv) Paragraph Writing
v) Letter Writing
vi) Memo Writing
Unit IV : Prose 2
1. The Cuddalore Experience by Anu George
2. The Odds Against Us by Satyajit Ray
Unit V : Advanced Writing Skills
1. Comparison and Contrast Pattern
2. Cause and Effect Pattern
3. Classification
4. Analogy
5. Problem-Solution Pattern
TEXT BOOKS:
1. Enjoying Every day English by A. Ramakrishna Rao
2. Effective Technical Communication by Ashraf Rizvi
3. Technical Writing Process and Product by Gerson Sharon J. and Steven
Gerson. 3rd edition, New Jersey: Prentice Hall 1999
REFERENCE BOOKS:
1. M. Raman and S. Sharma, 2004; Technical Communication : Principles and
Practices, OUP, (Indian Edition)
2. Blanton, L.L. 1993; Composition Practice, Book 4 ,Second Edition, Heinle &
Heinle Publishers, pp. 54
3. Georges, T.M. 1996; A course in Analytical Writing for Science and
Technology,
http://home.comcast.net/~tgeorges/write/
34
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
35
static, extern, scope rules, arrays to functions, recursive functions, example C
programs.
Strings – Basic concepts, String Input / Output functions, arrays of strings, string
handling functions, strings to functions, C programming examples.
UNIT - IV
Derived types – Structures – Basic concepts, nested structures, arrays of structures,
structures and functions, unions, bit fields, C programming examples.
Pointers – Basic concepts, pointers and functions, pointers and strings, pointers and
arrays, pointers and structures, self-referential structures , example C programs.
UNIT – V
Preprocessor Directives, Dynamic Memory Allocation.
File I/O – Basic concepts, text files and binary files, file input / output operations, file
status functions (error handling), C programming examples, Command-Line
Arguments.
TEXT BOOKS:
1. C programming A Problem-Solving Approach by Behrouz A.Forouzan,
E.V.Prasad, Richard F.Gilberg C How to Program Paul Deitel and Harvey
Deitel , PH.
2. Computer Programming and Data Structures by E Balagurusamy, Tata
McGraw Hill.
REFERENCE BOOKS:
1. Let Us C Yashavant kanetkar BPB.
2. The C Programming Language by Brian W. Kernighan, Dennis M. Ritchie.
3. Absolute beginner's guide to C, Greg M. Perry, Edition 2,Publisher: Sams
Pub., 1994.
36
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
UNIT-I
Environmental Studies:
Introduction, Definition, scope and importance, Ecosystems: Introduction, types,
characteristic features, structure and functions of ecosystems. Bio geo chemical cycle,
Classification of Eco system.
UNIT-II
Natural Resources :classification of Resources, Land resources, Land as resource,
Common property resources, Land degradation, Soil erosion and desertification,
Effects of modern agriculture, fertilizer –pesticide problems, Forest resources, Use and
over-exploitation.
Mining and dams – their effects on forest and tribal people, Water resources, Use and
over- utilization of surface and groundwater, Floods, droughts, Water logging and
salinity, Dams –benefits and costs, Conflicts over Water, Energy resources.
UNIT-III
Bio-diversity and its conservation, Value of bio-diversity -consumptive and productive
use, social, ethical, aesthetic and option values, Bio-geographical classification of India
– India as a mega diversity habitat, Threats to bio-diversity –Hot-spots, habitat loss,
poaching of wild life, loss of species, seeds, etc. Conservation of bio-diversity – Insitu
and Ex-situ conservation.
37
UNIT-IV
Environmental Pollution –Local and Global Issues,Nature of thermal pollution and
nuclear hazards, Global warming, Acid rain,Ozone depletion., Environmental case
studies.
UNIT-V
Environmental Problems in India,Drinking water, sanitation and public health,Effects of
the activities on the quality of environment, Water scarcity and groundwater depletion,
Controversies on major dams – resettlement and rehabilitation of people: problems and
concerns, Rain water harvesting, cloud seeding and watershed management.
Economy and Environment, The economy and environment interaction, Economics of
development, preservation and conservation, Sustainability: theory and practices,
Limits to growth, Equitable use of resources for sustainable life styles, Environmental
Impact Assessment.
Text Books
1. Environmental Science - Y.Anjaneyulu, B S Publications.
2. Environmental studies-Deeksha dave, Cengage learning India Pvt. Ltd.,
3. Environmental sciences and Engineering - P. Venugopal Rao, PHI learning Pvt.
Ltd.,
4. Environmental Science and Technology by M. Anji Reddy, B S Publications.
Reference books
1. Clark, R.S., Marine Pollution, Clanderson Press, Oxford, 2002.
2. Cunningham, W.P., et al. , Environmental Encyclopedia, Jaico Publishing
House, Mumbai, 2003.
38
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
39
TRADES FOR DEMONSTRATION and EXPOSURE:
1. Power tools in construction, wood working, electrical engineering and
mechanical engineering.
2. Machine shop.
3. CNC Lathe
TEXT BOOKS:
1. Workshop Manual by P.Kannaiah and K.L.Narayana; Publisher: Scitech.
40
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
42
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
45
ax ax
right hand side term of the type e sin (ax), cos (ax), polynomials in x, e ,
V(x), x V(x) and method of variation of parameters; Euler-Cauchy’s 2nd order differential
equations, applications to spring mass system, Simple harmonic motion and L-C-R
Circuits.
UNIT-IV
LAPLACE TRANSFORMS:
Existence condition, Laplace transform of standard functions, Properties, Inverse
Laplace transform of functions using partial fractions, Convolution and Convolution
theorem (statement only). Solving linear differential equations using Laplace transform.
Unit step function, Impulse function and Periodic function and their transforms.
UNIT- V
Z-TRANSFORMS:
Z-transform; Inverse z-transform; Properties, initial and final value theorems;
Convolution theorem (theorems without proofs); Difference equations; Solutions of
difference equations using z-transform.
TEXT BOOKS:
1. Higher Engineering Mathematics – B. S. Grewal,Khanna publishers.
2. A First Course in Differential Equations by Dennis G. Zill; Publisher: Brooks
Cole publiers.
3. Advanced Engineering Mathematics by R.K.Jain and S.R.K.Iyengar; Narosa
Publications.
REFERENCE BOOKS:
1. Advanced Engineering Mathematics by Erwin Kreyszig, 8th Edition; Publisher:
John Wiley.
2. Advanced Engineering Mathematics by Peter V. O’Neil, 9th Edition; Publisher:
Cengage Learning
46
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
47
Numerical solutions of ordinary differential equations:
Solution of initial value problems by Taylor’s series - Picard’s method of successive
approximations, Euler’s method, and Runge - Kutta methods; Predictor Corrector
methods - Adams Bashforth method- Adams Moulton method and Milne’s method
(without proofs).
UNIT IV
Linear programming
Basic concepts; problem formulation, graphical method, canonical and standard forms
of LPP simplex method, Artificial variables technique- Big-M method,
UNIT V
Transportation problems:
Balanced and Unbalanced transportation problems- North-West corner rule, Least cost
method, Vogel’s approximation method (VAM) and MODI method.
TEXT BOOKS:
1. Elementary Numerical Analysis – B.S. Grewal, 3rd edition Publisher: Khanna
Publishers
2. Operations Research - Taha H.A, Publisher: Mcmillan Publishing:
REFERENCE BOOKS:
1. Advanced Engineering Mathematics by Erwin Kreyszig, 8th Edition; Publisher:
John Wiley and Sons.
2. Elementary Numerical Analysis – an algorithmic approach -Samuel D. Conte
and Carl De Boor (2006); 3rd edition; Publisher: Tata McGraw Hill 3.
Operations Research – by S.D. Gupta
3. Operations Research- Kantiswaroop , P.K Gupta and Manmohan, 4th
edition, Publisher: Sultan Chand & Sons.
48
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
49
UNIT-III
MAGNETIC PROPERTIES OF MATERIALS:
Permeability, Field intensity, magnetic field induction, Magnetization and Magnetic
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 – Ferrites and their applications.
UNIT-IV
DIELECTRIC PROPERTIES:
Electric dipole, Dipole moment, Dielectric constant, Electronic, Ionic and Orientation
Polarization – Calculation of Polarizibilities – Frequency dependence of Polarization-
Internal fields – Claussius – Mossotti equation –Piezo and Ferro electricity.
UNIT-V
SUPERCONDUCTORS:
Experimental survey and superconductivity phenomenon, – Meissner effect – Critical
fields and Persistent currents, Type I and Type II superconductors - London equations-
penetration depth-flux quantization-BCS Theory- Josephson Effect– High temperature
Superconductors, Applications of Superconductors.
TEXT BOOKS:
1. Concepts of Modern physics by Arthur Beiser, McGraw Hill Inc.
2. Applied Physics by P.K.Mittal, IK International Publishing House (P) Ltd
3. Electronic Devices and circuits by Milliman and Halkias
REFERENCE BOOKS:
1. Engineering Physics by Dr M Chandra Shekar and Dr P. Appala Naidu, VGS
Book links.
2. Engineering Physics by G Sahashra Buddhe; University Press
3. Quantum Mechanics by Gupta Kumar Sharma
4. Elements of Solid State Physics by J.P.Srivatsva, PHI Publishers
5. Engineering Physics by M.R.Srinivasan, New Age Publishers
6. Solid State Physics by M.A. Wahab.
50
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
Course Outcomes
Upon completion of this course, students should be able to:
51
This principle prohibits use of computing technology in ways that result in harm to any
of the following: users, the general public, employees, and employers. Harmful actions
include intentional destruction or modification of files and programs leading to serious
loss of resources or unnecessary expenditure of human resources such as the time
and effort required to purge systems of "computer viruses."
Well-intended actions, including those that accomplish assigned duties, may lead to
harm unexpectedly. In such an event the responsible person or persons are obligated
to undo or mitigate the negative consequences as much as possible. One way to avoid
unintentional harm is to carefully consider potential impacts on all those affected by
decisions made during design and implementation.
To minimize the possibility of indirectly harming others, computing professionals must
minimize malfunctions by following generally accepted standards for system design
and testing. Furthermore, it is often necessary to assess the social consequences of
systems to project the likelihood of any serious harm to others. If system features are
misrepresented to users, coworkers, or supervisors, the individual computing
professional is responsible for any resulting injury.
In the work environment the computing professional has the additional obligation to
report any signs of system dangers that might result in serious personal or social
damage. If one's superiors do not act to curtail or mitigate such dangers, it may be
necessary to "blow the whistle" to help correct the problem or reduce the risk.
However, capricious or misguided reporting of violations can, itself, be harmful. Before
reporting violations, all relevant aspects of the incident must be thoroughly assessed.
In particular, the assessment of risk and responsibility must be credible. It is suggested
that advice be sought from other computing professionals.
1.3 Be honest and trustworthy.
Honesty is an essential component of trust. Without trust an organization cannot
function effectively. The honest computing professional will not make deliberately false
or deceptive claims about a system or system design, but will instead provide full
disclosure of all pertinent system limitations and problems.
A computer professional has a duty to be honest about his or her own qualifications,
and about any circumstances that might lead to conflicts of interest.
Membership in volunteer organizations such as ACM may at times place individuals in
situations where their statements or actions could be interpreted as carrying the
"weight" of a larger group of professionals. An ACM member will exercise care to not
misrepresent ACM or positions and policies of ACM or any ACM units.
1.4 Be fair and take action not to discriminate.
The values of equality, tolerance, respect for others, and the principles of equal justice
govern this imperative. Discrimination on the basis of race, sex, religion, age, disability,
52
national origin, or other such factors is an explicit violation of ACM policy and will not
be tolerated.
Inequities between different groups of people may result from the use or misuse of
information and technology. In a fair society, all individuals would have equal
opportunity to participate in, or benefit from, the use of computer resources regardless
of race, sex, religion, age, disability, national origin or other such similar factors.
However, these ideals do not justify unauthorized use of computer resources nor do
they provide an adequate basis for violation of any other ethical imperatives of this
code.
1.5 Honor property rights including copyrights and patent.
Violation of copyrights, patents, trade secrets and the terms of license agreements is
prohibited by law in most circumstances. Even when software is not so protected, such
violations are contrary to professional behavior. Copies of software should be made
only with proper authorization. Unauthorized duplication of materials must not be
condoned.
1.6 Give proper credit for intellectual property.
Computing professionals are obligated to protect the integrity of intellectual property.
Specifically, one must not take credit for other's ideas or work, even in cases where the
work has not been explicitly protected by copyright, patent, etc.
1.7 Respect the privacy of others.
Computing and communication technology enables the collection and exchange of
personal information on a scale unprecedented in the history of civilization. Thus there
is increased potential for violating the privacy of individuals and groups. It is the
responsibility of professionals to maintain the privacy and integrity of data describing
individuals. This includes taking precautions to ensure the accuracy of data, as well as
protecting it from unauthorized access or accidental disclosure to inappropriate
individuals. Furthermore, procedures must be established to allow individuals to review
their records and correct inaccuracies.
This imperative implies that only the necessary amount of personal information be
collected in a system, that retention and disposal periods for that information be clearly
defined and enforced, and that personal information gathered for a specific purpose not
be used for other purposes without consent of the individual(s). These principles apply
to electronic communications, including electronic mail, and prohibit procedures that
capture or monitor electronic user data, including messages, without the permission of
users or bona fide authorization related to system operation and maintenance. User
data observed during the normal duties of system operation and maintenance must be
treated with strictest confidentiality, except in cases where it is evidence for the
violation of law, organizational regulations, or this Code. In these cases, the nature or
contents of that information must be disclosed only to proper authorities.
53
1.8 Honor confidentiality.
The principle of honesty extends to issues of confidentiality of information whenever
one has made an explicit promise to honor confidentiality or, implicitly, when private
information not directly related to the performance of one's duties becomes available.
The ethical concern is to respect all obligations of confidentiality to employers, clients,
and users unless discharged from such obligations by requirements of the law or other
principles of this Code.
UNIT – II: MORE SPECIFIC PROFESSIONAL RESPONSIBILITIES.
2.1 Strive to achieve the highest quality, effectiveness and dignity in both the
process and products of professional work.
Excellence is perhaps the most important obligation of a professional. The computing
professional must strive to achieve quality and to be cognizant of the serious negative
consequences that may result from poor quality in a system.
2.2 Acquire and maintain professional competence.
Excellence depends on individuals who take responsibility for acquiring and
maintaining professional competence. A professional must participate in setting
standards for appropriate levels of competence, and strive to achieve those standards.
Upgrading technical knowledge and competence can be achieved in several ways:
doing independent study; attending seminars, conferences, or courses; and being
involved in professional organizations.
2.3 Know and respect existing laws pertaining to professional work.
ACM members must obey existing local, state, province, national, and international
laws unless there is a compelling ethical basis not to do so. Policies and procedures of
the organizations in which one participates must also be obeyed. But compliance must
be balanced with the recognition that sometimes existing laws and rules may be
immoral or inappropriate and, therefore, must be challenged. Violation of a law or
regulation may be ethical when that law or rule has inadequate moral basis or when it
conflicts with another law judged to be more important. If one decides to violate a law
or rule because it is viewed as unethical, or for any other reason, one must fully accept
responsibility for one's actions and for the consequences.
2.4 Accept and provide appropriate professional review.
Quality professional work, especially in the computing profession, depends on
professional reviewing and critiquing. Whenever appropriate, individual members
should seek and utilize peer review as well as provide critical review of the work of
others.
2.5 Give comprehensive and thorough evaluations of computer systems and
their impacts, including analysis of possible risks.
Computer professionals must strive to be perceptive, thorough, and objective when
evaluating, recommending, and presenting system descriptions and alternatives.
54
Computer professionals are in a position of special trust, and therefore have a special
responsibility to provide objective, credible evaluations to employers, clients, users,
and the public. When providing evaluations the professional must also identify any
relevant conflicts of interest.
Avoiding harm, any signs of danger from systems must be reported to those who have
opportunity and/or responsibility to resolve them.
2.6 Honor contracts, agreements, and assigned responsibilities.
Honoring one's commitments is a matter of integrity and honesty. For the computer
professional this includes ensuring that system elements perform as intended. Also,
when one contracts for work with another party, one has an obligation to keep that
party properly informed about progress toward completing that work.
A computing professional has a responsibility to request a change in any assignment
that he or she feels cannot be completed as defined. Only after serious consideration
and with full disclosure of risks and concerns to the employer or client, should one
accept the assignment. The major underlying principle here is the obligation to accept
personal accountability for professional work. On some occasions other ethical
principles may take greater priority.
A judgment that a specific assignment should not be performed may not be accepted.
Having clearly identified one's concerns and reasons for that judgment, but failing to
procure a change in that assignment, one may yet be obligated, by contract or by law,
to proceed as directed. The computing professional's ethical judgment should be the
final guide in deciding whether or not to proceed. Regardless of the decision, one must
accept the responsibility for the consequences.
However, performing assignments "against one's own judgment" does not relieve the
professional of responsibility for any negative consequences.
2.7 Improve public understanding of computing and its consequences.
Computing professionals have a responsibility to share technical knowledge with the
public by encouraging understanding of computing, including the impacts of computer
systems and their limitations. This imperative implies an obligation to counter any false
views related to computing.
2.8 Access computing and communication resources only when authorized to do
so.
Theft or destruction of tangible and electronic property is prohibited - "Avoid harm to
others." Trespassing and unauthorized use of a computer or communication system is
addressed by this imperative. Trespassing includes accessing communication
networks and computer systems, or accounts and/or files associated with those
systems, without explicit authorization to do so. Individuals and organizations have the
right to restrict access to their systems so long as they do not violate the discrimination
principle. No one should enter or use another's computer system, software, or data
55
files without permission. One must always have appropriate approval before using
system resources, including communication ports, file space, other system peripherals,
and computer time.
UNIT – III: ORGANIZATIONAL LEADERSHIP IMPERATIVES.
BACKGROUND NOTE: This section draws extensively from the draft IFIP Code of
Ethics, especially its sections on organizational ethics and international concerns. The
ethical obligations of organizations tend to be neglected in most codes of professional
conduct, perhaps because these codes are written from the perspective of the
individual member. This dilemma is addressed by stating these imperatives from the
perspective of the organizational leader. In this context "leader" is viewed as any
organizational member who has leadership or educational responsibilities. These
imperatives generally may apply to organizations as well as their leaders. In this
context "organizations" are corporations, government agencies, and other "employers,"
as well as volunteer professional organizations.
59
TEXT BOOKS:
1. C Programming & Data Structures, B.A.Forouzan and R.F. Gilberg, Third
Edition, Cengage Learning.
2. Data Structures Using C (Paperback) by Aaron M. Tenenbaum
REFERENCE BOOKS:
1. C& Data structures – P. Padmanabham, Third Edition, B.S. Publications.
2. Data Structures using C – A.M.Tanenbaum, Y.Langsam, and M.J. Augenstein,
Pearson Education
3. C Programming & Data Structures, E. Balagurusamy, TMH.
4. C Programming & Data Structures, P. Dey, M Ghosh R Thereja, Oxford
University Press
5. C& Data structures – E V Prasad and N B Venkateswarlu, S. Chand&Co.
60
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
61
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
64
Unit 3
Multimedia Lab
1. Grammar --- Adverbs, Conjunctions, Prepositions; The Future Tense
2. Vocabulary Lesson 3
3. Telephoning Skills
Communication Skills Lab: Role Play/ Situational Dialogues
Unit 4
Multimedia Lab:
1. Grammar ---- Active and Passive Voice; Language Analysis
2. Vocabulary : Lesson 4
3. Listening Comprehension
Communication Skills Lab: i) JAM/ Short Talk ii) Information
Transfer a) Interpretation of Graph
Unit 5
Multimedia Lab:
1. Introduction to Technical Writing
A. Definition of a Technical Term
B. Description of a Mechanism
C. Description of a Technical Process
2. Vocabulary : Lesson 5
Communication Skills Lab : Presentation Skills: Oral Presentation
List of Software:
Clarity Pronunciation Power – part II
Oxford Advanced Learner’s Compass, 7th Edition
DELTA’s key to the Next Generation TOEFL Test: Advanced Skill
Practice.
Lingua TOEFL CBT Insider, by Dreamtech
TOEFL & GRE (KAPLAN, AARCO & BARRONS, USA, Cracking GRE by
CLIFFS)
66
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
67
UNIT IV
Tests of significance- Small samples
Tests of significance-t distributions, confidence interval for the t- distribution, F-
distributions and Chi square distributions.
UNIT V
Queuing Theory
Queuing theory -Arrival process and service process- Pure birth and death process,
M/M/1 model with finite and infinite capacities, M/M/C model with infinite capacity.
TEXT BOOKS:
1. Probability and Statistics for Engineers – Richard .A.Johanson, 1995, 5th
Edition, Prentice-Hall.
2. Some problems in the theory of queues. -Kendall, D. G. (1951) Journal of the
Royal Statistical Society, Series B, 13, 151–185..
REFERENCE BOOKS:
1. Applied Statistics for Engineers-Jay.L.Devore, Nicholas. R.Famum,
Jimmy.A.Doi, 3rd Edition, Cengage
2. An Introduction to Probability Theory and Its Applications- Feller, W. (1968–
Volume I and II. 2nd edn. John Wiley Inc., New York, NY.
3. The Single Server Queue -Cohen, J. W. (1969) .Wiley Interscience, New
York, NY.
68
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
69
Collector Configurations, Relation between alpha, beta and gamma, Transistor as an
Amplifier.
UNIT-V
Introduction to Amplifies
Definition of voltage gain, current gain, input resistance and output resistance in
amplifies Concept of feedback, classification of feedback amplifies, General
characteristics of negative feedback amplifies, effect of feedback on amplifies,
Introduction to feedback topologies, Barkhausen criteria, principle of operation of LC
and crystal oscillators
TEXT BOOKS:
1. Basic Electrical Engineering - By M.S.Naidu and S. Kamakshiah – TMH.
2. Electrical circuits by Sudhkar and Shyam Mohan-TMH
3. Electronic Devices and Circuits – J.Millman, C.C.Halkias, and SatyabrathaJit,
Tata McGraw Hill, 2nd Edition, 2007.
4. Electronic Devices and Circuits – R.L. Boylestad and Louis Nashelsky,
Pearson/Prentice Hall, 11th Edition, 2006.
5. Electronic Devices and Circuits – David A Bell, Oxford University Press, 5th
edition (2008)
REFERENCE BOOKS:
1. Electrical and Electronic Technology – By Hughes- Pearson Education.
2. Electrical engineering fundamentals by Vincent Del Toro
3. Electrical Circuit Theory and Technology – by John Bird, Elsevier Science &
Technology, 2007
4. Integrated Electronics - J.Millman and Christos.C.Halkias, and Satyabratha,
Jit Tata McGraw Hill, 2nd Edition, 2008.
5. Electronic Devices and Circuits – T.F. Bogart Jr., J.S.Beasley and G.Rico,
Pearson Education, 6th Edition, 2004.
6. Electronic Devices and Circuits- S. S Salivahanan, N. Sursh Kumar, A.
Vallava Raju, 2nd Edition., TMH, 2010
70
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
71
UNIT-II
BOOLEAN ALGEBRA and GATE LEVEL MINIMIZATION:-
Postulates and theorems- representation of switching functions-SOP and POS forms –
Canonical forms-digital logic gates –Karnaugh Maps –minimization using three
variable, four variable and five variable K-Maps, Don’t Care Conditions- NAND and
NOR implementation , Other Two-Level Implementation –Exclusive –OR function -
Integrated Circuits-Hardware Description Language(HDL)
UNIT-III
DESIGN OF COMBINATIONAL CIRCUITS:-
Tabular Minimization- Combinational Circuits- Analysis and Design Procedure- Binary
adder and subtractors – Carry Look-ahead adder-Decimal adder-Binary multiplier-
magnitude comparator-BCD adder- Decoders- Encoders-Multiplexers-Random Access
Memory-Read Only Memory-Programmable Logic Array-Programmable Array Logic -
HDL for Combinational Circuits
UNIT-IV
DESIGN OF SEQUENTIAL CIRCUITS:-
Combinational Vs Sequential Circuits – Latches-Flip Flops-RS flip flop, JK flip flop, T
flip flop, D flip flop, Master-Slave Flip flop- Flip Flops excitation functions –Conversion
of one flip flop to another flip flop- Asynchronous Vs Synchronous circuits-Analysis of
clocked sequential circuits-State Table-State Diagram-State Reduction and State
Assignment-Mealy and Moore Machines-capabilities and limitations of Finite State
Machine-State equivalence and machine minimization-Design of synchronous
counters- Ripple Counters-Asynchronous counters-Registers-Shift Registers- HDL for
Sequential circuits.
UNIT-V
ASYNCHRONOUS SEQUENTIAL LOGIC:-
Introduction-Analysis Procedure, Circuits with Latches, Design Procedure-Reduction of
state and flow Tables – Race Free State Assignment Hazards, Design examples.
TEXT BOOKS:
1. DIGITAL DESIGN, Third Edition, M.Morris Mano, Pearson Education/PHI.
2. FUNDAMENTALS OF LOGIC DESIGN, Roth, 5th Edition,Thomson.
REFERENCE BOOKS:
1. Switching and Finite Automata Theory by Zvi. Kohavi, Tata McGraw Hill.
2. Switching and Logic Design, C.V.S. Rao, Pearson Education
3. Digital Principles and Design Donald D.Givone, Tata McGraw Hill, Edition.
4. Fundamentals of Digital Logic & Micro Computer Design, 5TH Edition, M.
Rafiquzzaman John Wiley
72
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
Course objectives:
Course outcomes:
UNIT- I
Mathematical Logic: Statements and notations, Connectives, Well formed formulas,
Truth Tables, tautology, equivalence implication, Normal forms, Quantifiers, universal
quantifiers.
Rules of inference, Consistency, proof of contradiction, Automatic Theorem Proving,
Predicates: Predicative logic, Free & Bound variables.
UNIT- II
Set Theory: notations, inclusion and equality sets, operations on sets, venn diagrams.
Relations: Properties of binary Relations, equivalence, transitive closure, compatibility
and partial ordering relations, Hasse diagram. Functions: Inverse Function,
Composition of functions, recursive Functions. Algebraic structures: Algebraic systems,
73
Examples and general properties, Semi groups and monoids, groups, and sub groups,
Homomorphism, Isomorphism on groups and semi groups.
UNIT- III
Elementary Combinatorics: Basics of counting, Combinations & Permutations, with
repetitions, Constrained repetitions, Binomial Coefficients, Binomial and Multinomial
theorems, the principles of Inclusion – Exclusion, Pigeon hole principles and its
application.
UNIT- IV
Recurrence Relations: Generating Functions, Function of Sequences, Calculating
Coefficients of generating functions, Recurrence relations, Solving recurrence relation
by substitution and Generating functions, the method of Characteristic roots, solution of
Inhomogeneous Recurrence Relations.
UNIT- V
Graph Theory: Representation of Graphs, DFS, BFS, Spanning Trees, Planar Graphs.
Graph Theory and Applications: Basic Concepts, Isomorphism and Sub graphs, Multi
graphs and Euler circuits, Hamiltonian graphs, Chromatic Numbers.
TEXT BOOKS:
1. Discrete mathematical structures with applications to computer science
,J.P.Trembly ,R.Manohar, Tata M c Graw Hill.
2. Elements of Discrete Mathematics- A Computer Oriented Approach, C.L.Liu,
D.P. Mohapatra, 3rd edition, Tata M c Graw Hill.
3. ” Discrete Mathematics for Computer Scientists & Mathematicians,” Second
edition, J.L.Mott, A. Kandel, T.P. Baker, PHI
REFERENCE BOOKS:
1. Discrete Mathematics and its Applications, 5th edition, Kenneth.H.Rosen, TMH.
2. Discrete Mathematical Structures Theory and applications, Mallik and Sen,
Cengage.
3. Discrete Mathematics with Applications, Thomas Koshy, Elsevier.
4. Logic and Discrete Mathematics, Grass Man and Tremblay,Pearson Education
74
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
Course Outcomes
75
UNIT - I
BUSINESS AND NEW ECONOMIC ENVIRONMENT
Characteristic features of business; Features and evaluation of sole proprietorship;
Partnership; Joint stock company; Public enterprises and their types; Changing
business environment in post- liberalization scenario.
UNIT - II
INTRODUCTION TO BUSINESS ECONOMICS AND DEMAND ANALYSIS
Definition; Nature and scope of managerial economics - demand analysis
determinants; Law of demand and its exceptions.
ELASTICITY OF DEMAND AND DEMAND FORECASTING
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, and Judgmental approach to demand forecasting).
UNIT - III
COST ANALYSIS
Cost concepts - Opportunity cost, Fixed vs. Variable costs, Explicit costs vs. Implicit
costs, and Out of pocket costs vs. Imputed costs; Break-even analysis (BEA) -
determination of break-even point (simple problems), managerial significance, and
limitations of BEA.
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 - IV
THEORY OF PRODUCTION
Production function - isoquants and isocosts, least cost combination of inputs, and laws
of returns; Internal and external economies of scale.
MARKET STRUCTURES
Types of competition; Features of perfect competition, Monopoly, and Monopolistic
competition; Price-output determination in case of perfect competition and Monopoly.
PRICING POLICIES AND METHODS
Cost plus pricing; Marginal cost pricing; Sealed bid pricing; Going rate pricing, Limit
pricing, Market skimming pricing, Penetration pricing, Two-part pricing, Block pricing,
Bundling pricing, Peak load pricing, Cross subsidization.
UNIT V
76
INTRODUCTION TO FINANCIAL ACCOUNTING
Double-entry book keeping; Journal; Ledger; Trial balance; Final accounts - trading
account, profit and loss account, and balance sheet with simple adjustments.
FINANCIAL ANALYSIS THROUGH RATIOS
Computation; Analysis and interpretation of liquidity ratios - current ratios, and quick
ratio; Activity ratios - Inventory Turnover ratio, and Debtor Turnover ratio; Capital
structure ratios – Debt-Equity ratio, and Interest Coverage Ratio; Profitability ratios -
Gross profit Ratio, Net Profit Ratio, Operating Ratio, P/E ratio, and EPs.
TEXT BOOKS:
1. Managerial Economics and Financial Analysis, Aryasri, TMH, 2009.
2. Managerial Economics, Varshney & Maheswari: Sultan Chand, 2009.
REFERENCE BOOKS:
1. Financial AccouFnting for Management, Ambriah Gupta, Pearson Education,
New Delhi, 2010.
2. Managerial Economics, H.Craig Peterson & W. Cris Lewis, PHI, 2010.
77
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
Course Objectives:
.
1. Understand the various features object oriented programming.
2. Identify classes, objects, members of a class and their relationship needed for
a specific problem.
3. To apply ADT concepts using templates.
4. Demonstrate data structure problem solutions, search and retrieval of
information from text data.
Course Outcomes:
Upon completion of this course, students should be able to:
1. Develop programs using object oriented features in C++.
2. To implement algorithms into programming code.
3. Design applications using data structures such that optimizing searching.
4. Perform text processing operations using pattern matching algorithms.
.
UNIT- I
C++ Class Overview, Class Definition, Objects, Class Members, Access Control, Class
Scope, Constructors and destructors, parameter passing methods, Inline functions,
static class members, this pointer, friend functions, dynamic memory allocation and de-
allocation (new and delete), exception handling.
UNIT- II
Function Overloading, Operator Overloading, Generic Programming- Function and
class templates, Inheritance basics, base and derived classes, inheritance types, base
class access control, runtime polymorphism using virtual functions, abstract classes,
I/O streams.
UNIT -III
Review of basic data structures, the list ADT, Stack ADT, Queue ADT, Implementation
using template classes in C++. Priority Queues – Definition, ADT, Realizing a Priority
Queue using Heaps, Definition, insertion, Deletion, Heap sort,
UNIT- IV
78
Dictionaries, linear list representation, Skip list representation, operations insertion,
deletion and searching, hash table representation, hash functions, collision resolution-
separate chaining, open addressing-linear probing, quadratic probing, double hashing,
rehashing, extendible hashing, comparison of hashing and skip lists. Text Processing –
Pattern matching algorithms-Brute Force, Knuth-Morris-Pratt algorithm, Tries –
Standard tries, Compressed tries, Suffix tries.
UNIT- V
Trees-Basic Terminology, Binary tree ADT, array and linked representations,
traversals, threaded binary trees, Binary Search Trees: Definition, ADT,
Implementation, Operations of Searching, Insertion and Deletion. AVL Trees,
Definition, Operations-Insertion and Searching. B-Trees, Definition, B-Tree of order m,
insertion, deletion and searching.
Graphs: Basic terminology, representations of Graphs, Graph search methods – DFS,
BFS.
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 using C and C++, Langsam, Augenstein and Tanenbaum,
PHI.
3. Problem solving with C++, The OOP, Fourth edition, W.Savitch, Pearson
Education.
4. Data Structures and Algorithms Using C++, Ananda Rao Akepogu,Radhika
Raju Palagiri.
79
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
EXPERIMENTS
Programming can be done by using Verilog compiler and verification by simulation with
any of the front end tools.
1. HDL code to realize all the logic gates.
2. Design of 2-to -4 decoder.
3. Design of 8-to-3 encoder
4. Design of 8-to-1 Multiplexer
5. Design of 1 to 8 Demultiplexer
6. Design of comparator
7. Design of half adder and full adder.
8. Design of half subtractor and full Subtractor.
9. Design of flip flops: SR, D, JK, T.
10. Design of code converters.
11. Design of 4-bit Asynchronous counter.
12. Design of 4-bit synchronous counter
80
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
81
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
Course Objectives:
1. To implement various object oriented concepts like abstraction, encapsulation,
polymorphism, inheritance etc.
2. To demonstrate exception handling mechanism.
3. To implement algorithms into programming code.
4. To implement dictionaries, various data structures like stacks, queues, trees,
grphs using templates.
Course Outcomes:
Upon completion of this course, students should be able to:
1. Design applications using object oriented features.
2. Design applications using linear and non linear data structures.
3. Analyze performance of various data structures.
4. Perform text processing operations using pattern matching algorithms
TASK 1
Implementation of C++ programs using - Constructors, friend functions, Parameter
passing methods, this pointer, inline functions, static members, dynamic memory
allocation, exception handling.
TASK 2
Implementation of C++ programs using: Function over Loading, Operator Overloading,
Function and class templates, inheritance types, runtime polymorphism using virtual
functions, abstract classes, streams I/O.
TASK 3
Write C++ programs to implement the following using an array
a) Stack ADT b) Queue ADT c) Linear list
TASK 4
Write C++ programs to implement the following using linked list
a) Stack ADT b) Queue ADT c) Linear list
TASK 5
Write C++ programs to implement the following using an array
a) Circular Queue ADT b) Dequeue ADT
TASK 6
Write C++ programs to implement the following using linked list
82
a) Circular Queue ADT b) Dequeue ADT c) Double linked list
TASK 7
Write C++ programs to implement the following on Binary search tree i) Insertions
ii) Deletions
iii) Search
TASK 8
Write C++ programs to implement Binary tree traversals (preorder, inorder,
postorder)
TASK 9
Write C++ programs to implement bfs and dfs for a given graph
TASK 10
Write C++ programs to implement
a) Heap sort b) merge sort
TASK 11
Write C++ programs to implement all functions of dictionary (ADT) using hashing.
TASK 12
Write C++ programs to implement Brute Force and Knuth –Morris-Pratt pattern
matching algorithm
83
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
Course Objectives:
1. To introduce the theoretical foundations of computer science concerning– the
relationships between languages and machines, the inherent limits of what
can be computed, and the inherent efficiency of solving problems.
2. To determine a language’s location in the Chomsky hierarchy (regular sets,
context-free, context-sensitive, and recursively enumerable languages).
3. To convert among equivalently powerful notations for a language, including
among DFAs, NFAs, and regular expressions, and between PDAs and CFGs.
4. To discuss the applications of theory to other areas of computer science such
as algorithms, programming languages, compilers, natural language
translation, operating systems, and software verification.
5. To build the foundation for students to pursue research in the areas of
automata theory, formal languages, and computational power of machines
Course Outcomes:
At the end of this course the student should be able to
1. Understand the theory of automata.
2. Classify computational devices according to their computational power, and
tools which will allow us to tell if a device is powerful enough to solve a given
computational problem.
3. Understand the concept of the grammar and concept of programming
language.
4. Understand Turing machine concept and in turn the technique applied in
computers.
5. Classify P vs NP- Class problems and NP-Hard vs NP-complete problems.
UNIT-I
Fundamentals: strings, Alphabet, Language, Operations, Chomsky hierarchy of
languages, Finite state machine Definitions, finite automation model, acceptance of
strings and languages, DFA and NFA, transition diagrams and language recognizers.
NFA with ε transitions –Equivalence between NFA with and without ε transitions, NFA
to DFA conversion, minimization FSM, equivalence between two FSM’s, Output
machines- Moore and Mealy machine.
84
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). Regular Grammars – right linear and left linear
grammars, equivalence between regular grammar and FA,
UNIT –III
Context Free Grammar, derivation trees, sentential forms, right most and left most
derivations of strings. Ambiguity in Context frees Grammars. Minimization of Context
free grammars, CNF, GNF, Pumping Lemma for Context Free Languages.
Enumeration of properties of CFL (proofs omitted).
Push Down Automata- definition, model, acceptance of CFL, Acceptance by final state
and acceptance by empty state and its equivalence, Equivalence of CFL and PDA
(proofs not required), Introduction to DCFL and DPDA.
UNIT –IV
Turing Machine: Definition, model, Design of TM, computable functions, recursively
enumerable languages. Church’s hypothesis, counter machine, types of Turing
Machines (proofs not required)
UNIT –V
Computability Theory: Linear Bounded Automata and context sensitive languages,
LR (0) grammar, decidability of problems, Universal TM, Un decidable problems about
Turing Machine – Post’s Correspondence Problem - The classes P and NP.
TEXT BOOKS:
1. H.E.Hopcroft, R.Motwani and J.D Ullman, “Introduction to Automata Theory,
Languages and Computations”, Second Edition, Pearson Education, 2003.
REFERENCE BOOKS:
1. H.R.Lewis and C.H.Papadimitriou, “Elements of The theory of Computation”,
Second Edition, Pearson Education/PHI, 2003
2. J.Martin, “Introduction to Languages and the Theory of Computation”, Third
Edition, TMH, 2003.
3. Micheal Sipser, “Introduction of the Theory and Computation”, Thomson
Brokecole, 1997.
85
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
UNIT- III
DIGITAL TRANSMISSION: Pulse Modulation, Pulse code Modulation, Dynamic
Range, Signal Voltage –to-Quantization Noise Voltage Ration, Linear Versus Nonlinear
PCM Codes, Companding, PCM Line Speed, Delta Modulation PCM and Differential
PCM.
MULTIPLEXING AND T CARRIERS: Time- Division Multiplexing, T1 Digital Carrier
System, North American Digital Multiplexing Hierarchy, Digital Line Encoding, T Carrier
systems, European Time- Division Multiplexing, Statistical Time – Division Multiplexing,
Frame Synchronization, Frequency- Division Multiplexing, Wavelength- Division
Multiplexing, Synchronous Optical Network
UNIT -IV
CELLULAR TELEPHONE SYSTEMS: First- Generation Analog Cellular Telephone,
Personal Communications system, Second-Generation Cellular Telephone Systems,
N-AMPS, Digital Cellular Telephone, Interim Standard, North American Cellular and
PCS Summary, Global system for Mobile Communications, Personal Communications
Satellite System.
UNIT- V
DATA COMMUNICATIONS EQUIPMENT: Digital Service Unit and Channel Service
Unit, Voice- Band Data Communication Modems, Bell Systems- Compatible Voice-
Band Modems, Voice- Band Modem Block Diagram, Voice- Band Modem
Classifications, Asynchronous Voice-Band Modems, Synchronous Voice-Band
Modems, Modem Synchronization, ITU-T Voice- Band Modem Specifications, 56K
Modems, Modem Control: The AT Command Set, Cable Modems, Probability of Error
and Bit Error Rate
TEXT BOOKS:
1. Introduction to Data Communications and Networking, Wayne Tomasi,
Pearson Education.
REFERENCE BOOKS:
1. Data Communications and Networking, Behrouz A Forouzan, Fourth
Edition.TMH.
2. Computer Communications and Networking Technologies, Gallow, Second
Edition Thomson Computer Networking and Internet, Fred Halsll, Lingana
Gouda Kulkarni, Fifth Edition, Pearson Education
87
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
UNIT- I
BASIC STRUCTURE OF COMPUTERS: Computer types, functional unit, basic
operational concepts, bus structures, multi processors and multi computers, multi
tasking. Register Transfer Language and Micro operations: Register Transfer
language, Register Transfer, Arithmetic Micro operations, Logic Micro operations, Shift
Micro operations, Arithmetic logic shift unit.
UNIT- II
BASIC COMPUTER ORGANIZATION AND DESIGN: Instruction Codes, Computer
Registers, computer instructions – instruction Cycle, memory reference instructions,
input-output and interrupt. Central Processing Unit: Stack organization, instruction
formats, addressing modes, data transfer and manipulation, program control, CISC and
RISC.
UNIT- III
MICROPROGRAMMED CONTROL: Control memory, address sequencing, micro
program example, design of control unit, hardwired control, micro programmed control.
88
THE MEMORY ORGANIZATION: Memory hierarchy, Main Memory, Cache memory,
performance considerations, virtual memory, secondary storage.
UNIT- IV
COMPUTER ARITHMETIC: Addition and subtraction, multiplication algorithms,
Division algorithms, floating-point arithmetic operations, Decimal arithmetic unit,
Decimal arithmetic operations.
INPUT-OUTPUT ORGANIZATION: Peripheral devices, input-output interface,
asynchronous data transfer, modes of transfer, priority interrupt, direct memory access.
UNIT- V
PIPELINE AND VECTOR PROCESSING: Parallel Processing, Pipelining, Arithmetic
Pipeline, Instruction pipeline, RISC pipeline Vector Processing, Array Processors.
TEXT BOOKS:
1. Computer System Architecture – M. Morris Mano, III edition, Pearson/PHI
2. Computer organization – Carl Hamacher, Zvonks Vranesic, Safeazaky, V
edition, Mc Graw Hill
REFERENCE BOOKS:
1. Computer Organization and Architecture – William Stallings Sixth edition,
Pearson/PHI
2. Fundamentals of Computer Organization and Design, Sivarama Dandamudi
3. Computer Architecture a Quantitative approach, John L. Hennessy and David
A Patterson, Fourth edition Elsevier.
4. Computer Architecture Fundamentals and Principles of Computer Design,
Joseph D/ Dumas II, BS Publication
89
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
90
UNIT- III
Dynamic Programming: General method, Principle of optimality, applications-
Multistage graphs, 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- Recursive Permutation Generator ,N-
queen problem, sum of subsets problem, Graph coloring, Hamiltonian cycles.
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 NP Complete classes, Cook’s theorem.
TEXT BOOKS:
1. Fundamentals of Computer Algorithms, Ellis Horowitz, Satraj Sahni and
Rajasekharam, Galgotia publications pvt. Ltd.
2. Introduction to Algorithms, second edition, T.H.Cormen, C.E.Leiserso
R.L.Rivest,and C.Stein, PHI Pvt. Ltd./ Pearson Education
REFERENCE BOOKS:
1. Algorithm Design: Foundations, Analysis and Internet examples
M.T.Goodrich and R.Tomassia,John wiley and sons.
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
91
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
92
UNIT – III
Introduction to the Relational Model – Structure of RDBMS - Integrity Constraints over
Relations – Enforcing Integrity Constraints – Querying Relational Data - Relational
Algebra and Calculus.
Introduction to SQL- Data Definition commands, Data Manipulation Commands, Basic
Structure, Set operations Aggregate Operations - Join operations - Sub queries and
correlated queries, SQL functions , views ,Triggers, Embedded SQL.
UNIT – IV
Functional Dependencies– Introduction , Basic Definitions, Trivial and Non trivial
dependencies, closure of a set of dependencies, closure of attributes, irreducible set of
dependencies- Schema Refinement in Database Design- Problems Caused by
Redundancy – Decompositions – Problem Related to Decomposition –- Lossless Join
Decomposition – Dependency Preserving Decomposition - FIRST, SECOND, THIRD
Normal Forms – BCNF –– Multivalued Dependencies – Fourth Normal Form.
UNIT-V
Transaction concept- Transaction state- Implementation of atomicity and Durability-
Concurrent executions – Serializability, Recoverability
Lock Based Protocols, Timestamp Based Protocols, Validation Based Protocols,
Multiple Granularity, Dead Lock Handling – Failure Classification – Storage Structure -
Recovery and Atomicity- Log Based recovery – Recovery with concurrent transactions
– Checkpoints .
File Organization – Organization of records in file - Data Dictionary Storage – Indexing
and Hashing – Basic Concepts , Ordered Indices,B+Tree Index files, B- tree index files
– Static Hashing – Dynamic Hashing – Comparision of Indexing with Hashing.
TEXT BOOKS:
1. Database System Concepts, Silberschatz, Korth , Fifth Edition, McGraw hill (
1,2,3 & 5 Units)
2. Database Management Systems, Raghuramakrishnan, Johannes Gehrke,
TATA Mc Graw Hill (1,2,3 & 5 Units)
3. Introduction to Database Systems, C.J.Date, Pearson Education (4th Unit)
REFERENCE BOOKS:
1. Fundamentals of Database Systems, Elmasri Navrate Pearson Education
2. Data base Systems design, Implementation, and Management, Peter Rob &
Carlos Coronel 7th Edition.
93
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
Course Outcomes:
Upon completion of this course, students should be able to:
1. Design/Develop Program
2. Implement Program
3. Test Program
4. Validate Program
UNIT-I
Fundamentals of Object Oriented programming: Object oriented paradigm - Basic
concepts of Object Oriented Programming - Benefits of OOP - Applications of OOP
Java Evolution: Java Features - How Java differs from C and C++ - Java and Internet
- Java and World Wide Web - Web Browsers - Hardware and Software Requirements -
Java Environment. Overview of Java Language: Simple Java Program - Java Program
Structure - Java Tokens- Java Statements - Implementing a Java Program - Java
Virtual Machine - Constants - Variables - Data types - Scope of Variables-Symbolic
Constants-Type Casting and type promotions – Operators, Operator Precedence and
Associativity - Control Statements – break - continue- Arrays-Multi dimensional arrays,
Wrapper Classes - Simple examples.
UNIT-II
Classes: Classes and Objects - Constructors – methods - this keyword – garbage
collection- finalize - Overloading methods and constructors - Access Control- Static
members – nested and inner classes – command line arguments - variable length
arguments.
Inheritance: Forms of inheritance – specialization, specification, construction,
extension, limitation, combination, benefits and costs of inheritance. Super uses- final -
94
polymorphism, method overriding - dynamic method dispatch –abstract classes –
exploring string class.
UNIT-III
Packages and Interfaces: Defining and accessing a package – understanding
CLASSPATH – access protection importing packages – Interfaces - Defining and
implementing an interface, Applying interfaces, Variables in interfaces and extended
interfaces. Exploring java.lang and java.util packages.
Exception Handling-Fundamentals, usage of try, catch, multiple catch clauses, throw,
throws and finally. Java Built in Exceptions and creating own exception subclasses.
UNIT - IVMultithreaded Programming: Java Thread life cycle model – Thread
creation - Thread Exceptions - Thread Priority – Synchronization - Messaging -
Runnable Interface - Interthread Communication - Deadlock - Suspending, Resuming
and stopping threads.
I/O Streams: File – Streams – Advantages - The stream classes – Byte streams –
Character streams.
Networks basics: Socket Programming - Proxy Servers - TCP/IP Sockets - Net
Address - URL - Datagram’s
UNIT – V
Applet Programming: How Applets differ from Applications - Applet Life Cycle -
Creating an Applet - Running the Applet- Designing a Webpage - Applet Tag - Adding
Applet to HTML file - More about Applet Tag - Passing parameters to Applets - Aligning
the display.
Event handling: basics of event handling, Event classes, Event Listeners, delegation
event model, handling mouse and keyboard events, adapter classes, AWT Class
hierarchy - AWT Controls - Layout Managers and Menus, limitations of AWT, Swing,
MVC architecture, components, containers, exploring swing.
TEXT BOOKS:
1. The Complete Reference Java J2SE 5th Edition, Herbert Schildt, TMH
Publishing Company Ltd, NewDelhi.
2. 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.
95
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
Roadway Travels
"Roadway Travels" is in business since 1997 with several buses connecting different
places in India. Its main office is located in Hyderabad.
The company wants to computerize its operations in the following areas:
• Reservations and Ticketing
• Cancellations
Reservations & Cancellation:
Reservations are directly handled by booking office. Reservations can be made 30 days in
advance and tickets issued to passenger. One Passenger/person can book many tickets
(to his/her family).
Cancellations are also directly handed at the booking office.
In the process of computerization of Roadway Travels you have to design and develop
a Database which consists the data of Buses, Passengers, Tickets, and Reservation and
96
cancellation details. You should also develop query's using SQL to retrieve the data from the
database.
The above process involves many steps like
1. Analyzing the problem and identifying the Entities and Relationships
2. E-R Model
3. Relational Model
4. Normalization
5. Creating the database
6. Querying.
Students are supposed to work on these steps TASK wise and finally create a
complete "Database System" to Roadway Travels. Examples are given at every TASK for
guidance to students.
TASK 1: E-R Model
Analyze the problem carefully and come up with the entities in it. Identify what data has to
be persisted in the database. This contains the entities, attributes etc.
Identify the primary keys for all the entities. Identify the other keys like candidate keys, partial
keys, if any.
Note: The student is required to submit a document by writing the Entities and
Keys to the lab teacher.
TASK 2: Concept design with E-R Model
Relate the entities appropriately. Apply cardinalities for each relationship. Identify strong
entities and weak entities (if any). Indicate the type of relationships (total / partial). Try
to incorporate generalization, aggregation, specialization etc wherever required.
Note: The student is required to submit a document by drawing the E-R Diagram
to the lab teacher.
TASK 3: Relational Model
Represent all the entities (Strong, Weak) in tabular fashion. Represent relationships in a
tabular fashion. There are different ways of representing relationships as tables based on
the cardinality. Represent attributes as columns in tables or as tables based on the
requirement. Different types of attributes (Composite, Multi-valued, and Derived) have
different way of representation.
Note: The student is required to submit a document by Represent relationships in a
tabular fashion to the lab teacher.
TASK 4: Normalization
Database normalization is a technique for designing relational database tables to minimize
duplication of information and, in so doing, to safeguard the database against certain types
of logical or structural problems, namely data anomalies. For example, when multiple
instances of a given piece of information occur in a table, the possibility exists that these instances
will not be kept consistent when the data within the table is updated, leading to a loss of data
97
integrity. A table that is sufficiently normalized is less vulnerable to problems of this kind,
because its structure reflects the basic assumptions for when multiple instances of the
same information should be represented by a single instance only.
TASK 5: Practicing DDL and DML commands
Create all the normalized tables that are identified in TASK 4.
Insert data into the above tables.
TASK 6: Querying
In this TASK you are going to practice queries (along with sub queries) using ANY, ALL, IN,
Exists, NOT EXISTS, UNION, INTERSECT, Constraints etc.
Practice the following Queries:
1. Display unique PNR_no of all passengers.
2. Display all the names of male passengers.
3. Display the ticket numbers and names of all the passengers.
4. Find the ticket numbers of the passengers whose name start
with V and ends with 'h'.
5. Find the names of passengers whose age is between 30 and 45.
6. Display all the passengers names beginning with 'A'
7. Display the sorted list of passenger’s names.
TASK 7 Querying (continued...)
You are going to practice queries using Aggregate functions (COUNT, SUM, AVG, and MAX
and MIN), GROUP BY, HAVING and Creation and dropping of Views.
8. Write a Query to display the Information present in the Passenger and
cancellation tables. Hint: Use UNION Operator.
9. Display the number of days in a TASK on which the 9WO1 bus is
available.
10. Find number of tickets booked for each PNR_no using GROUP BY
CLAUSE. Hint: Use GROUP BY on PNR_No.
11. Find the distinct PNR numbers that are present.
12. Find the number of tickets booked by a passenger where the
number of seats is greater than 1. Hint: Use GROUP BY, WHERE
and HAVING CLAUSES.
13. Find the total number of cancelled seats.
14. Display the details of passengers who travelled within the last 3 months.
15. Create a view for the details of passengers who cancelled their tickets.
TASK 8: Create tables for the following schema.
Student (snum: integer, sname: string, major: string, level: string, age: integer)
Class (name: string, meets at: time, room: string, fid: integer)
Enrolled (snum: integer, cname: string)
Faculty (fid: integer, fname: string, deptid: integer)
98
TASK 9: Querying
1. Find the names of all Juniors (Level = JR) who are enrolled in a class taught
by I. Teacher.
2. Find the age of the oldest student who is either a History major or is enrolled
in a course taught by I. Teacher.
3. Find the names of all classes that either meet in room R128 or have 5 or
more students enrolled.
4. Find the names of all students who are enrolled in two classes that meet at
the same time.
5. ind the names of faculty members who teach in every room in which some
class is taught.
6. Find the names of faculty members for whom the combined enrollment of
the courses that they teach is less than 5
7. Print the Level and the average age of students for that Level, for each
Level.
8. Print the Level and the average age of students for that Level, for all Levels
except JR.
9. Print the Level and the average age of students for that Level, whose
average age is greater than 20.
10. Find the names of students who are enrolled in the maximum number of
classes.
11. Find the names of students who are not enrolled in any class.
12. Count the number of junior level students.
13. Display all the students whose names start with the letter “p”.
14. Display all the teachers whose names contain letter ‘a’ or ‘I’ in their names.
TASK 10: PL/SQL Programs
1. Program to find sum of first ‘n’ natural no.s
2. Program to find reverse of a number
3. Insert the values of areas of a circle into a table called areas taking radius
Values from 2 to 8.
TASK 11: Cursors
In this TASK you need to do the following: Declare a cursor that defines a result set.
Open the cursor to establish the result set. Fetch the data into local variables as needed
from the cursor, one row at a time. Close the cursor when done. Practice the following
programs using cursors.
1. Write a cursor program to retrieve the details of all students using cursors ( Use
students table in TASK 9)
99
2. Write a PL/SQL block to update the level of students from JL to “junior Level”
and SL to “senior Level”and insert a record in newlevel table.
3. Write a cursor program to display the details of Senior Level students.
TASK 12: Procedures
In this session you are going to learn Creation of stored procedure, Execution of
procedure and modification of procedure. Practice procedures using the above database.
TASK 13: Triggers
In this TASK you are going to work on Triggers. Creation of insert trigger, delete trigger,
update trigger. Practice triggers using the above database.
REFERENCES:
1. Introduction to SQL,Rick F.Vander Lans,Pearson education.
2. Oracle PL/SQL, B.Rosenzweig and E.Silvestrova,Pearson education.
3. Oracle PL/SQL Programming,Steven Feuerstein,SPD.
4. SQL & PL/SQL for Oracle 10g, Black Book, Dr.P.S.Deshpande,Dream Tech.
5. Oracle Database l l g PL/SQL Programming,M.Laughlin.TMH.
6. SQL Fundamentals, J.Patrick,Pearson Education.
100
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
Course Objectives:
1. To analyze worst-case running time of algorithms and understand
fundamental algorithmic problems.
2. To understand how asymptotic notation is used to provide a rough
classification of algorithms, how a number of algorithms for fundamental
problems in computer science and engineering work and compare with one
another.
3. To implement the methods of designing and analyzing algorithms
4. To study about various designing paradigms of algorithms for solving real
world problems.
Course Outcomes: At the end of this laboratory, the students should be able to:
1. To prove the correctness and analyze the running time of the basic
algorithms for those classic problems.
2. To design algorithms using the dynamic programming, greedy method,
Backtracking, Branch and Bound strategy that employ this strategy
3. To compare, contrast, and choose appropriate algorithmic design techniques
to present an algorithm that solves a given problem.
4. To develop the efficient algorithms for the new problem with suitable
designing techniques.
TASK 1:
1. A). WAP for Iterative and Binary Search.
B). Print all the nodes reachable from a given starting node in a digraph using
BFS method.
C). Check whether a given graph is connected or not using DFS method.
TASK 2:
2. A). Sort a given set of elements using the Quicksort method. Repeat the
TASK for different values of n, the elements can be read from a file or can be
generated using the random number generator.
B). Sort a given set of elements using the Mergeksort method. Repeat the
TASK for different values of n, the elements can be read from a file or can be
generated using the random number generator.
TASK 3:
3. A). WAP for Sreassen Matrix Multiplication.
101
B). Implement 0/1 Knapsack problem Using Greedy Method Algorithm.
TASK 4:
4. Find Minimum cost spanning tree using Prims & Kruskals algorithm.
TASK 5:
5. From a given vertex in a weighted connected graph, find shortest paths to
other vertices using Dijkstra's algorithm.
TASK 6:
6. WAP for Haffman Coding.
TASK 7:
7. WAP for Multi Stage Graph problem to find optimal path between source and
destination.
TASK 8:
8. Implement Matrix Chain Mulplication algorithm.
TASK 9:
9. WAP to find Optimal Binary Search Tree.
TASK 10:
10. Implement solution for TSP problem using Dynamic Programming Technique.
TASK 11:
11. A). Implement n-Queens problem using Backtracking.
B). WAP for Hamiltonian Cycle Problem
TASK 12:
12. Implement the solution for TSP problem using Branch & Bound technique.
102
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
TEXT BOOKS:
1. The Complete Reference Java J2SE, 5th Edition, Herbert Schildt , TMH.
2. Core Java 2 Volume I Fundamentals, 5th Edition. Cay S.Horstmann, Gary
Cornell , PHI,2000.
3. The Java Programming Language - Second Edition, K. Arnold and J. Gosling
, Addison Wesley, 1996.
105
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
106
Creating an architectural design: software architecture, data design, architectural styles
and patterns, architectural design
UNIT- IV
Test Strategies: A strategic approach to software testingBlack box and White box
Testing, Validation Testing, System Testing, Product Metrics, Software Quality, Metrics
for analysis model, Metrics for design model, Metrics for source code, Metrics for
testing, Metrics for maintenance Metrics for process and products Software
measurement, Metrics for software quality
UNIT- V
Risk Management: Reactive vs. proactive risk strategies, Software risks, Risk
identification, Risk projection Risk refinement, RMMM, RMMM plan Quality
Management, Quality concepts, Software quality assurance, Software reviews, Formal
technical reviews, Statistical Software Quality Assurance, Software reliability, ISO 9000
Quality standards
TEXT BOOKS:
1. Roger S.Pressman, Software engineering- A practitioner’s Approach,
McGraw-Hill International Edition, 5th edition, 2001.
REFERENCE BOOKS:
1. Ian Sommerville, Software engineering, Pearson education Asia, 6th edition,
2000.
2. Pankaj Jalote- An Integrated Approach to Software Engineering,Springer
Verlag, 1997.
3. James F Peters and Witold Pedryez, “Software Engineering – An Engineering
Approach”, John Wiley and Sons,New Delhi, 2000.
4. Ali Behforooz and Frederick J Hudson, “Software Engineering \
Fundamentals”, Oxford University Press, New Delhi, 1996.
107
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
109
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
111
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
Course Outcomes:
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, Preprocessing steps required for
predictive parsing.
Bottom up parsing: Shift Reduce parsing, LR and LALR parsing, Error recovery in
parsing, handling ambiguous grammar, YACC – automatic parser generator.
112
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, folding, 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
Object code generation: Object code forms, machine dependent code optimization,
register allocation and assignment generic code generation algorithms, DAG for
register allocation.
TEXTBOOKS:
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.
3. Systems programming and operating systems – D.M Dhamdhere, 2nd
edition,tata McGraw-hill publishing comp pvltd.
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.
113
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
UNIT- I
INTRODUCTION
Introduction: Usage of Graphics and their applications, Presentation Graphics-
Computer Aided Design- Computer Art- Entertainment- Education and Training-
Visualization- Image Processing- Graphical User Interfaces
Over view of Graphics systems: Video Display Devices- Raster Scan systems-random
scan systems-Graphics monitors and workstations-Input devices-hard copy devices-
Graphics software
Output primitives: Points and Lines-Line Drawing Algorithms- Loading the Frame
buffer- Line function- Circle- Generating Algorithms- Ellipse Generating Algorithms-
Other Curves- Parallel Curve Algorithms-Curve Functions-Pixel Addressing- Filled
Area Primitives-Filled Area Functions- Cell Array- Character Generation
Attributes of Output Primitives: Line and Curve Attributes-Color and Gray scale levels-
Area Fill Attributes- Character Attributes-Bundled Attributes- Inquiry Functions-Ant
aliasing
UNIT- II
TWO DIMENSIONAL GEOMETRICALTRANSFORMATION AND VIEWING
Two dimensional geometric transformations - Matrix representations and
homogeneous coordinates, composite transformations; Two dimensional viewing -
viewing pipeline, viewing coordinate reference frame; widow-to-viewport coordinate
114
transformation, Cohen -Sutherland-and Cyrus-beck line clipping
algorithms,Southerland-Hodgeman polygon clipping algorithm.
UNIT- III
THREE DIMENSIONAL OBJECT REPRESENTATION
Three dimensional concepts; Three dimensional object representations - Polygon
surfaces - Polygon tables - Plane equations - Polygon meshes; Curved Lines and
surfaces, Quadratic surfaces; Blobby objects; Spline representations - Bezier curves
and surfaces - B-Spline curves and surfaces
UNIT- IV
THREE DIMENSIONAL GEOMETRICAL TRANSFORMATION AND VIEWING
Three dimensional geometric and modeling transformations - Translation, Rotation,
Scaling, composite transformations; Three dimensional viewing - viewing pipeline,
viewing coordinates, Projections, Clipping; Visible surface detection methods: Depth
buffer, scan line, Depth sorting, BSP-tree methods, Area sud-division and octree
methods
UNIT- V
COMPUTER ANIMATION
Design of Animation Sequence, General computer Animation functions, Raster
animation, Computer animation languages, key frame systems, motion specifications
TEXT BOOKS:
1. Donald Hearn & M. Pauline Baker, "Computer Graphics", Pearson Education,
2nd Edition, 2003
2. “Computer graphics principles &practice”, second edition in c, foley,
VanDam, Feiner and Hughes, Pearson Education
3. Computer Graphics Peter Shirley & Steve Marschner Indian Edition
CENGAGE Learning.
4. Computer Graphics C Version by Donald Hearn & M. Pauline Baker, Pearson
Education, New Delhi, 2004
REFERENCE BOOKS:
1. “Procedural elements for Computer Graphics”, David Rogers, Tata McGraw
hill,2nd edition
2. “Computer Graphics”, Steven Harington, TMH
3. “Principles of interactive Computer Graphics” Neuman and sproul,TMH
115
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
UNIT II
CPU Scheduling: Basic Concepts, Scheduling Criteria, Scheduling Algorithms and
evaluation, Threads Overview, Threading issues.
Concurrency: Principles of Concurrency, Mutual Exclusion, Software and hardware
approaches, Semaphores, Monitors, Message Passing, Classic problems of
synchronization.
116
UNIT III
Principles of deadlock: System Model, Deadlock Characterization, Methods for
handling Deadlocks, Deadlock Prevention, Deadlock avoidance, Deadlock detection,
Recovery from Deadlocks, Dining philosopher’s problem.
UNIT IV
Memory Management: Basic concepts, Swapping, Contiguous memory allocation,
Paging, Segmentation, Virtual memory, Demand paging, Page-replacement
algorithms, Thrashing.
Secondary storage structure: Disk structure; Disk scheduling, Disk management,
Swap-space Management, RAID structure, Stable-storage Implementation, Tertiary-
Storage Structure
I/O systems: I/O hardware, Application I/O interface, Kernel I/O subsystem,
Transforming I/O request to hardware operations, STREAMS
UNIT V
File Management: File system-File concepts, Access methods, Directory structure,
File system mounting, File sharing and Protection. Implementing file systems-File
system structure and implementation, Directory implementation, Allocation methods,
Free-space management, Efficiency and performance
Security: Security threats, Protection, Intruders, Viruses, Trusted System.
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.
3. “An Introduction to Operating Systems, Concepts and Practice”, PHI, 2003 -
Pramod Chandra P. Bhat.
4. Operating Systems – A concept based approach – DM Dhamdhere – 2nd
Edition TMH
117
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
PART-B
COMPILER DESIGN
Consider the following mini Language, a simple procedural high-level language, only
operating on
integer
data, with a syntax looking vaguely like a simple C crossed with Pascal. The syntax of
the language is
defined by the following BNF grammar:
<program> ::= <block>
<block> ::= { <variabledefinition><slist> }
| { <slist> }
<variabledefinition> ::= int <vardeflist> ;
<vardeflist> ::= <vardec> | <vardec> , <vardeflist>
<vardec> ::= <identifier> | <identifier> [ <constant> ]
<slist> ::= <statement> | <statement> ; <slist>
<statement> ::= <assignment> | <ifstatement> | <whilestatement>
| <block> | <printstatement> | <empty>
<assignment> ::= <identifier> = <expression>
| <identifier>[ <expression> ] = <expression>
<ifstatement> ::= if <bexpression> then <slist> else <slist> endif
| if<bexpression> then <slist> endif
<whilestatement> ::= while <bexpression> do <slist> enddo
<printstatement> ::= print ( <expression> )
<expression> ::= <expression><addingop><term> | <term> | <addingop><term>
<bexpression> ::= <expression><relop><expression>
<relop> ::= < | <= | == | >= | > | !=
119
<addingop> ::= + | -
<term> ::= <term><multop><factor> | <factor>
<multop> ::= * | /
<factor> ::= <constant> | <identifier> | <identifier> [ <expression>]
| ( <expression> )
<constant> ::= <digit> | <digit><constant>
<identifier> ::= <identifier><letterordigit> | <letter>
<letterordigit> ::= <letter> | <digit>
<letter> ::= a|b|c|d|e|f|g|h|i|j|k|l|m|n|o|p|q|r|s|t|u|v|w|x|y|z
<digit> ::= 0|1|2|3|4|5|6|7|8|9
<empty> has the obvious meaning
Comments (zero or more characters enclosed between the standard C/Java-style
comment brackets /
*...*/) can be inserted. The language has rudimentary support for 1-dimensional arrays.
The declaration
int a[3] declares an array of three elements, referenced as a[0], a[1] and a[2]. Note also
that you should
worry about the scoping of names.
A simple program written in this language is:
{ int a[3],t1,t2;
t1=2;
a[0]=1; a[1]=2; a[t1]=3;
t2=-(a[2]+t1*6)/(a[2]-t1);
if t2>5 then
print(t2);
else {
int t3;
t3=99;
t2=-25;
print(-t1+t2*t3); /* this is a comment
on 2 lines */
} endif }
TASK 17
Design a Lexical analyzer for the above language. The lexical analyzer should ignore
redundant spaces, tabs and newlines. It should also ignore comments. Although the
syntax specification states that identifiers can be arbitrarily long, you may restrict the
length to some reasonable value.
120
TASK 18
Implement the lexical analyzer using JLex, flex or lex or other lexical analyzer
generating tools.
TASK 19
Design Predictive parser for the given language
Design LALR bottom up parser for the above language.
TASK 20
Convert the BNF rules into Yacc form and Write code to generate abstract syntax tree.
TASK 21
Write program to generate machine code from the abstract syntax tree generated by
the parser
TASK 22
Write a Yacc Program to construct a parse tree for the given grammar
Write a Lex program to construct a lexical analyzer
TEXT BOOKS:
1. Unix System Programming using C++, T.Chan, PHI.
2. Unix Concepts and Applications, 4th Edition, Sumitabha Das, TMH,2006.
3. Beginning Linux Programming, 4th Edition, N.Matthew, R.Stones,Wrox,
Wiley India Edition,rp-2008
4. Principles of compiler design-A.V.Aho,J.D.Ullman;Pearson Education.
5. Modern Compiler Implementation in C-Andrew N. Appel,Cambridge.
REFERENCE BOOKS:
1. Linux System Programming, Robert Love, O’Reilly, SPD.
2. Advanced Programming in the Unix environment, 2nd Edition, W.R.Stevens,
Pearson Education.
3. Unix Network Programming, W.R.Stevens, PHI.
4. Unix for programmers and users, 3rd Edition, Graham Glass, King Ables,
Pearson Education.
121
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
123
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
III Year B.Tech IT– I SEM L T/P/D C
0 3 2
(13CSE105) OPERATING SYSTEMS AND COMPUTER NETWORKS
LABORATORY
Course Objectives:
1. General understanding of structure of modern computers and Operating
Systems.
2. Understanding the Purpose, structure and functions of operating systems
3. Illustration of key OS functions through C programming with examples
4. Introduce the concept of computer networks and its topologies to the
students
5. Involve students in analytical studies of Computer Networks through C
programming.
Course Outcomes:
Upon completion of the course, the students are expected to:
1. Identifying the working methodology of multithreaded applications
2. Determining the reasons of deadlocks, and their remedial measures in an
operating system.
3. Learning the management of different type of memories techniques in the
computer system.
4. Knowing the management of different type of memories techniques in the
computer system.
5. Analyzing why networks need security and control, what errors might occur,
and how to control network errors.
OPERATING SYSTEMS LAB
1. Simulate the following CPU scheduling algorithms
a) Round Robin b) SJF c) FCFS d) Priority
2. Simulate the following algorithms
a) Best fit b) worst fit c) first fit
3. Simulate the following file allocation strategies
a) Sequential b) Indexed c) Linked
4. Simulate algorithms for deadlock avoidance and deadlock detection
5. Simulate the following page replacement algorithms
a) FIFO b) Optimal c) LRU
6. Simulate the following disk scheduling algorithms
a) FCFS b) SCAN c) CSCAN d) LOOK
COMPUTER NETWORKS LAB
124
7. Implement the data link layer framing methods such as character, character
stuffing and bit stuffing.
8. Implement on a data set of characters the three CRC polynomials – CRC 12,
CRC 16 and CRC CCIP.
9. Implement Dijkstra‘s algorithm to compute the Shortest path thru a graph.
10. Take an example subnet graph with weights indicating delay between nodes.
Now obtain Routing table at each node using distance vector routing
algorithm
11. Take a 64 bit plain text and encrypt the same using DES algorithm.
12. Using RSA algorithm encrypt a text data and Decrypt the same.
125
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
126
UNIT- IV
Paths, Path products and Regular expressions: Path products & path expression-
reduction procedure- applications- regular expressions & flow anomaly detection.
Logic Based Testing: Overview decision tables-path expressions, k-v charts.
State, state graphs and transition testing: state graphs, good and bad state graphs,
state testing, testability tips
UNIT- V
Graph Matrices and applications: motivational over view, matrix of graph, relations,
power of matrix, node reduction algorithm.
People and organizational issues in testing: Organization structures for testing
teams – testing services - Test Planning – Test Plan Components – Test Plan
Attachments – Locating Test Items – test management – test process- bug detection
life cycle.
TEXT BOOKS:
1. “Software Testing – Principles and Practices”, Srinivasan Desikan and
Gopalaswamy Ramesh, Pearson education, 2006.
2. “Software Testing Techniques”, Boris Beizer, 2nd Edition, Van Nostrand
Reinhold, New York, 1990
REFERENCE BOOKS:
1. “Software Testing”, Ron Patton, Second Edition, Sams Publishing, Pearson
education, 2007
2. “Software Testing – Effective Methods, Tools and Techniques”, Renu Rajani,
Pradeep Oak, Tata McGraw Hill, 2004.
3. “Software Testing in the Real World – Improving the Process”, Edward Kit,
Pearson Education, 1995.
4. “Foundations of Software Testing – Fundamental algorithms and techniques”,
Aditya P. Mathur, Dorling Kindersley (India) Pvt. Ltd., Pearson Education,
2008
127
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING AND TECHNOLOGY
Course Outcomes:
TEXT BOOKS:
1. Data mining: Concepts and Techniques, Jiawei Han and Micheline Kamber,
2nd Edition, Elsevier, 2006.
REFERENCE BOOKS:
1. Introduction to data mining, Pang-Ning Tan, Michael Steinbach, Vipin Kumar,
Addison-Wesley, 2005. ISBN: 0321321367.
2. Mining Introductory and advanced topics –MARGARET H DUNHAM,
PEARSON EDUCATION
3. Lecture Notes on Data Mining, Micheal W.Berry, Murray Browne, World
Scientific Publishing Co
4. Data Mining Techniques – ARUN K PUJARI, University Press.
5. Data Mining for Association Rules and Sequential Patterns: Sequential and
Parallel Algorithms, Jean-Marc Adamo, ISBN: 0387950486
6. The Data Warehouse Life cycle Tool kit – RALPH KIMBALL WILEY
STUDENT EDITION.
7. Data Warehousing in the Real World – SAM ANAHORY & DENNIS
MURRAY. Pearson Edn Asia.
129
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING AND TECHNOLOGY
UNIT-III:
Data types: Introduction, primitive, character, user defined, array, associative, record,
130
union, pointer and reference types, design and implementation uses related to these
types. Names, Variable, concept of binding, type checking, strong typing, type
compatibility, named constants, variable-initialization.
Expressions and Statements: Arithmetic relational and Boolean expressions, Short
circuit evaluation mixed mode assignment, Assignment Statements, Control Structures
– Statement Level, Compound Statements, Selection, Iteration, Unconditional
Statements, guarded commands.
UNIT-IV:
Subprograms and Blocks: Fundamentals of sub-programs, Scope and lifetime of
variable, static and dynamic scope, Design issues of subprograms and operations,
local referencing environments, parameter passing methods, overloaded sub-
programs, generic sub-programs, parameters that are sub-program names, design
issues for functions user defined overloaded operators,co-routines.
Abstract Data types: Abstractions and encapsulation, introductions to data
abstraction, design issues, language examples, C++ parameterized ADT, object
oriented programming in small talk, C++, Java, C#, Ada 95 Concurrency: Subprogram
level concurrency, semaphores, monitors, massage-passing,Java-threads,C#threads.
UNIT-V:
Exception handling : Exceptions, exception Propagation, Exception handler in Ada,
C++ and Java.
Logic Programming Language: Introduction and overview of logic programming,
basic
elements-of-prolog-,application-of-logic-programming.
Functional Programming Languages: Introduction, fundamentals of FPL, LISP, ML,
Haskell, application of Functional Programming Languages and comparison of
functional and imperative Languages.
TEXT BOOKS:
1. Concepts of Programming Languages Robert .W. Sebesta 6/e, Pearson
Education.
2. Programming Languages –Louden, Second Edition, Thomson.
REFERENCE BOOKS:
1. Programming languages –Ghezzi, 3/e, John Wiley
2. Programming Languages Design and Implementation – Pratt and Zelkowitz, Fourth
Edition PHI/Pearson Education
3. Programming languages –Watt, Wiley Dreamtech
4. LISP Patric Henry Winston and Paul Horn Pearson Education.
5. Programming in PROLOG Clocksin, Springer
131
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING AND TECHNOLOGY
132
UNIT-IV
Basic Behavioral Modeling-II: Use cases, Use case diagrams, Activity diagrams,
Common modeling techniques.
Advanced Behavioral Modeling: Events and signals, state machines, processes and
Threads, time and space, state chart diagrams, Common modeling techniques.
UNIT-V
Architectural Modeling: Component, Deployment, Component diagrams, Deployment
diagrams, Common modeling techniques.
Case Studies
TEXT BOOKS
1. Grady Booch, James Rumbaugh, Ivar Jacobson: The Unified Modeling
Language User Guide, Pearson Education.
2. Hans-Erik Eriksson, Magnus Penker, Brian Lyons, David Fado: UML 2
Toolkit, WILEY-Dreamtech India Pvt. Ltd.
REFERENCS
1. Meilir Page-Jones: Fundamentals of Object Oriented Design in UML,
Pearson Education.
2. Atul Kahate: Object Oriented Analysis & Design, the McGraw-Hill.\
3. Mark Priestley: Practical Object-Oriented Design with UML,TATA McGrawHill
4. Appling UML and Patterns: An introduction to Object – Oriented Analysis and
Design and Unified Process, Craig Larman, Pearson Education.
133
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING AND TECHNOLOGY
UNIT I
General definitions of mini computers, Microprocessors, Micro controllers, and Digital
Signal Processors. Introduction to 8085 Microprocessor, Architecture of 8086
Microprocessor, Addressing modes of 8086, Instruction set of 8086.
UNIT II
Assembler directives, simple assembly language programs, procedures, and macros.
Pin diagram of 8086-Minimum mode and maximum mode of operation, Memory and
1/0 organization of 8086.
UNIT III
8255 PPI – various modes of operation and interfacing to 8086, D/A and A/D converter
to 8086 using 8255, memory interfacing to 8086.
UNIT IV
Serial Communication standards, serial data transfer schemes, 8251 USART
architecture and interfacing, RS-232, IEEE 488 standards. Interrupt structure of 8086,
Interrupt Vector Table, Need for 8259 Programmable Interrupt Controller.
134
UNIT V
Introduction to Microcontrollers, 8051 Microcontroller Architecture, I/O ports, memory
organization, counters and Timers, Serial data Input/Output, Interrupts. Addressing
modes, Instruction set of 8051, Simple programs.
TEXT BOOKS:
1. Microprocessors and interfacing – Douglas V. Hall, TMH, 2nd Edition, 1999.
2. The 8051 microcontrollers and embedded systems- Mazidi and mazidi, PHI,
2000.
REFERENCE BOOKS:
1. Micro computer systems, The 8086/8088 Family Architecture, Programming
and Design – Y.Liu and G.A. Gibson, PHI, 2nd edition.
2. Advanced microprocessors and Peripherals – A.K.Ray and K.M.Bhurchandi,
TMH, 2000.3. Micro
Computer System 8086/8088 Family Architecture Programming and Design –
By Liu and GA Gibson PHI, 2ndEdition
4. Microcontrollers and Applications, Ajay. V. Deshmukh, TMGH, 2005.
5. The 8085 Microprocessor: Architecture Programming and Interfacing –
K.Uday Kumar, B.S Umashankar, Pearson, 2008
135
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
III Year B.Tech CSE, IT – II SEM L P C
3 0 3
Open Elective (13ITD011)GREEN IT
Course Objectives:
1. Learn concepts of Trends and which has led to go green.
2. Identify and implement environmentally sound techniques to preserve power.
3. To analyze different techniques and technologies that will enhance Green IT
initiatives and to create Data centre Design & Redesign
4. To understand the purpose and application of virtualization technology.
5. To Know about Data Replication methods and Disk Technology Advancements.
Course Outcomes:
Upon completion of this course, students should be able to:
1. To Know the global green mantra is “Reduce, Reuse, Recycle.”.
2. To illustrate the importance of managing the E-waste.
3. To know how to Minimizing Power Issues, Cooling, Changing the way we work.
4. Understand concepts of Greening Process to redesign green Datacentre.
5. To recognize the need for virtual server implementation & desktop virtualization
and understand about Data Replication and Disk Technology
Advancements
Unit -I
Trends and Reasons to Go Green:
Overview and Issues, Problems, Cost savings, Current Initiatives and standards,
Global Initiatives
Unit- II
Consumption Issues
Minimizing Power Issues, Cooling, Changing the way we work, Going Paper less,
Recycling, Hardware Considerations,
Unit- III
The Greening Process
Data Center Design and Redesign, Greening your Information Systems, Staying Green
Unit- IV
Virtualization
Virtual Server Implementation Plan, Desktop Virtualization, Benefits, Desktop access,
Virtual Printing,
136
Unit -V
Data Replication and Disk Technology Advancements
Data Replication Methods, Disk Technology Advancements, The Green data Center,
Cloud Computing, Remote Monitoring
TEXT BOOKS:
1. Green IT-Reduce your information system’s Environmental Impact while
adding to the bottom line Toby J Velte, Anthony T Velte, Robert Elsenpeter
– McGrahill Publications, 2008
2. Foundation Of Green It, Consolidation, Virtualization, Efficiency, and Roi in
the Data Center, Marty Poniatowski- Prentice Hall Publications
REFERENCE BOOKS:
1. Green Computing and Green IT Best Practices on Regulations and Industry
Initiatives, Virtualization, Power Management, Materials Recycling and
Telecommuting By Jason Harris.
2. Green IT for Sustainable Business Practice- Mark G. O’ Neil, BCS The
chartered institute for IT
3. The Greening of IT: How Companies Can Make a Difference for the
Environment, John P. Lamb, Kindle Edition, IBM Press 2009.
137
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
138
Project Work :( Field Work, Case Studies)
The project/fieldwork is meant for students to understand vulnerabilities and to work on
reducing disaster risks and to build a culture of safety. Projects must be conceived
creatively based on the geographic location and hazard.
140
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
141
Protection of Geographical Indications at national and International levels – Application
Procedures..
UNIT-III
International convention relating to Intellectual Property – Establishment of WIPO –
Mission and Activities – History – General Agreement on Trade and Tariff (GATT).
UNIT-IV
Indian Position Vs WTO and Strategies – Indian IPR legislations – commitments to
WTO-Patent Ordinance and the Bill – Draft of a national Intellectual Property Policy –
Present against unfair competition.
UNIT-V
Case Studies on – Patents (Basumati rice, turmeric, Neem, etc.) – Copyright and
related rights – Trade Marks – Industrial design and Integrated circuits – Geographic
indications – Protection against unfair competition.
TEXT BOOKS:
1. Subbaram N.R. “Handbook of Indian Patent Law and Practice “, S.
Viswanathan Printers and Publishers Pvt. Ltd., 1998.
REFERENCE BOOKS:
1. P. Narayanan; Law of Copyright and Industrial Designs; Eastern law House,
Delhi, 2010
2. Prabhuddha Ganguli: ‘ Intellectual Property Rights” Tata Mc-Graw –Hill, New
Delhi
3. M.Ashok Kumar and Mohd.Iqbal Ali: “Intellectual Property Right” Serials Pub.
142
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
143
UNIT - IV
BIO-MASS & DEC
Principles of Bio-Conversion, Anaerobic/aerobic digestion, Types of Bio-gas Digesters,
gas yield, Combustion characteristics of bio-gas, Utilization for cooking, Economic
aspects.
Direct Energy Conversion, Need for DEC, Principles of DEC, Carnot Cycle and
Limitations.
UNIT - V
HARNESSING GEOTHERMAL ENERGY & OCEAN ENERGY
Resources of Geothermal Energy, Types of wells, Methods of harnessing the energy,
potential in India, Ocean Thermal Energy Conversion, Principles, Utilization, Setting of
OTEC plants, Thermodynamic cycles, Tidal and Wave energy: Potential and
Conversion Techniques, Mini-Hydel Power plants.
TEXT BOOKS:
1. Non-Conventional Energy Sources by G.D.Rai, Khanna Publishers.
2. Renewable Energy Resources by Twidell and Wier, CRC Press (Taylor and
Francis).
3. Non- Conventional energy resources by B.H.Khan, Tata Mc Graw-Hill, 2006.
REFERENCE BOOKS:
1. Renewable Energy Resources by Tiwari and Ghosal, Narosa.
2. Renewable Energy Technologies by Ramesh and Kumar, Narosa.
3. Non-Conventional Energy Systems by K Mittal, Wheeler Publishing House.
4. Renewable Energy Sources and Emerging Technologies by D.P.Kothari,
K.C.Singhal, PHI.
144
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
145
TELEMATICS:
Global positioning systems, geographical information systems, navigation systems,
automotive vision system, road recognition, driver assistance systems.
UNIT-V:
SECURITY SYSTEMS:
Anti theft technologies, smart card system, number plate coding.
COMFORT SYSTEMS:
Active suspension systems, requirement and characteristics, different types, power
steering, collapsible and tiltable steering column, power windows.
TEXT BOOKS:
1. “Modern Electric, Hybrid Electric and Fuel Cell Vehicles Fundamentals,
Theory and Design”, Mehrdad Ehsani, Yimin Gao, sebastien E. Gay and Ali
Emadi: CRS Press, 2004.
REFERENCE BOOKS:
1. “Automotive Hand Book” Robert Bosch, SAE, 5th edition, 2000.
2. “Intelligent Vehicle Technologies”, Ljubo Vlacic, Michel Parent and Fumio
Harashima, Butterworth-Heinemann publications, Oxford, 2001.
3. “Navigation and Intelligent Transportation Systems – Progress in
Technology”, Ronald K Jurgen, Automotive Electronics Series, SAE, USA,
1998.
146
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
Course Outcomes:
1. To understand the real time case studies and develop UML diagrams like
class ,use case, interaction, activity, state chart, component & deployment
diagrams using concepts.
2. To develop a design diagrams for their mini project.
3. Apply fundamental knowledge of Testing in Real time scenarios.
4. Test a webpage and server.
5. Understand and Applying the Techniques in Software Development Life
cycle.
SYLLABUS
PART I:
The student should take up the case study of unified Library application as mentioned
in the theory and model it in different views i:e Use case view, Logical view,
Component view, Deployment view, Database Design, Forward & Reverse engineering
and generation of documentation of the project
PART II:
Students are asked to draw the following diagrams using UML for an ATM system
whose description is given below.
UML diagrams to be developed are:
1. Use Case Diagram.
2. Class Diagram.
147
3. Sequence Diagram.
4. Collaboration Diagram.
5. State Diagram
6. Activity Diagram.
7. Component Diagram
8. Deployment Diagram.
9. Test Design.
Description for an ATM System
The software to be designed will control a simulated automated teller machine (ATM)
having a magnetic stripe reader for reading an ATM card, a customer console
(keyboard and display) for interaction with the customer, a slot for depositing
envelopes, a dispenser for cash (in multiples of Rs. 100, Rs. 500 and Rs. 1000), a
printer for printing customer receipts, and a key-operated switch to allow an operator to
start or stop the machine. The ATM will communicate with the bank's computer over an
appropriate communication link. (The software on the latter is not part of the
requirements for this problem.)
The ATM will service one customer at a time. A customer will be required to insert an
ATM card and enter a personal identification number (PIN) - both of which will be sent
to the bank for validation as part of each transaction. The customer will then be able to
perform one or more transactions. The card will be retained in the machine until the
customer indicates that he/she desires no further transactions, at which point it will be
returned - except as noted below.
The ATM must be able to provide the following services to the customer:
1. A customer must be able to make a cash withdrawal from any suitable account
linked to the card, in multiples of Rs. 100 or Rs. 500 or Rs. 1000. Approval must
be obtained from the bank before cash is dispensed.
2. A customer must be able to make a deposit to any account linked to the card,
consisting of cash and/or checks in an envelope. The customer will
enter the amount of the deposit into the ATM, subject to manual verification when
the envelope is removed from the machine by an operator. Approval must be
obtained from the bank before physically accepting the envelope.
3. A customer must be able to make a transfer of money between any two accounts
linked to the card.
4. A customer must be able to make a balance inquiry of any account linked to the
card.
5. A customer must be able to abort a transaction in progress by pressing the Cancel
key instead of responding to a request from the machine.
The ATM will communicate each transaction to the bank and obtain verification
that it was allowed by the bank. Ordinarily, a transaction will be considered
148
complete by the bank once it has been approved. In the case of a deposit, a
second message will be sent to the bank indicating that the customer has
deposited the envelope. (If the customer fails to deposit the envelope within the
timeout period, or presses cancel instead, no second message will be sent to the
bank and the deposit will not be credited to the customer.)
If the bank determines that the customer's PIN is invalid, the customer will be
required to re-enter the PIN before a transaction can proceed. If the customer is
unable to successfully enter the PIN after three tries, the card will be permanently
retained by the machine, and the customer will have to contact the bank to get it
back.
If a transaction fails for any reason other than an invalid PIN, the ATM will display
an explanation of the problem, and will then ask the customer whether he/she
wants to do another transaction.
The ATM will provide the customer with a printed receipt for each successful
transaction
The ATM will have a key-operated switch that will allow an operator to start and
stop the servicing of customers. After turning the switch to the "on" position, the
operator will be required to verify and enter the total cash on hand. The machine
can only be turned off when it is not servicing a customer. When the switch is
moved to the "off" position, the machine will shut down, so that the operator may
remove deposit envelopes and reload the machine with cash, blank receipts, etc.
150
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
156
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
157
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
159
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
TEXT BOOKS:
1. Management Science, Aryasri TMH,2009
2. Management, Stoner, Freeman, Gilbert, 6th Ed, Pearson Education, New
Delhi, 2004
3. Principles and Practice Management - L.M.Prasad, Sultan chand
Publications, New Delh
161
REFERENCE BOOKS:
1. Principles of Marketing , Kotler Philip, Garyarmstrong, Prafullay. Agnihotri,
EU Haque, 2010, 13TH Ed, Pearson Education Prentice Hall of India.
2. Human Resource Management, Michael Armstrong, 2010, Kogan Page.
3. Quantitative Techniques in Management” N.D.Vohra, 2010, 4th Ed, TMH
4. Operations Management, Mahadevan. B, 2010, Pearson Education.
5. Strategic Management, V.S.P. Rao and V., Hari Krishna, 2010, Text and
Cases, Excel Books, New Delhi.
162
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
164
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY,
(13ITD013)NETWORK PROGRAMMING
Course Objectives:
1. Understand the architecture of client-server, and socket programming
2. Recognize the deferent protocols like TCP, UDP, and RPC and their
applications
3. An understanding of the design considerations in building of network
applications
4. An in depth knowledge of Berkley sockets, and the system calls needed to
support network programming
Course Outcomes:
Upon completion of this course, students should be able to:
1. underlay the network hardware, network topologies, and protocols
2. able to design experiment WIN32 and/or UNIX system calls applications,
multi-Threading, access controls, signal processing, and inter-process
communication.
3. Design considerations in creating network applications.
4. Able to design client server application to support communication
interfaces.
UNIT-I
Introduction to Network Programming: OSI model, UNIX standards, TCP and UDP
& TCP connection establishment and Format, Buffer sizes and limitation, standard
internet services, Protocol usage by common internet application.
UNIT-II
Sockets: Address structures, value – result arguments, Byte ordering and
manipulation function and related functions Elementary TCP sockets – Socket,
connect, bind, listen, accept, fork and exec function, concurrent servers. Close function
and related function.
UNIT-III
TCP client server: Introduction, TCP Echo server functions, Normal startup, Posix
Signal Handling, Server with multiple clients – boundary conditions: Crashing and
rebooting of server host, shutdown of server host.
UNIT-IV
165
I/O Multiplexing and socket options: I/O Models, select function, Batch input,
shutdown function, poll function, TCP Echo server, getsockopt and setsockopt
functions. Socket states, Generic socket option IPV6 socket option ICMPV6 socket
option IPV6 socket option and TCP socket options.
UNIT-V
Elementary UDP sockets: Introduction UDP Echo server function, lost datagram,
summary of UDP example, Lack of flow control with UDP, determining outgoing
interface with UDP.
Elementary name and Address conversions: DNS, gethostbyName function,
Resolver option, Function and IPV6 support, and uname function, other networking
information.
TEXT BOOKS:
1. UNIX Network Programming, Vol. I, Sockets API, 2nd Edition. – W.Richard
Stevens, Pearson Edn. Asia.
2. UNIX Network Programming, 1st Edition,–W.Richard Stevens. PHI.
REFERENCE BOOKS:
1. UNIX Systems Programming using C++ T CHAN, PHI.
2. UNIX for Programmers and Users, 3rd Edition Graham GLASS, King Abls,
Pearson Education
3. Advanced UNIX Programming 2nd Edition M. J. ROCHKIND, Pearson
Education
166
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY,
HYDERABAD
IV Year B.Tech CSE, IT–I SEM L T/P/D C
Elective - I 3 0 3
(13CSE023)SEMANTIC WEB AND SOCIAL NETWORKS
Course Objectives
1. To analyse Web Intelligence and synthesize Knowledge Representation for
the Semantic Web
2. To evaluate Ontology engineering and applications pertaining to it.
3. To understand the essence of Semantic Web Applications, Services that
promotes Semantic Web Technology
4. To infer the principles of Social Network Analysis and correlate the rules with
the semantic web
5. To categorize ontologies, domain modeling, logic, reasoning and inference
techniques, semantic web services.
Course Outcomes:
Upon completion of the course, the students are expected to:
1. Evaluate principles of ontology and design inference engines in semantic
web development
2. Build semantic web applications with social network features
3. Infer the metaphor of social media as “communication as culture.”
4. Discuss critically on the use of social tools and identify strategies for their
effective implementation
5. Evaluate the social media and synthesize semantic web applications that
mitigate societal bad impacts and promote connectivity that enhances
sharing.
UNIT I
Thinking and Intelligent Web Applications, The Information Age, The World Wide Web,
Limitations of Todays Web, The Next Generation Web
Machine Intelligence, Artificial Intelligence, Ontology, Inference engines, Software
Agents, Berners-Lee www, Semantic Road Map, Logic on the semantic Web.
UNIT II
Ontologies and their role in the semantic web, Ontologies Languages for the Semantic
Web -Resource Description Framework(RDF) / RDF Schema. Ontology Web
Language(OWL),UML,XML/XML Schema.
Ontology Engineering, Constructing Ontology, Ontology Development Tools, Ontology
Methods, Ontology Sharing and Merging, Ontology Libraries and Ontology Mapping,
167
UNIT III
Logic, Rule and Inference Engines.Semantic Web applications and services.Semantic
Search.
e-learning, Semantic Bioinformatics, Knowledge Base
UNIT IV
XML Based Web Services, Creating an OWL-S Ontology for Web Services. Semantic
Search Techno logy, Web Search Agents and Semantic Methods,
UNIT V
What is social Networks analysis, development of the social networks analysis,
Electronic Sources for Network Analysis - Electronic Discussion networks.
Blogs and Online Communities. Web Based Networks. Building Semantic Web
Applications with social network features.
TEXT BOOKS:
1. Thinking on the Web - Berners Lee.Godel and Turing,Wiley
interscience,20()8.
2. Social Networks and the Semantic Web, Peter Mika,Springer,2007.
REFERENCE BOOKS:
1. Semantic Web Technologies,Trends and Research in Ontology Based
Systems, J.Davies, Rudi Studer. Paul Warren, John Wiley & Sons.
2. Semantic Web and Semantic Web Services -Liyang Lu Chapman and
Hall/CRC Publishers,(Taylor & Francis Group)
3. Information Sharing on the semantic Web - Heiner Stuckenschmidt; Frank
Van Harmelen, Springer Publications.
4. Programming the Semantic Web.T.Segaran, C.Evans, J.Taylor,
O'Reilly,SPD.
168
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
UNIT I
Introduction to Bioinformatics: Scope of Bioinformatics, History of Bioinformatics;
Biological information resources and retrieval system Elementary commands and
protocols, ftp, telnet, http
169
UNIT II
Basic Sequencing: DNA mapping and sequencing , Map Alignment , sequencing
methods like Shotgun and Sanger method
UNIT III
Sequencing Alignment and Dynamic Programming: BLAST, Heuristic Alignment
algorithms , global sequence alignments-Needleman Wunsch algorithm, Smith-
Waterman algorithm-Local sequence alignments
UNIT IV
Evolutionary Trees and Phylogeny: Multiple sequence alignment and phylogenetic
analysis.
UNIT V
Databases: Introduction to Biological databases, Organization and management of
databases, Structure databases- PDB(Protein Data Bank), Molecular modeling
databases(MMDB),Primary databases NCBL,EMBL,DDBJ, Secondary Databases-
Swissprot, KEGG, Bio Chemical databases- KEGG, BRENDA, WIT, EXPASY
TEXT BOOKS:
1. Bioinformatics Basics, Applications in Biological Science and Medicine by
Hooman H. Rashidi and Lukas K.buehler CAC Press 2000
2. Algorithms on strings trees and sequences Dan Gusfield, Cambridge
University Press 1997
REFERENCE BOOKS:
1. Bioinformatics: David Mount 2000,CSH Publications
2. Bioinformatics: A machine Learning Approach P.Baldi. S.Brunak, MIT Press
1988
3. Developing Bioinformatics Computer Skills", Gibas C, Jambeck P
4. Bioinformatics: A Practical Guide to the Analysis of Genes and Proteins" ,
Baxevanis AD, Ouellette BFF (eds):
170
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
171
UNIT III
Computer Forensics analysis and validation: Determining what data to collect and
analyze, validating forensic data, addressing data – hiding techniques, performing
remote acquisitions.
Network Forensics: Network Forensics overview, performing live acquisitions,
developing standard procedures for network forensics, unsing network tools, examining
the honeynet project.
UNIT IV
Processing crime and incident scenes: Identifying digital evidence, collecting
evidence in private-sector incident scenes, processing law enforcement crime scenes,
preparing for a search, securing a computer incident or crime scene, seizing digital
evidence at the scene, storing digital evidence, obtaining a digital hash, reviewing a
case.
Current computer forensic tools: evaluating computer forensic tool needs, computer
forensics software tools, computer forensics hardware tools, validating and testing
forensics software.
UNIT V
E-Mail investigations: Exploring the role of E-mail in investigation, exploring the role
of the client and server in E-mail, investigating e-mail crimes and violations,
understanding e-mail servers, using specialized e-mail forensic tools.
Cell phone and mobile device forensics: Understanding mobile device forensics,
understanding acquisition procedures for cell phones and mobile devices.
Working with windows and DOS Systems: Understanding file systems, exploring
Microsoft File Structures, Examining NTFS Disks, Understanding whole disk
encryption, windows registry, Microsoft startup tasks, MS-DOS Startup tasks, virtual
machines.
TEXT BOOKS:
1. Computer forensics, computer crime investigation by John R.Vacca, Firewall
Media, New Delhi.
2. Computer forensics and investigations by Nelson, Phillips Enfinger Steuart,
CENGAGE Learning.
172
REFERENCE BOOKS:
1. Real Digital Forensics by Keith J.Jones, Rechard Bejtlich, Curtis W.Rose,
Addison-Wesley Pearson Education.
2. Forensic compiling, A Tractitioneris Guide By Tony Sammes and Brain
Jenkinson, Springer International Edition.
3. Computer Evidence Collection & Presentation by Christopher L.T.Brown,
Firewall Media.
4. Homeland Security, Techniques & Technologies by Jesus Mena, Firewall
Media
5. Software forensics Collecting Evidence from the scene of a digital crime by
Robert M.Slade, TMH 2005.
6. Windows forensics by Chad Steel, Wiley India Edition.
173
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
174
UNIT-IV
Structural PatternPart-II: Decorator, Façade, Flyweight, Proxy.
Behavioral PatternsPart-I : Chain of Responsibility, Command, Interpreter, Iterator.
UNIT-V
Behavioral Patterns Part-II: Mediator, Memento, Observer, State, Strategy, Template
Method ,Visitor, Discussion of Behavioral Patterns. What to Expect from Design
Patterns, A Brief History, The Pattern Community An Invitation, A Parting Thought.
TEXT BOOK:
1. Design Patterns By Erich Gamma, Pearson Education
REFERENCE BOOKS:
1. Pattern’s in JAVA Vol-I By Mark Grand ,Wiley DreamTech.
2. Pattern’s in JAVA Vol-II By Mark Grand ,Wiley DreamTech.
3 JAVA Enterprise Design Patterns Vol-III By Mark Grand ,Wiley DreamTech.
4. Head First Design Patterns By Eric Freeman-Oreilly-spd5.
175
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
(13ITD021)CLOUD COMPUTING
Course Objectives:
At the end of the course, student will be able to appreciate the cloud computing
paradigm, recognize its various forms and able to implement some cloud computing
features.
1. At the end of the course, student will be able to appreciate the cloud
computing paradigm, recognize its various forms and able to implement
some cloud computing features.
2. Get a clear understanding of Cloud Computing Fundamentals and its
importance to various organizations.
3. Master the concepts of IaaS, PaaS, SaaS, Public and Private clouds.
4. Understand AWS and learn to develop applications in AWS.
Course Outcomes:
Upon completion of this course, students should be able to:
UNIT-V
CLOUD COMPUTING CASE STUDIES
Cloud computing case studies: Google App Engine – IBM Clouds –Windows live –
Micro soft dynamic CRM- Salesforce.com CRM- App Exchange – Amazon S3 – Oracle
OBIEE
TEXT BOOKS:
1. Cloud Computing: Implementation, Management and Security, John W.
Rittinghouse, James F.Ransome, CRC Press, rp2012.
2. Cloud computing a practical approach by Anthony T.Velte, Toby J Velte Robert
Elsenpeter, and TMH 2010
REFERENCE BOOKS:
1. Michael Miller, Cloud Computing: Web-Based Applications That Change the Way
You Work and Collaborate Online, Que Publishing, August 2008.
2. 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.
3. Gautam Shroff, Enterprise Cloud Computing: Technology, Architecture,
applications, Cambridge University Press, 2010.
4. Ronald Krutz Russell Dean Vines, Cloud Security
177
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
TEXT BOOK:
1. Designing Enterprise Applications with the JavaTM 2 Platform, Enterprise
Edition , Nicholas Kassem and the Enterprise Team Version
179
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
180
Introduction, Measures used in system evaluation, Measurement example – TREC
results.
UNIT-V
Multimedia Information Retrieval, Models and Languages, Data Modeling, Query
Languages, Indexing and Searching. Libraries and Bibliographical systems, online IR
system, OPACs, Digital Libraries.
TEXT BOOKS:
1. Information Storage and Retrieval systems Theory and Implementation
Second Edition
2. Modern Information Retrival By Ricardo Baeza-Yates, Pearson Education,
2007.
REFERENCE BOOKS:
1. Information Retrieval: Algorithms and Heuristics By David A Grossman and
Ophir Frider, 2nd Edition, Springer.
2. Frakes, W.B., Ricardo Baeza-Yates: Information Retrieval Data Structures
and Algorithms, Prentice Hall, 1992.
3. Modern Information Retrival By Yates Pearson Education.
4. Information Storage & Retieval By Robert Korfhage – John Wiley & Sons
5. Natural Language Processing and Information Retrieval, T.Siddiqui and
U.S.Tiwary, Oxford University Press.
181
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
UNIT-I
INTRODUCTION: Security Attacks, Services Mechanisms, A model for Internetwork
security, Classical Encryption techniques, Fiestel Cipher Structure,
Data Encryption Standard, Block Cipher Design Principles and Modes of Operation,
Triple DES, IDEA, BLOWFISH, RC-4, Evaluation criteria for AES, AES Cipher,
Placement of Encryption Function, Traffic Confidentiality.
UNIT-II
182
PUBLIC KEY CRYPTOGRAPHY
Confidentiality using Symmetric Encryption – Principles of Public key Cryptosystems,
RSA algorithm, Key Management, Diffie-Hellman key Exchange, Elliptic Curve
Cryptography. Buffer overflow, TCP session hijacking, ARP attacks, route table
modification, UDP hijacking and man-in-the-middle attacks.
UNIT-III
AUTHENTICATION AND HASH FUNCTIONS
Authentication requirements, Authentication functions, Message Authentication Codes,
Hash Functions, Security of Hash Functions and MACs, MD5 message Digest
algorithm , Secure Hash Algorithm, RIPEMD, HMAC Digital Signatures, Authentication
Protocols, Digital Signature Standard, Authentication Applications: Kerberos – X.509
Authentication Service
UNIT-IV
NETWORK SECURITY: Email Security and Web Security
Electronic Mail Security – PGP/ SMIME, IP security- Architecture, Authentication
Header, Encapsulating Security Payload, Key Management, Web Security- Secure
Socket Layer, Transport Layer Security and Secure Electronic Transaction
UNIT-V
SYSTEM LEVEL SECURITY
Intrusion detection – password management – Viruses and related Threats – Virus
Counter measures – Firewall Design Principles – Trusted Systems.
TEXT BOOKS:
1. William Stallings, “Cryptography And Network Security – Principles and
Practices”, Prentice Hall of India, Fourth Edition, 2005.
2. Bruce Schneier, “Applied Cryptography”, John Wiley & Sons Inc, 2001
REFERENCE BOOKS:
1. Charles B. Pfleeger, Shari Lawrence Pfleeger, “Security in Computing”, Third
Edition, Pearson Education, 2003
2. Atul Kahate, “Cryptography and Network Security”, Tata McGraw-Hill, 2003.
3. “Hack Proofing your network” by Ryan Russell, Dan Kaminsky, Rain Forest,
Puppy, Joe Grand, DavidAhmad, Hal Flynn Ido Dubrawsky, Steve W.Manzuik
and Ryan Permeh, wiley Dreamtech
4. Cryptography: Theory and Practice by Douglas R. Stinson, CRC press,
hardcover, Published March, 1995. ISBN 0-8493-8521-0
5. Network Security Essentials: Applications and Standards by William
Stallings.Prentice Hall, Hardcover, Published November 1999, 366 pages,
ISBN 0130160938.
183
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
UNIT-I
Introduction to Mobile Communications and Computing:
Mobile Computing (MC) : Introduction to MC, Novel applications, Limitations, and
Architecture.
GSM: Mobile services, System architecture, Radio interface, Protocols, Localization
and calling, Handover, Security, and New data services.
UNIT-II
(Wireless) Medium Access Control (MAC): Motivation for a Specialized MAC
(Hidden and Exposed Terminals, Near and Far Terminals), SDMA, FDMA, TDMA,
CDMA, MAC Protocols for GSM.
UNIT-III
Mobile IP 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-IV
Mobile Transport Layer: Traditional TCP, Indirect TCP, Snooping TCP, Mobile TCP,
Fast retransmit/fast recovery, Transmission/ time-out freezing, Selective
retransmission, Transaction oriented TCP.
184
UNIT-V
Database Issues: Hoarding techniques, caching invalidation mechanisms.
Data Dissemination: Communications asymmetry, classification of new data delivery
mechanisms, pushes based mechanisms, pull-based mechanisms, hybrid
mechanisms, selective tuning (indexing) techniques.
TEXT BOOKS:
1. “Handbook of Wireless Networks and Mobile Computing”, Stojmenovic and
Cacute, Wiley, 2002, I
2. “Mobile Communications”, Jochen Schiller, Addison-Wesley, Second
Edition, 2004
REFERENCE BOOKS:
1. “Mobile Computing Principles: Designing and Developing Mobile Applications
with UML and XML“, Reza Behravanfar, Cambridge University Press,
Oct2004.
2. ”Mobile Computing”, Raj Kamal, Oxford University Press ,2007
3. “Mobile and Wireless Design Essentials”, Martyn Mallick, Wiley DreamTech,
2003.
4. “Principles of Mobile Computing”, Hansmann, Merk, Nicklous, Stober, 2nd
edition Springer 2003.
185
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
Course Outcomes:
Upon completion of this course, students should be able to:
1. Identify the entities responsible for implementing mark-up language
standards.
2. Code and troubleshoot HTML and XHTML web pages, incorporating
CSS and Scripts.
3. Incorporate multimedia (images, animation, sound, and movies) into web
pages.
4. Demonstrate effective use of Dreamweaver to build and publish
professional websites that employ best practices, adhere to current web
standards, and pass Validation.
186
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.
Web Site Name
Logo
Home Login Registration Catalogue Cart
CSE
ECE
EEE Description of the Web Site
CIVIL
Fig 1.1
2) LOGIN PAGE:
This page looks like below:
Web Site Name
Logo
Home Login Registration Catalogue Cart
CSE
ECE Login :
EEE Password:
CIVIL
Submit Reset
3) CATOLOGUE PAGE:
The catalogue page should contain the details of all the books available in the web site
in a tabular format.
187
The details should contain the following:
1. Snap shot of Cover Page.
2. Book Title, Author Name, Publisher.
3. Price.
4. Add to cart button.
EEE
Book : AI $ 63
Author : S.Russel
CIVIL Publication : Princeton hall
Book : Java 2
Author : Watson $ 35.5
Publication : BPB publications
TASK 2
4) CART PAGE:
The cart page contains the details about the books which are added to the cart.
The cart page should look like this:
Logo Web Site Name
188
IT
CSE Book name Price Quantity Amount
ECE
EEE Java 2 $35.5 2 $70
CIVIL XML bible $40.5 1 $40.5
5) 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)
TASK 3
VALIDATION:
a) Write JavaScript to validate the following fields of the above registration page.
1. Name (Name should contains only 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
name@domain.com)
4. Phone number (Phone number should contain 10 digits only).
b) Write JavaScript to validate the above login page with the above parameters.
EXPERIMENT 4
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. For example:
189
<HTML>
<HEAD>
<style type="text/css">
B.headline {color:red; font-size:22px; font-family:arial; text-decoration:underline}
</style>
</HEAD>
<BODY>
<b>This is normal bold</b><br>
<b class="headline">This is headline style bold</b>
</BODY>
</HTML>
2) Set a background image for both the page and single elements on the
page.
You can define the background image for the page like this:
BODY {background-image:url(myimage.gif);}
190
LAYER 1 ON TOP:
<div style="position:relative; font-size:50px; z-index:2;">LAYER 1</div>
<div style="position:relative; top:-50; left:5; color:red; font-size:80px; z-
LAYER 2 ON TOP:
<div style="position:relative; font-size:50px; z-index:3;">LAYER 1</div>
<div style="position:relative; top:-50; left:5; color:red; font-size:80px; z-
6) Add a customized cursor:
Selector {cursor:value}
For example:
<html>
<head>
<style type="text/css">
.xlink {cursor:crosshair}
.hlink{cursor:help}
</style>
</head>
<body>
<b>
<a href="mypage.htm" class="xlink">CROSS LINK</a>
<br>
<a href="mypage.htm" class="hlink">HELP LINK</a>
</b>
</body>
</html>
TASK 5
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.
Display the XML file as follows.
The contents should be displayed in a table. The header of the table should be in color
GREY. And the Author names column should be displayed in one color and should be
capitalized and in bold. Use your own colors for remaining columns.
Use XML schemas XSL and CSS for the above purpose.
191
Note: Give at least for 4 books. It should be valid syntactically.
Hint: You can use some xml editors like XML-spy
TASK 6
VISUAL BEANS:
Create a simple visual bean with a area filled with a color.
The shape of the area depends on the property shape. If it is set to true then the shape
of the area is Square and it is Circle, if it is false.
The color of the area should be changed dynamically for every mouse click. The color
should also be changed if we change the color in the “property window “.
TASK 7
Install TOMCAT web server.
While installation assign port number 8000 to TOMCAT. Make sure that these ports are
available i.e., no other process is using this port.
Access the above developed static web pages for books web site, using these servers
by putting the web pages developed in TASK-1 and TASK-2 in the document root.
Access the pages by using the urls: http://localhost:8000/vnr/books.html
TASK 8
User Authentication:
Assume four users user1, user2, user3 and user4 having the passwords
pwd1,pwd2,pwd3 and pwd4 respectively. Write a servelet for doing the following.
1. Create a Cookie and add these four user id’s and passwords to this Cookie.
2. Read the user id and passwords entered in the Login form (TASK1) and
authenticate with the values (user id and passwords) available in the cookies.
If he is a valid user (i.e., user-name and password match) you should welcome
him by name(user-name) else you should display “ You are not an authenticated
user “.Use init-parameters to do this. Store the user-names and passwords in the
web.xml and access them in the servlet by using the getInitParameters() method.
TASK 9
Install JSDK. User Authentication: Assume four users user1, user2, user3 and user4
having the passwords pwd1, pwd2, pwd3 and pwd4 respectively. Write a servelet for
doing the following.
1. Use init-parameters to do this. access them in the servlet by using the
getInitParameters() method.
2. Read the user id and passwords entered in the Login form (TASK1) and
authenticate with the values (user id and passwords) with above accessed values.
If user is a valid user (i.e., user-name and password match) you should welcome
user by name (user-name) else you should display “You are not an authenticated
user “.
192
TASK 10
Install a database (Mysql or Oracle).
Create a table which should contain at least the following fields: name, password,
email-id, phone number (these should hold the data from the registration form).
Practice 'JDBC' connectivity.
Write a java program/servlet/JSP to connect to that database and extract data from the
tables and display them. TASK with various SQL queries.
Insert the details of the users who register with the web site, whenever a new user
clicks the submit button in the registration page (TASK2).
TASK 11
Write a JSP which does the following job: Insert the details of the 3 or 4 users who
register with the web site (TASK9) by using registration form. Authenticate the user
when he submits the login form using the user name and password from the database
(similar to TASK8 instead of cookies).
TASK 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
(TASK 2) 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.
193
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
195
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
TEXT BOOKS:
1. Principles of Soft Computing- S N Sivanandam, S N Deepa, Wiley India, 2007
2. Neuro-Fuzzy and Soft Computing A Computational Approach to Learning and
Machine Intelligence – J.S.R.Jang, C.T.Sun, E.Mizutani, PHI
REFERENCE BOOKS:
1. Artificial Intelligence and Soft Computing- Behavioral and Cognitive Modeling of
the Human Brain- Amit Konar, CRC press, Taylor and Francis Group.
2. Soft Computing and Intelligent System Design -Fakhreddine O Karray, Clarence D
Silva,. Pearson Edition, 2004.
3. Artificial Intelligence – Patric Henry Winston – Third Edition, Pearson Education.
4. Fuzzy Sets and Fuzzy Logic Theory and Applications – George J.Klir, Bo Yuan
5. Genetic Algorithms in Search, Optimization and Machine Learning – David
E.Goldberg Addison-Wesley
6. An Introduction to Genetic Algorithms – Melanie Mitchell, MIT Press
7. Artificial Neural Networks – B.Yegnanarayana.
197
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
UNIT -I
Fundamentals of Computer design- Technology trends- cost price and their trends-
measuring and reporting performance - quantitative principles of computer design.
UNIT –II
Instruction set principles and examples- Classifying instruction set architecture -
memory addressing- type and size of operands- operations in the instruction set-
instructions for control flow- encoding an instruction set.
UNIT –III
Instruction level parallelism (ILP)and its dynamic exploitation – Concepts and
challenges-overcoming data hazards- reducing branch costs with dynamic hardware
prediction – high performance instruction delivery- hardware based speculation
ILP software approach- compiler techniques- static branch protection - VLIW
approach - H.W support for more ILP at compile time.
198
UNIT –IV
Memory hierarchy design- Cache performance- reducing cache misses penalty and
miss rate–virtualmemory.
Multiprocessors and thread level parallelism- symmetric shared memory
architectures- distributed shared memory- Synchronization- multi threading
UNIT –V
Storage systems - Types – Buses - RAID- errors and failures - designing an I/O
system in fiveeasypieces. Inter connection networks and clusters - interconnection
network media – practical issues in interconnecting networks – clusters- designing a
cluster
TEXT BOOKS:
1) Computer Architecture A quantitative approach 3rd edition John L. Hennessy
& David A. Patterson Morgan Kufmann (An Imprint of Elsevier)
REFERENCE BOOKS:
1. “Computer Architecture and parallel Processing” Kai Hwang and A.Briggs
International Edition McGraw-Hill.
2. Advanced Computer Architectures, DezsoSima, Terence Fountain, Peter
Kacsuk, Pearson.
199
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
200
Location Based Services – WirelessPersonal and Local Area Networks – The Impact of
Technology Advanceson Strategy Formulation in Mobile Communications Networks.
UNIT-IV Mobile Commerce: Theory And Applications
The Ecology of Mobile Commerce – The Wireless Application Protocol –Mobile
Business Services – Mobile Portal – Factors influencing theAdoption of Mobile Gaming
Services – Mobile Data Technologies andSmall Business Adoption and Diffusion – M–
Commerce in theAutomotive Industry – Location– Based Services: Criteria for
Adoptionand Solution Deployment – The Role of Mobile Advertising in Building aBrand
– M– Commerce Business Models.
UNIT-V Business– To– Business Mobile E– Commerce
Enterprise enablement – Email and messaging – Field force automation– Field sales
support – Asset tracking and Maintenance/Management –Remote IT support –
Customer retention – Warehouse automation –Security.
TEXT BOOKS:
1. Brian E. Mennecke , Troy J. Strader , “Mobile Commerce: (Soft
Cover):Technology, Theory and Applications”, Idea Group Inc., IRM press , 2003.
2. Ravi Kalakota and Andrew B.Whinston “Frontiers of ElectronicCommerce”,
Pearson Education, 2003.
REFERENCE BOOKS:
1. P. J. Louis, “ M– Commerce Crash Course”, McGraw– Hill CompaniesFebruary
2001.
2. Paul May, “Mobile Commerce: Opportunities, Applications, andTechnologies of
Wireless Business” Cambridge University Press
201
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
202
UNIT-III Introduction to Interactive Visual Data Analysis
• Challenges faced by everyday data analysts
• A brief history of interactive visual data analysis
• Differences between statics graphics and interactive graphics
UNIT-IV Sensing and Analyzing Univariate Data
• Sensing and Analyzing Univariate Data
• Distribution analysis of categorical data
• Distribution analysis of continuous data
• Deviation analysis
• Part-to whole and ranking analysis
• Univariate data analysis best practices
UNIT-V Sensing and Analyzing Time Series Data
• Characteristics of time-series data
• Visual analysis techniques for time-series data
• Interactive graphics aided time-series analysis
• Visual time-series analysis best practices
REFERENCE BOOKS:
1. Jiawei Han and Micheline Kamber, Data Mining: Concepts and Techniques,
Second Edition, Elsevier
2. Michael Berry and Gordon Linoff, Data Mining Techniques, Wiley Publishing,
2004.
3. Kimball and Ross, The Data Warehouse Toolkit, Second Edition, John Wiley
& Sons, 2002.
4. T. Davenport, “Competing on Analytics,” Harvard Business Review (Decision
Making), January 2006.
203
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
.Course Outcomes
After going through this course the student will be able to
1. Understand the basic principles of digital image processing and perform
image transforms
2. Understand and perform basic image processing methods such as Image
filtering operations, Image enhancement
3. Analyze and compare various image compression techniques and their
applications
4. Design and implement various algorithms for image analysis
UNIT-I
Fundamentals of Image Processing: Digital Image Fundamentals, Basic steps of
Image Processing System, Sampling and Quantization of an image, relationship
between pixels, Imaging Geometry.
Image Transforms: 2 D- Discrete Fourier Transform, Discrete Cosine Transform
(DCT), Haar Transform, Hadmard Transform, Hotelling Transform and slant transform.
UNIT-II
Image Enhancement: Spatial domain methods: Histogram processing, Fundamentals
of Spatial filtering, Smoothing spatial filters, Sharpening spatial filters.
Frequency domain methods: Basics of filtering in frequency domain, image
smoothing, image sharpening, Selective filtering.
UNIT-III
Image Segmentation: Segmentation concepts, Point, Line and Edge Detection, Edge
Linking using Hough Transform, Thresholding, Region Based segmentation.
Wavelet based Image Processing: Introduction to wavelet Transform, Continuous
wavelet Transform, Discrete wavelet Transform, Filter banks, Wavelet based image
compression
204
UNIT-IV
Image Compression: Image compression fundamentals - Coding Redundancy,
Spatial and Temporal redundancy, Compression models: Lossy and Lossless, Huffman
coding, Arithmetic coding, LZW coding, Run length coding, Bit plane coding, Transform
coding, Predictive coding, JPEG Standards.
UNIT-V
Image Restoration: Image Restoration Degradation model, Algebraic approach to
restoration, Inverse Filtering, Least Mean square filters.
Morphological Image Processing: Dilation and Erosion, Opening and closing, the hit
or miss Transformation, Overview of Digital Image Watermarking Methods
TEXT BOOKS:
1. Digital Image Processing- Rafael C. Gonzalez and Richard E.Woods, 3rd
Edition, Pearson, 2008.
2. Digital Image Processing- S.Jayaraman, S Esakkirajan, T Veerakumar, TMH,
2010.
REFERENCE BOOKS:
1. Digital Image Processing-William K.Pratt, 3rd Edition, John Willey, 2004.
2. Fundamentals of Digital Image Processing-A.K.Jain, PHI, 1989.
3. Digital Image Processing using MATLAB - Rafael C. Gonzalez, Richard
E.Woods and Steven L.Edding 2nd , TMH. 2010.
4. Digital Image Processing and Computer Vision – Somka, Hlavac, Boyl,
Cengage Learning, 2008.
5. Introduction to image Processing and Analysis – John C. Russ, J. Christian
Russ, CRC Press, 2010
205
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
UNIT-V
Case Studies
1. Creating a Shooters (2-D) game and Creating a Flight Sim(3-D) game.
TEXT BOOK:
1. XNA 3.0 Game Programming Recipes: A Problem-Solution Approach,
Riemer Grootjans, A Press, 2009.
REFERENCE BOOKS:
1. Beginning XNA 3.0 Game Programming: From Novice to Professional,
Alexandre Santos Lobao, Bruno Pereira Evangelista, Antonio Leal de Farias ,
Riemer Grootjans, A Press, 2009.
2. Learning XNA 4.0: Game Development for the PC, Xbox 360, and Windows
Phone 7, Aaron Reed, O’Reilly, 2011.
3. Microsoft XNA Game Studio Creator's Guide, Second Edition, Stephen
Cawood and Pat McGee, Mc. Graw Hill, New York, 2009.
4. http://www.riemers.net/eng/Tutorials/xnacsharp.php
207
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
209
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
Course Outcomes
After completing this course the student will be able to
• Understand and design real time and non real time embedded systems
• Define the unique design challenges of real-time systems and program them.
• Understand unique characteristics of RTOS and use RTOS to build an
embedded real-time system
• Gain knowledge and skills necessary to design and develop embedded
applications based on real-time operating systems.
UNIT-I
FUNDAMENTALS OF EMBEDDED SYSTEMS
Definition – Classification of Embedded Systems - Processors in the system - Other
Hardware units. Software components - Examples for embedded systems, Design
issues and trends
UNIT-II
EMBEDDED HARDWARE DEVELOPMENT ENVIRONMENT
Processor Architecture- Structured units of a processor - Processor selection factors.
Common memory devices - Memory selection - Memory map - Internal devices & I/O
devices, Serial devices - Parallel port devices, Timer and Counting devices - Direct
memory access, Communication Interface Standards,.
UNIT-III
EMBEDDED SOFTWARE DEVELOPMENT ENVIRONMENT ‘
Embedded System Development Process, Embedded Operating systems, Types of
Embedded Operating systems, Host and Target machines, Linkers/Locators for
embedded software, getting embedded software into the target system, Testing on
host machine.
210
UNIT-IV
REAL TIME OPERATING SYSTEMS CONCEPTS -I
Typical OS structure - RTOS structure - The context of its use - Schedule management
for multiple tasks - Scheduling in real time - RTOS task scheduling models – Round
Robin, Round Robin with Interrupts, Priority driven- Preemptive and Non-preemptive
scheduling
UNIT-V
REAL TIME OPERATING SYSTEMS CONCEPTS -II
Tasks and Task states, Tasks and Data, Semaphores and shared data, Message
queues, Mailboxes and Pipes, Timer functions, events, Memory management, Interrupt
routines in an RTOS environment.
Case study of RTOS using MUCOS. Case study for RTOS based programming -
Coding for Automatic Chocolate vending machine using MUCOS.
TEXT BOOKS:
1. An Embedded Software Primer – David E. Simon, Pearson Ed., 2005.
2. Embedded systems - architecture, programming and design - Raj Kamal;
Tata McGraw Hill
REFERENCE BOOKS:
1. Real time Systems”, J. W. S. Liu, Pearson
2. The 8051 Microcontroller & Embedded Systems using Assembly and C by
Ayala &Gadre,Cengage Publications
211
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
UNIT-I
Review of microelectronics and Introduction to MOS technology: Introduction to
IC technology: Fabrication process: Oxidation, Diffusion, Lithography, Ion Implantation
and Metallisation. Introduction to MOS and related VLSI technology – NMOS-CMOS-
BICMOS Technologies used in VLSI circuits.
UNIT-II
BASIC ELECTRICAL PROPERTIES: Basic Electrical Properties of MOS, CMOS and
BiCMOS Circuits:
IDs –VDs relationships, MOS transistor threshold Voltage, gm, gds, figure of merit wo,
Pass transistor, NMOS inverter, CMOS Inverter
UNIT-III
VLSI Circuit Design Process: VLSI Design Flow ,MOS layers , stick diagrams
, design rules and layout –Lambda based design rules for wires, transistors and
contact cuts, Layout Diagrams for logic gates.
UNIT-IV
Basic Circuit concepts and scaling of MOS transistors:
Sheet resitsance, Area capacitance, Delay unit, Inverter Delays ,Rise time and fall time
estimations, wiring capacitance, Choice of layers, Scaling models ,Scaling factors,
Limitaions of scaling.
212
UNIT-V
GATE LEVEL DESIGN AND LAYOUT: Architectural issues, Switch logic networks,
Gate logic, transmission gate logic, Alternate gate circuit: Pseudo-NMOS, Dynamic
CMOS logic.
SUBSYSTEM DESIGN: Subsystem Design, Shifters, Adders, ALUs, Multipliers: Array
multiplier, Serial-Parallel multiplier, Parity generator, Comparators, Zero/One
Detectors, Up/Down Counter.
TEXT BOOKS:
1. Basic VLSI design by Douglas A, Pucknell, Kamran Eshraghian,
Prantice Hall, 1996 3rd edition.
2. CMOS VLSI Design – A circuits and systems perspective, Neil H.E Weste ,
David Harris, Ayan Banerjee, pearson ,2009.
REFERENCE BOOKS:
1. CMOS logic circuit Design – John P. Uyemura , Springer , 2007
2. Modern VLSI Design –Wayne Wolf, Pearson Education , 3rd Edition, 1997.
3. VLSI Design – A.Albert Raj, Latha PHI, 2008.
213
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
214
UNIT-V
Robot applications: material transfer and machine loading /unloading, processing
applications, welding and painting assembly and inspection, future robotic applications
and related technologies developments.
TEXTBOOKS:
1. Industrial robotics: Groover, weiss nagel and odrey, Mc Graw
2. Hill.Robotics engineering: klafter, Chmielwski and nagirn,Prentice hill.
3. Robotics Technology and Flexible Automation / SR Deb
REFERENCE BOOKS:
1. Robotics for engineering: Yorem Korem, Mc Graw Hill.
2. Robotics:control,sensing vision and intelligence: K.S. Fu, R.C.Gonzalez, C.S.g
Lee, McGraw HILL
3. Fundamentals of Robotics Analysis and control: Robert J. Schiling
215
VNR VIGNANA JYOTHI INSTITUTE OF ENGINEERING & TECHNOLOGY
217