Syllabus Copy

Estd: 1997 EAMCET Code: BVRI
BACHELOR OF TECHNOLOGY (B.Tech.)

FOUR YEAR DEGREE PROGRAMME
[Choice Based Credit System (CBCS)]
R20 Curriculum
(Applicable for the batches admitted from 2020-2021)
Department of Information Technology

B V RAJU INSTITUTE OF TECHNOLOGY INFO
(UGC-Autonomous)
Approved by AICTE, Accredited by NAAC & NBA TECH
& Affiliated to JNTUH, Hyderabad
Orchard Park Campus, Vishnupur

Narsapur, Medak Dist. – 502 313, Telangana, India
(Sri Vishnu Educational Society)
Email: bvrit@bvrit.ac.in Website: bvrit.ac.in

INSTITUTE
VISION
To create and nurture competent engineers and managers who would be enterprise leaders
throughout the world with a sound background in ethics and societal responsibilities.
MISSION
B V Raju Institute of Technology/ B Tech IT

We are committed to providing a positive and professional learning environment where all students
are inspired to strive for excellence in becoming competent engineers, technology innovators and
leaders in a global society through a cohesive network of parents, students, college staff and
industry.
QUALITY POLICY
We aim at excellence in Technical Education through continual improvements and are committed to
provide responsible technocrats for effective nation building through
Imparting quality Education & Training
Developing students with a disciplined and Integrated personality
Facilitating faculty and supporting staff to update their knowledge and skills to match
the individual and technological developments
B V Raju Institute of Technology
(UGC Autonomous)
Vishnupur, Narsapur, Medak District, Telangana State.
ACADEMIC REGULATIONS R20 FOR B.TECH. (REGULAR)

Applicable for the students of B.Tech. (Regular) from the Academic Year 2020-21 onwards.
1. Title and Duration of the Programme
1.1 The programme shall be called the degree programme in Bachelor of Technology, abbreviated as
B.Tech.
1.2 The programme shall be of four academic years duration divided into eight semesters, each semester
having a duration of minimum 16 weeks excluding examinations.
1.3 The institute shall publish the academic calendar in respect of the programme from time to time.
2. Admission Procedure
2.1 The admissions to the B.Tech. programme shall be done as per the norms prescribed by the
Government of Telangana and its orders issued from time to time in this regard shall prevail.
2.2 The student shall be an Indian National. B V Raju Institute of Technology/ B Tech IT
2.3 The student should have passed the qualifying examination, Intermediate or equivalent on the date of
admission.
2.4 Seats for each programme in the institute are classified under CATEGORY–A (70% of sanctioned
intake), and CATEGORY-B (30% of sanctioned intake) besides lateral entry.
2.5 Category -A seats will be filled by the Convener, TSEAMCET admissions. The institute will fill category -
B seats as per the guidelines of the Telangana State Council of Higher Education.
2.6 Lateral Entry seats for 10% of the sanctioned intake of the programme shall be admitted into the II Year I
Semester directly based on the rank earned by the student in Engineering Common Entrance Test (TSECET (FDH)) as
per the instructions issued by the Convener, TSECET and Government of Telangana.
3. Disciplines of Study
The following disciplines of study are offered at present under the B.Tech. Programme:
Discipline Name Code

Civil Engineering 01 - CE
Electrical and Electronics Engineering 02 - EEE
Mechanical Engineering 03 - ME
Electronics and Communication Engineering 04 - ECE
Computer Science and Engineering 05 - CSE
Chemical Engineering 08 - CHE
Biomedical Engineering 11 - BME
Information Technology 12 - IT
Pharmaceutical Engineering 31- PHE
Computer Science and Business System 32 - CSB
Computer Science and Engineering(Artificial Intelligence 66 - CSM
and Machine Learning)
Computer Science and Engineering (Data Science) 67 - CSD
4. Structure of the Programme

The program consists of courses based on humanities and social sciences, basic sciences, engineering sciences,
program core, program electives, open electives, industry internship, laboratories, mandatory courses and project work.
Broad Course Total

S. No. Course Group or Category Course Description
Classification Credits
Humanities, Social sciences & English, humanities, social sciences, 9.5
Management (HS) management
1 Foundation Courses
Basic Sciences (BS) Mathematics, Physics, Chemistry 24
Engineering Sciences (ES) Fundamental Engineering Courses 25
Professional Core (PC) Professional courses-core relevant to 54
the discipline
Core Courses and Project work (PW) Minor & Major project (Institute/ 14.5
2
Core activities Industry), Internship (Industry/
research organization), Seminar &
technical term Paper (Institute)
Professional Electives (PE) Professional courses- electives 18
relevant to the discipline
3 Elective Courses
Open Electives (OE) Electives from other departments and 15
or emerging areas
Mandatory Courses (MC) Courses on Environmental sciences, No
4 Mandatory Courses
Ethical values, Indian constitution. Credits
Total Credits 160
5. Medium of Instruction
The medium of instruction for the entire B. Tech. programme and the conduct of examinations shall be in English.
However, for elective courses of foreign languages, the medium varies depending on the course.
6. Performance Assessment
6.1 The performance of a student in a course (theory, laboratory and major project) is evaluated based on
two components: Continuous Internal Evaluation (40 marks) and Semester End Examination (60 marks).
6.2 The ratio between Continuous Internal Evaluation and Semester End Examination for all courses is 40:60
6.3 A student should attend the Semester End Examination to be eligible to pass the course.
6.4 For a student to PASS in a course, he has to score a minimum of 40 % in aggregate, subject to the
condition that he has secured a minimum of 35% (21 marks out of 60 marks) in semester end examination.
6.5 Assessment of the performance of a student in Minor-project/ Technical Term Paper / Summer
internship/ Seminar is done based on Continuous Internal Evaluation for 100 Marks, out of which a student has to secure
a minimum of 40% (40 marks) to be declared to have passed the course.
6.6 Mandatory courses are assessed for PASS or FAIL through Continuous Internal Evaluation. No credits
are assigned to these courses. A student has to secure a minimum of 40% in any of the mandatory course to be declared
to have passed the course. PASS grade is necessary to be eligible to get the degree.
6.7 The details of the assessment procedure are furnished in Table
Table: Assessment Procedure
S. Course type Type of Maximum
Scheme of Evaluation
No Assessment Marks
Continuous Internal 40
1 Theory During the semester, there shall be two internal
Course Evaluation
examinations. Each internal exam consists of the
(CIE) following components.
(a)
Descriptive type examination:20 marks.
(b)
Objective type examination: 10 marks.
(c)
In-class assignments/ presentations/ case
studies etc. : 10 marks.
Students performance in both internal examinations is
considered for CIE. The best scored internal examination
weightage is 70% and the other is 30%.
Semester End 60 At the end of the semester, there shall be Semester End
Examination (SEE) Examination evaluated for 60 marks
Total marks 100
Continuous Internal (a) Day-to-day assessment: 30 Marks
2 Laboratory 40
Course Evaluation(CIE) (b) Internal Examination: 10 Marks
Semester End At the end of the semester, there shall be Semester End
60
Total marks 100
Continuous Internal Faculty day-to-day assessment: 40 marks.
3 Minor Evaluation 100
Project Report Submission: 30 marks.
Final Presentation: 30 marks
4 Technical Evaluation 100
Term Paper Report Submission: 30 marks.
5 Seminar Evaluation 100
Report submission: 30 marks.
Continuous Internal Day-to-day assessment by the Supervisor of the host
6 Internship Evaluation 100
Industry/ Organization: 40 marks
Report submission: 30 marks.
Continuous Internal 40
7 Major During the semester, there shall be three internal
Project Evaluation (CIE)
reviews.
First Review: 10 Marks
Second Review: 10 Marks
Third review - Final Presentation: 20 Marks
Semester End 60 At the end of the semester, there will be Semester End
Total marks 100
Continuous Internal 100 During the semester, there shall be two internal
8 Mandatory
Courses Evaluation examinations. Each internal exam shall be conducted for
50 marks and consists of the following components.
Descriptive Type examination: 30 marks.
Objective Type examination: 10 marks
In-class Assignments/ presentations/ case studies etc., :
10 marks.
Students performance in both internal examinations is
considered for CIE.

7. Programme Pattern
7.1 The entire programme of study is of semester pattern, with 8 semesters constituting 4 academic years.
Each year will have two semesters (First/Odd and Second/Even Semester).
7.2 A student eligible to appear for Semester End Examination in a course(s), but absent from it or failed in
that examination, can write the exam for that course(s) during supplementary exams.
7.3 When a student is detained for lack of credits/shortage of attendance, he may be re-admitted into the
same semester the next year. However, the academic regulations of the batch into which he gets readmitted will be
applicable to him.
8. Minimum Instruction Days

8.1 The minimum instruction days for each semester shall be 90 days.
9. Course Registration
9.1 It is mandatory for every eligible student to register for course work at the beginning of each semester as
per the schedule mentioned in the academic calendar.
9.2 Students who fail to register for course work on the notified day may be permitted by the department for
late registration on later notified day with the approval of the head by the Institute.
9.3 Open Electives III, IV and V are normally offered to students, in IV Year II Semester, which can be
registered by the students during III Year I Semester to IV year I Semester and thereby make themselves free in IV Year II
Semester so that he can attend industry internship or do projects in industry and the same under the recommendations of
the Department Academic committee can be submitted as project work. Prior permission for registration of Open Electives
is compulsory.
9.4 To apply for open electives III, IV and V, as an additional course from III Year I Semester onwards, a
student must have secured a CGPA of ≥ 7.0 without any backlogs up to the previous semester under consideration.
9.5 Departments will notify at the time of registration about the minimum and the maximum number of
students to be enrolled for a particular open elective to be offered.
9.6 The list of open electives offered during that semester will be notified by the departments at the time of
course work registration
10. Attendance Requirements

10.1 A student is eligible to write the Semester End Examinations only if he acquires a minimum of 75% of
attendance in aggregate of all the courses registered during a semester.
10.2 Condonation for the shortage of attendance in aggregate up to 10% (65% and above and below 75%) in
each semester may be granted on medical/genuine grounds with documentary evidence approved by the College
Academic Committee.
10.3 A stipulated fee shall be payable towards Condonation for the shortage of attendance.
10.4 Shortage of attendance below 65% in aggregate shall not be condoned under any circumstances.
10.5 A student whose shortage of attendance is not condoned in any semester is not eligible to write the
Semester End Examination of that semester, he gets detained and his registration stands cancelled. He will not be
promoted to the next semester.
10.6 He may seek re-registration, by taking re-admission into the same semester, within two weeks from the
date of the commencement of class work. In case if there are any Professional Electives and/or Open electives, the same
may also be re-registered if offered, however, if those electives are not offered in the later semesters, then alternative
electives may be chosen from the SAME group of elective courses offered under that category.
10.7 If any student satisfies the attendance requirement in the present semester, he shall not be eligible for re-
admission into the same semester.
11. Grading System

11.1 Marks will be awarded to indicate the performance of each student in each Theory course, Laboratory
course, Seminar, Project, etc., based on the % of marks obtained in CIE + SEE (Continuous Internal Evaluation+
Semester End Examination, both taken together) as specified above (6.7), and a corresponding Letter Grade shall be
given.
11.2 As a measure of the student’s performance, the college follows the 10-point Absolute Grading System
(as per UGC/AICTE guidelines) given below. A Letter Grade and grade points will be awarded to a student in each course
based on his performance as per the grading system and the corresponding percentage of marks shall be followed.
Letter Grade Grade Points % age of marks earned

O 90%
B V and
Rajuabove
Institute of Technology/ B Tech IT
10
(Outstanding) ( ≥90% , ≤ 100%)
A+ Below 90% but not less than 80%
9
(Excellent) ( ≥80% , < 90%)
A Below 80% but not less than 70%
8
(Very Good) ( ≥ 70% , < 80%)
B+ Below 70% but not less than 60%
7
(Good) ( ≥ 60% , < 70%)
B Below 60% but not less than 50%
6
(Average) (≥ 50% , < 60%)
C Below 50% but not less than 40%
5
(Pass) (≥ 40% , < 50%)
F Below40%
0
(FAIL) ( < 40%)
Ab
0
(Absent)
11.3 A Student obtaining ‘F’ grade in any course shall be considered ‘Failed’ and will be required to reappear
as ‘Supplementary Candidate’ in the Semester End Examination (SEE), as and when offered.
11.4 A letter grade does not imply any specific % of marks.
11.5 In general, a student shall not be permitted to repeat any course (s) only for the sake of ‘Grade
Improvement’ or ‘SGPA/ CGPA Improvement’. However, he has to repeat all the courses of that semester, when he is
detained.
11.6 The student will pass a course only when his GP ≥ 5.0 (‘C’ grade or above).
11.7 A student shall be considered to have completed a course successfully and earned the credits if he earns
an acceptable letter grade in the range ‘O’ to ‘C’. Letter grade 'F' in any course implies the failure of the student in that
course and no credits earned.
11.8 A Semester Grade Point Average (SGPA) shall be computed for all the students in a Department for
each semester, as follows:
SGPA = (C 1* G 1 + C 2* G 2 + C 3* G 3 +. . . + C n* G n) / (C 1 + C 2 + C 3 +. . . + C n)
where n is the number of courses registered during the semester, Ci is the number of credits allotted to a particular
course, and Gi is the grade points corresponding to the grade awarded for that course.
11.9 The SGPA will be assigned in each semester only if the student has passed all the courses in that
semester
11.10 A Cumulative Grade Point Average (CGPA) shall be computed for all the students in a Department at the
end of each semester by taking into consideration their performance in the present and the past semesters as follows:
CGPA = (C 1* G 1 + C 2* G 2 + C 3* G 3 +. . . + C m* G m) / (C 1 + C 2 + C 3 +. . . + C m)
where m is the number of courses registered up to that semester, Ci is the number of credits allotted to a particular
course, and Gi is the grade points corresponding to the grade awarded for that course.
11.11 The CGPA will be assigned in each semester only if the student has passed all the courses till that
semester
11.12 Whenever, a student repeats or substitutes a course in any semester, the higher of the two grades
obtained by him in the course shall be considered in the computation of CGPA from that semester onwards and the
students shall be given the benefit of a higher grade.
11.13 Both the SGPA and CGPA shall be rounded off to the second place of decimal and recorded as such for
ease of presentation. Whenever the CGPAs are to be used to determine the merit ranking in a group of students, only the
rounded-off values shall be made use of.
11.14 For an approximate final percentage of marks equivalent to the computed final CGPA, the following
formula may be used
% of Marks = (Final CGPA – 0.5) x 10
12. Recounting & Revaluation
12.1 A student shall be eligible to apply for re-totaling of the SEE theory answer scripts by paying the
prescribed fee within one week from the announcement of the results. Notification to that extent shall be given by the
examination section specifying all details.
12.2 A student shall be eligible to apply for revaluation of the SEE theory answer scripts by paying the
prescribed fee within one week from the announcement of the results. Notification to that extent shall be given by the
examination section specifying all details.
12.3 There shall be no provision for re-totaling and /or revaluation of the answer books of SEE for laboratory
components of courses, including drawing, minor project, technical term paper, seminar, internship, and major project.
12.4 A student with who has secured ‘F’ grade in a theory course can improve CIE marks upto a maximum of
50% by attending special instruction classes held during summer.
13. Answer books verification and challenge valuation

13.1 If a student is not satisfied with his/her grades after revaluation, the student can apply for challenge
valuation within a week from the date of declaration of revaluation results.
13.2 The student has to apply in the prescribed format along with the payment of prescribed fee, to the
controller of examinations through the head of the department.
14. Supplementary Examinations

14.1 In addition to the regular Semester End Examinations held at the end of each semester, supplementary
examinations will be conducted during the academic year. Students taking the regular/supplementary examinations as
supplementary students may have to take more than one Semester End Examination per day. A student can appear for
any number of supplementary examinations till he clears all courses which he could not clear in the first attempt.
However, the maximum stipulated period cannot be relaxed under any circumstances.
15. Promotion to the next year of study

A student shall be eligible for promotion in B.Tech. programme, if he acquires the minimum number of credits as given
below:
15.1 A student shall be promoted from I Year II Semester to II Year I Semester programme of study only if he
fulfills the academic requirement of 50 % credits from the examinations held till the end of I Year II Semester including
supplementary examinations irrespective of the student taking the examination(s) or not.
15.2 A student shall be promoted from II Year II Semester to III Year I Semester programme of study only if he
fulfills the academic requirement of 60 % credits from the examinations held till the end of II Year II Semester including
15.3 A student shall be promoted from III Year II Semester to IV Year I Semester programme of study only if he
fulfills the academic requirement of 60 % credits from the examinations held till the end of III year II semester including
15.4 A student, who fails to earn 160 credits as indicated in the course structure within EIGHT academic years
from the year of his admission, shall forfeit his seat in B.Tech. Course and his admission stand cancelled.
16. Massive Open Online Courses

16.1 To meet the global requirements by providing greater flexibility to choose a variety of courses to inculcate
the habit of self-learning, in compliance with the UGC guidelines, Massive Open Online Courses (MOOCs) shall be
provided during the period of study.
16.2 The students are allowed to register MOOCs courses up to a maximum of 20% of total credits (32 credits)
under open electives/ professional electives courses. The proposed MOOCs would be additional choices in the program
elective/open elective group of courses subject to their offering by the department as well as their availability in MOOCs
platform during the respective semester. However, the Board of studies of the respective department can approve
contemporary courses from time to time under MOOCs.
16.3 Concerned departments shall declare the list of the courses that a student can pursue at the beginning of
the semester. Students interested in pursuing MOOCs shall register the course at their department at the beginning of the
semester against the courses that are announced by the department. Course progress shall be monitored by the course
coordinator of the department.
16.4 The grade equivalency for MOOCs courses shall be decided by the respective Board of Studies (BoS) and
is to be approved by the Chairman, academic council.
17. Eligibility for Award of B.Tech. Degree

A student will be declared eligible for the award of B.Tech. degree if he satisfies the following academic requirements:
17.1 The student shall pursue a programme of study for not less than four academic years and not more than
eight academic years.
17.2 The student shall register for 160 credits and earn all 160 credits by securing a minimum CGPA of 5.0.
17.3 The student, who fails to satisfy all the academic requirements for the award of the degree within eight
academic years from the year of his admission, shall forfeit his seat in B.Tech. Programme.
18. Award of Class

18.1 A student who registers for all the specified subjects/ courses as listed in the course structure and secures
the required number of 160 credits (with CGPA ≥ 5.0), within 8 academic years from the date of commencement of the
first academic year, shall be declared to have ‘qualified’ for the award of B.Tech. degree in the chosen branch of
engineering selected at the time of admission.
18.2 A student who qualifies for the award of the degree as listed in item 18.1 shall be placed in the following
classes.
CGPA earned from 160 credits B V Raju
Class Institute of Technology/ B Tech IT
Awarded
≥ 8.0 First Class with Distinction
≥ 6.5 - <8.0 First Class
≥ 5.5 - < 6.5 Second Class
≥ 5.0 - < 5.5 Pass Class
18.3 A student with final CGPA (at the end of the undergraduate programme) ≥ 8.00, and fulfilling the following
conditions - shall be placed in ‘first class with distinction’. However, he
i. Should have passed all the courses in ‘first appearance’ within the first 4 academic years (or 8 sequential
semesters) from the date of commencement of the first-year first semester.
ii. Should have secured a CGPA ≥ 8.00, at the end of each of the 8 sequential semesters, starting from I year I
semester onwards.
iii. Should not have been detained or prevented from writing the semester end examinations in any semester due to
shortage of attendance or any other reason.
18.4 A student not fulfilling any of the above conditions with final CGPA ≥ 8 shall be placed in ‘first-class’.
18.5 Students with final CGPA (at the end of the undergraduate programme) ≥ 6.50 but < 8.00 shall be placed
in ‘first-class’.
18.6 Students with final CGPA (at the end of the undergraduate programme) ≥ 5.50 but < 6.50, shall be placed
in ‘second class’.
18.7 All other students who qualify for the award of the degree (as per item 18.1), with final CGPA (at the end
of the undergraduate programme) ≥ 5.00 but < 5.50, shall be placed in ‘pass class’.
18.8 A student with final CGPA (at the end of the undergraduate programme) < 5.00 will not be eligible for the
award of the degree.
19. Consolidated Grade Card

A Consolidated grade card containing credits & grades obtained by the student will be issued after completion of the
B.Tech. Programme.
20. B.Tech. with Honors or Additional minors in Engineering

20.1 A student will be eligible to get B.Tech. Degree with Honors or Minors in Engineering, if he completes
additional credits for any ONE of the schemes.
20.2 Honors is for Vertical/Specialization in his/her OWN Branch for Research orientation and Minor in any
OTHER Branch for Improving Employability.
20.3 If a student drops (or terminated) from the Minor/Honors program, they cannot convert the earned credits
into open or core electives; they will remain extra. These additional courses will find mention in the grade sheet (but not in
the degree certificate).
20.4 A student can register for either for Honors or Minors and not for both.
21. B.Tech. with Honors in Engineering
21.1 Honors is an additional credential to allow a bright and motivated student to learn additional courses in his
own discipline during his undergraduate study. At the end of the second year first semester, a student may decide and
opt for Honors based on his interest. Students with CGPA of 8.0 at the end of the second year first semesterare eligible
for this optional program.
21.2 A student will be eligible to get B.Tech. degree with Honors in Engineering, if he completes an additional
20 credits during the course of study. The additional 20 credits required to attain B. Tech. with Honors are offered from II
Year II Semester onwards as decided by the respective Boards of studies.
21.3 A Student opting for ‘Honors’ will NOT be ENTITLED to register for ‘Minors’.
22. B.Tech. with Minors in Engineering

22.1 Minors is an additional credential to allow a bright and motivated student to learn additional courses in a
discipline other than his own discipline during his undergraduate study. At the end of the second year first semester, a
student may decide and opt for minors based on his interest. Students with CGPA of 8.0 at the end of the second year
first semester are eligible for this optional program.
22.2 A student will be eligible to get B.Tech. degree with Minors in Engineering, if he completes an additional
20 credits during the course of study. The additional 20 credits required to attain B. Tech. with Minors are offered from II
Year II Semester onwards as decided by the respective Boards of studies.
22.3 A Student opting for ‘Minors’ will NOT be ENTITLED to register for ‘Honors’.
23. Vertical Progression

23.1 It shall also be necessary to lay down uniform minimum standards for SGPA and CGPA together with the
minimum number of credits to be earned in a semester for the vertical progression of students. This shall be used in
facilitating the mobility of students from one college to another and also in avoiding any confusion among the students, the
a. Minimum Standard for SGPA = 5.0;
b. Minimum Standard for CGPA = 5.0;
24. Withholding of Results
A student who has not cleared the dues, if any, to the institute or if any case of indiscipline is pending against him, the
result of the student will be withheld and he will not be allowed into the next semester. His degree will be withheld in such
cases until he clears all the dues pending with the institution.
25. Transitory Regulations

25.1 A student who has discontinued for any reason, or has been detained for want of attendance or lack of
credits as specified, or who has failed after having undergone the degree programme, may be considered eligible for re-
admission to the same courses( or equivalent courses as the case may be), and same Professional Electives/Open
Electives( or from the set/category of electives as the case may be) as and when they are offered (within the time frame of
8 years from the date of commencement of his I year I semester).
25.2 A student on transfer shall complete the prescribed courses of the concerned programme not covered
earlier and however, he should take the remaining programme along with others.
25.3 There shall be no branch transfers after the admission process.
26. Graduation Ceremony

26.1 The college shall have its Annual Graduation Ceremony for the award of degree to students completing
the prescribed academic requirements in each case, in consultation with the university and by following the provisions in
the Statute.
27. Termination from the Programme

The admission of a student to the B.Tech. programme may be terminated and the student asked to leave the institute
under the following circumstances:
27.1 The student fails to satisfy the requirements of the programme within the maximum period stipulated for
that programme.
27.2 The student fails to satisfy the norms of discipline specified by the institute from time to time.
28. Amendments
28.1 The regulations hereunder are subject to amendments as may be made by the Academic Committee of
the college and approved by the chairman of the committee from time to time. Any or all such amendments will be
effective from such date and to such batches of students (including those already undergoing the programme) as may be
decided by the College Academic Committee.
29. General
29.1 Wherever the words “he”, “him”, “his”, occur in the write-up of regulations, they include “she”, “her”, “hers”.
29.2 The academic regulation should be read as a whole for the purpose of any interpretation.
29.3 In case of any doubt or ambiguity in the interpretation of the above rules, the decision of the chairman,
College Academic Committee is final.
******

ACADEMIC REGULATIONS FOR B.TECH. FOR LATERAL ENTRY STUDENTS
Applicable for the students admitted into II Year B.Tech. Lateral Entry Scheme from the Academic Year 2021-22 and
onwards.
1. Eligibility for award of B.Tech. Degree (LE) Scheme
The LE student shall pursue a Programme of study for not less than three academic years and not more than six
academic years.
1.1 The student shall register for 121.5 credits and earn121.5 credits from II to IV Year B.Tech. Programme (LE)
for the award of B.Tech. Degree.
1.2 The student, who fails to satisfy the requirement for the award of the degree in 6 consecutive academic years
from the year of admission, shall forfeit his seat.
1.3 The attendance regulations of B.Tech. (Regular) shall be applicable to B.Tech. (LES).
2. Promotion Rule
A student shall be eligible for promotion in B.Tech. Programme, if he acquires the minimum number of credits as given
below:
2.1 A student shall be promoted from II Year II Semester to III Year I Semester programme of study only if he
satisfies the academic requirement of 50 % credits from the regular and supplementary examinations held till the end of II
Year II Semester irrespective of the student taking examination(s) or not.
2.2 A student shall be promoted from III Year II Semester to IV Year I Semester programme of study only if
he fulfills the academic requirement of 50 % credits from the regular and supplementary examinations held till the end of
III Year II Semester irrespective of the student taking examination(s) or not. B V Raju Institute of Technology/ B Tech IT
2.3 A student shall register and put up minimum attendance in all 121.5 credits and earn all 121.5 credits to
be eligible for award of degree.
2.4 A student, who fails to earn 121.5 credits as indicated in the course structure within SIX academic years
from the year of his admission, shall forfeit his seat in B.Tech. Programme and his admission stands cancelled.
3. Award of Class
After a student has satisfied the requirement prescribed for the completion of the programme and is eligible for the award
of B.Tech. Degree, he shall be placed in one of the following four classes:
CGPA earned from 121.5 Credits Class Awarded

≥ 8.0 First Class with Distinction
≥6.5 - <8.0 First Class
≥5.5 - <6.5 Second Class
≥5.0 - <5.5 Pass Class
4. All the other regulations as applicable to B.Tech. Four year degree programme (Regular) will hold good for
B.Tech. (Lateral Entry Scheme).
******
FAILURE TO READ AND UNDERSTAND THE
REGULATIONS IS NOT AN EXCUSE
All the rules and regulations, specified herein afte

for the purpose of interpretation and when a doubt
of the Chairman, Academic Council, B V Raju
(Autonomous) is final. As per the requirements
Principal, B V Raju Institute of Technology (Au
Chairman of the College Academic Council.
DEPARTMENT OF INFORMATION TECHNOLOGY

(B.Tech Course structure applicable for students admitted from 2020-21)
I. STRUCTURE OF THE PROGRAM

The program consists of courses based on humanities and social sciences, basic sciences, engineering
sciences, program core, program electives, open electives, industry internship, laboratories, mandatory
courses and project work.
Broad Course Total

S. No. Course Group or Category Course Description
Classification Credits
1 Foundation Humanities, Social English, humanities, social sciences,

Courses sciences & Management management 9.5
(HS)
Basic Sciences (BS) Mathematics, Physics, Chemistry 24
Engineering Sciences (ES) Fundamental Engineering Courses 25
2 Core Courses Professional Core (PC) Professional courses-core relevant

54
and Core to the discipline
activities
Project work (PW) Minor & Major project (Institute/
Industry), Internship (Industry/
14.5
research organization), Seminar &
technicalBterm
V Raju Institute
Paper of Technology/ B Tech IT
(Institute)
3 Elective Professional Electives (PE) Professional courses- electives

18
Courses relevant to the discipline
Open Electives (OE) Electives from other departments

15
and or emerging areas
4 Mandatory Mandatory Courses (MC) Courses on Environmental sciences,

No Credits
Courses Ethical values, Indian constitution.
II. INDUCTION PROGRAM
Induction Program 3 Weeks duration

(Mandatory)
Induction program for students to be ● Physical activity
offered right at the start of the first ● Creative Arts
year first semester
● Universal Human Values
● Literary
● Proficiency Modules
● Lectures by Eminent People
● Visits to local Areas
● Familiarization to Dept./Branch & Innovations
III. SEMESTER-WISE STRUCTURE OF CURRICULUM
[L: Lecture, T: Tutorials, P: Practicals, C: Credits, CIE: Continuous Internal Examination, SEE:
Semester End Examination]
I-YEAR I-SEMESTER
S.NO CODE COURSE TITLE CAT L T P C CIE SEE TOTAL

Principles of Electrical and
1 A41BA ES 3 - - 3 40 60 100
Electronics Engineering
2 A41NB Linear Algebra and Calculus BS 3 - - 3 40 60 100
3 A41NE Applied Physics BS 3 - - 3 40 60 100

Computational Thinking and
4 A41HA ES 2 1 - 3 40 60 100
Problem Solving Techniques
Electrical and Electronics
5 A411B ES - - 3 1.5 40 60 100
Engineering Lab
6 A412C Workshop ES - - 3 1.5 40 60 100
7 A413N Physics Lab BS - - 3 1.5 40 60 100

Computational Thinking
8 A411H ES - - 3 1.5 40 60 100
Essentials Lab
Environmental Science and
9 A4104 MC 2 - - - - - -
Rural Sensitization
TOTAL 13 1 12 18 320 480 800
I-YEAR II-SEMESTER
1 A42NA Communicative English HS 3 - - 3 40 60 100
2 A42NG Advanced Calculus BS 3 - - 3 40 60 100
3 A42ND Applied Chemistry BS 3 - - 3 40 60 100
4 A42HA Foundations of Computer

PC 3 - - 3 40 60 100
Design
Programming for Problem
5 A42EA ES 2 - - 2 40 60 100
Solving using Python
English Language and
6 A421N HS - - 3 1.5 40 60 100
Communication Skills Lab
7 A421C Engineering Graphics Lab ES - - 4 2 40 60 100
8 A422N Chemistry Lab BS - - 3 1.5 40 60 100

Programming for Problem
9 A421H ES - - 3 1.5 40 60 100
Solving using Python Lab
10 A4201 NSS MC 2 - - - - - -
11 A4202 NSO
12 A4203 Yoga
TOTAL 16 - 13 20.5 360 540 900

II-YEAR I-SEMESTER
1 A43H1 Advanced Data Structures PC 3 - - 3 40 60 100
2 A43H2 Software Engineering with UML PC 3 - - 3 40 60 100
3 A43NA Probability and Statistics BS 3 - - 3 40 60 100
4 A43LA Introduction to Artificial Intelligence ES 3 - - 3 40 60 100

Mathematical Foundations of Computer
5 A43HA ES 2 1 - 3 40 60 100
Science
6 A431H Advanced Data Structure Lab PC - - 3 1.5 40 60 100
Artificial Intelligence and Machine
7 A432H PC - - 3 1.5 40 60 100
Learning Lab
8 A431N Business Communication Lab HS - - 2 1 40 60 100
9 Open Elective-1 OE 3 - - 3 40 60 100
10 A4302 Indian Constitution MC 2 - - - - - -

19 1 8 22 360 540 900
TOTAL
II-YEAR II-SEMESTER
1 A44HA OOP through Java Programming PC 3 - - 3 40 60 100
2 A44EA Database Management Systems PC 2 1 - 3 40 60 100
3 A44EB Design and Analysis of Algorithms PC 2 1 - 3 40 60 100

Numerical Methods and Linear
4 A44NC BS 3 - - 3 40 60 100
Transformations
5 A44E1 Bio Informatics BS 3 - - 3 40 60 100
6 A441H OOP through Java Programming Lab PC - - 3 1.5 40 60 100
7 A442H Database Management Systems Lab PC - - 3 1.5 40 60 100
8 A443H Minor Project PW - - 3 1.5 100 - 100
9 Open Elective-2 OE 3 - - 3 40 60 100
10 A4402 Gender Sensitization MC 2 - - - - - -
18 2 9 22.5 420 480 900

TOTAL
III-YEAR I-SEMESTER
1 A45EA Computer Networks PC 3 - - 3 40 60 100
2 A45H1 Operating Systems PC 3 - - 3 40 60 100
3 Professional Elective-1 PE 3 - - 3 40 60 100

Fundamentals of Design
5 A45CA ES 3 - - 3 40 60 100
Thinking
Business Economics and
6 A45PA HS 3 - - 3 40 60 100
Financial Analysis
Computer Networks and
7 A451H PC - - 3 1.5 40 60 100
Operating Systems Lab
IoT and Computer
8 A452H PC - - 3 1.5 40 60 100
Algorithms Lab
9 A453H Technical Term Paper PW - - 2 1 100 - 100
TOTAL 18 8 22 420 480 900
III-YEAR II-SEMESTER
S.NO CODE COURSE TITLE CAT L T BV

P Raju C CIE
Institute SEE TOTAL
of Technology/ B Tech IT
Automata and Compiler
1 A46HA PC 2 1 - 3 40 60 100
Design
Open Source Web
2 A46H1 PC 3 - - 3 40 60 100
Development
3 A46H2 Data Analytics using R PC 2 1 - 3 40 60 100

English for Career
6 A461N HS - - 2 1 40 60 100
Development Lab
Open Source Web
7 A461H PC - - 3 1.5 40 60 100
Development Lab
8 A462H Data Analytics using R Lab PC - - 3 1.5 40 60 100
Human Values and
9 A4601 MC 2 - - - - - -
Professional Ethics
15 2 8 19 320 480 800
TOTAL
IV-YEAR I-SEMESTER
1 Deep Learning PC 3 - - 3 40 60 100

2 Security Analytics PC 2 1 - 3 40 60 100
5 Deep Learning Lab PC - - 3 1.5 40 60 100
6 Security Analytics Lab PC - - 3 1.5 40 60 100
7 Seminar PW - - 2 1 100 - 100
8 Summer Internship PW - - 4 2 100 - 100
11 1 12 18 440 360 800

TOTAL
IV-YEAR II-SEMESTER
1 Open Elective-3 OE 3 - - 3 40 60 100
2 Open Elective-4 OE 3 - - 3 40 60 100
3 Open Elective-5 OE B
3 V Raju
- Institute
- 3of Technology/
40 60B Tech100
IT
4 Major Project PW - - 18 9 40 60 100
9 18 18 160 240 400

TOTAL
IV. SEMESTER-WISE DISTRIBUTION OF CREDITS
Semester I-I I-II II-I II-II III-I III-II IV-I IV-II Total
Credits 18 20.5 22 22.5 22 19 18 18 160
Professional Electives
Semester PE CODE Course

III-I PE1 A45H2 Computer Graphics
A45H3 Software Project Management
A45H4 Internet of Things
A45H5 Linux Programming
A45H6 Principles of Programming Languages
A45H7 Mobile Application Development
A45H8 Graph Theory
PE2 A45H9 High Performance Computing
A4581 Pattern Recognition
A45EB Cloud Computing
A46H3 Ethical Hacking
A46H4 Software Testing
PE3 A46H5 Cryptography Network Security
A46H6 Design Patterns
A46H7 Advanced Compiler Design
III-II
A46H8 Network Protocols
A46HB Scripting Languages
PE4 A46H9 Information Retrieval System
A4681 Distributed Systems
A46EC Data Visualization Techniques
Data Center Virtualization
Data Analytics-II
PE5 Block Chain Technologies
NoSQL Database
Multimedia & Rich Internet Applications
IV-I
Ad-Hoc Sensor Networks
Robotics
PE6 Human Computer Interaction
Semantic Web and Social Networks
Speech and Natural Language Processing
PRINCIPLES OF ELECTRICAL AND ELECTRONICS ENGINEERING

(Common to CSE, CSE (AI & ML), CSE (DS), IT, ECE, EEE, BME)
I Year B.Tech. IT I Sem L T P C
CODE: A41BA 3 - - 3
Course Objectives:
This course provides basic knowledge of Electrical and Electronic devices and applications.
1. To familiarize the students with the principles of electrical circuits, network theorems and electrical
machines.
2. To familiarize the students with the principle of operation, analysis and design of Junction
diode and Bipolar Junction Transistor.
UNIT- I: INTRODUCTION TO ELECTRICAL CIRCUITS: 10 Lectures

Circuit Concept – R,L,C parameters - Voltage and Current sources - Source transformation - Voltage - Current
relationship for passive elements. Kirchhoff’s laws - network reduction techniques - Series, Parallel, Series-
parallel, Star-to-Delta or Delta-to-Star transformation. Nodal analysis, mesh analysis, super node and super
mesh analysis for DC Excitation, Numerical problems with independent sources only.
UNIT- II: SINGLE PHASE A.C CIRCUITS: 10 Lectures
R.M.S, Average values and form factor for different periodic wave forms, Steady state analysis of R, L and C (in
series, parallel and series parallel combinations) with sinusoidal excitation - Concept of Reactance, Impedance,
Susceptance and Admittance - Phase and Phase difference - concept of power factor, Real and Reactive powers
- j-notation, Complex and Polar forms of representation, Complex power.
UNIT III: NETWORK THEOREMS AND MACHINES: 10 Lectures

Network Theorems:Thevenin's, Norton's, Superposition, Reciprocity, Maximum Power Transfer, Compensation,
Millman'sand Tellegen's theorems for DC excitation.
DC Machines: Types - Construction Details- Principle and operation of DC Generator and Motor- EMF equation -
Applications, Numerical Problems, Principle and operation of three-point starter.
AC Machines: Single phase Transformer, Three Phase Induction Motor and Alternator – Construction and
Principle of operation, Applications
UNIT-IV: RECTIFIERS & SPECIAL PURPOSE DEVICES: 9 Lectures

Review of PN Junction diode, V-I Characteristics.
Rectifiers: Diode as a Rectifier - Half Wave Rectifier, Full Wave rectifierB with centre
V Raju tapped
Institute transformer, BBridge
of Technology/ Tech IT
Rectifier, Rectifier with filter (capacitor & Inductor).
Special Purpose Devices: Zener diode as regulator, SCR. Tunnel diode, Varactor diode.
UNIT-V: BIPOLAR JUNCTION TRANSISTOR (BJT): 9 Lectures
Construction, Principle of Operation, Symbol, current components of BJT, CB, CE, CC configurations, DC & AC
load line, stability factor, different transistor biasing techniques, Thermal runaway and stability.
Course Outcomes: After completion of course, the student should be able to

1. Apply the circuit laws and network reduction techniques to solve electrical dc circuits for branch voltages
and currents. (L3)
2. Solve the voltages, currents and complex power in single phase AC circuits. (L3)
3. Apply the network theorems for circuits to find the voltages and currents and demonstrate the working
principles of AC & DC machines. (L3)
4. Determine the performance parameters of half wave and full wave rectifiers with and without filters and
outline the concepts of special purpose devices. (L2)
5. Illustrate the configurations and biasing techniques of Bi-polar Junction Transistor. (L2)
Text Books:
1. Basic Electrical Engineering (Third Edition). D.P. Kothari, I.J. Nagrath,Published by Tata McGraw-Hill
Education Pvt. Ltd., 2009.
2. Electronic Devices and Circuits-3rd Edition by Jacob Millman, Christos C Halkias, SatyabrataJit, McGraw
Hill.
3. Network Theory: N. C. Jagan, C. Lakshmi Narayana, BS publication, 3rd edition, 2005.
Reference Books:
1. Electrical Engineering Fundamentals by Vincent Del Toro, Pearson.
2. Electronic Devices and Circuit Theory– R.L. Boylestad and Louis Nashelsky, PEI/PHI, 9th Ed, 2006.
3. Network Theory by Sudhakar, Shyam Mohan Palli, TMH.
4. Introduction to Electronic Devices and Circuits-Rober T. Paynter, Pearson Education.
5. Engineering Circuit Analysis - William Hayt and Jack Kemmerly, TMH, 8th Edition, 2011.
LINEAR ALGEBRA AND CALCULUS

(Common to CSE, CSE (AI & ML), CSE (DS), IT, ECE, EEE, BME, CE, ME, CHE, PHE)
CODE: A41NB 3 - - 3
Course Objectives: To learn

1. Concept of a rank of the matrix and applying this concept to know the consistency and solving the
system of linear equations.
2. Concept of Eigen values and Eigenvectors, Methods of reduction of quadratic form to canonical form.
3. Geometrical approach to the mean value theorems and their application to mathematical problems and
finding maxima and minima of function of two and three variables.
4. Methods of solving the ordinary differential equations of first order.
5. Methods of solving the ordinary differential equations of higher order.
Unit-I: Matrices 10 Lectures

Matrices: Types of Matrices, Symmetric, Skew-symmetric, Orthogonal, Hermitian, Skew-Hermitian, Unitary; Rank
of a matrix by Echelon form and Normal form, Inverse of non-singular matrices by Gauss-Jordan method, System
of linear equations: solving system of homogeneous and non-homogeneous equations by Gauss elimination
method.
Unit-II: Eigenvalues and Eigenvectors 10 Lectures

Eigenvalues and Eigenvectors and their properties; Diagonalization of a matrix; Cayley-Hamilton Theorem
(without proof), finding inverse and powers of a matrix by Cayley-Hamilton Theorem, Real Quadratic form, Matrix
representation, Reduction of Quadratic form to canonical form by orthogonal transformation, rank and nature of
the quadratic form.
Unit-III: Mean value theorems and Functions of Several Variables 9 Lectures

Mean value theorems: Rolle’s Theorem, Lagrange’s Mean value theorem with their Geometric and Algebraic
Interpretations, Cauchy’s Mean value theorem,Taylor’s and Maclaurin’s series, Partial differentiation, Total
derivative,Jacobians, Functional dependence, Maxima and Minima of functions of two and three variables,
Lagrange’s method of undetermined multipliers.
Unit-IV: First Order Ordinary Differential Equations and Applications 8 Lectures

Review of first order ODE, Exact, Reducible to exact equations, linear and Bernoulli’s equations, Orthogonal
Trajectories, Newton’s law of cooling, law of natural growth and decay.
Unit-V: Higher Order Ordinary Differential Equations 11 Lectures

Second and higher order linear differential equations with constant coefficients, Non-Homogeneous terms of the
type, Polynomials in , and
, method of variation of parameters, equations reducible to linear equations with constant coefficients:
Cauchy-Euler and Legendre’s linear equations.
Course Outcomes:
After completing the course, the students will be able to:
1. Apply matrix techniques to solve system of linear equations.(L3),
2. Find the Eigen values and Eigenvectors. Reduce the Quadratic form to canonical form.(L3)
3. Apply Mean value theorems for given functions and also find maxima and minima for functions of two
and three variables.(L3)
4. Formulate an ODE and solve real time engineering problems. (L3)
5. Solve higher Ordinary differential equations by analytical methods.(L3)
Text Books:
1. B.S. Grewal, Higher Engineering Mathematics, 42nd Edition, Khanna Publishers
2. N.P. Bali and Manish Goyal, A text book of Engineering Mathematics, Laxmi Publications, Reprint,
2008.
Reference Books:
1. Erwin kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley & Sons,2006.
2. D. Poole, Linear Algebra: A Modern Introduction, 2nd Edition, Brooks/Cole, 2005.
3. S.L. Ross, Differential Equations, 3rd Edition, Wily India, 1984.
4. G.B. Thomas and R.L. Finney, Calculus and Analytic geometry, 9th Edition, Pearson,Reprint, 2002.
5. Veerarajan T., Engineering Mathematics for first year, Tata McGraw-Hill, New Delhi,2008.
6. R. K. Jain and S. R. K. Iyengar, "Advanced Engineering Mathematics", Fifth Edition, Narosa Publishing
House, 2016.
7. Ramana B.V., Higher Engineering Mathematics, Tata McGraw Hill New Delhi, 11thReprint, 2010
APPLIED PHYSICS
CODE: A41NE 3 - - 3
Course Objectives:
1. To understand the fundamentals of Intrinsic and extrinsic semiconductors.

2. Study the formation, properties and applications of p-n junction devices.
3. To develop a solid grasp of core concepts and applications of important optoelectronic devices.
4. To understand basic lasing action, study various types of lasers and to learn fundamentals of fiber optics.
5. To study different properties and applications of magnetic materials and get expose to few unique properties of
Superconductors.
Unit-I: Semiconductors Physics 9 Lectures
Energy bands formation in solids, classification of solids, Introduction to semiconductors and types of
semiconductors, Fermi Dirac Distribution Function Intrinsic semiconductors-Carrier concentration, Fermi Energy
level, Electrical Conductivity, extrinsic semiconductors-Carrier concentration of P-type and N-type, dependence
of Fermi level on carrier-concentration and temperature, Hall effect, determination of Hall coefficient, significance
of Hall Effect.
Unit-II: Semiconductor devices 9 Lectures

Carrier generation and recombination, radiative and non-radiative recombination mechanisms, Carrier Transport:
diffusion and drift. Formation of p-n junction, Forward and Reverse bias, V- I characteristics, PN junction diode-
Zener and avalanche breakdown mechanisms, Applications of PN junction diode.
Unit-III: Basic Optoelectronic Devices 9 Lectures
Light Emitting Diode (LED): Electro-luminescence, LED materials, construction and working of LED,
characteristics of LED, Advantages and applications of LED.
PN junction photo diode, photo voltaic and photo conductive mode, construction and working of photo-diode,
Avalanche Photo diode.Generations of solar cells (Brief Introduction), Construction and working of solar cell, V-I
characteristics of solar cell, conversion efficiency, fill factor, applications of solar cells.
Unit-IV: LASER & Fiber Optics 9 Lectures
Lasers: Introduction, characteristics of LASER, absorption, spontaneous and stimulated emission, Einstein
coefficients, population inversion, meta stable state, pumping, optical feedback, ruby laser, He-Ne laser,
Semiconductor Diode laser, applications of lasers. Fiber Optics Introduction, principle, structure, acceptance
angle and numerical aperture, types of fibers: step index and graded index, attenuation in optical fibers,
advantages and applications of optical fibers.
Unit-V: Magnetic materials and Superconductivity 9 Lectures
Classification of magnetic materials- dia, para, ferro, anti-ferro, ferri and their properties, domain theory of
ferromagnetism, hysteresis curve, soft and hard magnetic materials, B Vapplications
Raju Instituteofof magnetic materials.
Technology/ B Tech IT
Introduction to superconductivity, critical temperature, critical magnetic field, critical current density, isotope
effect, Persistent currents, Meissner effect, Type-I and type-II superconductors, BCS theory (Qualitative),
Applications of superconductors.
Course Outcomes: After completing the course, the students will be able to:
1. Interpret the difference between of Intrinsic and extrinsic semi-conductors.
2. Explain in detail about the formation, properties and applications of p-n junction devices.
3. Comprehend the core concepts and identify different applications of important optoelectronic devices.
4. Describe the working of various types of lasers and to explain the fundamentals of fiber optics.
5. To interpret the specific properties and distinct applications of magnetic materials& get aware of unique
properties of Superconductors.
Text Books:
1. M.N. Avadhanulu and P.G. Kshirsagar, TVS Aruna Murthy “A Text Book Engineering Physics”, S. Chand,
2019.
2. P. K. Palanisamy, “Engineering Physics”, Scitech Publications
Reference Books:
1. B K Pandey, S Chaturvedi, Ch. Srinivas, Ch. SeshuBabu& E. LaxmiNarsaiah “Engineering Physics”,

Cengage Learning, 2018.
2. S.O. Pillai, “Solid State Physics”, New Age International Publishers
3. P. Bhattacharya, “Semiconductor Optoelectronic Devices”, Prentice Hall of India (1997).
4. J. Singh, “Semiconductor Optoelectronics”, Physics and Technology, McGraw-Hill Inc. (1995).
5. B. E. A. Saleh and M. C. Teich, Fundamentals of Photonics, John Wiley & Sons, Inc., (2007).
6. Yariv and P. Yeh, Photonics: Optical Electronics in Modern Communications, Oxford University Press, New
York (2007).
COMPUTATIONAL THINKING AND PROBLEM SOLVING TECHNIQUES
CODE: A41HA 2 1 - 3
Course Objectives: On completion of this course, student will:
1. To provide a working definition for the concept of computational thinking

2. To solve a problem using tools like flow charts, pseudo code to express the algorithms
3. To understand how lists, trees, and graphs are correlated to familiar
concepts such as family trees, road maps, and organizational charts
4. To develop a base for advanced study in Problem Solving heuristic techniques and design techniques
Unit 1 8 Lectures
Introduction to Computational thinking- Definition, objectives, how is computational thinking used? Logical
and algorithmic thinking, Problem solving and Decomposing complex problem.
Introduction to Information and data: Definitions, converting information into data, Data capacity, Data types,
Data Encoding and Data Compression.
Unit 2 10 Lectures
Computational Problems: Standard problems, [GCD, Factorial of a number,
B V Raju Institute of Technology/ Bfactors
Finding roots, Generating Tech IT
of a number, Checking for leap year], Permutations and Combinations, simple and compound interests, ratio and
proportion, partnership problems and Number series problems (fibonocci series, natural numbers, even numbers,
prime numbers, multiplication table, palindrome numbers).
Problem solving elements-Algorithms, Definition and characteristics; Flowchart, notations and symbols
(selection and repetition); Pseudo code and its representation, writing of pseudo code for various problems;
Activity diagram notations with examples.
Unit 3 9 Lectures
Data organization: Lists-arrays; Graphs-Terminology and properties, Hierarchies- organizational charts, family
tree, String- basics, string operations, patterns, how to write a pattern, repetition rules.
Unit 4 10 Lectures
Problem Solving heuristic Techniques: Recursive and Non-recursive techniques. Problem solving designing
techniques: Brute force, divide and conquer and greedy strategies.
Unit 5 9 Lectures
Modeling Solutions: Top down design for the given problem statements-The process flow of an ATM machine,
Hospital management system, Online shopping (E-commerce), Interpreting COVID-19 test results.
Problem Solving Cycle: Problem Definition, Logical reasoning, Decomposition, Abstraction: Class diagrams and
Use Case diagrams. Designing solution for Railway reservation system and Library management system.
Course Outcomes:
1. Experiencing the importance of computational thinking.

2. Selecting basic arithmetic operations in solving mathematical problems using mental methods, paper-
and-pencil and other tools.
3. Able to understand and use the main concepts for organizing information, to develop algorithms for
addressing computational related tasks.
4. Formulating problems to enable computer and other tools to solve them.
5. Solving real-world complex problems using divide and conquer like strategies
Text Books:
1. David Riley and Kenny Hunt, Computational Thinking for Modern Solver, Chapman & Hall / CRC, 2014
2. “Computational Thinking - A beginner's guide to problem-solving and programming” by Karl Beecher,
Released August 2017, Publisher(s): BCS Learning & Development Limited, ISBN: 9781780173641
Reference Books:
1. R. G. Dromey, “How to solve it by Computer”, PHI, 2008 Symbiosis International University, PUNE
2. www2.cs.uidaho.edu/~mdwilder/cs112/syllabus.pdf -University of Idaho, Moscow, ID 83844
3. https://www.coursera.org/learn/computational-thinking-problem-solving. - Created by University of
Pennsylvania and powered by Coursera
4. https://www.sciencedirect.com/science/article/pii/S2405844019364801 - Research article “Skills in
computational thinking of engineering students of the first school year”
5. T. Doleck, P. Bazelais, D.J. Lemay, et al. “Algorithmic thinking, cooperativity, creativity, critical thinking,
and problem solving: exploring the relationship between computational thinking skills and academic performance”
6. J. Comput. Educ., 355 (2017), p. 4, 10.1007/s40692-017-0090-9
7. J. M. Wing, “Computational thinking,” Communications of the ACM, vol. 49, no. 3, 2006.
https://doi.org/10.1145/1118178.1118215

ELECTRICAL AND ELECTRONICS ENGINEERING LAB
CODE: A411B - - 3 1.5
PART–A: ELECTRICAL ENGINEERING

(Any of 2-Demonstrations and 3 other experiments from below are mandatory)
Pre-Requisites:
The students should have the knowledge on
1) Basics of mathematics, vectors, calculus, algebra & trigonometry.
2) Principles of magnetic materials, magnetic flux.
3) Ammeters, voltmeters & multi meters.
4) Definitions and properties of electric current, voltage and power.
Course Objectives:
The course should enable the student’s ability to
1) Provide working knowledge on basic electrical circuit laws and principles.
2) Impart a basic knowledge on safety precautions,cut-out sections of electrical machines
B V Raju Institute&ofoperating
characteristics of PN Junction Diode, Zener Diode, rectifiers and transistors.
1. Demonstration: Basic safety precautions. Introduction and use of measuring instruments – voltmeter,
ammeter, multi-meter, oscilloscope. Real-life resistors, capacitors and inductors.
2. Demonstration of cut-out sections of machines: DC machine (commutator-brush arrangement).
3. Demonstration of cut-out sections of machines: Induction machine (squirrel cage rotor), synchronous
machine (field winding - slip ring arrangement) and single phase induction motor.
4. Verification of KCL and KVL.
5. Verification of superposition Theorem.
6. Verification of Thevenin’s Theorem.
7. Verification of Norton’s Theorem.
8. Verification of RMS, Average value, Form factor of a sinusoidal AC waveform.
PART–B:ELECTRONICS
(Any of 5-Experiments from below is mandatory)
1. Volt-Ampere characteristics of PN Junction Diode.
2. Volt-Ampere characteristics of Zener Diode.
3. Half wave rectifier with and without filters.
4. Full wave rectifier with and without filters.
5. Common Base (CB) characteristics (Input & output).
6. Common Emitter (CE) characteristics (Input & output).
7. Determination of h parameters from CE transistor characteristics.
Course Outcomes: After completion of course, the student should be able to

1. Determine the branch currents and voltages using KCL, KVL, superposition, Thevenin’s and Norton’s
theorems on given circuit. (L3)
2. Demonstrate the cut-out sections of DC machines and AC machines with their performance
characteristics. (L3)
3. Examine RMS, Average value, Form factor of a sinusoidal AC waveform.(L3)
4. Experiment with PN Junction diode and Zener diode to sketch the Volt-Ampere characteristics.
5. Inspect the Half and Full wave rectifiers with and without filters.(L2)
6. Construct the input and output characteristics of BJT for CB and CE configurations.(L2)
WORKSHOP
CODE: A412C - - 3 1.5
Course Objectives:
1. To know the different popular manufacturing process
2. To provide hands on experience about use of different engineering materials,
tools, equipment and processes those are common in the engineering field
3. Apply basic electrical engineering knowledge for house wiring practice
4. Practice on manufacturing of components using workshop trades including fitting, carpentry, Plumbing, sheet metal
Lectures & Videos:

1. Manufacturing Methods - Casting, Forming, Machining, Joining, Advanced Manufacturing Methods
2. CNC Machining, Additive Manufacturing
3. Fitting Operations & Power Tools
4. Electrical & Electronics
5. Carpentry
6. Plastic Moulding, Glass Cutting
7. Welding (Arc Welding & Gas Welding), Brazing
8. Power Tools
9. Printed Circuit Boards
List of experiments:
I. CARPENTRY (Any 2)
▪ To make a cross lap joint from the given wood piece.
▪ To make a dovetail lap joint from the given wood piece.
▪ To make a Mortise and tenon joint from the given wood piece.
▪ To make a T bridle joint from the given wood piece.
II. FITTING (Any 2)

▪ To make a square filing with drilling and tapping.
▪ To prepare a L-fitfrom the given raw material.
▪ To make a square fit from the given raw material.
▪ To make a V-Fit from the given raw material.
III. ELECTRICAL & ELECTRONICS(Any 3)

▪ To make connections for one lamp controlled by one switch control.
▪ To make connections for two lamps controlled by one switch - series connection.
▪ To make connections for two lamps controlled by one switch - parallel connection.
▪ Translation of any tested / designed and tested circuits on a PCB.
▪ To make connections for staircase wiring (i.e. control of one lamp by two switches fixed at two different places).
IV. PLUMBING: Practice of Internal threading, external threading, pipe bending, and pipe fitting, Pipes with coupling
for same diameter and with reducer for different diameters and Practice of T-fitting, Y-fitting, Gate valves fitting.
V. SHEETMETAL (Any 3)
▪ To make a rectangular tray as per given dimensions.
▪ To prepare a 900-pipe joint.
▪ To make an Open scoop as per given dimensions.
▪ To prepare a Square Tin from the sheet metal as per given dimensions.
VI. POWER TOOLS: Study of different hand operated power tools, uses and their demonstration and Practice of all
available Bosch Power tools.
Demonstration: Foundry, Blacksmithy, Welding, Machine shop: Study of machine tools in particular Lathe machine (different
parts, different operations, study of cutting tools)
Course Outcomes: After completion of the course, the student will be able to:
1. Prepare basic house joints used in carpentry

2. Prepare different joints for better joints in fitting
3. Perform basic house wiring connections
4. Create different shapes and objects by using Sheet metal
5. Perform different types of connections in plumbing
Reference Books:
1. Engineering Workshop practice for JNTU, V. Ramesh Babu, VRB Publishers Pvt. Ltd.
2. Workshop Manual / P.Kannaiah/ K.L.Narayana/ SciTech Publishers.
3. Engineering Practices Lab Manual, Jeyapoovan, SaravanaPandian, Vikas publishers
4. Dictionary of Mechanical Engineering, GHF Nayler, Jaico Publishing House

PHYSICS LAB
(Common to CSE, CSE (AI & ML), CSE (DS), IT, ECE, EEE, BME, CE, ME, CHE, PHE, CSBS)
CODE: A413N - - 3 1.5
Course Objectives:
1. To develop experimental skills which are very essential for an Engineering student.
2. To provide hands on experience on some of important concepts in Applied Physics
3. To make student better understand few complex topics using demonstration method
List of Experiments
1. Torsional Pendulum: To determine the rigidity modulus of material of a given wire using Torsional
Pendulum
2. Melde’s experiment – Transverse & Longitudinal modes: To determine the frequency of electrically
tuning fork using Melde’s arrangement
3. Optical Fiber: To evaluate the Numerical Aperture of a given fiberB V Raju Institute of Technology/ B Tech IT
4. Sonometer: To determine the frequency of AC Mains using Sonometer
5. Diffraction Grating-LASER: To determine the wavelength of LASER source using Diffraction Grating
6. Newton’s Rings: To determine the radius of curvature of Plano convex lens
7. Energy gap: To determine the energy gap of semiconductor material of P-N Junction
8. LCR Circuit: To determine the resonant frequency of L-C-R Circuit.
9. RC Circuit: To determine time constant of RC circuit
10. Stewart & Gees method: To determine the Magnetic field induction along the axis of current carrying coil
using Stewart & Gees method (DEMONSTRATION)
11. Hall Effect: To determine hall-coefficient and estimate the type of semiconductor (DEMONSTRATION)
12. Solar Cell: To study the V-I characteristics of solar cell (DEMONSTRATION)
Note: Minimum 8 experiments are to be performed
1. Demonstrate Newton’s rings experiment to understand the interference of light.

2. Compare LCR circuit with mechanical oscillator to understand the resonance
3. Identify the type of material of by calculating energy band gap of semiconductor materials
4. Apply the Bragg’s law to calculate wavelength of LASER source using diffraction grating
5. Make use of Stewart & Gees experiment to study the variation of magnetic field along the axis of current
carrying loop
Laboratory Manual:
1. Laboratory Manual of Engineering Physics by Dr. Y. Aparna & Dr. K. Venkateshwara Rao (V.G.S
Publishers).
2. Practical Physics by G L Squires, Cambridge University press, Cambridge, 1985.
3. Physics Lab Manual, BVRIT.
COMPUTATIONAL THINKING ESSENTIALS LAB

CODE: A411H - - 3 1.5
Learning outcomes:
Computational thinking involves solving problems, designing systems by drawing on the concepts fundamental to
computer science. This course is designed to introduce the programming concepts, program development cycle
and covers various tools and techniques for problem solving such as Algorithms, Flowcharts, Pseudo code and
computer programs.
Course Objectives: By the end of the course, students will be able to develop an algorithm and express it to the
computer by writing a simple program. On completion of this course student will:
o To provide a working definition for the concept of computational thinking

o To solve a problem using tools like flow charts, pseudo code to express the algorithms and
implementation using simple C programs
o To understand how lists, trees, and graphs are correlated to familiar
concepts such as family trees, road maps, and organizational charts
o To develop a base for advanced study in Problem Solving heuristic Techniques and implementation
using C programs
o To develop modular and readable C programs using concepts like functions, arrays etc.
Syllabus: B V Raju Institute of Technology/ B Tech IT
Week 1 and 2: Introductory to Computer Concepts with Hands-on Computer Hardware, Software and
Tools usage
Week 1: System Troubleshooting

Hardware Troubleshooting: Students must be given a PC, which does not boot due to improper assembly or
defective peripherals and configure the system.
TASK: Suppose if Sushant is using his desktop and its running very slow how will he resolve the issue to work
properly.
TASK: Identifying/building advanced computer configuration
Week 2: System Software
Software Troubleshooting: Students must be given a malfunctioning CPU due to system software problems. They
should identify the problem and fix it to get the computer back to working condition and simple program execution
process.
Week 3: Programming examples using Data Types
● Problem solving skills
● Pseudo code, Flowcharts and Algorithms
● Live Coding examples with flowcharts and algorithms
● Workshop on coding using flowcharts
● C Program Structure
● Header files, Constants
● Tokens in C
Week 4: Programming examples using operators

● Operators in C
● Arithmetic, Relational, Logical
● Assignment, Ternary/Conditional
● Unary
● Bitwise / Special
● Operator Precedence
Week 5: Programming examples using conditional statement and operators
● Conditional Statements
● Simple if
● if-else
● Nested if
● else-if Ladder
● switch-case statement
Week 6 and 7: Programming examples using loops

● Looping/Iterative Statements
● for, while, do-while
● Nested loop Statements
● break & continue in Loops
Week 8: Arrays
● Working with Arrays
• Purpose for arrays
• 1-D and 2-D Arrays
Week 9: Programming examples using strings

● Strings
● String representation
● Declaring / Initializing a String
● Functions in string.h file
● String Formatted Specifiers
● String arrays
● String handling functions
Week 10 and 11: Programming examples using functions

● Functions
• Basics
• Function Prototype
• Defining & Calling Function
• Function with & without arguments
Week 12: Recursion Functions
● Non-Recursive and Recursive Functions

● Structures
● Pointers
●
Course Outcomes:
1. Experiencing the importance of computational thinking.

2. Selecting basic arithmetic operations in solving mathematical problems using mental methods, paper-
and-pencil and other tools.
3. Able to understand and use the main concepts for organizing information, to develop algorithms for
addressing computational related tasks.
4. Formulating problems to enable computer and other tools to solve them.
5. Solving real-world complex problems using divide and conquer like strategies
6. Compare various programming constructs (selection / repetition) select the right construct for the task
7. Develop modular and reusable C programs using concepts like arrays, strings, functions and pointers
Text Books:
1. “Computational Thinking - A beginner's guide to problem-solving and programming” by Karl Beecher,

Released August 2017, Publisher(s): BCS Learning & Development Limited, ISBN: 9781780173641
2. C Programming and Data structures – E. Balaguru Swami, TMH
References:
1. The C Programming Language, B. W. Kerninghan and Dennis M. Ritche (1988), 2nd Edition, Prentice
Hall Software Series, India
2. Programming in C, Stephen G.Kochan (2004), 3rd Edition, Pearson Education Private Limited
3. https://www.tutorialspoint.com/cprogramming/cprogramming_online_test.htm
4. http://etools.vedic.edu.in/svlab/login
ENVIRONMENTAL SCIENCE AND RURAL SENSITIZATION

(Common to CSE, CSE (AI & ML), CSE (DS), IT, ECE, EEE, BME, CE, ME, CHE, PHE, CSBS)

CODE: A4104 2 - - -
Course Objectives: The course should enable the students to:

1. Understanding the importance of ecological balance & conservation of biodiversity.
2. To educate students about natural resources and their exploitation
3. Convey a clear idea of the interdisciplinary of environmental and safety-health risk management
4. To create awareness on village empowerment
5. To inculcate the habits of good health and hygiene
Unit-I: Ecosystem and Biodiversity 8 Lectures

Introduction to Ecosystem, types and functions of ecosystem, Value of biodiversity, Conservation of biodiversity:
In situ conservation, Ex. situ conservation
Activity:
1. Studying the nearest lake water/farm land/forest Eco systems and preparing document and creating
awareness programs among public in mitigating pollution.
2. Poster presentation on nutrient cycles.
Unit-II: Energy & Water Resources 10 Lectures

Introduction: Non-conventional energy resources (solar/wind/tidal) Water management (rain water harvesting,
watershed management and water conservation) Global Environmental Challenges: Global warming and climate
change, acid rains, ozone layer depletion. Solid Waste Management: Sources, classification, effects and control
measures of urban and industrial solid wastes
Activity:
1. Conducting mass level cycling for making aware of public in minimizing use of fossil fuels (ECO CLUB
ACTIVITY).
2. To prepare rain water harvesting models.
3. To demonstrate the generation of electricity with the utilization of non-conventional energy resources.
Unit-III: Green Chemistry & Hazardous chemicals 10 Lectures
Green Chemistry: Introduction & Principles. Classification of hazardous chemicals, transportation of hazardous
chemicals, Hazchem code, Storage and handling of hazardous substances, Emergency preparedness (on site &
offsite), Safety audit, Concept of fire and explosion, Major accidents involving hazardous substances
Activity:
1. To makes the flow chart on any one project
2. Mass level plantation programs and involving students in Government programs
Unit-IV: Empowering Villages 10 Lectures

Jugaad –adapting latest developments- rural technologies –strategies-value addition-marketing the products-
types of soils, important features of agriculture- vegetable crops-field crops-horticulture-fruit crops-flowery culture-
green house-poly house.
Activity: Field visits and Interaction with formers
Unit-V: Health and Hygiene 7 Lectures

Vitamins (definition& classification)-deficiency disease –balanced and nutrition diet-Awareness of contagious
diseases-Epidemics-endemics-pandemics
Activity: Visit to local health centers.
Course Outcomes: After completing the course, the students should be able to:
1. Interpret the importance of functions of ecosystem & conservation of biodiversity.

2. Choose the correct methods to reduce Global problems.
3. Identify the hazardous chemicals.
4. Outline role of technology in empowering villages.
5. Create better awareness on health and hygiene.
Text Books:
1. A Textbook of Environmental Studies for Undergraduate Courses byErachBharucha for UGC.

2. Environmental Studies by R. Rajagopalan, 2nd Edition, 2011, Oxford University Press
Reference Books:
1. A Textbook of Environmental Studies by Shaashi Chawla, TMH,New Delhi.

2. A Textbook of Environmental Studies by Anubha Kaushik, Fourth Edition, New Age International
Publishers
3. Text book of Environmental Science & Technology – Dr.M.AnjiReddy,2007, BS Publications.
4. Text Book of Environmental Studies by Deeshita Dave & P. UdayaBhaskar, Cengage Learning.
5. Environmental Studies by K.V.S.G. Murali Krishna, VGS Publishers, Vijayawada.
6. Environmental Studies by Benny Joseph, Tata McGraw Hill Co, New Delhi.
COMMUNICATIVE ENGLISH
I Year B.Tech. IT II Sem L T P C
CODE: A42NA 3 - - 3
Course Objectives:
1. To enable the students to improve effective writing skills.
2. To equip the students to learn new vocabulary.
3. To bring awareness among students about various formats of correspondence.
4. To train the students in using adjectives and adverbs in describing places and objects.
5. To facilitate students with the basic aspects of grammar.
Unit-1: 9 Lectures
What Matters More Than Your Talents by Jeff Bezos
Homonyms, Homophones and Homographs, One Word Substitution, Affixes, Paragraph Writing
Unit-2: 8 Lectures
My Strange Success Rituals by Robin Sharma
Common Errors in Nouns and Pronouns, Dialogue Writing, Note making and Note Taking
Unit-3: 8 Lectures
Karma, A Short Story by Khushwant Singh
Common Errors in Verbs, Tense, Active Passive Voice, Common Errors in Punctuation, Business Letters –
Format and Samples
Unit-4: 8 Lectures
A Brief Biography of Steve Jobs
Common Errors in Adverbs, Adjectives and Articles, Idioms and Phrasal Verbs, Technical Report Writing- Format
and Samples
Unit-5: 8 Lectures
Review of the Movie
Common Errors in Conjunctions and Prepositions, Knowing the Questions and Question Tags, Modal Auxiliary
Verbs, Essay Writing – Types, Pre Writing, During Writing and Post Writing.
1. Use vocabulary in various contexts and write meaningful paragraphs.

2. Write sentences with correct concord.
3. Apply punctuation appropriately and use right form of the verbs.
4. Make use of descriptive words, idioms and phrasal verbs in technical communication.
5. Connect persuasive statements with correct prepositions and frame questions effectively.
Reference Books:
1. Rizvi, M. Ashraf. Effective Technical Communication: 2/e. McGraw-Hill Education, 2011.

2. Sen, Leena. Communication skills. PHI Learning Pvt. Ltd., 2007.
3. Murphy, Raymond. English grammar in use. Ernst Klett Sprachen, 2012.
4. Burton, Samuel Holroyd. "ABC of common errors." 1988.
5. Turton, Nigel D. ABC of common grammatical errors. Macmillan Education, 1995.
6. Swan, Michael. Practical english usage. Oxford Univ. Press, 2005.
7. Mn, Taylor, and Grant Taylor. English conversation practice. Tata McGraw-Hill Education,1975.
8. Ibbotson, Mark. Cambridge English for engineering.[1]. Student's book. Ernst Klett Sprachen,
2008.
ADVANCED CALCULUS
CODE: A42NG 3 - - 3
Course Objectives: To learn

1. Evaluation of multiple integrals and their applications.
2. The physical quantities involved in engineering field related to vector valued functions. The basic
properties of vector valued functions and their applications to line, surface and volume integrals.
3. Concept of Laplace transform and their properties and its applications.
4. Concept of expansion of Fourier series.
5. Methods of solving linear and non-linear first order partial differential equations.
Unit-I: Multiple Integrals 10 Lectures
Evaluation of Double Integrals: Cartesian and polar coordinates, Change of order of integration (only Cartesian
form). Evaluation of Triple Integrals: Change of variables for double and triple integrals, Areas (by double
integrals) and volumes by (by double integrals, by triple integrals).
Unit-II: Vector Calculus 11 Lectures

Vector point function and scalar point function, Gradient, Divergence and Curl. Directional Derivatives, Vector
identities, Scalar potential functions, Solenoidal and Irrotational vectors, Line integral and Work done by force as
a line integral, Surface and Volume Integrals, Green’s, Gauss and Stoke’s Theorems (without proofs) and their
applications.
Unit-III: Laplace Transform 11 Lectures

Laplace transform, Properties of Laplace Transforms, Laplace transform of periodic functions. Evaluation of
integrals by Laplace transforms. Unit step function –Dirac‘s delta function. Finding Inverse Laplace transform by
different methods, Convolution theorem (without proof).Solving Ordinary Differential Equations by Laplace
Transforms.
Unit - IV: Fourier series 6 Lectures

Definition of periodic function, Fourier expansion of periodic functions in a given interval of length ,
Determination of Fourier coefficients, Fourier series of even and odd functions- Fourier series in an arbitrary
interval-Half range sine and cosine expansions.
Unit-V: Partial Differential Equations 10 Lectures

Introduction to Partial Differential Equations (PDE), Formation of partial differential equations, Solutions of first
order linear PDEs using Lagrange’s method, Solutions of first order non-linear standard type PDEs, Solution
of PDE using method of separation of variables.
1. Evaluate double and triple integral.(L3)
2. Calculate divergence and curl of vector point function and gradient of scalar point function. Apply and
verify Gauss, Green’s and Stoke’s theorems and find volume and surface of the solid and work done by
force.(L3)
3. Apply Laplace transform to solve ODEs.(L3)
4. Expand Fourier series of given functions in arbitrary intervals.(L3)
5. Formulate a PDE and solve PDEs.(L3)
Text Books:
1. B.S. Grewal, Higher Engineering Mathematics, 42nd Edition, Khanna Publishers
2. N.P. Bali and Manish Goyal, A text book of Engineering Mathematics, Laxmi Publications, Reprint,
2008.
Reference Books:
1. Erwin kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley & Sons,2006.
2. G.B. Thomas and R.L. Finney, Calculus and Analytic geometry, 9th Edition, Pearson, Reprint, 2002.
3. Veerarajan T., Engineering Mathematics for first year, Tata McGraw-Hill, New Delhi, 2008.
House, 2016.
5. Ramana B.V., Higher Engineering Mathematics, Tata McGraw Hill New Delhi, 11thReprint, 2010.
APPLIED CHEMISTRY
CODE: A42ND 3 - - 3
Course Objectives: The course will enable the student to:

● Understand the construction and applications of various batteries
● Identify the nano materials and liquid crystals
● Educate the students about chemistry of Polymers
● Know nature of water and treatment methods
● Summarize analysis of fuels and mechanism of lubricants
Unit-I-Electrochemistry and Batteries 10 Lectures

Conductance, Specific conductance, Equivalent conductance, Molar conductance, Effect of dilution on
conductance, numerical Problems. Electro chemical Cell-Galvanic Cell - construction –cell Representation, EMF-
Types of electrodes (Hydrogen Electrode and calomel electrode) -Nernst equation and its applications.
Batteries- Primary Batteries - Secondary Batteries- (Pb- acid battery, Lithium ion batteries), Fuel cells – H2-O2
fuel cell– Methanol-Oxygen fuel cell, Applications and advantages of fuel cells. Solar energy – Solar Cells-
Photovoltaic cells.
Unit-II-Nano Materials & Liquid Crystals 6 Lectures

Nano materials: Definition, properties - synthesis of nanomaterial – Sol-gel, Thin film preparation by Chemical
vapor deposition method, carbon nanotubes (CNTs) – properties, applications of CNTs.
Liquid crystals – Types (thermo - tropic and lyo –trophic), properties, applications.
Unit-III-Polymers 10 Lectures
Polymer- classification of polymers, types of polymerization (Mechanism of Addition polymerization)- Plastics-
thermo plastics, thermo setting plastics- Preparation, properties and applications of Teflon, Bakelite –
Compounding and fabrication of Plastics- Compression & Injection Moulding.
Rubbers – Natural rubber and Vulcanization, Synthetic rubber-BUNA-S, Thiokol rubber. Conducting Polymers –
types (intrinsic & extrinsic)-methods of conduction – applications of conducting polymers, Bio-Degradable
Polymers— (Preparation, properties and applications of Lactic acid.
Unit-IV-Water and its treatment 10 Lectures

Hardness of water: Causes of hardness, expression of hardness – units – types of hardness and - numerical
problems, Estimation of temporary and permanent hardness of water by EDTA method –Boiler troubles-scale
&sludge, boiler corrosion, priming & foaming. Treatment of boiler feed water–Internal Treatment methods
(Phosphate, colloidal and Calgon conditioning) – External Treatment method - zeolite process and Ion exchange
process, desalination of water By reverse osmosis, Potable water – Its specifications – steps involved in
treatment of potable water – Disinfection of water by chlorination (break-point chlorination) and ozonisation.
Unit-V-Fuels and Lubricants 9 Lectures

Fuels-Definition and classification, Characteristics of a good fuel, Coal – Types of Coal – Proximate and Ultimate
analysis of coal and its significance. Liquid fuels – Petroleum- Extraction – Fractional
B V Raju Institute of distillation-Knocking-
cracking-Moving bed catalytical cracking, Octane and cetane rating. Calorific value (HCV and LCV) of a fuel-
Determination of calorific value by Junkers calorimeter. Lubricants-Definition and classification, Characteristics
of a good lubricant, Mechanism of lubrication (Thick film, thin film and Extreme pressure), properties of lubricant –
Viscosity, Flash and Fire point, Pour and Cloud point.
Course Outcomes: After completing the course the students should be able to:
1. Classify batteries and draw construction and explain functioning of batteries

2. Understand the synthesis of nano materials and applications
3. Summarize Preparation of polymers and recognize the application of polymers
4. Identify the nature of water and its associated problems and select appropriate treatment method
5. Apply the knowledge of fuels in fuel analysis and the process capabilities are introduced
Text Books:
1. A Text book of Engineering Chemistry by R P Mani B.Ramadevi. S.Chand& Company Ltd., 14thEdn.,
2018.
2. Text book of Engineering Chemistry by Jain & Jain. DhanpatRai Publishing Company, 16thEdn., 2015.
Reference Books:
1. A Text book of Physical Chemistry by P.W. Atkins
2. A text book of Engineering Chemistry by Rath, Rama Devi, Reddy, Cengage Learning Indian pvt Ltd
3. A Text book of Engineering Chemistry fundamentals and applications by Shikha Agarwal, Cambridge
Publications, Edn. 2015.
4. A Text book of Engineering Chemistry-I by Dr. Jyotsna Cherukuri, V.G.S Book publications, 2nd Edition,
2014
5. Principles of physical chemistry by Puri Sharma & patania, vishal publishing Company, 47th edition,
2016.
FOUNDATIONS OF COMPUTER DESIGN

(Common to CSE, CSE (AI & ML), CSE (DS), IT)
CODE: A42HA 3 - - 3
Pre requisites:
Must have knowledge on various number systems.

Basic idea about memory concepts.
Course Objectives:
1. To learn basic techniques for the design of digital circuits and fundamental concepts used in the design of
digital systems.
2. To impart to students the concepts of sequential circuits, enabling them to analyse sequential systems in terms
of state machines.
3.To learn the basics to Design a Complete Digital System.
UNIT-1: 10 Lectures
BASIC STRUCTURE OF COMPUTERS: Introduction, Computers Types, Functional units, Basic
operational Concepts, Bus structures, Software, Performance, multiprocessor and multi computers, computer
Generations.
DATA REPRESENTATION: Introduction, Data types, Binary numbers, Number base conversions, Octal and
hexadecimal Numbers, complements, Signed binary numbers, Fixed point Representation. Floating – Point
Representation, Other Binary codes.
UNIT -2: 8 Lectures

DIGITAL LOGIC CIRCUITS-I: Basic Theorems and Postulates, Digital Logic Gates, Universal Gates, Algebraic
Simplification of Digital Logic Gates using Theorems and Postulates, The Karnaugh Map Method, Do not Care
Map Entries.
UNIT -3: 8 Lectures

Realization of Boolean functions using basic gates and NAND/NOR gates. Arithmetic Circuits-Half adder, Full
adder, Half subtractor, Full Subtractor. Introduction of Combinational Circuits: Multiplexers, Demux, Encoder,
Decoder.
UNIT -4: 9 Lectures

DIGITAL LOGIC CIRCUITS-II: Introduction: Flip-flops & types, Sequential Circuits and Binary counters,
Registers, Shift Registers. INSTRUCTION SET & ADDRESSING: Introduction, Memory Locations and
Addresses, machine addresses and sequencing, Various Addressing Modes, Instruction Formats.
UNIT -5: 12 Lectures

PROCESSOR ORGANIZATION: Introduction to CPU, Register Transfers, Execution of Instructions, Multiple Bus
Organization, Hardwired control, Micro programmed Control, Input and output Devices.
MEMORY ORGANIZATION: Introduction, Concepts of Memory, RAM, B VROM
Raju Institute
memories, of Technology/ B Tech IT
memory hierarchy,
cache memories, virtual memory.
Course Outcomes:
1. Student could be able to design, understand the basic knowledge on number system.
2. Student able to know about logic gates and simplification of equations in different methods.
3. Student able to understand how hardware system will do arithmetic logic operations & able to know
combinational, sequential circuits also they should be able to continue with computer organization.
4. Students understand in a better way the I/O and Memory Organization in detail.
5. Students able to know how memory is organizing between devices.
Text Books:
1. Computer Organization – Carl Hamacher, ZvonkoVranesic, SafwatZaky, fifth edition, McGraw Hill.
2. Computer System Architecture - M.Moris Mano, IIIrd Edition, Pearson.
Reference Books:
1. Computer Organization and Architecture-William Stallings Sixth Edition, Pearson.

2. Computer-organization and Design-David A.Paterson and John L.Hennessy-Elsevier.
3. Fundamentals or Computer Organization and Design, -SivaramaDandamudi Springer Int. Edition.
4. Digital Design-Third Edition, M.Morris Mano, Pearson Education/PHI.
PROGRAMMING FOR PROBLEM SOLVING USING PYTHON

CODE: A42EA 2 - - 2
Course Objectives:
1. To elucidate problem solving through Python programming language.
2. To introduce function-oriented programming paradigm through Python.
3. To train in development of solutions using modular concepts.
UNIT-I 10 Lectures
Introduction to Python: History of Python, Need of python, Applications of Python programming, Understanding
Python blocks. Data Types: Declaring and using Numeric data types: int, float, bool, complex, string data type
and string operations, standard input and output functions, type conversion.
UNIT-II 10 Lectures
Python Program Flow Control: Conditional blocks using if, else and elif, Control blocks using for loop, while
loop. Loop manipulation using pass, continue, break and else. Functions: Creating, parameters and return
values, Using Keyword Arguments and Default Parameter Values, Using Global Variables and Constants,
recursive functions, lambda functions.
UNIT-III 09 Lectures
Python Data Structures: Lists- basic list operators, replacing, inserting, removing an element; searching and
sorting lists; tuples.
Dictionaries-literals, adding and removing keys, accessing and replacing values; traversing dictionaries. Sets and
Strings operations.
UNIT-IV 08 Lectures
Introduction to Object Oriented Programming: Class, object, attributes and methods; defining classes,
inheritance, polymorphism, abstract classes, Eexception handling.
UNIT-V 08 Lectures
Files: Create, reading files and writing files to the disk. Python Packages: Packages, Introduction to PIP,
Installing Packages via PIP, Python Libraries: Practicing few libraries: NumPy, SciPy, Pandas, MatplotLib.
Course Outcomes:
1. After successful completion of this course, the students would be able to:
2. Summarize the fundamental concepts of Python programming.
3. Outline the control statements and functions by writing Python program.
4. Demonstrate file handling operations and Packages.
5. Apply the suitable data structures to solve the simple problems.
6. Interpret object-oriented programming in Python.
Text Books:
1. Reema Thareja, “Python Programming using Problem Solving Approach”, ISBN-13:978-0-19-
948017-3, Oxford University Press, 2017.
Reference Books:
1. Vamsi kurama, “Python Programming : A modern approach”, ISBN-978-93-325-8752- 6,
Pearson,2018.
2. Mark Lutz , “Learning python”, ISBN: 1-56592-464-9, Orielly, 4th edition, 1999 .
3. W.Chun, “Core python programming”, ISBN-13: 978-0132269933, Pearson, 2nd edition, 2016.
4. Kenneth Lambert, ” Fundamentals of Python: First Programs”,
ISBN-13: 978- 1337560092, Cengage Learning publishers, First Edition,2012.
5. Allen B. Downey, “Think Python: How To Think Like A Computer Scientist”, ISBN-13: 978-
1491939369, O’reilly, 2nd Edition, 2016.
Web Resources:
1. http://www.ict.ru.ac.za/Resources/cspw/thinkcspy3/thinkcspy3.pdf
2. https://zhanxw.com/blog/wp-content/uploads/2013/03/BeautifulCode_2.pdf
4. https://www.cse.msu.edu/~stockman/ITEC/Scratch/BGC2011Scratch-Rev1.pdf
5. https://nostarch.com/scratchplayground
ENGLISH LANGUAGE AND COMMUNICATION SKILLS LAB

CODE:A421N - - 3 1.5
Course Objectives
1. To sensitize the nuances of English speech sounds.

2. To bring about a consistent accent and intelligibility in students’ pronunciation of English by providing an
opportunity for practice in speaking.
3. To improve the descriptive skills.
4. To introduce oneself and articulate one’s goals effectively.
5. To speak with clarity and confidence.
List of Experiments
Experiment – I
Introduction to Phonetics – Sounds of English – Vowels and Consonants
Week -1: Organs of Speech, Introduction to Phonetics - Sounds of English: Vowels - Definition, Pure Vowels,
Diphthongs, Phonetic Symbol.
To comprehend the importance of Phonetics and identify Vowel sounds and symbols.
Week – 2: Sounds of English: Consonants – Definition, Plosives, Affricates, Nasals, Fricatives, Lateral
Consonant, Approximants, Phonetic Symbols.
To identify consonant sounds and symbols.
Experiment – II
Introduction to Stress and Intonation
Week – 3: Introduction to Accent: Definition of a syllable, Syllable Division, Definition of Accent, Why is English
Accent fixed and free?
To practice the appropriate accent.
Week – 4: Introduction to Intonation: Definition of Intonation, Types of Tones, Use of Rising, Falling and Falling
Rising tones.
To communicate with proper intonation.
Experiment – III
Describing People, Places, Objects and Process
Week – 5: Describing People: Known and Unknown, Places: My Favourite Picnic Spot.
To describe people and places intelligibly.
Week – 6: Describing Objects: Features and Functioning and Describing Process: Opening a Bank Account/
Admission into the Engineering Course, etc.
To describe objects clearly and process logically.
Experiment – IV
Socializing Skills: Introducing oneself – Goals & SWOT
Week – 7: Introducing oneself.
To introduce oneself confidently.
Week – 8: Goals.
To speak clearly on one’s goals.
Week – 9: SWOT.
To identify strengths, weaknesses, opportunities and areas of improvement about oneself.
Experiment – V
Oral Presentations
Week – 10: Significance, planning and preparation, dos and don’ts of the presentation, Body Language, Tips to
make effective presentations.
To plan and prepare for presentations.
Week – 11: Presentations - Activity
To present the content confidently.
Week – 12: Presentations - Activity
To present the content confidently.
Infrastructure
● 30 computer systems for a class of 60 students. B V Raju Institute of Technology/ B Tech IT
● LAN facility and English Language Software for self-study by learners.
● Audio track Podium
● Cam Corder
● Projector
System Requirement Hardware Component
● Dell Inspiron 3880 Desktop

● 10th Gen Intel® Core™ i3-10100 processor(4-Core 6M Cache 3.6GHz to 4.3GHz)
● Windows 10 Home Single Language, English
● Intel UHD Graphics 630 with shared graphics memory
● 4GB, 4Gx1, DDR4, 2666MHz
● 1TB 7200RPM 3.5" SATA HDD
1. Identify phonetic symbols, vowels and consonants.
2. Use words and sentences with correct stress and intonation.
3. Describe People, Places, Objects and Process methodically.
4. Introduce oneself confidently in both written and spoken contexts.
5. Coherently and logically present ideas on the given topic.
Suggested Software
● K Van solutions Multimedia language
● Cambridge Advanced Learners’ English Dictionary with CD.
● Clarity Pronunciation Power – Part I
● Clarity Pronunciation Power – part II
● Oxford Advanced Learner’s Compass, 7th Edition
● English Pronunciation in Use, Cambridge University Press
Lab Manual
ELCS Lab Manual, BVRIT.
References
1. Bansal, Ram Krishna, and John Brian Harrison. Spoken English for India: a manual of speech and
phonetics. Orient-Longman, 1999.
2. Balasubramanian, T. A textbook of English phonetics for Indian students. Macmillan, 1981.
3. Roach, Peter. English phonetics and phonology paperback with audio CDs (2): A practical course.
Cambridge university press, 2009.
4. Yates, Jean. Practice Makes Perfect English Conversation. McGraw-Hill, 2012.
5. Mitra, Barun K. Personality development and soft skills. Vol. 156. Oxford University Press,2011.
6. Sharma, Prashant. Soft Skills: Personality Development for Life Success. BPB publications, 2019.
7. Jones, Daniel. Cambridge English pronouncing dictionary. Cambridge University Press, 2011.
ENGINEERING GRAPHICS LABB V Raju Institute of Technology/ B Tech IT
CODE:A421C - - 4 2
Resources: Mini drafter, drawing instruments, drawing sheet, solid models
Course Objectives:
1. Understand the construction and the importance of engineering curves and scales
2. Draw the orthographic projections of points and lines
3. Draw the orthographic projections of planes in simple/inclined to one or both the reference planes
4. Draw the orthographic projections of regular solids in simple/inclined to one or both the reference planes
5. Differentiate orthographic and Isometric projections.
Introduction to CAD Software Package Commands - Free Hand Sketches of 2D - Creation of 2D Sketches by
CAD Package
List of Experiments/Sheets:
Week 1:
Introduction to Engineering Graphics: principles of engineering graphics and their significance-

conventions–drawing instruments- Construction of regular polygons by general method
Scales- plain and diagonal scales
Week 2:
Engineering Curves: Conic sections–Ellipse, Parabola and Hyperbola by general method only,
Cycloidal Curves -Cycloid, Epicycloid, Hypocycloid and involutes
Week 3:
Principle of orthographic projections-first and third angle projections-projections of points in various quadrants
Week 4:
Projections of straight lines- parallel to both the planes- parallel to one plane and inclined to the other plane-
Projections of straight lines inclined to both the planes- determination of true lengths, angle of inclinations.
Week 5:
Projections of regular planes –plane parallel to one reference plane and perpendicular to other reference
plane–parallel to one reference plane and inclined to the other reference plane
Week 6:
Projections of regular planes – inclined to both the reference planes.
Week 7:
Projections of Regular Solids of Prism, Cylinder, Pyramid, Cone –axis parallel to one and inclined to other
reference plane
Week 8:
Projections of Regular Solids of Prism, Cylinder - axis inclined to both the reference planes
Week 9:
Projections of Regular Solids of Pyramid, Cone - axis inclined to both the reference planes
Week 10:
Principles of Isometric Projection-Isometric Scale – Isometric Projection and Isometric View- Isometric views of
lines, planes, simple solids
Week 11:
Isometric Projection of compound solids
Week 12:
Conversion of isometric views to orthographic views and orthographic to isometric views.
Course outcomes:
After completing this course, student will be able to
1. Construct engineering curves and scales

2. Draw the orthographic projections of points and lines
3. Draw the orthographic projections of planes in simple/inclined to one or both the reference planes
4. Draw the orthographic projections of regular solids in simple/inclined to one or both the reference planes
5. Differentiate orthographic and Isometric projections.
Text Books:
1. Engineering Drawing/N.D.BhattandV.M.Panchal/53rdEdition/CharotarPublishingHouse/2014.
2. Engineering Drawing/ BasantAgarwalandAgarwal C.M/2ndEdition/TataMcGrawHill/2014.
Reference Books:
1. Text book on Engineering Drawing/K.L.NarayanaandP.Kannaiah/Scitech Publications/1999.

2. Engineering Drawing(Volume I&IIcombined)/ K.R. Gopalakrishna/SubhasPublishers/1994.
3. Engineering Drawing/ M.B.ShahandB.C.Rana/2ndEdition/ Pearson Education/2005.
4. Engineering Drawing + AutoCAD/K.Venugopal/4thEdition/Newinternational(P) Ltd/2007.
CHEMISTRY LAB
CODE:A422N - - 3 1.5
Course Objectives:
1. To learn various analytical techniques for analyzing and solving engineering problems
2. To understand the principles associated with the basics of engineering chemistry and applications of
these principles in avoiding common difficulties
3. Students exposed to various tools like conductometer, pH meter and colorimeter.
LIST OF EXPERIMENTS
Titrimetry:
1. Estimation of ferrous iron by dichrometry.
2. Estimation of hardness of water by EDTA method.
Mineral analysis: B V Raju Institute of Technology/ B Tech IT

3. Determination of percentage of copper in brass.
4. Estimation of manganese dioxide in pyrolusite.
Instrumental Methods:
Colorimetry:
5. Determination of ferrous iron in cement by colorimetric method
6. Estimation of KMnO4 by colorimetric method.
Conductometry:
7. Conductometric titration of strong acid vs. strong base.
PHmetry:
8. Titration of strong acid vs. strong base by pHmetry.
9. Determination of soil PH
Preparations:
9. Preparation of Aspirin
10. Preparation of Thiokol rubber
Adsorption:
11. Adsorption of acetic acid on charcoal
Kinetics:
12. Determination of Rate constant of hydrolysis of Methyl acetate
NOTE: Perform any 8 experiments
Course Outcomes: After completing the course, the students should be able to
1. Explain the importance of kinetics in determining the rate constant.
2. Estimate the amount of metal present in the given sample
3. Find out the quantity of unknown sample using suitable reagents.
4. Experiment with pH/conductivity meter to known the strength of unknown acid.
5. Make use of raw materials for the preparation of drug molecules.
6. Find out hardness of water sample.
Text Books:
1. Practical Engineering Chemistry by K. Mukkanti B.S Publications, Hyderabad(2009

2. Inorganic quantitative analysis A.I Vogel)
Reference Books:
1. Text Book of Engineering Chemistry by R.N Goyal and Herrmendra GoelAne books pvt ltd
2. A Text book on experiment and calculation Engg. S.S Dara
PROGRAMMING FOR PROBLEM SOLVING USING PYTHON LAB

CODE:A421H - - 3 1.5
Course Objectives:
1. To elucidate problem solving through Python programming language.
2. To introduce function-oriented programming paradigm through Python.
3. To train in development of solutions using modular concepts.
Laboratory Experiments:
WEEK 1:
i. Design a script in Scratch to make a sprite to ask the user to enter two different numbers
and an arithmetic operator and then calculate and display the result.
ii. Write a program to demonstrate different numbers data types in python.
WEEK 2:
i. Design a Python Script to find the value of Sine, Cosine, Log, PI, eg of a given number
using infinite series of the function.
ii. Write a Python script to print prime numbers less than ‘n’ value.
WEEK 3:
i. B V number.
Design a Python script to convert a Binary number to Decimal Raju Institute of Technology/ B Tech IT
ii. Design a Python script to determine the difference in date for given two dates in YYYY:
MM: DD format 0 <= YYYY <= 9999, 1 <= MM <= 12, 1 <= DD <= 31 following the leap year rules.
WEEK 4:
i. Write a program to create, append and remove lists in python

ii. Design a Python Script to convert a given number to roman number.
WEEK 5:
i. Write a program to demonstrate working with tuples in python

ii. Write a program to demonstrate working with dictionaries in python
WEEK 6:
i. Write a program to demonstrate working with sets in python

ii. Write a program to create, concatenate and print a string and accessing substring from a
given string.
WEEK 7:
i. Write a python program to define a module and import a specific function in that module to
another program
ii. Design a Python script to determine if a given string is a Palindrome using recursion
WEEK 8:
i. Design a Python script to sort numbers specified in a text file using lists.
ii. Write a python program to define a module to find Fibonacci Numbers and import the module to
another program.
WEEK 9:
i. Design a Python Script to generate the frequency count of words in a text file using command line
arguments.
ii. Write a script named copyfile.py. This script should prompt the user for the names of two
text files. The contents of the first file should be input and written to the second file.
WEEK 10:
i. Design a Python Script to print a spiral pattern for a 2-dimensional matrix.

ii. Design a Python script to generate statistical reports Minimum, Maximum, Count, Average, Sum
etc) on public datasets.
WEEK 11:
i. Design a Python script to visualization of data by reading CSV files.

ii. Write a Python program to replace all occurrences of space, comma, or dot with a colon.
WEEK 12:
i. Design a Python script on OOP’s concepts: Class variables and instance variable on
employee details.
ii. Design a Python script on OOP’s concepts: Class variables and instance variable on
Robot.
Course Outcomes: After successful completion of this course, the students would be able to:
1. Summarize the fundamental concepts of Python programming.
2. Outline the control statements and functions by writing Python program.
3. Demonstrate file handling operations and Packages.
4. Apply the suitable data structures to solve the simple problems.
5. Interpret object-oriented programming in Python.
Text Books:
1. Reema Thareja, “Python Programming using Problem Solving Approach”, ISBN-13:978-0-
19- 948017-3, Oxford University Press, 2017.
Reference Books:
1. Vamsi kurama, “Python Programming : A modern approach”, B V RajuISBN-978-93-325-8752-
6,pearson,2018.
2. Mark Lutz , “Learning python”, ISBN: 1-56592-464-9,Orielly, 4th Edition, 1999 .
3. W.Chun, “Core python programming”, ISBN-13: 978-0132269933, Pearson, 2nd edition, 2016.
4. Kenneth Lambert, ”Fundamentals of Python: First Programs”,
ISBN-13: 978- 1337560092,cengage learning publishers, first edition,2012.
5. Allen B. Downey, “think python: how to think like a computer scientist”, ISBN-13: 978-
1491939369, O’Reilly, 2nd edition, 2016.
Web Resources:
2. https://zhanxw.com/blog/wp-content/uploads/2013/03/BeautifulCode_2.pdf
4. https://www.cse.msu.edu/~stockman/ITEC/Scratch/BGC2011Scratch-Rev1.pdf
5. https://nostarch.com/scratchplayground
6. http://fusecontent.education.vic.gov.au/9f79537a-66fc-4070-a5ce-
e3aa315888a1/scratchreferenceguide14.pdf
Advanced Data Structures
II Year B.Tech. IT I Sem L T P C
CODE: A43H1 3 - - 3
Pre-requisites:
Basic knowledge in Programming.
Objectives:
1. To introduce and practice advanced algorithms and programming techniques necessary for developing
sophisticated computer application programs
2. To learn new techniques for solving specific problems more efficiently and for analyzing space and time
requirements.
3. To write programs in C to solve problems using data structures such as arrays, linked lists, stacks,
queues, Trees, graphs, hash tables, search Trees.
Unit I: 10 Lectures
Algorithms Basics: Performance Analysis- Time Complexity and Space Complexity, Asymptotic, Notation- Big
O, Omega and Theta Notations. B V Raju Institute of Technology/ B Tech IT
Linked list : Singly linked list, circular linked list, doubly linked list, linked list representation of polynomial and
applications.
Unit II 11 Lectures
Data Structures: Stack, Queue using Array and Linked List, De-queue ,Circular Queue.
Sorting and Searching: bubble sort , insertion sort, selection sort ,merge sort, Redex sort, quick sort, linear
search , binary search.
Unit III: 11 Lectures

Priority Queues: Definition, Realizing a Priority Queue using Heaps, Insertion, Deletion, Heap sort, External
Sorting.
Dictionaries: Linear List Representation, Skip List Representation, Operations- Insertion, Deletion and
Searching.
Hashing: 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.
Unit IV: 11 Lectures

Trees: Basic Terminology, Binary Tree, Array and Linked List Representations, Traversals, Threaded Binary
Trees.
Search Trees (Part I): Binary Search Trees- Definition(ADT), Implementation, Operations- Searching, Insertion
and Deletion, AVL Trees, Definition, Operations – Insertion and Searching.
Search Trees (Part II): B-Trees- Definition, B-Tree of Order m, Insertion, Deletion and Searching, Redblack
Trees and Splay Trees.
Unit V: 10 Lectures
Graphs: Basic Terminology, Representations of Graphs, Graph Search Methods: DFS, BFS.
Text Processing Pattern Matching Algorithms: Brute Force, The Knuth-Morris-Pratt Algorithm, Tries: Standard
Tries, Compressed Tries, Suffix Tries.
Outcomes: Upon the successful completion of the course, the student will be able:
1. Analyze performance of algorithms with respect to complexities, trace and code recursive functions,
understanding of various searching algorithms.
2. Understand operations on linear data structures such as stacks, queues to solve various computing
problems and Implement these data structures in more than one manner.
3. Classify different linked lists and their operations, Compare different implementations to recognize the
advantages and disadvantages.
4. Understand the linked implementation use in non-linear data structures such as Binary Tree and Binary
Search Tree and Tree traversals such as in, pre, post.
5. Understand graph types and their representations. Know the usage of graph traversal algorithms.
Textbooks:
1.Data Structures, Algorithms and Applications in C++, S.Sahni, University Press (India) Pvt.Ltd, Second edition,
Universities Press Orient Longman Pvt. Ltd.
2. Data Structures and Algorithm Analysis in C++, Mark Allen Weiss, Pearson Education. Ltd., Second Edition.
References:
1. Data Structures and Algorithms in C++, Michael T.Goodrich, R.Tamassia and .Mount, Wiley Student Edition,
John Wiley and Sons.
2. Data Structures and Algorithms in C++, Third Edition, Adam Drozdek, Thomson
3. Data Structures using C and C++, Langsam, Augenstein and Tanenbaum, PHI.
4. Advanced Data Structures and Algorithms in C++, V.V. Muniswamy Jaaico Publishing House.
5. H. S. Wilf, Algorithms and complexity, Prentice hall.
6. T. H. Cormen, C. E. Leiserson, R. L. Rivest, Introduction to Algorithms, Prentice hall.
7. K. Vishwanathan Iyer, Lecture notes for classroom use.
SOFTWARE ENGINEERING WITH UML

CODE: A43H2 3 - - 3
Pre-requisite: Nil
Objectives:
1. To impart the knowledge of basic SW engineering methods, practices and their appropriate applications
and to give a general understanding of software process models.
2. To give an understanding of software requirements and the SRS document.
3. Understanding of different software architectural styles and modeling of system.
4. To provide knowledge on modeling of system with UML and various models for analysis and design of
software system.
5. To give an understanding of Behavioral Modeling of software to ensure good quality software.
Unit I: 12 Lectures
Introduction to Software Engineering: The evolving role of software, Changing Nature of Software, Software
myths.
Software Process: Software development process models: Waterfall model, prototyping, iterative development,
relational unified process, Extreme programming and agile process, CMM Levels.
Unit II: 16 Lectures

Software requirement analysis and specification: Value of good SRS, requirement process, requirement
specification, functional specifications with use-cases.
Planning a software project: Effort estimation, project schedule and staffing, quality planning, risk management
planning, project monitoring plan, detailed scheduling.

Software Architecture and Design: Role of software architecture, architecture views, components and
connector view, architecture styles for C & C view.
Software Testing: Testing Concepts, Testing Process, Black-Box and White- Box Testing Techniques, Art of
Debugging.
UNIT IV 12 Lectures
Modeling with UML-1: Modeling Concepts and Diagrams - Structural Modeling: Introduction, Classes,
Relationships, Common Mechanisms and Diagrams. Interfaces, Types and Roles, Packages, Object Diagrams.
UNIT V 12 Lectures
Modeling with UML-2:
Behavioral Modeling: Introduction, Interactions, Interaction Diagrams, Use cases, Use case Diagrams, Activity
Diagrams.
Outcomes:
1. Understand the importance of a disciplined way of software construction i.e., software engineering.
2. Analyze and evaluate different types of process models to suit the nature of a project.
3. Analyze the principles and requirements at various phases of software development.
4. Understand then UML modeling for analysis and design of software Architecture for software development.
5. Understanding of then UML modeling for Behavioral Modeling software development.
Textbooks:
1. A Concise Introduction to Software Engineering (Undergraduate Topics in Computer Science), Pankaj

Jalote, Springer International Edition.
2. Roger S, “Software Engineering – A Practitioner’s Approach”, seventh edition, Pressman, 2010.
3. Grady Booch, James Rumbaugh, Ivar Jacobson : The Unified Modeling Language User Guide, Pearson
Education 2 nd Edition.
References:
1. Software Engineering a Practitioner’s Approach 5TH Edition / Roger S .Pressman.
2. An Integrated Approach to Software Engineering 2nd Edition / Pankaj Jalote.
3. Software Engineering – K.K.Agarwal & Yogesh Singh.
4. Meilir Page-Jones: Fundamentals of Object Oriented Design in UML, Pearson Education.
5. Pascal Roques: Modeling Software Systems Using UML2, WILEY- Dreamtech India Pvt.Ltd
PROBABILITY AND STATISTICS

(Common to CSE, CSE (AI&ML), CSE(DS),IT, ECE, EEE, CE, ME & CHE)
CODE: A43NA 3 - - 3
Course Objectives:
1. To enable the students to understand the concepts of random variables.
2. To introduce the concept of Bivariate random variable and distribution.
3. To study the concepts of probability distribution in realistic situations.
4. To create an understanding on various types of sampling distribution and their applications in
Engineering.
5. To train students the basic principles of Statistical Inference.
Unit-I: Random Variables 12 Lectures

Review of set theory and the Probability: Definition, Addition and multiplication law of probability, Baye’s theorem;
Random variables – Discrete and Continuous, Probability distributions, mass/density function of a probability
distribution. Mathematical Expectation, Moments about origin, Central moments, Skewness, Kurtosis and
Moment generating function of probability distribution.
Unit-II: Bivariate Distributions, Correlation & Regression 9 Lectures

Joint probability distributions- Joint probability mass /density function, Marginal probability mass / density
functions, Covariance of two random variables; Correlation-Coefficient of correlation; Regression-Regression
Coefficient, the lines of regression
Unit-III: Probability Distributions 9 Lectures

Probability distributions: Binomial, Poisson, Normal (Gaussian), Uniform, exponential and Rayleigh distributions -
Evaluation of statistical parameters: Mean, Variance and their properties.
Unit-IV: Sampling Distribution and Estimation 8 Lectures

Sampling: Definitions of population, sampling, statistic, parameter. Types of sampling, Expected values of
Sample mean and variance, sampling distribution, Standard error, Sampling distribution of means and sampling
distribution of variance. Estimation: Criteria of a good estimator, point and interval estimators for means and
proportions
Unit-V: Tests of Hypothesis B V Raju 10

Lectures
Introduction-Type-I, Type-II Errors, Maximum Error, one –tail, two-tail tests, Test of significance: Large sample
test for single proportion, difference of proportions, single mean, difference of means.
Test of significance: Small sample test for single mean, difference of means and test of ratio of variances (F-
Test) - Chi-square test for goodness of fit and independence of attributes. One-way Analysis of Variance
(ANOVA).
Course Outcomes:
1. Calculate probabilities by applying probability laws and properties or identify discrete and continuous
probability distributions for a given random variable.
2. Estimate unknown variables in a problem involving a bivariate probability function.
3. Generate probability distribution function to a given real life problem.
4. Estimate the error or uncertainty at different confidence intervals for a given set of data.
5. Test a hypothesis using statistical methods i.e., large and small sample tests for studying data in real life
problems.
Text books:
1. Higher Engineering Mathematics, B.S. Grewal,42nd Edition, Khanna Publishers
2. Probability and Statistics for Engineers, Miller, John E. Freund, PHI
Reference books:
1. Probability and Statistics for Engineers and Scientists by Sheldon M.Ross, Academic Press
2. Erwin Kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley & Sons
3. Probability, Statistics and Random Processes, Murugesan Anuradha Publishres.
4. Probability and Statistics by T. K. V. Iyengar & B. Krishna Gandhi and others
5. Fundamentals of Mathematical Statistics, S. C. Gupta & V.K. Kapoor, Sultan Chand.
INTRODUCTION TO ARTIFICIAL INTELLIGENCE
CODE: A43LA 3 - - 3
Pre-requisites: Mathematics
Objectives: The Students will learn the following:
1. State Space Searching techniques to solve a real-world problem
2. Heuristic Searching techniques to optimize a problem iteratively
3. Randomized Search and Emergent Systems to determine the best solution for the developed model
4. Optimal Path algorithms to determine shortest paths in different circuits
5. Problem Decomposition to decompose a problem into manageable sub-components is a necessity in
complex problem-solving tasks
Unit I: 9 Lectures
Introduction: Artificial Intelligence, Historical Backdrop, What is Artificial Intelligence,
State Space Search: Generate and Test, Simple Search, Depth First Search (DFS), Breadth First Search (BFS),
Comparison of BFS and DFS, Quality of Solution, Depth Bounded DFS (DBDFS), Depth First Iterative Deepening
(DFID)

Heuristic Search: Heuristic Functions, Best First Search, Hill Climbing, Local Maxima, Solution Space Search,
Variable Neighborhood Descent, Beam Search, Tabu Search, Peak to Peak Methods

Randomized Search and Emergent Systems: Iterated Hill Climbing, Simulated Annealing, Genetic Algorithms,
The Travelling Salesman Problem, Neural Networks, Emergent Systems.

Finding Optimal Paths: Brute Force, Branch and Bound, Refinement Search, Dijkstra’s Algorithm, Algorithm A*,
Admissibility of A*, Iterative Deepening A* (IDA*), Recursive Best First Search (RBFS), Divide and Conquer
Beam Stack Search.
Unit V: 09 Lectures
Problem Decomposition: SAINT, Dendral, Goal Trees, Rule based Systems, XCON, Rule Based Expert
Systems
1. Apply appropriate State Space Searching techniques to solve a real-world problem (BL 3)
2. Apply appropriate Heuristic Searching techniques to solve a real-world problem (BL 3)
3. Analyze the problem and infer new knowledge using Randomized Search and Emergent Systems (BL
4)
4. Apply Optimal Paths Algorithms to real world problems (BL 3)
5. Analyze the Problem Decomposition Methods and their test cases (BL 4)
Textbooks:
1. A First Course in Artificial Intelligence, Deepak Khemani, Tata Mc-Graw Hill Education, 2013.
References:
1. AI – A Modern Approach, Stuart Russel, Peter Norvig, 4th Edition, Pearson Education, 2010.
Artificial Intelligence, Kevin Knight, Elaine Rich, Shivshankar B. Nair, 3rd Edition, Tata Mc-Graw Hill Education,
2019. 5. David L. Poole and Alan K. Mackworth, ―Artificial Intelligence: Foundations of Computational Agentsǁ,
Cambridge University Press, 2010.
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE
CODE: A43HA 2 1 - 3
Objectives:
● To introduce the concepts of mathematical logic.
● To perform the operations associated with sets, functions, and relations.
● To relate practical examples to the appropriate set, function, or relation model and interpret the
associated operations and terminology in context.
● To learn methods of counting and able to solve recurrence relations.
● To use Graph Theory for solving real time problems.
Unit I: 10 Lectures
Propositional Logic: Basic Connectives and Truth Tables, Logical Equivalence: The Laws of Logic, Disjunctive
and Conjunctive Normal Form , Logical Implication, Rules of Inference, The use of Quantifiers, Boolean Algebra
and Boolean Ring, Identities of Boolean Algebra, Duality, Representation of Boolean Function.
Sets and Relations: Size of a Set, Finite and infinite Sets, Countable and uncountable Sets, Cartesian Products,
Binary Relation, Properties of Relation, Partition and Covering of a set, Partial Ordering Relation, Hasse
Diagram, Equivalence Relation, Transitive Closure, Compatibility Relation. Lattice and its Properties
Functions: One-to-one, Onto Functions, Bijective functions, Inverse and Composite Functions, Cantors power
set theorem and diagonal theorem.

Algebraic Structures and Morphism: Algebraic Structures with one Binary Operation, Semi Groups, Monoids,
Groups, Subgroups and Homomorphism, Congruence Relation and Quotient Structures, Free and Cyclic
Monoids and Groups, Permutation Groups, Substructures, Normal Subgroups, Algebraic Structures with two
Binary Operation, Rings.

Elementary Combinatorics: Basis of Counting, Combinations and Permutations with/without Repetitions,
Constrained Repetitions, Binomial and Multinomial Theorems, The Principles of Inclusion – Exclusion. Pigeon
Hole Principles and its Application.
Recurrence Relations: Solving Homogeneous Recurrence Relation by Substitution, Characteristics Roots and
Generating Functions. Solving Inhomogeneous Recurrence Relation by Characteristics Roots Method.
Unit V: 12 Lectures
Graph Theory: Graphs and their properties, Degree, Connectivity, Path, Cycle, Sub Graph, Rooted trees,
Minimum Spanning Trees: Prims Algorithm, Kruskal’s Algorithm, and Planar Graphs.
Graph Theory and Applications: Isomorphism, Eulerian and Hamiltonian Graphs, Graph Coloring
Course Outcomes :
Ability to apply mathematical logic to solve problems.
Understand sets, relations, functions, and discrete structures.
Able to use logical notation about fundamental mathematical concepts of Algebraic Structures
To solve counting problems by using concepts of combinotorics
Able to formulate problems and solve recurrence relations.
Able to model and solve real-world problems using graphs and trees
Text Books:
1. J.P. Tremblay and R. Manohar, Discrete Mathematical Structure and It’s Application to Computer Science”,
TMG Edition, Tata McGraw-Hill
2. Discrete Mathematics for Computer Scientists & Mathematicians, Joe L. Mott, Abraham Kandel, Theodore P.
Baker, Pearson , 2nd ed.
3. Kenneth H. Rosen, Discrete Mathematics and its Applications, Tata McGraw – Hill
References:
1. C L Liu and D P Mohapatra, Elements of Discrete Mathematics A Computer Oriented Approach, 3rd Edition
by, Tata McGraw – Hill.
2. Norman L. Biggs, Discrete Mathematics, 2nd Edition, Oxford University Press. Schaum’s Outlines Series,
Seymour Lipschutz, Marc Lipson,
Advanced Data Structures Lab

CODE: A431H - - 3 1.5
Pre-requisites:
• Basic knowledge in Structure programming.
• Basic knowledge in Numerical Methods problem solving.
Objectives:
1. To write and execute programs in C/C++/Python to solve problems using data structures such as arrays,linked
lists, stacks, queues, Trees, graphs, hash tables and search Trees.
2. To make the student learn an object oriented way of solving problems.
3. To make the student write ADTS for all data structures.
4. Recommended Systems/Software Requirements:
Intel based desktop PC with minimum of 166 MHZ or faster processor with at least 64 MB RAM and 100 MB free
disk space.
5. C++/Python compiler and STL Recommended.
Week 1:
Write a program to implement the following object oriented concepts:
1. Use of Classes and Objects
2. Inheritance
3. Polymorphism (Overloading & Overriding)
Week 2:
Write C++ programs to implement the following using an array.
a) Stack ADT b) Queue ADT
Week 3:
Write programs to implement the following using a singly linked list.
a)Stack ADT b) Queue ADT
Week 4:
Write programs to implement the deque (double ended queue) ADT using a doubly linked list and an array.
Week 5:
1. Basic sorting techniques
2. Merge sort.
Week 6:
1. Quick sort technique
2. Heap sort technique
Week 7:
Write a program to perform the following operations:
1. Insert an element into a binary search Tree.
2. Delete an element from a binary search Tree.
3. Search for a key element in a binary search Tree.
i) Write programs that use recursive functions to traverse the given binary Tree in a) Preorder b) inorder c)
postorder
ii) Write programs that use non-recursive functions to traverse the given binary Tree in a) Preorder b) inorder c)
postorder.
Week 8: B V Raju Institute of Technology/ B Tech IT
Write programs for the implementation of bfs and dfs for a given graph using an array and singly linked list.
Week 9:
Write programs for implementing the following hashing techniques:
Implementation of Open and Closed hashing techniques.
Week 10:
Write a program to perform the following operations
a)Insertion into a B-Tree b) Deletion from a B-Tree
Week 11:
Write a program to perform the following operation
a) Insertion into an AVL-Tree b) Display the elements in AVL-Tree
Week 12:
a) Write a program to implement all the functions of a dictionary (ADT) using hashing.
b) Write a program for implementing Knuth-Morris- Pratt pattern matching algorithm.
Outcomes: After completion of the course, the students would be able to:
• Ability to identify the appropriate data structure for a given problem.
• Graduates able to design and analyze the time and space complexity of algorithm or program.
• Ability to effectively use compilers includes library functions, debuggers and troubleshooting.
Textbooks:
1. Data Structures A Pseudocode Approach with C++ , Indian edition, R.F.Gilberg and
B.A.Forouzan, Cengage Learning.
2. Programming Principles and Practice using C++, B.Stroustrup, Addition- Wiesly (Pearson
Education).
3. Data Structures and STL, W.J.Collins, Mc Graw Hill International edition.
4. Data Structures and algorithms with OODesign patterns in C++, B.R.Priess, John Wiley &
sons.
5. The Art, Philosophy, and Science of OOP with C++, Rick Miller, SPD.
6. C++ for Programmers, P.J.Deitel and H.M.Deitel, PHI/Pearson.
Artificial Intelligence and Machine Learning Lab
CODE: A432H - - 3 1.5
Pre- requisites:
1. Mathematics
2. Programming for problem solving
Objectives:
1. Implement the prolog program in given problems.
2. Make use of Data sets in implementing the machine learning algorithms.
3. Implement the machine learning concepts and algorithms in any suitable language.
Week 1
Study Prolog programming language.
Week 2
Write simple fact for the statements using PROLOG.
Week 3
Write predicates One converts centigrade temperatures to Fahrenheit, the other checks if a temperature is below
freezing.
Week 4
Write a program to solve the Monkey Banana problem.
Week 5
Write a program in prolog to demonstrate family relationship.
Week 6
Write a program in prolog for menu driven program for member, concatenation, permutation, Add and Delete
function
Week 7
Write a program in prolog for perform intersection and union of two list.
Week 8
Write a program in prolog for heuristics search techniques.
Week 9
Write a program in prolog for 4 Queens and 8 Queens Problem.
Week 10
Write a program in python for Linear Regression with One Variable and Multiple Variables.
Week 11
Write a program to implement k-Nearest Neighbour algorithm to classify the iris data set. Print both correct and
wrong predictions.
Write a program to implement k-Means algorithm for group in the car dataset.
Week 12
Case Study.
Course Outcomes: Students can able to,

CO1: Learn to code in prolog for given descriptions.
CO2: Learn to code in prolog for comparing the results
CO3: Learn parameters and implement in given training samples
CO4: Implement classification algorithms for given dataset
CO5: Implement clustering algorithms for given dataset
Reference:
Programming in Prolog, William F. Clocksin, Springer
Machine Learning: The New AI The MIT Press Essential Knowledge Series, Ethem Alpaydi.
BUSINESS COMMUNICATION LAB

CODE: A431N - - 2 1
OBJECTIVES
1. To inculcate the habit of reading short and critical texts.

2. To comprehend the content while listening.
3. To articulate thoughts and ideas eloquently.
4. To enable students to write grammatical and meaningful sentences.
5. To impart confidence and competence in expressing their views
SYLLABUS
Experiment-I
Week -1 & 2:
Listening: Listening to short conversations or monologues.
Speaking: Giving information about oneself and their opinion and giving short talk on business related topics.
To gather information from conversations and monologues thereby deliver short talks based on business topics.
Week-3:
Reading: Reading short and simple texts to understand the central idea/theme.
Writing: Writing a piece of internal business communication of 30-40 words (Email).
To read for central idea/theme in passages, write responses in business communication.

Experiment II
Week-4 & 5:
Listening: Listening to peer group, formal and informal conversation and taking notes.
Speaking: Talking critically on business related topics and issues.
To inculcate and improve on note taking while listening, respond appropriately to critical business talks.
Week-6:
Reading: Reading texts, graphs and business news by using sub-skills of reading skills.
Writing: Writing business proposals in 50-60 words.

To decode information from pictorial representation and get skilled in writing business proposals.
Experiment III
Week-7:
Listening: Listening to interviews and taking notes.
Speaking: Debates and Extempore.

To observe the skills and answering techniques from Interview videos, participate in debates and presentations
spontaneously.
Week-8:
Reading: Reading a longer text and deciding whether the statements about the text are right or wrong or if the
information is not given.
Writing: Write a Business Letter or e-Mail of 60-80 words, based on an input text and some notes.
To overcome ambiguity while reading passages and write responses to business letters.
Experiment IV
Week-9:
Listening: Listening to songs and writing down the lyrics.
Speaking: Short plays.

To listen and write lyrics of English songs and portray roles actively in short plays.
Week-10:
Reading: Read a longer text and answering questions.
Writing: Writing a Business report.

To comprehend longer passages and prepare business reports.
Experiment V
Week-11:
Listening: Watching documentaries and making notes.
Speaking: Open Mike.
To practice the skills of making notes from documentaries and take opportunity confidently in public speaking.
Week-12:
Reading: Critical Reading to know author’s perspective view.
Writing: Write a short story.
To read passages and understand the writer’s intention and practice the creative skills of story writing.
Infrastructure:
● Classroom with a projector
COURSE OUTCOMES
The students will be able to:

1. Write business emails by comprehending the central idea and express opinions and respond in business
scenarios.
2. Make speeches on business related topics, analyze and respond to the graphical texts in written and spoken
contexts.
3. Perform well in debates and take notes effectively while listening.
4. Report effectively in business scenarios on the given context and enact in short plays.
5. Critically analyze the text and write short stories effectively.
SUGGESTED READING
1. Cambridge University Press India Pvt. Ltd, New Delhi.
2. MandalS.K(2006), Effective Communication &Public Speaking, Jaico Publishing House, New Delhi.
3. Grant Taylor (2004), English Conversation Practice, Tata McGraw Hill, New Delhi.
4. Balasubramanian.T(2000),A textbook of English Phonetics for Indian Student, MacMillan Publishers, India.
5. KamaleshSadanand,SusheelaPunitha(2008),SpokenEnglish:AfoundationCourse:Parts1& 2, New Delhi, Orient
Longman Pvt. Ltd
WEB REFERENCES
1. www.cambridgeenglish.org.
2. www.esl-lab.com

INTRODUCTION TO JAVA
(OPEN ELECTIVE-1 offered to ECE, EEE, BME, CHE, ME, CE, PHE)
II Year B.Tech. I Sem

L T P C
3 0 0 3
Pre-requisites:
• Basic programming knowledge in C
Objectives:
• To understand object oriented programming concepts and apply them in problem solving.
• To learn the basic of java console and GUI based programming.
UNIT I 10 Lectures
OOP Concepts- Data abstraction, encapsulation, inheritance, benefits of inheritance, polymorphism, classes and
Objects, Procedural and Object Oriented programming paradigms.
Java Basics- History of Java, Java buzzwords, data types, variables, scope and life time of variables ,operators,
operator hierarchy, expressions, , type conversion and casting, enumerated types, control flow –block scope,
conditional statement loops, break and continue statements, simple java program, arrays, console input and
output, formatting output,
Classes and Objects– concepts of classes, objects, constructors, methods, access control, this keyword,
garbage collection, overloading methods and constructors, parameter passing, recursion, nested and inner
classes, building strings exploring string class.
UNIT II 10 Lectures
Inheritance – Inheritance Hierarchies, super and sub classes, member access rules ,Member access rules ,
super Keyword, preventing inheritance : final classes and methods ,the Object class and its
methods.
Polymorphism- Dynamic binding, method overriding, abstract classes and methods.
Interfaces –interfaces vs. Abstract classes, defining an interface, implementing interfaces, accessing
implementation through interface references, extending interface.
Packages: Defining, Creating and Accessing a Package, Understanding CLASSPATH, importing packages,
exploring packages – Java.io
UNIT III 10 Lectures

Exception Handling: Defining with errors, benefits of exception handing, the classification of exceptions-
exception hierarchy, checked exceptions and unchecked exception. Concepts of exception handling, usage of
try, catch, throw, throws and finally.
Multithreading: Differences between multiple processes and multiple threads, thread life cycle, creating thread,
interrupting threads, thread priorities, synchronizing threads, inter-thread communication.
UNIT IV 10 Lectures
Collection Framework in Java: Introduction to java collections, overview of java collection frame work,
Generics, commonly used collection classes-Array List ,Vector, Hash table, Stack, Enumeration, Iterator,
StringTokenizer, Random, Scanner, calendar and properties.
Applets– Concepts of Applets, differences between applets and applications, life cycle of an applet, types of
applets.
UNIT V 10 Lectures
GUI Programming with JAVA:
AWT – The AWT class hierarchy, user interface components- labels, button, canvas, scrollbars, text
components, check box, check box groups, choices, lists panels – scroll pane, dialogs, menu bar, graphics,
layout manager – layout manager types – boarder, grid, flow, card and grid bag.
SWING- Introduction to Swing, Swing VS AWT, Hierarchy for Swing Components, containers JFrame, JApplet,
JDialog, Jpanel , JButton class.
Outcomes:
1. Understanding of oop concepts and basics of java programming (console and GUI based).
2. The skills to apply OOP and Java programming in problem solving.
3. Should have the ability to extend his knowledge of java programming further on his/her own.
Text Books:
1. Java Fundamentals –A comprehensive Introduction, Herbert Schildt and Dale Skrien, TMH
2. Java; the complete reference, 7th editon, Herbert schildt, TMH.
References:
1. Java for Programmers P.J Deitel and HM Deitel, Pearson education (OR) JAVA: How to Program
P.J Deitel and H.M.Deitel, PHI
2. Object Oriented Programming through Java, P.Radha Krishna, Universities Press.
3. Thinking in Java, Bruce Eckel, Pearson Education.
4. Programming IN JAVA, S.Malhotra and S.Choudhary, Oxford Univ. Press.
5. Programming and Problem Solving with Java, JM Slack, B S Publications.
INDIAN CONSTITUTION
(MANDATORY COURSE)
CODE:A4302 2 - - -
Course Objectives:
1. Develop constitutional awareness.
2. Understand democracy at grass root level.
3. Understand the structure and administrative hierarchy of union and state governments.
4. Familiarization of human rights and duties among students.
5. Inculcate responsibilities towards nation building through technology.
UNIT – I: (Union Government and its Administration-Part 1) 10 Lectures
Constitution’ meaning of the term, Indian Constitution: Sources and constitutional history, Features:
Citizenship, Preamble, Fundamental Rights and Duties, Directive Principles of State Policy.
UNIT – II: (Union Government and its Administration-Part 2) 10 Lectures
Structure of the Indian Union: Federalism, Centre- State relationship, President: Role, power and position, PM
and Council of ministers, Cabinet and Central Secretariat, Lok Sabha, Rajya Sabha.
UNIT – III: (State Government and its Administration-Part 1) 10 Lectures
Governor: Role and Position, CM and Council of ministers, State Secretariat: Organization, Structure and
Functions.
UNIT – IV: (State Government and its Administration-Part 2) 10 Lectures
Local Administration: District’s Administration head: Role and Importance, Municipalities: Introduction, Mayor
and role of Elected Representative, CEO of Municipal Corporation, Pachayat raj: Introduction, PRI: Zila
Pachayat, Elected officials and their roles, CEO Zila Pachayat: Position and role, Block level: Organizational
hierarchy (Different departments), Village level: Role of Elected and Appointed officials, Importance of grass root
democracy.
UNIT – V: (Duties and Fundamental Rights-Part 1) 10 Lectures
Features of fundamental rights, laws inconsistent with fundamental rights, right to equality, right to freedom, right
against exploitation, right to freedom of religion, cultural and educational rights, right to constitutional remedies,
criticism of fundamental rights, significance of fundamental rights. Swaran Singh’s Committees recommendation,
list of fundamental duties, features of fundamental duties, Protection of Human Rights Act, 1993.
Course Outcomes: Upon completion of the course, students will be able to

1. Understand constitutional creation, the process of Pachayat Raj and its working mechanism.
2. Understand the structure and administrative hierarchy of the union government.
3. Understand the structure and administrative hierarchy of the state government.
4. Understand the hierarchy of local government at district and village level.
5. Understand human rights, responsibilities and recognize the responsibilities for societal well-being.
Reference Books:
1. Indian Polity’ by Laxmikanth Pub Macgrow Hill
2. Indian Constitution by M.V. Pylee,
3. Human Rights in Constitutional Law by Durgadas Basu
4. Indian Constitution Upkar Publication
O0P THROUGH JAVA PROGRAMMING

II Year B.Tech. IT II Sem L T P C
CODE:A44HA 3 - - 3
Pre-requisites:
• Basic knowledge in Structure Programming like ‘C’ programming.
Objectives: The Students will learn the following

• To understand object oriented programming concepts and applications in problem solving
• Learn the Java programming language: its syntax, idioms, patterns, and styles.
• To learn the basics of Java console and GUI based programs
• Introduce event driven Graphical User Interface (GUI) programming
Unit I: 10 Lectures
Java Programming: History of Java, Comments, Data Types, Variables, Constants, Scope and Lifetime of
Variables, Operators, Hierarchy Expressions, Type Conversions and Casting, Enumerated Types, Control for
Block Scope, Conditional Statements, Loops, Break and Continue Statements,
Simple Java Standalone Programs, Arrays, Console Input and Output, Formatting Output, Constructors,
Methods, Parameter Passing, Static Fields and Methods, Access Controls, This Reference, Overloading Methods
and Constructors, Recursions, Garbage Collections, Building Strings, Exploring
Strings Class.

Inheritance: Inheritance Hierarchies Super And Sub Classes, Member Access Rules, Super Keyword,And
Preventing Inheritance: Final Classes And Methods, The Object Class and Its Methods.
Polymorphism: Dynamic Binding, Method Overloading, Abstract Classes and Methods.
Interface: Interface vs. Abstract Classes, Defining an Interface, Implementing Interfaces, Accessing
Implementations Through Interfaces References, Extending Interface.
Inner Classes: Use 0f Inner Classes, Local Inner Classes, Anonymous Inner Classes, Static Inner Classes,
Example.
Packages: Defining, Creating and Accessing a Package, Understanding Class path, Importing Packages.
Unit III: B V Raju11Institute

Lecturesof Technology/ B Tech IT
Exception Handling: Dealing With Errors, Benefits of Exception Handling, The Classification of Exceptions,
Exception Hierarchy, Checked Exceptions And Unchecked Exception, Usage of Try , Catch, Throw, Throws, and
Finally, Re-Throwing Exceptions, Exception Specification, Built in Exceptions, Creating Own Exception Sub
Classes. Multithreading: Difference Between Multiple Processes and Multiple Threads, Thread States, Creating
Threads, Interrupting Threads, Thread Priorities, Synchronizing Threads, Inter-Thread Communication, Producer
Consumer Pattern.

Collection Framework in Java: Introduction to Java Collections, Overview of Java Collection Framework,
Generics, Commonly used Collection Classes-Array List, Vector, Hash Table, Stack, Enumeration, Iterator, String
Tokenizer, Random, Scanner, Calendar and Properties.
Files: Streams-Byte Streams, Character Streams, Text Input/output , Binary Input/output, Random-access File
Operations, File Management using File Class.
Connecting to Database: JDBC Type I To IV Drivers, Connecting to a Database, Querying a Database
and Processing The Results, Updating Data With JDBC.
Unit V: 14 Lectures
Applets: Inheritance Hierarchy for Applets, Differences Between Applets and Applications, Life Cycle of an
Applet, Passing Parameters to Applets, Applet Security Issues.
Event Handling: Events, Event Sources, Event Classes, Event Listeners, Relationship Between Event Sources
and Listeners, Delegation Event Model, Examples: Handling a Button Click, Handling Mouse Events, Adapter
Classes.
GUI Programming with Java: The AWT Class Hierarchy, Introduction to Swing, Swing vs. AWT,Hierarchy for
Swing Components, Containers-JFrame, JApplet, JDialog, JPanel, Overview of SomeSwing Components,
JButton, JLabel, JTextfield, JTextarea, Simple Swing Applications, Layout Management- Layout Manager Types-
Border Grid and Flow.
1. Understanding of OOP concepts and basics of java programming (Console and GUI Based)
2. The skills to apply OOP and java Programming in problem solving.
3. Understand development of JAVA applets vs. JAVA applications.
4. Understand the use of various system libraries.
Textbooks:
1. Java Fundamentals: A Comprehensive Introduction, Herbert Schildt and Dale Skrien, TMH.
References:
1. Java for Programming, P.J.Dietel Pearson Education
2. Object Oriented Programming through Java, P.Radha Krishna, Universities Press.
3.Thinking in Java, Bruce Eckel, Pearson Education
4.Programming in Java, S.Malhotra and S.Choudhary, Oxford University Press.
DATABASE MANAGEMENT SYSTEMS

CODE:A44EA 2 1 - 3
Pre-requisites: C programming, Data structures, set theory
OBJECTIVES : This course will enable

1. To learn the fundamentals of database systems and analyze the data models to represent a database
system using ER diagrams.
2. To learn the Relational Model using SQL and formulate basic SQL Queries.
3. To learn the Schema Refinement approaches and functional dependencies for
effective Database Design.
4. To Learn the Normalization rules for effective database design.
5. To learn the Importance of Transactions, Concurrency Control mechanism to real-time environment and
analyze the importance of recovery management
6. To learn the internal storage structures using different file and indexing techniques which will help in physical
Database design.
UNIT- I Introduction to Database System and Database Design 10 Lectures
Introduction to Database System :
Introduction-Database System Applications, Purpose of Database Systems, View of Data, Instance and
Schema, Data Models, Database Languages - DDL, DML,DCL, TCL, Database System Structure, History of Data
base Systems.
Introduction to Database Design :

Introduction to Data base design steps , ER diagram, Keys, Beyond ER Design, Entities, Attributes and Entity
sets, Relationships and Relationship sets, Additional features of ER Model, Conceptual Design for Large
enterprises: Case study
UNIT-II Introduction to Relational Model and Form of Basic SQL Query 10 Lectures
Introduction to Relational Model :
Structure of Relational Model , Constraints , Relational Algebra , Relational Calculus : TRC, DRC.
Form of Basic SQL Query
SQL fundamentals , Examples of Basic SQL Queries, Introduction to Nested Queries, Correlated Nested
Queries, Set - Comparison Operators, Aggregate Operators, NULL values, Logical connectives , Outer Joins,
Complex Integrity Constraints in SQL , Views, Triggers.
UNIT-III Introduction to Schema Refinement and Normalization 10 Lectures
Problems Caused by redundancy, Decompositions - Problem related to decomposition, Functional Dependencies

- Reasoning about FDS, Normal Forms - FIRST, SECOND, THIRD Normal forms - BCNF - Properties of
Decompositions - Loss less join Decomposition, Dependency preserving Decomposition, Multi valued
Dependencies - FOURTH Normal Form, Join Dependencies, FIFTH Normal form, Inclusion Dependencies.
UNIT-IV Transaction Processing and Recovery Systems 10 Lectures
Transactions Processing:
Transaction Concepts – ACID Properties, Schedules, Serializability
Concurrency Control – Need for Concurrency, Locking Protocols – Two Phase Locking , Deadlock, Timestamp
Based Protocols , Validation Based Protocols.
Recovery Systems : Failure Classification, Log Based Recovery, ARIES, Check Points, Save Point, Buffer
Management, Remote Back Up Systems
UNIT-V Overview of Storage and Indexing: 10 Lectures
Data on External Storage – overview of physical storage media, RAID-File Organization and Indexing-Data
Dictionary Storage– Cluster Indexes, Primary and Secondary Indexes – Index data Structures – Hash Based
Indexing – Tree base Indexing ––B+ Trees: A Dynamic Index Structure.
Course Outcomes : After completion of the course, the students will be able to
1. Demonstrate the fundamental elements of database management systems and Design ER-models to
represent simple database application scenarios . [L2]
2. Identify the importance of relational model with Key constraints and solve SQL Queries using Relational
algebra and calculus, join operations . [L3]
3. Apply Functional dependencies and decomposition rules for database design. [L3]
4. Identify the importance of improving database design using normalization rules. [L3]
5. Identify the Transaction Processing systems and Recovery methods . [L3]
6. Compare basic database storage structures and access techniques [L4]
Text Books:
1.Data base Management Systems, Raghurama Krishnan, Johannes Gehrke, McGrawHill Education, 3rd Edition,
2003.
REFERENCES:
1. Abraham Silberschatz, Henry F. Korth, S. Sudharshan, ―1Database System Conceptsǁ,Sixth Edition, Tata
McGraw Hill, 2011.
2.C. J. Date, A.Kannan, S. Swamynathan, ―An Introduction to Database Systemsǁ, Eighth Edition, Pearson
Education, 2006.
3. Ramez Elmasri, Shamkant B. Navathe, ―Fundamentals of Database Systemsǁ, Sixth Edition, Pearson, 2011.
4. G.K.Gupta,"Database Management Systemsǁ, Tata McGraw Hill, 2011.
5. Peter Rob & Carlos Coronel, “Data base Systems design, Implementation, and Management”, 7th Edition,
Pearson Education, 2000.
DESIGN AND ANALYSIS OF ALGORITHMS
CODE:A44EB 2 1 - 3
Prerequisites: Discrete Mathematics, Computational Thinking and Problem Solving Techniques
Course Objectives:
The students will learn the following:
1. Relate the algorithmic properties with mathematical approaches to design algorithms for real time
problems.
2. Extend divide and conquer strategies to solve complex problems in easy ways.
3. Make use of optimization techniques to solve real world problems.
4. Construct state space trees to explore the solutions and find an optimal solution for logical problems.
5. Categorize and solve computational problems using deterministic and non-deterministic algorithms.
Unit I: 8 Lectures
Introduction: Algorithm, Pseudo Code for Expressing Algorithms, Performance Analysis, Space Complexity,
Time Complexity, Asymptotic Notations. B V Raju Institute of Technology/ B Tech IT
Disjoint Sets: Disjoint Sets, Disjoint Set Operations, Union and Find Algorithms, Trees & Graphs, Tree Traversal
Techniques, Graph Traversal Techniques, Spanning Trees.
Divide and Conquer: General method, Applications: Binary Search, Merge Sort, Strassen’s Matrix Multiplication.
Greedy Method: General Method, Applications-Job Sequencing with Deadlines, Knapsack Problem, Minimum
Cost Spanning Trees, Single Source Shortest Path Problem.
Dynamic Programming: General Method, Applications-Matrix Chain Multiplication, 0/1 Knapsack Problem, All
Pairs Shortest Path Problem, Reliability Design, Multistage Graphs.
Backtracking: General Method, Applications-N-Queen Problem, Sum of Subsets Problem, Graph Coloring,
Hamiltonian Cycles.
Branch and Bound: General Method, Applications, 0/1 Knapsack Problem, Travelling Salesperson Problem, LC
Branch and Bound Solution, FIFO Branch and Bound Solution.
Unit V: 8 Lectures
NP-Hard and NP-Complete Problems: Basic Concepts, Decision Vs. Optimization Problems, Deterministic and
Non-Deterministic Algorithms, Boolean SAT Problem, K-CNF.
COURSE OUTCOMES: Upon the successful completion of the course, the student will be able:
1. Define and calculate the complexity of algorithms in terms of space and time. BL1
2. Infer the knowledge of divide and conquer technique to solve complex problems. BL2
3. Apply optimization techniques to find optimal solutions for real world problems. BL3
4. Build state space trees to find optimal solutions for logical problems. BL3
5. Analyze and solve computational problems using deterministic and non-deterministic algorithms. BL4
Text Books:
1. Fundamentals of Computer Algorithms, Ellis Horowitz, Satraj Sahni and Rajasekharan, Galgotia
publications Pvt. Ltd. (Unit - I :Chapter 1,2 and 6, Unit – II: Chapter 3,4, Unit – III: Chapter 5 , Unit – IV: Chapter
7,8 , Unit –V: Chapter 11)
References:
1. Algorithm Design: Foundations, Analysis and Internet examples, M.T.Goodrich and R.Tomassia, John
wiley and sons.
2. Introduction to Algorithms, second edition, T.H.Cormen, C.E.Leiserson, R.L.Rivest,and C.Stein, PHI Pvt.
Ltd./ Pearson Education
3. Design and Analysis of algorithms, Aho, Ullman and Hopcroft, Pearson education.
4. An Introduction to the Analysis of Algorithms, Michael Soltys, World Scientific.
NUMERICAL METHODS AND LINEAR TRANSFORMATIONS

(Common to CSE, CSE(AI&ML),CSE(DS) and IT)

CODE:A44NC 3 - - 3
Course Objectives:
1. To learn roots of algebraic and transcendental equations, curve fitting.
2. To understand the concept interpolation, and evaluation of numerical integration
3. To find the solutions of IVPs using various numerical methods.
4. To construct the orthonormal basis
5. To find the Rank and Nullity of Linear Transformations
Unit-I: Numerical Methods-I 10 Lectures

Solution of algebraic and transcendental equations: Bisection method, Newton-Raphson method and Regula-
Falsi method. Curve fitting by the method of Least squares- Fitting of straight line, parabola and exponential
curves.
Unit-II: Numerical Methods-II 10 Lectures

Finite differences: Interpolation using Newton’s forward and backward difference formulae. Central difference
interpolation: Gauss’s forward and backward formulae.
Numerical integration: Trapezoidal rule and Simpson’s 1/3rd and 3/8 rules,
Unit-III: Numerical Methods-II 10 Lectures

Ordinary differential equations: Taylor’s series, Euler and modified Euler’s methods, Runge-Kutta method of
fourth order for solving first order equations, Milne’s predictor-corrector method.
Unit-IV: Vector Spaces 13 Lectures

Vector space, Sub space, Linearly Dependent and Independence of vectors, Span, Basis, Dimension, Inner-
product, Orthogonal and Orthonormal vectors, Gram-Schmidt Orthogonalization process.
Unit-V: Linear Transformations 12 Lectures
Linear Transformation, Range space, Null Space, Rank and Nullity theorem (without proof), Matrix representation
of Linear Transformation.
Course outcomes:
1. Solve the equations by using Numerical methods and fit the curve for given data.(L3)
2. Estimate the functional values inside and outside given data, and evaluation of integrals.(L3)
3. Obtain approximate solutions for ODE.(L3)
4. Construct the orthonormal basis from the given set.(L3)
5. Find the matrix representation of Linear Transformations and its Rank, and Nullity.(L3)
Text Books:
1. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers
House, 2016
Reference Books:
1. Introduction to Linear Algebra, Gilbert Strang, 5th Edition, Wellesley, 2017.
2. Erwin kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley & Sons, 2006.
3. V. Ravindhranath, P.VijayaLakshmi, A text book on Mathematical Methods, Himalaya Publishing House,
Revised edition, 2011.
4. Ramana B.V., Higher Engineering Mathematics, Tata McGraw Hill New Delhi, 11th
Reprint, 2010
5. N.P. Bali and Manish Goyal, A text book of Engineering Mathematics, Laxmi
Publications, Reprint, 2008.
BIO-INFORMATICS
CODE:A44E1 3 - - 3
Pre-requisites: Nil
Objectives:
1. Introduce the file formats of sequence, Molecular file formats and conversion tools.
2. To Learn Data Storage techniques in biological databases and biological data retrieval.
3. To introduce Tools, retrieval techniques, databases of NCBI, gene expression features,
chemical databases and EMBL Nucleotide Sequence Database.
4. Able to use data tools of Protein data bank and Molecular Modelling Database,
5. To identify sequence similarity, producing phylogenetic trees, and developing homology
models of protein structures.
Unit I: 8 Lectures
Introduction to Bioinformatics: Introduction, Branches of Bioinformatics, Aim and Scope of Bioinformatics,

Sequence File Formats, Sequence Conversion Tools, Molecular File Formats, Molecular File Format Conversion
Unit II: 7 Lectures
Databases in Bioinformatics: Biological Databases, Classification Schema on Biological Databases, Biological

Database Retrieval Systems
Biological Sequence Databases: Introduction to National Center for Biotechnology Information, Tools and
Databases of NCBI, Database Retrieval Tools, BLAST and Variations.
Databases of NCBI: Nucleotide, Literature, Protein, Gene Expression, Structural, Chemical Database, EMBL
Nucleotide Sequence Database, Protein Information Resource.
Unit IV: 8 Lectures
Protein 3D Structure and Classification Databases: Protein Databank, Harnessing Data from PNB, Data
Deposition Tools, PDB Beta, Molecular Modelling Database (MMDB), Retrieval of Structural Data from MMDB.
Unit V: 9 Lectures
Sequence Alignments: Concept of Alignment, Scoring Matrices, Pointed Accepted Mutation (PAM), Blocks
Substitution Matrix (BLOSUM), Alignment of Pairs of Sequences, Alignment Algorithms, Heuristic Methods,
Multiple Sequence Alignment.
Course Outcomes: After the successful completion of the course, the students would be able to:
CO1. Outline the sequence file formats, molecular file formats and file format conversion tools.
CO2. Summarize Data Storage techniques in biological databases and biological data retrieval.
CO3. Identify and apply Tools, retrieval techniques, databases of NCBI, gene expression features, chemical
databases and EMBL Nucleotide Sequence Database.
CO4. Classify the data tools of Protein data bank and Molecular Modelling Database.
CO5. Explain the sequence similarity, PAM, algorithms used for alignment of sequences.
Textbook:
1. Bioinformatics – Principles and Applications, Zhumur Ghosh, Bibekanand Mallick, Oxford University
Press
References:
1. Introduction to Bioinformatics, Arthur Lusk, 5th Edition, Oxford University Press.

2. Introduction to Bioinformatics, Teresa Attwood, David Parry Smith, Pearson Education, 1999.
OOP THROUGH JAVA PROGRAMMING LAB
CODE:A441H - - 3 1.5
Pre-requisites: C Programming.
Objectives: The students will learn the following
1. Infer the knowledge of Java compiler and eclipse platform

2. Gain hands on experience with Java programming
3. Gain knowledge on developing Java database applications
4. To understand Java applet programming
5. To understand building Java GUI based applications using swing
List of Programs:
Week-1:
1. Write a JAVA program to display default value of all primitive data types of JAVA.
2. Write a JAVA program to displays the roots of a quadratic equation ax2+bx+c =0. Calculate the
discriminate D and basing on the value of D, describe the nature of roots.
3. Write a JAVA program to give the example for ‘this’ operator. And also use the ‘this’ keyword as return
statement.
4. Write a JAVA program to demonstrate static variables, methods, and blocks.
Week-2:
5. Write a JAVA program to given the example for ‘super’ keyword.
6. Write a JAVA program that illustrates simple inheritance.
7. Write a JAVA program that illustrates multi-level inheritance.
8. Write a JAVA program demonstrating the difference between method overloading and method
overriding.
9. Write a JAVA program demonstrating the difference between method overloading and constructor
overloading.
Week-3:
10. Write a JAVA program that describes exception handling mechanism.
11. Write a JAVA program for example of try and catch block. In this check whether the given array size is
negative or not.
12. Write a JAVA program to illustrate sub class exception precedence over base class.
13. Write a JAVA program for creation of user defined exception.
Week-4:
14. Write a JAVA program to illustrate creation of threads using runnable class.(start method start each of
the newly created thread. Inside the run method there is sleep () for suspend the thread for 500 milliseconds).
15. Write a java program that implements a multi-thread application that has three threads. First thread
generates random integer every 1 second and if the value is even , second thread computes the square of the
number and prints. If the value is odd, the third thread will print the value of cube of the number.
Week-5:
16. Write a JAVA program illustrating multiple inheritance using interfaces.
17. Write a JAVA program for Abstract Class and Interfaces.
Week-6:
18. Write a JAVA program to create a package named pl, and implement this package in ex1 class.
19. Write a Java Program for Implementation of Access Modifiers using various levels of Packages.
20. Write a Java Program Using String Tokenizer(Reverse the Big String & Count the number of Words,
Reverse the Words in the given String).
Week-7:
21. Write a JAVA program that describes the life cycle of an applet.
22. Implementation of Graphics Class Methods for displaying the Applet(Face, House ,Car, Movable
Objects)
Week-8:
23. Java Program for handling the Mouse,Key and Window Events Implementation.
24. Write a Simple Java Program based on Java Collections(ArrayList, Sets, Trees, Queue, Stack and
Vectors etc).
Week-9:
25. Write a JAVA program to Implement the various components in AWT(textarea, textfield, buttons, Layout
Control etc)
Week-10:
26. Write a JAVA program to Implement the various components in Swings (JFrame, JLabel, JApplet etc).
Week-11: B V Raju Institute of Technology/ B Tech IT
27. Write a java program that works as a simple calculator. Use a grid layout to arrange buttons for the
digits and for the +,-,*,/,% Operations. Add a text field to display the results. Handle any possible exceptions like
divided by zero.
28. Write a JAVA program that displays number of characters, lines and words in text file.
29. Write a JAVA program based on File Handling Methods(Reading, Copying, Merging the files etc).
Week-12:
30. Write a java program that connects to a data base using JDBC and does add, delete , modify and retrieve
operations.
Outcomes: After completion of the course, the students would be able to:
1. Develop the standalone applications for Multi-Threaded and Exceptions Handling.

2. Apply OOP in java programming in problem solving.
3. Ability to access data from a database with java programming.
4. Develop Java applets and applications
5. Develop Java applications using swing.
Textbooks:
1. Java Fundamentals- A Comprehensive introduction, Herbert schildtand Dale skrien, TMH.

2. Java for programming, P.J.Dietel Pearson education (OR) Java: How to Program P.J.Dietel and
H.M.Dietel, PHI
3. Object Oriented Programming through java, P.Radha Krishna, Universities Press.
4. Thinking in Java, Bruce Eckel, Pearson Education
5. Programming in Java, S.Malhotra and S.Choudhary, Oxford Univ Press.
DATABASE MANAGEMENT SYSTEMS LAB

CODE:A442H - - 3 1.5
Pre-requisites: C programming, Data structures
Course objectives: This course will enable students to

1.Foundation knowledge in database concepts, technology and practice to groom students into well informed
database application developers.
2.Strong practice in SQL programming through a variety of database problems.
3.Develop database applications using front-end tools and back-end DBMS
4. Interpret the knowledge on database design.
5. Determine the knowledge on key constraints and Normalization.
6. Determine the knowledge on triggers, procedures ,cursors and functions.
Experiment 1: Working with ER Diagram and Normalization

Example: ER Diagram for Sailors Database Entities:
1. Sailor
2. Boat
Relationship: Reserves
Primary Key Attributes:
1. SID (Sailor Entity)
2. BID (Boat Entity)
Note :
Analyze the given data 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. B V Raju Institute of Technology/ B Tech IT
Note : The student is to submit a document by writing the entities, relation ships and key to the lab faculty.
Experiment 2: Working with DDL, DML, DCL and Key Constraints Creation, Altering and Dropping of Tables
and Inserting rows into a Table (Use Constraints While Creating Tables) Examples Using Select Command.
Experiment 3: Working with Queries and Nested QUERIES Queries (along with sub Queries) using ANY, ALL,
IN, EXISTS, NOTEXISTS, UNION, INTERSET, Constraints
Experiment 4: Working with Queries USING Aggregate Operators & views Queries using Aggregate
Functions (COUNT, SUM, AVG, MAX and MIN), GROUP BY, HAVING and Creation and Dropping of Views
Experiment 5: Working with Conversion Functions & String Functions Queries using Conversion Functions
(to_char, to_number and to_date), String Functions (Concatenation, lpad, rpad, ltrim, rtrim, lower, upper, initcap,
length, substr and instr), Date Functions (Sysdate, next_day, add_months, last_day, months_between, least,
greatest, trunc, round, to_char, to_date)
Experiment 6: Working with Triggers using PL/SQL Develop Programs using BEFORE and AFTER Triggers,
Row and Statement Triggers and INSTEAD OF Triggers
Experiment 7: Working with PL/SQL Procedures Programs Development using Creation of Procedures,
Passing Parameters IN and OUT of PROCEDURES
Experiment 8: Working with LOOPS using PL/SQL and Exception Handling Program Development using
WHILE LOOPS, Numeric FOR LOOPS, Nested Loops using ERROR Handling, BUILT-IN Exceptions, USE
Defined Exceptions, RAISE- APPLICATION ERROR
Experiment 9: Working with Functions Using PL/SQL Program Development using Creation of Stored
Functions, Invoke Functions in SQL Statements and Write Complex Functions.
Experiment 10: Working CURSORS Develop Programs using Features Parameters in a CURSOR, FOR
UPDATE CURSOR, WHERE CURRENT of Clause and CURSOR Variables
Experiment11: Installation of MYSQL and verification of online platforms to support creation of database
through online mode.
Outcomes: After completion of the course, the students will be able to:
1. Apply DDL, DML, DCL Commands using SQL. [L3]
2. Construct an Entity Relationship model for any large Enterprise. [L3]
3. Apply key constrains to the relational model. [L3]
4. Apply triggers, procedures and functions using PL/SQL [L3]
5.Develop Cursors for dynamic database applications [L3]
Textbooks:
1. Oracle PL/SQL by Example, Benjamin Rosenzweig, Elena Silvestrova, Pearson Education 3rd Edition
Reference Books:
1. Oracle Database LogG PL/SQL Programming, Scott Urman, Tata Mc-Graw Hill.
2. SQL and PL/SQL for Oracle 10g, Black Book, Dr .P.S. Deshpande.
INTRODUCTION TO DATABASE MANAGEMENT SYSTEM

(OPEN ELECTIVE-2 offered for ECE, EEE, BME, CHE, CE, ME, PHE)
II Year B.Tech. II Sem

L T P C
3 0 0 3
Course Objective:
1. To make learner understand the basic goals functions, models, applications of database systems
2. To identify major DBMS functions and describe their roles in a database systems.
3. To design of a database, explain models used for structuring data in database systems.
4. Be able to query a database using SQL.
5. To understand the process involved in the transaction management.
UNIT-I 9 Lectures
Introduction
Introduction to DBMS, What is Database System, Database System Applications, Purpose of Database Systems,
View of Data – Data Abstraction, Instances and Schemas, Database Languages – DDL, DML, Database
Architecture, Database Users.
UNIT-II 9 Lectures
Entity-Relationship Model
Introduction to Database Design - ER diagrams, Beyond ER Design. Entity, Attributes and Entity sets,
Relationships and Relationship sets, Additional features of ER Model, Case Study Example.
Introduction to Relational Model
Introduction to the Relational Model, Integrity Constraints over Relations, Enforcing Integrity constraints, ER-to-
Relational Mapping, Introduction to Views.
UNIT-IV 10 Lectures
Introduction to SQL
Form of Basic SQL Query – Examples of Basic SQL Queries, Set Operations, Nested Queries, Correlated
Nested Queries, Aggregate Functions, Group By and Having Clauses, Order By clause.
UNIT-V 10 Lectures
Introduction to Schema Refinement & Database Design
Dependencies and Normal Forms, Functional dependencies, Decompositions and Properties of Decompositions,
Purpose of Normalization, Normal Forms - 1NF, 2NF, 3NF and BCNF.
Course Outcomes:
1. Describe basic concepts & components of Database Management System.
151068880. Recognize various ER-Diagram Notations and Design ER-Diagram for real world
applications.
151068928. Analyze Relational model with different constraints.
1. Formulate and Implement SQL queries for relational model.
151069136. Analyze and apply normalization concept for relational database schema.
Text Books:
1. Database System Concepts, Sixth Edition, Abraham Silberschatz, Henry F. Korth, S. Sudarshan, Tata
McGraw-Hill, 2010.
2. Fundamental of Database Systems by Ramez Elmasri and Shamkant B Navathe, Sixth Edition, Addison
Wesley, 2011.
Reference Books:
1. Database Management Systems, 3/e, Raghuram Krishnan, Johannes Gehrke, TMH
2. Introduction to Database Systems, 8/e, C.J. Date, PEA
E- Books:
1. Database Management System by Raghu Ramakrishnan
2. An Introduction to Relational Database Theory by Hugh Darwen
MOOCs:
1. http://nptel.ac.in/courses/IIT-MADRAS/Intro_to_Database_Systems_Design
2. http://www.iitg.ernet.in/awekar/teaching/cs344fall11/
GENDER SENSITIZATION
(MANDATORY COURSE)
CODE:A4402 2 - - -
Course Objectives:
1. To develop students sensibility with regard to issues of gender in contemporary India.
2. To provide a critical perspective on the socialization of men and women.
3. To introduce students to information about some key biological aspects of genders.
4. To expose the students to debates on the politics and economics of work.
5. To help students reflect critically on gender violence.
6. To expose students to more egalitarian interactions between men and women.
Unit I: UNDERSTANDING GENDER: Gender: Why should we study It? (Towards a world of Equals: Unit-1)
Socialization: Making Women, making Men(Towards a world of Equals:Unit-2) Introduction. Preparing for
Womanhood. Growing up male, First lessons in /caste, Different Masculinities. Just Relationships: Being
Together as Equals(Towards a World of Equals:Unit-12) Mary Kom and Onler, Love and Acid just do not Mix,
Love Letters, Mothers and Fathers, Further Reading: Rosa Parks-The Brave Heart.
Unit II: GENDER AND BIOLOGY: Missing Women: Sex Selection and its Consequences (Towards a World of
Equals: Unit-4) Declining Sex Ratio, Demographic Consequences. Gender Spectrum: Beyond The
Binary(Towards a World of Equals: Unit-10) Two or Many? Struggles with Discrimination Additional Reading :
Our Bodies, Our Bodies, Our Health(Towards a World of Equals: Unit-13)
Unit III: GENDER AND LABOUR: Housework: the Invisible Labour (Towards a World of Equals: Unit-3) ― My
Mother doesn‘t Work. ― Share the Load Women’s Work: Its Politics and Economics (Towards a World of Equals:
Unit-7) Fact and Fiction Unrecognized and Unaccounted work. Further Reading: Wages and Conditions of Work.
Unit IV: ISSUES OF VIOLENCE: Sexual Harassment: Say No! (Towards a World of Equals: Unit-6) Sexual
Harassment, not-eve-teasing-coping with everyday harassment-further Reading: ― Chupulu. Domestic Violence:
Speaking Out (Towards a World of Equals: Unit-8)
Unit V: GENDER AND CULTURE: Gender and Film-Gender and Electronic Media-Gender and Advertisement-
Gender and Popular Literature- Gender Development Issues-Gender Issues- Gender Sensitive Language-
Gender and Popular Literature - Just Relationships: Being Together as Equals. Mary Kom and Onler. Love and
Acid just do not Mix. Love Letters. Mothers and Fathers. Rosa Parks- The Brave Heart.
Course Outcomes:
1. Students will have developed a better understanding of important issues related
B V Raju to gender
Institute in contemporary
India.
2. Students will be sensitized to basic dimensions of the biological, sociological, psychological and legal aspects
of gender. This will be achieved through discussion of materials derived from research, facts, everyday life,
literature and film.
3. Students will attain a finer grasp of how gender discrimination works in our society and how to counter it.
4. Students will acquire insight into the gendered division of labour and its relation to politics and economics.
5. Men and Women students and professionals will be better equipped to work and live together as equals.
Text Book:
1. “Towards a World of Equals: A Bilingual Textbook on Gender” written by A.Suneetha, Uma Bhrugubanda,
Duggirala Vasanta, Rama Melkote, Vasudha Nagaraj, Asma Rasheed, Gogu Shyamala, Deepa Sreenivas and
Susie Tharu published by Telugu Akademi, Telangana Government in 2015.
References:
1. Sen, Amartya, ― More than One Million Women are Missing,ǁ New York Review of Books 37.20(20 December
1990) Print ‗ We were Making History…‘ Life Stories of Women in Telangana Peoples Struggle , New Delhi: Kali
for Women,1989.
2. Tripti Lahiri ― By the Numbers: Where Indian Women Work ― Womens Studies Journal (14 November 2012)
Available Online at: http://blogs,wsj.com/India real time/2012/11/14/by- the numbers-where-Indian-women-work/>
3. K. Satyanarayana and Susie Tharu(Ed) Steel Nibs are Sprouting: New Dalit Writing from South India, Dossier
2: Telugu And Kannada http://harpercollins.co.in/BookDetail.asp?Book Code-3732
4. Vimala ‗Vantillu ( The Kitchen)ǁ Women Writing in India:600 BC to the Present Volume II: The 20th
Century.Ed.Susie Tharu and K. Lalita Delhi: Oxford University Press,1995 559-601
5. Shatrughuna, Veena et al Womens Work and its Impact on child Health and Nutitution, Hydeabad, National
Institute of Nutrition, India Council of Medical Research,1993.
COMPUTER NETWORKS
III Year B.Tech. IT I Sem L T P C
CODE: A45EA 3 - - 3
Pre-requisites: Foundations of Computer Design
Course Objectives:
1. To illustrate the importance of layering and the functionality of various layers
2. To analyze the data detection and correction methods.
3. To make use of the various routing algorithms in the Internetwork.
4. To analyze the Transport protocols in the data transmission.
5. To utilize the different applications of the Application Layer.
Unit I: 10 Lectures
Data communication Components: Representation of data, Data Flow, Network Topologies,

Protocols, OSI Reference Model, TCP/IP Reference Model.
Physical Layer: Transmission Media – Guided and Unguided Transmission Media.
LAN: Wired LAN, Wireless LANs, Techniques for Bandwidth utilization: Multiplexing - Frequency
division, Time division and Wave division.
Data Link Layer: Services, Framing, Error Control: Parity bit method, Block coding, CRC, Hamming
code, and Flow Control.
Medium Access Control Sublayer: Protocols - Stop and Wait, Go back n, Selective Repeat, Sliding
Window Protocols, Multiple access protocols: ALOHA, CSMA, Collision free protocols, IEEE 802.3
standards, and HDLC.
Network Layer: Switching Techniques, Tunneling, Fragmentation, Logical addressing – IPV4, IPV6,
Address Mapping – ARP, RARP, NAT, DHCP, ICMP, IGMP Adaptive and Non-Adaptive Routing
algorithms.
Transport Layer: Transport Services, Connection Management using three-way handshake principle,
User Datagram Protocol (UDP), Transmission Control Protocol (TCP), SCTP, Congestion Control
Policies, QoS Techniques: Leaky Bucket and Token Bucket algorithm.
Unit V: 08 Lectures
Application Layer: DNS, TELNET, E-MAIL, FTP, WWW, HTTP, SNMP, Bluetooth, Firewalls.
1. List out various Network Reference models and transmission media
2. Illustrate Data Link Layer design issues and protocols

3. Model the routing algorithms in various types of networks
4. Make use of suitable protocols for ensuring QoS in data transportation
5. Dissect and utilize the user-defined applications in real-time scenarios.
Textbooks:
1. Data Communication and Networking, 4th Edition, Behrouz A. Forouzan, McGraw- Hill.
References:
1. Computer Networks, 8th Edition, Andrew S. Tanenbaum, Pearson New International Edition.
2. Data and Computer Communication, 8th Edition, William Stallings, Pearson Prentice Hall India.
3. Internetworking with TCP/IP, Volume 1, 6th Edition Douglas Comer, Prentice Hall of India.

OPERATING SYSTEMS
CODE: A45H1 3 - - 3
Pre-requisites:
OBJECTIVES:
1. To understand the basic concepts and functions of operating systems

2. To understand Processes and analyze Scheduling algorithms.
3. To understand the concept of Deadlocks.
4. To analyze various memory management schemes.
5. To understand I/O management and File systems.
Unit – I OPERATING SYSTEM OVERVIEW 8 Lectures
BV
Operating Systems –Definition- Types , Instruction Execution, objectives Raju
and InstituteEvolution
functions, of Technology/ B Tech IT
of Operating
System. Operating System Structure – System Calls- Virtual Machines, Interrupts.
UNIT II PROCESS MANAGEMENT 11 Lectures
Processes – Process Concept, Process Definition, Process States ,Operations on Processes , Process Control
Block (PCB), Process Scheduling- Scheduling Queues, Schedulers, Context Switch,
CPU Scheduling – Scheduling criteria, Scheduling algorithms - Pre-emptive and non-pre-emptive - FCFS, SJF,
Round Robin, Multiple-processor scheduling, Real time scheduling
UNIT III 11 Lectures
Process Synchronization – The critical-section problem, Peterson’s Solution,Synchronization hardware, Mutex

locks, Semaphores, Classic problems of synchronization: Readers & Writers Problem, Dining Philosopher
Problem etc, Monitors; Deadlock – System model, Deadlock characterization, Methods for handling deadlocks,
Deadlock prevention, Deadlock avoidance: Banker’s Algorithm,, Deadlock detection, Recovery from deadlock.
UNIT IV
STORAGE MANAGEMENT 9 Lectures
Main Memory – Background, Swapping, Contiguous Memory Allocation, Paging, Segmentation, Segmentation
with paging, Virtual Memory – Background, Demand Paging, Page Replacement algorithms, Allocation of
frames, Thrashing;
UNIT V
FILE SYSTEMS AND I/O SYSTEMS 9 Lectures

Mass Storage system – Overview of Mass Storage Structure, Disk Structure, Disk Scheduling and
Management, swap space management; File-System Interface – File concept, Access methods, Directory
Structure, Directory organization, File system mounting, File Sharing and Protection.
File System Implementation- File System Structure, Directory implementation, Allocation Methods, Free Space
Management, Efficiency and Performance
COURSE OUTCOMES:
At the end of the course, the students should be able to:
Understand the architecture and functionalities of modern OS

Understand and apply the algorithms for resource management and scheduling
Analyze and Apply semaphores and monitors for classical and real world synchronization scenarios
Understand deadlock, prevention and avoidance algorithms.
Compare and contrast various memory management schemes.
Understand the functionality of file systems.
TEXT BOOK :
1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, ―Operating System Conceptsǁ, 9 th
Edition, John Wiley and Sons Inc., 2012
2. William Stallings, “Operating Systems –Internals and Design Principles”, 8/E, Pearson Publications,
2014
REFERENCES :
1. Andrew S. Tanenbaum, ― Modern Operating Systems. Fourth Edition, Prentice Hall; 2016.
2. Achyut S.Godbole, Atul Kahate, ―Operating Systemsǁ, McGraw Hill Education, 2016.
3. Deitel HM, Deitel PJ, Choffnes DR. Operating systems. Third Edition, Prentice Hall; 2004.
4. Gary Nutt, ―Operating Systemsǁ, Third Edition, Pearson Education, 2004.
COMPUTER GRAPHICS
PROFESSIONAL ELECTIVE-1

CODE: A45H2 3 - - 3
Pre-requisites:
Introduction to geometric algorithms.
Objectives: This course will enable students to

Understand the fundamentals of computer graphics and have knowledge of basic technical competence
in the field of computer graphics and openGL.
Emphasize the implementation aspect of Computer Graphics Algorithms.
Understand introduction to computer graphics techniques, focusing on 2D & 3D geometric
transformations, Viewing, openGL.
Prepare the student for advanced areas in the field of Computer Graphics.
Unit I: 10 Lectures
Introduction to Computer Graphics: What is computer Graphics, Application Areas of Computer Graphics,
Overview of Graphics Systems, Video-Display Devices, Raster-Scan Systems, Random Scan Systems, Graphics
Monitors and Workstations and Input Devices and OpenGL Interactive Input Device Functions, Conceptual
Framework for Interactive Graphics.

Output primitives: Points and Lines, Line Drawing Algorithms, Mid-Point Circle and Ellipse Algorithms.
Filled Area Primitives: Scan Line Polygon Fill Algorithm, Boundary-Fill and Flood-Fill Algorithms.

B V and
2-D geometrical transforms: Translation, Scaling, Rotation, Reflection Raju Shear
InstituteTransformations,
of Technology/ BMatrix
Tech IT
Representations and Homogeneous Coordinates, Composite Transforms, Transformations between Coordinate
Systems.
3-D Geometric transformations: Translation, Rotation, Scaling, Reflection and Shear Transformations,
Composite Transformations

2-D Viewing: The Viewing Pipeline, Viewing Coordinate Reference Frame, Window to View-Port Coordinate
Transformation, Viewing Functions.
3-D viewing: Viewing Pipeline, Viewing Coordinates, Projections: Parallel Projections, Perspective Projections.
Cohen-Sutherland and Cyrus-Beck Line Clipping Algorithms, Sutherland –Hodgeman Polygon Clipping
Algorithm, OpenGL Two-Dimensional and Three-Dimensional Viewing Functions.
Unit V: 11 Lectures
Computer animation: Design of Animation Sequence, General Computer Animation Functions, Raster
Animation, Computer Animation Languages, Key Frame Systems, Motion Specifications, OpenGL Animations.
List various applications of computer graphics, relate various Display Devices.
Relate the drawing algorithms for various geometric shapes.
Illustrate 2-D & 3-D Geometrical Transformation algorithms
Relate 2-D & 3-D viewing algorithms for Images, using openGL.
Illustrate computer animation.
Textbooks:
1. Computer Graphics, second Edition, Donald Hearn and M.Pauline Baker, PHI/Pearson Education.
2. Computer Graphics C version, 4th edition Donald Hearn and M.Pauline Baker, Pearson Education.
3. Computer Graphics with open GL 4th edition Donald Hearn and M.Pauline Baker, Warrien Carithers.
Reference:
● Roy A. Plastock and Gordon Kalley, “Schaum's Outline Series - Theory and Problems of Computer
Graphics”, Second Edition, Tata McGraw-Hill, 2000.
● Foley J.D, Van Dam A, Eiener S.K. and Hughes J.F., “Computer Graphics Principles and Practice”,
Second Edition, Pearson Education, 1996.
Weblinks:
https://www.edx.org/course/computer-graphics-2
https://www.coursera.org/learn/interactive-computer-graphics
SOFTWARE PROJECT MANAGEMENT
CODE: A45H3 3 - - 3
Prerequisites:
1. Must have knowledge on Software Engineering.
2. Basic idea on Analysis and Design of software.
3. Knowledge on Managerial skills is desirable.
Objectives:
1. To understand the Software Project Planning and Evaluation techniques.
2. To plan and manage projects at each stage of the software development life cycle (SDLC).
3. To learn about the activity planning and risk management principles.
4. To manage software projects and control software deliverables.
5. To develop skills to manage the various phases involved in project management and people
management.
6. To deliver successful software projects that support organization ‘s strategic goals.
UNIT I Lectures 12
PROJECT EVALUATION AND PROJECT PLANNING
Importance of Software Project Management – Activities – Methodologies – Categorization of Software Projects –
Setting objectives – Management Principles – Management Control – Project portfolio Management – Cost-
benefit evaluation technology – Risk evaluation – Strategic program Management – Stepwise Project Planning.
UNIT II Lectures 14
PROJECT LIFE CYCLE AND EFFORT ESTIMATION
Software process and Process Models – Choice of Process models – Rapid Application development – Agile
methods – Dynamic System Development Method – Extreme Programming – Managing interactive processes –
Basics of Software estimation – Effort and Cost estimation techniques – COSMIC Full function points –
COCOMO II – a Parametric Productivity Model.
UNIT III Lectures 12
ACTIVITY PLANNING AND RISK MANAGEMENT
Objectives of Activity planning – Project schedules – Activities – Sequencing and scheduling – Network Planning
models – Formulating Network Model – Forward Pass & Backward Pass techniques – Critical path (CRM)
method – Risk identification – Assessment – Risk Planning –Risk Management – – PERT technique – Monte
Carlo simulation – Resource Allocation – Creation of critical paths – CostBschedules.
V Raju Institute of Technology/ B Tech IT
UNIT IV Lectures 12
PROJECT MANAGEMENT AND CONTROL
Framework for Management and control – Collection of data – Visualizing progress – Cost monitoring – Earned
Value Analysis – Prioritizing Monitoring – Project tracking – Change control – Software Configuration
Management – Managing contracts – Contract Management.
UNIT V Lectures 12
STAFFING IN SOFTWARE PROJECTS
Managing people – Organizational behavior – Best methods of staff selection – Motivation – The Oldham –
Hackman job characteristic model – Stress – Health and Safety – Ethical and Professional concerns – Working in
teams – Decision making – Organizational structures – Dispersed and Virtual teams – Communications genres –
Communication plans – Leadership.
OUTCOMES:
At the end of the course, the students should be able to:
1. Understand Project Management principles while developing software.
2. Gain extensive knowledge about the basic project management concepts, framework and the process
models.
3. Obtain adequate knowledge about software process models and software effort estimation techniques.
4. Estimate the risks involved in various project activities.
5. Define the checkpoints, project reporting structure, project progress and tracking mechanisms using
project management principles.
6. Learn staff selection process and the issues related to people management
TEXT BOOK:
1. Bob Hughes, Mike Cotterell and Rajib Mall: Software Project Management – Fifth Edition, Tata McGraw
Hill, New Delhi, 2012.
REFERENCES:
1. Robert K. Wysocki ―Effective Software Project Management – Wiley Publication, 2011.
2. Walker Royce: ―Software Project Management- Addison-Wesley, 1998.
3. Gopalaswamy Ramesh, ―Managing Global Software Projects – McGraw Hill Education (India),
Fourteenth Reprint 2013.
INTERNET OF THINGS
CODE: A45H4 3 - - 3
Course Objectives:
1. To understand the terminology, technology and its applications of IoT.
2. To introduce the concept of M2M (machine to machine) with necessary protocols.
3. How to setup IDE and work on Arduino libraries and basics of Embedded C
4. To understand how to Network with ESP8266 WiFi module
5. To implement IoT in different platforms of cloud
UNIT-1 10 Lectures
Introduction to IOT
Understanding IoT fundamentals, IOT Architecture and protocols, Various Platforms for IoT, Real-time Examples
of IoT, Overview of IoT components and IoT Communication Technologies, Challenges in IoT
UNIT-2 10 Lectures
Arduino Simulation Environment
Arduino Uno Architecture, Setup the IDE, Writing Arduino Software Arduino Libraries, Basics of Embedded C
programming for Arduino Interfacing LED, push-button and buzzer with Arduino, Interfacing Arduino with LCD
UNIT-3 10 Lectures
Sensor & Actuators with Arduino
Overview of Sensors working, Analog and Digital Sensors, Interfacing of Temperature, Humidity, Motion, Light
and Gas Sensor with Arduino, Interfacing of Actuators with Arduino. Interfacing of Relay Switch and Servo Motor
with Arduino
UNIT-4 10 Lectures
Basic Networking with ESP8266 WiFi module
Basics of Wireless Networking, Introduction to ESP8266 Wi-Fi Module,Various Wi-Fi library, Web server-
introduction, installation, configuration, Posting sensor(s) data to web server
UNIT-5 10 Lectures
IoT Protocols
M2M vs. IOT, Communication Protocols Cloud Platforms for IOT: Virtualization concepts and Cloud
Architecture, Cloud computing, benefits, Cloud services — SaaS, PaaS, IaaS, Cloud providers & offerings, Study
of IOT Cloud platforms.
Course Outcomes: After successful completion of this course, student will be able to
1. Understand general concepts of Internet of Things (IoT).
2. Apply design concept to IoT solutions.
3. Recognize various devices, sensors and applications.
4. Create IoT solutions using sensors, actuators and Devices.
5. Analyze various M2M and IoT architectures.
Text Books:
1. Integrated Electronics: Analog and Digital Circuits and Systems, 2/e, Jacob Millman, Christos Halkias and
Chethan D. Parikh, Tata McGraw-Hill Education, India, 2010.
2. Digital Design, 5/e, Morris Mano and Michael D. Cilette, Pearson, 2011.
REFERENCE BOOKS:
1. Electronic Devices and Circuits, Jimmy J Cathey, Schaum’s outline series, 1988.
2. Digital Principles, 3/e, Roger L. Tokheim, Schaum’s outline series, 1994.
LINUX PROGRAMMING
CODE: A45H5 3 - - 3
Pre-requisites: C programming
Objectives:
1. To introduce the Unix/Linux operating system and shell programming basics.
2. Knowledge of Unix/Linux tools for file handling.
3. Introduction of process manipulation and its communication.
4. To develop the basic skills required to write network programming using sockets.
UNIT I: 9 Lectures
Linux Startup and Shell Programming: User accounts, accessing linux- starting and shutting process, Logging
in and Logging out, Command line, simple command, Unix file system: Linux/Unix files, inodes and structure and
file system related commands, Shell as command processor, shell variables, creating command substitution,
scripts, functions, conditionals, loops, customizing.
UNIT II 9 Lectures
Regular Expressions and Filters:Introducing regular expressions patterns, syntax, character classes,
quantifiers, introduction to egrep, sed- scripts, operation, address, commands, applications, awk- execution,
fields and records, scripts, operations, patterns, actions, functions, using system commands in awk.
UNIT III 8 Lectures

Process in Linux: Process concepts, Kernel support for process, process attributes, process control- process
creation. Waiting for a process, process termination, zombie process, orphan process, process APIs. Signals,
Signal generation and handling, Kernel support for signal, Signal function, unreliable signals, reliable signals, Kill,
raise, alarm, pause, abort, sleep, functions using c.
UNIT IV 8 Lectures
Inter Process Communications:- Introduction to IPC, pipes, FIFOs, Introduction to three types of IPC- message
queues, semaphores and shared memory using C.
Message Queues:- kernel support for messages, Unix system V APIs for messages, client/server examples.
Shared Memory:-Kernel support for Shared memory, Unix System V APIs for shared memory, semaphore and
shared memory examples.
UNIT V 8 Lectures
Linux Networking: Introduction to Networking in Linux, Network basics & tools, File transfer protocol in Linux,
Network file system, Domain Naming Services, Dynamic hosting configuration Protocol & Network information
Services.
Outcomes:
1. Execute commands and shell scripts in linux environment
2. Use regular expressions and filters in shell scripting
3. Analyze the processes and the signals in kernel environment
4. Organize the communication among the processes using IPC techniques
5. Compose the process communication through network
TEXT BOOKS:-
1. Unix System Programming using C++, T. Chan, PHI
2. UNIX concepts and Applications, 4th Edition, Sumitabha Das, TMH.
3. Beginning Linux Programming, 4th Edition, N.Matthew, R.Stones, Wrox, Willey India Edition.
REFERENCE BOOKS:
1. Sumitabha Das: Your Unix- The Ultimate Guide, TMH, 2012
2. Behrouz A. Forouzan, Richard F. Gilberg: UNIX and Shell Programming, Brooks/Cole-Thomson
Learning (CENGAGE Learning, India) , 2009
3. John Goerzen: Linux Programming Bible, IDG Books, New Delhi, 2000
4. Neil Matthew, Richard Stones: Beginning Linux Programming, Wrox-Shroff, 2007.
5. Welsh & Kaufmann: Running Linux, O’Reiley & Associates, 2000
6. Unix The Text book, 2nd edition, S.M.Sarawar, Koretsky, S.A.Sarawar, Pearson Edition
7. Unix Internals, U.Vahalia, Pearson Education.
8. Unix shell Programming. S.G.Kochan and P.Wood, 3rd edition, Pearson Education.
PRINCIPLES OF PROGRAMMING LANGUAGES
CODE: A45H6 3 - - 3
Pre-requisites:
Programming for Problem Solving,Object Oriented Programming through JAVA.
Objectives: The students will learn the following:

1. To understand the fundamental concepts of principles of language design, formal syntax and semantic,
BNF.
2. To understand different data types, variables, expressions, types of statements, different types of control
statements and iterations.
3. To understand the concept of Sub programs and blocks, operator overloading, Method overloading and
co-routines.
4. To understand the concept of Abstract data types, concurrency, exception handling of different
programming languages and logic programming languages
5. To understand Functional Programming Languages like FPL, LISP,
B V Raju ML, Haskell
Institute and scripting
languages.
Unit I: 13 Lectures
Preliminary Concepts: Reasons for Studying, Concepts of Programming Languages, Programming Domains,
Language Evaluation Criteria, Influences on Language Design, Language Categories, Programming Paradigms,
Imperative, Object Oriented, Functional Programming, logic programming. Programming language
implementation, Compilation And Virtual Machines, Programming Environments. And Syntax and Semantics of
programming languages with examples.

Data Types: Introduction, Primitive, Character, User Defined, Array, Associative, Record, Union, Pointer and
Reference Types, Design and Implementation Uses Related to These Types, Enumerated Data Type, Names,
Variable, Concept of Binding, Type Checking, Strong Typing, Type Compatibility, Named Constants, Variable
Initialization, Type Coercion and Equivalence.
Expressions and Statements: Variables, Arithmetic relational and Boolean expressions, Short circuit evaluation
mixed mode assignment, Assignment Statements, Binding Time and Storage Allocation, Constants and
Initialization, Expressions, Statements, Control Structures, Statement Level, Compound Statements, Selection,
Iteration, Unconditional Statements, Guarded commands.

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, Introduction to Data Abstraction, Design Issues,
Language Examples,Object Oriented Programming in SmallTalk, C++, Java, C#, Ada 95
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.
Unit V: 7 Lectures
Functional Programming Languages: Introduction, Fundamentals of FPL, LISP, ML, Haskell, Application of
Functional Programming Languages and Comparison of Functional and Imperative Languages.
Case Study:
1. Identify differences between C, Java, and Python in view of Application/Programs design with Examples
2. Identify differences between Java script, Python and PHP in view of Application/Programs design with
Examples
Outcomes: Upon the successful completion of the course, the student will be:
1. Apply principles of language design towards requirements.
2. Write the formal syntax for a specification.
3. Understand data typing.
4. Understand control structures.
5. Understand the differences between C, Java, and Python with the design of application/Program.
Textbooks:
1. Concepts of Programming Languages Robert .W. Sebesta 8/e, Pearson Education, 2008.
2. Programming Languages Design Concepts, D. A. Watt, Wiley Dreamtech, rp – 2007.
References:
1. Programming languages, 2nd Edition A. B. Tucker, R E Noonan, TMH
2. Programming Languages, K C Louden, 2nd Edition, Thomson, 2003.
3. LISP Patric Henry Winston and Paul Horn Pearson Education.
4. Programming in PROLOG W F Clocksin& C S Mellish, 5th Edition, Sprin
Web referred:
1. https://nptel.ac.in/content/syllabus_pdf/106102067.pdf
2. http://www.uceou.edu/Dean/DEAN%20OU%20CBCS%20III%20&%20IV%20SEM%20%20Syllabus%202017-
18/24%20Aug%20III%20&%20IVSem%20CSE%202017-18.pdf
3. https://www.iith.ac.in/~ramakrishna/Popl2-Jan20/
4. https://www.coursera.org/learn/programming-languages#syllabus
MOBILE APPLICATION DEVELOPMENT

CODE: A45H7 3 - - 3
Objectives:
1. Learn the working methodology of wireless transmission.
2. Understand how Android applications work, their life cycle, manifest, Intents, and using external
resources.
3. Design and develop useful Android applications with compelling user interfaces by using, extending, and
creating your own layouts and Views and using Menus.
4. Explain the differences between Android and other mobile development environments.
5. Build Android apps.
Unit I: 9 Lectures
Mobile Communications - Overview: Wireless transmission, voice and data communication standards –
1G/2G/3G/4G, WLAN, applications, limitations, mobile computing architecture, overview on mobile devices and
systems. Power over Ethernet GSM: services, system architecture, radio interface, localization, call handling,
handover, security, GPRS
Unit II: 9 Lectures

Introduction to Android- Overview of Android, Android Architecture, Exploring the designer,Adding
Components, Applying behaviors,Android- SDK , Android Emulation
Android Activities and GUI Design Concepts – Enabling buttons, Reading Text Input, Inserting images,
painting canvas, picking list items, checking boxes, storing data, implicit intents and Explicit intents, Activity,
Activity Lifecycle and Manifest , Android XML Parsing using SAX Parser.

Controlling Progress- Composing Programs, Defining variables, performing operations, branching flow,
providing alternatives, Notifying messages, Looping Concepts.
Advanced UI Programming- Input Controls, Alerts and Pickers, using an option with Menu and Radio buttons,
using the App bar and Tabs for Navigation, Drawables, Styles and themes, Material Design: Lists, Cards and
Colors.
Unit IV: 9 Lectures

Working in the background- Background tasks- create an AsyncTask, AsyncTask's generic types, connect to
the AsyncTask and AsyncTaskLoader, Broadcast receivers, Triggering, Scheduling and Optimizing Background
Tasks.
Unit V: 9 Lectures
Toast, Menu, Dialog, List and Adapter-Menu : Option Menu, Context Menu, Popup Menu, Create and Use
Handset menu Button (Hardware), Dialog : Creating and Altering Dialogs, Basic operation of SQLite Database,
Android Application Priorities.
Outcomes: B V Raju Institute of Technology/ B Tech IT

1. Demonstrate knowledge of different voice and data communication standards.
2. Demonstrate Android activities life cycle
3. Execute operations on GUI objects
4. Perform event driven programming
5. Apply various techniques on working with the menu.
6. Develop a basic android application.
Textbooks:
1. Mobile Computing, Raj Kamal, Oxford press, Second Edition
2. Building Android Apps, IN EASY STEPS, McGraw-Hill Education.
3. Android Developer Fundamental Course, Practical Workbook, developed by Google Developer Training
Team.
GRAPH THEORY
CODE: A45H8 3 - - 3
Pre-requisites:
Elementary Number Theory, Set Operations in Mathematics and Knowledge of Programming

(functions, loops, recursion) and Mathematical Foundations of Computer Science
Course Objectives: The Students will learn the following:
1. To demonstrate basic concepts in graph theory.
2. To evaluate precise mathematical definitions of objects in graph theory.
3. To determine and solve some real-time problems using concepts of graph theory.
4. To compile and deduce properties of chromatic numbers and polynomials and identify certain
problems as graph coloring problems.
5. To build classical graph algorithms to find subgraphs with desirable properties.
Unit I: 09 Lectures
Basic Concepts: Graphs and digraphs, incidence and adjacency matrices, isomorphism, the
automorphism group, Trees- Equivalent definitions of trees and forests, Cayley's formula, the Matrix-
Tree theorem.
Connectivity: Cut vertices, cut edges, bonds, the cycle space and the bond space, blocks, Menger's
theorem, Paths and Cycles: Euler tours, Hamilton paths and cycles, theorems of Dirac, Ore, Bondy
and Chvatal, circumference, the Chinese Postman Problem, the Traveling Salesman problem,
diameter and maximum degree.
Matching: Berge's Theorem, perfect matching, Hall's theorem, Tutte's theorem, Konig's theorem,
Petersen's theorem, algorithms for matching and weighted matching (in both bipartite and general
graphs), factors of graphs (decompositions of the complete graph), Tutte's f-factor theorem, External
problems: Independent sets and covering numbers, Turan's theorem, Ramsey theorems.
Coloring: Brooks’s theorem, the greedy algorithm, the Welsh-Powell bound, critical graphs, chromatic
polynomials, girth and chromatic number, Vizing's theorem, Graphs on surfaces: Planar graphs,
duality, Euler's formula, Kuratowski's theorem, toroidal graphs, 2-cell embeddings, and graphs on
other surfaces.
Unit V: 10 Lectures
Directed graphs: Tournaments, directed paths and cycles, connectivity and strongly connected
digraphs, Networks and flows Flow cuts, max flow min cut theorem, Selected topics: Dominating sets,
the reconstruction problem.
CO1. Demonstrate basic concepts in graph theory.
CO2. Evaluate precise mathematical definitions of objects in graph theory.
CO3. Determine and solve some real-time problems using concepts of graphs.
CO4. Compile and deduce properties of chromatic numbers and polynomials and identify certain
problems as graph coloring problems.
CO5. Build classical graph algorithms to find subgraphs with desirable properties.
Textbooks:
1. Introduction to Graph Theory, Douglas B. West, Prentice Hall of India
2. Graph Theory with Applications to Engineering and Computer Science, Narsingh Deo, Prentice-
Hall.
References:
1. Graph Theory, Frank Harary, Narosa

2. Network Flows: Theory, Algorithms, and Applications, R.Ahuja, T. Magnanti, and J. Orlin, Prentice-
Hall.

HIGH PERFORMANCE COMPUTING
CODE: A45H9 3 - - 3
Pre- requisites: None
Objectives:
This course aims to make the learners understand the basic principles in AI and robotics technologies
The learners will be able to apply machine learning algorithms for applications using AI and robotics
UNIT I Graphics Processing Units 9 Lectures
Introduction to Heterogeneous Parallel Computing. GPU architecture. Thread hierarchy. GPU Memory Hierarchy.
Introduction and Tutorial of OpenMP with relevant examples; Comparison based sorting: Comparator networks,
Bitonic Sequences, Bitonic Splits, Bitonic Merge, Bitonic Sort.
UNIT II Scans and Listing B V Raju9Institute

Lecturesof Technology/ B Tech IT
Scans and List Ranking, Prefix Sums, Parallel Scans, Segmented Scans, Linked list as array pools, Tree
Computations, Parallel Independent Sets; Euler Tour Technique, Shared Memory Parallel BFS, High Level
Approach to Parallel BFS, Bag splitting.
UNIT III GPU Programming 12 Lectures
Efficiency and 1D algorithm, A 2D Algorithm and its efficiency, Dist. Memory Sorting, Distributed Bitonic Merge
via binary exchange, Bitonic merge via transposes, Linear time distributed sort; Distributed BFS, Graphs and
adjacency Matrix, Matrix based BFS, 1D distributed BFS, Graph partitioning, Graph bisection and planar
separators; Kernighan Lin Algorithm, Graph Coarsening, Computing a maximal matching, Spectral partitioning.
UNIT IV Basic Model of locality-I 10 Lectures
Two level memories, Minimum transfers to sort, Matrix vector multiply, Algorithmic Time, Energy and Power,
Speed Limits, Time Limits, Power Limits, The Dynamic power equation, Power Knobs; Exploiting DVFS,
Algorithmic Dynamic power, Parallelism and DVFS, I/O Avoiding algorithms
UNIT V Basic Model of locality-II 10 Lectures
External Memory Merge sort, Two way external memory Merging, Multiway Merging; Cache oblivious algorithms,
The ideal cache model, LRU replacement, Proof of LRU OPT Competitiveness, The Tall-cache assumption,
Cache oblivious matrix multiplication, cache oblivious binary search.
Course Outcomes: Students can able to
1. Demonstrate the architectural features in the GPU and MIC hardware accelerators.
2. Design, formulate, solve and implement high performance versions of standard single threaded
algorithms
3. Design appropriate searching and sorting techniques for high-performance systems.
4. Analyze the algorithmic design for Work-span models, network models, and deep memory hierarchies.
5. Develop the algorithms and techniques on parallel and distributed systems.
Text Book:
1. Ananth Grama, Anshul Gupta, George Karypis and Vipin Kumar, Introduction to Parallel Computing
(2nd Edition), Pearson, 2004
2. Parallel Computing Theory and Practice by Michael Quinn, 2017 McGrawHill

References:
1. Georg Hager and Gerhard Wellein, Introduction to High Performance Computing for Scientists and
Engineers (1st Edition), CRC Press, Taylor and Francis Group, 2010. ISBN 978-1439811924.
2. Wen-Mei W Hwu, David B Kirk, Programming Massively Parallel Processors A Hands-on Approach,
Morgann Kaufmann, 3e.
3. Rezaur Rahman, Intel Xeon Phi Coprocessor Architecture and Tools, Apress Open, 2013.
4. Barbara Chapman, Gabriele Jost, Ruud van der Pas, Using OpenMP, MIT Press, 2008.
5. Gropp, Lusk, Skjellum, Using MPI, Using MPI, 2014.
6. Recent publications in IPDPS, PACT, and similar.
Online Resources:
1. https://developer.nvidia.com/udacity-cs344-intro-parallel-programming

PATTERN RECOGNITION
CODE: A4581 3 - - 3
Prerequisites: None
Course Objective
To get familiarized with the basics of pattern recognition, learning methods and other related models.
UNIT I: 10 Lectures
Introduction: Machine perception, pattern recognition example, pattern recognition systems, the Design cycle,
learning and adaptation
Bayesian Decision Theory: Introduction, continuous features – two categories classifications, minimum error-
rate classification-zero–one loss function, classifiers, discriminant functions, and decision surfaces
UNIT II: 10 Lectures

Normal density: Univariate and multivariate density, discriminant functions for the normal Density different
cases, Bayes decision theory – discrete features, compound Bayesian decision theory and context
UNIT III: 10 Lectures
Maximum likelihood and Bayesian parameter estimation: Introduction, maximum likelihood Estimation,
Bayesian estimation, Bayesian parameter estimation–Gaussian case
UNIT IV: 10 Lectures

Un-supervised learning and clustering: Introduction, mixture densities and identifiability, maximum likelihood
estimates, application to normal mixtures, K-means clustering. Date description and clustering – similarity
measures, criteria function for clustering
UNIT V: 10 Lectures
Pattern recognition using discrete hidden Markov models: Discrete-time Markov process, Extensions to
hidden Markov models.
Continuous hidden Markov models:
Continuous observation densities, multiple mixtures per state.
Course Outcomes
Students are able to:
1. Understand basic principles of Pattern recognition
2. Understand Normal density.
3. Understand Maximum likelihood and Bayesian parameter estimation.
4. Analyze un-supervised learning and clustering for Pattern recognition.
5. Learn and analyze Pattern recognition using discrete hidden Markov models for pattern recognition.
TEXT BOOKS:
1. Pattern classifications, Richard O. Duda, Peter E. Hart, David G. Stroke. Wiley student edition, Second
Edition.
2. Pattern Recognition, An Introduction, V Susheela Devi, M Narsimha Murthy, University Press
REFERENCE BOOKS:
1. R.C Gonzalez and R.E. Woods, “Digital Image Processing”, Addison Wesley, 1992.
2. Pattern Recognition and Image Analysis – Earl Gose, Richard John baugh, Steve Jost PHI 2004
3. Fundamentals of speech Recognition, Lawerence Rabiner, Biing – Hwang Juang Pearson education.
4. Pattern Recognition, Sergios Theodoridis, Konstantinos Koutroumbas, Academic Press, Elsevier, 4ed.
CLOUD COMPUTING
CODE: A45EB 3 - - 3
Pre-requisites:
A course on “Computer Networks”
A course on “Operating Systems”
A course on “Distributed Systems”
Course Objectives:
This course provides an insight into cloud computing
1. Topics covered include- distributed system models, different cloud service models, service-
2. oriented architectures, cloud programming and software environments, resource management.
3. Course Outcomes:
4. Ability to understand various service delivery models of a cloud computing architecture.
5. Ability to understand the ways in which the cloud can be programmed and deployed.
6. Understanding cloud service providers.
UNIT - I 10 Lectures
Computing Paradigms: High-Performance Computing, Parallel Computing, Distributed Computing, Cluster

Computing, Grid Computing, Cloud Computing, Bio computing, Mobile Computing, Quantum Computing, Optical
Computing, Nano computing.
UNIT - II 10 Lectures
Cloud Computing Fundamentals: Motivation for Cloud Computing, The Need for Cloud Computing, Defining
Cloud Computing, Definition of Cloud computing, Cloud Computing Is a B V Raju Cloud
Service, Institute of Technology/
Computing B Tech IT
Is a Platform,
Principles of Cloud computing, Five Essential Characteristics, Four Cloud Deployment Models
UNIT - III 10 Lectures
Cloud Computing Architecture and Management: Cloud architecture, Layer, Anatomy of the Cloud, Network
Connectivity in Cloud Computing, Applications, Managing the Cloud Infrastructure, Managing the Cloud
application, Migrating Application to Cloud, Phases of Cloud Migration Approaches for Cloud Migration.
UNIT - IV 10 Lectures
Cloud Service Models: Infrastructure as a Service, Characteristics of IaaS. Suitability of IaaS, Pros and Cons of
IaaS, Summary of IaaS Providers, Platform as a Service, Characteristics of PaaS, Suitability of PaaS, Pros and
Cons of PaaS, Summary of PaaS Providers, Software as a Service, Characteristics of SaaS, Suitability of SaaS,
Pros and Cons of SaaS, Summary of SaaS Providers, Other Cloud Service Models.
UNIT V 15 Lectures
Cloud Service Providers: Google App Engine, Google Cloud Connect, Amazon Web Services, Amazon Elastic
Compute Cloud, Amazon Simple Storage Service, Amazon Simple Queue ,service, Microsoft Azure, Rack space,
VMware, Manjra soft, Aneka Platform
TEXT BOOK:
1. Essentials of cloud Computing: K. Chandrasekhran, CRC press, 2018
REFERENCE BOOKS:
1. Cloud Computing: Principles and Paradigms by Rajkumar Buyya, James Broberg and Andrzej M. Goscinski,
Wiley, 2018.
2. Distributed and Cloud Computing, Kai Hwang, Geoffery C. Fox, Jack J. Dongarra, Elsevier, 2014.
3. Cloud Security and Privacy: An Enterprise Perspective on Risks and Compliance, Tim Mather, Subra
Kumaraswamy, Shahed Latif, O’Reilly, SPD, rp 2011.
FUNDAMENTALS OF DESIGN THINKING
CODE: A45CA 3 - - 3
Prerequisite: Nil
Course Objectives:
1. To classify the different phases of design thinking
2. To study the different approaches for design thinking
3. To get familiarize with resources of design thinking
4. To study the themes of design thinking
5. To know the techniques for implementation of design thinking
6. To summarize the applications of design thinking
UNIT
Introduction: Design Thinking-Definition, Need of Design Thinking, Variety within the Design Thinking Discipline,
phases of Design Thinking, Design Thinking Mindset Tools for Design Thinking, Relevance of Design and Design
Thinking in Engineering.
UNIT – II
Approach for Design Thinking: Fundamental Concepts - Empathy, Ethnography, Divergent Thinking,
Convergent Thinking, Visual Thinking, Assumption Thinking, Prototyping,Blearning
V Raju Institute of Technology/ B Tech IT
and validation
UNIT – III
Design Thinking Resources and Processes: Resources - People, Place, Materials, Organizational Fit.
Processes - Numerous Approaches, Double Diamond Process, 5 Stage d.school Process, Designing for growth
process
Idea Generation: Basic design direction-Themes of thinking-Brainstorming- value addition-sketching-presenting
ideas
UNIT – IV
Implementation of Design Thinking: Format selection – Material selection – finishing – techniques for finishing-
classification; advanced technology for marketing – scale-continuity.
UNIT – V
Application of Design Thinking: Design Thinking in Various Sectors -Health Care, Finance, Education,
Infrastructure, Information Technology, Manufacturing; Design thinking case studies in engineering and
management.
Course Outcomes: At the end of the course students will be able to

1. Understand the different phases of design thinking
2. Implement the design thinking using different approaches
3. Exemplify the importance of resources for design thinking
4. Evaluate the different themes of design thinking
5. Apply the techniques for design thinking
6. Practice design thinking for engineering and management
Text Books:
1. Change by Design: How Thinking Transforms Organizations and Inspires Innovation/ Tim Brown/ 1st
Edition/Harper Collins/ 2009
2. Design thinking for Strategic innovation/Idris Moote/Wiley/2013
Reference Books:
1. Design Thinking/Gavin Ambrose and Paul Harris/AVA Publishing/2010
2. Design Thinking / Christoph Meinel and Larry Leifer /Springer / 2011
3. This is Service Design Thinking / Marc stickdorn and Jacob Schneider / Wiely, 2011
BUSINESS ECONOMICS AND FINANCIAL ANALYSIS

CODE: A45PA 3 - - 3
Course Objectives:
The course should enable the students to:
1. Understand the financial statements and be able to analyze the financial statements.
2. Make the engineers familiar with the concepts of economics in business decisions, understand the
techniques of capital budgeting.
3. Analyze demand and Production for price determination.
UNIT-1 Lectures 10
Accounting for Engineers: Principles of Accounting, Final Accounts – Structure of Profit and Loss Account -
Balance Sheet (Simple problems, No adjustments), Financial ratios – Importance and limitations of ratio analysis,
Computation, Analysis and Interpretation of : Liquidity Ratios, Activity Ratios (Inventory Turnover ratio and
Debtors Turnover ratio), Capital structure Ratios and Profitability ratios (Gross Profit Ratio, Net Profit Ratio &
Operating Ratio) (simple problems).
UNIT-II Lectures 9
Capital Budgeting: Nature and scope of capital budgeting, Methods of Capital Budgeting: Payback Method,
Accounting Rate of Return (ARR) and Net Present Value Method (simple problems).
UNIT-III Lectures 10
Introduction to Business Economics: Business economics meaning, Scope and objectives of Business
B V Raju
economics, Nature and types of business decisions, Role and responsibilities Instituteeconomist.
of business of Technology/ B Tech IT
UNIT-IV Lectures 9
Introduction & Demand Analysis: Demand Analysis: Demand Determinants, Law of Demand and its
exceptions. Elasticity of Demand- Definition, Types, Measurement and Significance of Elasticity of Demand.
Demand Forecasting: methods of demand forecasting (survey methods, statistical methods, expert opinion
method, test marketing, controlled experiments, judgmental approach)
UNIT-V Lectures 10
Introduction to Production, Cost and Pricing: Production Function - Isoquants and Isocosts, MRTS, Least
Cost Combination of Inputs, Laws of Returns, Internal and External Economies of Scale.Cost concepts. Pricing
objectives- Methods of Pricing - 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.
Course Outcomes:
At the end of this course, students will be able to
1. Understand the Accounting for Engineers
2. Analyse the Projects through Capital Budgeting Methods
3. Understand the Business Economics
4. Analyse the Demand through methods of Demand Forecasting
5. Evaluate Production and Pricing methods
Text Books:
1. Domnick Salvatore: Managerial Economics In a Global Economy, 4th Edition, Thomson
2. Aryasri: Managerial Economics and Financial Analysis, 2/e, TMH, 2005.
Reference Books:
1. Deepashree: General Economics, Tata Mcgrawhill
2. HL Ahuja Business Economics, S.Chand
3. S.N.Maheswari and S.K. Maheswari, Financial Accounting, Vikas Publications
COMPUTER NETWORKS AND OPERATING SYSTEMS LAB

CODE:A451H - - 3 1.5
Pre-Requisites:
Programming for Problem Solving and Computer Networks
Objectives:
1. To understand the functionalities of various layers of OSI model.
2. To understand the operating system functionalities.
System/Software Requirement
• Intel based desktop PCs LAN CONNECTED with minimum of 166 MHZ or faster processor with at least 64 MB
RAM and 100 MB free disk space.
Computer Networks Lab:

1. Implement the data link farming methods such as character, character stuffing and bit stuffing.
2. Implement on a data set of characters the three CRC polynomials CRC 12, CRC 16 and CRC CCIP.
3. Implement Dijkstra’s algorithm to compute the shortest path through a graph.
4. Take an example subnet graph with weights indicating delay between nodes. Now obtain Routing table art
each node using distance vector routing algorithm.
5. Take a 64 bit playing text and encrypt the same using DES algorithm.
6. Using RSA algorithm encrypt a text data and Decrypt the same.
Outcomes:
• Ability to understand the encryption and decryption concepts in Linux environment.
• Ability to apply appropriate algorithm for the finding of shortest route.
• Ability to configure the routing table.
OPERATING SYSTEMS LAB
Objectives
• To use Linux operating system for study of operating system concepts.
• To write the code to implement and modify various concepts in operating systems using Linux.
1. Simulate the following CPU scheduling algorithms.

A) Round Robin b) SJF c) FCFS d) Priority
2. Simulate all file allocation strategies
a) Sequential b) Indexed c) Linked
3. Stimulate bankers algorithm for deadlock avoidance
4. Stimulate bankers algorithm for deadlock prevention
5. Stimulate all page replacement algorithms
a) FIFO b) LRU c) LFU etc…
6. Stimulate paging techniques of memory management
Course Outcomes:
1. The course objective ensures the development of students applied skills in operating systems related areas.
2. Students will gain knowledge in writing software routines, modules for implementing various concepts of
operating systems
IoT AND COMPUTER ALGORITHMS LAB
CODE:A452H - - 3 1.5
Pre- requisites:
1. Programming for problem solving

Objectives:
1. Implement the sorting techniques for given problems.

2. Make use of different algorithms to find shortest route.
3. To Design and analyze small signal amplifier circuits.
WEEK-1: Implement All-Pairs Shortest Paths Problem using Floyd's algorithm.
WEEK-2: Find Minimum Cost Spanning Tree of a given undirected graph using a) Kruskal's
algorithm b) Prims algorithm.
WEEK-3: Implement 0/1 Knapsack problem using Dynamic Programming.

WEEK-4: Sum of Subsets Problem: Find a subset of a given set S = {s1,s2,.....,sn} of n positive
integers whose sum is equal to a given positive integer d. For example, if S= {1, 2, 5, 6, 8} and d = 9
there are two solutions {1,2,6} and {1,8}.A suitable message is to be displayed if the given problem
instance doesn't have a solution.
WEEK-5: Implement N Queen's problem using Back Tracking.
WEEK-6: Understanding Arduino UNO Board and Components.
WEEK-7: Installing and work with Arduino IDE
WEEK-8: Blinking LED sketch with Arduino
WEEK-9: Simulation of 4-Way Traffic Light with Arduino
WEEK-10: a) Using Pulse Width Modulation
b) LED Fade Sketch and Button Sketch
WEEK-11: Working with Adafruit Libraries in Arduino
WEEK-12: Interfacing Arduino with Cloud (Thingspeak API)
Course Outcomes: Students can able to,
CO1: Implement the applications of divide and conquer, and greedy method of algorithms design
CO2: Implementation of algorithms using backtracking.

CO3: Understand UNO boards and Components
CO4: Implement Adafruit libraries in arduino
CO5: Create an interface between Arduino and Cloud.

AUTOMATA AND COMPILER DESIGN
III Year B.Tech. IT II Sem L T P C
CODE:A46HA 2 1 - 3
Pre-requisites:
1. Basic knowledge of formal languages, regular expressions and regular sets.
2. Basic idea of compilers.
Objectives:
1. Identify the definitions of Formal language of finite automata techniques.
2. Interpret concepts of regular sets and decision algorithms for context free grammars.
3. Design of the Push Down Automata and its equivalence.
4. To understand and list the different stages in the process of compilation.
5. Design top-down and bottom-up parsers
6. Develop algorithms to generate code for a target machine
UNIT-I: 12 Lectures
Finite Automata and Regular Expressions:
Alphabet, Strings Language, Operations, Finite State Machine, Deterministic Finite Automata (DFA) -Formal
definition, simpler notations (state transition diagram, transition table), language of a DFA. Nondeterministic
Finite Automata (NFA)- Definition of NFA, language of an NFA, Equivalence of Deterministic and
Nondeterministic Finite Automata, NFA to DFA Conversion, Applications of Finite Automata.
REGULAR EXPRESSIONS (RE): Regular sets, regular expressions, identity rules, manipulation of regular
expressions, equivalence between RE and FA.
UNIT-II: 10 Lectures
Regular Grammars and Pushdown Automata
Introduction to Grammar, Regular grammars- right linear and left linear grammars, Equivalence between
regular linear grammar and FA, inter conversion between RE and RG. Context free Grammars, Derivation
trees, Sentential forms, Left Most and Right Most Derivations of Strings.
PUSHDOWN AUTOMATA(PDA): Introduction to Push down Automata, design of Push down Automata,
Context Free Grammar, Derivations, Parsing, and Ambiguous Grammar.
UNIT-III: 10 Lectures
Complier Design: Introduction to Complier Design, phases of Complier, Application of Finite Automata to
Lexical Analysis, LEX tools ,
Top Down Parsing: Recursive-Descent parsing, Non- recursive predictive parsing; LL(1) grammars
UNIT-IV: 10 Lectures
Bottom Up Parsing: Bottom up parsing: handle pruning LR Grammar Parsing, LALR parsing, parsing
ambiguous grammars, and YACC programming specification.
Context Sensitive Features: Type checking, type conversions, equivalence of type expressions,
overloading of functions and operations.
UNIT-V: 10 Lectures
Run Time Storage , Code Optimization, Code Generation: Storage organization, storage allocation
strategies scope access to now local names, parameters, language facilities for dynamics storage
allocation, Principal sources of optimization, optimization of basic blocks, peephole optimization, flow
graphs, Data flow analysis of flow graphs, Machine dependent code generation, object code forms,
generic code generation algorithm, Register allocation and assignment. Using DAG representation of
Block.
Outcomes:
Students are able to
1. Design an abstract machine (Finite Automata, Push Down Automata)
2. Determine a grammar for given languages.
3. Adapt compiler construction tools and the functionality of each stage of the compilation process.
4. Apply different methods of lexical analysis in design of top-down parser
5. Determine a given parser for bottom up parsing
6. Describe the techniques for run time storage, code optimization and code generation
TEXT BOOKS:
1. Introduction to Automata Theory, Languages and Computation, Hopcroft, Motwani, and Ullman,
Pearson Publishers, Third Edition, 2006.
2. Compilers Principles, Techniques and Tools Aho, Ullman, Ravisethy, Pearson Education.
3. Introduction to Automata and Compiler Design DasaradhRamaiah K, PHI , 2011
4. Lex &Yacc – John R. Levine, Tony Mason, Doug Brown, O’reilly
5. Introduction to Theory of computation.Sipser, 2nd Edition, Thomson.
6. Formal Languages and Automata Theory, K.V.N. Sunitha, N.Kalyani Pearson India, 2015.
REFERENCES:
1. Modern Compiler Construction in C, Andrew W.Appel Cambridge University Press.

2. Compiler Construction, LOUDEN, -Cengage Learning
3. Elements of Compiler Design, A.Meduna, Auerbach Publications, Taylor and Francis Group.
4. Engineering Compiler, K.D.Cooper, L.TorcZon, ELSEVIER
5. Introduction to Formal Languages and Automata Theory and Computation-Kamala Krithivasan and
Rama R, Pearson.
6. Modern Compiler design, D.Grune and others, Wiley-India.
7. Automata and Languages, A.Meduna, Spinger.
Web References:
1. http://nptel.iitm.ac.in
2. https://www.tutorialspoint.com/compiler_design/compiler_design_finite_automata.htm
3. http://www.cse.chalmers.se/edu/
4. Compiler Design Tutorials - GeeksforGeeks
OPEN SOURCE WEB DEVELOPMENT

CODE:A46H1 3 - - 3
Pre-requisites:
1. Object oriented programming through Java.
Objectives:
1. To develop client side scripting with javascript

2. To impart servlet technology for writing business logic
3. To develop PHP programs for server side scripting.
4. To understand AJAX ,struts framework and Hibernate framework
Unit-I: 12 Lectures
HTML: Iframes
Client side Scripting: Introduction to javascript, declaring variables, scope of variables, functions, event handlers
(keyboard & mouse), CSS Fundamentals, Bootstrap- Responsive grid system, Bootstrap's style standards,
Responsive CSS, AngularJS-Overview, Directives, Expressions,Tables,AngularJS Modules and Forms.
XML: Introduction to XML, Defining XML tags, attributes and values, XML Schemas, Parsing XML Data- DOM
and SAX Parsers in java.
Unit-II:
12 Lectures
Introduction to Servlets: Lifecycle of a servlet, deploying a servlet, The Servlet API, Reading servlet parameters,
Reading initialization parameters, Handling Http Request & Responses, Using Cookies and Sessions,
connecting to a database using JDBC.
Unit-III:: 12 Lectures
Introduction to JSP: The Anatomy of a JSP Page, JSP processing, Declarations, Directives, Expressions, Code
Snippets, implicit objects, Using Cookies and sessions for session tracking, connecting to databases in JSP.
Unit-IV: 12 Lectures
Introduction to PHP: Declaring variables, data types, arrays, strings, operators, expressions, control structures,
functions, Reading data from web form controls like text boxes, radio buttons, lists etc., Handling File Uploads,
File Handling in PHP:file operations like opening, closing, reading, writing, appending, deleting etc. on text and
binary files, listing directories.
Unit-V: 10 Lectures
Connections to database (MYSQL as reference), executing simple queries, handling results, Handling sessions
and cookies.
Simple AJAX application, Introduction to struts framework and Hibernate framework.
Outcomes:
Students are able to
1. Design and Develop client side scripting using HTML, Java script
2. Develop Server side programming with Java- Servlets
3. Develop Server side programming with Java -JSP
4. Demonstrate and develop server side scripting with PHP language
5. Understand AJAX, struts framework and Hibernate framework.
Text Books:
Web Technologies, Uttam K Roy, Oxford University Press, 3rd edition, 2018.
The Complete Reference PHP-Steven Holzner, Tata McGraw-Hill, 3rd edition, 2019.
AngularJS, S. Brad Green and Shyam Seshadri,O'REILLY, Greyscale edition, 2018.
References:
1. Web programming, building internet applications, Chris Bates 2nd edition, Wiley Dreamtech,2018.
2. Java server Pages-Hans Bergsten, SPD O’Reilly,3rd edition,2019.
3. Java Script, D.Flanagan, O’Reilly, SPD., 2nd edition,2018.
4. Beginning Web Programming-Jon Duckett WROX,3rd edition, 2018.
5. Programming World Wide Web, R.W.Sebesta, Fourth edition, Pearson,2019.
6. Internet and World Wide Web-How to program, Dietel and Nieto, Pearson, 3rd edition,2019.
web References:
1. https://www.tutorialspoint.com/html_web_development/index.asp
2. https://www.javatpoint.com/php-tutorial
3. https://www.w3schools.in/jsp/intro/
4. https://www.w3schools.com/angular/
DATA ANALYTICS USING R
CODE:A46H2 3 - - 3
Prerequisites:
Statistics
Data Structures and Algorithms
Data Mining
Course Objectives:
To help students learn, understand, and practice data analytics and machine learning approaches.
1. Understand big data challenges in different domains including social media, transportation,
finance and medicine.
2. Understand the capability and the functionality of No-SQL systems
3. Optimize business decisions and create competitive advantage with Big Data analytics.
4. Imparting the architectural concepts of Hadoop and introducing map reduce paradigm.
Unit I: SQL using R & Correlation and Regression Analysis (NOS 2101)
Introduction to NoSQL, Connecting R to NoSQL databases, Excel and R integration with R connector,
Regression Analysis, Assumptions of OLS Regression, Regression Modelling, Correlation, Forecasting,
Autocorrelation, Introduction to Multiple Regression etc.
Unit II: Understand the Verticals - Engineering, Financial and others (NOS 2101)
Understanding systems viz. Engineering Design, Manufacturing, Smart Utilities, Technology etc.,
Understanding Business problems related to various businesses, Production lines, Automotive.
Unit III: Manage your work to meet requirements (NOS 9001) & Work effectively with
Colleagues (NOS 9002):
Understanding Learning objectives, Introduction to work & meeting requirements, Time Management, Work
management & prioritization, Quality & Standards Adherence. Introduction to work effectively, Team Work,
Professionalism, Effective Communication skills, etc.
Unit IV: Data Management & Introduction to Big Data Tools (NOS 2101)
Design Data Architecture and manage the data for analysis, Fundamentals of MapReduce, Export all the data
onto Cloud ex. AWS/Rackspace etc. Introduction to Big Data tools like Hadoop, Spark, Impala etc., Data ETL
process.
Unit V: Big Data Analytics & Machine Learning Algorithms (NOS 2101)
Run descriptive to understand the nature of the available data, collate all the data sources to suffice business
requirement, run descriptive statistics for all the variables and observe the data ranges, Outlier detection and
elimination, Hypothesis testing and determining the multiple analytical methodologies, Train Model on 2/3
sample data using various Statistical/Machine learning algorithms, Test model on 1/3 sample for prediction etc.
Outcomes:
1. Ability to identify the characteristics of datasets and compare the trivial data and big data for various
applications.
2. Ability to select and implement machine learning techniques and computing environment that are suitable for
the applications under consideration.
3. Ability to solve problems associated with batch learning and online learning, and the big data characteristics
such as high dimensionality, dynamically growing data and in particular scalability issues.
4. Ability to understand and apply scaling up machine learning techniques and associated computing
techniques and technologies.
5. Ability to recognize and implement various ways of selecting suitable model parameters for different machine
learning techniques.
Text Books:
1. Taming The Big Data Tidal Wave: Finding Opportunities in Huge Data Streams with
Advanced Analytics, Bill Franks, Thomas H. Davenport, 2020.
2. Dalgaard, Peter, “Introductory statistics with R”, Springer Science & Business Media, 2018.
References:
1. Richard Cotton, “Learning R”, O’Reilly, 2017.
2. Brain S. Everitt, “A Handbook of Statistical Analysis Using R”, Second Edition, LLC, 2015.
3. T. Hastie, R. Tibshirani and J. Friedman, “Elements of Statistical Learning”, Springer,
2017
SOFTWARE TESTING
CODE:A46H4 3 - - 3
Pre-requisites:
Software Engineering
OBJECTIVES
1. To study fundamental concepts in software testing, including software testing objectives, process, criteria,
strategies, and methods.
2. To discuss various software testing issues and solutions in software unit test; integration, regression, and
system testing.
3. To learn how to planning a test project, design test cases and data, conduct testing operations, manage
software problems and defects, and generate a testing report.
4.To gain software testing experience by applying software testing knowledge and methods to practice-oriented
software testing projects.
5. To learn how to write software testing documents, and communicate with engineers in various forms.
6. To gain the techniques and skills on how to use modern software testing tools to support software testing
projects.
UNIT I: 8 Lectures
Introduction: Purpose of testing, Dichotomies, model for testing, consequences of bugs, taxonomy of bugs
Flow graphs and Path testing:Basics concepts of path testing, predicates, path predicates and achievable
paths, path sensitizing, path instrumentation, application of path testing.
UNIT II: 8 Lectures

Transaction Flow Testing: Transaction flows, transaction flow testing techniques. Dataflow testing:- Basics of
dataflow testing, strategies in dataflow testing, application of dataflow testing.
Dataflow testing: Basics of dataflow testing, strategies in dataflow testing, application of dataflow testing.

Domain Testing: domains and paths, Nice & ugly domains, domain testing, domain testing, domains and
interfaces testing, domain and interface testing, domains and testability.
Paths, Path products and Regular expressions: Path products & path expression, reduction procedure,
applications, regular expressions & flow anomaly detection.
UNIT IV: 8 Lectures

Logic Based Testing: Overview, decision tables, path expressions, kv charts, specifications.
State, State Graphs and Transition testing: State graphs, good & bad state graphs, state testing, Testability tips.
Graph Matrices and Application: Motivational overview, matrix of graph, relations, power of a matrix, node
reduction algorithm, building tools.
UNIT V: 7 Lectures
JMeter and Winrunner:Usage of JMeter and Winrunner tools for functional / Regression testing, use of
Selenium tool for web testing, creation of test script for unattended testing, synchronization of test case, Rapid
testing, Performance testing of a data base application and HTTP connection for website access.
OUTCOMES
By the end of the course, the student should:
1. Have an ability to apply software testing knowledge and engineering methods.

2. Have an ability to design and conduct a software test process for a software testing project.
3. Have an ability to identify the needs of software test automation,
4. Have an ability to identify and define and develop a test tool to support test automation.
5. Have an ability understand and identify various software testing problems.
6. To solve problems by designing and selecting software test models, criteria, strategies, and methods.
TEXT BOOKS:
1. Software Testing Techniques – BarisBeizer, Dreamtech, second edition.
2. Software Testing Tools – Dr.K.V.K.K.Prasad, Dreamtech.
REFERENCES:
1. The craft of software testing - Brian Marick, Pearson Education.

2. Software Testing Techniques – SPD(Oreille)
3. Software Testing in the Real World – Edward Kit, Pearson.
4. Effective methods of Software Testing, Perry, John Wiley.
5. Art of Software Testing – Meyers, John Wiley
6. Software Testing, S.Desikan, G.Ramesh, Pearson.
7. Foundations of Software Testing, D.Graham& other, Cengage Learning.
8. Foundations of Software Testing, A.P.Mathur, Pearson.
CRYPTOGRAPHY NETWORK SECURITY
CODE:A6H5 3 - - 3
Pre-requisite: Computer Networks
Objectives
1. To acquire an understanding of network security and its changing character.

2. To understand how public key cryptography algorithms are conceptualized and carried out.
3. To examine Hash Functions and Digital Signatures and cryptography techniques.
4. To articulate informed opinion about issues related to network IP security and Web Security.
5. To identify and investigate web security requirements and the concepts of SNMP and design principles of
firewall.
UNIT —I 10 Lectures
Security Attacks, Security Services and Mechanisms, A model for Internetwork security.
Conventional Encryption: Principles, Conventional encryption algorithms, Data Encryption Standard-Block
cipher principles-block cipher modes of Operation-Advanced Encryption Standard (AES)-Triple DES-Blowfish-
RC5 algorithm
UNIT –II 11 Lectures

Public Key Cryptography: principles, public key cryptography algorithms, digital signatures, digital
Certificates,Certificate Authority and key management Kerberos, X.509 Directory Authentication Service. Email
Privacy: Pretty Good Privacy (PGP) and S/MIME.
HASH FUNCTIONS AND DIGITAL SIGNATURES Authentication requirement – Authentication function – MAC
– Hash function – Security of hash function and MAC–MD5 - SHA - HMAC – CMAC - Digital signature and
authentication protocols – DSS – EI Gamal – Schnorr.
UNIT –IV 10 Lectures

IP Security: Overview, IP Security Architecture, Authentication Header, Encapsulating Security Payload,
Combining Security Associations and Key Management.
Web Security Requirements: Secure Socket Layer (SSL) and Transport Layer Security (TLS), Secure
Electronic Transaction (SET).
UNIT -V: 10 Lectures

Basic Concepts of SNMP: SNMPv1 Community facility and SNMPv3, Intruders, Viruses and related threats.
Firewall: Design principles, Trusted Systems, Intrusion Detection Systems.
Course Outcomes
1. Acquire an understanding of network security and various attacks.
2. Understand conventional Public Key Cryptography and various public key encryption algorithms.
3. Analyze the Hash Functions and Digital Signatures used
4. Identify and investigate IP Security and web security requirements.
5. Understand the concepts of SNMP and design principles of firewall. B V Raju Institute of Technology/ B Tech IT
TEXT BOOKS
1. Network Security Essentials (Applications and Standards) by William Stallings Pearson Education.
2. Hack Proofing your network by Ryan Russell, Dan Kaminsky, Rain Forest Puppy, Joe Grand, David Ahmad,
Hal Flynn Ido Dubrawsky, Steve W.Manzuik and Ryan Permeh, wiley Dreamtech
REFERENCE BOOKS
1. Fundamentals of Network Security by Eric Maiwald (Dreamtech press)
2. Network Security – Private Communication in a Public World by Charlie Kaufman, Radia Penman and
Mike Speciner, Pearson/PHI.
3. Cryptography and network Security, Third Edition, Stallings, PHI/Pearson
4. Principles of Information Security, Whitman, Thomson.
5. Network Security: The complete reference, Robert Bragg, Mark Rhodes, TMH
6. Introduction to Cryptography, Buchmann, Springer.
7. Network Security and Cryptography: Bernard Menezes, CENGAGE Learning.
8. Information Systems Security,Godbole,Wiley Student Edition.
9. Cryptography and network Security, B.A.Forouzan, D.Mukhopadhyay, 2nd Edition,TMH.
DESIGN PATTERNS
CODE:A46H6 3 - - 3
Pre-requisites:
1. Object Oriented Analysis and Design.
2. Data structures and algorithms.
3. Programming Language (C++ or Java)
Objectives:
1 Demonstration of patterns related to object oriented design.

2 Describe the design patterns that are common in software applications.
3 Analyze a software development problem and express it.
4 Design a module structure to solve a problem, and evaluate alternatives.
5 Implement a module so that it executes efficiently and correctly.
Unit I: 10 Lectures
What is a Design Pattern?, Design Patterns in Smalltalk MVC, Describing Design Patterns, The Catalogue
of Design Patterns, Organizing The Cato log, How Design Patterns solve Design Problems, How to Select a
Design pattern, How to Use a Design Pattern.

Creational Patterns: Abstract Factory, Builder, Factory Method, Prototype, Singleton, Discussion of
Creational Patterns.

Structural Pattern Part-I, Adapter, Bridge, Composite.
Structural Pattern Part-II, Decorator, Facade, Flyweight, Proxy.

Behavioral Patterns Part: I, Chain of Responsibility, Command, Interpreter, Iterator. Behavioral Patterns
Part: II, Mediator, Memento, Observer, Discussion of Behavioral Patterns.
Unit V: 11 Lectures
Behavioral Patterns Part: III, State, Strategy, Template Method, Visitor, Discussion of Behavioral Patterns.
What to Expect from Design Patterns.
Course Outcomes:
1. Construct a design consisting of a collection of modules.

2. Exploit well-known design patterns (such as Iterator, Observer, Factory and Visitor).
3. Distinguish between different categories of design patterns.
4. Ability to understand and apply common design patterns to incremental/iterative development.
5. Ability to identify appropriate patterns for design of given Problem.
6. Design the software using Pattern Oriented Architectures.
Text Books:
1. Design Patterns By Erich Gamma, Pearson Education
Reference Books:
1. Patterns in JAVA Vol-I (or) Vol-II By Mark Grand, Wiley Dream Tech
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-spd
Web References:
1. https://www.tutorialspoint.com/index.htm
ADVANCED COMPILER DESIGN
CODE:A46H7 B V Raju Institute

3 - - of3Technology/ B Tech IT
Prerequisites
1. A course on “ Advanced Computer architecture”
2. A course on “Computer Programming and Data Structures”
3. A course on “Automata complier Design.
Course Objectives:
1. Introduce the major concepts of language translation and compiler design and impart the knowledge of
practical skills necessary for constructing a compiler.
2. Topics include phases of compiler, parsing, syntax directed translation, type checking use of symbol tables,
code optimization techniques, intermediate code generation, code generation and data flow analysis.
UNIT - I 10 Lectures
Introduction: The structure of a compiler, the science of building a compiler, programming language basics
Lexical Analysis: The Role of the Lexical Analyzer, Input Buffering, Recognition of Tokens, The Lexical-
Analyzer Generator Lex, Finite Automata, From Regular Expressions to Automata, Design of a Lexical-
Analyzer Generator, Optimization of DFA-Based Pattern Matchers.
Syntax Analysis: Introduction, Context-Free Grammars, Writing a Grammar, Top-Down Parsing,
Bottom-Up Parsing, Introduction to LR Parsing: Simple LR, More Powerful LR Parsers, Using Ambiguous
Grammars and Parser Generators.

Syntax-Directed Translation: Syntax-Directed Definitions, Evaluation Orders for SDD's, Applications of Syntax-
Directed Translation, Syntax-Directed Translation Schemes, Implementing L-Attributed SDD's.
Intermediate-Code Generation: Variants of Syntax Trees, Three-Address Code, Types and Declarations, Type
Checking, Control Flow, Switch-Statements, Intermediate Code for Procedures.
Run-Time Environments: Stack Allocation of Space, Access to Nonlocal Data on the Stack, Heap Management,
Introduction to Garbage Collection, Introduction to Trace-Based Collection.
Code Generation: Issues in the Design of a Code Generator, The Target Language, Addresses in the Target
Code, Basic Blocks and Flow Graphs, Optimization of Basic Blocks, A Simple Code Generator,Peephole
Optimization, Register Allocation and Assignment, Dynamic Programming Code-Generation.
UNIT - V 12 Lectures
Machine-Independent Optimization: The Principal Sources of Optimization, Introduction to Data-Flow
Analysis, Foundations of Data-Flow Analysis, Constant Propagation, Partial-Redundancy Elimination,
Loops in Flow Graphs.
Course Outcomes:
1. Demonstrate the ability to design a compiler given a set of language features.
2. Demonstrate the the knowledge of patterns, tokens & regular expressions for lexical analysis.
3. Acquire skills in using lex tool & yacc tool for devleoping a scanner and parser.
4. Design and implement LL and LR parsers
5. Design algorithms to do code optimization in order to improve the performance of a program in
terms of space and time complexity.
6. Design algorithms to generate machine code.
TEXT BOOK:
1. Compilers: Principles, Techniques and Tools, Second Edition, Alfred V. Aho, Monica S. Lam,
Ravi Sethi, Jeffry D. Ullman.
REFERENCES:
1. Lex & Yacc – John R. Levine, Tony Mason, Doug Brown, O’reilly
2. Compiler Construction, Louden, Thomson.

NETWORK PROTOCOLS
CODE:A46H8 3 - - 3
Pre-requisites
Computer Networks
Objectives:
1. To understand syntax, and semantics of the various PDUs for each protocol
2. To impart function of various protocols
3. To understand the TCP/IP protocol suite protocols
UNIT I: 10 Lectures
Internetworking Concept and Architectural Model: Introduction, Application-Level Interconnection, Network-
Level Interconnection, Properties of the Internet, Internet Architecture, Interconnection through
B V Raju Institute IP Routers.B Tech IT
of Technology/
Classful Internet Addresses: Introduction, Universal Identifiers, The Original Classful Addressing Scheme,
Addresses Specify Network Connections, Network And Directed Broadcast Addresses, Limited Broadcast,
Subnet and Supernet Extensions, IP Multicast Addresses,
IPV6 addressing scheme: Introduction, Address Space Allocation, Global Unicast Addresses, IPV6 packet
format, Comparison between IPv4 and IPv6 Headers
UNIT II: 10 Lectures

Address Mapping-Static Mapping, Dynamic Mapping, The ARP Protocol-Packet Format, Encapsulation,
Operation, RARP, DHCP-operation, packet format, BOOTP

IP protocol error handling: The Internet Control Message Protocol- Error Reporting vs. Error Correction,
ICMP Message Format.
UNIT IV: 10 Lectures

Transport layer protocols: TCP-services, protocols-stop & wait, Goback-N, Selective repeat, TCP format.
UDP- Introduction, services, format, applications
UNIT V: 12 Lectures
Application Layer protocols: DNS-need, name space, DNS in Internet, Resolution, Telnet, R-Login, HTTP
protocol.
Client-Server Paradigm-Socket Interfaces, Communication Using UDP, Communication Using TCP, Predefined
Client-Server Applications, Peer-To-Peer Paradigm.
Outcomes:
Students are able to:
1. Master the Network layer-addressing schemes

2. Understand the address resolution protocol error handling mechanism in IP layer
3. Master the Transport layer protocols ,application layer protocols
4. Understand Client-Server Paradigm and applications
5. Understand Application Layer protocols
6. Understand IP protocol error handling.
TEXT BOOKS:
Internetworking With TCP/IP Vol-1, Principles, Protocols, and Architecture, Douglas e. Comer,3rd
edition,2019.
TCP/IP Protocol Suite: by Behrouz A. Forouzan TMH, 3rd edition,2018.
REFERENCES:
1. Computer Networking: A Top-Down Approach, 6th edition, by James F. Kurose and Keith W. Ross., 4th
edition,2017.
2. TCP/IP Illustrated, Vol. 1: The Protocols, by W. Richard Stevens., 2nd edition, 2017.
WEB REFERENCES:
1. https://www.tutorialspoint.com/internet_technologies/internet_protocols.htm
2. https://www.w3schools.in/types-of-network-protocols-and-their-uses/
SCRIPTING LANGUAGES
CODE:A46HB 3 - - 3
Prerequisites:
1. A course on “Computer Programming and Data Structures”
2. A course on “Object Oriented Programming Concepts”
Course Objectives:
1 This course introduces the script programming paradigm
2 Introduces scripting languages such as Perl, Ruby and TCL.
UNIT - I
Ruby 10 Lectures
Introduction, Rails, The structure and Execution of Ruby Programs, Package Management with
RUBYGEMS, Ruby and web: Writing CGI scripts, cookies, Choice of Web Servers, SOAP and web services
RubyTk – Simple Tk Application, widgets, Binding events, Canvas, scrolling
Extending Ruby: Ruby Objects in C, the Jukebox extension, Memory allocation, Ruby Type System,
Embedding Ruby to Other Languages, Embedding a Ruby Interpreter

Introduction to PERL and Scripting
Scripts and Programs, Origin of Scripting, Scripting Today, Characteristics of Scripting Languages.
Uses for Scripting Languages, Web Scripting, and the universe of Scripting Languages. PERL- Names and
Values, Variables, Scalar Expressions, Control Structures, arrays, list, hashes, strings, pattern and regular
expressions, subroutines.
Advanced perl Finer points of looping, pack and unpack, filesystem, eval, data structures, packages, modules,
objects,
interfacing to the operating system, Creating Internet ware applications, Dirty Hands Internet
Programming, security Issues.
TCL
TCL Structure, syntax, Variables and Data in TCL, Control Flow, Data Structures, input/output,
procedures, strings, patterns, files, Advance TCL- eval, source, exec and uplevel commands, Name
spaces, trapping errors, event driven programs, making applications internet aware, Nuts and Bolts
Internet Programming, Security Issues, C Interface.
Tk
Tk-Visual Tool Kits, Fundamental Concepts of Tk, Tk by example, Events and Binding, Perl-Tk.
Course Outcomes:
1. Comprehend the differences between typical scripting languages

2. Typical system and application programming languages.
3. Gain knowledge of the strengths and weakness of Perl, TCL and Ruby
4. Select an appropriate language for solving a given problem.
5. Acquire programming skills in scripting language
TEXT BOOKS:
1. The World of Scripting Languages, David Barron,Wiley Publications. 2000
2. Ruby Progamming language by David Flanagan and Yukihiro Matsumoto O’Reilly 2008
3. “Programming Ruby” The Pramatic Progammers guide by Dabve Thomas Second edition 2001
4 “The Ruby Programming Language” by David Flanagan, Yukihiro Matsumoto Released January 2008
Publisher(s): O'Reilly Media, Inc.
REFERENCE BOOKS:
1. Open Source Web Development with LAMP using Linux Apache, MySQL, Perl and PHP, J.
Lee and B. Ware (Addison Wesley) Pearson Education.
2. Perl by Example, E. Quigley, Pearson Education.
3. Programming Perl, Larry Wall, T. Christiansen and J. Orwant, O’Reilly, SPD.
4. Tcl and the Tk Tool kit, Ousterhout, Pearson Education.
5. Perl Power, J. P. Flynt, Cengage Learning.
web Link References
1 www.ruby-lang.org
2 https://www.perl.org/
3 https://www.tcl.tk/man/tcl8.5/tutorial/tcltutorial.html
INFORMATION RETRIEVAL SYSTEMS
CODE:A46H9 3 - - 3
Prerequisites:
1. Data Structures
Course Objectives:
To learn the important concepts and algorithms in IRS
To understand the data/file structures that are necessary to design, and implement information
retrieval (IR) systems.
Course Outcomes:
1. Recall IR principles to locate relevant information large collections of data 2.Implement the
performance of retrieval systems when dealing with unmanaged data sources
3. Recall techniques for the preprocessing needed for information retrieval systems.
4. Illustrate the web indexing and retrieval methods.
5. Design retrieval systems for web search tasks.
6.Classify the relationship between IR, hypermedia, and semantic models.
UNIT - I 9 Lectures
Introduction to Information Retrieval Systems: Definition of Information Retrieval System, Objectives of
Information Retrieval Systems, Functional Overview,
Information Retrieval System Capabilities: Search Capabilities,Vector space model, Probabilistic Retrieval
Strategies: Simple term weights, Non-Binary Independence Model, Language models
Relevance feedback, Clustering, N-Grams, Regression Analysis, Thesaurus Generation,Evaluation in

information retrieval.
Cataloging and Indexing: History and Objectives of Indexing, Indexing Process, Automatic Indexing,
Information Extraction
UNIT - III B V Raju Institute 11 Lectures B Tech IT

of Technology/
Efficiency:Inverted File Structure, N-Gram, PAT Data Structure, Signature Files,Query Processing, Duplicate
Document detection,
Cross-Language Information Retrieval: Introduction, Crossing the language Barrier
Retrieval Utilities: Semantic Networks, Parsing,Stemming Algorithms.
Text Search Algorithms: Introduction to Text Search Techniques, Software Text Search Algorithms, Hardware
Text Search Systems
Integrating Structure Data and text: A historical Progression, Information Retrieval as a relationalApplication,
Semi-Structured search using a Relational Schema.
Distributed Information Retrieval: A theoretical Model of Distributed Retrieval, Web Search
TEXT BOOK:
1. Information Storage and Retrieval Systems – Theory and Implementation, Second Edition, Gerald J.
Kowalski, Mark T. Maybury, Springer.
2. Information Retrieval: Algorithms and Heuristics, David A.Grossman, Ophir Frieder, Springer,
2nd Edition (Distributed by Universities Press), 2004.
REFERENCE BOOKS:
1. Frakes, W.B., Ricardo Baeza-Yates: Information Retrieval Data Structures and Algorithms, Prentice Hall,
1992.
2. Information Storage & Retrieval By Robert Korfhage – John Wiley & Sons.
3. Modern Information Retrieval By Yates and Neto Pearson Education.
DISTRIBUTED SYSTEMS
CODE:A4681 3 - - 3
Pre-requisites:
1. Object Oriented Programming through Java.

2. Operating systems
3. Computer networks
Objectives:
1. To learn the principles, architectures, algorithms and programming models used in distributed
systems.
2. To examine state-of-the-art distributed systems, such as Google File System.
3. To design and implement sample distributed systems.
UNIT-I 9 Lectures
Characterization of Distributed Systems: Introduction, Examples of Distributed Systems, Resource Sharing

and the Web, Challenges.
System Models: Introduction, Architectural Models, Fundamental Models.
UNIT-II 9 Lectures
Time and Global States: Introduction, Clocks Events and Process States, Synchronizing Physical Clocks,
Logical Time and Logical Clocks, Global States, Distributed Debugging.
Coordination and Agreement: Introduction, Distributed Mutual Exclusion, Elections, Multicast Communication,
Consensus and Related Problems.
Interprocess Communication: Introduction, The API for the Internet Protocols, External Data Representation
and Marshalling, Client-Server Communication, Group Communication, Case Study: IPC in UNIX.
Distributed Objects and Remote Invocation: Introduction, Communication between Distributed Objects,
Remote Procedure Call, Events and Notifications, Case Study: JAVA RMI.
UNIT-IV 12 Lectures
Distributed File Systems: Introduction, File Service Architecture, Case Study 1: Sun Network File System,
Case Study 2: The Andrew File System.
Name Services: Introduction, Name Services and the Domain Name System, B V Raju Institute
Directory of Technology/
Services, B Tech IT
Case Study
of the Global Name Services.
Distributed Shared Memory: Introduction, Design and Implementation Issues, Sequential Consistency and
IVY case study, Release Consistency, Munin Case Study, Other Consistency Models.
UNIT- V 12 Lectures
Transactions and Concurrency Control: Introduction, Transactions, Nested Transactions, Locks, Optimistic
Concurrency Control, Timestamp Ordering, Comparison of Methods for Concurrency Control.
Distributed Transactions: Introduction, Flat and Nested Distributed Transactions, Atomic Commit Protocols,
Concurrency Control in Distributed Transactions, Distributed Deadlocks, Transaction Recovery.
Course Outcomes
1. Able to comprehend and design a new distributed system with the desired features.
2. Able to start literature survey leading to further research in any subarea.
3. Able to develop new distributed applications.
4. Able to develop Distributed Objects and Remote Invocation
5. Able to understand Distributed Shared Memory
6. Able to develop Distributed Transactions
TEXT BOOK
1. Distributed Systems, Concepts and Design, George Coulouris, J Dollimore and Tim Kindberg, Pearson
Education, 41″ Edition. 2009.
REFERENCE BOOKS
1. Distributed Systems, Principles and Paradigms, Andrew S. Tanenbaum, Maarten Van Steen, 2nd
Edition, PHI.
2. Distributed Systems, An Algorithm Approach, Sukumar Ghosh, Chapman&Hall/CRC, Taylor & Fransis
Group, 2007.
DATA VISUALIZATION TECHNIQUES
CODE:A46EC 3 - - 3
Pre-requisites: Programming for Problem Solving using Python
Course Objectives: The Students will learn the following:
1. Understand the importance of data visualization and learn the fundamentals of data visualization
2. Employ best practices in data visualization to develop charts, maps, tables, and other visual
representations of data.
3. Describe data analysis and visualization by type of data, organized by number and type of
variables.
4. Discuss various design issues that arise when assembling data visualizations.
5. Build data visualizations, dashboards, and stories to support relevant communication for diverse
audiences.
Unit I: 10 Lectures
Introduction to Data Visualization: Introduction, Ugly, Bad, and Wrong Figures, Visualizing Data-
Mapping Data onto Aesthetics, Coordinate Systems, and Axes, Color Scales, Directory of
Visualizations, Visualizing Amounts.
Understanding Visualizations: Visualizing Distributions-Histograms and Density Plots, Empirical

Cumulative Distribution Functions and Q-Q Plots, Visualizing Many Distributions at Once, Visualizing
Proportions, Visualizing Nested Proportions.
Advanced Visualizations: Visualizing Associations Among Two or More Quantitative Variables,

Visualizing Time Series and Other Functions of an Independent Variable, Visualizing Trends,
Visualizing Geospatial Data, Visualizing Uncertainty
Principles of Figure Design: The Principle of Proportional Ink, Handling Overlapping Points,
Common Pitfalls of Color Use, Redundant Coding, Multipanel Figures, Titles, Captions, and Tables,
Balance the Data and the Context.
Unit V: 10 Lectures
Data Visualization Tools: Explore data visualization tools Tableau and Qlik Sense, investigate
advanced visualizations, analyze measurements with multiple X and Y variables, explore advanced
data science patterns, draw insights out of Visualization tools and Create Dashboards.
1. Identify how data visualization has evolved into the business discovery tool of today.
2. Make use of the knowledge of perception and cognition to evaluate visualization design
alternatives.
3. Choose data transformation requirements for use in data visualizations.
4. Apply psychology to design principles used in data visualization.
5. Evaluate visualizations to answer business questions using visualization tools.
Textbooks:
1. Wilke, Claus O. Fundamentals of data visualization: a primer on making informative and

compelling figures. O'Reilly Media, 2019.
References:
1. Knaflic, Cole Nussbaumer. Storytelling with Data: A data visualization guide for business
professionals. John Wiley & Sons, 2015.
2. Myatt, Glenn J., and Wayne P. Johnson. Making sense of data. John Wiley & Sons,
Incorporated, 2007.
3. Evergreen, Stephanie DH. Effective data visualization: The right chart for the right data. SAGE
publications, 2019.
4. Data Visualization Course by Qlik Academic Program, Qlik Learning. https://learning.qlik.com/.

English for Career Development

(Activity Based Lab)
(ECE, EEE, CSE, IT, MECH, CIVIL, CHEM, PHE, BME, AI&ML, DS)
CODE:A461N - - 3 1.5
OBJECTIVES
1. To enable the students to articulate confidently in different professional contexts and in

different cross-cultural contexts.
2. To improve the students’ fluency in English, through a well-developed vocabulary.
3. To effectively present through the medium of writing for job applications and higher
education.
4. To understand the intricacies in discussion and actively participate in discussions.
5. To comprehend the interview process and participate competently in recruitment.
List of Experiments
Experiment – I
Week -1: Communication in the 21st century workplace – Communication with peers, Communication with the
manager.
To understand the communication process at work place with peers and superiors.
Week -2: Cross Cultural Communication – Understanding different business customs, beliefs and
communication strategies. Language differences, high-context vs low context cultures, nonverbal differences.
To comprehend various business customs and language differences.
Experiment – II
Week – 3: Building Vocabulary - Reasons to enhance vocabulary – GRE Word list practice.
To use selected GRE word list in spoken and written contexts.
Week – 4: Reading Comprehension – Importance of Reading – Types of Reading – Techniques in answering

the passages.
To learn the various types of reading and apply the techniques in answering the comprehension passages.
Experiment – III
Week – 5: Writing Resumes - Definition, Parts of Resume, Covering Letter, Writing Sample Resume.
To draft personal resumes and covering letter.
Week – 6: Statement of Purpose – Writing the Statement of Purpose, Research the University, relating
goals/objectives for higher education.
To compose a personal essay.
Week – 7: Portfolio Writing – Definition, Parts of Portfolios, Writing/Designing Personal Portfolio.

To identify and record personal accomplishments, skills and achievements towards building career.
Experiment – IV
Week – 8: Group Discussion – Dynamics of Group Discussion, Intervention, Summarizing.

To comprehend the dynamics of Group Discussion.
Week – 9: Modulation of Voice, Body Language, Relevance, Fluency and Organization of Ideas, Dos and
Don’ts, activity.
To demonstrate appropriate body language in Group Discussions.
Experiment – V
Week – 10: Interview Skills – Concept and Process – Pre, during and post interview Planning.
To understand the process of interview. B V Raju Institute of Technology/ B Tech IT
Week – 11: Opening Strategies, Answering Strategies, Interview through Teleconference &Video-Conference.
To learn to answer the frequently asked questions.
Week – 12: Mock Interviews – Applying strategies and Practice sessions by different branch faculty.
To participate in mock interviews.
Infrastructure
● Classroom with Projector
Outcomes
1. Communicate professionally in spoken and written format at the work places.

2. Use appropriate vocabulary contextually.
3. Draft employment communication with coherence.
4. Discuss relevantly and confidently on the given topics.
5. Answer confidently the frequently asked questions in the interviews.
Lab Manual
ECS Lab Manual, BVRIT.
References
1. Technical Communication by Meenakshi Raman & Sangeeta Sharma, Oxford University Press
2009.
2. Business and Professional Communication: Keys for Workplace Excellence. Kelly M.
3. Quintanilla & Shawn T. Wahl. Sage South Asia Edition. Sage Publications. 2011.
4. English Vocabulary in Use Series, Cambridge University Press 2008.
5. Communication Skills by Leena Sen, PHI Learning Pvt. Ltd., New Delhi, 2009.
6. A Course Book of Advanced Communication Skills Lab published by University Press, Hyderabad.
7. Sizzling Soft Skills for Spectacular Success, A practical guide on personality development book by P.
Ameer Ali, publisher Notion Press
8. Conversational Repair and Human Understanding book by Makoto Hayashi, Cambridge University
Press.
9. Central works in Technical Communication book by Selber Stuart, Johndan Johnson-Eilola , publisher
Oxford University Press.
10. Practical English Usage,Michael Swan, Oxford University Press.
OPEN SOURCE WEB DEVELOPMENT LAB
CODE:A461H - - 3 of1.5
B V Raju Institute Technology/ B Tech IT
Pre-requisites:
Object Oriented programming through Java.
Objectives :
To enable the student to program web applications using the following technologies.
Client side scripting with javascript,HTML,XML and CSS

Server side scripting with Sevlets,JSP
Design of XML Parsers
Server side scripting with PHP
Develop scripting on AJAX
Note:
Use XAMPP stack (Windows & Linux, Apache, MySQL and PHP) for the Lab Experiments. Though not
mandatory, encourage the use of the Eclipse platform wherever applicable.
The list suggests the minimum program set. Hence, the concerned staff is requested to add more problems to
the list as needed.
WEEK:1
1. Install the following on the local machine
● Apache web server (If not installed)
● Tomcat application server locally
● Install MySQL (If not installed)
● Install PHP and configure it to work with apache web server and MySQL (if not already configured)
2. Write an HTML page that has one input, which can take multi-line text and a submit button. Once the user
clicks the submit button, it should show the number of Characters, words and lines in the text entered using an
alert message. words are separated with white space and lines are separated with new line characters.
WEEK:2
3. Write a script to create a responsive Website using Bootstrap.
WEEK:3
4. (a) Implement an AngularJS script for creating a Directive that adds Event Listeners
(b) Implement an AngularJS script for implementation of most common HTML5 input types: (text, number, url,
email, date, radio, checkbox), as well as some directives for form validation (required, pattern, minlength,
maxlength, min, max).
WEEK:4
5. Create an XML document that contains 10 users' information. Write a java program, which takes the user id
as input and returns the user details by taking the user information from the XML document using (a) DOM
parser and (b) SAX parser.
WEEK:5
6. Implement the following web applications using
(a) PHP (b) Servlets and (c) JSP :
7. A user validation web application, where the user submits the login name and password to the server. The
name and password are checked against the data already available in the database and if the data matches, a
successful login page is returned. Otherwise a failure message is shown to the user.
8. Modify the above program to use an XML file instead of a database.
WEEK:6
9. Modify the above program to use AJAX to show the result on the same page below the submit button.
WEEK:7
10. A simple calculator web application that takes two numbers and an operator (+, -, /, *and %) from an HTML
page and returns the result page with the operation performed on the operands.
WEEK:8
11. Modify the above programs such that it stores each query in a database and checks the database first for
the result. If the query is already available in the DB, it returns the value that was previously computed (from
DB) or it computes the result and returns it after storing the new query and result in DB.
WEEK:9
12. A web application takes a name as input and on submit it shows a hello <name> Page where <name> is
taken from the request. It shows the start time at the right top corner of the page and provides a logout button. It
should show a logout page with thank you <name> message with the duration of usage (hint: use session to
store name and time)
WEEK:10
13. A web application that takes name and age from an HTML page. If the age is less than 18, it should send a
page with “Hello <name> , you are not authorized to visit this site” message, where <name> should be
replaced with the entered name. otherwise it should send a “welcome <name> to this site” message.
WEEK:11
14. A web application for implementation.
The user is first served a login page which takes the user's name and password.
After submitting the details the server checks these values against the data from a database and takes the
following decision.
If name and password matches, serve a welcome with the user's full name.
If name matches and password doesn’t match, then serves “password mismatch” page
If name is not found in the database, serves a registration page, where user’s full name is asked and on
submitting the full name ,it stores, the login name, password and full name in the database(hint: use session for
storing the submitted for storing the submitted login name and password).
WEEK:12
1. A web Application that lists all cookies stored in the browser on clicking the “List cookies” button. Add
cookies if necessary.
OUTCOMES:
The student should be able to:
Use XAMPP Stack for web applications.
Use Tomcat Server for Servlets and JSPs.
Write simple applications with Technologies like HTML, Javascript, AJAX, PHP, Servlets and JSPs.
Connect to Database and get results.
Parse XML files using Java (DOM and SAX parsers).
Text Books:
Web Technologies, Uttam K Roy, Oxford University Press, 3rd edition, 2018.
The Complete Reference PHP-Steven Holzner, Tata McGraw-Hill, 3rd edition, 2019.
AngularJS, S. Brad Green and Shyam Seshadri,O'REILLY, Greyscale edition, 2018.
References:
1. Web programming, building internet applications, Chris Bates 2nd edition, Wiley Dreamtech,2018.
2. Java server Pages-Hans Bergsten, SPD O’Reilly,3rd edition,2019.
3. Java Script, D.Flanagan, O’Reilly, SPD., 2nd edition,2018.
4. Beginning Web Programming-Jon Duckett WROX,3rd edition, 2018.
5. Programming World Wide Web, R.W.Sebesta, Fourth edition, Pearson,2019.
6. Internet and World Wide Web-How to program, Dietel and Nieto, Pearson, 3rd edition,2019.
web References:
1. https://www.tutorialspoint.com/html_web_development/index.asp
2. https://www.javatpoint.com/php-tutorial
3. https://www.w3schools.in/jsp/intro/
4. https://www.w3schools.com/angular/
DATA ANALYTICS USING R Lab

CODE:A462H - - 3 1.5
Course Objectives: This course is intended to,

Build the functional skills required for Data Science and Data Engineering
Enable students to adapt to the data analysis life cycle
Engage the students in data interpretation analysis
Week – 1:
Install, configure and run Hadoop and HDFS
Week – 2:
Implement word frequency programs using MapReduce
Week – 3:
Implement word count programs using MapReduce
Week – 4:
Implement an MR program that processes a weather dataset
Week – 5:
Implement Linear Regression
Week – 6:
Implement Logistic Regression B V Raju Institute of Technology/ B Tech IT
Week – 7:
Implement Decision tree classification techniques
Week – 8:
Implement SVM tree classification techniques
Week – 9:
Implement clustering techniques
Week – 10:
Visualize data using any plotting framework
Week – 11:
Implement an application that stores big data in Hbase & Hadoop
Week – 12:
Implement an application that stores big data in MongoDB using R
Course Outcomes: After completion of this course, students will be able to,
1. Demonstrate proficiency with statistical analysis of data.
2. Develop the ability to build and assess data-based models.
3. Execute statistical analyses with professional statistical software.
4. Demonstrate skill in data management.
5. Apply data science concepts and methods to solve problems in real-world contexts
6. Communicate data analytics driven solutions effectively
Text Books:
1. Taming The Big Data Tidal Wave: Finding Opportunities in Huge Data Streams with
Advanced Analytics, Bill Franks, Thomas H. Davenport, 2020.
2. Dalgaard, Peter, “Introductory statistics with R”, Springer Science & Business Media,
2018.
References:
1. Richard Cotton, “Learning R”, O’Reilly, 2017.
2. Brain S. Everitt, “A Handbook of Statistical Analysis Using R”, Second Edition, LLC,
2015.
3. T. Hastie, R. Tibshirani and J. Friedman, “Elements of Statistical Learning”, Springer,
2017.
HUMAN VALUES AND PROFESSIONAL ETHICS

(MANDATORY COURSE)

CODE:A4601 - - 3 1.5
Objectives: The students will learn the following:

1. To have emotional intelligence to know thyself about emotions and self-management which help them to
lead a comfortable life and way to happiness. To ensure sustained happiness and prosperity which are the core
aspirations of all human beings.
2. To facilitate the development of a holistic perspective among students towards life, relationships,
profession and happiness, based on a correct understanding of the human reality with respect to social
awareness.
3. To highlight plausible implications of such a holistic understanding in terms of ethical human conduct,
trustful and mutually satisfying human behavior and mutually enriching interaction with nature.
Unit I: (06 Lectures)

Self-Management: Self-Control, Self-Motivation, Self-Awareness and Self-Regulations, Accurate self-
Assessment, Self-Confidence.
Unit II: (06 Lectures)

Social Awareness: Empathy, Service Orientation, Understanding Harmony in the Human Being.
Unit III: (06 Lectures)

Relationship Management: Visionary Leadership, Influence Others, Harmony in Humans- Human
Relationship, Understanding Harmony in the Family.
Unit IV: (06 Lectures)
Human Rights: Nature and Definition, Universal Protection of Human Rights.
Unit V: (06 Lectures)

Holistic Understanding of Harmony on Professional Ethics: Natural Acceptance of Human Values,
Competence in Professional Ethics
Outcomes: After completion of the course, the students will be able to:
1. Examine Emotional Quotient, interpret and manage emotions
2. Develop a clear perspective towards life, relationships and profession
3. Elicit the qualities of a visionary leader
4. Understand the importance of human values and universal protection of human rights
5. Illustrate the importance of professional ethics and ethical human conduct
Textbooks:
1. R R Gaur, R Sangal, G P Bagaria, 2009, A Foundation Course in Human Values and Professional Ethics.
2. Emotional intelligence: Daniel Goleman.
References:
1. Human values, A.N. Tripathy, New Age International Publishers, 2003.
2. Fundamentals of Ethcis for Scientists and Engineers, E.G Seebauer, Robert L. Berry, Oxford University
Press, 2000.
Engineering Ethics (Including Human Values), M Govindrajran, S Natrajan & V. S. Senthil Kumar, Eastern
Economy Edition, Prentice Hall of India Ltd.

Syllabus Copy

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Syllabus Copy

Uploaded by

Copyright:

Available Formats

Estd: 1997 EAMCET Code: BVRI

BACHELOR OF TECHNOLOGY (B.Tech.)

(Applicable for the batches admitted from 2020-2021)

Department of Information Technology

Orchard Park Campus, Vishnupur

Email: bvrit@bvrit.ac.in Website: bvrit.ac.in

B V Raju Institute of Technology/ B Tech IT

Developing students with a disciplined and Integrated personality

Vishnupur, Narsapur, Medak District, Telangana State.

ACADEMIC REGULATIONS R20 FOR B.TECH. (REGULAR)

1. Title and Duration of the Programme

Discipline Name Code

4. Structure of the Programme

Broad Course Total

B V Raju Institute of Technology/ B Tech IT

8. Minimum Instruction Days

10. Attendance Requirements

11. Grading System

Letter Grade Grade Points % age of marks earned

12. Recounting & Revaluation

13. Answer books verification and challenge valuation

14. Supplementary Examinations

15. Promotion to the next year of study

16. Massive Open Online Courses

17. Eligibility for Award of B.Tech. Degree

18. Award of Class

≥ 5.0 - < 5.5 Pass Class

19. Consolidated Grade Card

20. B.Tech. with Honors or Additional minors in Engineering

22. B.Tech. with Minors in Engineering

23. Vertical Progression

25. Transitory Regulations

26. Graduation Ceremony

27. Termination from the Programme

B V Raju Institute of Technology/ B Tech IT

CGPA earned from 121.5 Credits Class Awarded

B V Raju Institute of Technology/ B Tech IT

All the rules and regulations, specified herein afte

DEPARTMENT OF INFORMATION TECHNOLOGY

I. STRUCTURE OF THE PROGRAM

Broad Course Total

1 Foundation Humanities, Social English, humanities, social sciences,

Basic Sciences (BS) Mathematics, Physics, Chemistry 24

Engineering Sciences (ES) Fundamental Engineering Courses 25

2 Core Courses Professional Core (PC) Professional courses-core relevant

3 Elective Professional Electives (PE) Professional courses- electives

Open Electives (OE) Electives from other departments

4 Mandatory Mandatory Courses (MC) Courses on Environmental sciences,

II. INDUCTION PROGRAM

Induction Program 3 Weeks duration

S.NO CODE COURSE TITLE CAT L T P C CIE SEE TOTAL

3 A41NE Applied Physics BS 3 - - 3 40 60 100

7 A413N Physics Lab BS - - 3 1.5 40 60 100

S.NO CODE COURSE TITLE CAT L T P C CIE SEE TOTAL

1 A42NA Communicative English HS 3 - - 3 40 60 100

2 A42NG Advanced Calculus BS 3 - - 3 40 60 100

3 A42ND Applied Chemistry BS 3 - - 3 40 60 100

4 A42HA Foundations of Computer

8 A422N Chemistry Lab BS - - 3 1.5 40 60 100

TOTAL 16 - 13 20.5 360 540 900

S.NO CODE COURSE TITLE CAT L T P C CIE SEE TOTAL

1 A43H1 Advanced Data Structures PC 3 - - 3 40 60 100

2 A43H2 Software Engineering with UML PC 3 - - 3 40 60 100

3 A43NA Probability and Statistics BS 3 - - 3 40 60 100