B.Sc.

Degree Programme
(Applicable from the academic year 2022- 2023)

R-22
CURRICULUM
AND
COURSE CONTENTS
 Academic Regulations, Curriculum and Course ContentsB.S

3c.
(Applicable for the students admitted into first year from the academic year 2022-23 onwards)

YEARS
DEGREE
PROGRAMME

Executive Abstract

R22 - Academic regulations, Curriculum and course contents, is an articulation

of the VFSTR deemed to be University’s commitment towards NEP-2020, with a view
that it enables student(s) to maintain the spirit of continuous learning and continuous
assessment to replace the normal tendency of preparing just before a test or an
examination. The proposed framework accomplishes multi-disciplinary holistic education,
continuous assessment along with multiple honorable exit options if a student falls
short to complete the requirements to earn the degree within the stipulated period
including the permissible spillover period.
R22 is oriented in line with NEP-2020, with higher weight given to continuous /
formative assessment, which is an Integrated learning model comprising Learning –
Thinking – Understanding – Skilling – Applying – Creating. Emphasis on continuous
formative assessment with a creative summative assessment will facilitate the candidate
to “Move away from high stake examinations – towards more continuous and
comprehensive evaluation”.
The B. Sc. degree offered will be for three years (6 semesters) duration with
honorable exit options, within this period candidate can exit with suitable certification
that will enable him / her to have a professional career as well as serve as a reminder to
return and update his / her qualification in the future. However, the intention of the
learners is not to join for the award of the undergraduate certification / diploma but to
acquire a B. Sc. degree.
A candidate can opt for an onward continuation to M. Sc. programme (two years),
in such a case on successful completion both B. Sc. and M. Sc. degrees will be awarded.
However, if a candidate wants opts for a lateral exit during the onward extension, after
successful completion of first two semesters of M. Sc. study, then he / she will receive
B. Sc. Honours degree. Such an extension is subjected to successful completion of
requirements of 3 year B. Sc. programme.

Salient features of the regulations

 Continuous learning
 Continuous assessment
 Onward continuation to M. Sc. degree
 Lateral exit options
 Semester sabbatical option to pursue innovation, incubation, entrepreneurial
and advanced exploratory activities and subsequent re-entry.
 Credit earning by credit transfer

1. Introduction

VFSTR I
This document contains the academic regulations, scheme of assessments,
curriculum, detailed syllabi, course contents with text / reference books
recommended, course outcomes, skills to be acquired and the projects /
assignments that are to be performed for each course for the conduct of 3-year B.
Sc. degree programme.

VFSTR II
B.Sc. 1.1 Definition

3
For the purpose of R22 regulation, definitions as follows shall apply:
 “Degree” shall refer to the B. Sc. Degree Program.
YEARS  “Course” shall refer to such course(s) for which a student shall earn credits
after due assessment as per the laid provisions. Each course shall comprise
DEGREE PROGRAMME of Lecture (L), Tutorial
(T) and Practice (P) Sessions. A course may have either or all the three
components. Project is also treated as a course.
 “Academic activities” shall refer to the activities like Lecture (Physical
Lecture Session), Tutorial (Participatory discussion / Self-study / Desk work /
Quiz / Seminar presentation etc. activities that make the student absorb and
assimilate the delivered contents effectively) and Practice / Practical
sessions (includes Hands on experience / Practice / Field studies
/ Case studies etc. that enable the student to acquire the requisite skill).
 “Continuous Assessment” shall refer to the evaluation of the student spread
over the entire semester on the various constituent components of the
prescribed course.
 “Semester” shall refer to a period covering the two assessment periods viz.
Formative and Summative Assessment period. A semester would generally
be spread over twenty weeks.
 “Course Drop” shall refer to a student having to undertake a repeat of the
Course(s) not being able to complete the Credit requirements of the
Course(s), under the conditions stipulated in the regulation.
 “Supplementary Examinations” shall refer to the examination(s) conducted
to allow the student to appear in the un-cleared / underscored Semester -
End summative assessment component, with a view to accord him an
additional opportunity to improve upon his previous score.
 “Blank Semester” shall refer to a Semester in which a student either does
not register for any course at the beginning of the Semester OR chooses to
DROP all courses OR is so compelled to DROP all the courses, as the case
may be.
 “Spill Over Semester” shall refer to the additional semester(s) beyond the
completion of prescribed normal semesters.
 “AAA Section” shall refer to the Academics, Assessment and Award Section of
the Institute.
 “Attendance” refers to the Physical personal presence in an academic activity
session.
 “Summer Semester” refers to a semester that is decided to be held during
the intervening period of Even and Odd Semester (i.e. summer vacations
period).
 “Semester Drop” shall refer to availing a blank semester. However, if drop is
availed to
pursue a creative extension activity, then it is defined as semester sabbatical.
 “School” refers to a division of institute dealing with two or more specific area
of discipline / study comprising of the departments related with exclusive
emphasis on trans-disciplinary research.
 “Department” refers to a division of institute dealing with a specific area of
discipline /
study.
 “Grade Point” refers to the quantification of the performance of a candidate

VFSTR III
 in a particular course as defined herein.
 “Honorable Exit Option” refers to the Exit Options available to students,
when they are unable to complete the prescribed three-year B. Sc. Degree
program in five successive years.
 “SGPA” refers to the Semester Grade Point Average and is calculated as
detailed in the regulations subsequently.

VFSTR IV
  “CGPA” refers to the Cumulative Grade Point Average and is calculated as
B.Sc.

3
detailed in the regulations subsequently.

 “Division” refers to the Division awarded to the student as per the

mechanism detailed in the regulations subsequently. YEARS
 “HoD” refers to the Head of the respective Department, where the student DEGREE PROGRAMME
is enrolled for his / her Branch of Study

 “Internship” refers to onsite Practice Training offered by reputed companies / Institutions,

in India or abroad to be undertaken only upon prior approval of the respective HoD.

 “Project” refers to a course executed by a candidate on a specific research

problem at VFSTR / any organization of repute. To be undertaken only upon
prior approval of the respective HoD.

 “Credit equivalence and credit transfer committee” refers to the committee

designated to look into for credit equivalence and credit transfer.
1.2 Academic Administration
The academic programmes of VFSTR are governed by the rules and regulations
approved by the Academic Council from time to time. The various academic
activities are conducted following a fixed time schedule duly approved by the
Academic Council in line with the UGC regulations. The academic activities of
VFSTR are followed meticulously as specified in the academic calendar as
approved by the Academic Council. This academic calendar is shared with all
the stake holders well before the beginning of the respective academic year.
The curriculum and the course contents of all the programmes are discussed by
the respective Board of Studies (BoS), analyzed and recommended for
implementation. The Academic Council, being the highest statutory body,
chaired by the Vice-Chancellor, meets at least twice or thrice a year and
discusses, suggests and approves all the important academic matters related to
curriculum and course contents in particular including the recommendations of
BoS. These regulations were placed before the 31st Academic Council meeting
held on 30-07-2022 and duly approved by the council.
1.3 Program Duration
For the B. Sc. programme the regular courses including theory and practice are
offered over a period of three years in six semesters. The normal duration to
complete the B. Sc. programme is three years. However, a student can avail the
benefit of spillover period of 2 years, that is the maximum duration of five years
can be availed by a candidate to complete the B. Sc. programme in a slower
pace if he / she desires. The candidate failing to complete the requirements
within 5 years will be considered for the honorable exit as applicable.
1.4 Courses and Credits
The term course is used in a broader sense to refer to so called papers such as
‘theory course’, ‘practice course’ etc. A course can be of theoretical and / or of
practice nature and certain number of credits are allotted to it depending on the
number of hours of instruction per semester. For a course offered in a semester,
one hour of lecture (L) instructions carried out in a week is considered
equivalent to one credit, whereas two hours of practice (P) sessions done in a
week are considered equivalent to one credit respectively. Depending on the
course two hours of tutorial (T) sessions may be considered equivalent to one
credit. A student earns these credits when he / she successfully complete the
course. Credits can also be obtained by successful completion of other
recognized co-curricular and extra-curricular activities such as NCC, NSS. etc.
The details of credits of such activities will be provided by the respective course

VFSTR V
coordinators and assessment of student performance in the activities will be
carried out objectively by the constituted committees appointed by the Dean
AAA. The criteria of assessment for these activities will include aspects like
regular attendance in the programme and satisfactory completion of it through
tests conducted at University level or by participation
/ performance at university level, state level or national level events etc.

VFSTR VI
B.Sc. 1.4.1 Content Delivery of a Course

3
Content delivery of a Course in the B. Sc. Degree Program shall be through,
either or
all of the following Methods:
YEARS
i. Lecture - refers to Lecture Session(s) through classroom contact
DEGREE PROGRAMME session wherein students will learn by listening. Denoted by “L”.
ii. Tutorial - refers to transaction(s) consisting of Participatory discussion
/ Self- study / Desk work / Brief presentations by students along with
such other novel methods that enable a student to efficiently and
effectively absorb and assimilate the contents delivered in the lecture
sessions. Denoted by “T”.
iii. Practice - refers to Practice / Practical sessions and it consists of
Hands on experience / Field Studies / Case Studies / Project, that
equip the students to acquire the much required skill component.
Denoted by “P”.
1.5 B.Sc. Degree
All students formally and conventionally enroll for B. Sc. degree programme in
triple-major (Mathematics, Statistics, Computer Science). They have to earn 120
credits for the award of degree as specified in the Curriculum.
1.5.1 Onward Continuation to M. Sc. degree programme
After fulfilling the requirements of B.Sc., a candidate may choose for
onward continuation to M. Sc. and earn 80 credits spread over four
semesters, including one semester long project, to become eligible for
award of M. Sc. (Annexure-2).
1.6 Composition of an Academic year
An academic year is composed of an Odd semester (20 – 22 weeks), an Even
semester (20
– 22 weeks) and a Summer semester (6 – 8 weeks). The regular semester that
begins in July
/ August is known as odd / first semester and the one that begins in December /
January is known as even / second semester Figure (1). The instructional days for a
regular semester shall be a minimum of 90 working days exclusive of days
earmarked for summative assessment.

YEAR OF 12 MONTHS

1 2 3 4 5 6 7 8 9 10 11 12
July/ Aug./ Sept./ Oct./ Nov./ Dec./ Jan./ Feb./ Mar./ Apr./ May/ June/
Aug Sept. Oct. Nov Dec. Jan. Feb. Mar. Apr. May June July
SUMMER
ODD SEM/ FIRST SEM ODD SEM/ FIRST SEM
SEM
Figure 1: Distribution of semesters during an Academic Year

1.6.1 Before the commencement of the semester, a candidate has to pay the
stipulated tuition fee and submit an application detailing the courses he /
she intended to register, valid for that respective Odd / Even semester.
The maximum number of credits per semester will be 25 credits inclusive
add-on credits. The intended semester wise coverage will be as
presented in the curriculum.
1.6.2 Summer semester is a short duration semester program that will be
generally conducted during the semester break between even semester
and odd semester. The students having ‘R’ (Repeat grade) courses may
register for the course work during this semester to get a chance for
successfully completing the ‘R’ courses. In general, supplementary
assessments are conducted in the later part of the summer semester.
VFSTR VII
 However, the courses offered in summer semester and the number of
courses a student can register are subjected to academic and
administrative convenience. A student may register up to a max. of 16
credits in a summer semester.
1.6.3 Exception to the routine practice of registering for ‘R’ courses in summer
semester, a student can register in a course offered by a visiting expert
during the summer vacation which may be equivalent to a major elective.
The candidates can register for such courses within the scope of 16
credits.

VFSTR VIII
 1.7 Semester wise provisions
B.Sc.

3
A student may register for a maximum of 25 credits per semester as prescribed
or otherwise he / she may include the Repeat courses in the event of having not
successfully completed a course or courses in the earlier semesters. However, a
student may also opt to go in a slower pace to earn the credits less than the YEARS
prescribed maximum of 25, including even ‘Dropping’ a semester for special
DEGREE PROGRAMME
reasons.
It should be clearly underscored that a candidate should on priority register for
Repeat (R) credits if any, during a regular semester, within the said scope of 25
credits; in case he / she cannot be sure of completing the ‘R’ credits in Summer
semester.
1.7.1 During the first three years from the date of admission to B. Sc., a
candidate has to pay the semester / annual fees as prescribed
irrespective of the less number of credits that he / she would register or
even opt to Drop a semester.
1.7.2 If a candidate gets into spillover semester beyond three years up to a
maximum of five years he / she has to pay semester fee proportional to
the credits that he / she registered in that spill over semester as
prescribed from time to time.
1.7.3 A candidate has to pay additional fee proportional to the number of credits
for registering in a summer semester as prescribed from time to time.

2. Curriculum
The Department prescribes semester-wise curriculum encompassing different courses.
Every course offered will be designated in a L-T-P structure. The theory courses
comprise of L (and / or T and P hours) whereas the practice courses include practice
instructions (T) and Practical sessions (P). Amalgamation of theory courses with
Practical sessions is predominantly seen in this curriculum.
2.1 Distribution of credits
The overall distribution of credits for various categories of courses in the
curriculum of B.Sc. programme is represented in Table-1 as given below.

Table-1: Credits Distribution for Various categories of courses

Category of Courses Number of Percentage of

Credits Credits
Major Core Courses 60 50.00
Major Electives 24 20.0
Project 04 3.33
Humanities 20 16.66
Employability Skills 05 4.16
Physical Fitness / Orientation /
NCC / NSS / Environmental Science 07 5.83
/ Students Activity Council (SAC) /
Social activities
Total 120 100

2.2 Organization of course contents

Courses offered in the program are composed of two modules covering all the
course contents required for a candidate to obtain knowledge and skill. The
contents in each module are further distributed among two Units; wherein Unit-
1 contains ‘Fundamentals and Broad perceptive’ of the module. Unit-2
comprises of the extension / advanced topics of Unit-1 as well as necessary
practice models for validation / applying the knowledge gained during L / T
VFSTR IX
sessions. The modular period is about 8 weeks. The first Unit in a module may
be covered in 3 to 4 weeks and the second Unit of the module maybe of 4 to 5
weeks Figure (2). By the end of each module a candidate must be in a position
to translate his / her L-based knowledge into P-based skill as prescribed in the
curriculum. Individual formative assessment shall be in place for each module
and a single semester-end summative assessment for the course composed of
both the modules.

VFSTR X
B.Sc. YEAR OF 12 MONTHS

3
1 2 3 4 5 6 7 8 9 10 11 12
July/ Aug./ Sept./ Oct./ Nov./ Dec./ Jan./ Feb./ Mar./ Apr./ May/ June/
YEARS Aug Sept. Oct. Nov Dec. Jan. Feb. Mar. Apr. May June July

DEGREE PROGRAMME SUMMER

ODD SEM/ FIRST SEM EVEN SEM / SECOND SEM
SEM

Module- I Module- II Module- I Module- II

U1 U2 U1 U2 U1 U2 U1 U2

Figure 2: Unit-wise distribution of course contents in a module and their mapping with Academic
Calendar; U= Unit

3. Choice Based Credit System

The B.Sc. programme comprises of various courses from Sciences, Humanities,
employability and life skills, project, sports and mainly focused on Mathematics,
Statistics, Computer Science called as Major courses. VFSTR offers flexibility for
students to choose courses of their choice and obtain the credits satisfying the
minimum credits criterion.
3.1 Major core courses
Core courses comprising of triple majors are mandatory for every student. These are
designed
to offer the essential fundamental knowledge and skills required for the specific
programme.
3.2 Major electives
A candidate has a choice to choose the courses within the triple-major. A list of
major elective courses is pooled together, enabling a candidate to choose the
electives from a pool so that he / she can focus to a specific theme. Elective
courses are spread over two semesters from fifth to sixth semester, to enable
students earn credits from a chosen pool. Candidate can also acquire a
maximum of 4 credits through MOOCS (Swayam based NPTEL) which can be
considered equivalent to one of the electives.
3.3 Project
Students should take up project work in any one of the triple-major courses
based on his / her interest and work on it in VFSTR itself in sixth semester. Each
candidate has to submit interim reports and a final report which is mandatory
requirements towards the partial fulfillment of project credits requirements. It
bears a weightage of 4 credits with duration of 90 working days. During the
semester the student under the guidance of a faculty member(s) will involve in
an innovative design / research through the application of his / her knowledge
gained in various courses studied. He / she is therefore expected to present a
survey of literature on the topic, work out a project plan and carry it out through
computation / modelling / simulation. Through such a project work, the student
is expected to demonstrate the data collection, data analysis, system analysis,
design, presentation and execution skills with a valid conclusion. Performance in
the project will also be assessed in the modular framework for formative and
semester-end summative.
3.4 Humanities
Course content covers general studies and linguistic skills for the students during
first to fourth
semester.
3.5 Employability Skills
Course content covers analytical skills, employability skills and IT workshop for the
students
VFSTR XI
 during first to fourth semester.
3.6 Binary graded courses
3.6.1 Physical Fitness
As physical fitness contributes to physical, mental and social
development, it is offered to students. The credits are spread across 2
semesters in I year with 1 credit per semester. Students are imparted
training through physical exercises.

VFSTR XII
 3.6.2 Orientation course
B.Sc.

3
Course content covers cross-cutting issues of the society like Gender
Equality, Human Values, Professional Ethics, Moral and Ethical Values.
Orientation course is offered for I year B.Sc. students and on successful
completion earns 3 credits. All the students have to register during first / YEARS
second semester and mandatorily obtain successful completion grade.
DEGREE PROGRAMME
3.6.3 Courses with floating credits
With a view to imbibe social responsibility and all round development
students are encouraged to participate in NCC / NSS / Students Activity
Council (SAC) / Social activities. Such activities lead to awarding of 1
credit.
In case the candidate does not successfully complete the binary graded courses,
they will be placed under ‘R’ category. However, such R should be completed in regular
Odd / Even semester whenever these courses are offered. In special cases provision of
summer semester may be provided.

4. Attendance
It is mandatory for the student to attend the course work in each semester as per
the academic schedule of that semester. VFSTR expects 100% attendance.
However, the attendance in each course shall not be less than 75 % of the
aggregate of all L, T, P sessions conducted in that course.
a) The attendance calculations will be periodically reviewed at the end of every 4
weeks. The details of attendance status will be shared with the guardian /
parents. The final status of attendance will be reported at end of 15th week
granting the advantage of the attendance for the 16th week for the purpose of
attendance shortage calculations.
b) The shortage of attendance may be condoned up to 10% on the ground of ill-
health, social obligations, participating / representing in sports / cultural events,
placement activities etc.
c) Documentary evidence like medical reports and certificates issued by concerned
bodies is to be produced on time as support for the attendance shortage due to
ill-health. These cases are subjected to the scrutiny of a committee constituted
for this purpose by the Vice-Chancellor. The decision of the committee shall be
final.
d) Prior approval has to be taken from the HoDs for the other types of leaves.

e) The courses where the student shortage of attendance was not condoned shall
be considered as ‘Repeat’ category courses and will be under ‘R’ grade in the
student’s semester transcript. Student should re-register for these courses
during the summer semester or whenever the course is offered next time during
the regular semesters. These re-registrations are subjected to the regulations at
the time of re-registration. In case of core courses, the same core has got to be
re-registered. However, in case of an elective a candidate may exercise a choice
of choosing different elective in place of ‘R’ graded elective.

The students who are put into ‘R’ grade will not be allowed to take up the
summative assessment in that semester.

5. Assessment
Teaching-Learning and Assessment should go hand in hand and complement each
other. Continuous assessment plays a vital role to enable the student to get
synchronized with the teaching-learning process. Assessment mechanism adopted in
the institute is aimed at testing the learning outcomes in tune with the outcome
based model of education. The focus, is thus on assessing whether the outcomes
are realized by the end of the course.
VFSTR XIII
The performance of a student in each course is assessed on a continuous basis during
the semester through various in-semester and end-semester assessment models.
The marks awarded through continuous assessment are referred to as Formative
assessment marks. The marks awarded through end-semester tests are referred to
as Summative assessment marks (Figure 3). Both the formative and summative
assessment marks are considered for awarding the final marks and the grade point
in a particular course.

VFSTR XIV
 Overall Assessment (100%)

B.Sc.

3 YEARS
Formative Assessment (60%) (During the Semester)

DEGREE PROGRAMME
Summative Assessment (40%) (At the Semester End)

Module -1 & 2
(40%)

Module Figure -3:Module

Categories of Assessments in place for R22
-1 -2

5.1 Marks distribution

For each course, the maximum sum of formative and summative assessment
marks put
together is 100, in the ratio of 60:40 respectively.

5.2 Qualifying criteria

To be declared successful in a course, a student must secure at least a grade
4.0 in a scale of 10 based on the total maximum marks which is inclusive of
formative and summative assessment. The students should also get 35% from
the maximum marks allotted for formative and summative assessments
individually.
The hierarchy of qualifying criteria is as follows:
i. Attendance compliance should be 75% or within condonable range; else the
candidate is put into ‘R’ grade.
ii. In formative assessment, a candidate should secure a minimum of 35% i.e., 21
marks out
of 60; else the candidate is put into ‘R’ grade.
iii. In summative assessment, a candidate should secure a minimum of 35% i.e.,
14 marks out of 40; else the candidate is put into ‘I’ (Incomplete) grade.
iv. Collectively the candidate should secure a min. grade of 4.0 in a scale of 10
after relative grading (section 7); else the candidate has to choose either ‘R’
or ‘I’ grade duly being counselled.
v. A candidate who has secured grade less than 5 in a course may be permitted
(optional) to volunteer to improve his / her grade by opting suitably ‘R’ or ‘I’
grade in that course.

The candidates with ‘R’ grade should re-register for ‘R’ courses either in Summer
semester or in a regular semester as and when the courses are offered. The candidates
in ‘I’ grade are allowed to appear for supplementary summative assessment whenever
the semester-end assessments are conducted.

To assess binary graded courses / Physical Fitness / special projects / courses, not
fitting into the categories described here, a suitable assessment procedure will be
evolved in consultation with experts of that area and adjudicated by the committee
constituted for that purpose. The decision given by the committee will be final. The
appended assessment scheme shall be announced by the course coordinator during the
commencement of course.
VFSTR XV
VFSTR XVI
 YEAR OF 12 MONTHS B.Sc.

3
1 2 3 4 5 6 7 8 9 10 11 12
July/ Aug./ Sept./ Oct./ Nov./ Dec./ Jan./ Feb./ Mar./ Apr./ May/ June/
Aug Sept. Oct. Nov Dec. Jan. Feb. Mar. Apr. May June July YEARS
SUMMER DEGREE PROGRAMME
ODD SEM/ FIRST SEM EVEN SEM / SECOND SEM
SEM
Module- I Module- II Module- I Module- II
U1 U2 U1 U2 U1 U2 U1 U2

Figure 4: Schedules of formative and summative assessments in line with Academic calendar. SA = Summative assessment

5.3 L-based courses integrated with P / T

5.3.1 Formative Assessment
The scheme of formative assessment is designed to promote the continuous
learning. Scheme consists of assessments planned at institute level and
assessment that may be scheduled by the course instructor Figure (4). Institute
level assessments shall be scheduled by the office of AAA. Respective Faculty
Member(s) shall declare the schedule of Continuous Practice Assessments (CPA),
Quiz, Tutorials, Assignments, Seminars, Discussions, etc. Some of the components
may also however take place in an unscheduled manner like Surprise Tests.
However, students shall be made aware of the assessment modalities that are
going to be followed in a course by the faculty, under information to the HoD.
To monitor the progress of students, continuous assessment comprising of five
targets (T1, T2, T3, T4 and T5) is advocated in each module for a maximum of 60
marks. For a class (or section) of 60 to 70 students, formative assessment
commences by the announcement of module bank containing 10 problems for
each module in a course. Nature of problems in the module bank shall be at the
level of creative / exploratory / design / thought provoking covering the complete
syllabus of a module at somewhat advanced / challenging level.
The purpose of creating module bank of 10 problems is to assign one problem each
to 2 batches of 3 - 4 members. The batches are composed of randomly picked up
candidates. These batches remain same for all courses and also for the P-sessions
in the courses in that semester and are created in the beginning of that semester.
The purpose of assigning one problem to two batches is to create a healthy
competitive spirit between the two batches.
The modality of evaluation of five targets is listed here under:
a) T1: During 5th or 6th week of each module a classroom test shall be
conducted. T1 consists of two parts: A and B.
Part A consists of one random problem from the module bank and vary from
batch to batch. All the questions in the module bank shall be distributed
among students and students shall know the question to be answered only on
the day of test in the examination hall.
Part B consists of one common problem at fairly application / advanced level (not at all prior
notified) for all the students from outside the module bank.
T1 shall be paper based and proctored test for a period of 60 min (maximum) which shall
be assessed for 30 marks and downscaled to 10 marks.
For the students who for justifiable reasons could not attend the classroom
test on the scheduled day, a re-test maybe conducted. However, Part-B will
contain a new question and Part-B will have higher weightage than part-A or
full weightage could even be allotted for Part-B in such an event.
b) T2: Immediately follows T1. Students in a specified batch who now have received the same
question during T1 will work further on that problem for T2.
T2 is primarily an extension of problem received in T1 for carrying out
VFSTR XVII
validation study: Case studies / Simulations. Each batch shall interact with the
course instructor to finalize the nature of validation and expected to complete
the exercise within 10 to 15 days after T1.

VFSTR XVIII
B.Sc. Course instructor should ensure assigning a different case study / a different
scope for

3 YEARS
DEGREE PROGRAMME
validation study for each batch in case the same problem is assigned to two
batches.
Course instructor shall assess every student in a batch for a max. of 10 marks
based on his observation, interaction and / or reviewing. (based on at least two
reviews)
c) T3: T3 shall be conducted during the last week of each module. Student batches
are expected to submit a report, clearly documenting the work executed during
T2. The report should be in IEEE / APA format and additionally a voice in-built
PPT should be prepared and submitted.
The report and presentation shall be assessed by the course instructor for 10
marks for every student. In certain cases, a course instructor can call for a
physical presentation also by a batch.
d) T4: T4 is a comprehensive module test, conducted for 30 min. comprising of
20 multiple choice questions (MCQs) covering the holistic content of module.
T4 shall be evaluated for a max. of 10 marks @ ½ mark for each question. T4
will be conducted in ON-LINE mode
There shall be two tests in each course in a day and the best performance of
the tests shall be considered for awarding the marks.
Two sets of question papers each containing 20 questions should be set. The
theme of the questions could be similar across the sets. When the test is
administered online, every student receives the questions in shuffled sequence
and also the choices in shuffled sequence. Therefore, the choice like both ‘a’
and ‘b’ above, Neither of ‘a’ and ‘b’, all the three a, b, c will not be set.
e) T5 : T5 assessment is based on Practice or Tutorial assignments.
Implementation, Report presentation and Discussion shall happen in a
continuous mode throughout the module period.
At least 4 such continuous practice assessments (CPA) / assignments per
module shall be conducted by course instructor. The marks will be @ 5 marks
per assignment totaling up to 20 per module.
The scores of the tests are to be normally announced within three working days
on completion of the assessment and the performance is to be discussed in the
class.
f) The total marks per module is 60 - T1 (out of 10), T2 (out of 10), T3 (out of 10),
T4 (out of
10) and T5 (out of 20).
g) Total marks for both the modules from formative assessment will be added up
to 120, which will be suitably mapped down to a max. of 60 marks. The
mapping policy should be decided by the lead instructor / instructors in
consultation with the HoD. The mapping policy should be shared with Dean
AAA for the purpose of documentation.
h) The marks scored in Module-1 for a max. of 60 should be entered / submitted
latest by 9th week and of Module-2 latest by 17th week of the semester.
Consolidated score of for a max. of 120 suitably mapped down to a max. of 60
marks should be submitted latest by 18th week of semester enabling the
declaration of ‘R’- grade before the commencement of summative assessment.
i) A candidate put under ‘R’ will not be permitted to take up the summative
assessment.
5.3.2 Summative Assessment
a) An instructor may choose one of the two formats for conducting summative
assessment for L-based courses integrated with T / P
i. 15 + 25 marks format or 20 + 20 marks format (following b, c, d below)
ii. 40 marks format (following c, d below)
VFSTR XIX
 b) If summative assessment is in two parts format:
i. Part-I will be the assessment of capstone project which is pre-assigned
during the module-2 period or will be the exploratory review assessment of
all practice assignments.
ii. Part-II will be based on a written examination for a max. marks of 80, as in c
and d below, which is suitably mapped down to 25 or 20 based on the
selected pattern of format.
iii. A candidate should attend both the parts of summative assessments; else
he will be put into I grade.

VFSTR XX
 c) For each L-based course integrated with T / P, the summative assessment shall be B.Sc.

3
conducted by the Institute for a duration of 150 min. and for a maximum of 80
marks. Contents for summative assessment shall cover the breadth and depth
of the complete syllabus that is mentioned in the two modules of a course.
d) The question paper for end-semester theory examination consists of two parts
YEARS
as given in Table (2). DEGREE PROGRAMME
Table-2: Theory Examination Question Paper Pattern

Part No. No. of Marks for each Marks Choice

Questions Question
A 4 10 40 No
B 2 20 40 No
Total Marks 80
e) The questions will be comprehensive covering the entire course syllabus and
any single question should not necessarily be limited to any particular Unit /
module.
f) The marks scored out of 80 are suitably mapped down into a score out of 25 or
20 based on the format.
g) Total marks of summative assessment will be for a max. of 40 irrespective of
format of evaluation.
h) The award of ‘I’ grade is solely based on marks scored in summative
assessment out of 40, if he / she does not score a min. 14 out of 40 (35%).
5.4 P-based Courses
The detailed information consisting of list of practices, batch formations,
schedules, etc., will be displayed / informed to the student in the first week of the
semester so that the student come prepared for the Practical sessions.
5.4.1 Formative Assessment
During Practical sessions, a brief viva-voce is conducted for each student on the
practice problem he / she is carrying out on that day. Some of the parameters
that could be included in the Continuous Practice Assessment (CPA) are given in
Table (3). The set of parameters may slightly differ from one practice to the other,
and will be announced before the commencement of the practice session. These
parameters are assessed for each practice session.
Table-3: Suggested parameters for Continuous Practice Assessment (CPA)

S. No. Component Marks

Report of about one page on proposed computational
1. 4
procedure and background theory before the start of
practice session
2. Viva and interaction to evaluate understanding of 4
concepts
3. Data collection and computation 4
4. Analysis of data and interpretation 4
5. Finalized report submitted on the next week 4
Total 20
This assessment is carried out for each practice session and the total marks of all Practical
sessions will be suitably mapped down to a max. of 60.
5.4.2 Summative Assessment
End semester examination for each practice course is conducted jointly by two
examiners. The examiners are appointed by Dean, AAA from the panel of
examiners suggested by the respective Heads of the Department. In some cases,
one of the examiner may be from outside the institution and will be identified as
external examiner. The scheme of assessment may vary depending on the nature
VFSTR XXI
of practice, which shall be shared with student by the faculty in-charge. The
summative assessment will be conducted for a max. marks of 40. The general
scheme of assessment is given in Table (4).

VFSTR XXII
B.Sc.
Table-4: Suggested summative assessment pattern for P-based courses

3
Marks
Component
Examiner Examiner 2 Total
1
YEARS Objective and Procedure write up including 4 4 08
DEGREE PROGRAMME outcomes
Data collection and computation 4 4 08
Computation of results 4 4 08
Analysis of results and interpretation 4 4 08
Viva Voce 0 8 08
Total Marks 16 24 40
5.5 Assessment and Grading of MOOCs based elective:
Whenever a candidate opts for a course through MOOCS offered via Swayam
platform, he / she has to learn and undergo assessment as per Swayam norms.
Upon the declaration by Swayam, that the candidate has successfully completed
the course, the candidate is said to have earned the credits under credit
equivalence and credit transfer. The online course committee will also translate
the score awarded by Swayam into an equivalent grade in a scale of 10 for
incorporation by Dean AAA.
In case the candidate is unsuccessful, and then if the candidate has secured less
than 20% in the final examination conducted by Swayam, the candidate will be
placed into ‘R’ grade, and if it is ≥ 20%, then the candidate will be placed into ‘I’
grade. The online committee decides the equivalence score for formative
assessment for a max. of 60 based on both the scores he / she has earned in the
assessments and the final examination conducted by Swayam in case of ‘I’ grade.
Supplementary examination for ‘I’ grade will be conducted by VFSTR. The
candidate has to re-register for the same Swayam course or an alternative
Swayam course or may choose any other elective offered by the department in
place of MOOCs course in case he / she received a ‘R’ grade. However, a
candidate should register and undergo MOOCs offered via Swayam platform
course work for a min. of 4 credits.
5.6 Project
The students will carry out their project work in any one of the triple major courses
of his / her interest at VFSTR and submit their report which is a mandatory
requirement for the award of degree. These projects are usually done in groups
(not exceeding four students in a group), during the VI semester, under the
guidance of a faculty member. Every batch, in consultation with the supervisor,
should define the project and also the probable procedure of carrying it out and
submit the same to a committee consisting of 2 to 3 faculty members appointed
by Head of the Department. This is to avoid the repetition and also to come up
with a roadmap for completion of the project within the time stipulated. The
students are encouraged to select topics related to ongoing research and
consultancy projects. The students are expected to carry out and present a survey
of literature on the topic, work out a project plan and its implementation through
computation
/ modelling / simulation. They are also expected to exhibit system analysis, design,
presentation and evaluation skills. The entire process of grouping of student
batches, and identification of respective faculty supervisor etc., is to be completed
by the end of V semester, so that students can start of their project work
immediately after V semester.
5.6.1 Formative Assessment
The progress of project is reviewed twice in a module by the Project Review
Committee (PRC) and formative assessment marks are awarded based on these
VFSTR XXIII
 reviews. The Project review committee consists of
a) Head of Department or his / her nominee – Chairperson
b) A senior faculty member identified by the HoD – member
c) Project supervisor – member
Review schedules of PRC are to be announced by the department immediately
after the commencement of class work. The review presentations are open to all
the students of that

VFSTR XXIV
 section and attendance is compulsory. The first review should be of 15 minutes per B.Sc.

3
batch; the remaining reviews should be around 30 minutes per batch. Before every
review the batches should submit their PPT along with a brief report of not
exceeding two pages. It is to be expected by the committee that student presents
a research article in national / international conferences based on the project work YEARS
prior to graduation. The following aspects may be considered by the committee for DEGREE PROGRAMME
assessment Table (5).
Table-5: Schedule and suggested parameters to be considered for formative assessment

Review
Module Schedule Points to be considered Max. Marks
number
 Identification of specific area
out
of broad areas.
4th week First 4
 Identification of outcomes in
review
line
with programme objectives
Module -1  Feasibility of contributing to
the attainment of outcomes
Identification of software /

tools
requirements and training needs.
Secon
8th week  Understanding by 4
d
individual students on the
review overall aspect of the project
 Completion of literature
survey
 Design of project set up
 Data Acquisition / learning
of the tool / methods
required
Third  Readiness of the layout of
12th 4
revie the project report
week
w  Pro g r e s s re vi ew as
per
mechanism/ schedule
identified
Module -2  Individual student
contribution in above
activities.
 Presentation of results
and conclusions
 Meeting of objectives
defined in first review
Fourt  Submission of draft report
16th 4
h  Understanding by
week
revie individual students on the
w overall project
 Individual student
contribution
 Progress of project as
per schedule
5.6.2 Summative Assessment
At the end of the semester, during 18th to 20th week of the semester the
summative assessment will be conducted in two phases
Phase –I (during 18th -19th week): this is an evaluation for a max of 20 marks. A
committee of two members comprising of HoD’s nominee and supervisor will
assess the project work which will involve going through the project report (6

VFSTR XXV
marks), project presentation (7 marks) and demonstration of the project (7
marks).
Phase –II (during 20th week): A final presentation and defense assessment for a
max. of 20 marks will be carried out by one-man committee composed of an
external expert who is chosen by the Dean AAA from a panel of examiners
suggested by the HoD. The format for evaluation will involve going through the
project report’s quality (6 marks), presentation (6 marks) and interaction and
defense (8 marks).
The qualifying marks will be finalized considering the marks scored in both the phases (I and II)
of summative assessment.

VFSTR XXVI
B.Sc.

3
In case the candidate is placed in ‘I’ grade, he / she has to take both Phase-I and
Phase-II assessments, which will be held within the 15 days after declaration of
results. In the consecutive assessment also if the candidate fails to secure
YEARS minimum required score then he / she will be placed in ‘R’ grade.
DEGREE PROGRAMME 6. Semester-End Assessment Activities
Setting of summative assessment question papers will be coordinated by the lead
instructor assigned for a particular course. Two sets of question papers will be
submitted latest by 12th week of the semester.
6.1 There shall be ‘Summative Assessment Question Paper Scrutiny Committee’
which would be constituted with external experts. Experts are empowered to
modify / rephrase the questions to maintain a high standard of the semester-
end assessment. The review should be completed by the 14th week of the
semester. The review process will be coordinated by a committee of School
Dean, HoDs and external experts.
6.2 The question wise marks scored in the summative assessment out of a total
of 80 will be made available online within two weeks from the last date of
examination and would be kept active for 24 hours. Latest by the end of 48
hours from the instant of notification any candidate can submit an appeal
online providing question wise claim.
6.3 Claims for re-assessment on P-based courses are not allowed.
6.4 The appeals will be attended within next three working days. Fees for appeal, as
decided
from time to time, have to be remitted online along with the appeal.
6.5 Final results and grades will be computed as explained in the next section
6.6 Final results and grades shall be announced within four weeks of completion
of the last examination of the summative assessment (within two weeks from
the last date of appeal). Grades are published on the University website, and
also informed to the parents and students through SMS.
6.7 Provisional Grade cards will be issued within two weeks after the
announcement of grades. Grade card will contain three parts. Part 1: details
of successfully completed courses. Part 2: Details of ‘I’ grade courses. Part 3:
Details of ‘R’ grade courses.

7. Computation of Grading
7.1 Formative assessment decides the list of ‘R’- candidates. Therefore, these
candidates will not be considered for grading computation. Summative
assessments decide the list of ‘I’ candidates. Therefore, these candidates will
not be considered for grading computation
7.2 The candidates who have successfully completed both formative and
summative assessments will be considered for computation of relative
grading.
7.3 Threshold value (Th) for relative grading in each course is arrived after
studying the marks distribution in that course by the committee constituted
by Dean, AAA. The threshold value is decided by the upper bound marks of
the major chunk of the class keeping the top outlier scores away from
consideration (the least upper bound). The threshold value will be slightly
greater than upper bound marks or may be equal to the upper bound marks.
7.4 The total marks M = marks scored in the formative assessment + marks
scored in the summative assessment is transformed into relative grade
expressed accurate to two decimal places as follows:
Relative grade point (P) = (M / Th) × 10 [and limited to 10]
7.5 If students require course wise percentage equivalence, then the calculation will
be based
VFSTR XXVI
I
 on the following:
Course wise percentage equivalence = (M / Th)
× 100 [truncated to two-digit integer and
limited to 100]
7.6 After relative grading, a student is assigned a ‘Letter Grade (G)’ for each
course as per Table (6). The grade and the corresponding letter grade
represent the outcomes and assessments of a student’s performance in a
course.

VFSTR XXVII
I
 Table-6: Grading information

Relative Grading Range (P) Category Grade (G)

≥ 9.50 Outstanding O
≥ 8.50 to 9.49 Excellent S
≥ 7.00 to 8.49 Very good A
≥ 6.00 to 6.99 Good B
≥ 5.00 to 5.99 Fair C
≥ 4.00 to 4.99 Marginal D
Transitional Grade Repea R
t
Transitional Grade Incomplete I

8. Supplentary Examinations
8.1 The supplementary examinations shall be conducted once in summer semester.
Notifications will be released by the examination section informing the
students about registration procedures, details of fee and timetables. Apart
from these examinations the students who have courses with ‘I’-grade can
also write the supplementary examinations along with regular semester-end
examinations of that academic (Odd / Even) semester.
8.2 Whenever a candidate clears courses with ‘I’ grade in a supplementary
examination that are conducted during a regular semester, the Threshold
value for computing his / her grade will be obtained from the same batch in
which he / she had completed his / her formative assessment.
8.3 Whenever a candidate clears courses with ‘R’ / ‘I’ grade in a summer semester,
the Threshold value for computing his / her grade will be carry forwarded from
the preceding Odd / Even semester for the respective courses.
8.4 Whenever a candidate clears courses with a ‘R’ grade in a regular semester along with his
/ her junior batch then for this candidate the Threshold value will be
corresponding to his / her junior batch for computing grade.
9. Grade Point Average
The Academic Performance of a student is indicated every semester by the Semester Grade
Point Average (SGPA) and finally by Cumulative Grade Point Average (CGPA).
9.1 SGPA
The Semester Grade Point Average (SGPA) shall be computed using the formula given
below: n

SGPA =  i
Cipi
1 C
n
 i1 i

where
n = number of courses a student successfully completed in the semester under
consideration
p1 = Grade points secured for the ith course registered in the semester under
consideration.
c1 = the number of credits assigned to ith course registered in the semester under
consideration.
9.2 CGPA
The Cumulative Grade Point Average (CGPA) shall be computed after successful
completion of the programme. The CGPA shall be expressed in B. Sc.
accordingly, the computations will be as below:
 m
1

j
CGPA = m
VFSTR
j
 XXIX
Cjpj C
J

B.Sc.

3 YEARS
DEGREE PROGRAMME

VFSTR XXX
B.Sc.

3
where
m= total number of courses prescribed for the completion of the
YEARS programme Cj = the number of credits assigned to the jth course
p = grade points secured in the jth course.
DEGREE PROGRAMME 1
∑ Cj = 120 for CGPA calculations in case of B. Sc.
∑ Cj = 80 for CGPA calculations of M. Sc.
Percentage equivalence of SGPA and CGPA = (SGPA or CGPA) × 10

10. Award of Class

The students who have become eligible for award of degree shall be classified
based on their CGPA secured, as per the Table (7) given below:
Table-7: Class / Division Information

Sl. CGPA Class / Division

No.
1 8.0 and above Fir2 Class with Di2inction
2 6.5 and above but less than 8.0 Fir2 Class
3 6.0 and above but less than 6.5 Second Class
4 Less than 6.0 Pass Class

a) For the purpose of rewarding the accomplishers with ranks and awards, toppers
are identified
based on their academic performance (CGPA) in B. Sc.
b) In addition, the ‘Chairman’s gold medal’ and other ‘Endowment Awards’ are
awarded to the ‘outstanding students’ based on the overall performance
which includes academic, co- curricular and extra-curricular activities, campus
placements and competitive examinations. A committee appointed by the
Vice-Chancellor will recommend the eligible student for the award, selected
from the nominations received from the departments.
c) In addition, the institution may recognize exceptional performance such as
music, dance, sports etc. and display of exceptional bravery from time to
time.
d) The candidates who complete 120 credits in the first 6 successive semesters shall
be eligible
to receive awards / ranks in B.Sc.
e) The candidates availing spillover semesters will not be eligible for the award
of merit scholarships.
11. Award of Degree
On successful completion of prescribed requirements of the programme, the degree
shall be conferred during the convocation of the VFSTR.
For the conferment of degree, the student has to fulfill the following requirements:
a) a bonafide student undergone the B.Sc. course work of not less than three
academic years and not more than five academic years from the date of
joining.
b) successfully completed all the courses as prescribed in the respective
curriculum.
c) acquired a minimum eligible credits i.e. 120 credits for the award of B. Sc.
degree.
d) obtained no due certificates as prescribed by VFSTR.
VFSTR XXXI
 e) no indisciplinary proceedings pending against him / her
Consequent upon being convinced, following an enquiry, the Academic council
may resolve to withdraw the degree / diploma / any other certification provided by
the institute. The aggrieved may however prefer for a review of such decision by
the Academic Council, citing cogent reasons for review or go in for an appeal to
the, BoM of the institute.

VFSTR XXXII
 B.Sc.

3
12. Lateral Exit Options
12.1 Honorable exit with suitable Certificate or Diploma
In line with NEP-2020, an optional exit is provided for a candidate at the end of YEARS
2nd semester and 4th Semester of B.Sc.
DEGREE PROGRAMME
An Undergraduate certification will be awarded in Mathematics, Statistics and Computer Science
provided the candidate has earned min. of 40 credits and completed two semester of study.
An under graduate Diploma will be awarded in Mathematics, Statistics and
Computer Science provided the candidate has earned min. of 80 credits and
completed 4 semester of study.

Year Year Year (Sem) Year

(Sem) (Sem) (Sem)
1(1) 1(2) 2(1 2(2)
)

EXIT 1 EXIT 1:
Minimum 40 CREDITS Minimum 80 CREDITS
Under graduate certificate in Under graduate Diploma in
Science Science

Figure 5: Lateral Exit Options

In case the candidate fails to earn minimum credits within the spillover period, a suitable
certification will be awarded during his / her exit from B.Sc. degree.
Semester-wise transcript and a consolidated transcript will be given to the
candidates during their exit from the registered program. Such a candidate who
has exited can seek re-entry to complete B.Sc. by surrendering the UG
certification / UG Diploma. A committee constituted by Vice-Chancellor will
scrutiny all such re-entry requests and recommend the plan of action. However,
the maximum programme duration for B. Sc. should be limited to five years,
whereas for onward continuation to M. Sc., with two additional years as spillover,
the maximum duration is limited to four years and further extension beyond the
stipulated maximum duration of study has to be approved by Academic Council, if
the candidate appeals for an extension.
12.2 Volunteer ‘Drop’ with Sabbatical Semester option
A candidate may exercise his option to voluntarily exit from B. Sc. Programme
temporarily for a semester during the B. Sc. Programme, utilizing the drop option.
The drop can be exercised to take up special internship / innovation / exploratory /
entrepreneurship / advanced research
/ start-up and such related activities. Under such circumstances a candidate can
normally avail drop over two successive semesters. Such ‘drop’ semester will be
identified as sabbatical semesters.
Such a candidate has to pay the regular semester fee if such a drop option is
utilized during the first 6 semesters of B. Sc., and has to pay a nominal semester
maintenance fee during the spillover period, if a candidate has not yet completed
the credit requirements.
Upon returning from such a temporary exit, a candidate may continue his B. Sc.
studies utilizing the provision of spillover period. A candidate may also submit a
claim for credit equivalence for the activities undertaken during the drop period.
The equivalence committee would evaluate and assess the academic equivalence
of the work carried out and would recommend the credit equivalence and credit
transfer to be granted together with the grades that could be attributed, if
applicable. However, the maximum duration of programme should be limited to
five years and further extension beyond the stipulated maximum duration of
study has to be approved by academic council, if the candidate appeals for an
extension.
VFSTR XXXI
II
12.3 Volunteer ‘Drop’ with Semester Drop option
A candidate may exercise his option to voluntarily exit from B.Sc. programme
temporarily for a semester during the B.Sc. programme, utilizing the DROP option
to meet the family / personal exigencies. All the norms as mentioned in the above
section 12.2 shall be applicable for the candidates utilizing semester drop option.

VFSTR XXXI
V
B.Sc.

3
13. Interpretation of Rules
a) The academic rules and regulations should be read as a whole for the purpose
of any interpretation.
YEARS
b) For the matter(s) NOT covered herein above or for unforeseen circumstances,
DEGREE PROGRAMME but arising during the course of the implementation of the above regulations.
The Vice-Chancellor shall be authorized to remove the difficulties and decide
upon the matters. The same shall be reported in the next meeting of Academic
Council for ratification and subsequently informed to BoM.
c) The Institution may change or amend the academic rules and regulations or
curriculum at any time, and the changes or amendments made shall be
applicable to all the students with effect from the dates, notified by the
Institution.
d) Procedure and explanation to any section can be floated by the office of Dean
AAA as
applicable from time to time with due approval by the chairperson of Academic
Council.

VFSTR XXX
V
VFSTR XXXV
I
 B.Sc.
Annexure - II
Supplement Regulations for 3 YEARS
DEGREE PROGRAMME
Pursuing
Dual B.Sc. + M.Sc. Degree

The proposal to institute M. Sc. in line with the practices in Institutions of National
Importance, is to elevate the Gross Qualification Index (GQI) of India, and specifically to
enhance the data analysis expertise of the graduates.

In order to attract the committed learners towards earning M. Sc. immediately after B. Sc. the following
scheme is proposed:

1. He / she should be a candidate maintaining his / her studentship through proper

registration process of B. Sc. program and fulfills all the credit requirements of B.
Sc. and secure a minium of 6 CGPA by the ned of 6th semester.

2. He / she has to appear for an aptitude test / interaction and the corresponding
committee of experts constituted for the purpose has to recommended his / her
name.

3. The study pattern will be as follows:

M. Sc. Semester Count Credits Expected Study Coverage

20 credits of Professional
I/I 20
Core and Interdisciplinary
courses
1. 17 credits of Professional
Core and Interdisciplinary
I / II 20
courses
2. 3 credits of Mini Project /
Intern- ship
1. 16 credits Professional Core
and
II / I 20
Interdisciplinary courses
2. 4 credits of MOOCS /
Minor Project
1. 12 credits of Major Project
II / 20
2. 8 credits of Electives
II

4. The candidate should earn all the credits of the B. Sc. program before commencing the
M. Sc. program. The program structure designed for M. Sc. will be followed from
VII semester onwards, which will precisely corresponds to I semester of M. Sc.
and onwards.
 B. Sc. degree = 120 credits
 M. Sc. degree = 80 credits

5. Honourable exit option:

 Candidate who has earned all the credit requirements till first year (40
credits) of M. Sc. can exercise his / her option to exit the program with a B.
Sc. honours degree provided he / she has fulfilled the credits requirement
VFSTR XXX
VII
 of B. Sc. as prescribed by VFSTR.
 However, candidates with B. Sc. degree from other institutes, opt to exit at
the end of 2nd semester of M. Sc., will be awarded PG diploma provided he
/ she fulfills the credit requirements till the end of 2nd semester.

VFSTR XXXV
III
 Annexure - III
Inter - Institute Credit Transfer

Students pursuing an undergraduate programme in other recognized Higher Education

Institute (HEI) could be admitted into VFSTR without appearing for the entrance exam
to continue their studies, subject to the approval by a committee constituted by Vice-
Chancellor. In this case, the student shall furnish the transcripts or grade cards, syllabus
copies, educational certificates, and other relevant documents while applying for
admission. The committee constituted by Vice-Chancellor, will establish the equivalency
based on the marks / credits obtained in the courses in the previous institute by following
the admission policy as mentioned below.
Procedure :

 Admissions are only at the beginning of an academic year and depend on availability
of vacancies in the respective program.
 The courses studied by the candidates elsewhere will be mapped with the courses
offered by VFTSR and the committee may suggest for study of additional courses for
maintaining credit equivalency or for satisfying pre-requisites. The committee may
also recommend the plan of study for the courses identified.
 After admission, the student has to submit the following documents
• Migration certificate
• Grade card / Marks Memo
• "No objection certificate (NOC)" from the concerned Institute / University where the
candidate
completed part of the programme.
 Provisional admission of the candidates will be confirmed only after verification of
the authenticity of the certificates from the concerned authorities.
 Min. 50% of the credits have to be earned at VFSTR.
 Courses which are completed by the candidate in the previous institute will be
transferred as rec- ommended by the equivalence committee under credit cum
grade transfer. Inclusive these credits the candidate has to complete the credit
requirements as per VFSTR.
 Consolidated grade card / transcript will clearly show the credits under credit
transfer and corre- sponding CGPA and credits earned in VFSTR and corresponding
CGPA. Over all CGPA may also be indicated.
Extension :
VFSTR candidates may also be permitted to earn credits up to max of 20% by the way of
credit transfer from taking up the courses from other institutes of repute.

VFSTR XXXI
X
VFSTR XL
 B.Sc. TABLE OF
CONTENTS
Page
Numbers
Foreword
VFSTR - Vision & Mission
Vision & Mission
PEO’s, PSO’s and PO’s
Curriculum Structure
Course Contents
I YEAR I SEMESTER 11
22BS10 Technical English Communication 13
1
22BS10 Calculus 16
2
22BS10 Descriptive Statistics and Probability Distributions 18
3
22BS10 Programming in C 20
4
22BS10 IT Workshop 30
5
I YEAR II SEMESTER
22BS10 Digital Logic & Computer Organisation 33
7
22BS10 Algebra 36
8
22BS10 Mathematical Expectation and Probability Distributions 38
9
22BS11 Data Structures 40
0
II YEAR I SEMESTER
22BS20 English Proficiency and Communication skills 47
1
22BS20 Discrete Mathematicakl Structure 49
2
22BS20 Statistical Methods 51
3
22BS20 Database Management Systems 53
4
22BS20 Object Oriented Programming 55
5
22BS20 Environmental Science 59
6
II YEAR II SEMESTER
22BS20 Business English Communication – I 61
8
22BS20 Business English Communication (BEC) II 63
9
22BS21 Differential Equations 65
0
22BS21 Statistical Inference 67
1
22BS21 Operating Systems 69
2
22BS21 Design and Analysis of Algorithms 72
3
III YEAR I SEMESTER
22BS30 Linear Algebra 77
1
22BS30 Real Analysis 79
2
22BS30 Sampling Techniques 81
3
22BS30 Econometrics 83
4
22BS30 Computer Networks 85
5
22BS30 Cyber Security 87
6
22BS30 Software Engineering 89
7

VFSTR XLII
III YEAR II SEMESTER
*Mathematics Elective
*Statistics Elective
*Computer Elective
22BS30 Project
8
SEMESTER ELECTIVE POOLS
22BS80 Analytical Geometry 95
1
22BS80 Graph Theory 97
2
22BS80 Numerical Analysis 99
3
22BS80 Complex Analysis 10
4 1
22BS80 Number Theory 10
5 3
22BS80 Integral Transforms 10
6 5
22BS81 Design of Experiments 10
1 7
22BS81 Statistical analysis through SPSS/R 10
2 9
22BS81 Advanced Probability 11
3 1
22BS81 Operations Research 11
4 3
22BS81 Applied Statistics 11
5 5
22BS82 Formal Languages and Automata Theory 11
1 7
22BS82 Machine Learning 12
2 1
22BS82 Web Technologies 12
3 4
22BS82 Python Programming 12
4 7
 FOREWORD

The vital aspect of B.Sc. program is to analyse and interpret data sets to
build predictive models. This requires essentially mathematical skills to
process large amount of data, statistical skills to interpret meaningful
insights from the data and programming skills to organize unstructured data,
identify data patterns, access the data, retrieving the data in a required
format and handling complex and challenging large datasets. BSc graduates
acquire these skills through their course of study.

R22 Curriculum enables our students to start with the basics of mathematics,
statistics and introductory programming courses. Further, they learn the
mathematical foundations of computing; get hands-on experience in
programming and pursue advanced courses such as Artificial Intelligence,
Machine Learning, Big Data & Analytics and much more.

The Board of Studies of B.Sc. Programme consists of a right mix of eminent

personalities from Academic, Research and Industry Organizations, besides
experienced faculty members of the University.

External BoS Members:

1. Prof. Y. N. Reddy, Professor, Department of CSE, NIT Warangal.

2. Dr. ED. Boobalan, Data Scintist, ZakApps software pvt ltd., Chennai, India

I thank all the BOS members, Academic Council Members and University
authorities for their continuous support and encouragement towards design
of this innovative curriculum for B.Sc.

Dr. P.L.N.Varma,
HoD, Department of
Mathematics VFSTR Deemed
to be University
VISION
To evolve in to a centre of excellence in Science &
Technology through creative and innovative practices in
teaching-learning, towards pro- moting academic
achievement and research excellence to produce
internationally accepted, competitive and world class
professionals who are psychologically strong and emotionally
balanced imbued with social consciousness and ethical
values.

MISSION
To provide high quality academic programmes, training
activities, research facilities and opportunities supported by
continuous industry- institute interaction aimed at promoting
employability, entrepreneurship, leadership and research
aptitude among students and contribute to the economic and
technological development of the region, state and nation.
.
 B.Sc. (Mathematics, Statistics and Computer Science)
Programme Educational Objectives (PEOs)
PEO1: Graduates will pursue higher studies in related fields including management
PEO2: Graduates will perform as employers in private/government institutions rising up to top positions
PEO3: Graduates will become entrepreneurs

Programme Specific Outcomes (PSOs)

PSO1: Graduates will acquire a comprehensive knowledge and sound understanding of fundamentals of
Mathematics, computer and statistics and develop practical, analytical and mathematical skills

PSO2: Graduates will be prepared to acquire a range of general skills, to solve problems, to
evaluate informa- tion, to use computers productively, to communicate with society
effectively and learn independently.

· Graduates will acquire a job efficiently in diverse fields such as Science , Education, Banking,
Public
Services, Business etc.,

Programme Outcomes (POs)

PO1: Understanding and Thinking: understanding of mathematical concepts and concerned
structures, and should be able to follow the basics of logic to accurate the studies and
make a valid conclusion and looking at our ideas and decisions (intellectual,
organizational, and personal) from different per- spectives.

PO2: Effective Communication: Speak, read, write and listen clearly in person and through
electronic media in English and in one Indian language, and make meaning of the
world by connecting people, ideas, books, media and technology.

PO3: Design and Application: Select, design and apply appropriate experiment techniques along with
IT
tools to solve various problems.

PO4: Ethics: Recognize different value systems including your own, understand the moral dimensions of
your decisions, and accept responsibility for them.

PO5: Environment and Sustainability: Understand the issues of environmental contexts and sustainable
development.

PO6: Self-directed and Life-long Learning: Acquire the ability to engage in independent and life-long
learning
in the broadest context socio-technological changes.
B.Sc.
Annexure - I
3 YEARS
DEGREE PROGRAMME
R-22 CURRICULUM
(Applicable for students admitted into First Year from academic year 2022-23 onwards)

I Year I Semester (Semester I)

Subject Course
Course Title L T P C Offered by
Code Category
Technical English
22BS10 2 2 2 4 Humanities English
Communication
1
22BS10 Calculus 3 2 0 4 Core Mathematics
2
Descriptive Statistics and
22BS10 3 0 2 4 Core Stati2ics
Probability Distributions
3
Comput
22BS10 Programming in C 2 0 4 4 Core
er
4
Science
Comput
22BS10 IT Workshop 0 2 4 3 Life Skills
er
5
Science
Sports and Physical
22BS10 3 1 Binary Grade
Fitness/ NCC/NSS
6
Total Credits 10 6 15 20
31 hr

I Year I/II Semester (Semester 1/2 )

Subject Course
Course Title L T P C Offered by
Code Category
22BS112 Oriental Session 1 4 3 Binary Grade SA

I Year II Semester (Semester 2)

Subject Course
Course Title L T P C Offered by
Code Category
Digital Logic & Computer Comput
22BS10 3 0 2 4 Core
Organization er
7
Science
22BS10 Algebra 3 2 0 4 Core Mathematics
8
Mathematical
22BS10 3 0 2 4 Core Stati2ics
Expectation and
9
Probability Distributions
Comput
22BS11 Data Structures 2 2 2 4 Core
er
0
Science
Sports / Physical fitness /
22BS11 3 1 Binary Grade
Games
1

vi
 Total Credits 10 6 9 17
25 hr

L : Lecture Hours/week ; T : Tutorial Hours/week ;

P : Practical Hours/week ; C : Credits of the Course

vii
 B.Sc.
R-22 CURRICULUM
(Applicable for students admitted into First Year from academic year 2022-23 onwards)
3 YEARS
DEGREE PROGRAMME

II Year I Semester (Semester 3)

Subject Course
Course Title L T P C Offered by
Code Category
English Proficiency and
22BS201 0 2 2 2 Humanities English
Communication skills
Discrete Mathematical
22BS202 3 2 0 4 Core Mathematics
structures
22BS203 Statistical Methods 3 0 2 4 Core Stati2ics
Database Management Comput
22BS204 3 0 2 4 Core
Systems er
Science
Object Oriented Program- Comput
22BS205 3 0 2 4 Core
ming er
Science
22BS206 Environmental Science 0 1 1 1 Applied Science Chemi2ry
NCC / NSS / SAC / Paper
22BS207 presentation / Social 0 0 2 0 Binary Grade
Activities
Total Credits 12 05 11 19
28 hr

II Year II Semester (Semester 4)

Subject Course
Course Title L T P C Offered by
Code Category
Business English
22BS208 0 2 2 2 Humanities English
Communi-
cation – I
Business English
22BS209 0 2 2 2 Humanities English
Communi-
cation II
22BS210 Differential Equations 3 2 0 4 Core Mathematics
22BS211 Statistical Inference 3 0 2 4 Core Stati2ics
Comput
22BS212 Operating Systems 3 0 2 4 Core
er
Science
Design and analysis of Comput
22BS213 3 0 2 4 Core
algorithms er
Science
NCC / NSS / SAC / Paper
22BS214 presentation / Social \ 0 0 2 1 Binary Grade
Activities
viii
Total Credits 12 06 12 21
30 hr

ix
B.Sc.

3
R-22 CURRICULUM
(Applicable for students admitted into First Year from academic year 2022-23 onwards)
YEARS
DEGREE
PROGRAMME

III Year I Semester (Semester 5)

Subject Course
Course Title L T P C Offered by
Code Category

22BS30 Linear Algebra 3 2 0 4 Core Mathematics

1
22BS30 Real Analysis 3 2 0 4 Core Mathematics
2
22BS30 Sampling Techniques 2 0 2 3 Core Stati2ics
3
22BS30 Econometrics 2 2 0 3 Core Stati2ics
4
22BS30 Computer Networks 3 0 2 4
5
22BS30 Cyber Security 2 2 0 3
6
22BS30 Software Engineering 2 2 0 3
7
Total Credits 17 10 4 24

31 hr

III Year II Semester (Semester 6)

Subject Course
Course Title L T P C Offered by
Code Category
Mathematics Elective I 3 2 0 4 Elective Mathematics

Statistics Elective II 3 0 2 4 Elective Stati2ics

Comput
Computer Elective III 3 0 2 4 Elective
er
Science
Mathematics /
22BS308 Project 2 6 4 Project Stati2ics /
Com- puter
Science
Total Credits 9 4 10 16
23 hr

* Candidate can also acquire a maximum of 4 credits through MOOCS (Swayam Based
NPTEL)
which can be considered equivalent to one of the electives.

x
xi
 B.Sc.

3
R-22 CURRICULUM
(Applicable for students admitted into First Year from academic year 2022-23 onwards)
YEARS
DEGREE PROGRAMME

Odd Semester Elective Subject Even Semester Elective Subject

Pools Code Pools Code
MATHEMATICS
Analytical Geometry 22BS801 Complex Analysis 22BS804
Graph Theory 22BS802 Number Theory 22BS805
Numerical Analysis 22BS803 Integral Transforms 22BS806
STATISTICS
Design of Experiments 22BS811 Operations Research 22BS814
Stati2ical analysis through
22BS812 Applied Stati2ics 22BS815
SPSS/R
Advanced Probability 22BS813
COMPUTER SCIENCE
Formal Languages and
22BS821 Web Technologies 22BS823
Automata Theory
Machine Learning 22BS822 Python Programming 22BS824

xii
 I
Y E A R

B.S
c. I SEMESTER
 22BS101 - Technical English Communication
22BS102 - Calculus


Descriptive Statistics and Probability

22BS103 - Distributions

 22BS104 - Programming in C
 22BS105 - IT Workshop
 22BS106 - Sports / Physical fitness / Games
 22BS112 - Oriental Session

IISEMESTER
 22BS108 - Algebra
Mathematical Expectation and Probability
 22BS109 - Distributions
 22BS110 - Data Structures

22BS107 - Digital Logic & Computer Organization
 22BS111 - Sports / Physical fitness / Games

COURSE CONTENTS
I SEM & II SEM

xiii
VFSTR
 B.Sc - I Year I Semester

22BS101 TECHNICAL ENGLISH

COMMUNICATION
Hours Per Week :

L T P C
2 2 2 4

PREREQUISITE KNOWLEDGE: Basic sentence formation. understanding contextual meanings,

basic writing skills and moderate fluency in English.
COURSE DESCRIPTION AND OBJECTIVES:
In this course students will read, analyze, and interpret material from technical and
general fields, and practice reading, writing, listening and speaking skills to gain exposure
and functional English on a variety of contemporary topics. The overall course objective is
to provide English for Specific Purposes (ESP) instruction to enhance students’ reading,
writing, listening and speaking skills through a practice in the language. It will aim to
build students’ confidence and motivation through exposure to academic skills like Note
making/taking, Paraphrasing, Summarizing, Report Writing, Making Presentations etc.,
so as to generate interest in the language from an ESP perspective. Finally, students are
expected through the course to gain key strategies and expression for communicating
with professionals and non-specialists

MODULE-1
UNIT – 1 [8L+8T+8P=24 Hours]
GENETICS
Reading: Reading for Note Making Sub skills: Reading for global understanding
(skimming), specific information (scanning), understanding main ideas and supporting
ideas, guessing contextual meanings from the text. -Vocabulary building: commonly used
roots, prefixes, and suffixes.
Writing: Note making, organizing main points and sub points, numbering and sequencing,
suggesting titles, paraphrasing and summarizing. Functional grammar: Common Errors in
Articles and Prepositions (Handout)
Listening: Listening for Note Taking: top down and bottomup approach, listening for main
ideas and supporting points.
Speaking: Presentation in teams - ideas on the topic summarized, making a PPT, effective
introductions and conclusions, logical organization of content, using appropriate
structure and cohesive devices
UNIT – 2: [8L+8T+8P=24 Hours]
ALIENS
Reading: Reading: predicting, skimming, scanning, reading for inference, extrapolative reading
Vocabulary building: Academic vocabulary from the text: synonyms, antonyms, Words often confused
Writing: Paragraph writing; writing a topic sentence, supporting sentences, effective
introductions and conclusions, use of cohesive devices. Types of Paragraphs:
Descriptive, narrative, argumentative and expository. Functional grammar: Common
Errors in Verb forms and Conditional sentences (Handout
Listening: Listening for identifying parts from a description, listening to and sorting
information, listening for specific information.
Speaking: Narrating/Retelling an incident, using suitable cohesive devices/discourse
markers Speaking of past and present habits/ activities/events - Speaking of future
plans.
PRACTICES:
● Note making

VFSTR 13
 B.Sc - I Year II Semester
● Summarizing
● Paragraph Writing
● Error correction and Restructuring
● Vocabulary building
● Listening comprehension
● Note taking

VFSTR 14
 B.Sc - I Year I Semester

SKILLS:
MODULE-2
UNIT
Apply different sub skills like skimming, scan- ning, – 1: for information, reading for inference etc.
reading [8L+8T+8P=24 Hours]
to understand different kinds of text.
SOCIAL
Apply different sub skills like top down, bottom-up approachesMEDIA – HEALTH AND NUTRITION
to listening.
Use functional vocabulary relevant to engineeringReading:
and technology to expressfor
Reading ideasfactual
lucidly. information researching for supporting evidence - skimming,
Use appropriate sentence struc- ture, cohesive devices to construct simple text in regular correspondence like e-mails and letters.
scanning,
Vocabulary building: One-word substitutes.
Writing: Letter Writing - E-mail writing – New age communication – Format, protocol, and
style- WhatsApp, Facebook and Twitter Functional grammar: Common Errors in Sub-Verb
Agreement and Modals
Listening: Listening to a Business Presentation: Listening for deducing information, for abstract
details
and specific details, listening for taking a message.
Speaking: Making a presentation with a PPT on a topic assigned- organizing the
presentation using appropriate discourse markers - presenting a point of view -
Extempore.

UNIT – 2: [8L+8T+8P=24 Hours]

FASHION
Reading: Reading for data interpretation and information transfer from graphical aids to
text reports (pictograms. tables, graphs, pie charts, flow charts), deducing specific
information and general information
-Vocabulary building: business vocabulary, collocations, idioms and phrasal verbs
Writing: Writing a Report: Drafting general and factual reports - writing an overview - an
effective introduction - organizing information into paragraphs (Stages of writing:
planning /organizing /writing / editing /rewriting) - Functional grammar: transformations
and miscellaneous common errors
Listening: Listening to a Ted talk and sorting information – taking notes from a discussion.
Speaking: Group Discussion – prerequisites -generating content - initiating a discussion -
expressing one’s opinion ~ leading a discussion - agreeing/ disagreeing to someone’s
view - cutting into a speech
- body language and voice modulation.

PRACTICES:
● E-mail writing
● Letter writing
● Report writing
● Messaging in social media
● Extempore
● Making PPTs

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
apply a variety of strategies to
1 interpret and comprehend spoken Apply 1 2,
texts/ discourse using contextual 6
clues
apply appropriate reading strategies to
2 interpret content / material related to Apply 1 2,
engineering and technology domain 6
possess an ability to write clearly on topics
3 Analyze 1, 2 2,
related to science and technology and
6
communication
VFSTR 15
 B.Sc - I Year II Semester
choose functional language, grammar
4 structures, cohesive devices and skills of Evaluate 1, 2 2,
organization to express clearly in speaking 6
participate in discussions and make short
5 Create 2 2,
presentations on general and technical topics
6

VFSTR 16
 B.Sc - I Year I Semester

LANGUAGE LAB ACTIVITIES

Session – 1: Dictionary
Skills
Session – 2: Introduction to Phonetics and Identifying
Phonemes Session – 3: Pronunciation Practice (Commonly
mispronounced words) Session – 4: Rosetta Stone (Exercises
on LSRW)
Session – 5: Listening Comprehension (Summarising exercise on a
Ted Talk Session – 6: Technical Presentations (Individual)
Session – 7: Technical Presentations
(Team) Session – 8: TOEFL Mastery

TEXT BOOKS:
1. N P Sudharshana & C Savitha, “English for Technical Communication”, Cambridge University
Press, 2016.
2. Ashraf Rizvi M, “Effective Technical Communication”, 2nd Edition, McGraw Hill
Education, 2017.

REFERENCE BOOKS:
1. Balasubramanian T, “A Text book of Phonetics for Indian Students”, Orient
Longman, New Delhi, 1989.
2. Krishnaswamy, N and Sriraman, T, “Current English for Colleges”, Trinity publications, 2016.
3. Mohan Krishna and Meera Banerjee, “Developing Communication Skills”,
Macmillan India Ltd. New Delhi, 1990.
4. Narayanaswamy V R, “Strengthen your Writing”, Third Edition Orient Black Swan, New Delhi,
2005.
5. Naterop, Jean, B. and Rod Revell, “Telephoning in English”, Cambridge University
Press, Cambridge, 1997.

VFSTR 17
 B.Sc - I Year II Semester

VFSTR 18
 B.Sc - I Year I Semester

22BS102 CALCULUS

Hours Per Week :

L T P C
3 2 0 4

PREREQUISITE KNOWLEDGE: Elementary calculus, introductory knowledge on differentiation and

integration.

COURSE DESCRIPTION AND OBJECTIVES:

The primary learning goals of this course are to expose the students to some basic
notions in differential calculus. By the time students complete the course, they realize
wide ranging applications of this subject in various fields such as medical, mathematical,
engineering sciences, industries and other real time environments.

MODULE–1
UNIT-1 [12L+8T+0P=20 Hours]

DIFFERENTIABILITY AND EXPANSION OF FUNCTIONS

Notion of convergence of sequences and series of real numbers, - definition of limit and
continuity of a real valued function; Differentiability and its geometrical interpretation;
Rolle’s theorem, Lagrange’s mean value theorem, Cauchy’s mean value theorem.
Successive differentiation and Leibnitz theorem, Maclaurin’s and Taylor’s theorems for
expansion of a function, Expansions of exponential, logarithmic and trigonometric
functions.

UNIT-2 [12L+8T+0P=20 Hours]

APPLICATIONS OF DIFFERENTIATION
Applications of differentiation, Rolle’s theorem, Lagrange’s mean value theorem,
Cauchy’s mean value theorem, Leibnitz theorem, Maclaurin’s theorems and Taylor’s
theorems in real time environments.Bi polar junction transistor- operation, types (NPN &
PNP)

PRACTICES:
● Justification of continuity of functions
● Justification of convergence of functions
● Differentiation of simple functions
● Expansions of functions in the required form.

MODULE–2
UNIT-1 [12L+8T+0P =20Hours]
PARTIAL DERIVATIVES AND INTEGRALS
Limit, continuity and first order partial derivatives, Higher order partial derivatives,
Change of variables, Euler’s theorem for homogeneous functions, Taylor’s theorem,
Total differentiation and Jacobians.
Definite integral of functions of one variable, reduction formulae, Double integration
over rectangular and nonrectangular regions, Double integrals in polar co-ordinates.
UNIT-2 [12L+8T+0P =20Hours]
APPLICATIONS OF INTEGRALS

VFSTR 16
 B.Sc - I Year II Semester
General applications of double and triple integrals in science, engineering technology
and real time environments

VFSTR 17
 B.Sc - I Year I Semester

PRACTICES:
SKILLS:
● Evaluating line integrals. Realize im- portance and applications of Gr
Master the di- mension formula and theorem
● Evaluating area integrals. Learn the theory of determinants and put th
● Evaluating volume integrals. Calculate simple integrations
Calculate simple area integrations
● Applications of double integrals in various real time problems. Calculate
● Applications of triple integrals in various real time problems. volume of given solids.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Calculate the limit and examine the
1, 2, 4, 5, 9,
1 continuity and understand the geometrical Apply 1
10, 12
interpretation of differentiability.
Apply the consequences of various mean
2 Apply 1 1, 2, 5, 9, 10
value theorems.
Apply conceptual variations while advancing 1, 2, 3, 5, 9,
3 Apply 2
from one variable to several variables in 10
calculus.
Apply the concepts of Inter-relationship
1, 2, 5, 9,
4 amongst the line integral, double and Apply 2
10,
triple integral formu- lations.
12
Draw curves in Cartesian and polar 1, 2, 5, 9,
5 Apply 2
coordinate systems. 10,
12

TEXT BOOKS:
1. S. Narayanan, T. K. Manicavachagom Pillay, Calculus V.1, Viswanathan, S., Printers
& Publishers Pvt Ltd, 2009.
2. N. P. Bali, Vector Algebra, Golden Series, Laxmi Publications, 2020.

REFERENCE BOOKS:
1. Howard Anton, I. Bivens & Stephan Davis (2016). Calculus (10th edition), Wiley India.
2. Gabriel Klambauer (1986). Aspects of Calculus. Springer-Verlag.
3. Gorakh Prasad (2016). Differential Calculus (19th edition). Pothishala Pvt. Ltd.
4. Gorakh Prasad (2016). Integral Calculus.

VFSTR 18
 B.Sc - I Year II Semester

VFSTR 19
 B.Sc - I Year I Semester

22BS103 DESCRIPTIVE STATISTICS AND

PROBABILITY
Hours Per Week :

L T P C
3 0 2 4

PREREQUISITE KNOWLEDGE: Basic knowledge in mathematical calculations

COURSE DESCRIPTION AND OBJECTIVES:

It provides the foundation to the students on elementary topics of Statistics and prepares
them to describe the given data. The students try to know and measure the chance of
happening different events and their occurrence numerically. Students understand how
probability has been distributed to the different events and standard notions of
probability distributions.

MODULE–1
UNIT-1 [12L+0T+8P = 20 Hours]

DATA COLLECTION AND STATISTICAL AVERAGES

Introduction to Statistics: Concepts of Primary and Secondary data. Methods of
collection and editing of primary data, Secondary data. Graphical Representation,
Designing a questionnaire and a schedule.
Measures of Central Tendency: Mean, Median, Mode, Geometric Mean and Harmonic Mean.
UNIT-2 [12L+0T+8P = 20 Hours]
MEASURES OF DISPERSION AND MOMEMNTS
Measures of Dispersion: Range, Quartile Deviation, Mean Deviation and Standard Deviation.
Moments: Central and Non-Central moments and their interrelationship. Sheppard’s correction for
moments. Skewness and kurtosis.

PRACTICES:
● Various graphical presentation techniques
● Measures of central tendency
● Calculation of variations
● Computation of Non-central moments
● Moments about mean
● Karl Pearson’s coefficient of skewness

MODULE–2
UNIT-1 [12L+0T+8P = 20 Hours]
PROBABILITY
Introduction to Probability: Basic Concepts of Probability, random experiments, trial,
outcome, sample space, event, mutually exclusive and exhaustive events, equally likely
and favorable outcomes. Mathematical, Statistical, axiomatic definitions of probability.
Conditional Probability and independence of events. Probability theorems: Addition and
multiplication theorems of probability for 2 and for n events. Boole’s inequality and
Baye’s theorems and problems based on Baye’s theorem.
UNIT-2 [12L+0T+8P = 20 Hours]
RANDOM VARIABLES
Univariate Random Variables: Definition of random variable, discrete and continuous
VFSTR 20
 B.Sc - I Year II Semester
random variables, functions of random variable. Probability mass function. Probability
density function, Distribution function and its properties.

VFSTR 21
 B.Sc - I Year I Semester

Bivariate Random Variables - meaning, joint, marginal and conditional Distributions,

SKILLS:
independence of random variables. Collect the data from various data sources
Draw suitable graphs for statis- tical data
PRACTICES: Assess the chance of hap- pening of events
Fit an appropri- ate probability distribution f
● Estimate the probability of different types of events
● Obtain the conditional probabilities
● Applications of addition and multiplication theorems
● Applications of Bayes theorem
● Measure the chance of uncertainty of random variables.
● Calculate the probabilities of marginal distributions from joint distributions

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Use statistical averages and dispersion
1 Apply 1 1,2
methods to study the characteristics of
the data
Apply descriptive statistics tools in data
2 Apply 1 1,2
collection
and describing data.
Apply probability in real time situations and
3 Apply 2 1,2,3
identi- fy randomness in experiments
4 Calculate moments for random variables Analyze 1,2 1,2
5 Estimate bivariate random variables Evaluat 2 1,2,3,5
probabilities e

TEXT BOOKS:
1. V. K. Kapoor and S. C. Gupta, Fundamentals of Mathematical Statistics, Sultan
Chand & Sons, New Delhi, 2002.
2. Stephen Bernstein-Ruth Bernstein, Elements of Statistics I Descriptive Statistics
and Probability, Schaum’s Outlines, 2020.
3. K.V.S. Sarma, Statistics Made Simple: Do it yourself on PC. PHI, 2nd edition, 2010.

REFERENCE BOOKS:
1. Willam Feller: Introduction to Probability theory and its applications. Volume –I, Wiley, 1971.
2. A.M. Gun, M.K. Gupta B. Dasgupta, Fundamentals of Statistics, Vol-I, the World Press, 2019.
3. Hoel P.G: Introduction to mathematical statistics, Asia Publishing house, 1984.

VFSTR 19
 B.Sc - I Year I Semester

VFSTR 20
 B.Sc - I Year I Semester

22BS104 PROGRAMMING IN C

Hours Per Week :

L T P C
2 0 4 4

PREREQUISITE KNOWLEDGE: Fundamentals of Problem Solving

COURSE DESCRIPTION AND OBJECTIVES:

This course is aimed to impart knowledge on basic concepts of C programming language
and problem solving through programming. It covers basic structure of C program, data
types, operators, decision making statements, loops, functions, strings, pointers, and
also file manipulations. At the end of this course, students will be able to design,
implement, test and debug complex problems using features of C.

MODULE–1
UNIT-1 [8L+0T+16P=24 Hours]

INTRODUCTION TO ALGORITHMS AND PROGRAMMING LANGUAGES

Introduction to Algorithms: Basics of algorithms; Flow charts; Generations of
programming languages. Introduction to C: Structure of a C program - pre-processor
statement, inline comments, variable declaration statements, executable statements; C
Tokens - C character set, identifiers and keywords, type qualifiers, type modifiers,
variables, constants, punctuations and operators.
Data Types and Operators: Basic data types; Storage classes; Scope of a variable;
Formatted I/O; Reading and writing characters; Operators - assignment, arithmetic,
relational, logical, bitwise, ternary, address, indirection, size of, dot, arrow, parentheses
operators; Expressions - operator precedence, associative rules.
Control Statements: Introduction to category of control statements; Conditional branching
statements
- if, if– else, nested-if, if – else ladder, switch case; Iterative statements - for, while, do -
while, nested loops; Jump statements - break, jump, go to and continue.

UNIT-2 [8L+0T+16P=24 Hours]

ARRAYS & STRINGS

Arrays: Introduction; Types of arrays; Single dimensional array - declaration,
initialization, usage, reading, writing, accessing, memory representation, operations;
Multidimensional arrays.
Strings: Character array, reading string from the standard input device, displaying strings on
the standard output device, Importance of terminating a string, Standard string library
functions.

PRACTICES:
● Write a program to accept a character as input from the user and print it.
● Write a program to accept a number as input from the user and print it.
● Write a program to accept a float value from the user and print it.
● Write a program to accept a message as input from the user and print it.
● Write a program to accept a message from the user as input and print it in 3 different lines.
● Write a program to accept 2 numbers from the user as input and print their sum.
● Write a program to accept 2 numbers from the user as input and print their product.

VFSTR 21
 B.Sc - I Year I Semester
● Write a program to accept a number as input from the user which denotes the
temperature in Celsius, convert it to Fahrenheit reading and print it.
● Write a program to accept a number as input from the user which denotes the
radius and print the area of the circle.

VFSTR 22
 B.Sc - I Year I Semester

● Write a program to accept a character as input from the user and print it’s
SKILLS:
corresponding ASCII value. Analysis of the problem to be solved.
Select static or dynamic data structures for
Questions on Control Statements - Looping – Level 1: Application of various file oper- ations effec
Develop C pro- grams that are understanda
● Write a C program to print all the characters from a to z once.
● Write a C program to print all the characters from Z to A once.
● Write a C program to print all the characters from A to Z 3 times.
● Write a C program to print the first N natural numbers, where N is given as input by the user.
● Write a C program to print the first N natural numbers and their sum, where N is
given as input by the user.
● Write a C program to print all the odd numbers between 1 and N where N is
given as input by the user.
● Write a C program to print all the even numbers between I and N where N is
given as input by the user.
● Write a C program to print the squares of the first N natural numbers between 1
and N, where N is given as input by the user.
● Write a C program to print the cubes of the first N natural numbers between 1
and N, where N is given as input by the user.
● Write a C program to print the squares of every 5th number starting from 1 to N,
where N is given as input by the user.

Questions on Control Statements – Decision Making – Level 1:

● Write a program to accept two numbers as input check if they are equal.
● Write a program to accept two characters as input and check if they are equal.
● Write a program to accept two numbers as input and print the greater of the 2 numbers.
● Write a program to accept two numbers as input and print the lesser of the 2 numbers.
● Write a program to accept 3 numbers as input and print the maximum of the 3.
● Write a program to accept 3 numbers as input and print the minimum of the 3.
● Write a program to accept a number as input and print EVEN if it is an even number and ODD
if it is an odd number.
● Write a program to accept a number as input and check if it is divisible by 3. If it
is divisible by 3 print YES else print NO.
● Write a program to accept a number as input and check if it is divisible by both 3
& 5. If it is divisible print YES else print NO.
● Write a program to accept a number as input and check if it is positive, negative or zero.

Questions on Patterns – Level 1:

● Write a program to accept a number N as input from the user and print the
following pattern. Sample N = 5.
*****
*****
*****
*****
*****

● Write a program to accept a number N as input from the user and print the
following pattern. Sample N = 5.
*****
* *
* *
* *
*****

VFSTR 23
 B.Sc - I Year I Semester

VFSTR 24
 B.Sc - I Year I Semester

● Write a program to accept a number N as input from the user and print the
following pattern. Sample N = 5.
*
**
***
****
*****
● Write a program to accept a number N as input from the user and print the
following pattern. Sample N = 5.
*
**
***
****
*****

● Write a program to accept a number N as input from the user and print the
following pattern. Sample N = 5.
1
12
123
1234
12345

● Write a program to accept a number N as input from the user and print the
following pattern. Sample N = 5.
1
22
333
4444
55555

● Write a program to accept a number N as input from the user and print the
following pattern. Sample N = 5.
54321
4321
321
21
1

● Write a program to accept a number N as input from the user and print the
following pattern. Sample N = 5.
12345
2345
345
45
5

● Write a program to accept a number N as input from the user and print the
following pattern. Sample N = 5.
A
AB
ABC
ABCD
ABCDE

VFSTR 25
 B.Sc - I Year I Semester

VFSTR 26
 B.Sc - I Year I Semester

● Write a program to accept a number N as input from the user and print the
following pattern. Sample N = 5.
A
BC
DEF
GHIJ
KLMNO

Questions on Number Crunching – Level 1:s

● Write a program to accept a number as input and print the number of digits in the number.
● Write a program to accept a number as input print the sum of its digits.
● Write a program to accept a number as input, reverse the number and print it.
● Write a program to accept a number and digit as input and find the number of
occurrences of the digit in the number.
● Write a program to accept a number as input and check if it is an Armstrong number.
● Write a program to accept a number as input and check if it is an Adam number.
● Write a program to accept a number as input and check if is a prime number.
● Write a program to accept 2 numbers as input and check if they are amicable or not.
● Write a program to accept a number as input and check if it is a power of 2.
● Write a program to accept 2 numbers as input and find their LCM.

Questions on Arrays – Level 1:

● Print the contents of an array from the left to the right.
● Print the contents of an array from the right to the left.
● Find the sum of the elements of an array.
● Find the maximum element in an unsorted array.
● Find the minimum element in an unsorted array.
● Find the average of the elements in an unsorted array.
● Count the number of 0s and 1s in an array having 0s and 1s in random order.
● Count the number of elements in an array whose elements are lesser than a key
element in an unsorted array.
● Print all the elements in an array whose values are lesser than a key element in an unsorted array.
● Find the repeated elements in a sorted array.

Questions Number crunching – Level 2:

● Write a program to accept a number as input and print the product of its digits.
● Write a program to accept a number as input and check if it is a palindrome.
● Write a program to accept a number as input and print the frequency of occurrence of each digit.
● Write a program to accept a number as input and print its factors.
● Write a program to accept a number as input and print its prime factors.
● Write a program to accept a number as input and check if it is a perfect square of not.
● Write a program to accept 2 numbers as input and check if they are betrothed numbers or not.
● Write a program to accept 2 numbers as input and print their HCF.
● Write a program to accept a number as input and check if is a strong number.
● Write a program to generate prime numbers between two intervals given as input.

Questions on Arrays – Level 2:

● Find the sum of the maximum and minimum numbers of an unsorted array.
● Replace every element in an array with the sum of its every other element.
● Replace every element in an array with the sum of its right side elements.
● Replace every element in an array with the sum of its left side elements.
● Reverse the elements of an array (in place replacement).

VFSTR 27
 B.Sc - I Year I Semester

VFSTR 28
 B.Sc - I Year I Semester

● Reverse the first half of an array.

● Reverse the second half of an array.
● Write a program to find the second largest element in an unsorted array.
● Write a program to find the second smallest element in an unsorted array.
● Write a program to print the number of odd and even numbers in an unsorted array.

Questions on Strings – Level 1:

● Write a program to accept a string as input and print it.
● Write a program to accept a string as input and count the number of vowels in it.
● Write a program to accept a string as input and count the number of consonants in it.
● Write a program to accept a string as input and print its length.
● Write a program to accept a string as input and print the reversed string.
● Write a program to accept 2 strings as input and check if they are the same.
● Write a program to accept a string as input and copy the contents into a second
string and print the second string.
● Write a program to accept 2 strings as input and concatenate them into a third
string and print the third string.
● Write a program to accept a string as input and check if it is a palindrome.
● Write a program to accept two strings as input and check if the second string is a
substring of the first.

Questions on Strings – Level 2:

● Implement the string length function.
● Implement the string copy function.
● Implement the string concatenate function.
● Implement the string compare function.
● Implement the vowel count function.
● Implement the consonant count function.
● Implement the count words function.
● Implement the string reverse function.
● Implement the strstr function.
● Complete the code snippet to implement the is Palindrome function that checks
if a given string is a palindrome. You will need to use the 3 functions string Copy,
str Reverse and string Compare functions provided to accomplish this.

MODULE–2
UNIT-1 [8L+0T+16P=24 Hours]
FUNCTIONS & POINTERS
User-defined functions: Function declaration - definition, header of a function, body of a
function, function invocation; Call by value; Call by address; Passing arrays to functions;
Command line arguments; Recursion; Library Functions.
Pointers: Declaration, Initialization, Multiple indirection, Pointer arithmetic, Relationship
between arrays and pointers, Scaling up - array of arrays, array of pointers, pointer to a
pointer and pointer to an array; Dynamic memory allocation functions.

UNIT-2 [8L+0T+16P=24 Hours]

STRUCTURES, UNIONS & FILES
Structures: Defining a structure, declaring structure variable, Operations on
structures, Pointers to structure - declaring pointer to a structure, accessing structure
members using pointer; Array of structures, Nested structures, passing structures to
functions - passing each member of a structure as a separate argument, passing
structure variable by value, passing structure variable by reference/ address; Typedef
and structures.

VFSTR 29
 B.Sc - I Year I Semester
Unions: Defining a union - declaring union variable, operations on union; Pointers to union -
declaring

VFSTR 30
 B.Sc - I Year I Semester

pointer to a union, accessing union members using pointer; Array of union, Nested
union, Typedef and union, Enumerations, Bit-fields.
Files: Introduction to files, Streams, I/O using streams – opening a stream, closing
stream; Character input, Character output, File position indicator, End of file and errors,
Line input and line output, Formatted I/O, Block input and output, File type, Files and
command line arguments.
PRACTICES:

Questions on Strings – Level 3:

● Write a program to swap two given strings and print the swapped strings.
● Write a program to swap two given words of the given sentence and print the altered string.
● Return the maximum occurring character in the string.
● Write a program to print the character in the string with the count where count is
the occurrence of the character.
● Write a program to print the duplicate characters in the given string.
● Write a program to remove the duplicate characters in the given string.
● Write a program to remove the vowels from a given string.
● Write a program to rotate a given string N number of times.
● Write a program to check if 2 strings are rotations of each other.
● Write a program to remove the characters from the first string that are present in the second
string.
Questions on 2D Arrays – Level 1:
● Print the contents of a 2D array row-wise.
● Print the contents of a 2D array column-wise.
● Print the contents of a 2D array in a zig-zag order.
● Print the contents of a 2D array diagonal-wise.
● Print the contents of a 2D array right-diagonal order.
● Print the contents of a 2D array left-diagonal order.
● Print the contents of a 2D array in the upper triangular order – left top to right bottom.
● Print the contents of a 2D array in the lower triangular order.
● Find and print the maximum element along with its position in a matrix.
● Find and print the minimum element along with its position in a matrix.
Questions on 2D Arrays – Level 2:
● Find and print the maximum element of each row of a matrix.
● Find and print the minimum elements of each row of a matrix.
● Find and print the maximum element of each column of a matrix.
● Find and print the minimum element of each column of a matrix.
● Find the lowest value in the upper triangle area and the largest value in the
lower triangular area of a matrix and print their product.
● Find the sum of the elements of each row and each column of a matrix and print the minimum
row sum and maximum sum column.
● Write a program to find the row with the maximum number of 1’s in a matrix
consisting of only 0’s and 1’s.
● Write a program to print the quotient and remainder on dividing sum of left-top
to right-bottom diagonal by sum of right-top to left-bottom diagonal.
● Write a program to print the absolute difference of the sum of major diagonal
elements and the sum of minor diagonals of the given matrix.
● Write a program to search a given element in a row-wise and column-wise sorted 2D array.

Questions on 2D Arrays – Level 3:

● Write a program to find the Kth smallest element in the given matrix.
● Write a program to find the Kth largest element in the given matrix.
VFSTR 31
 B.Sc - I Year I Semester

VFSTR 32
 B.Sc - I Year I Semester

● Write a program to check whether the given two two-dimensional array of same
dimensions are equal or not.
● Write a program to add the given two two-dimensional array of same dimensions.
● Write a program to subtract the given two two-dimensional array of same dimensions.
● Write a program to multiply the given two two-dimensional array of same dimensions.
● Write a program to sort each row of a matrix.
● Write a program to find the sum of the elements in ‘Z’ sequence of the given 2D array.
● Write a program to print the unique rows of the given two-dimensional array
consisting of only 0’s and 1’s.
● Write a program to print the unique columns of the given two-dimensional array
consisting of only 0’s and 1’s.
Questions on Files, Structures & Unions:
● Write a C program to create a struct, named Student, representing the student’s
details as follows: first name, last name, Age and standard.
Example
Read student data
john
Carmack
15
10
Display the data in the following
format First Name: john
Last Name:
Carmack Age: 15
Standard: 10
● Declare a structure POINT. Input the coordinates of point variable and write a
C program to determine the quadrant in which it lies. The following table can be
used to determine the quadrant.
Quadrant X Y
1 Positive Positive
2 Negative Positive
3 Negative Negativ
e
4 Positive Negativ
e
Example
Input the values for X and Y coordinate: 7 9
The coordinate point (7,9) lies in the First quadrant.
● Bob and Alice both are friends. Bob asked Alice how to store the information of
the books using Structures. Then Alice written a c program to store the
information of books using book structure by taking different attributes like book
name, author, book id, price. Write a C program to read and display the
attributes of the books using structures.
Sample Input:
Enter number of books: 1
Enter the book name: c
Programming Enter the author
name: Balaguruswamy Enter the
book ID: 23413
Enter the book price: 500
Sample Output:
The details of the book are:
The book name is: c
VFSTR 33
 B.Sc - I Year I Semester
Programming The author name
is: Balaguruswamy The book ID
is: 23413
The book price is: 500.00

VFSTR 34
 B.Sc - I Year I Semester

● Ramesh wants to do addition on complex numbers. He did it with regular

practice but Charan asked him to do with the help of structures by following
below Criteria.
● Write a C program that defines a structure named ‘Complex’ consisting of two
floating point members called “real and imaginary”. Let c1 and c2 are two
Complex variables; compute the sum of two variables.
Example:
c1= 2 8
c2= 6 4
Sum= 8.000000+12.000000i
● Customer Payment Details is a structure with members as customers name,
address, account number, payment status (paid (1)/ not paid (0)), due date, and
amount. In this example, payment date is another structure with month, day and
year as integer members. So, every customer record can be considered as an
array of structures.
Write a C program that displays the amount to be paid by each customer along
with their names. If payment status is 1, display NIL for such customers.
Input Format:
First line of input contains ‘n’ number of customers, followed by 8 lines of input for
each customer. Each line represents (customers name, address, account number,
amount payment status (paid (1)/ not paid (0)), and due date).
Output Format: First line of output is Amount to be paid by each customer as on
date: followed by n lines of output. Each line contains name of the customer
followed by tab space, and amount to be paid.
Hint: Use nested structure to represent date.
Write a ‘C’ program to accept customer details such as: Account no, Name,
Balance using structure. Assume 3 customers in the bank. Write a function to
print the account no. and name of each customer whose balance < 100 Rs.
● Write a C program to accept details of ‘n’ employee (eno, ename, salary) and
display the details of employee having highest salary. Use array of structure.
● Write a C program to print the bill details of ‘N’ number of customers with the
following data: meter number, customer name, no of units consumed, bill date,
last date to deposit and city. The bill is to be calculated according to the
following conditions:
No. of units Charges
For first 100 units Rs.0.75 per
unit For the next 200 units Rs.1.80
per unit For the next 200 units
Rs.2.75 per unit Sample Input
Enter no. of
customers 1
Enter Meter Number AP01213
Enter Customer Name: Karthik
Enter No. of units consumed:
200 Enter Bill date:22/01/2021
Enter Last date:
12/2/2021 Enter City:
Guntur Sample Output
Meter Number AP01213
Customer Name:
Karthik No. of units
consumed: 200 Bill
date:22/01/2021

VFSTR 35
 B.Sc - I Year I Semester
Last date: 12/2/2021
City: Guntur
Total Amount: 255.000000

VFSTR 36
 B.Sc - I Year I Semester

● Write a C program that creates a student file containing {Roll No, Student Name,
Address, Stream}, where the data will be inserted and display the list of students
who are in CSE (Stream=CSE).
Input: A file name
Output: The attributes such as Roll No, Student Name, Stream, Address.
Sample Input
201fa4200 Raja CSE Guntu
201fa4201 Bala IT r
Tenali
Sample Output
201fa4200 Raja CSE Guntu
r
● Write a C program that reads content from an existing text file and write the
same in a new file by changing all lowercase alphabetic character to upper case.
(Existing file may contain digit and special characters).
Example:
Input: Enter the file name.
Output: New file with updated content.
● Write a C program to count the occurrences of the given
string in a file. Example:
Input: Enter the File name to read the string to be counted.
Output: Display the count of occurrences of the string.
● Write a C Program to transfer the data from one location to another location
without changing the order of the content.
Example:
Read the file name from the user. If the source file exists, Transfer the data and
display the message as “Data is transferred successfully” otherwise display the
message “No such file is existing in the directory.”
● Write a C program that reads numbers and write them into a text-file. Also find
odd and even numbers in that file and store it in 2 separate files named odd.txt
and even.txt. All the values should be in ascending order.
Input: Enter the values.
Output: Creates a separate file for Even and Odd
numbers. Sample Input:
4 43 2 53 45
Sample Output:
Even.txt: 2 4
Odd.txt: 43 45 53
● Write a C program to replace the content in the given text file.
Input: Enter the file name, line number to be replaced and the new
content Output: New file with replaced lines.
Example:
Sample Input: Enter the file name:
abc.txt Enter the line no to replace:
3
Enter the content: Files stores data
presently. Sample Output:
Line no 3 is replaced with the given
content. The content of the file abc.txt
contains:
test line 1
test line 2
Files stores data presently
VFSTR 37
 B.Sc - I Year I Semester
test line 4

VFSTR 38
 B.Sc - I Year I Semester

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Identify suitable data type for operands
1 Apply 1,2 1
and de- sign of expressions having right
precedence.
Apply decision making and iterative features
2 Apply 1,2 1
of C Programming language effectively.
Select problem specific data structures and
3 Analyze 1,2 1,2
suit- able accessing methods.
Design and develop non- recursive and
recursive functions and their usage to build
4 Create 1,2 3
large modular programs and also able to
design string manipula- tion functions.
Develop C programs that are
5 understandable, debuggable, maintainable Evaluat 1,2 3,4
and more likely to work correctly in the first e
attempt.

TEXT BOOKS:
1. Behrouz A. Forouzan, Richard F.Gilberg, “Programming for Problem Solving”, 1st
edition, Cengage publications, 2019.
2. Ajay Mittal, “Programming in C - A Practical Approach”, 1st edition, Pearson Education, India,
2010.

REFERENCE BOOKS:
1. Reema Thareja, “Computer Fundamentals and Programming in C”, 1st
edition, Oxford University Press, India, 2013.
2. Herbert Schildt, “C: The Complete Reference”, 4th edition, Tata McGraw-Hill, 2017.
3. Byron S Gottfried, “Programming with C”, 4th edition, Tata McGraw-Hill, 2018.

VFSTR 39
 B.Sc - I Year I Semester

VFSTR 40
 B.Sc - I Year I Semester

22BS105 IT WORKSHOP

Hours Per Week :

L T P C
0 2 4 3

PREREQUISITE KNOWLEDGE: Basics of Computer knowledge, Default Applications of Computers..

COURSE DESCRIPTION AND OBJECTIVES:

This course enables the students to learn various components of a computer system,
assembly and dis-assembly of various components, troubleshooting, installation of OS
and other applications. Also practicing of the usage of software tools such as word,
Source: excel, ppt and La-Tex, text and image editors.
e-Resources:
1) https://explorers- posts.grc.nasa.gov/ post631/2006-2007/ computer_basics/Com- puterPorts.doc
Image source: https:// TheITWorkshopWA MODULE–1

[0L+16T+32P=48Hours]
PRACTICING EXERCISES ON HARDWARE DEVICES
 Demo of various physical components of a computer
system.
 Integration of various components of a computer system and dismantling.
 Installation of OS in a computer system through various storage devices.
 Installation of OS in a computer system through cloning.
 Demonstration of booting process of a computer system
 Detection of faulty components such as hard disk, RAM, SMPS, network interface
in a computer system.
 Demonstration of program execution environment
 Demo of Windows/Linux file system.
 Demo of location OS files in the file system (Windows/Linux).
 Configuration of network interface in a computer system and troubleshooting
of network connectivity issues.
 Demo of shell scripts for maintenance and administration of a computer system
 Usage of editor tools
 Installation of software tools such as C compiler / interpreter, Java IDE, Python IDLE, PyCharm
etc.
 Installation of antivirus software, web browsers and application of servers such
as Apache server etc.

ACTIVITIES:
 Assemble and dis-assemble of various components of a computer system.
 Connect devices to various interfaces —(a) Serial Port, (b) Parallel Port, (c) USB
Port, (d) Fire wire, (e) RJ45 connector, (f) VGA connector, (g) Audio plugs (Line-In,
Line-Out and microphone),
(h) PS/2 Port, and (h) SCSI Port.
 Install Linux/windows OS in your computer.
 Identification of different Computer hardware problems and troubleshooting of the same.
 Editing of image, audio and video files using different editor tools.
 Build Ethernet and Wi-Fi LANs.

VFSTR 41
 B.Sc - I Year I Semester

VFSTR 42
 B.Sc - I Year I Semester

MODULE–2

[0L+16T+32P=48Hours]
PRACTICING EXERCISES USING SOFTWARE TOOLS
 Prepare your resume using MS-word
 Design a “Birthday Invitation” card.
 Design a Timetable given to you at the beginning of the semester without grid lines.
 Using Draw Table feature, insert a 7-column, 6-row table to create a calendar for the current month.
a. Enter the names of the days of the week in the first row of the table.
b. Centre the day names horizontally and vertically.
c. Change the font and font size as desired.
d. Insert a row at the top of the table.
e. Merge the cells in the row and enter the current month and year using a large font size.
f. Shade the row.
g. Enter and right-align the dates for the month in the appropriate cells of the table.
h. Change the outside border to a more decorative border. Identify two important
dates in the calendar and shade them.
 Prepare mark sheet using MS-Excel.
 Create a pivot table to analyse your worksheet data.
 Prepare a presentation on your university using MS-PowerPoint.
 Design a Magazine cover. Use the following:
(1)Select a theme for the page,
(2)Insert either a picture or clipart, and
(3)Use WordArt.
 Design a poster inviting all students of your university to the Computer Festival.
 Installation and demonstration of LaTeX.
 Prepare professional pdf documents using LaTeX.
 Prepare LaTex document containing mathematical equations.
ACTIVITIES :
● Create a 5-page document. Use hyperlinks, insert bookmarks in the same document.
● Design a worksheet using the following functions—MODE, STDDEV, VARIANCE,
MEDIAN, SIN, COS, TAN, COUNT, MAX, MIN, ABS, MOD, SUM, SUMIF, POWER.
● Create bar graphs, pie charts and line charts in excel.
● Create a 5-slide presentation on any topic. Use Images, Graphs, Chart, Tables,
Animation, Time, Bullets, Transition, Sound, Hyperlink, Background template,
Header and Footer.
● Create a following numbered list using LaTex.

INTRODUCTION
This is a display of numbered list
1. Abstract
2. Introduction
3. Section 1.
i. Section 1.1
ii. Section 1.2
4. Section 2
VFSTR 43
 B.Sc - I Year I Semester

VFSTR 44
 B.Sc - I Year I Semester

COURSE OUTCOMES:
SKILLS:
Integration of various compo- nents of a com- puterUpon completion of the course the student will be
system. able to achieve the following outcomes :
Trouble shooting of components of a computer system.
Installation of OS and its various tools/ applications.
CO Blooms Module Mapping
Usage of IT tools such as MS- Word, La-Tex etc. Course Outcomes
Creating the documents using MS-Word and LaTex.No. Level No. with POs
Analysing and visualizing data with excel.
Developing vari- ous power point presentations. Ability to assemble and disassemble the
1 Apply 1 1
computer system components and trouble
shooting.
Installing Operating Systems and
2 Apply 1 1
understanding the system booting
process.
Ability to develop system maintenance using
3 Apply 1 1
shell scripts.
Draw curves in Cartesian and polar 1, 2, 5, 9,
4 Apply 2
coordinate systems. 10,
12
Create word documents, presentations
5 Create 2 2,5
and spread sheets by applying various
tools.

TEXT BOOKS:
1. Fundamentals of Computers by Reema Thareja, Oxford University Press 2nd edition 2019,
India
2. Stefan Kottwitz, “LaTeX Beginner’s Guide: Create visually appealing texts,
articles, and books for business and science using LaTeX”, 2nd Edition, Kindle,
2021.

REFERENCE BOOKS:
1. Priti Sinha and Pradeep K. Sinha, “Computer Fundamentals: Concepts,
Systems and Applications”, 8th edition, BPB Publications, 2004.
2. Microsoft Office 2010 Bible by John Walkenbach, Herb Tyson, Michael
R.Groh and FaitheWempen, Publishers : Wiley

VFSTR 45
 B.Sc - I Year I Semester

VFSTR 46
 B.Sc - I Year II Semester

22BS107 DIGITAL LOGIC AND COMPUTER

ORGANIZATION

Hours Per Week :

L T P C
3 0 2 4

PREREQUISITE KNOWLEDGE: Algebra.

COURSE DESCRIPTION AND OBJECTIVES:
The emphasis is on understanding the design of computer and its components. This
course introduces the basic knowledge on number systems, design of combinational and
sequential circuits. The course mainly focuses on micro operations, memory
organizations and input output organization.

MODULE-1
UNIT – 1 [12L+0T+8P = 20 Hours]
BOOLEAN ALGEBRA
Boolean Algebra: Fundamental concepts of Boolean algebra basic theorems and
properties of Boolean Functions.
Gate-Level Minimization: Canonical and standard forms - SOP and POS forms, Digital
Logic gates, The map method – two, three, four variable K map; POS and SOP
simplification; Don’t care conditions;

UNIT – 2: [12L+0T+8P = 20 Hours]

COMBINATIONAL LOGIC CIRCUITS
Combinational Logic Circuits: combinational circuits analysis, design procedure; Half
adder, Full adder, Half subtractor, Full subtractor, Binary adder/subtractor; Binary
Incrementor, Decimal Adder, Binary multiplier; Magnitude comparator; Decoders;
Encoders; Multiplexers; De-Multiplexer. Synchronous Sequential Logic: Sequential
circuits; storage elements - latches, flip flops; Flipflop conversion; counters

MODULE–2
UNIT-1 [12L+0T+8P = 20 Hours]

CONTINUOUS DISTRIBUTIONS
Rectangular, Normal Distribution, Exponential, Gamma, Beta Distributions of two kinds.
Other properties such as mean, variance, M.G.F, C.G.F, C.F, reproductive property.

UNIT-2 [12L+0T+8P = 20 Hours]

APPROXIMATIONS OF DISTRIBUTIONS
Poisson approximation to Binomial distribution, Binomial approximation to Hyper
Geometric Distribution, Poisson approximation to Negative binomial distribution,
Interrelation between Normal and Binomial, Normal and Poisson distributionPractices:

PRACTICES:
● Design a Common bus system for eight registers with eight bits each using multiplexers.
● Design a Common bus system for four registers with four bits each using three state gate buffers.
● A digital computer has a common bus system for 16 registers of 32 bits each.
The bus is constructed with multiplexers
o How many selection inputs are there in each multiplexer?

VFSTR 33
 B.Sc - I Year II Semester
o What size of the multiplexers are needed?
o How many multiplexers are there in the bus?

VFSTR 34
 B.Sc - I Year II Semester

SKILLS:
Digital circuit Design. ● Perform arithmetic operations (+42) + (-13) and (-42) – (-13) in binary using
Number system Conversion. signed 2’s complement representation for negative numbers.
Analyse the prin- ciples of comput- er architecture.
● Design a 4- bit combinational decrementer circuit using 4 full adder circuits.
Design digital circuitry for implementing dif- ferent operations.
Identify the types of memories and their uses ● Register A holds the 8-bit binary 11011001. Determine the B operand and the
Study various data transfer mechanisms in digital computerlogic and I/O
micro operation to be performed in order to change the value in A to :
o 01101101 b. 11111101
● An 8-bit register contains the binary value 10011100. What is the register value
after an arithmetic shift right? Starting from the initial number 10011 100,
determine the register value after an arithmetic shift left, and state whether
there is an overflow.
● Starting from an initial value of R =11011101, determine the sequence of binary
values in R after a logical shift-left, followed by a circular shift-right, followed by
a logical shift-right and a circular shift-left.
● Design arithmetic logic shift unit that performs different operations on 4 bits.
● The content of PC in the basic computer is 3AF (all numbers are in hexadecimal).
The content of AC is 7EC3. The content of memory at address 3AF is 932E. The
content of memory at address 32E is 09AC. The content of memory at address
9AC is 8B9F.
o What is the instruction that will be fetched and executed next?
o Show the binary operation that will be performed in the AC when the instruction is
executed.
o Give the contents of registers PC, AR, DR, AC, and IR in hexadecimal and the
values of E, I, and the sequence counter SC in binary at the end of the instruction
cycle.
● How many characters per second can be transmitted over a 1200-baud line in
each of the following modes? (Assume a character code of eight bits.)
o Synchronous serial transmission.
o Asynchronous serial transmission with two stop bits.
o Asynchronous serial transmission with one stop bit.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes :

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Apply the knowledge of digital logic
concepts to optimize digital circuits and
1. Apply 1 1
Boolean algebra rules & Karnaugh map
method for reducing the Boolean
functions.
Analyse Combinational and sequential
2. Analyse 1 2
digital circuits for the given problem
statement.
Demonstrate computer architecture
3. concepts re- lated to the design of modern Analyse 2 1,2
processor, memory, and I/Osystems.
Evaluate the performance of a processor and Evalua-
4. 2 1,2
memory in terms of speed, size and cost. tion
Design of Combinational and sequential
5. digital cir- cuits for the given problem Creatin 1 3
statement and improve the performance by g
reducing the complexities.

TEXT BOOKS:

VFSTR 35
 B.Sc - I Year II Semester
1. M Morris Mano and Michael D. Ciletti, “Digital Design”, 5th edition, Pearson Education,
2013.
2. M.Moris Mano, “Computer Systems Architecture”, 3rd edition, Pearson/Prentice
Hall India, 2007.

VFSTR 36
 B.Sc - I Year II Semester

REFERENCE BOOKS:
1. John F.Wakerly, “Digital Design Principles and Practices”, Third Edition, Pearson/PHI, 2015.
2. Charles H.Roth. “Fundamentals of Logic Design”, 6th Edition, Thomson Learning, 2013.
3. John.M Yarbrough, “Digital Logic Applications and Design”, Thomson Learning, 2006.
4. Carl Hamacher, ZvonkoVranesic and SafwatZaky, “Computer Organization”, 5th
edition, Tata McGraw Hill, 2007.
5. William Stallings, “Computer Organization and Architecture”, 6th edition,
Pearson/Prentice Hall India, 2007.

VFSTR 37
 B.Sc - I Year II Semester

VFSTR 38
 B.Sc - I Year II Semester

22BS108 ALGEBRA

Hours Per Week :

L T P C
3 2 0 4

PREREQUISITE KNOWLEDGE: sets, relations, functions

COURSE DESCRIPTION AND OBJECTIVES:
Learn the elementary concepts and basic ideas involved in GROUPS and SUBGROUPS.
Develop the ability to form and evaluate group theory and its actions. Understand the
fundamental concepts of abstract algebra.

MODULE-1
UNIT – 1 [12L+8T+0P=20 Hours]
GROUPS AND THEIR ELEMENTARY PROPERTIES
Binary Operation – Algebraic structure – semi group-monoid – Group definition and
elementary properties Finite and Infinite groups – examples – order of a group.
Composition tables with examples.

UNIT – 2: [12L+8T+0P=20 Hours]

SUB GROUPS
Complex Definition – Multiplication of two complexes, Inverse of a complex-Subgroup
definition – examples-criterion for a complex to be a subgroup.
Criterion for the product of two subgroups to be a subgroup-union and Intersection of subgroups.
Co-sets and Lagrange’s Theorem: - Cosets Definition – properties of Cosets–Index of a
subgroups of a finite group– Lagrange’s Theorem.

PRACTICES:
● To check whether an operation is binary or not.
● Check whether set with binary operation is an algebraic structure.
● To test for semi group.
● To find out whether a complex is a subgroup.
● To prove Legrange’s theorem.

MODULE–2
UNIT-1 [12L+8T+0P=20 Hours]
NORMAL SUBGROUPS
Definition of normal subgroup – proper and improper normal subgroup–Hamilton group –
criterion for a subgroup to be a normal subgroup – intersection of two normal subgroups
– Sub group of index 2 is a normal sub group – simple group – quotient group – criteria
for the existence of a quotient group.

UNIT-2 [12L+8T+0P=20 Hours]

PERMUTATION GROUPS
Cycle notation for permutations, Properties of permutations, Even and odd
permutations, alternating groups, Cayley’s theorem and its applications.Practices:

VFSTR 39
 B.Sc - I Year II Semester

VFSTR 40
 B.Sc - I Year II Semester

PRACTICES:
SKILLS:
● To test a subgroup for its normality. Be able to grasp features, proper- ties of GR
Demonstrate understanding of algebraic ext
● Test for quotient group. Describe the structure of certain finite group
● To find subgroup of index 2 is normal.
● To prove Cayley’s theorem
COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to :

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Outline the various properties and Apply for 1, 2, 4, 5, 9,
1 Apply 1
differ- 10, 12
ent sets
2 Identify the nature of a sub group. Apply 1, 1, 2, 5, 9, 10
2
1, 2, 3, 5, 9,
3 Analyze permutation groups Analyze 1,
10
2
1, 2, 5, 9,
4 Inspect composite groups Analyze 2
10,
12
1, 2, 3, 4, 5,
5 Evaluate the properties of different groups. Evaluat 1,
9, 10, 12
e 2

TEXT BOOKS:
1. A text book of Mathematics for B.A. / B.Sc. by B.V.S.S. SARMA and others,
S.Chand & Co., New Delhi, 2021.
2. Abstract Algebra, by J.B. Fraleigh, Narosa Publishing house, New Delhi, Reprint 2013.

REFERENCE BOOKS:
1. I. N. Herstein, Topics in Algebra, Wiley Eastern, 1975.
2. C. Musili, Introduction to Rings and Modules, Narosa Publishing House, 1992
3. John B. Fraleigh, First Course in Abstract Algebra, A, 7th Edition, University of Rhode Island,
Pearson Education©2003.

VFSTR 41
 B.Sc - I Year II Semester

VFSTR 42
 B.Sc - I Year II Semester

22BS109 MATHEMATICAL EXPECTATION AND

PROBABILITY DISTRIBUTIONS

Hours Per Week :

L T P C
3 0 2 4

PREREQUISITE KNOWLEDGE: Basic knowledge in mathematical calculations, differentiation and

integration.
COURSE DESCRIPTION AND OBJECTIVES:
In this course students learn about mathematical expectations and various generating
functions such as moment generating function, cumulative generating function,
probability generating function and characteristic functions for random variables as well
as different types of statistical distributions. Also students should be able to calculate
the statistical measures for random variables and distributions by the mathematical
expectations.

MODULE-1
UNIT – 1 [12L+0T+8P = 20 Hours]
MATHEMATICAL EXPECTATIONS
Mathematical expectation (ME) of a random variable and function of a random variable.
Moments and covariance using mathematical expectation with examples. Addition and
Multiplication theorems on expectation. Definitions of M.G.F, C.G.F, P.G.F, C.F its
properties. Chebyshev and Cauchy - Schwartz inequalities.

UNIT – 2: [12L+0T+8P=Hours20]
DISCRETE DISTRIBUTIONS
Binomial, Poisson, Negative Binomial, geometric and hyper geometric distributions, their
definitions, 1st to 4th central moments, M.G.F, C.F, C.G.F, P.G.F, mean, variance,
additive property if exists.

PRACTICES:
● Derive the mathematical expectations of random variables
● Obtain moment generating functions
● Derive probability generating function
● Obtain cumulative generating function
● Find characteristic function

MODULE–2
UNIT-1 [12L+0T+8P=20Hours]

CONTINUOUS DISTRIBUTIONS
Rectangular, Normal Distribution, Exponential, Gamma, Beta Distributions of two kinds.
Other properties such as mean, variance, M.G.F, C.G.F, C.F, reproductive property.

UNIT-2 [12L+0T+8P = 20 Hours]

APPROXIMATIONS OF DISTRIBUTIONS
Poisson approximation to Binomial distribution, Binomial approximation to Hyper
Geometric Distribution, Poisson approximation to Negative binomial distribution,
Interrelation between Normal and Binomial, Normal and Poisson distributionPractices:

VFSTR 43
 B.Sc - I Year II Semester

VFSTR 44
 B.Sc - I Year I Semester

PRACTICES:
SKILLS:
● Obtain moment generating functions Derive different types of gener- ating functio
● Derive probability generating function Study the
interrelations between distri- butions
● Obtain cumulative generating function
● Find characteristic function
● Study the inter relations between distributions

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes :

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Use mathematical expectations to find
1 Apply 1 1,2
moments of random variables
2 Illustrate the recurrence relations of Apply 2 1,2,3
distributions
Calculate moments for continuous
3 Analyze 2 1,2,4
distributions by
generating functions
Evaluate the different types of generating
4 Evaluat 1 1,2,4
func-
e
tions for discrete distributions
1, 2, 3, 4, 5,
5 Evaluate the properties of different groups. Evaluat 1,
9, 10, 12
e 2

TEXT BOOKS:
1. V. K. Kapoor and S. C. Gupta, Fundamentals of Mathematical Statistics, Sultan
Chand & Sons, New Delhi, 2002.
2. K.V.S. Sarma, Statistics Made Simple: Do it yourself on PC. PHI, 2nd edition, 2010.

REFERENCE BOOKS:
1. Stephen Bernstein-Ruth Bernstein, Elements of Statistics-I Descriptive Statistics
and Probability, Schaum’s Outlines, 2020.
2. Willam Feller: Introduction to Probability theory and its applications. Volume –I, Wiley, 1971.
3. A.M. Gun, M.K. Gupta B. Dasgupta, Fundamentals of Statistics, Vol-I, the World Press, 2019.
4. Hoel P.G: Introduction to mathematical statistics, Asia Publishing house, 1984.

VFSTR 39
 B.Sc - I Year II Semester

VFSTR 40
 B.Sc - I Year I Semester

22BS110 DATA STRUCTURES

Hours Per Week :

L T P C
watch?v=Qmt0QwzEmh0 2 2 2 4

PREREQUISITE KNOWLEDGE: Programming in C .

COURSE DESCRIPTION AND OBJECTIVES:
This course is aimed at offering fundamentals concepts of data structures and explains
how to implement them. It begins with the basic concepts of data, data structures and
then introduces the primitive and non-primitive data structures in detail. It forms the
basis for understanding various ways of representing data and its usage in different
computing applications.

MODULE-1
UNIT – 1 [8L+8T+8P = 24 Hours]
DATA STRUCTURES BASICS
Basic Terminology – data, information, datatype; Data Structures – Introduction, storage
structures- sequential and linked storage representations; classification of data
structures; Applications of data structures.
Sorting: Selection Sort, Bubble Sort, Insertion Sort, Quick Sort and Merge Sort.
Searching: Linear Search and Binary Search.

UNIT – 2: [8L+8T+8P = 24 Hours]

LINKED LISTS AND STACKS, QUEUES
Linked List: Introduction, Types of linked list – Singly linked list, doubly linked list and
circular linked list, representation of linked list, Operations of linked list: Traverse
forward/ reverse order, searching, insertion and deletion; Applications of linked lists.
Stack – Introduction, array and linked representations, implementation and their applications;
Queue – Introduction, array and linked representations, implementation; Types – Linear,
circular and doubly ended queues – operations; Applications of Queues.

PRACTICES:
Problems on Recursion – Level 1
● Find the product of 2 numbers using recursion.
● Find the sum of natural numbers using recursion.
● Find the factorial of a number using recursion.
● Find the Nth term of Fibonacci series using recursion.
● Calculate the power using recursion.
● Write a recursive program for checking if a given number, is a prime number.
● Given two integers write a function to sum the numbers without using any arithmetic
operators.
● Convert a decimal to binary using recursion.
● Print all factors using recursion.
● Find the maximum product of digits among numbers less than or equal to N.
Problems Recursion – Level 2
● Implement insertion sort recursively.
● Write a program to find the numbers less than N that are product of exactly 2
VFSTR 41
 B.Sc - I Year II Semester
distinct prime numbers - using recursion.

VFSTR 42
 B.Sc - I Year II Semester

● Implement selection sort recursively.

SKILLS:
● Find the middle of a singly linked list using recursion. Experienced to Store data and various type
● Find the sum of even numbers of an array using recursion. Ordering and sorting of data.
Indexing and searching of required data fro
● Check if a given array is in sorted order using recursion.
Exposed to various char- acteristics such a
● Print alternate nodes of a linked list using recursion.
● Reverse a doubly linked list using recursion.
● Write a recursive function that returns all permutations of a given list.
● Implement bubble sort recursively.
Problems on Sorting and Searching – Level 1
● Implement the insertion sort function.
● Implement the bubble sort function.
● Implement the quick sort function.
● Implement the merge sort function.
● Implement the selection sort function.
● Implement linear search function.
● Implement binary search function.
Problems on SLL – Level 1
● Implement the insert function to insert nodes into a singly linked list (ascending order).
● Implement the insert function to insert nodes into a singly linked list (descending order).
● Implement the search node function.
● Implement the delete node function.
● Display forwards function.
● Display backwards function.
● Count the number of nodes in a singly linked list.
● Swap alternate nodes of a singly linked list.
● Move last node to the front of the linked list.
● Move first node to the last of the linked list.
Problems on Stacks – Level 1
● Implement two stacks using a single array.
● Given an array replace every element with nearest greater element on the right.
● Given a stack reverse the elements using only push and pop functions.
● Postfix evaluation using stack.
● Balance symbols.
● Find middle element in a stack.
● Remove middle element from a stack.
● Implement push and pop using linked list.
● Given an array of characters with the middle marked by X, check if the string is a palindrome.
● Maximum sum in sliding window.
Problems on Queues – Level 1
● Write a program to accept two numbers as input check if they are equal.
● Write a program to accept two characters as input and check if they are equal.
● Write a program to accept two numbers as input and print the greater of the 2 numbers.
● Write a program to accept two numbers as input and print the lesser of the 2 numbers.
● Write a program to accept 3 numbers as input and print the maximum of the 3.
● Write a program to accept 3 numbers as input and print the minimum of the 3.
● Write a program to accept a number as input and print EVEN if it is an even number and ODD
if it is an odd number.
● Write a program to accept a number as input and check if it is divisible by 3. If it
is divisible by 3 print YES else print NO.
● Write a program to accept a number as input and check if it is divisible by both 3
& 5. If it is divisible print YES else print NO.
● Write a program to accept a number as input and check if it is positive, negative or zero.

VFSTR 41
 B.Sc - I Year II Semester

VFSTR 42
 B.Sc - I Year II Semester

Problems on DLL – Level 1

● Implement insert function.
● Implement display forward function.
● Implement display backward function.
● Implement search function.
● Implement delete function.
● Reverse a doubly linked list from M to N.
● Find the sum of the odd and even nodes.
● Count odd keys of the linked list.
● Merge two sorted lists.
● Delete adjacent duplicate nodes.
Problems on CLL – Level 1
● Insert function (circular doubly linked list).
● Search function.
● Display forward.
● Display backward.
● Delete node (circular doubly linked list).
● Print the middle N nodes of a circular singly linked list.
● Move the last node of a circular singly linked list to the beginning.
● Delete adjacent duplicate nodes of a circular singly linked list.
● Delete nodes greater than a value from a circular doubly linked list.
● Find the sum of the nodes of a circular linked list.
Problems on Linked List – Level 2
● Given 2 sorted linked lists, print the common elements.
● Reverse a list (using Stack).
● Given a pointer to a node (not the last node), delete the node.
● Reverse a list (Recursive).
● Reverse a list (Iterative).
● Reverse a singly linked list in pairs (recursive).
● Reverse a singly linked list in pairs (iterative).
● Check if a singly linked list is a palindrome or not.
● Remove the loop if exists.
● Given 2 linked lists with data in the ascending order, merge them into a single list.

MODULE–2
UNIT-1 [8L+8T+8P=24 Hours]

TREES
Trees: Basic Terminology, Types of Trees, Binary Tree – Introduction, properties, array
and linked representations; Tree traversals and their implementation; Expression trees;
BST – definition and operations, AVL trees – definition and construction; Applications of
binary trees.

UNIT-2 [8L+8T+8P=24 Hours]

GRAPHS & HASHING

Graphs: Basic Terminology, Types of Graphs, Graphs representations – adjacency matric,
adjacency list; Traversals - breath first search and depth first search; Applications of
graphs.
Hashing: Introduction, Different hash functions, collision: avoidance and handling methods.

PRACTICES:

Problems on BST – Level 1

VFSTR 43
 B.Sc - I Year II Semester
● Insert function.

VFSTR 44
 B.Sc - I Year II Semester

● Insert function (recursive).

● Search function.
● Pre order traversal.
● Post order traversal.
● In order traversal.
● Level order traversal.
● Delete child node.
● Delete parent node.
● Delete nodes greater than a value from a circular doubly linked list.

Problems on Priority Queues – Level 1

● Meeting rooms problem.
● Ugly number.
● Find median from data stream.
● Find the top K frequent elements.
● Find K Pairs with smallest sums.
● Find the Kth smallest element in a sorted matrix.
● Trapping Rain Water.
● Rearrange String k distance apart.
● Sort characters by frequency.
● Solve the maze problem.

Problems on Graphs – Level 1

● Implement Graph data structure.
● Implement BFS - iterative solution.
● Implement BFS - recursive solution.
● Implement DFS - iterative solution.
● Implement DFS - recursive solution.
● Check if given graph is strongly connected or not.
● Check if given graph is strongly connected or not - using DFS.
● Given a graph find the arrival and departure time of its vertices in DFS. Arrival
time is the time when the vertex was explored for the first time, and departure
time is the time at which all the neighbours are explored and are ready to
backtrack.
● Given a directed acyclic graph and a source vertex, find the cost of the
shortest path from source vertex to all other vertices present in the graph. If
a vertex cannot be reached from given source vertex that distance may be
printed as infinite.
● Given an undirected graph, check if the graph is 2 edges connected or not.

Problems on Hashing – Level 1

● Print a binary tree in vertical order.
● Find whether an array is subset of another array.
● Given an array A [] and a number x, check for pair in A [] with sum as x.
● Minimum operation to make all elements equal in array.
● Maximum distance between two occurrences of same element in array.
● Check if a given array contains duplicate elements within k distance from each other.
● Find duplicates in a given array when elements are not limited to a range.
● Most frequent element in an array.
● Smallest subarray with all occurrences of a most frequent element.
● First element occurring k times in an array.
VFSTR 45
 B.Sc - I Year II Semester

VFSTR 46
 B.Sc - I Year II Semester

Problems on Graphs – Level 2

● Find the shortest graph distances between every pair vertex in a given path.
Assume that the graph does not have any negative edges.
● Find the shortest graph distances between every pair of vertices in a given path.
The graph can have negative edges.
● Detect cycle in DFS.
● Count the number of connected components of a graph represented in the adjacent matrix.
● Count the number of connected components of a graph represented in the
adjacent matrix - using DFS.
● Find a spanning tree - not necessarily a minimum spanning tree.
● Detect cycle in an undirected graph.
● Given an undirected graph, find its depth.
● Determine if a directed graph has a unique topological ordering.
● Given a directed acyclic graph and two vertices v and w, find the lowest common ancestor.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes :

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Explore the organization of several ADTs and
1 the manipulation (searching, insertion, Apply 1,2 1
deletion, tra- versing) of data stored in
various data structures.
Apply different data structures to solve a
2 Apply 1,2 1
given problem.
Analyze the efficiency of using different
3 data structures and choose the efficient Analyze 1,2 2
data structure for solving a given problem.
Develop new algorithms to solve various
4 Create 1,2 3,4
prob-
lems.

TEXT BOOKS:
1. Reema Thareja, “Data Structures Using C”, 2nd Edition, Oxford University Press, 2014.
2. Seymour Lipschutz, “Data Structures with C”, 1st Edition, McGraw Hill Education, 2017.

REFERENCE BOOKS:
1. Ellis Horowitz and Sartaj Sahni, “Fundamentals of Data Structures”, illustrated edition,
Computer
Science Press, 2006.
2. Richard F. Gilberg and Behrouz A. Forouzan, “Data Structures: A Pseudocode
Approach with C”, 2nd Edition, CENAGE Learning, 2005.
3. R G Dromey and Pearson, “How to solve it by Computer”, 2nd edition,
Impression edition, 1998.

VFSTR 47
 B.Sc - I Year II Semester

VFSTR 48
 II
Y E A R

B.S
c. III SEMESTER

 22BS20 - English Proficiency and Communication

1 skills
 22BS20 - Discrete Mathematical structures
2
 22BS20 - Statistical Methods
3
 22BS20 - Database Management Systems
4
 22BS20 - Object Oriented Programming
5
 22BS20 - Environmental Science
6
NCC / NSS / SAC / Paper presentation /
22BS20 -
 Social Activities
7

IV SEMEST
ER
Business English Communication – I
 22BS20 - Business English Communication (BEC) II
8

22BS20 - Differential Equations
 9 Statistical Inference
22BS21 - Operating Systems
 0
 Design and analysis of algorithms
22BS21 -
1 NCC / NSS / SAC / Paper presentation /

22BS21 - Social Activities
2


COURSE
CONTENTS
 B.Sc - I Year II Semester

I SEM & II SEM

VFSTR 50
VFSTR
 B.Sc - II Year I Semester

22BS201 ENGLISH PROFICIENCY AND

COMMUNICATION SKILLS
Hours Per Week :

L T P C
0 2 2 2

PREREQUISITE KNOWLEDGE: Basics of grammar, Read and understand for global

context, Cultural sensitivity and Basic writing skills.
COURSE DESCRIPTION AND OBJECTIVES:
English Proficiency and Communication Skills seeks to develop the students’ abilities in
grammar, speaking, reading, writing and overall comprehension skills. The course will
provide students an exposure on a wide range of language use in everyday situations. It
will make the students to equip with functional English and make them use it confidently
in their professional and social contexts. Finally, students will strengthen their reading,
writing, listening and speaking skills in English

MODULE-1
UNIT – 1 [0L+8T+8P=16 Hours]
● Reading – Understanding main message, factual information global meaning,
specific information and paraphrasing.
● Writing – Developing hints-based mail, Writing short messages/paragraphs
● Listening – Understanding short monologues or dialogues and choose the correct visual.
Speaking – Express simple opinions /cultural matters in a limited way.
● Vocabulary – Discerning use of right word suiting the context, B1 Preliminary word list
● Grammar – Frequency Adverbs, State Verbs, AFV and Prepositions
UNIT – 2: [0L+8T+8P=16 Hours]
● Reading – Longer text for detailed comprehension, gist and inference
● Writing – Developing notes and responding to penfriends or ‘e-pals’
● Listening – Understand straightforward instructions or public announcements.
● Speaking – Describing people, things and places in a photograph
● Vocabulary/Grammar – Comparatives and Superlatives, Gradable and non-gradable adjectives,
Cloze tests

PRACTICES:
● Developing hints-based mail
● Writing short messages
● Writing paragraphs
● Expressing opinions and cultural matters
● Understanding short monologues
● Understanding straightforward instructions and public announcements
● Describing people, things and places in a photograph

MODULE–2
UNIT-1 [0L+8T+8P=16 Hours]
● Reading – Reading for understanding coherence of the text and drawing inferences.
● Writing – Reading an announcement from a magazine or website for preparing an article
● Listening – Discussion activities and listening to understand the gist of each short dialogue
● Speaking – Snap Talks, Make and respond to suggestions, discuss alternatives and negotiate
agreement.
● Vocabulary / Grammar – Punctuation, Prepositions, Phrasal Verbs, B1 Preliminary word list

VFSTR 47
 B.Sc - II Year I Semester

VFSTR 48
 B.Sc - II Year I Semester

UNIT-2 [0L+8T+8P=16Hours]
SKILLS:
● Reading
Use of appro- priate grammar and vocabulary with syntactic patterns in–short
Content,
texts. Communicative Achievement, Organisation and Language.
Read and
● mation,
extract the main message, global meaning, specific infor- Writing – Developing a story with clear links to the given opening sentence.
detailed
comprehension, understanding of attitude, opinion and ●writer
Listening
purpose and– An interview for a detailed understanding of meaning and to identify
inference.
Listen to attitudes and opinions.
understand key information, spe- cific information, gist and detailed meaning and
to interpret meaning. ● Speaking – Discuss likes, dislikes, experiences, opinions, habits, etc.
Understand questions and make appropri- ate responses and talk freely on everyday topics
● Vocabulary / Grammar – Modals, Conditionals, Verb forms (Time and Tense)
PRACTICES:
● Listening to understand the gist of each short dialogue
● Listening to an interview for a detailed understanding of meaning and to identify attitudes
and
opinions.
● Preparing an article
● Discuss for alternatives and negotiate agreement.
● Discussion on likes, dislikes, experiences, opinions, habits, etc.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
apply to read and grasp content on a range
of topics/texts related to their everyday life
1 Apply 1 2,6
like noti- fications, advertisements, travel
brochures, news reports, articles.
apply suitable strategies to achieve
2 comprehen- sion, like listening for main Apply 1 2,6
points and checking comprehension using
contextual clues etc.
demonstrate vocabulary beyond that of the
3 Analyze 1, 2,6
famil- iar subjects
2
show sufficient control of English grammar
4 and sentence variety to coherently Evaluat 2 2,6
organise informa- tion at sentence and e
discourse levels
use functional English to communicate
5 Create 1, 2,6
and inter- act effectively in everyday
2
situations

TEXT BOOKS:
1. Emma Heyderman and Peter May, “Complete Preliminary”, Student’s Book with Answers,
2nd
edition, Cambridge University Press, 2019.

REFERENCE BOOKS:
1. Annette Capel and Rosemary Nixon, “Introduction to PET”, Oxford University Press, 2009.
2. Adrian Doff and Craig Thaine, “Empower Pre intermediate”, Cambridge University Press,
2015.
3. Louise Hashemi and Barbara Thomas, “Objective PET”, Cambridge University Press, 2010.

VFSTR 49
 B.Sc - II Year I Semester

VFSTR 50
 B.Sc - II Year I Semester

22BS202 DISCRETE MATHEMATICAL

STRUCTURES
Hours Per Week :

L T P C
3 2 0 4

PREREQUISITE KNOWLEDGE: Basics of set theory, algebra

COURSE DESCRIPTION AND OBJECTIVES:

The course objective is to provide students with an overview of discrete mathematics.
Students will learn about of group and expected to demonstrate analytical and
combinatorial methods such as propositional logic , Mathematical Induction, Boolean
functions, combinatorial ,recurrence relation, generating function and graph theory

MODULE–1 Discrete-Mathematical- Structur

UNIT-1 [12L+8T+0P = 20 Hours]

BOOLEAN ALGEBRA AND LOGIC

Group: Group, Subgroup, Lagrange’s theorem, Introduction to rings and fields.
Boolean algebra: Boolean algebra, Truth table, Basic logic gates, Postulates of Boolean algebra,
Principle of duality, Propositions, Connectives, Equivalence and Normal form.

UNIT-2 [12L+8T+0P = 20 Hours]

APPLICATIONS OF LOGIC & BOOLEAN ALGEBRA
Normal form: CNF, DNF, CDNF, CCNF, Conversion of CNF to DNF and vice versa.
Minimization of Boolean function (Karnaugh Maps), Generalized Pigeonhole
Principle.

MODULE–2
UNIT-1 [12L+8T+0P = 20 Hours]
COMBINATORICS AND GRAPHS
Combinatorics: The basics of counting, Permutations and combinations, Discrete Numeric Functions.
Recurrence relations and Generating functions.

UNIT-2 [12L+8T+0P = 20 Hours]

GRAPH THEORY
Graph terminology, Special types of graphs, Connected graph, Weighed graph, Graph
Isomorphism, Euler and Hamiltonian paths and circuits, Planar graphs, Bipartite graph,
Tree.

APPLICATIONS OF COMBINATORICS AND GRAPHS

Graph Coloring, Chromatic number, Matrix representation of graph, DFS, BFS algorithms,
Minimum spanning tree.

PRACTICES:
● Determine order of an element of group.
● Determine the order of a subgroup of a finite group.
● Determine whether algebraic structure is a Ring or a Field.

VFSTR 51
 B.Sc - II Year I Semester
● Construct Truth table of propositions.

VFSTR 52
 B.Sc - II Year I Semester

● Check whether propositions are equivalence.

SKILLS:
● Obtain CNF, DNF of expression.
Familiarity of concepts of statements, logic and truth tables.
Analyze closed form of discrete numeric func- tion. ● Draw 2 –variables, 3-variables K-map.
Understand some basic properties of graphs, trees and related dis- crete structures.
● Minimize the Boolean function by K-map.
● Simplify the Boolean expression using Boolean algebra laws.
● Determine the homogeneous solution and particular solution for recurrence relation.
● Switching Circuit in Boolean algebra, Combination of two switches in a Circuit,
● Represent sequence by Generating function.
● Solve Generation function by recurrence relation.
● Find degree of digraph and undirected graph.
● Identify Isomorphic graph, Euler circuit, Hamiltonian circuit.
● Determine matrix representation of graph.
● Determine the regions of planer connected graph.
● Draw Kn, Km,n.
● Determine the chromatic number of graphs.
● Find the weight of minimum spanning tree.
● Find number of arrangements that are possible.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Apply the concepts of mathematical logic
1 Apply 1 1, 2, 9, 10,
and
12
Boolean algebra.

2 Apply karanaugh map to minimize Apply 1 1, 2, 9, 10,

12
3 Solve generating function by recurrence Apply 2 1, 2, 9, 10,
relations 12
Model and solve real world problems using
4 Apply 2 1, 2, 9, 10,
graphs
12
and trees

TEXT BOOKS:
1. Tremblay, J.P. and Manohar. R, “Discrete Mathematical Structures with Applications
to Computer Science”, 30th Reprint, Tata McGraw Hill Pub. Co. Ltd, New Delhi,
2017.
2. Rosen, K.H., “Discrete Mathematics and its Applications”, 7th Edition, Tata
McGraw Hill Pub. Co. Ltd., New Delhi, 2018.

REFERENCE BOOKS:
1. R.P. Grimaldi, “Discrete and Combinatorial Mathematics: An Applied
Introduction”, 4th Edition, Pearson Education Asia, Delhi, 2017.
2. S. Lipschutz and Mark Lipson., “Discrete Mathematics”, Schaum‘s Outlines, Tata
McGraw Hill Pub. Co. Ltd., New Delhi, 2021.
3. T. Koshy, “Discrete Mathematics with Applications”, Elsevier Publications, 2015.
4. S B Singh. “Discrete Structures”, Khanna Book Publishers Co-Pvt. Ltd. 2019.

VFSTR 53
 B.Sc - II Year I Semester

VFSTR 54
 B.Sc - II Year I Semester

22BS203 STATISTICAL METHODS

Hours Per Week :

L T P C
3 0 2 4

PREREQUISITE KNOWLEDGE: Basic knowledge in mathematical calculations

COURSE DESCRIPTION AND OBJECTIVES:

To impart the knowledge of Correlation and regression in data analysis and be able to fit
appropriate mathematical curve to the given data and predict the future values of the
interested variables. Also, able to assess the association between the various attributes.

MODULE–1
UNIT-1 [12L+0T+8P = 20 Hours]
ATTRIBUTES
Introduction, Nature, and consistency and mention its conditions. Independence and
association of attributes, co-efficient of association, coefficients of contingency and their
problems.

UNIT-2 [12L+0T+8P = 20 Hours]

CORRELATION
Correlation: Definition, scatter diagram, its coefficient and its properties, scatter
diagram, computation of correlation coefficient for ungrouped data. spearman’s rank
correlation coefficient, properties of Spearman’s correlation coefficients and
problems.Practices:

PRACTICES:
● Identify the association between the attributes
● Verify the attributes are independent or not
● Measures the correlation between the variables
● Apply Spearman’s correlation for ranked data
● Analyse strength and relation between the variables

MODULE–2
UNIT-1 [12L+0T+8P = 20 Hours]
CURVE FITTING
Definition, method of least square, fitting of linear, quadratic, exponential and power
curves and their applications.

UNIT-2 [12L+0T+8P = 20 Hours]

REGRESSION
simple linear regression, properties of regression coefficients. Regression lines, Concept
of Correlation ratio, partial and multiple correlation coefficients, correlation verses
regression and their problems.s.

PRACTICES:
● Fitting of various various curves for ungrouped data
● Construction of linear regression line of y on x
● Construction of linear regression line of x on y
VFSTR 55
 B.Sc - II Year I Semester
● Computation of regression coefficients
● Identification regression lines y on x or x on y

VFSTR 56
 B.Sc - II Year I Semester

COURSE OUTCOMES:
SKILLS:
Carryout the correlation and regression anal- ysisUpon completion
for industrial of the
and research data course, the student will be able to achieve the following outcomes
Fit appropriate curves to the given data and predict the future values of the variables using tools
CO Blooms Module Mapping
Course Outcomes
No. Level No. with POs
Use regression analysis to construct
1 mathemat- ical model and predict the Apply 2 1,2
future values of the variables
Analyze the linear association between
2 Analyze 1 1,2,3
variables
by correlation
Estimate the statistical relations between
3 Evaluat 1 1,2,3
categor- ical variables
e
4 Construct an appropriate curve for the data Create 2 1,2,4,5

TEXT BOOKS:
1. V. K. Kapoor and S. C. Gupta, Fundamentals of Mathematical Statistics, Sultan
Chand & Sons, New Delhi, 2002.
2. Stephen Bernstein-Ruth Bernstein, Elements of Statistics I Descriptive Statistics
and Probability, Schaum’s Outlines, 2020.
3. K.V.S. Sarma, Statistics Made Simple: Do it yourself on PC. PHI, 2nd edition, 2010.

REFERENCE BOOKS:
1. Willam Feller: Introduction to Probability theory and its applications. Volume –I, Wiley, 1971.
2. A.M. Gun, M.K. Gupta B. Dasgupta, Fundamentals of Statistics , Vol-I, the World Press, 2019.
3. Hoel P.G: Introduction to mathematical statistics, Asia Publishing house, 1984.

VFSTR 57
 B.Sc - II Year I Semester

VFSTR 58
 B.Sc - II Year I Semester

22BS204 DATABASE MANAGEMENT

SYSTEMS
Hours Per Week :

L T P C
3 0 2 4
watch?v=lDpB9zF8LBw
PREREQUISITE KNOWLEDGE: Discrete Mathematical Structures.

COURSE DESCRIPTION AND OBJECTIVES:

This course presents an introduction to database management systems with an
emphasis on how to organize, maintain and retrieve data efficiently from a relational
database. It also focuses on requirements gathering and conceptual, logical, physical
database design. The objective of the course is to enable the student to understand
database design, expressing queries using SQL, query optimization and transaction
processing

MODULE–1
UNIT-1 [12L+0T+8P = 20 Hours]
DATABASE SYSTEM CONCEPTS
Databases And Database Users: Introduction; Characteristics of the database approach;
Actors on the scene; Advantages of using DBMS approach.
Database System Concepts and Architecture: Data models, Schemas and instances; Three-
Schema architecture and data Independence; Database languages and interfaces; The
database system environment; Centralized and Client-Server architectures for DBMS.
Conceptual Data Modeling and Database Design: Entity types, Entity sets, Attributes and
keys; Relationship types, Relationship sets, Roles and structural constraints; Weak entity
types; Relationship types.

UNIT-2 [12L+0T+8P = 20 Hours]

RELATIONAL DATABASE DESIGN
Relational Database Design by ER–To-Relational Mapping: Relational Database design
using ER- to-Relational mapping.
The Relational Data Model and Relational Database Constraints: Relational model concepts;
Relational model constraints and Relational database schemas.
Relational Algebra: Unary relational operations - SELECT and PROJECT; Relational algebra
operations from set theory; Binary relational operations- JOIN and DIVISION.
SQL: SQL data definition and data types; specifying constraints in SQL, Basic retrieval
queries in SQL; INSERT, DELETE, and UPDATE statements in SQL.

PRACTICES:
● Design ER Model for various real time database applications.
● Development of Relational Database schemas for Company/Student/Sailors/
using DDL constructs of SQL.
● Apply various DML Commands such as select, insert, update etc. of SQL on Relational Database.
● Design of Relational Database schemas by specifying different types of Constraints.
● Apply various Relational Database operators (Arithmetic, Logical &comparison)
and string- matching constructs of SQL.
● Expressing queries using Aggregate Functions of SQL on Relational Database.
● Queries on Relational Database using GROUP BY, HAVING and ORDER BY clauses of SQL.
VFSTR 59
 B.Sc - II Year I Semester

VFSTR 60
 B.Sc - II Year I Semester

SKILLS:
MODULE–2
Develop E-R model for real life applications. UNIT-1 [12L+0T+8P = 20 Hours]
Design of rela- tional databases for real world applications.
NORMALIZATION
Devise queries using relational algebra and SQL.
Complex Queries,
Analyze transac- tion processing, concurrency control and recovery Views: More complex SQL retrieval queries; Specifying
Triggers,
tech- niques.
constraints as assertions and actions as triggers; Views (virtual tables) in Pl/SQL.
Basics Of Functional Dependencies and Normalization for Relational Databases: Informal
design guidelines for relation schemas; Functional dependencies-inference rules,
equivalence and minimal cover; Normal forms based on primary keys; Boyce-Codd
normal form; Properties of relational decompositions, multi valued dependency, join
dependencies.
UNIT-2 [12L+0T+8P = 20 Hours]
TRANSACTION PROCESSING
Introduction to Transaction Processing Concepts and Theory: Introduction to transaction
processing; Transaction and system concepts; Desirable properties of transactions;
Characterizing schedules based on serializability.
Concurrency Control Techniques: Two-phase locking techniques for concurrency control,
concurrency control based on timestamp ordering.
Database Recovery Techniques: Recovery concepts; Shadow paging; The ARIES recovery
algorithm. Indexing Structures for Files and Physical Database Design: Single level and
multi-Level indexing; Dynamic multi-level indexing using B-trees and B+ trees.
PRACTICES:
● Design and Development of company database and expressing Nested queries using SQL.
● Design and Development of student database and specifying queries using set operations.
● Design and Development of sailor’s database and specifying queries using
different types of JOINs.
● Implementation of PL/SQL programs with Control Structures.
● Implementation of PL/SQL programs with Procedures.
● Implementation of PL/SQL programs with Function.
● Implementation of PL/SQL programs with Triggers.
● Creation and dropping of VIEWS.
● Relation R has eight attributes ABCDEFGH. Fields of R contain only atomic values. F = {CH
-> G, A -> BC, B -> CFH, E -> A, F -> EG} is a set of functional dependencies
(FDs) so that F+ is exactly the set of FDs that hold for R. How many candidate
keys does the relation R have?
● Apply various DCL and TCL constructs of SQL on Relational Database.
COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
1 Develop an E-R model for real life Apply 1 1,10
applications.
Express queries using database tools like
2 Apply 2 5,10
Oracle, DB2, MYSQL.
3 Devise queries using Relational Algebra and Analyze 2 2
SQL.
Design and normalize databases for real
4 Create 1 1,3
time
applications.

TEXT BOOKS:
1. Ramez, Elmasri and Shamkant B. Navathe, “Fundamentals of Database Systems”, 7th
Edition,
Pearson Education, 2016.
2. Raghu Rama Krishnan and Johannes Gehrke, “Database Management Systems”, 3rd Edition,
Tata McGraw Hill, 2013.
REFERENCE BOOKS:
VFSTR 61
 B.Sc - II Year I Semester
1. Abraham Silberschatz, Henry F.Korth and S.Sudarshan, “Database System Concepts”, 7th
edition, Tata Mc Graw Hill,2019.
2. Allen G. Taylor “Database Development for Dummies” 1st Edition, 2011
3. C. J. Date “Introduction to Database Systems” 7th Edition, Addison Wesley, 2003.

VFSTR 62
 B.Sc - II Year I Semester

22BS205 OBJECT ORIENTED

PROGRAMMING
Hours Per Week :

L T P C
3 0 2 4

PREREQUISITE KNOWLEDGE: Classes, Objects and Inheritance.

COURSE DESCRIPTION AND OBJECTIVES:

This course is about the fundamentals of Object-Oriented Programming (OOP) Concept
and OOP- based software development methodology. Java as a class-based and pure Source: . datasciencecentral. com/wp-co
OOP language is used to demonstrate and implement appropriate concepts and loads/2021/10/8667507462. jpeg
techniques. The students are exposed to the concepts, fundamental syntax, and the
thought processes behind object- oriented programming. By end of the course, students
will acquire the basic knowledge and skills necessary to implement object- oriented
programming techniques in software development using Java.

MODULE –1
UNIT-1 [8L+0T+8P=16 Hours]

CONCEPTS OF CLASSES AND OBJECTS

History of Java, Byte code, JVM, Java buzzwords, OOP principles, Data types, Variables,
Scope of variables, Operators, Control statements, Type conversion and casting, Arrays.
Concepts of Classes and Objects: Introduction to methods, Method over loading,
Constructors, Construct or over loading, Usage of static with data and method, Access
control, this key word, Garbage collection, String class, String Tokenizer.

UNIT-2 [16L+0T+8P=24 Hours]

INHERITANCE AND EXCEPTIONS
Inheritance: Type so finheritance, Member access rules, Usage of super key word,
Method overriding, Usage of final, Abstract classes, Interfaces - differences between
abstract classes and interfaces, defining an interface, implementing interface, applying
interfaces, variables in interface and extending interfaces. Packages-defining, creating
and accessing a package, importing packages, access control in packages.
Exception Handling: Concepts of exception handling, Types of exceptions, Usage of try, catch, throw,
throws and finally keywords, Built-in exceptions, User defined exception.

PRACTICES:
● There is a telecommunication company called “Powered Air” who have
approached you to build their Interactive Voice Response (IVR) system. write a
Java program and be able to provide the following menu (given below):
● Note: User should provide an input for each menu display. Welcome to Powered Air service.
What would you like to do?
a. Know my balance. b. Know my validity date
c. Know number of free calls available. d. More
1. Prepaid Bill Request 2. Customer Preferences
3. GPRS activation 4. Special Message Offers
5. Special GPRS Offers 6. 3G Activation
7. Go back to Previous menu
You are free to display your own messages in this IVR.
● Create a class Rectangle. The class has attributes length and width. It should
have methods that calculate the perimeter and area of the rectangle. It should
have read Attributes method to read length and width from user.
VFSTR 63
 B.Sc - II Year I Semester
o Hint: Area of rectangle = length * width, Perimeter of rectangle = 2*(length+width).

VFSTR 64
 B.Sc - II Year I Semester

● Implement a Java Program that reads a line of integers, and then displays each
SKILLS:
integer, and the sum of all the integers (use StringTokenizer class).
To analyse and develop algo- rithm for real life problems using Java.
Experience with developing and debugging programs● Implement
in different IDEs. a java program to print all tokens of a string on the bases of multiple
Develop separators (use StringTokenizer class).
multi-threaded applications.
Creating web applications. ● Using inheritance, one class can acquire the properties of others. Consider
● a class Animal that has only one method “walk”. Next, create a Bird class that
also has a fly method. Finally, create a bird object that can both fly and walk.
● Using inheritance ,Write the following code in your editor :
● 1. A class named Arithmetic with a method named “add” that takes integers as parameters
and
returns an integer denoting their sum.
● 2. A class named Adder that inherits from a superclass named
Arithmetic. o Note: Your classes should not be Public.
● When a subclass inherits from a superclass, it also inherits its methods; however,
it can also override the superclass methods (as well as declare and implement
new ones). Consider the Sports class having methods getName()[which returns
name of sport] and getNumberOf TeamMembers()[which returns noof team
members] create a Soccer class that inherits from the Sports class. We can
override the get Name method and return a different subclass-specific string and
override getNumberOfTeamMembers method and return noof team members
● Implement a java program to create an abstract class named Shape that
contains an empty method named number Of Sides ( ).Provide three classes
named Trapezoid, Triangle and Hexagon such that each one of the classes
extends the class Shape. Each one of the classes contains only the method
number Of Sides ( ) that shows the number of sides in the given geometrical
figures.
● You are given an interface Advanced Arithmetic which contains a method
signature int divisor_ sum(int n). You need to write a class called My Calculator
which implements the interface. divisor_sum function just takes an integer as
input and return the sum of all its divisors. For example divisors of 6 are 1, 2, 3
and 6, so divisor_sum should return 12. The value of n will be at most 1000.
● Implement a Java program for the following
● Creation of simple package.
● Accessing a package.
● Implement a Java program to read two numbers a,b from user and perform division
a/b,if the user passes b value as zero, handle the exception using try and catch
otherwise display the result.
● Create a class called Customer with data members account_number, balance
(initialize with 10000), and member functions print(), deposit(), and withdraw().
Print method display account number and balance. If withdraw amount is less
than current balance while withdrawing, throw an exception “In Sufficient
Funds”. If the input is 1 do print. If the input is 2 withdraw (). If the input is 3
deposit. If the input is 4 terminate program.
● Implement a Java program which acceptsage as input from the user and throws
an exception o “Not Eligible to Vote” when age is <=18 otherwise print “Eligible
to Vote”.

MODULE –2
UNIT-1 [12L+0T+8P=24 Hours]
MULTI THREDING AND FRAMEWORK
Multithreading: Concepts of multi threading, Differences between process and thread,
Thread life cycle, Creating multiple threads using Thread class and Runnable interface,
Synchronization, Thread priorities, Inter thread communication.
Collection Framework: Collections Overview, Collection Interfaces - List, Set, Map, List –
Array List, Linked List, Vector, Set - HashSet, TreeSet, Map - HashTable, HashMap,
accessing a collection via an Iterator, comparator, comparable.

VFSTR 65
 B.Sc - II Year I Semester
UNIT-2 [12L+0T+8P=24 Hours]
SWINGS
GUI Programming With Swing: Delegation event model-Events, Event sources, Event Listeners,
Event
classes, handling mouse and keyboard events.

VFSTR 66
 B.Sc - II Year I Semester

Exploring Swing Controls: JLabel and Image Icon, JText Field, JButton, JCheckBox, JRadioButton,
JTabbed Pane, JList, JCombo Box.
PRACTICES:
● Print in Order
Suppose we have a class:
public class Foo {
public void first() { print(“first”); }
public void second() {
print(“second”); } public void
third() { print(“third”); }
}
The same instance of Foo will be passed to three different threads. Thread A will
call first(), thread B will call second(), and thread C will call third(). Design a
mechanism and modify the program to ensure that second() is executed after
first(), and third() is executed after second(). Note:
We do not know how the threads will be scheduled in the operating system, even
though the numbers in the input seem to imply the ordering. The input format
you see is mainly to ensure our tests’ comprehensiveness.

Example 1:
Input: nums = [1,2,3]
Output:
“firstsecondthird”
Explanation: There are three threads being fired asynchronously. The input
[1,2,3] means thread A calls first(), thread B calls second(), and thread C calls
third(). “firstsecondthird” is the correct output.

Example 2:
Input: nums = [1,3,2]
Output:
“firstsecondthird”
Explanation: The input [1,3,2] means thread A calls first(), thread B calls third(),
and thread C calls second(). “firstsecondthird” is the correct output.

● Flood Fill:
An image is represented by an m x n integer grid image where image[i][j] represents the pixel
value of the image.
You are also given three integers sr, sc, and color. You should perform a flood fill
on the image starting from the pixel image[sr][sc].
To perform a flood fill, consider the starting pixel, plus any pixels connected 4-
directionally to the starting pixel of the same color as the starting pixel, plus any
pixels connected 4-directionally to those pixels (also with the same color), and so
on. Replace the color of all of the aforementioned pixels with color.
Return the modified image after performing the flood fill.

Example 1:
Input: image = [[1,1,1],[1,1,0],[1,0,1]], sr = 1, sc = 1, color = 2
Output: [[2,2,2],[2,2,0],[2,0,1]]
Explanation: From the centre of the image with position (sr, sc) = (1, 1) (i.e., the
red pixel), all pixels connected by a path of the same color as the starting pixel
(i.e., the blue pixels) are colored with the new color.

VFSTR 67
 B.Sc - II Year I Semester
Note the bottom corner is not coloured 2, because it is not 4-directionally
connected to the starting pixel.

VFSTR 68
 B.Sc - II Year I Semester

Example 2:
Input: image = [[0,0,0],[0,0,0]], sr = 0, sc = 0, color = 0
Output: [[0,0,0],[0,0,0]]
Explanation: The starting pixel is already colored 0, so no changes are made to the image.
● Count words in a given string
The input parameter is a list of strings representing lines of text.
Count how often the word occurs in the text.
If the word “kitten” occurred in a text 23 times, then its entry would be “kitten - 23\n”.
Return
statistics as a String containing all the entries.
Omit all words which contain less than 4 letters and appear less than 10 (the
words which are too small or to rare) The entries in the resulting String should be
also sorted by their amount and then in alphabetical order if it is needed.
● Implement a Java program for handling mouse events when the mouse entered,
exited, clicked, pressed, released, dragged and moved in the client area.
● Implement a Java program for handling key events when the key board is
pressed, released, typed.
● Implement a Java swing program that reads two numbers from two separate text
fields and display sum of two numbers in third text field when button “add” is
pressed.
● Implement a Java program to design student registration form using Swing
Controls. The form which having the following fields and button “save”. Form
Fields are: Name, RNO, Mail id, Gender, Branch, and Address.
● Implement a java program using swings to design a multiple choice question
having three options (use radio button) ,display the message using dialog box
“Your answer is wrong” if the user selects wrong option otherwise display ,”Your
answer is correct.”

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to :

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Apply object oriented concepts on real time
1 Apply 1 1,2
sce-
narios.
Apply the concepts of Multithreading and
2 Excep- tion handling to develop efficient Apply 1, 1,2
and error free codes 2
Design and develop Java applications to
3 solve real world problems by using Create 2 3,5
modern tools and collection framework
Design and develop GUI based applications
4 Create 2 3,5
using swings forinternet and system based
applications.

TEXT BOOKS:
1. Herbert Schildt, “Java the complete reference”, 12th Edition, McGraw Hill, Education, 2021.
2. M.T. Somashekara, D.S. Guru, K.S. Manjunatha, “Object-Oriented Programming
with Java”, 1st Edition, PHI Learning, 2017.

REFERENCE BOOKS:
1. E. Balagurusamy, “Programming with Java”, 6th Edition, McGraw Hill, 2019.
2. Mark Lassoff,“ Java Programming for Beginners: Learn the fundamentals of
programming with Java”, 1st Edition, Packt Publishing Limited,2017.
VFSTR 69
 B.Sc - II Year I Semester
3. Philip Conrod, Lou Tylee,“ Learn Java GUI Applications : A JFC Swing Tutorial”,
11th Edition, Kidware Software, 2019.

VFSTR 70
 B.Sc - II Year I Semester

22BS206 ENVIRONMENTAL SCIENCE

Hours Per Week :

L T P C
0 1 1 1

PREREQUISITE KNOWLEDGE: General awareness regarding environmental problems

and importance of environmental protection.
COURSE DESCRIPTION AND OBJECTIVES:
It is a multidisciplinary subject where different aspects of society and environment are
dealt using a holistic approach. It is evolving to be the education for sustainable and
ethical development both at a local and global level. It helps to prepare the next
generation for planning appropriate strategies to address environmental issues. It
identifies and creates solutions that conserve to manage ecosystem and biodiversity
and helps to eliminate pollutants, toxicants, preserve air, water and soil quality.
Environmental education recognizes impacts of global issues, enhances the public
awareness and helps to take decisions towards environmentally responsible actions.

MODULE-1
UNIT – 1 [0L+4T+4P=8 Hours]
INTRODUCTION TO ENVIRONMENT: NATURAL RESOURCES, ECOSYSTEMS AND
BIODIVERSITY
Environment and sustainable development; Natural resources- forest, water, energy and
land resources; Ecosystem – basic structural components, function and interactions in
ecosystem, ecological succession.

UNIT – 2: [0L+4T+4P=8 Hours]

BIODIVERSITY AND CONSERVATION

Introduction to biodiversity, types of biodiversity- species, genetic and ecosystem
diversity; Threats to biodiversity - natural and anthropogenic, species extinctions, man
wildlife conflicts; Biodiversity conservation - principles and strategies; in-situ and ex-situ
conservation.

PRACTICES:
● Visit to a Biogas plant, Solar Power plant
● Visit to a local area: river/pond/lake/forest / grassland / hill /mountain and study of different
● Types of ecosystems, biodiversity study and documentation (herbarium sheet preparation).
● Case study: Renewable energy use

MODULE–2
UNIT-1 [0L+4T+4P=8 Hours

ENVIRONMENTAL POLLUTION AND CLIMATE CHANGE

Air, water, soil, radioactive and noise pollution; Study of different pollutants (SOx, NOx,
PAN, PAH etc.); Toxicity study; Climate change- greenhouse effect, acid rain, ozone layer
depletion.

UNIT-2 [0L+4T+4P=8 Hours]

POLLUTION CONTROL DEVICES AND WASTEWATER TREATMENT TECHNOLOGIES

Air pollution control devices - Gravitational settling chambers, cyclonic separators,
VFSTR 71
 B.Sc - II Year I Semester
electrostatic precipitators, fabric filters and bio filters, Wastewater
management.PRACTICES:

VFSTR 72
 B.Sc - II Year II Semester

PRACTICES:
SKILLS:
Create a biodiversity map of any habitat/ ecosystem ● Visit to a sewage treatment plant and wastewater analysis
Strategize different ways of using renewable energy resources
● Case study: Recycling Technologies
Design novel strategies and approaches for pol- lution control and waste management
● Case study: Effects of contaminants on microorganisms
● Report writing: 12 principles of green chemistry for environmental sustainability
● Report writing: Environmental Impact Analysis, Local Disaster Management Plan.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to :

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Apply the basic concepts of sustainable
1 develop- ment, natural resource utilization Apply 1 4,5,6
and ecology for the purpose of
environmental protection
Design remediation technologies for their
2 Apply 2 3,4,5
abate- ment
Analyze the biodiversity of different
3 Analyze 1 4,5
ecosystems and formulate various
conservation approaches
Analyze the presence of various
4 Analyze 2 4,5
environmental pollutants
Recommend various waste management ap-
5 Evaluat 2 2,4,5, 6
proaches and their implementation
e
strategies

TEXT BOOKS:
1. Kaushik and C. P. Kaushik, “Perspectives in Environmental Studies”, 5th edition, New Age
International Publishers, 2016.
2. Y. Anjaneyulu, “Introduction to Environmental Science”, B. S. Publications, 2015.

REFERENCE BOOKS:
1. B. Joseph, “Environmental Studies”, 2nd edition, Mc Graw Hill Education, 2015.
2. S. Subash Chandra, “Environmental Science”, New Central Book Agency, 2011.
3. Mahua Basu & S.Xavier, “Fundamentals of Environmental Studies”, Cambridge University
Press, 2016.
4. K. Mukkanti, “A Textbook of Environmental Studies”, S. Chand Company Ltd., 2009.
5. M. Anji Reddy, “A Textbook of Environmental Science and Technology”, B. S.
Publications, 2008.
6. K. Joseph and R. Nagendram, “Essentials of Environmental Studies”, Pearson
Education Pvt. Ltd., 2007.
7. M. Chandrasekhar, “A Textbook of Environmental Studies”, Hi-tech Publications, 2006. 6.
8. C. S. Rao, “Environmental Pollution Control Engineering”, New Age International Publishers,
2001.

VFSTR 60
 B.Sc - II Year II Semester

VFSTR 61
 B.Sc - II Year II Semester

22BS208 BUSINESS ENGLISH

COMMUNICATION - I
Hours Per Week :

L T P C
0 2 2 2

PREREQUISITE KNOWLEDGE: Basics of grammar, Read and understand for global

context, Cultural sensitivity and Basic writing skills.
COURSE DESCRIPTION AND OBJECTIVES:
Business English Communication-I aims to develop the students’ abilities in reading,
writing skills. The course will provide students an exposure on a wide range of language
use in workplace situations. It will make the students to equip with functional English
and make them use it confidently in their professional and social contexts. Finally,
students will strengthen their reading, writing, listening and speaking skills in Business English.

MODULE-1
UNIT – 1 [0L+8T+8P=16 Hours]
STAFF DEVELOPMENT AND TRAINING - JOB DESCRIPTION AND JOB SATISFACTION-
GETTING THE RIGHT JOB
• Reading – Reading for Understanding, telephone etiquette.
• Writing – job applications- formal E-mail Writing
• Listening – Discussions – need of trainings (in house and out sourcing), job applications,
interviews.
• Speaking – applying for a job, work-place culture, training, planning training.
• Vocabulary – Appropriate use of words the context, B2 Preliminary word list
• Vocabulary /Grammar – countable and uncountable nouns, adjective forms, workplace
vocabulary.

UNIT – 2 [0L+8T+8P=16 Hours]

MAKING CONTACT- BREAKING INTO THE MARKET -LAUNCHING A PRODUCT
• Reading –Reading for specific information and inference
• Writing – writing reports, E-mail writing- making an enquiry, answering enquiries
• Listening – short talks- advertisements, compliances, or public announcements.
• Speaking – discussing features of new products, advertising a product,
designing an advertisement (role-plays)
• Vocabulary/Grammar – infinite verbs, verb+ ing, prepositions in phrases
describing trends, terminology related promotion activities.

PRACTICES:
● E- mail writing for professional purposes
● Writing job application
● Writing short report
● Role play
● Describing new products, designing advertisement
● Comprehending different advertisements

VFSTR 62
 B.Sc - II Year II Semester

SKILLS:
MODULE-2
Use of appro- priate grammar and vocabulary with UNIT – 1: patterns in short texts.
syntactic [0L+8T+8P=16 Hours]
Read and
A STAND
extract the main message, global meaning, specific AT TRADE
infor- mation, detailed FAIR- BEING PERSUASIVE- STARTING A BUSINESS
comprehension, understanding of attitude, opinion and writer purpose and inference.
Listen to • Reading – Reading for global understanding and gist.
understand key information, spe- cific information, gist•andWriting
detailed meaning and a memo, writing a proposal
– writing
to interpret meaning.
Understand questions and make appropri- ate responses • andListening
talk freely –onDiscussion activities and listening to understand the gist of each short
everyday topics dialogue
• Speaking – short Talks, making choices- location, finance.
• Vocabulary / Grammar – modal verbs, time prepositions, expressions for making
recommendations

UNIT – 2: [0L+8T+8P=16 Hours]

FINANCING A START-UP-EXPANDING INTO EUROPE- PRESENTING YOUR BUSINESS IDEA
• Reading – reading for inference, Communicative Achievement, Organisation and Language.
• Writing – writing proposals, letter of enquiry
• Listening – listening for information, inference, presentations.
• Speaking – short presentations, business ideas, expressing - experiences, opinions, habits,
etc.
• Vocabulary / Grammar – can, could., expressions for presentations
PRACTICES:
● Listening to understand the gist of each short dialogue
● Listening to presentations,
● Writing proposals
● Writing reports
● Writing memos, letters
● Expressing ideas, opinions, choices

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to :

CO Bloom Modul Mappin

Course Outcomes
No. s e g with
Level No. POs
apply to read and grasp content on a range of
1 topics/texts related to work-place like Apply 1,2 2,6
notifications, advertisements, business
reports, articles.
apply suitable strategies to achieve
2 comprehension, like listening for main points Apply 1,2 2,6
and checking comprehension using contextual
clues etc.
3 demonstrate vocabulary related to business Analyze 1, 2 2,6
English
show sufficient control of English grammar
4 and sentence variety to coherently organise Evaluate 1,2 2,6
information at sentence and discourse levels
use functional English to communicate and
5 Create 1, 2 2,6
interact
effectively in work-place situations

TEXT BOOKS:
1. Guy Brook Hart, Bench Mark, Cambridge University Press, 2014.

REFERENCE BOOKS:

VFSTR 63
 B.Sc - II Year II Semester
1. Adrian Doff and Craig Thaine, “Empower Pre intermediate”, Cambridge University Press,
2015.
2. University Of Cambridge Local Examinations Syndicate, Cambridge University
press, ISBN: 9780521673136, 9780521673136

VFSTR 64
 B.Sc - II Year II Semester

22BS209 BUSINESS ENGLISH

COMMUNICATION - II
Hours Per Week :

L T P C
0 2 2 2

PREREQUISITE KNOWLEDGE: Basics of grammar, Read and understand for global

meaning, Cultural sensitivity and Basic writing skills
COURSE DESCRIPTION AND OBJECTIVES:
Business English Communication-II aims to develop the students’ abilities in reading,
writing skills at advance level. The course will help students to use English language for
specific purpose at work place. It will make the students to equip with functional English
and make them use it confidently in their professional and social contexts. Finally,
students will strengthen their reading, writing, listening and speaking skills in Business
English
MODULE-1
UNIT-1 [0L+8T+8P=16 Hours]
ARRANGING BUSINESS TRAVEL - BUSINESS CONFERENCE- BUSINESS MEETINGS
● Reading – Reading for Understanding and inference in business conferences and meetings.
● Writing – formal E-mail Writing – arranging business travels, conferences
● Listening – conference lectures, discussions (listening for specific information)
● Speaking – conference discussions and presentations (GD, role play)
● Vocabulary /Grammar –modals, apt vocabulary for business meetings and conferences

UNIT-2 [0L+8T+8P=16 Hours]

SPENDING THE SALES BUDGET- SOCIAL MEDIA AND BUSINESS - BUSINESS AND
ENVIRONMENT
● Reading –Reading reports for global understanding and information- green office,
● Writing – writing sales reports, advertising on social media, business letters
● Listening – listening to reports, social media and customers, office environment.
● Speaking –how to use social media, improving office environment (seminars, GD)
● Vocabulary/Grammar – tenses, if conditions, vocabulary for advertising on social media,

PRACTICES:
● E- mail writing for arranging business travels and conferences
● Writing sales reports
● Writing letters
● Role play
● Group discussions. Seminars,
● Designing different advertisements
MODULE–2
UNIT-1: [0L+8T+8P=16 Hours]
A STAFF SURVEY - OFF SHORING AND OUTSOURCING - CUSTOMER SATISFACTION AND
LOYALTY
● Reading – Reading reports about outsourcing satisfaction and loyalty (global understanding).
● Writing – writing a survey report, writing a proposal for outsourcing, Email-writing for apologizing.
● Listening – calls to HR, customer communications.
● Speaking – discussions - staff meetings, Customer satisfaction and loyalty, short talks on
outsourcing
● Vocabulary / Grammar – third if conditions, reported speech.
VFSTR 65
 B.Sc - II Year II Semester

VFSTR 66
 B.Sc - II Year II Semester

UNIT-2 [0L+8T+8P=16 Hours]

SKILLS:
Use of appro- priate grammar and vocabulary with syntactic patterns in short
COMMUNICATION WITH texts.
CUSTOMERS - CORRESPONDING WITH CUSTOMERS -BUSINESS
Read and
ACROSS CULTURES
extract the main message, global meaning, specific infor- mation, detailed
comprehension, understanding of attitude, opinion and●writer purpose and
Reading inference. customers’ correspondence- working in new culture.
– reading
Listen to
● Writing – complaint
understand key information, spe- cific information, gist and detailed meaning and letters/emails, letters/emails about introducing new service
to interpret meaning. ● Listening – listening to short talk – working in China and working in Europe,
customers’
Understand questions and make appropri- ate responses and talk freely on everyday topics
communications.
● Speaking – Discussions – work in foreign, launching a new service, dissatisfied customers.
● Vocabulary / Grammar – active and passive voice, expressing results,

PRACTICES:
● Listening to understand the gist of each short dialogue
● Listening to presentations, short talks, conference presentations
● Writing proposals
● Writing sales and survey reports
● Writing memos, letters/emails
● Expressing ideas, opinions, choices about working in new places and about products

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes :

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
apply the knowledge of writing promotion
1 Apply 1,2 2,6
letters/ emails, and design brochures/
advertisements
apply suitable strategies to achieve
2 comprehen- sion, like listening for main Apply 1,2 2,6
points and checking comprehension using
contextual clues etc.
demonstrate vocabulary related to business
3 Analyze 1, 2,6
con- ferences, surveys, meetings and sales
2
budgets.
show sufficient control of Business English
4 gram- mar and sentence variety to Evaluat 1,2 2,6
coherently organise information at sentence e
and discourse levels
use functional English to communicate
5 and interact effectively in multi -cultural Create 1, 2,6
professional settings. 2

TEXT BOOKS:
1. Guy Brook Hart, Bench Mark, Cambridge University Press, 2014.

REFERENCE BOOKS:
1. Adrian Doff and Craig Thaine, “Empower Pre intermediate”, Cambridge University Press,
2015.
2. University Of Cambridge Local Examinations Syndicate, Cambridge University
press, ISBN: 9780521673136, 9780521673136.

VFSTR 67
 B.Sc - II Year II Semester

VFSTR 68
 B.Sc - II Year II Semester

22BS210 DIFFERENTIAL EQUATIONS

Hours Per Week :

L T P C
3 2 0 4

PREREQUISITE KNOWLEDGE: Introductory knowledge on differential equations, order

and degree, elementary idea on ordinary and partial differentiation.

COURSE DESCRIPTION AND OBJECTIVES:

The main purpose of the course is to introduce students to the theory and methods of
ordinary and partial differential equations. Students should be able to implement the
methods taught in the course to work associated problems, including proving results of
suitable accessibility. This course is designed to prepare students to solve problems
arising from many applications such as mathematical models of physical or engineering
processes.

MODULE–1
UNIT-1 [12L+8T+0P=20 Hours]
FIRST ORDER DIFFERENTIAL EQUATIONS
Basic concepts and genesis of ordinary differential equations, Order and degree of a
differential equation, Differential equations of first order and first degree, Equations in
which variables are separable, Homogeneous equations, Linear differential equations
and equations reducible to linear form, Exact differential equations, Integrating factor,
First order higher degree equations solvable for x, y and p, Clairaut’s form.

UNIT-2 [12L+8T+0P=20 Hours]

SECOND ORDER LINEAR DIFFERENTIAL EQUATIONS AND APPLICATIONS
Statement of existence and uniqueness theorem for the solution of linear differential
equations, General theory of linear differential equations of second order with variable
coefficients, Solutions of homogeneous linear ordinary differential equations of second
order with constant coefficients, Method of variation of parameters and method of
undetermined coefficients.

PRACTICES:
● Finding order and degree of the given differential equations.
● Justification of homogeneity.
● Finding solution to linear differential equations of first order.
● Finding solution to linear differential equations of second order.

MODULE–2
UNIT-1 [12L+8T+0P=20 Hours]
FIRST ORDER PARTIAL DIFFERENTIAL EQUATIONS
Genesis of Partial differential equations (PDE), Concept of linear and non-linear PDEs,
Methods of solution of simultaneous differential equations of the form: dx/P(x,y,z) =
dy/Q(x,y,z) = dz/R(x,y,z), Lagrange’s method for PDEs of the form:
P(x,y,z)p+Q(x,y,z)q=R(x,y,z), where p=∂z/∂x and q=∂z/∂y; Solutions passing through a
VFSTR 69
 B.Sc - II Year II Semester
given curve.

VFSTR 70
 B.Sc - II Year II Semester

UNIT-2 [12L+8T+0P=20 Hours]

SKILLS:
Extract informa- tion from equa- tions to interpretSECOND
the reality. ORDER PARTIAL DIFFERENTIAL EQUATIONS WITH CONSTANT COEFFICIENTS
Extract informa- tion from partial differential equa- tions to interpret the reality.
Know the WITH APPLICATIONS
various types of methods and their limitations Principle of superposition for homogeneous linear PDEs, Relation between solution sets
of non- homogeneous linear PDEs and their corresponding homogeneous equations,
Reducible and irreducible homogeneous equations and their solutions in various possible
cases, Solution of non-homogeneous reducible equations using Lagrange’s method for
first order equations.Practices:

PRACTICES:
● Finding solution to homogeneous linear PDEs.
● Finding solution to sets of non-homogeneous linear PDEs.
● Finding solution to reducible and irreducible homogeneous equations.
● Finding solution to non-homogeneous reducible equations.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to :

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Apply some of the basic theory of linear 1, 2, 4, 5, 9,
1 Apply 1
ODEs, recognize basic types of linear ODEs 10, 12
Recognize ODEs, PDEs and system of
2 considered equation concepts that are Apply 1 1, 2, 5, 9, 10
encountered in the real world, understand.
Defining different sets of generalized
1, 2, 3, 5, 9,
3 coordinates for a given mechanical system Analyse 2
10
and the use of canonical transformations.
Identify the physical situations formulate 1, 2, 5, 9,
4 Analyse 2
mathematical models using PDEs. 10,
12
Students are able to analyse some modern 1, 2, 5, 9,
5 Analyse 2
concepts and methodologies on ODEs and 10,
PDEs. 12

TEXT BOOKS:
1. J. Sinharoy, S. Padhy, A course in Ordinary and Partial Differential Equations,
Kalyani Publications, New Delhi, 2018.
2. V. Venkateswara Rao, N. Krishna Murthy, A text book of B.Sc. Mathematics, Vol.
I, S. Chand & Co., New Delhi, 2022.

REFERENCE BOOKS:
1. Erwin Kreyszig (2011). Advanced Engineering Mathematics (10th edition). J. Wiley & Sons.
2. B. Rai & D. P. Choudhury (2006). Ordinary Differential Equations - An
Introduction. Narosa Publishing House Pvt. Ltd. New Delhi.
3. Shepley L. Ross (2007). Differential Equations (3rd edition). Wiley.
4. George F. Simmons (2017). Differential Equations with Applications and
Historical Notes (3rd edition). CRC Press. Taylor & Francis.
5. Ian N. Sneddon (2006). Elements of Partial Differential Equations. Dover Publications.

VFSTR 71
 B.Sc - II Year II Semester

VFSTR 72
 B.Sc - II Year II Semester

22BS211 STATISTICAL INFERENCE

Hours Per Week :

L T P C
3 0 2 4

PREREQUISITE KNOWLEDGE: Basic knowledge in mathematical calculations .

COURSE DESCRIPTION AND OBJECTIVES:
This course provides the students a good foundation in the concepts of estimation and
testing of hypothesis. Upon completion of this course, student should be able to
differentiate between point estimation and interval estimation, estimate population
parameters for various distributions using maximum likelihood method and can
construct the confidence limits for population mean. Along with student can successfully
apply parametric and non-parametric test procedures to test the statistical statements.

MODULE-1
UNIT – 1 [12L+0T+8P = 20 Hours]
THEORY OF ESTIMATION
Estimation of a parameter, criteria of a good estimator – unbiasedness, consistency,
efficiency, & sufficiency. Statement of Neyman’s factorization theorem. Estimation of
parameters by the methods of moments and maximum likelihood (M.L), properties of
MLE’s. Binomial, Poisson &Normal Population parameters estimate by ML method.
Confidence intervals of the parameters of normal population.

UNIT – 2: [12L+0T+8P = 20 Hours]

CONCEPTS OF STATISTICAL HYPOTHESIS
Null and alternative hypothesis, critical region, acceptance region, two types of errors,
level of significance, power of a test, one-tailed, two- tailed tests, procedure for testing
of hypothesis, t, F and Chi-square distributions statements and properties.

PRACTICES:
● Test an estimator is good estimator or not
● Estimate population parameter of Binomial by MLE
● Estimate population parameter of Poisson by MLE
● Estimate population parameters of Normal by MLE
● Test the property of efficiency of estimator

MODULE–2
UNIT-1 [12L+0T+8P = 20 Hours
PARAMETRIC TESTS
Large Sample Tests: Large sample tests for single mean, two means, single proportion, two
proportions, standard deviation of single and double samples and fisher’s Z
transformation.
Small Sample Tests: t-test for single, double and paired tests, variance ratio test (F-test),
Chi-square test-independence of attributes

UNIT-2 [12L+0T+8P=20 Hours]

NON-PARAMETRIC TESTS

VFSTR 73
 B.Sc - II Year II Semester
Advantages and disadvantages of non-parametric tests, two sample run test, two
sample median test and two sample sign tests with applications.PRACTICES:

VFSTR 74
 B.Sc - II Year II Semester

PRACTICES:
SKILLS:
Study the ● Applications of single mean and two means by parametric methods
characteristics of good estimator ● Test the significance of single proportion and two proportions
Calculate and interpret confi- dence intervals for means
●andVerify
Test the statisti- cal significance by suitable parametric the two
non-parametric sample variances are same or not
methods
Test the statisti- cal association by chi-square test
● Test the data is random nature or not
● Applications of median and sign test

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes :

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Apply MLE methods to estimate the
1 Apply 1 1,2,3
population parameters of various
distributions
Calculate the critical values for different
2 Apply 1 1,2
hypothe-
sis tests
Construct confidence interval for means or a
3 Apply 2 1,3
proportion’s
Distinguish parametric and non-parametric
4 meth- ods and can effectively apply Analyze 2 1,2,4
suitable test to take decision about accept
or reject the hypothesis
5 Test the hypothesis by non-parametric Evaluat 2 1,2,3,4
methods e

TEXT BOOKS:
1. V. K. Kapoor and S. C. Gupta, Fundamentals of Mathematical Statistics, Sultan
Chand & Sons, New Delhi, 2002.
2. Stephen Bernstein-Ruth Bernstein, Elements of Statistics I Descriptive Statistics
and Probability, Schaum’s Outlines, 2020.
3. K.V.S. Sarma, Statistics Made Simple: Do it yourself on PC. PHI, 2nd edition, 2010.

REFERENCE BOOKS:
1. Willam Feller: Introduction to Probability theory and its applications. Volume –I, Wiley, 1971.
2. A.M. Gun, M.K. Gupta B. Dasgupta, Fundamentals of Statistics, Vol-I, the World Press, 2019.
3. Hoel P.G: Introduction to mathematical statistics, Asia Publishing house, 1984.

VFSTR 75
 B.Sc - II Year II Semester

VFSTR 76
 B.Sc - II Year II Semester

22BS212 OPERATING SYSTEMS

Hours Per Week :

L T P C
3 0 2 4
Image Source : https:// operating_system.html
PREREQUISITE KNOWLEDGE: Knowledge of computers fundamentals, Computer organization &
Digital logic and its design.

COURSE DESCRIPTION AND OBJECTIVES:

This course aims at concepts and principles of Operating Systems, its overall
responsibility inacting as an interface between the system’s hardware components and
the user. Further, it also helps students to understand the different scheduling policies,
process synchronization mechanisms, deadlock handling mechanisms and memory
management techniques.

MODULE-1
UNIT-1 [12L+0T+8P = 20 Hours]

LINUX FILE SYSTEM & PROCESS SCHEDULING

Introduction to LINUX File System: The LINUX file System, File System Hierarchy, File
system Commands, File Attributes, File Permissions.
Filters: cmp, comm, diff, head, tail, find, cut, paste, sort, uniq.
Regular Expressions: grep, egrep, fgrep, Sed- line addressing, context addressing, text editing,
substitution.
Introduction to Operating System: What Operating System do; Operating System
Structure; Process concept-overview, Process Scheduling, Operations on Process; Inter
Process Communication; Threads;
Process (CPU) Scheduling-Scheduling Criteria, Scheduling Algorithms; Multiple-Processor scheduling;

UNIT-2 [12L+0T+8P = 20 Hours]

PROCESS SYNCHRONIZATION & DEADLOCKS

Process Synchronization: The critical-section problem; Peterson’s solution; Synchronization
hardware; Semaphores; Classical problems of synchronization; Monitors.
Deadlocks: Deadlock characterization; Methods of handling deadlocks; Deadlock prevention; Deadlock
avoidance; Deadlock detection and recovery.

PRACTICES:
● Use the cat command to create a file containing the following data. Call it
mytable.txt usetabsto separate the fields.
1425 ravi 15.65
4320 ramu 26.27
6830 sita 36.15
1450 raju 21.8
6
a. Use the cat command to display the file, mytable.txt.
b. Use the vicomm and to correct any errors in the file, mytable.txt.
c. Use the sort command to sort the file mytable.txt according to the first field.
d.
e. Call thesortedfilemytable.txt (same name)
f. Printthefilemytable.txt.
VFSTR 77
 B.Sc - II Year II Semester
g. Use the cut &paste commands to swap fields 2and 3mytable.Call itmytable.txt(same name)

VFSTR 78
 B.Sc - II Year II Semester

h. Print the new file, mytable.txt.

SKILLS:
Manage open- source operating systems like Ubuntu,● Write
Fedora etc. a shell script that takes a command–line argument and reports on whether
Know the it is directory, a file, or something else.
concepts of Processes scheduling and File Systems.
● Write a shell script that accepts one or more file name as arguments and
Identification of different disk scheduling methodologies.
convertsall of them to uppercase, provided they exist in the current directory.
● Write a shell script that displays a list of all the files in the current directory to
which the user has read, write and execute permissions.
● Write a shell script that computes the total and average marks of a student according to
the
following;
• Ifaveragemarks≥69thenresultis―Distinction‖.
• Ifaveragemarks≥59and≤70thenresultis―FirstClass‖.
• Ifaveragemarks≥49and≤60thenresultis―SecondClass‖If average marks ≤50
then result is ―Pass‖.
• Note that any subject marks ≤ 40then result is―Fail‖.
• Accept student name and six subject marks through the keyboard.
● Write an interactive file-handling shell program. Let it offer the user the choice of
copying, removing, renaming, or linking files. Once the user has made a choice,
have the program ask the user for the necessary information, such as the file
name, new name and so on.
● Write a shell script, which receives two file names as arguments. It should check
whether the two file contents are same or not. If they are same then second file
should be deleted.
● Write a shell script that accepts a file name starting and ending line numbers as
arguments and displays all the lines between the given line numbers.
● Write a shell script that deletes all lines containing a specified word in one or more files
supplied
as arguments to it.
● Implementation of new process creation and its communications.
● Implement of thread creation and deletion.
● Implementation of FCFS scheduling.
● Implementation of SJF and RR Scheduling.
● Implementation of producer consumer problem.
● Implementation of Banker’s algorithm for Dead lock avoidance.

MODULE–2
UNIT-1 [12L+0T+8P = 20 Hours]

MEMORY MANAGEMENT
Memory Management: Basic concept tofmemory management, Swapping, Contiguous
Memory Allocation, Paging, Structure of the Page Table, Segmentation.
Virtual Memory Management: Demand Paging, Page Replacement: Optimal, First in First
Out (FIFO), Second Chance (SC), Not recently used (NRU), Least Recently used (LRU),
Allocation of Frames.

UNIT-2 [12L+0T+8P = 20 Hours]

SECONDARY STORAGE STRUCTURE

Secondary Storage Structure: Over view of mass-storage structure, disk structure, disk scheduling;
File System Interface - File concept, Access Methods, Directory & Disk Structure, File-
System Mounting, File Sharing, Protection; File-system structure.
File System Implementation- Directory implementation, Allocation Methods, Free Space Management.

PRACTICES:

VFSTR 79
 B.Sc - II Year II Semester
● Assume that you have a page-reference string for a process with m frames
(initially all empty). The page-reference string has length p, and n distinct page
numbers occur in it.
a) What is a lower bound on the number of page faults?
b) What is an upper bound on the number of page faults?

VFSTR 80
 B.Sc - II Year II Semester

● Consider the following page-replacement algorithms. Rank these algorithms on a

five-point scale from “bad” to “perfect” according to their page-fault rate.
Separate those algorithms that suffer from Belady’s anomaly from those that do
not.
a) LRU replacement.
b) FIFO replacement.
c) Optimal replacement.
d) Second-chance replacement.
● Consider the page reference string: 1, 2, 3, 4,2, 1, 5, 6, 2, 1, 2, 3,7, 6, 3, 2, 1, 2, 3, 6.
● How many page faults would occur for the following replacement algorithms,
assuming one, two, three, four, five, six, and seven frames? Remember that all
frames are initially empty, so your first unique pages will cost one fault each.
• LRU replacement.
• FIFO replacement.
• Optimal replacement.
● How many page fault soccur for your algorithm for the following reference string
with four page frames? 1, 2, 3,4, 5, 3, 4, 1, 6,7, 8, 7, 8, 9, 7, 8,9, 5, 4, 5,4, 2.
● What is the minimum number of page faults for an optimal page replacement
strategy for thereference string above with four page frames?
● Consider a demand-paged computer system where the degree of
multiprogramming is currently fixed at four. The system was recently measured
to determine utilization of the CPU and the paging disk. Three alternative results
are shown below. For each case, what is happening?
a) Can the degree of multiprogramming be increased to increase the CPU
utilization? Is the paging helping?
b) CPU utilization 13 percent; disk utilization 97 percent.
c) CPU utilization 87percent; disk utilization 3 percent.
d) CPU utilization 13 percent; disk utilization 3 percent.
● Implementation of Disk scheduling algorithm–FCFS.
● Implementation of Disk scheduling algorithm–SSTF and SCAN.
COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following out comes :

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Apply the concepts of file system interface
1. Apply 1,2 2,5
and implementation.
Apply the concepts of process scheduling
2 algorithms and process synchronization Apply 1 1, 2, 3, 5,
techniques to derive the efficiency of 12
resource utilization.
Classify the basic concepts of operating
3. Analyze 1 1
system and explore Linux ecosystem.
Analyze the requirements for attempting
4. Analyze 1,2 1,2,12
Operating systems principles.
Design the various memory management
5. Create 2 3,5
schemes For a given scenario.
TEXT BOOKS:
1. Sumitabha Das, Unix concepts and applications‖, TMH Publications, 4th Edition, July 2017.
2. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”, 9th
Edition, John Wiley & SonsInc, 2013.
REFERENCE BOOKS:
1. B.A.Forouzan & R.F.Giberg, “Unix and shell Programming‖”, Thomson, 1st Edition, New Delhi,
2003.
2. Richard. Stevens and Stephen A Rago, “Advanced Programming in the Unix
Environment”, 3rd Edition, Addison-Wesley, 2013.
3. William Stallings, “Operating Systems-Internals and Design principles” PHI, 7th Edition, 2012.
VFSTR 81
 B.Sc - II Year II Semester
4. Gary J. Nutt. Addison-Wesley, “Operating Systems: A Modern Perspective”, Aug 2001, 2nd
Edition.

VFSTR 82
 B.Sc - II Year II Semester

22BS213 DESIGN AND ANALYSIS OF

ALGORITHMS
Hours Per Week :

L T P C
3 0 2 4

PREREQUISITE KNOWLEDGE: Data Structures, Programming .

COURSE DESCRIPTION AND OBJECTIVES:
Upon completion of this course, students will be able to do the following:
• Analyze the asymptotic performance of algorithms.
• To solve different problems using suitable design methods such as the greedy
method, divide and conquer, dynamic programming, backtracking and branch
and bound.
• Understand the impact of the choice of data structures and algorithm design
methods on the performance.
• Synthesize efficient algorithms in common engineering design situations.
• To understand the differences between tractable and intractable problems.

MODULE-1
UNIT – 1 [12L+0T+8P = 20 Hours]

INTRODUCTION:

Algorithm, Pseudo-code for expressing algorithms, Performance analysis - Space and

Time complexity; Asymptotic notation - Big oh notation, Omega notation, Theta notation
and Little oh notation; Analysis of recursive algorithms through recurrence relations:
Substitution method, Recursion tree method, Masters theorem

DIVIDE AND CONQUER

General method, Applications - Binary search, Quick sort, Merge sort, and Stassen’s matrix
multiplication

UNIT – 2: [12L+0T+8P = 20 Hours]

GREEDY METHOD

Applications - Job sequencing with deadlines, Knapsack problem, Minimum cost spanning
trees, Single source shortest path.

MODULE–2
UNIT-1 [12L+0T+8P = 20 Hours
DYNAMIC PROGRAMMING
General method, Applications - Optimal binary search trees, Matrix chain multiplication,
0/1 knapsack problem, All pairs shortest path problem, Travelling sales person problem.

UNIT-2 [12L+0T+8P=20 Hours]

BACKTRACKING

VFSTR 83
 B.Sc - II Year II Semester
General method, Applications – n-queen problem, Sum of subsets problem, Graph coloring,
Hamiltonian
cycles.

VFSTR 84
 B.Sc - II Year I Semester

BRANCH AND BOUND PROBLEMS

SKILLS:
Develop
General method, Applications - Traveling sales person problem, 0/1 knapsack problem, algorithms for solving problems using divide
LC Branch and Bound solution, FIFO Branch and Bound solution. and conquer, greedy, dynamic programming
Analyze the given algorithm with respect to
Application of existing algorithms to
PRACTICES: solve real world problems

● Sort a given set of elements using the following methods and determine the time
required to sort the elements. Repeat the experiment for different values of n,
the number of elements in the list to be sorted and plot a graph of the time
taken versus n. The elements can be read from a file or can be generated using
the random number generator.
a. Quick sort b. Merge sort c. Bubble sort

● Search for a given set of elements using the following methods and determine the
time required to search the given element. Repeat the experiment for different
values of n, the number of elements in the list to be sorted and plot a graph of
the time taken versus n. The elements can be read from a file or can be
generated using the random number generator.
a. Linear Search b. Binary Search

● Implement the following:

a. Represent the given graph using sequential representation.

b. Find the degree of all the vertices.

c. List all the isolated vertices

● Implement the following using divide and conquer approach

a. To multiply two given square matrices.

b. To multiply two given square matrices using starssen’s matrix multiplication.

● State the problem of Job sequencing with deadlines and write a program to solve it using
Greedy method.
● State Knapsack problem and write a program to solve the knapsack problem
using Greedy approach.
● Define minimum spanning tree and write a program to find minimum spanning
tree for a given undirected graph using any algorithm of your choice.
● State all pairs shortest path problem and write a program to solve it using dynamic programming
● Explain optimal binary search tree using an example and Write a program to find
optimal binary search tree using dynamic programming.
● State the problem of Matrix chain multiplication and write a program to find
optimal order of matrix chain multiplication problem using dynamic
programming
● State n-queens problem and write a program to solve the same using backtracking approach
● Write a program to solve knapsack problem using Branch and Bound
● State the problem of sum of subsets and write a program to solve it using backtracking approach.

VFSTR 73
 B.Sc - II Year II Semester

VFSTR 74
 B.Sc - II Year I Semester

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes :

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Analyze the running times of algorithms
1 Apply 1 1,2
using asymptotic analysis
Describe the divide-and-conquer paradigm
and explain when an algorithmic design
situation calls for it. Recite algorithms that
2 Apply 2 1,3
employ this paradigm. Synthesize divide-
and-conquer algorithms. Derive and solve
recurrences describing the performance of
divide-and-conquer algorithms.
3 Design the greedy algorithms and analyze Analyze 2 1,2,4
them.
Design dynamic programming algorithms
4 Evaluat 2 1,2,3,4
and
e
analyze them.

TEXT BOOKS:
1. Ellis Horowitz, Satraj Sahni and Rajasekharam, “Fundamentals of Computer
Algorithms”, 2nd edition, Galgotia publications, 2006.

REFERENCE BOOKS:
1. Anony Levitin, “Introduction to Design and Analysis of Algorithms”, 3rd edition,
Pearson
Education, 2016.
2. Donald E.knuth, “The Art of Computer Programming”, Volume 3, 2nd edition,
Addisonwesley Longman Inc,1998.
3. Algorithms by Dasgupta, Papadimitriou, and Vazirani (McGraw-Hill, 2008)

VFSTR 75
 B.Sc - II Year II Semester

VFSTR 76
B.Sc.
VSEMESTER

 22BS30 - Linear Algebra

1
 22BS30 - Real Analysis
2
 22BS30 - Sampling
3 Techniques
 22BS30 - Econometrics
4
 2l2BS30 - Computer
5 Networks
 22BS30 - Cyber Security
6
 22BS30 - Software
7 Engineering

VI SEMESTER

COURSE
CONTENTS
 B.Sc - II Year II Semester

 - Mathematics Elective IV

 - Statistics Elective V
 - Computer Elective VI

III
 22BS30 - Project
8

I SEM & II SEM

Y E A R

VFSTR 78
VFSTR 77
 B.Sc - III Year I Semester

22BS301 LINEAR ALGEBRA

Hours Per Week :

L T P C
3 2 0 4

PREREQUISITE KNOWLEDGE: Basics of matrices, Determinant, relations and functions.

COURSE DESCRIPTION AND OBJECTIVES:
The goal of this course is to build a grasp of the fundamental concepts of matrices and
rank of a matrix using Echelon form, Normal forms. The methods for solving the system
of linear equations using Cramer’s rule, Gauss Elimination method and Gauss-Jordan
method. To find the Eigen values and Eigen vectors of a square matrices and
applications on it. To discuss vector space and its properties, Basis and Dimension and
their applications.

MODULE-1
UNIT-1: [12L+8T+0P=20 Hours]
MATRICES
RANK OF A MATRIX: Algebra of matrices, Types of matrices, Invertible matrices, Rank of
a matrix, Echelon from, Normal form.
SOLUTIONS OF LINEAR EQUATIONS: Consistency of System of linear equations, Cramer’s
Rule, Gauss Elimination method, Gauss-Jordan method.

UNIT – 2 [12L+8T+0P=20 Hours]

APPLICATIONS OF MATRICES
Eigen values and Eigen vectors: Introduction to Eigen values and Eigen vectors, Eigen
values of diagonal matrix, Eigen values of triangular matrices, Properties of an Eigen
values and Eigen vectors (without proofs).
Applications of Eigen Values and Eigen Vectors: Cayley-Hamilton theorem (without proof), Verification
of Cayley-Hamilton theorem, Power of a square matrix, Spectral matrix, Diagonalization of a matrix.
PRACTICES:
● Determine the Rank of a matrix using the definition.
● Determine the rank of a matrix using Echelon form and Normal form.
● To find the solution of system of linear equations using Cramer’s rule and Gauss Elimination
method.
● To find the solution of system of linear equations (Homogeneous and Non-homogeneous)
using Gauss-Jordan method.
● Determine the Eigen values and Eigen vectors of a square matrix which are
either diagonal matrix or triangular matrix.
● Verification of Cayley-Hamilton theorem for square matrices.
● Examine the given square matrix is diagonalizable or not.
● Using Cayley-Hamilton theorem find the powers of a matrix.

MODULE-2
UNIT – 1: [12L+8T+0P=20 Hours]
VECTOR SPACES
Vector Spaces, Bases and Dimension: Vector space, Subspace, Linear independence and
dependence of vectors, Bases and Dimension.
VFSTR
 B.Sc - III Year I Semester

VFSTR 77
 B.Sc - III Year I Semester

Linear Transformation: Linear transformations, Representation of linear transformations

SKILLS:
To discuss by matrices, Null space,
Rank-nullity theorem.
the solution of system of linear equations using other methods.
Find Eigen Val- ues and Eigen Vectors. UNIT – 2 [12L+8T+0P=20 Hours]
Apply transfor- mation to real world problems involving linear transformations.
Analyze Qua- dratic forms and its applications.
ININNER PRODUCT SPACES
Inner Product Space: Inner product spaces, Cauchy-Schwarz’s inequality, Orthogonal
basis, Gram- Schmidt orthogonalization process.
Quadratic Forms: Introduction to Quadratic forms, Reduction of Quadratic form to symmetric
matrix
form and vice-versa, Positive, negative and semi definite matrices.
PRACTICES:
● Verify the given set of vectors is linearly dependent or not.
● Verify the given set of vectors is a basis or not.
● Examine the given transformation is a linear transformation or not.
● Verify Rank-Nullity theorem for given set problems.
● To discuss the applications of Orthogonal vectors and linearly independent.
● Find the Orthonormal basis to the given set of vectors using Gram-Schmidt
Orthogonalization process.
● Discuss the Quadratic forms.
● Determine the nature of the Quadratic form.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to :

CO Bloom Modul Mappin

Course Outcomes
No. s e g with
Level No. POs
Apply the concepts of matrices and the 1, 2, 4,
1 Apply 1
methods to solve the system of equations. 9,10,12
Apply the concepts of vector spaces, 1, 2, 4,
2 Apply 2
subspaces, bases, dimension. 9,10,12
Evaluate inverse and power of a matrix by 1, 2, 4,
3 Evaluate 1
Caley Hamilton theorem. 9,10,12
1, 2, 4,
4 Determine orthogonality in inner product Evaluate 2
9,10,12
spaces.

TEXT BOOKS:
1. Gilbert Strang, “Linear Algebra”, Wellesley-Cambridge Press, 5th edition, 2016
2. V. Krishnamurthy, V. P. Mainra ,J.l. Arora, “An introduction to linear algebra”, 3rd Edition,
2014.

REFERENCE BOOKS:
1. N. P. Bali, K. L. Sai Prasad, “A Textbook of Engineering Mathematics I, II, III”,
Universal Science Press, New Delhi, 2018, 2nd Edition.
2. B. S. Grewal, “Higher Engineering Mathematics”, Khanna Publishers, 44 Edition, 2018.
3. Erwin Kreyszig, “Advanced Engineering Mathematics”, 10th Edition, John Wiley
and Sons, Inc, ISBN: 9780470458365.2018
4. H. K. Dass and Er. Rajanish Verma, “Higher Engineering Mathematics”, S. Chand
and Co., Third revised edition, 2015.

VFSTR 78
 B.Sc - III Year I Semester

VFSTR 79
 B.Sc - III Year I Semester

22BS302 REAL ANALYSIS

Hours Per Week :

L T P C
3 2 0 4

PREREQUISITE KNOWLEDGE: sets of numbers, real line, real functions.

COURSE DESCRIPTION AND OBJECTIVES:
Learn the elementary concepts and basic ideas involved in REAL NUMBERS and ORDRED
RELTIONS. Analyse the sequences and series of real numbers. Develop the ability to test
the continuity and evaluate derivatives of real functions (by definitions). Understand the
fundamental concepts of real functions

MODULE-1
UNIT – 1 [12L+8T+0P=20 Hours]
REAL NUMBERS
The algebraic and order properties of R, Absolute value and Real line, Completeness
property of R, Applications of supreme property; intervals (Review).
Real Sequences: Sequences and their limits, Range and Boundedness of Sequences,
Limit of a sequence and Convergent sequence.
The Cauchy’s criterion, properly divergent sequences, Monotone sequences, Necessary
and Sufficient condition for Convergence of Monotone Sequence, Limit Point of
Sequence, Sub sequences and the Bolzano-weierstrass theorem – Cauchy Sequences –
Cauchey’s general principle of convergence theorem.

UNIT – 2 [12L+8T+0P=20 Hours]

INFINITIE SERIES
Series: Introduction to series, convergence of series. Cauchey’s general principle of
convergence for series tests for convergence of series, Series of Non-Negative Terms.
1. P-test, Cauchy’s nth root test or Root Test, D’-Alembert’s’ Test or Ratio Test.
2. Alternating Series – Leibnitz Test.
Absolute convergence and conditional convergence, semi convergence.

PRACTICES:
● To test sequences for convergence
● To test the series for convergence.
● To test an alternating series for convergence
● To test absolute convergence of serie
● To test conditional convergence of series.

MODULE–2
UNIT-1 [12L+8T+0P=20 Hours

CONTINUITY
Limits: Real valued Functions, Boundedness of a function, Limits of functions. Some extensions of the
limit concept, Infinite Limits. Limits at infinity. (Review only)
Continuous functions: Continuous functions, Combinations of continuous functions,

VFSTR 80
 B.Sc - III Year I Semester
Continuous Functions on intervals, uniform continuity.

VFSTR 81
 B.Sc - III Year I Semester

UNIT-2 [12L+8T+0P=20 Hours]

SKILLS:
Be able to grasp nature of sequences and series
DIFFERENTIATION
Demonstrate understanding of continuity and differentiability. AND MEAN VALUE THEORMS
Use of mean value theorems. The derivability of
a function, on an interval, at a point, Derivability and continuity of a
function, Graphical meaning of the Derivative, mean value Theorems; Role’s Theorem,
Lagrange’s Theorem, Cauchhy’s Mean value Theorem.

PRACTICES:

Problems on BST – Level 1

● To test continuity of a function at a point.
● To identify discontinuities.
● To test derivability of a function
● To Prove mean value theorem.
● To test uniform continuity at a point.
COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to :

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Outline the various properties and apply for 1, 2, 4, 5, 9,
1 Apply 1
differ- ent real sets. 10, 12
2 Identify the nature of a sequence Apply 1, 1, 2, 5, 9, 10
2
1, 2, 3, 5, 9,
3 Analyse infinite series Analyze 1,
10
2
1, 2, 5, 9,
4 Inspect continuity of a function Analyze 2
10,
12
1, 2, 3, 4, 5,
5 Evaluate the derivatives of various functions. Evaluat 1,
9, 10, 12
e 2

TEXT BOOKS:
1. A Text Book of B.Sc Mathematics by B.V.S.S. Sarma and others, Published by S.
Chand & Co., New Delhi, 2021.
2. Elements of Real Analysis as per UGC Syllabus by Shanthi Narayan and Dr. M.D. Raisingkania
S. Chand & Co., New Delhi, 2021.

REFERENCE BOOKS:
1. Walter Rudin, Principle of Mathematical Analysis (3rd edition) McGraw-Hill
Kogakusha, 1976, International Student Edition.
2. K. Knopp, Theory and Application of Infinite Series.
3. T. M. Apostol, Mathematical Analysis, Narosa Publishing House, New Delhi, 1985.
4. H. L., Royden, Real Analysis, 4th Edition, Macmillan, 1993.
5. E. Hewitt and K. Stromberg, Real and Abstract Analysis, Springer, 1969.

VFSTR 82
 B.Sc - III Year I Semester

VFSTR 83
 B.Sc - III Year I Semester

22BS303 SAMPLING TECHNIQUES

Hours Per Week :

L T P C
2 0 2 3

PREREQUISITE KNOWLEDGE: Basic knowledge in probability and estimation.

COURSE DESCRIPTION AND OBJECTIVES:

To discuss various sampling techniques that can be used to select potential respondents
to a survey. The objective of a descriptive survey study is simply to obtain certain
information about a population of interest. The objective of an analytical survey study is
to make comparisons between different subgroups of a population.

MODULE–1
UNIT-1 [8L+0T+8P = 16 Hours]

SAMPLING THEORY
Sampling Theory: Principal steps in a sample survey, censes versus sample survey,
sampling and non-sampling errors. Types of sampling - subjective, probability and mixed
sampling methods. Simple Random Sampling: Meaning of Samples and methods to
draw, estimation of population means,

UNIT-2 [8L+0T+8P = 16 Hours]

SIMPLE RANDOM SAMPLING

Variances in SRSWR& SRSWOR. Simple random sampling of Attributes, size of simple random sample
for specified precision.

PRACTICES:
● Describing and reviewing the steps in a sample survey
● Classifying sampling errors
● Estimating the population mean from the suitable data
● Estimation of population Mean, variance by SRSWOR.
● Estimation of population Mean, variance by SRSWR.
● Comparison of proportional, optimum allocations with SRSWOR.

MODULE–2
UNIT-1 [8L+0T+8P = 16 Hours]

STRATIFIED RANDOM SAMPLING

Stratified random sampling: Advantages and Disadvantages of above methods of
sampling. Systematic sampling: Systematic sampling when N = nk comparison of their
relative efficiencies

UNIT-2 [8L+0T+8P = 16 Hours]

SYSTEMATIC SAMPLING
Variances in Proportional and optimum allocation of sample sizes in stratification.
Systematic sampling Vs Stratified random sampling. Systematic sampling in the

VFSTR 84
 B.Sc - III Year I Semester
presence of general linear trend. Merits and Demerits of Systematic sampling, circular
systematic sampling.

VFSTR 85
 B.Sc - III Year I Semester

PRACTICES:
SKILLS:
Conduct a sam- ple survey and asses the errors ● Differentiating optimum and proportional allocation techniques
Discuss different sampling tech- niques for differ- ent purposes
● Differentiating stratified and systematic sampling techniques
Differentiating the sample size required in two allocation schemes in stratified tech- nique.
Drawing system- atic samples for an application. ● Finding the efficiencies between the techniques
● Advantages and disadvantages in systematic sampling
● Systematic Sampling.

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes :

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
1 Design sample surveys for a particular Apply 1 1,2,3
purpose
Estimate the variances of the samples in
2 Apply 1 1,2
different
schemes
3 Apply the concepts of conducting sample Apply 1 1,3
surveys
Distinguish between the different sampling
4 Analyze 2 1,2,4
schemes

TEXT BOOKS:
1. Prof.K.Srinivasa Rao, Dr D.Giri. Dr A.Anand, Dr V.Papaiah Sastry, BA/BSc III year
paper - III Statistics - Applied Statistics - Telugu academy, 2019.
2. K.V.S. Sarma: Statistics Made Simple: Do it yourself on PC. PHI, 2020.

REFERENCE BOOKS:
1. Fundamentals of applied statistics: VK Kapoor and SC Gupta,
2. Indian Official statistics - MR Saluja.
3. Anuvarthita Sankyaka Sastram - Telugu Academy.

VFSTR 86
 B.Sc - III Year I Semester

VFSTR 87
 B.Sc - III Year I Semester

22BS304 ECONOMETRICS

Hours Per Week :

L T P C
2 2 0 3

PREREQUISITE KNOWLEDGE: Basic knowledge in economics, statistics, and mathematics

COURSE DESCRIPTION AND OBJECTIVES:

The main objective of this course is to provide the knowledge to the students about the
basics of econometrics, two-variable linear and dummy variable regression models,
multicollinearity, and heteroscedasticity.

MODULE–1
UNIT-1 [8L+8T+0P = 16 Hours]

SINGLE-EQUATION REGRESSION MODELS

The Nature of Regression Analysis, Two-Variable Regression Analysis: Some Basic Ideas,
Two-Variable Regression Model: The Problem of Estimation, Classical Normal Linear
Regression, Model (CNLRM), Two-Variable Regression: Interval Estimation and
Hypothesis Testing,

UNIT-2 [8L+8T+0P = 16 Hours]

CALIBRATION OF INSTRUMENTS
Extensions of the Two-Variable, Linear Regression Model, Multiple Regression Analysis:
The Problem of Estimation, Multiple Regression Analysis: The Problem of Inference
Dummy Variable Regression Models.

PRACTICES:
● Basic ideas of two-variable regression analysis
● two-variable regression model
● Interval Estimation
● Hypothesis testing

MODULE–2
UNIT- 1 [8L+8T+0P = 16 Hours]

MULTICOLLINEARITY
The Nature of Multicollinearity, Estimation in the Presence of Perfect Multicollinearity,
Estimation in the Presence of “High” but “Imperfect” Multicollinearity, Practical
Consequences of Multicollinearity, and Detection of Multicollinearity.

UNIT- 2 [8L+8T+0P = 16 Hours]

HETEROSCEDASTICITY
The Nature of Heteroscedasticity, OLS Estimation in the Presence of Heteroscedasticity,
The Method of Generalized Least Squares (GLS): Difference between OLS and GLS,
Consequences of Using OLS in the Presence of Heteroscedasticity, Detection of
Heteroscedasticity: Informal Methods Formal Methods.

PRACTICES:

VFSTR 88
 B.Sc - III Year I Semester
● Presence of Perfect Multicollinearity
● Practical Consequences of Multicollinearity,

VFSTR 89
 B.Sc - III Year I Semester

● Detection of Multicollinearity.
SKILLS:
Applications ● Nature of Heteroscedasticity
of two-variable regression, non-linear ● Difference between OLS and GLS
regression, and dummy variable regression
● Detection
Meaning of Detection of Heterosce- dasticity and consequences of Heteroscedasticity
of Heteroscedastic- ity
Nature of
Multicollinearity and identify COURSE OUTCOMES:
the methods of detecting Multi- collinearity
By the end of this course, it is expected that the student will be able to learn the following aspects
:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Understand the applications of two variable
1 regression models and estimation and Apply 1 1,2
testing of parameters.
Understand the applications of multiple
2 Apply 1 1,2
linear regres-sion and dummy variable
regression
Analyze the concept of multicollinearity and
3 Analyze 2 1,2,3
practical implications
Evalu
4 Evaluate the consequences of 2 1,2,4
-
Heteroscedasticity
ate
Evaluate the practical consequences of
Evalu
5 multi collinear-ity and methods of 2 1,4,5
-
Detection of Heteroscedasticity
ate

TEXTBOOKS:
1. Damodar N. Gujarati, Dawn C. Porter. (2009). Gujarati: Basic Econometrics,
5th edition. McGraw-hill.
2. Goldberger, Arthur S(1991). A Course in Econometrics. Cambridge, MA: Harvard
University Press.

REFERENCEBOOKS:
1. Holly, S., Weale, M., & Corby, B. (Eds.). (2000). Econometric modelling:
Techniques and applications (Vol. 41). Cambridge University Press.
2. Intrilligator, MD(1980): Econometric Models, Techniques and Applications, PHI.

VFSTR 90
 B.Sc - III Year I Semester

VFSTR 91
 B.Sc - III Year I Semester

22BS823 COMPUTER NETWORKS

Hours Per Week :

L T P C
Source: https:// snabaynetworking. com
3 0 2 4

PREREQUISITE KNOWLEDGE: JAVA programming and UNIX commands.

COURSE DESCRIPTION AND OBJECTIVES:

This course focuses on imparting knowledge about various protocols involved in LANs
and WANs. In addition, it gives a good foundation on different protocols such as data link
protocols, internet protocols, and transport protocols present in the respective layers of
the data communication system.

MODULE –1
UNIT-1 [8L+0T+6P = 14 hours]
INTRODUCTION TO COMPUTER NETWORKS AND INTERNET
Understanding of network and Internet, the network edge, the network core,
Understanding of Delay, Loss and Throughput in the packet switching network, protocols
layers and their service model, History of the computer network.

UNIT-2 [16L+0T+10P = 26 hours]

APPLICATION LAYER & TRANSPORT LAYER :
Principles of computer applications, Web and HTTP, E-mail, DNS, Socket programming
with TCP and UDP.
Introduction and transport layer services, Multiplexing and Demultiplexing,
Connectionless transport (UDP), Principles of reliable data transfer, Connection-oriented
transport (TCP), Congestion control.
PRACTICES:
● Install Network Simulator 2/3. Create a wired network using dumbbell topology.
Attach agents, generate both FTP and CBR traffic, and transmit the traffic. Vary
the data rates and evaluate the performance using metric throughput, delay,
jitter and packet loss.
● Create a static wireless network. Attach agents, generate both FTP and CBR traffic,
and transmit the traffic. Vary the data rates and evaluate the performance using
metric throughput, delay, jitter and packet loss.
● Create a mobile wireless network. Attach agents, generate both FTP and CBR
traffic, and transmit the traffic. Vary the data rates and evaluate the
performance using metric throughput, delay, jitter and packet loss.
● Implementation of one-way and two-way communication using TCP / UDP.
● Hello command is used to know whether the machine at the other end is working
or not. Echo command is used to measure the round trip time to the neighbour.
Implement Hello and Echo commands using JAVA.
MODULE –2
UNIT-1 [12L+0T+8P = 20 hours]
NETWORK LAYER
Introduction to forwarding and routing, Network Service models, Virtual and Datagram
networks, study of router, IP protocol and addressing in the Internet, Routing algorithms,
Broadcast and Multicast routing.
UNIT-2 [12L+0T+8P = 20 Hours]

VFSTR 92
 B.Sc - III Year I Semester
THE LINK LAYER AND LOCAL AREA NETWORKS
Introduction to link layer services, error detection, and correction techniques, Multiple
access protocols, addressing, Ethernet, switches, and VLANs.

VFSTR 93
 B.Sc - III Year I Semester

PRACTICES:
SKILLS:
Establish local area networks with different topologies.● Find all the IP addresses on your network using Unicast, Multicast, and Broadcast
Design of new routing proto- cols. on your network.
Network
● Use Packet
troubleshooting such as install- ing network interface card drivers, setting IPtracer software
addresses, to build
subnet masking, etc. network topology and configure using Distance
vector
routing and Link State routing protocols.
● Study different types of Network cables (Copper and Fiber) and prepare cables (Straight
and
Cross) to connect two or more systems.
a. Use a crimping tool to connect jacks.
b. Use a LAN tester to connect the cables.
c. Install and configure Network Devices: HUB, Switch and Routers (Consider both
manageable and non-manageable switches. Perform logical configuration of the
system and set the bandwidth of different ports).
d. Install and Configure Wired and Wireless NIC and transfer files between systems in Wired
LAN and Wireless LAN. Consider both ad-hoc and infrastructure modes of operation.
● Apply the commands such as Ping, Tracert, Ipconfig, pathping, telnet, FTP, getmac, ARP,
Hostname, Nbtstat, netdiag, and Nslookup to solve various problems.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to :

Mod-
CO Blooms Mapping
Course Outcomes ule
No. Level with POs
No.
Build the basic concepts of Network
1 Apply 1 1, 2, 12
hardware, software and reference models.
Demonstrate various protocols involved in
2 Apply 2 1,2, 5
data link layer operations.
3 Implement various protocols with modern Apply 1 1, 2, 3, 5,
tools. 12
Evaluate different physical layer media and
4 Evaluat 1 1, 2, 5, 12
switching methods.
e
Apply different protocols to perform end-to-
5 Analyze 2 1, 2, 12
end
delivery and interaction with users.
Analyze various design issues, protocols and
6 Analyze 2 1, 2, 12
functionalities of network layer.

TEXT BOOKS:
1. Kurose and Ross, “Computer Networking- A Top-Down approach”, 6th Edition, Pearson, 2017.
2. Behrouz Forouzan, “Computer Networks- A Top-Down approach”, McGraw Hill, 2014.

REFERENCE BOOKS:
1. Andrew S. Tanenbaum, “Computer Networks”, 5th edition. Pearson Education, 2014.
2. Behrouz A. Forouzan, “Data communications and Networking”, 5th edition, TMH, 2017.
3. William Stallings, “Data and Computer Communications”, 10th edition, Pearson
Education, 2017.
4. Fred Halsall, “Computer Networking and the Internet”, 5th edition, Addison Wesley, 2005.

VFSTR 94
 B.Sc - III Year I Semester

VFSTR 95
 B.Sc - III Year I Semester

22BS306 CYBER SECURITY

Hours Per Week :

L T P C
2 2 0 3
PREREQUISITE KNOWLEDGE: Computer Networks.

COURSE DESCRIPTION AND OBJECTIVES:

This course covers the fundamental aspects of information security. It will look at the
attacks, services, security process, security maintenance as well as various techniques
used by hackers. Other topic covered includes operating system security, E-Commerce
services and architecture used in E-Commerce applications.

MODULE –1
UNIT-1 [8L+8T+0P = 16 Hours]

INFORMATION SECURITY BASICS:

Defining Information Security, Brief History of Security, Security as a Process, Not Point
Products, CIA in Information Security Information Security Process: Introduction to
Assessment, Conduct an Assessment, Importance of Policy, Types of Policy-Information
Policy, Security Policy, Computer Use Policy, Internet Use Policy, Creating Appropriate
Policy, Develop a Policy, Implement Security, Conduct Awareness Training, Conduct
Audits.

UNIT-2 [8L+8T+0P = 16 Hours]

SECURITY ATTACKS, SERVICES:

Introduction- Security Attacks, Types of attacks-Access attacks, Modification Attacks,
Denial of service Attack, Repudiation Attacks Information Security Services:
Confidentiality, Integrity, Availability, Accountability. Hacker Techniques: Introduction-
Identify Hackers Motivation, Historical Hacking Techniques, Advanced techniques,
Malicious Code, Methods of the Targeted Hacker, Untargeted Hacker.

MODULE –2
UNIT-1 [8L+8T+0P = 16 Hours]
OPERATING SYSTEM SECURITY:
Introduction-Operating system Security, Unix Security Issues, Windows NT Security
Issues, Windows 2000 Security Issues, System Access Threats- Intruders, Buffer
Overflow, Access control, Operating System Hardening, Security maintenance.
UNIT-2 [8L+8T+0P = 16 Hours]
E-COMMERCE SECURITY NEEDS :
Introduction-E-Commerce Services, Understand the Importance of Availability,
Implement Basic Security -Client-Side Security, Server–Side Security, Application
Security, Database Security, Develop E-Commerce Architecture.

PRACTICES:
● Learn about the CIA Triad
● Understand the most common security frameworks in use today
● Learn the basics of the ISO 27000 series framework
● Key aspects of risk management including risk identification, risk mitigation, and risk
● controls

VFSTR 96
 B.Sc - III Year I Semester
● Obtain a foundational understanding of cyberattacks and cybersecurity

VFSTR 97
 B.Sc - III Year I Semester

COURSE OUTCOMES:
SKILLS:
Develop security awareness pro- gram. Upon successful completion of this course, students will have the ability to :
Understand the information
security aspects
Mod-
and find out CO Blooms Mapping
the various security services to counter the attacks. No. Course Outcomes ule
Level with POs
Design and analyze of No.
E-commerce model services.
Study in con- sistence and vulnerabilities in computer1systems.
Analyse the security aspects needed for Analyse 1 1,2,3
information
Implement security attacks and various
2 Analyse 1 1,2,3
services provided to enhance the security
system
3 Analyze the operating systems security. Analyse 2 1,2,3
Design and develop e-commerce
4 Analyse 2 1,2,3
architecture by understanding e-commerce
security needs

TEXT BOOKS:
1. Eric Maiwald “Fundamentals of Network Security” McGraw Hill, 2010.
2. William Stallings, “Operating Systems Internals and Design Principles”, Pearson
education, Eighth Edition, 2018

REFERENCE BOOKS:
1. Cyber Security Essentials, James Graham, Richard Howard and Ryan Otson, CRC Press.
2. Introduction to Cyber Security, Chwan-Hwa(john) Wu,J. David Irwin, CRC Press T&F Group.

VFSTR 98
 B.Sc - III Year I Semester

VFSTR 99
 B.Sc - III Year I Semester

22BS307 SOFTWARE ENGINEERING

Hours Per Week :

L T P C https://artoftesting. com/software- engin

2 2 0 3

PREREQUISITE KNOWLEDGE: Data Base Management Systems, Oops through Java.

COURSE DESCRIPTION AND OBJECTIVES:

This course focuses on the concepts of software life cycle, role of process models and
methods to prepare software requirement specification document. In addition to that, it
also imparts knowledge of design, development, and testing of software. The objective
of this course is to enable the student to develop efficient, cost effective, feasible
software as per user requirements.

MODULE–1
UNIT-1 [8L+8T+0P=16 hours]
INTRODUCTION

Introduction to Software Engineering: Introduction to Software and Software engineering,

Software characteristics, Software project, Software myths, Project Planning, Scheduling
and Management.

Generic View of Process: Software Engineering - A layered technology, A process

framework, Software Development Life Cycle (SDLC), The Capability Maturity Model
Integration (CMMI).

Process Models: Conventional Model, Agile process models - Unified process model, Extreme
Programming, Scrum.

UNIT-2 [8L+8T+0P=16 hours]

REQUIREMENTS ENGINEERING :
Requirements Engineering: Functional and Non-functional requirements, User
requirements, System requirements, Requirement engineering tasks, formal
requirements specification and verification, Feasibility Study.
BUILDING THE ANALYSIS MODEL
Data modeling - Data objects, Attributes, Relationships, Cardinality and modality. Class based modeling
- Identify analysis classes, specify attributes and Define operations.
DESIGN ENGINEERING
Design model, Design concepts. Creating an Architectural Design-Architectural styles and patterns.
PERFORMING USER INTERFACE DESIGN
Golden rules; User interface analysis and design.

PRACTICES:
Laboratory session of this course is designed in such a way that the student should
complete three projects of the given type by performing the below experiments.

VFSTR 100
 B.Sc - III Year I Semester
● Development of software requirements specification using Mind-Map tool.
● Project planning using Gantt charts.

VFSTR 101
 B.Sc - III Year I Semester

● Project estimation using metrics.

SKILLS:
● ways
Know the soft- ware require- ments and find out various Capture
to gatherUse Case them.
and specify Scenarios and model UML Use Case Diagrams.
Choose a ● Model the UML state chart and Activity diagrams.
process model for develop- ing software
● Model the UML Class and Sequence diagrams.
solutions without schedule/ effort overruns and good quality.
Analyse and model (dia- grammatical representations) a software prod- uct.

MODULE–2

UNIT-1 [8L+8T+0P=16 hours]

TESTING

Testing Strategies: A strategic approach to software testing, Unit testing, Integration

testing, Validation testing, System testing,
Testing Tactics: Black-Box and White-Box testing techniques, Art of debugging.
Product Metrics: Metrics for analysis model; Metrics for design model, Metrics for source
code; Metrics for testing; Metrics for maintenance.

UNIT-2 [8L+8T+0P=16 hours]

RISK AND QUALITY MANAGEMENT

Risk Management: Software risks, Risk identification; Risk projection; Risk refinement, Reactive vs
Proactive risk strategies, RMMM.
Quality Management: Quality concepts, Formal technical reviews, Statistical Software
Quality Assurance.
Computer-Aided Software Engineering (CASE): Use of appropriate CASE tools-
Requirement engineering tools, Project planning tools, Testing tools.

PRACTICES:
Laboratory session of this course is designed in such a way that the student should
complete three projects of the given type by performing the below experiments.

● Estimate the test coverage and Structural complexity of product using metrics.
● Develop the test cases for all the functional requirements of projects selected.
● Perform the functional testing using Selenium tool.

LIST OF PROJECTS:
Project-1: A Point-Of-Sale (PoS) System: A POS system is a computerized application
used to record sales and handle payments; it is typically used in a retail store, it
includes hardware components such as a computer and bar code scanner, and software
to run the system. It interfaces to various service applications, such as a third-party tax
calculator and inventory control. These systems must be relatively fault tolerant; that is,
even if remote services are temporarily unavailable they must still be of capturing sales
and handling at least cash payments. A POS system must support multiple and varied
client-side terminals and interfaces such as browser, PDAs, touch-screens.
Project-2: Online Bookshop Example: Following the model of amazon.com or bn.com,
design and implement an online bookstore.
Project-3: A Simulated Company: Simulate a small manufacturing company. The
resulting application will enable the user to take out a loan, purchase a machine, and
over a series of monthly production runs, follow the performance of their company.
Project-4: A Multi-Threaded Airport Simulation: Simulate the operations in an airport.
Your application should support multiple aircrafts using several runways and gates

VFSTR 102
 B.Sc - III Year I Semester
avoiding collisions/ conflicts. Landing: an aircraft uses the runway, lands, and then taxis
over to the terminal. Take-Off: an aircraft taxies to

VFSTR 103
 B.Sc - III Year I Semester

the runway and then takes off.

Project-5: An Automated Community Portal: Business in the 21st Century is above all BUSY.
Distractions are everywhere. The current crop of “enterprise intranet portals” is often high
noise and low value, despite the large capital expenditures it takes to stand them up.
Email takes up 30 - 70% of an employee’s time. Chat and Instant Messaging are either
in the enterprise or just around the corner. Meanwhile, management is tasked with
unforeseen and unfunded leadership and change-agent roles as well as leadership
development and succession management. What is needed is a simplified, repeatable
process that enhances communications within an enterprise, while allowing
management and peers to self-select future leaders and easily recognize high
performance team members in a dynamic way. Additionally, the system should function
as a general-purpose content management, business intelligence and peer-review
application. Glasscode’s goal is to build that system.

Project-6: Content Management System: The goal is to enable non-technical end users to
easily publish, access, and share information over the web, while giving administrators
and managers complete control over the presentation, style, security, and permissions.
Features: Robust Permissions System, Templates for easy custom site designs, Total
control over the content, Search engine friendly URL’s, Role based publishing system,
Versioning control, Visitor profiling.

Project-7: An Auction Application: Several commerce models exist and are the basis for
several companies like eBay.com, pricellne.com etc. Design and implement an auction
application that provides auctioning services. It should clearly model the various
auctioneers, the bidding process, auctioning etc.

Project-8: A Notes And File Management System: During one’s student years and
professional career one produces a 1 lot of personal notes, documents. All these
documents are usually kept 1 on papers or individual files on the computer. Either way
the bulk of the information is often erased corrupted and eventually lost. The goal of this
1 project is to build a distrib- VFSTR 106 III Year I Semester uted software application
that addresses this problem. The system will provide an interface to create, organize and
manage personal notes through the Internet for multiple users. The system will also
allow users to collaborate by assigning permissions for multiple users to view and edit
notes.

Project-9: Library Management System(LMS): The goal is to enable students and

librarians to easily access and manage the library and run it smoothly. Each physical
library item - book, tape cassette, CD, DVD, etc. could have its own item number. To
support it, the items may be barcoded. The purpose of barcoding is to provide a unique
and scannable identifier that links the barcoded physical item to the electronic record in
the catalog. Barcode must be physically attached to the item, and barcode number is
entered into the corresponding field in the electronic item record. Barcodes on library
items could be replaced by RFID tags. The RFID tag can contain item’s identifier, title,
material type, etc. It is read by an RFID reader, without the need to open a book cover
or CD/DVD case to scan it with barcode reader.

Project-10: Hospital Management System: Simulate to show and explain hospital structure, staff, and
VFSTR 104
 B.Sc - III Year I Semester
relationships with patients, and patient treatment terminology

Project-11: Draft Software Requirement Analysis for the following Problem Statement:
Fuel Delivery System: An unattended petrol (gas) pump system that includes a credit
card reader. The customer swipes the card through the reader and then specifies the
amount of fuel required. The fuel is delivered,

VFSTR 105
 B.Sc - III Year I Semester

and the customer’s account debited.

COURSE OUTCOMES:
The students will be able to :

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Use basic concepts of software
1 Apply 1 1, 11
engineering for de-signing software
product
Apply different testing techniques to ensure
2 bug free software and metrics to measure Apply 2 4, 5, 11
the software size, complexity, and budget
etc
Compare different process models and
Evalu
3 identify appropriate process model 1 2, 4
-
based on project re-quirements
ate
Build Software Requirement Specification
4 Create 1 3, 5
(SRS)
document for any software product
Design of solutions using UML diagrams like
5 Create 1 3, 4, 5
Use case, Sequence diagrams etc
Create an appropriate architecture for a
6 Create 2 5
given pro- ject that meets all quality
constraints

TEXT BOOKS:
1. Roger S. Pressman, “Software Engineering, A practitioner’s Approach”, 6th
Edition, McGrawHill International Edition, 2008.
2. Booch G., Rumbaugh J. and Jacobsons I, “The Unified Modeling Language User Guide”, 2nd
Edition, Addison Wesley, 2005.

REFERENCE BOOKS:
1. Simon Sennet, Steve McRobb and Ray Farmer, “Object Oriented Systems Analysis
and Design, 2nd edition, 2004.
2. Dr. Pankaj Jalote “Software Engineering: A Precise Approach” –edition 2010

VFSTR 106
 B.Sc - III Year I Semester

VFSTR 107
 B.Sc - III Year I Semester

ELECTIVE
S

B.Sc  22BS80
1
- Analytical Geometry

.
 22BS80 - Graph Theory
2
 22BS80 - Numerical Analysis
3

22BS80 - Complex Analysis
 4
22BS80 - Number Theory
 5
 22BS80 - Integra l Transforms
6
 22BS81 - Design of Experiments
 1
22BS81 - Statistical Analysis through SPSS/R
 2
 22BS81 - Advanced Probability
3
 22BS81 - Operations Research
4

22BS81 - Applied Statistics
 5
22BS82 - Formal Language and Automata Theory
 1
22BS82 - Machine Learning
2
22BS82 - Web Technologies
3
22BS82 - Python Programming
4

VFSTR 108
 COURSE
CONTENTS
I SEM & II SEM
 B.Sc - Department Electives

22BS801 ANALYTICAL GEOMETRY

Hours Per Week :

L T P C
3 2 0 4

PREREQUISITE KNOWLEDGE: Basic idea on shapes, geometrical structures and their

equations. Introductory knowledge on arithmetic operations and numerical ability.

COURSE DESCRIPTION AND OBJECTIVES:

The objective of the course is to make student acquainted with some important
concepts of geometry with various structures such as plane, line, sphere, cones and
cylinders. This course also deals with many significant applications of various geometric
structures that are found in engineering science, industry and other real time
environments

MODULE –1
UNIT-1 [12L+8T+0P=20 Hours]

THE PLANE
Equation of plane in terms of its intercepts on the axis, Equations of the plane through
the given points, Length of the perpendicular from a given point to a given plane,
Bisectors of angles between two planes, Combined equation of two planes, Orthogonal
projection on a plane.

UNIT-2 [12L+8T+0P=20 Hours]

THE LINE WITH APPLICATIONS
Equation of a line; Angle between a line and a plane; The condition that a given line
may lie in a given plane; The condition that two given lines are coplanar; Number of
arbitrary constants in the equations of straight line; Sets of conditions which determine
a line; The shortest distance between two lines; The length and equations of the line of
shortest distance between two straight lines; Length of the perpendicular from a given
point to a given line.

PRACTICES:
● Finding equation of planes.
● Evaluating angle between planes.
● Justification of planes and their orthogonality.
● Evaluating length of the lines.
● Evaluation of distance between two straight lines.
● Evaluation of Length of the perpendicular from a given point to a given line.

MODULE –2
UNIT-1 [12L+8T+0P=20 Hours]

SPHERE AND CONES

Definition and equation of the sphere; Equation of the sphere through four given points; Plane sections
of a sphere; Intersection of two spheres; Equation of a circle; Sphere through a given circle;
Definitions of a cone; vertex; guiding curve; generators; Equation of the cone with a
given vertex and guiding curve; Enveloping cone of a sphere; Equations of cones with
vertex at origin are homogenous; Condition that the general equation of the second

VFSTR 95
 B.Sc - Department Electives
degree should represent a cone; Condition that a cone may have three mutually
perpendicular generators;

VFSTR 96
 B.Sc - Department Electives

UNIT-2 [12L+8T+0P=20 Hours]

SKILLS:
Determining tangent plane. CYLINDERS WITH APPLICATIONS
Determining plane of contact.
Radical plane; Coaxial system of spheres. Definition of a cylinder; Equation to the cylinder whose generators intersect a given
conic and are parallel to a given line; Enveloping cylinder of a sphere; The right circular
cylinder; Equation of the right circular cylinder with a given axis and radius.

PRACTICES:
● Finding equation of spheres.
● Evaluation of intersections of two spheres.
● Evaluation of intersections of two spheres and lines.
● Finding the equation of a cone, right circular cone.
● Finding enveloping cone of a sphere.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to :

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Able to apply the concepts of equations 1, 2, 4, 5, 9,
1 Apply 1
of lines. 10, 12
2 Understand and apply the concepts of Apply 1 1, 2, 5, 9, 10
planes.
Able to understand and apply the
concepts of finding equation of a
cylinder, Equation to the cylinder
1, 2, 5, 9, 10,
3 whose generators intersect a given Apply 2
12
conic and are parallel to a given line,
Enveloping cylinder of a sphere, The
right circular cylinder, Equation of the
right circular cylinder with a given axis
and radius.
Understand and analyse the concepts of
4 Analys 2 1, 2, 3, 5, 9,
spheres.
e 10
Able to find equation of a cones as well
1, 2, 5, 9, 10,
5 as right circular cones, understand to Analys 2
12
determine enveloping cone of a sphere e
etc.

TEXT BOOKS:
1. Analytical Solid Geometry by Shanti Narayan and P. K. Mittal, S. Chand & Co.,
7th Edition, 2015.
2. A text book of Mathematics for BA/B.Sc. Vol 1, by V Krishna Murthy & Others, S.
Chand & Co., New Delhi, 2014.

REFERENCES BOOKS:
1. A text Book of Analytical Geometry of Three Dimensions, by P.K. Jain and Khaleel
Ahmed, Wiley Eastern Ltd., 1999.
2. Co-ordinate Geometry of two and three dimensions by P.
Balasubrahmanyam, K.Y. Subrahmanyam, G.R. Venkataraman, Tata-McGra-Hill
Publishers Company Ltd., New Delhi.

VFSTR 97
 B.Sc - Department Electives

VFSTR 98
 B.Sc - Department Electives

22BS802 GRAPH THEORY

Hours Per Week :

L T P C
3 2 0 4

PREREQUISITE KNOWLEDGE: Mathematical proof technique (induction, proof by

contradiction), and linear algebra (determinants, eigenvalues).

COURSE DESCRIPTION AND OBJECTIVES:

The objective of the course is to apply graph theory-based tools in solving practical
problems, to develop the geometric duals in Planar Graphs, to apply the concept of
matrices in graphs like Incidence matrix, Adjacency matrix, Cycle matrix etc. and to
introduce the idea of coloring in graphs.

MODULE - 1
UNIT-1 [12L+8T+0P=20 Hours]

GRAPHS
Origin of graph theory, Graphs and Graph models, Graph terminology and special types
of graphs, representing graphs and Graphs isomorphism.

UNIT-2 [12L+8T+0P=20 Hours]

TYPES OF GRAPHS
Types of Graphs: Complete graph, cycle graph, wheel graph, bipartite graph, star graph,
Path graph. Walks: Trail, Path, Length of the path, cycle and circuits. Connectivity, Euler
and Hamiltonian Paths, distance in graphs

PRACTICES:
● Draw various types of graphs and graph models.
● Explore the different types of graph terminology and determine the different types of graphs.
● Take real time situation as a graph model and represent as adjacent matrix and
incidence matrix, verify these matrices are symmetric or not.
● When two or more graphs are given, verify whether these graphs are isomorphic
or not and prepare isomorphic graph models.
● Explore different types of paths and give the connection between these graphs.
● Identify the difference between Euler graphs and Hamiltonian graphs.
● Find the shortest path distances in graphs.

MODULE-2
UNIT-1 [12L+8T+0P=20 Hours]

TREES
Trees, Forests, distance in trees, rooted and binary tree, spanning trees, minimal Spanning trees, Prim’s
algorithm to find minimal spanning tree.

UNIT-2 [12L+8T+0P=20 Hours]

APPLICATIONS OF GRAPHS
Operations on graphs: union and intersection of graphs. Colouring, Chromatic number,
Chromatic polynomial

VFSTR 99
 B.Sc - Department Electives

VFSTR 100
 B.Sc - Department Electives

PRACTICES:
SKILLS:
Prepare a graph model using our college blocks and class rooms.
● Explore trees and forests; determine the difference between trees and forests.
Identify isomor- phic graphs using algorithms.
● Identify the difference
Identify Euler and Hamiltonian paths in bus roots of our college from different places. between rooted and binary trees.
Take a graph and find the dif- ferent spanning trees. ● Determine the differences between spanning trees and minimal spanning trees.
Take India map and color the states with dif- ferent color and find the chromat- ic number.
● Find the minimal spanning trees using prims algorithm.
● Find the operations on graphs, apply these operations on two or more graphs,
and observe the properties of graphs before and after operations.
● Find the relation between coloring and chromatic number.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to :

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Outline the various types of paths and Apply 1, 2, 4, 5,
1 Apply 1
iso- morphism in graphs. 9,
10, 12
Identify the Euler and Hamiltonian graphs
2 Apply 1, 1, 2, 5, 9, 10
and find
2
the chromatic number of any given graph.
1, 2, 3, 5,
3 Analyse the spanning trees and shortest Analyze 1,
9,
paths. 2
10
1, 2, 5, 9,
4 Inspect four colour theorems. Analyze 2
10,
12
Evaluate the properties of various trees and 1, 2, 3, 4,
5 Evaluat 1,
different types of graphs. 5,
e 2
9, 10, 12

TEXT BOOKS:
1. Narsingh Deo, “Graph Theory with Applications to Engineering and Computer
Science”, DOVER PUBLICATIONS, 2016.
2. C L Liu, D P Mohapatra, “Elements of Discrete Mathematics-A computer Oriented
Approach”, Tata McGraw Hill, Third Edition, 2011.
3. J.L. Mott, A. Kandel, T.P. Baker, “Discrete Mathematics for Computer
Scientists & Mathematicians”, Pearson, 2015.

REFERENCE BOOKS:
1. Singh. S.B., Jai Kishore, Ekata, “Discrete Structures”, Third edition, 2011.
2. Kenneth H. Rosen, “Discrete Mathematics and its Applications”, Fifth Edition. TMH, 2016.
3. Malik & Sen, “Discrete Mathematical structures Theory and application”, Cengage, 2016.
4. Bondy. J.A and Murthy. U. S. R, “Graph theory with applications”, Department of
Combinatorics and Optimization, University of Waterloo, Ontario, Canada, 2019.

VFSTR 101
 B.Sc - Department Electives

VFSTR 102
 B.Sc - Department Electives

22BS803 NUMERICAL ANALYSIS

Hours Per Week :

L T P C
3 2 0 4

PREREQUISITE KNOWLEDGE: Basics of Integration, differentiation and polynomials.

COURSE DESCRIPTION AND OBJECTIVES:

The goal of this course is to build a base for Numerical methods, which are the basic
algorithms underpinning computer predictions in modern systems science. Such
methods include techniques for simple optimisation, interpolation from the known to the
unknown, linear algebra underlying systems of equations, ordinary differential equations
to simulate systems, and stochastic simulation under random influences

MODULE - I
UNIT-1 [12L+8T+0P=20 Hours]

ROOT FINDING METHODS, SYSTEM OF LINEAR EQUATIONS AND INTERPOLATION

Absolute error, order of Convergence, Geometrical Description, method of successive
approximation, Bisection method, Regula- Falsi method, Newton’s Method. Gauss Seidal
method, Crouts method, Triangularization method, Relaxation method.
Interpolation- Finite differences, interpolation, Newton’s forward and backward
difference formulae, Newton’s divided difference and Lagrange’s formulae (with proof),
errors in interpolation formula.

UNIT-2 [12L+8T+0P=20 Hours]

APPLICATIONS
Finding positive, negative and real root of algebraic and transcendental equation, Solution
of simultaneous linear algebraic equation. nth difference of a polynomial, finding missing
terms in a sequence, sum of n terms in a series, finding polynomial using a given set of
data, estimated values of a function inside and outside the given intervals of data

PRACTICES:
● Finding positive, negative and real root of algebraic and transcendental equation
● Solution of simultaneous linear algebraic equation
● Estimating values of a function inside and outside the given intervals of data.

MODULE-2
UNIT-1 [12L+8T+0P=20 Hours]

NUMERICAL DIFFERENTIATION, INTEGRATION AND DIFFERENTIAL EQUATION

Numerical Differentiation: Newton’s forward and Backward formulas to compute up to second order
differentiation of a function.
Numerical Integration: Trapezoidal and Simpson’s 1/3 and 3/8 rules.
ODE: Picard’s approximation, Milne’s Predictor Corrector formulas.
PDE: Liebman’s Iteration Process, Bender Schmidth.

VFSTR 103
 B.Sc - Department Electives

VFSTR 104
 B.Sc - Department Electives

UNIT-2 [12L+8T+0P=20 Hours]

SKILLS:
Analyze the types and occurrence of roots. APPLICATIONS
Interpolate the unknown values of function.
Develop a difference equation. Finding maxima and minima of a function, population growth, acceleration, area
Gain the
knowledge to solve an ODE numerically. bounded by the curve, Solution of ODE, Solution of Elliptic, Parabolic and Hyperbolic
Gain the PDE.
knowledge to solve an ODE numerically.
PRACTICES:
● Finding maxima and minima of a function
● Solve ODE numerically and plot the curve.
● Classify the PDE
● Solve PDE numerically and plot the curve.
● Developing difference equations from ODE and PDE.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to :

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
1, 2, 4, 5,
1 Apply numerical methods to find roots Apply 1
9,
10, 12
2 Evaluate the unknown values using Apply 1 1, 2, 5, 9, 10
interpolation
1, 2, 3, 5,
3 Develop a finite difference scheme Analyze 2
9,
10
Apply numerical methods to solve ODE and 1, 2, 5, 9,
4 Analyze 2
PDE and analyse graphically 10,
12

TEXT BOOKS:
1. S. S. Sastry, “Introductory methods of numerical analysis”, 5th ed, PHI learning, 2012.
2. M K Jain, “Numerical Methods for Scientific and Engineering Computation”,
New Age internarnational,2003.

REFERENCE BOOKS:
1. P Kandasamy, “Numerical Methods”, S Chand, 2nd ed, 2015.
2. C. Ray Wylie, Louis C. Barrett: “Advanced Engineering Mathematics”, 6” Edition,
2. McGraw- Hill Book Co., New York, 1995.
3. Gupta C.B., Singh S.R. and Mukesh Kumar: “Engineering Mathematics for
Semester I & II”, Mc-Graw Hill Education (India) Pvt. Ltd., 2015.

VFSTR 105
 B.Sc - Department Electives

VFSTR 106
 B.Sc - Department Electives

22BS804 COMPLEX ANALYSIS

Hours Per Week :

L T P C
3 2 0 4

PREREQUISITE KNOWLEDGE: Complex numbers, Set theory, calculus of real functions, algebra of
complex numbers, Basics of Integration, and differentiation.

COURSE DESCRIPTION AND OBJECTIVES:

The goal of this course is to build a grasp of the fundamental concepts of the complex
variables. The course is designed as an introduction to the theory and applications of
complex analysis. On successful completion of the course students will be able to study
the techniques of complex variables and functions together with their derivatives,
Contour integration and transformations. Able to understand the fundamental concepts of
complex variable theory and skill of contour integration to evaluate complicated real
integrals via residue

MODULE–1
UNIT-1 [12L+8T+0P=20 Hours]
COMPLEX PLANE :
Complex numbers and their representation, algebra of complex numbers; Complex
plane, Open set, Domain and region in complex plane; Complex functions and their
limits including limit at infinity; Continuity.

UNIT-2 [12L+8T+0P=20 Hours]

ANALYTIC FUNCTIONS
Complex functions and their limits including limit at infinity; Continuity, differentiability
and analyticity; Cauchy Riemann equations, Harmonic functions, Sufficient conditions for
differentiability and analyticity, Analyticity and zeros of exponential, trigonometric and
logarithmic functions.

PRACTICES :
● Determine whether differentiability implies analyticity or not.
● Compute the differentiation of arbitrary complex functions.
● Use sufficient conditions to check differentiability and analyticity of complex functions.
● Suppose that a complex function is given, find zeros of exponential functions.

MODULE –2
UNIT-1 [12L+8T+0P=20 Hours]
ELEMENTARY TRANSFORMATIONS AND POWER SERIES
Elementary Transformations – Bilinear Transformations, Cross ratio, fixed points of
Bilinear Transformation – Some special bilinear transformations.
Series expansions – Taylor’s Series – Laurent’s Series.

UNIT-2 [12L+8T+0P=20 Hours]

COMPLEX INTEGRATION
Zeros of an analytic function, Singularities, Nature of singularities, Residues, Cauchy’s
Residue Theorem, Evaluation of integrals using Cauchy integral formula and Cauchy’s
VFSTR 107
 B.Sc - Department Electives
Residue theorem.

VFSTR 108
 B.Sc - Department Electives

PRACTICES :
SKILLS:
Analyze the given function and check the existence of● Compute the fixed points of bilinear transformation.
Analyticity.
Ability to find the limit of complex valued function. ● Use Taylor’s series to expand a complex function.
Choose the various power series to expand complex func- tion.
● Determine
Able to apply Cauchy’s inte- gral formula to evaluate integral value. the nature of singularities.
● Use Cauchy’s residue theorem to compute Definite integrals
● Suppose that a complex function is given, Use Laurent’s series to expand.

COURSE OUTCOMES :
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Apply Cauchy’s integral formula to 1, 2, 4, 5,
1 Apply 2
evaluate integral value. 9,
10, 12
Apply problem-solving using complex
analysis tech-niques applied to diverse
2 Apply 1,2 1, 2, 5, 9, 10
situations in physics, engi-neering and
other mathematical contexts.
1, 2, 3, 5,
3 Analyse the analyticity of complex valued Analyse 1
9,
function.
10
1, 2, 5, 9,
4 Analyse the nature of singularities. Analyse 2
10,
12

TEXT BOOKS:
1. Arumugam.S, Thangapandi Isaac. A & Somasundaram.A, Complex Analysis,
SciTech Publications (India) Pvt. Ltd, Chennai, 2017.
2. Sharma.J.N, Functions of a Complex Variable, Krishna Prakasan Media (P)
Ltd,13th Edition, 1996-97.

REFERENCE BOOKS:
1. Lars V. Alfords , Complex Analysis ,McGraw-Hill Education, 3rd edition, 2017.
2. Joseph Bak & Donald J. Newman, Complex Analysis, Springer, 3rd edition, 2010.
3. James Ward Brown & Ruel V. Churchill, Complex Variables and Applications,
McGraw-Hill Education, 9th edition, 2009.

VFSTR 109
 B.Sc - Department Electives

VFSTR 110
 B.Sc - Department Electives

22BS805 NUMBER THEORY

Hours Per Week :

L T P C
3 2 0 4

PREREQUISITE KNOWLEDGE: Knowledge on divisibility, prime numbers, fundamental

arithmetic functions..

COURSE DESCRIPTION AND OBJECTIVES

This course aims at building a durable base on the concepts of counting function,
number theorem, congruence relation and its properties thereby, this course intended to
develop skills on the concepts of modulo arithmetic, primitive arithmetic roots,
composite number and Euler’s criterion. Further, it encompasses many important
theorems and results such as Chinese remainder theorem, Fermat’s theorem, Wilson’s
theorem, Mobius inversion formula, Euler’s Phi-function, Legendre symbol, quadratic
reciprocity and congruencies etc. Moreover, this course covers some important
applications on encryption and decryption

MODULE–1
UNIT-1 [12L+8T+0P=20 Hours]
DISTRIBUTION OF PRIMES AND THEORY OF CONGRUENCIES
Linear Diophantine equation, Prime counting function, Prime number theorem, Goldbach
conjecture, Fermat and Mersenne primes, Congruence relation and its properties, Linear
congruence and Chinese remainder theorem, Fermat’s little theorem, Wilson’s theorem.

UNIT-2 [12L+8T+0P=20 Hours]

NUMBER THEORETIC FUNCTIONS
Number theoretic functions for sum and number of divisors, Multiplicative function, The
Mobius inversion formula, the greatest integer function. Euler’s phi-function and
properties, Euler’s theorem.
PRACTICES:
● Determine primes and divisibility.
● Find the primitive roots and quadratic reciprocity.
● Evaluate the sum and the number of divisors.
● Use multiplicative function to determine the sum and the number of divisors.
● Use greatest integer function to find the number of divisors.

MODULE–2
UNIT- 1 [12L+8T+0P=20 Hours]
PRIMITIVE ROOTS
Modulo arithmetic, the order of an integer modulo n, Primitive roots for primes, Composite numbers
having primitive roots; Definition of quadratic residue of an odd prime, and Euler’s criterion.

UNIT-2 [12L+8T+0P=20 Hours

QUADRATIC RECIPROCITY LAW AND PUBLIC KEY ENCRYPTION
The Legendre symbol and its properties, Quadratic reciprocity, Quadratic congruencies
with composite module.

VFSTR 111
 B.Sc - Department Electives
Applications: Public key encryption, RSA encryption and decryption.

VFSTR 112
 B.Sc - Department Electives

PRACTICES:
SKILLS:
Analyze the given function and check the existence divi- ● sors.
Use Mobius inversion formula to analyze the sum and the number of divisors.
Ability to Find the primitive roots and qua- dratic reciprocity.
● Evaluate divisors, common divisors.
Ability to perform divisibility tests and to find the primitive roots and quadratic reciprocity.
● Perform
Able to verify Euler’s theorem for the given number theoretic function. divisibility tests.
● Determine congruences and check digits.
● Verification of Euler’s theorem for the given number theoretic function.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Acquire knowledge on Linear Diophantine 1, 2, 4, 5,
1 Apply 1
equa- tion. 9,
10, 12
Determine divisors, quotients, prime
2 Apply 1, 1, 2, 5, 9, 10
counting and multiplicative functions.
2
Analyse the concepts of Euler’s theorem 1, 2, 3, 5,
3 Analyse 1,
and Mobius inversion formula. 9,
2
10
Analyse the concepts composite numbers, 1, 2, 5, 9,
4 Analyse 2
primi- tive roots, quadratic residue and 10,
Euler’s criterion. 12
Determine multiplicative inverse, modulo n,
1, 2, 5, 9,
5 Le- gendre symbol, quadratic reciprocity and Analyse 1,
10,
congru- encies. 2
12

TEXT BOOKS:
1. N. P. Bali, “A Text Book on Number Theory”, Golden Series of Mathematics, Laxmi
Publications, New Delhi.
2. David M. Burton, “Elementary Number Theory”, 7th edition, 2007, McGraw-Hill.

REFERENCE BOOKS:
1. Gareth A. Jones & J. Mary Jones, “Elementary Number Theory”, 2005, Springer.
2. Neville Robbins, “Beginning Number Theory”, 2nd edition, 2007, Narosa.

VFSTR 113
 B.Sc - Department Electives

VFSTR 114
 B.Sc - Department Electives

22BS806 INTEGRAL TRANSFORMS

Hours Per Week :

L T P C
3 2 0 4

PREREQUISITE KNOWLEDGE: Complex numbers, Basics of Integration, and differentiation..

COURSE DESCRIPTION AND OBJECTIVES

The goal of this course is to build a grasp of the fundamental concepts of the Laplace
transforms and Fourier transforms. The course is designed as an introduction to the
theory and applications of integral transforms to problems in linear differential
equations, to boundary and initial value problems in partial differential equations. On
successful completion of the course students will be able to recognize the different
methods of finding Laplace transforms and Fourier transforms of different functions.
They apply the knowledge of Laplace Transform and Fourier Transforms in finding the
solutions of differential equations, initial value problems and boundary value problems.

MODULE-1
UNIT-1 [12L+8T+0P=20 Hours]
LAPLACE TRANSFORMATIONS
Introduction, Definition, Sufficient condition of Existence, transforms of elementary
functions, Properties, transforms of derivatives and integrals, Inverse Laplace Transforms,
Inverse Laplace transform by partial fraction method, Convolution Theorem, Inverse
Laplace transform by convolution theorem.

UNIT-2 [12L+8T+0P=20 Hours]

APPLICATION OF LAPLACE TRANSFORM TO DIFFERENTIAL EQUATIONS

Applying Laplace transforms to solve differential equations with constants co-efficient,
simultaneous ordinary differential equations with constant coefficients, partial
differential equations.

PRACTICES:
● Determine whether Laplace transform exist or not for the given arbitrary function.
● Compute the Laplace transforms of arbitrary functions.
● Use the Laplace transform to compute the convolution between the functions.
● Use tables to compute inverse Laplace transforms.
● Suppose that a differential equation with boundary values given, Use Laplace
transforms as a technique for solving differential equations.

MODULE-2
UNIT-1 [12L+8T+0P=20 Hours]
FOURIER TRANSFORMS
Introduction, Definition, Fourier integral theorem (statement only), Fourier sine and
cosine integrals, Fourier transforms, Fourier sine and cosine transforms, properties of
Fourier transforms, Inverse transforms.

UNIT-2 [12L+8T+0P=20 Hours]

APPLICATIONS OF FOURIER TRANSFORMS

VFSTR 115
 B.Sc - Department Electives
Convolution theorem for Fourier transforms, Parseval’s Identity, Applications of Fourier
transforms to boundary value problems.

VFSTR 116
 B.Sc - Department Electives

PRACTICES:
SKILLS:
Analyze the giv- en function and check the exis- tence● Compute
of Integral the Fourier transforms of arbitrary functions.
transforms.
Ability to solve problems by converting them from one●domainUsewhere
the the solutiontransform
Fourier is done through
to acompute
com- plex mathemati- cal procedure
the convolution to anotherthe
between domain where simple al- gebraic meth
functions.
Choose the various trans- forms and their applications in the analysis of real valued and complex valued functions.
● of
Able to apply transforms to solve problems in many areas Compute
mathematics the integral value.by using Parseval’s identity.
and engineering.
● Use tables to compute inverse Fourier transforms.
● Suppose that a differential equation with boundary values given, Use Fourier
transforms as a technique for solving differential equations.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to:

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Apply Fourier transform to solve differential
1, 2, 4, 5,
1 equations which will be converted to Apply 1
9,
algebraic equation.
10, 12
Apply Integral transform techniques to solve
research problems of signal processing, data
2 Apply 1, 1, 2, 5, 9, 10
analysis and processing, image processing,
2
in scientific simulation algorithms etc.
Analyse the real-world problems of
1, 2, 3, 5,
3 sciences and engineering and use Integral Analyze 1,
9,
transforms to solve it. 2
10
Analyse the characteristics and properties 1, 2, 5, 9,
4 Analyze 2
of Laplace & Fourier transforms. 10,
12

TEXT BOOKS:
1. Jain R.K., Iyengar S. R. K., “Advanced Engineering Mathematics”, Narosa
Publishers, Reprint 2019.
2. Grewal B.S., “Higher Engineering Mathematics”, Khanna publishers,44th Edition,2017.

REFERENCE BOOKS:
1. Goyal, J. K. & Gupta K. P., “Integral Transforms”, Meerut: Pragati Prakashan.
2. Vasistha, A. R. & Gupta R. K., “Integral Transforms”, Meerut: Krishna Prakashan.
3. Sreenadh, S., “Fourier Series and Fourier transform”, S. Chand & Co Private
Limited, New Delhi.

VFSTR 117
 B.Sc - Department Electives

VFSTR 118
 B.Sc - Department Electives

22BS811 DESIGN OF EXPERIMENTS

Hours Per Week :

L T P C
3 2 0 4

PREREQUISITE KNOWLEDGE: Basic Mathematics and Probability.

COURSE DESCRIPTION AND OBJECTIVES

The objective of Design of Experiments (DOE) is to establish optimal process
performance by finding the right settings for key process input variables. Design of
Experiments is a way to intelligently form frameworks to decide which course of action
you might take.

MODULE - 1
UNIT – 1 [12L+8T+0P=20Hours]
INTODUCTION TO ANOVA
Definition, Assumptions, statement of Cochran’s theorem, differences between Fixed and random effects
model. Design of Experiments: Principles of experimentation in Designs.

UNIT – 2 [12L+8T+0P=20Hours]

ANALYSIS OF VARIANCE
Analysis of One way with equal and unequal classifications and two-way classifications.
Analysis of completely randomized design (CRD), Randomized block design (RBD) and
Latin square design (LSD) including one missing observation. efficiency of these designs.

PRACTICES:
● ANOVA-CRD.
● ANOVA - LSD with one missing observation.

MODULE – 2
UNIT – 1 [12L+8T+0P=20Hours]
BIBD
Factorial Experiment, confounding of factorial designs, balanced incomplete block
design(BIBD), Incomplete block design, parameters of BIBD, Symmetric BIBD, Efficiency
of BIBD, Resolvable design, split plot design

UNIT – 2 [12L+8T+0P=20Hours]
FACTORIAL DESIGNS
Analysis of 22, 23 2n factorial design, Statistical analysis of split plot design, advantages and disadvantages
of split plot design, Analysis of BIBD, efficiency of BIBD with RBD.

PRACTICES:
● ANOVA - RBD with one missing observation.
● Analysing one way and two way classified data
● Applying the principles of design to various experiments
● Choosing local control in experiments to isolate the treatment effects
● Designing 2n factorial experiments
● Analysing balanced incomplete design- BIBD
VFSTR 119
 B.Sc - Department Electives

VFSTR 120
 B.Sc - Department Electives

COURSE OUTCOMES:
SKILLS:
Design the experiments with principles of designAfter the completion of the course, the student will be able to achieve the following outcomes:
Carry out the analysis for the design of experi- ments
Construction of BIBD
CO Blooms Module Mapping
Analysing facto- rial designs and split plot designs Course Outcomes
No. Level No. with POs
Conducting analysis of one way or two way
1 Analyze 1 1,2
classified data
2 Apply principles of design to the experiments Apply 1 1,2
Identifying the situations where factorial
3 Analyze 2 1,2,
experiments can be implemented
3
Implement balanced incomplete block designs
4 Apply 2 1,2,
in various experimental situations
4
Conducting factorial designs for various
5 Apply 2 1,4,
experimental situations
5

TEXT BOOKS:
1. Telugu AcademyBA/BSc III year paper - III Statistics - applied statistics - Telugu
academy by prof.K.Srinivasa Rao, Dr D.Giri. Dr A.Anand, Dr V.Papaiah Sastry,
2009.
2. K.V.S. Sarma: Statistics Made Simple: Do it yourself on PC. PHI,2010.

REFERENCE BOOKS:
1. Fundamentals of applied statistics : VK Kapoor and SC Gupta,2014.
2. Indian Official statistics - MR Saluja,1972.
3. Anuvarthita Sankyaka Sastram - Telugu Academy,1998.

VFSTR 121
 B.Sc - Department Electives

VFSTR 122
 B.Sc - Department Electives

22BS812 STATISTICAL ANALYSIS

THROUGH SPSS/R
Hours Per Week :

L T P C
2 0 4 4

PREREQUISITE KNOWLEDGE: Knowledge in various statistical concepts. .

COURSE DESCRIPTION AND OBJECTIVES:

Students learn the basics of statistical inference in order to understand and compute p-
values and confidence intervals, all while analysing data with R. We provide R
programming examples in a way that will help make the connection between concepts
and implementation. Problem sets requiring R programming will be used to test
understanding and ability to implement basic data analyses. We will use visualization
techniques to explore new data sets and determine the most appropriate approach. We
will describe robust statistical techniques as alternatives when data do not fit
assumptions required by the standard approaches. By using R scripts to analyse data,
you will learn the basics of conducting reproducible research.

MODULE-1
UNIT-1 [8L+0T+16P = 24 Hours]
INTRODUCTION TO R
Introduction to R, Vectors, factors, lists, Matrix, Data frames in R- Descriptive statistics using R.

UNIT-2 [8L+0T+16P = 24 Hours]

DATA VISUALIZATION USING R

Data Visualization using R, Scatter plot, adding colors, Histogram, Box and Whisker plot,
time series plot, Plotting Normal Distribution Using R Functions. Descriptive Statistics -
Mean, Mode, Median, Skew, Kurtosis – Correlation and Regression analysis.
PRACTICES:
● Presenting the fundamentals of R package
● Describing the given data using R package
● Using visualization packages drawing different diagrams to present the data

MODULE - 2
UNIT-1 [8L+0T+16P = 24 Hours]
PLOTTING
Plotting Binomial Distribution Using R Functions, Plotting Poisson Distribution Using R
Functions, R Functions for Normal Distribution - rnorm, pnorm, qnorm and dnorm, p-
value.

UNIT-2 [8L+0T+16P = 24 Hours]

DISTRIBUTION USING R
Plotting Normal Distribution, Binomial Distribution Using R Functions and Poisson
Distribution using rpois, ppois, qpois and dpois, Poisson Distribution using Visualize
Package, Inferential Statistics - One and two sample z, t, Chi Square, F Tests, ANOVA,
Tukey HSD

PRACTICES:
● Put all library() calls and any hard-coded variables at the top of the script
VFSTR 123
 B.Sc - Department Electives
● Use RStudio projects to organize your scripts, data, and output
● Modularize your code

VFSTR 124
 B.Sc - Department Electives

COURSE OUTCOMES:
SKILLS:
Analyse the characteristics and visualization of a Upon completion of the course, the student will be able
given data. to achieve the following outcomes :
Perform hy- pothesis tests, interpret statisti- cal results (e.g., p-values), and report the results of your analysis to clients
Fit, examine, utilize regression models to exam- ine relationships between multiple variables
CO Blooms Module Mapping
Course Outcomes
No. Level No. with POs
1 Draw a suitable visualization for the given Apply 1 1,2,3
data
Applying appropriate technique to Analyze
2 Apply 1 1,2
the data
3 Carryout ANOVA using R package Apply 2 1,3
4 Carryout the testing of hypothesis problems Analyze 2 1,2,4
Obtaining expected frequencies for Evalu
5 2 1,2,3,4
given pro- ba-bility distribution -
ate

TEXT BOOKS:
1. “An Introduction to Statistical Learning with Applications in R”, Springer Texts in
Statistics, 1st ed. 2013, Corr. 7th printing 2017 Edition
2. The Art of R Programming, Norman Matloff, 5/e, Cengage Learning, 2011.

REFERENCE BOOKS:
1. R Cookbook, Paul Teetor, 5/e, Oreilly, 2011.
2. R in Action, Rob Kabacoff, 2/e, Manning, 2015.
3. R for Everyone, Lander, 4/e, Pearson, 2014.

VFSTR 125
 B.Sc - Department Electives

VFSTR 126
 B.Sc - Department Electives

22BS813 ADVANCED PROBABILITY

Hours Per Week :

L T P C
3 2 0 4

PRE-REQUISITE KNOWLEDGE: Basic knowledge in Probability and mathematics

COURSE DESCRIPTION AND OBJECTIVES:

It provides the advanced concepts to the students on probability. The students try to
know and measure the chance of happening different events and their occurrence
numerically. The probability on the infinite series, like strong and weak laws and
convergence will be discussed in this course.

MODULE - 1
UNIT-1 [12L+8T+0P = 20 Hours]

CONVERGENCE OF SEQUENCES
Sequences of random variables: Measure-theoretic preliminaries, Convergence of
sequences of random variables, Independence and Kolmogorov’s zero-one law, the
strong law of large numbers Ergodicity and stationarity, Measure preservation, invariance
and ergodicity, Criteria for measure preservation and ergodicity Stationary processes and
the law of large numbers.

UNIT-2 [12L+8T+0P = 20 Hours]

WEEK LAW OF LARGE NUMBERS

Weak convergence, Weak convergence and convergence of measures, Weak
convergence and distribution functions, Weak convergence and convergence in
probability, Weak convergence and characteristic functions, Central limit theorems,
Asymptotic normality, Higher dimensions.

PRACTICES:
● Convergence of random variables
● Practical application of Kolmogorov’s zero-one law
● Establishment of Weak convergence in Probability
● Application of central limit theorem

MODULE - 2
UNIT-1 [12L+8T+0P = 20 Hours]
MARTINGALES
Signed measures and conditioning, Decomposition of signed measures, Conditional
Expectations given a σ-algebra, Conditional expectations given a random variable,
Martingales, Introduction to martingale theory, Martingales and stopping times
UNIT-2 [12L+8T+0P = 20 Hours]

BROWNIAN MOTION
The martingale convergence theorem, Martingales and uniform integrability, The

VFSTR 127
 B.Sc - Department Electives
martingale central limit theorem, The Brownian motion, Definition and existence,
Continuity of the Brownian motion, Variation and quadratic variation, The law of the
iterated logarithm

VFSTR 128
 B.Sc - Department Electives

PRACTICES:
s of Kolmogor- ● Decomposition of signed measures
ne law in real time data
● Application of Martingale theorem
- tion of signed measures, Conditional Expectations given a σ-al- gebra
● Application of martingale central limit theorem
ale convergence theorem, Martingales and uniform integrability, The martin- gale central limit theorem
● Existence of Brownian motio
Brownian motion and detection of the existence and variations
COURSE OUTCOMES:
By the end of this course, it is expected that the student will be able to learn the following
aspects :

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Understand the applications of
1 convergence of se-quences of random Apply 1 1,2
variables and Kolmogorov’s zero-one
law
Understand the applications of Weak
2 convergence and distribution functions, Apply 1 1,2
Weak convergence in probability
Analyze the concept of of martingale
3 convergence theorem, Martingales and Analyze 2 1,2,3
uniform integrability, The martingale
central limit theorem
4 Evaluate the uniform integrability Evaluat 2 1,2,4
e
Evaluate the Continuity of the Brownian
5 Evaluat 2 1,4,5
motion, Var-iation and quadratic variation
e

TEXT BOOKS:
1. Advanced Probability, Alexander Sokol Anders Rønn-Nielsen, Copyright 2013
Alexander Sokol & Anders Rønn-Nielsen, ISBN 978-87-7078-999-8
2. An Introduction to probability theory and mathematical statistics by V K Rohatgi, John
Wiley

REFERENCES:
1. Kingman J F C and Taylor S J, Introduction to Measure and Probability,
Cambridge university Press
2. Feller, W Introduction to Probability Theory and its applications, Vol. II Wiley
3. Cramer H. Mathematical methods of Statistics, Princeton University Press.

VFSTR 129
 B.Sc - Department Electives

VFSTR 130
 B.Sc - Department Electives

22BS814 OPERATIONS RESEARCH

Hours Per Week :

L T P C
3 2 0 4

PREREQUISITE KNOWLEDGE: Basic Mathematics and Probability.

COURSE DESCRIPTION AND OBJECTIVES:

The objective of the course is to introduce some of the tools that facilitate better
understanding about the operations in a quantitative form and help them in taking right
decision about the business through mathematical approach.

MODULE–1
UNIT-1 [12L+8T+0P = 20 Hours]

INTRODUCTION TO LPP
Linear Programming: Introduction to Operations Research- Linear Programming –
Formulation of LPP- Graphical Solution-Dual Problem-Primal-Dual Relationships-
Transportation Problem-Definition- Introduction to Game Theory-Two Person Zero Sum
Game-Pure Strategies-Saddle Point-Mixed Strategies.

UNIT-2 [12L+8T+0P = 20 Hours]

TRANSPORTATION PROBLEM AND GAME THEORY
Transportation problem, Solution to the Transportation Problem-Balanced and Unbalanced
Transportation Problem- Assignment Problem-Travelling Salesman Problem-Solution
methods of Games without Saddle Point-Algebraic, matrix and arithmetic Methods-
Graphical solution of 2 X m, m X 2 Games-Dominance method.

MODULE–2
UNIT-1 [12L+8T+0P = 20 Hours]
DECISION THEORY
Decision Making Process-Steps in the decision Making-Decision making with an active Opponent-
Definitions-Decision making Environment-Criteria for Decision under uncertainty and risk.

UNIT-2 [12L+8T+0P = 20 Hours]

PERT AND CPM

PERT & CPM: Definitions, various terms used in Network Scheduling-Drawing Networks-
Identifying Critical Path-Probability of completing the project within Time-Decision Trees-
Graphic displays of decision Making-Problems in CPM / PERT –Problems in Decision
making under uncertainty and risk-problems in decision trees.
PRACTICES:
● Obtain the graphical solution to the Linear programming problem.
● Compute the objective functions in an LPP and transportation problem.
● Compute the optimum and mixed strategies of different games.
● Finding the critical paths in various project assignments.
● Quantifying the possible decisions in various decision environments.

VFSTR 131
 B.Sc - Department Electives

VFSTR 132
 B.Sc - Department Electives

COURSE OUTCOMES:
SKILLS:
Supply chain applications. Upon the completion of the course, the students will be able to achieve the following outcomes :
Job assignment.
Drawing network diagram for a project and iden- tify the critical path.
CO Blooms Module Mapping
Computation of earliest expected time and latest allowable time for events in a Course
project. Outcomes
Decision making in different envi- ronments. No. Level No. with POs
Identify situations in which linear
1 Apply 1 1,2,7
programming techniques can be applied
Recognise and formulate a transportation
2 Apply 1 1,2,3,4
problem and obtain the solutions
Understand how optimal strategies, are
3 Analyse 2 1,2,3,4,5,8
formulated
in conflict and competitive environment
Understand the steps of decision making
process, make decision under various
4 decision-making environments, determine Analyse 2 1,2,3,4,6,7
the expected monetary value, ex-pected
opportunity loss, and construct decision trees
for making decisions

TEXT BOOKS:
1. J K Sarma, “Operations Research: Theory and Applications”, 1st Edition, Macmillan India,
2007.
2. S.D. Sarma “Operations Research”, 11th ed., Kedarnath, Ramanath & Co., 2012.

REFERENCE BOOKS:
1. Barry Render, Raiph M. Stair, Jr. Michael E. Hanna, “Quantitative Analysis for
Management”, 9th Edition, PHI Pvt Ltd, New Delhi, 2007
2. Pannerselvam. R, “Operations Research”, 2nd ed., PHI
3. Operations Research, Kranthi Swaroop, P. K. Gupta and Manmohan, 4th ed.,
Sultan & Sons, 1976.

VFSTR 133
 B.Sc - Department Electives

VFSTR 134
 B.Sc - Department Electives

22BS815 APPLIED STATISTICS

Hours Per Week :

L T P C
3 0 2 4
PREREQUISITE KNOWLEDGE: Basic Mathematics and Probability.

COURSE DESCRIPTION AND OBJECTIVES:

Communicate and present statistical ideas clearly in oral and written forms using
appropriate technical terms and deliver data analysis results to non-statistical audience.
Students will demonstrate their ability to apply statistics in other fields at an appropriate
level and demonstrate their ability to apply knowledge acquired from their major to real
world models. To present statistical systems in India and different organizations deals
data. To make a proficient in collection, organization, design, and drawing inferences
from data using appropriate statistical methodology and problem-solving skill with
different statistical techniques.

MODULE –1
UNIT-1 [12L+0T+8P = 20 Hours]
ANALYSIS OF TIMES SERIES
Analysis of times series: Components of times series: meaning and examples, trend by
least squares (straight line and parabola) methods and moving average methods. Seasonal
indices by simple averages, ratio to moving average, ratio to trend and link relative
methods.

UNIT-2 [12L+0T+8P = 20 Hours]

INDEX NUMBERS
Index numbers: Meaning, problems involved in the construction of index numbers, simple
and weighted index numbers. Criteria of good index numbers. Fixed base and chain base
index numbers. Cost of living index numbers, wholesale price index numbers, Base
shifting, splicing and deflation of index numbers.

PRACTICES:
● Fitting of first and second degree polynomial equations
● Calculation of seasonal variation Indice
● Calculation of wholesale price Index numbers

MODULE –2
UNIT-1 [12L+0T+8P = 20 Hours]
OFFICIAL STATISTICS
Official Statistics: Functions and organization of CSO and NSSO. Agricultural, area, yield of statistics,
national income and its computation.

UNIT-2 [12L+0T+8P = 20 Hours]

VITAL STATISTICS
Vital statistics: Meaning, Definition, uses, sources of vital statistics, various Death rates-
CDR, ASDR, STDR and Birth rates -CBR, ASFR, TFR. Reproduction Rates: Measurement of
population growth, crude rate of natural increase, Pearle’s vital index, Gross

VFSTR 135
 B.Sc - Department Electives
Reproduction Rate [GRR], Net Reproduction Rates[NRR], Life tables, construction uses of
life tables and abridged life Tables.

VFSTR 136
 B.Sc - Department Electives

PRACTICES:
SKILLS:
Can study the trends of busi- ness data with time series ● andMemorise the functions of
its components CSO, NSSO
Construct a cost of living index for a group of people
● Calculation of CDR, ASDR, CBR, ASFR, TFR
Calculate statis- tical measures relating to vital events
Describe anato- my of Statistical system in India ● Finding GPR, NPR
● Creating life tables

COURSE OUTCOMES:
After the completion of the course, the student will be able to achieve the following outcomes :

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Students will have a solid foundation of
1 Analyze 1 1,2
mathemat- ical processes.
Apply different statistical techniques for a
2 Analyze 1 1,2
given
data using Time series
Assess cost of living for a group of people
3 Analyze 2 1,2,3
with index numbers
Discuss different demographic measures for
4 Apply 2 1,2,4
analysis
Evalu
5 Give the Statistical system in 2 1,4,5
-
India
ate

TEXT BOOKS:
1. VK Kapoor and SC Gupta, “Fundamentals of applied Statistics”, S. Chand Publishers, 2009
2. Prof.K.Srinivasa Rao, Dr D.Giri. Dr A.Anand, Dr V.Papaiah Sastry.” Applied Statistics”, 2009

REFERENCE BOOKS:
1. MR Saluja ,“Indian Official statistics”, 1978
2. “Anuvarthita Sankyaka Sastram”,Telugu Academy, 2008.
3. III Statistics, Telugu academy, BA/BSc III year paper, 2007

VFSTR 137
 B.Sc - Department Electives

VFSTR 138
 B.Sc - II Year II Semester

22BS821 FORMAL LANGUAGES AND

AUTOMATA THEORY
Hours Per Week :

L T P C
3 2 0 4

PREREQUISITE KNOWLEDGE: Knowledge of graphs, trees and logic .

https://sameer9247.word- press
COURSE DESCRIPTION AND OBJECTIVES:
This course aims to teach the student to identify different formal language classes and
their relationships, strong theoretical foundation for designing compilers. In addition to
this the student will be able to learn the techniques for information processing, design
different grammars, automata and recognizers for different formal languages

MODULE-1
UNIT–1: [12L+8T+0P=20 Hours]
INTRODUCTION
Alphabets, Strings and languages, Automata and Grammars, Regular languages,
Chomsky hierarchy of languages, Deterministic finite automata (DFA)-Formal definition,
Simplified notation, State transition graph, Transition table, Language of DFA;
Nondeterministic finite automata (NFA), NFA with epsilon transition, Language of NFA,
Equivalence of NFA and DFA, Minimization of finite automata, FA with output - Moore
and Mealy machine, Equivalence of Moore and Mealy machine, Applications and
Limitation of FA.

UNIT – 2: [12L+8T+0P=20Hours]
REGULAR EXPRESSIONS
Regular Expression (RE): Definition, Operators of regular expression and their
precedence, Algebraic laws for Regular Expressions, Kleen’s Theorem, Regular
Expression to FA, DFA to regular expression, Arden theorem, non regular languages,
pumping lemma for regular languages (proofs not Required), Application of pumping
lemma, Closure properties of regular languages, Decision properties of regular
languages.
Grammar Formalism: Regular Grammars-Right linear and left linear grammars,
Equivalence between regular linear grammar and FA;
PRACTICES:
● Design DFA and NFA which accepts the following languages over the alphabet
{0,1}. And also covert NFA to DFA. Give separate Automata for each and also
write RE for the obtained automata.
a) The set of all strings ends with 00.
b) With three consecutive 0’s.
c) With 011 as a substring.
d) Either begin or ends with 01.
e) Strings whose fourth symbol from the right end is 1.
f) Even number of 0’s.
g) number of 1 ‘s is divisible by three.
● Design NFA to recognize the following set of strings.
a) abc, abd, and aacd: Assume the alphabet is {a,b,c,d}.
b) 0101,101 and 011: Assume the alphabet is {0,1}.

VFSTR 117
 B.Sc - II Year II Semester
c) ab,bc and ca: Assume the alphabet is {a,b,c}.

VFSTR 118
 B.Sc - II Year II Semester

● Convert epsilon NFA to DFA.

SKILLS:
Investigate syn- tax and seman- tics of a regular and context free languages.
Develop the problem under- standing solving ability.
Design opti- mized solutions for a language.

● Minimize the following DFA.

● Construct Mealy and Moore Machines and equivalent them for the residue
(remainder) mod 3 of binary input.
● Construct Finite Automata for the following Regular Expressions.
(a) RE=ab(a+b)*
(b) RE=(a+ab) (ab+ab)*
● Prove that the following languages are nor Regular.
(a) L= {ap | p is a prime number}
(b) L= {bn | n=i2 and i>1}
(c) L= {W WR | W is (a,b)*}
(d) L= {anbn+1 |n≥1}

MODULE–2
UNIT-1 [12L+8T+0P=20Hours]
CONTEXT FREE GRAMMAR
Definition, Examples, Derivation, Derivation trees, Ambiguity in grammar, Inherent
ambiguity, Ambiguous to unambiguous CFG, Useless symbols, Simplification of CFGs;
Normal forms for CFGs - CNF and GNF, CFLs; Closure properties of Decision properties of
CFLs-Emptiness, Finiteness and membership, pumping lemma for CFLs (proofs not
Required), Application of pumping lemma. Small Sample Tests: t-test for single, double
and paired tests, variance ratio test (F-test), Chi-square test-independence of attributes

UNIT-2 [12L+8T+0P=20Hours]
PDA AND T
Push Down PDA AND TM Automata (PDA): Description and definition, Instantaneous
description, Language of PDA, Acceptance by final state, Acceptance by empty stack,
Deterministic PDA, Equivalence of PDA and CFG, CFG to PDA and PDA to CFG, two stack
PDA.
Turing Machines (TM): Basic model, Definition and representation, Instantaneous
Description, Language acceptance by TM, Computable functions, Types of Turing
Machines, Universal TM, Recursive and Recursively Enumerable Languages,
undecidability, Church Turing Thesis, Universal Turing Machine, The universal and
diagonalization languages, Reduction between languages and Rice’s Theorem.

PRACTICES:
● Construct CFG for the following:
a) L={anbn|n>1}
b) L= {WWR | W is (a,b)*}

VFSTR 119
 B.Sc - II Year II Semester
c) L= {ap | p is a prime}

VFSTR 120
 B.Sc - II Year II Semester

● Derive the strings 10001 using left most derivation and right most derivation and
parse tree by using the following grammar. And show that grammar is
ambiguous.
S->
T000T T-
>0T|1T|
● Convert the following CFG to
CNF. S->ABC|Aa
A->a
B->d|
C-> Aab|a
● Convert the following CFG to
GNF. S->AA | 0
A->SS | 1
● Prove that the following are not
CFL. (e)L= {ap | p is a prime
number}
(f) L= {bn | n=i2 and i>1}
(g) L= {W WR | W is (a,b)*}
(h) L= {anbn+1 |n≥1}
● Convert the following language or PDA to CFG.
(a) L={anbn|n≥1} and
(b) δ (q,0, z) ={(q,xz)}
δ (q, 0, x) ={(q,xx)}
δ(q,1, x)={(q,x)}
δ(q, ,x)={(p, )}
δ(p,1, x)={(p,xx)}
δ(p, ,x)={(p, )}
δ(p, 1,z)={(p, )}
● Construct PDA for the following Languages.
a) L= {0n1m | n≥m}
b) L= {anbn|n≥1}
c) L=
d) L= {w| na(w) >nb(w)}
e) L= {0n12n | n>0}
f) L = Where wRis reverse of w
g) L= Where wRis reverse of w
● Construct PDA for the following Languages.
a) L= {anbncn | n >1}
b) L= {anbmambn | n, m ≥1}
● Construct Turing Machine for the following Languages.
a) L= {anbn | n ≥ 1}
b) L= {02n1n |n >0}
c) L= {wwr | w is (0+1) *}

VFSTR 121
 B.Sc - II Year II Semester
d) L={anbncn|n≥1}.
e) Well balanced Parenthesis for example: () ()

VFSTR 122
 B.Sc - Department Electives

COURSE OUTCOMES:
Upon completion of the course, the student will be able to achieve the following outcomes :

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Design abstract models of computing,
including Deterministic Finite.
Automata (DFA), non-deterministic Finite
1 Apply 1,2 1,2,3
Automa- ta (NFA), Push Down Automata.
(PDA) and Turing Machine (TM) models and
their power to recognize the languages.
Design different finite state machines to
2 Analyze 1,2 1,2,3
perform
,
various operations.
Analyze, the given language is regular or not
3 regular, CFL or not, Ambiguous Analyze 1,2 2
unambiguous, Recursive and Recursive
Enumerable.
Design Regular grammar and context free
4 Design 1,2 1,3
gram- mars for a language.

TEXT BOOKS:
1. Hopcroft and Ullman, “Introduction to Automata Theory, Languages and
Computation”, 2nd Edition, Pearson/ Prentice Hall India, 2007.

REFERENCE BOOKS:
1. Zed A Shaw, Learn C the Hard Way: Practical Exercises on the Computational
Subjects You Keep Avoiding (Like C), Addison Wesley, 2015
2. Christoph Dürr, Sorbonne University, Jill-Jênn Vie, Inria, Competitive
programming in Python, Cambridge University Press, 2020
3. Michael Sipser, “Introduction to Theory of Computation”, 3rd Edition, Course Technology,
2012.

VFSTR 123

VFSTR 120
 B.Sc - Department Electives

22BS822 MACHINE LEARNING

Hours Per Week :

L T P C
3 0 2 4

PREREQUISITE KNOWLEDGE: Probability & Linear Algebra, Python language.

COURSE DESCRIPTION AND OBJECTIVES:

This course provides a broad introduction to various machine learning concepts
including Supervised learning (parametric/non-parametric algorithms, support vector https://www.forbes. com/sites/kalevlee- t
machines, kernels, neural networks) and Unsupervised learning (clustering, dimensionality ing-needs-semantics- not-just-statistics/
reduction) methods. Students will get an understanding of various challenges of Machine
Learning and will be able to decide on model complexity. Numerous case studies
introduced in this course allow the students to apply machine-learning algorithms in
computer vision, medical imaging, audio, and text domains. Laboratory experiments of
this course will introduce students to advanced Machine Learning Python libraries such as
Scikit-Learn, Matplotlib, and many other recent ML-related APIs. The course is designed
such that the students get enough hands-on experience with a major focus on the
practical implementation of theoretical concepts.

MODULE - 1
UNIT-1 [14L+0T+8P=22 Hours]

INTRODUCTION
What is machine learning? Machine learning applications; Types of Learning: Supervised
learning; Un-supervised learning; Reinforcement learning.
Model Training Essentials: Re-sampling methods: Bias–Variance Trade-off. Hypothesis
Testing and Variable Selection, Sub sampling and Up-sampling, SMOTE; Cross Validation
(validation set, Leave- One-Cut (LOO), k-fold strategies) and bootstrap; Evaluation
measures-Error functions, Confusion Matrix, Accuracy, Precision and Recall, F1 Score.
Regression Analysis: Linear Regression, Simple and Multiple Linear Regression,
Polynomial Regression, Logistic Regression, Multi nominal Regression. Ordinary Least
Squares Method, Model Shrinkage-Ridge, and LASSO regression.

UNIT-2 [10L+0T+8P=18 hours]

FEATURE SELECTION
Feature Selection Strategies: Problem statement and Uses, Filter methods, Wrapper
methods, Embedded methods. Branch and bound algorithm, Sequential
forward/backward selection algorithms.
Dimensionality Reduction: Singular value decomposition, matrix factorization, Linear
discriminant analysis, Principal components analysis.

PRACTICES:
● Apply the following tasks to any given dataset:
a. Load and visualize data.
b. Check out and replace missing values.
c. Encode the Categorical data.
d. Splitting the dataset into Training and Test set.
e. Splitting the dataset into k-folds.

VFSTR 121
 B.Sc - Department Electives
f. Feature scaling.

VFSTR 122
 B.Sc - Department Electives

● House price prediction:

SKILLS:
Statistical data analysis. a. Create a model that predicts a continuous value (price) from input features
Classify / Cluster data. (square footage, number of bedrooms and bathrooms).
Tool usage for developing ML applications.
b. Implement a univariate Model using Least Squares and plot best-fit line.
c. Implement a multivariate Model using Least Squares and plot best-fit line.
d. Retrieve model error and model coefficients.
e. Observe Variance Inflation Factor (VIF).
f. Implement Ridge regression model.
g. Implement LASSO regression model.
h. Report your observations on the above models for house prediction.
● Heart disease prediction:
a. Implement a logistic regression model to predict whether an individual is suffering from
heart
disease or not.
b. Evaluate and compare model performance using the following validation approaches:
i. Validation set approach.
ii. K-fold cross validation.
iii.Stratified K-fold cross validation.
iv.LOO strategy.
c. Plot Confusion matrix.
d. Report performance of the model in terms of the following metrics:
i. Accuracy.
ii. Precision-Recall.
iii.F1 Score.
e. Report your observations and explain when to use what type of measures.
● Perform effective feature selection in a given dataset using any one of the feature
selection
techniques.
● Dimension Reduction:
a. Load a dataset and Implement Bayes classification model.
b. Apply dimension reduction using:
i. Principal Component Analysis
ii. Linear Discriminant Analysis
c. Apply the model on data with reduced dimension.
d. Compare and contrast model performance in each case.

MODULE - 2
UNIT-1 [16L+0T+8P=24 hours]
CLASSIFICATION
Classification: Binary, Multi-class and Multi-label Classification; K-Nearest Neighbours,
Support Vector Machines, Decision Trees, The Naïve Bayes’ Classifier, Class Imbalance,
Perceptron ANN model.
Ensemble Methods: Ensemble Learning Model Combination Schemes, Voting, Error-
Correcting Output Codes, Bagging: Random Forest Trees, Boosting: Adaboost, Stacking.

UNIT-2 [8L+0T+8P=16 hours]

CLUSTERING
Clustering: Different distance functions and similarity measures, K-means clustering,
Medoids, Hierarchical Clustering-Single linkage and Complete linkage clustering, Graph
VFSTR 123
 B.Sc - Department Electives
based Clustering -MST, DBSCAN, Spectral clustering.

VFSTR 124
 B.Sc - Department Electives

PRACTICES:
● Implement and demonstrate the FIND-S algorithm for finding the most specific
hypothesis based on a given set of training data samples. Read the training data
from a .CSV file.
● Implement the naïve Bayesian classifier for a sample training data set stored as
a.csv file. Compute the accuracy of the classifier, considering few test data sets.
● Assuming a set of spam or not-spam mails that need to be classified, use the
naïve Bayesian classifier model to perform this task. Calculate the accuracy,
precision, and recall for your data set.
● Implement k-Nearest Neighbor algorithm to classify the iris data set. Print both
correct and wrong predictions. Python ML library classes can be used for this
problem.
● Demonstrate the working of the decision tree-based ID3 algorithm. Use an
appropriate data set for building the decision tree and apply this knowledge to
classify a new sample?
● Build a model using SVM with different kernels.
● Implement and build models using the following Ensemble techniques.
a. Bagging.
b. Boosting: Adaboost, Stacking.
● Build a model to perform Clustering using K-means after applying PCA and
determining the value of K using the Elbow method.
● Unsupervised Modelling:
a. Cluster the data using the following models:
i. Spectral Clustering.
ii. K-medoids.
iii.DBSCAN.
iv.Hierarchical Clustering.
b. Compare and contrast model performance in each case.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to :

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Apply a wide variety of learning algorithms
1 such as Probabilistic, Discriminative and Apply 1, 1
Generative algorithms for a given 2
application.
Analyze and evaluate the performance of
2 various machine learning models Analyze 2 2
approaches on different kinds of data.
Design an end-to-end Machine-learning
3 Create 1 3
model to realize solutions for real-world
problems.
Implement various machine learning models
4 Create 1, 5
using advanced ML tools.
2

TEXT BOOKS:
1. Ethem Alpaydin, “Introduction to Machine Learning”, 3rd Edition, The MIT Press, 2014.
2. Flach, Peter. “Machine learning: the art and science of algorithms that make
sense of data”. Cambridge University Press, 2012.

REFERENCE BOOKS:
1. Murphy, Kevin P. Machine learning: a probabilistic perspective. MIT press, 2012.

VFSTR 125
 B.Sc - Department Electives
2. Aurélien Géron, “Hands-on Machine Learning with Scikit Learn and Tensor Flow”, O’reilly, 2017.
3. Gareth James, Daniela Witten, Trevor Hastie, and Robert Tibshirani, “An
Introduction to Statistical Learning with Applications in R”, Springer, 2013.
(ISLR).

VFSTR 126
 B.Sc - Department Electives

22BS823 WEB TECHNOLOGIES

Hours Per Week :

L T P C
2 0 4 4

PREREQUISITE KNOWLEDGE: OOPs through JAVA..

COURSE DESCRIPTION AND OBJECTIVES:

This course offers the concepts of web development like static and dynamic web page
design and provides internet programming knowledge, web servers, application servers,
and design methodologies using object-oriented concepts. The objective of this course is
to build web applications using JSP, PHP, Angular JS, and Node JS with a client and server-
Source : . dreamstime.com/ web-development- coding-programming- internet-technology- business-concept- web-development- coding-programming- internet-technology- i
side scripting technologies that span multiple domains.

MODULE-1
UNIT-1 [8L+0T+16P=24 hours]
INTRODUCTION
TML: Creating structured documents, Links and navigation, Tables, Forms, and Frames.
HTML 5: Introduction to HTML5, The HTML5 Canvas, HTML5 audio and Video;
CSS: Cascading Style Sheets, CSS Properties.
Java Script: Learning Java Script- how to add scripts to your page, DOM, variables,
operators, functions, conditional statements, Looping, Events, Built-in objects, form and
regular expression validation.

UNIT-2 [8L+0T+16P=24 hours]

JDBC AND JSP
JDBC: What is JDBC, system requirements, types of JDBC Drivers, creating database tables,
connecting to a database, executing SQL statements, processing result sets, and making
changes to a result set.
JSP: JSP Processing, Generating Dynamic Content using Scripting Elements, Implicit JSP
Objects, Sharing Data between JSP pages, JSP application design with JDBC.

PRACTICES:
● Design a webpage having four frames named a)Top, b)Center, c)Bottom, and d)
Left. The top frame should contain the company logo and title. The bottom frame
should contain copyright information. The left frame should contain various links
like Home, Products, Services, Branches, About, etc., When clicked on respective
links, the content should display on the center frame.
● Design a catalog page that should contain the details of all the books available
on the website in a table. The details should contain the following: a) Snapshot of
Cover Page b) Author Name
c) Publisher. d) Price. e) Add to cart button.
● Design a timetable schedule for your current semester using the Table tag.
● Design a HTML page for Student Registration Form using Form Elements that
includes Form, input-
text,password,radio,checkbox,hidden,button,submit,reset,label,textarea,select,opti
on and file upload.
● Design a HTML web page with at least two <h1>, two images, two buttons, and
appropriate CSS to display,
VFSTR 127
 B.Sc - Department Electives
o All<h1>withfont-size12pt, and bold in Verdana font using In line CSS.
o All<img>withbordercoloryellow,thickness10pxusingDocumentLevelCSS.
o All<inputtype=’button’>shouldchangebackgroundcolortoredonmouseoverthem
using External CSS.

VFSTR 128
 B.Sc - Department Electives

● Design a HTML page having a text box and four buttons viz Factorial, Fibonacci,
Prime and Palindrome. When a button is pressed an appropriate java script
function should be called to display the following:
o Factorial of that number.
o Fibonacci series up to that number.
o Prime numbers up to that number.
o Is it palindrome or not?
● Design a web page that contains a color pallet, when the user moves the mouse
to the particular area, then it changes the background color of the web page.
● Design a registration page to validate the following fields using Java Script.
o Make sure the user name starts with an upper case letter
o The user name must have at least one digit
o Ensure that Email is valid
o Ensure that thepasswordlengthisbetween8to20characters
o Make sure the password contains at least one upper case letter, one lower
case, and one special character exclude [. (dot), ,(comma), ;(semicolon), :
(colon)].
● Design a web page to display the videos on-page, on user selection using frames
and HTML5 tags.
● Design a web page to display different types of objects using HTML5 Canvas.
● Design a web application to validate entered username and password through JDBC
connection program and display user information on successful login and provide
profile editing option to the user. Else display an error message.
● Develop a JSP application to create a user on successful signup and update user
information on successful login and display user information on the home screen
and provide a logout button.
● Make an HTML form that collects the last name. Send the name to JSP page. If
there is an employee with that last name, show full details of him or her (just
show the first employee if there are multiple people with the same name). If
there is no employee with that last name, say “no employee records available.”

MODULE-2
UNIT-1 [8L+0T+16P=24 hours]

PHP
PHP: Introduction to PHP, Expressions, and control flow in PHP, functions and objects, Arrays, Accessing
MySQL using PHP, Form Handling, Cookies, Sessions, and Authentication.

UNIT-2 [8L+0T+16P=24 hours]

ANGULAR AND NODE JS

Angular JS: Introduction, Expressions, Modules, Directives, Controllers, Filters, Events,
Forms, Form Validation.
Node JS: Introduction, Setup Dev Environment, Modules, Node Package Manager,
Creating Web server, File System, Events, Express.js, Accessing MySQL from Node.js.

PRACTICES :
● Design a web page using PHP, upload image into web page and display image,
when user clicking on view button.
● Design a personal Information form, Submit & Retrieve the form data using
$_GET(), $_POST() and $_REQUEST() Variables.
● Design a login page to validate username and password through MySQL. If login
is successful display user information on home page and modify user information
on edit page using sessions. When user logged out, destroy all user-related
VFSTR 129
 B.Sc - Department Electives
sessions.

VFSTR 130
 B.Sc - Department Electives

● Design a web page to accept payment data from user and do the payment, on
SKILLS:
Perform client-side successful payment display details on the screen. A Session should be set while
validation using Java Script and Angular JS. doing payment up to 10 minutes after that link/payment page should be
Store and re- trieve data using Node JS. destroyed irrespective of user payment.
Generate
dynamic web pages using JSP and PHP. ● Design a web application to validate user registration page using Angular JS.
Develop a web application or website for any real-time requirements.
● Design a search engine using Angular JS. On key press, display data on web page.
● Design a web page to validate user name and password using: Node.js and PHP.
When user clicks on login button, server checks the data availability in data
base. If the data matches a successful login page is returned. Otherwise, a
failure message is shown to the user.
● Design a web application to display the active duration of the user, i.e., time
between login and logout.

COURSE OUTCOMES :
Upon successful completion of this course, students will have the ability to :

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Usage of HTML, HTML5, CSS, Java Script,
1 Apply 1, 1
and PHP in web application development.
2
Apply Angular JS features for form
2 validation and Node JS, and JDBC Apply 1,2 1
concepts to perform database
operations from web pages.
Analyse the suitability of Node JS and JSP
3 technologies to build solutions for real-world Analyse 2 2
problems.
Design and develop three tier web
4 Create 2 3
applications using JSP, Node JS, Angular JS,
and PHP.

TEXT BOOKS:
1. Jon Duckett, “Beginning Web Programming with HTML, XHTML, and CSS”, 2nd
Edition, Wiley Publishing, Inc, 2008.
2. Robin Nixon, “Learning PHP, MySQL & JavaScript WITH JQUERY, CSS & HTML5”, 4th
Edition, O’Reilly, 2015.

REFERENCE BOOKS:
1. Paul Deitel, Harvey Deitel, Abbey Deitel, “Internet & World Wide Web How to
Program”, 5th Edition, Pearson Education, 2012.
2. Kishori Sharon, “Java APIs, Extensions and Libraries with JavaFX, JDBC, jmod, jlink,
Networking and the process API”, 2nd Edition, Apress, 2018.
3. Brad Dayley, Brendan Dayley, and Caleb Dayley, “Node.js, Mongo DB and
Angular Web Development: The definitive guide to using the MEAN stack to build
web applications,” 2nd Edition, Pearson Education, 2018.
4. ManuelKiessling, “The Node Craftsman Book”, Packt Publisher, 2017.
5. Adrian W. West and Steve Prettyman, “Practical PHP 7, MySQL 8, and MariaDB
Website Databases: A Simplified Approach to Developing Database-Driven
Websites”, 1st edition, A Press, 2018.

VFSTR 131
 B.Sc - Department Electives

VFSTR 132
 B.Sc - Department Electives

22BS824 PYTHON PROGRAMMING

Hours Per Week :

L T P C
2 2 2 4
PREREQUISITE KNOWLEDGE : Prior knowledge of any programming language and
object-oriented concepts is helpful but not mandatory..

COURSE DESCRIPTION AND OBJECTIVES:

This course offers sufficient knowledge required to understand the fundamental
Source: https:// blog/2019/12/tech-jobs-
concepts of Python programming language. This course enables students to choose
appropriate data structures (lists, dictionaries, tuples, sets, strings) for the given
problem. In addition, the students will be able to create reliable, modular and reusable
applications using Object- Oriented Programming approaches. At the end they will get an
idea of how to access database using python programming, develop web applications,
and using web Services using python Programming.

MODULE-1
UNIT-1 [6L+6T+6P=18 Hours]
INTRODUCTION
Introduction to python, Variables, Assignment, Keywords, Built-in functions, Indentation,
Comments, Basic data types - integers, float, complex, Boolean, strings; Python program
development, running python using REPL shell, Python scripts.
Operators and Expressions: Operators- arithmetic operators, comparison (relational)
operators, assignment operators, logical operators, bitwise operators, membership
operators, identity operators; Expressions and order of evaluations.
Control Structures: Conditional control structures - if, elif, else; Loop control structures -
for, while, for... else, while…else, nested loops, break, continue, pass.

UNIT-2 [10L+01T+10P=30 Hours]

PYTHON DATA STRUCTURES AND FUNCTIONS
Data Structures: Lists, Tuples, Sets, Strings, Dictionary - creation, accessing, basic
operators and methods; List comprehensions.
Functions: Defining functions, calling functions, Passing arguments - keyword
arguments, default arguments, positional arguments, variable-length arguments; Types of
functions- anonymous functions, fruitful function, recursive functions; Scope of the
variables- global and local variables, Development of recursive and non-recursive
functions.

PRACTICES
● A. Given an integer N, write a program to find its 1’s complement.
B. Given two integers N1 and N2, write a program to find their product without using multiplication
(‘*’) operator and loops.
C. Given two integers N1 and N2 having same value, write a program to check
whether N1 and N2 points to the same object or not.
● A. Given an Integer N, write a program to check whether given number is even
or odd without using modulus operator.
B. Given a number N, number of bits K and starting position P, write a program
to extract K bits from a position P (from right) in the binary representation of N.
Convert the extracted bits in decimal number.

VFSTR 133
 B.Sc - Department Electives

VFSTR 134
 B.Sc - Department Electives

● Given coordinates of centre of a circle, radius and a point coordinate, write a

SKILLS:
Installation and usage of python libraries. program to check whether the given point lies inside or on the circle, or outside
Working with varieties of data structures. the circle.
Improved ● Write a program to find the sum of digits in a given integer.
analytical and problem-solving abilities.
● Given
Developing structured modular and Object-oriented programming an integer N as an input, decides the geometrical figure for which the area
solutions.
has to be calculated, for example N=1 for circle, N=2 for rectangle, and N=3 for
triangle. Write a program to display the area of the respective figure.
● A semi prime number is an integer which can be expressed as a product of two
distinct primes. For example, 15 = 3*5 is a semi prime number but 9 = 3*3 is
not.
For a Given an integer number N, write a program to find whether it can be expressed as a
sum of two semi-primes or not (not necessarily distinct).
● Given an integer amount X, write a program to find the minimum number of currency notes
$
(500, 100, 50, 20, 10, 5, 2, 1) required for the given amount.
Input:
575
Where input is the amount for which we have to calculate the number of currency notes.
Output: 4
Explanation: Total amount = 1(500 dollar note) + 1(50 dollar note) + 1(20 dollar
note) + 1(5 dollar note) = 575, hence the minimum number of notes required is
4.
● For a given a string S and width W, write a program to wrap the string S into a
paragraph of width W.
Example:
Input:
ABCDEFGHIJKLIMNOQRSTUVWXYZ
4
Output:
ABCD EFGH IJKL IMNO QRST UVWX YZ
● Write a program to Measure the required time to access the first element, nth element and
n/2
element stored in list and tuple data structure.
● Given a list L of N numbers (integers), Write a program to find the sum of the
elements of given list L with the corresponding elements of the reverse of list L.
If list L has elements [1,2,3], then reverse of the list L will be [3,2,1] and the
resultant list should be [4,4,4].
● Given a positive integer number n. Write a program to generates a dictionary d
which contains (i, i*i*i) such that i is the key and i*i*i is its value, where i is from
1 to n (both included). Print the content of the dictionary d.
● Write a program to create a data structure to store student information such as
regd no, name, percentage of marks, phone number and display the student
details based on the order of percentage of marks.
● For a Given a string, design and implement functions to perform the following:
a) remove vowels in the given string.
b) count number of uppercase and lowercase letters.
c) remove all special characters.
d) check whether it is a palindrome or not.
e) swap case of each letter.
● Create a function that receives 3 numbers and returns the median, i.e. the
number that is not the min and not the max, but the one in between.
● Given two lists of integer numbers, write a function to perform the following operations.
a. print elements that are common in both the lists. (Print without duplicates).
b. print elements that are present in the first list and not present in second list.
VFSTR 135
 B.Sc - Department Electives
c. print elements that contain the first element of the first list and last element of the second
list.
d. print elements that contain sum of elements of first list and sum of elements of second
list.
e. print largest number of both the lists.
f. print smallest number of both the lists.

VFSTR 136
 B.Sc - Department Electives

MODULE-2
UNIT-1 [8L+8T+8P=24 Hours]
MODULES
Creating modules, Import Statement, From...Import Statement, Name Spacing, Creating user defined
modules
Standard Modules: sys, math, date, time, os, random and itertools modules.
Packages: Numpy, Pandas, Matplotlib, Requests, Nltk.
File Processing: Reading and writing files -creating a new file, writing to a file, reading text
files, opening and closing files, reading, writing, tell (), seek (), rename ().

UNIT-2 [8L+8T+8P=24Hours]
ERRORS AND EXCEPTIONS
Introduction to Exceptions, Handling Exception, Try Except Else and Finally Block, Raising Exceptions.
Simple Graphics and Image Processing: Overview of Turtle Graphics, Two Dimensional
Shapes, Colours and RBG System and Image Processing,
PRACTICES :
● Given a string ‘S’, find all possible permutations of the string S in lexicographic
sorted order. Each Permutation size is “2” or “3”.
Sample Input:
HACK
Expected Output: AC AH AK CA CH CK HA HC HK KA KC KH
● Write a program that finds area of the pentagon when length from center of a
pentagon to vertex are given, the formula for computing the area of pentagon is
a 3/2 s2, where s is the length of the side, the side can be computed using
formula s= 2r sin π/5, where r is the length from the center of a pentagon to
vertex.
Given X as a date. Write a program to find what the day is on that date.
Sample Input: 08 05 2015
Expected Output:
Wednesday
● Arun is working in an office which is N blocks away from his house. He wants to
minimize the time it takes him to go from his house to the office. He can either
take the office cab or he can walk to the office. Arun’s velocity is V1 m/s when he
is walking. The cab moves with velocity V2 m/s but whenever he calls for the
cab, it always starts from the office, covers N blocks, collects Arun and goes back
to the office. The cab crosses a total distance of N meters when going from office
to Arun’s house and vice versa, whereas Arun covers a distance of (2–√◻N)(2◻N)
while walking. Help Arun to find whether he should walk or take a cab to
minimize the time.
Input Format:
A single line containing three integer numbers N, V1, and V2 separated
by a space. Example-1:
Input:
5 10 15
Output:
Cab
● Create a binary NumPy array (containing only 0s and 1s) and convert a binary
NumPy array in to to a Boolean NumPy array
VFSTR 137
 B.Sc - Department Electives
● Convert the first column of a Data Frame as a Series by using suitable packages.
Sample Input:
Original Data Frame

VFSTR 138
 B.Sc - Department Electives

col1 col2 col3

0 1 4 7
1 2 5 5
2 3 6 8
3 4 9 12
4 7 5 1
5 11 0 11

Sample Output:
0 1
1 2
2 3
3 4
4 7
5 11
● Create two text files and read data from two text files. Display a line from first
file followed by the corresponding line from the second file.
● Define the following functions that are more robust to erroneous input data
a) To divide two numbers (To handle Zero Division Error).
b) To read two integer numbers and display them (To handle Value Error).
c) To display elements of a list (To handle Index Error).
d) To open a file and display file contents (To handle File Not Found Error)
● Write a python program to handle multiple exceptions using raise keyword.
● Draw the spiral hexagon, where we use turtle to create a spiral structure. The final shape is
a
hexagon and there are various colors used in producing the sides of the hexagon.
● Implement a program to print it in a counterclockwise spiral form for a given square matrix.
Sample Input:
4
25 1 29 7
24 20 4 32
16 38 29 1
48 25 21 19
● Sample Output:
25 24 16 48 25 21 19 1 32 7 29 1 20 38 29 4
● Write a function that finds the nearest prime number of a given number.

COURSE OUTCOMES:
Upon successful completion of this course, students will have the ability to :

CO Blooms Module Mapping

Course Outcomes
No. Level No. with POs
Make use of different data types to design
1. Apply 1 1, 2, 5
pro- grams involving decisions, loops, and
functions.
Analyze the usage of different data
2. structures for practical and contemporary Analyze 1 1, 2, 3, 5
applications for a given problem.

VFSTR 139
 B.Sc - Department Electives

VFSTR 140
 B.Sc - Department Electives

Develop functional, reliable and User-friendly

3 Python programs for given problem Apply 2 1, 2, 3,5
statement and constraints.
Installing the python environment and
4 related packages that are required for Apply 2 1, 2,3,5
practical and con- temporary applications.

TEXT BOOKS:
1. Kenneth A. Lambert, “The Fundamentals of Python: First Programs”, Cengage Learning, 2011.
2. Mark Lutz, “Learning Python”, 5th edition, Orielly Publishers, 2013.

REFERENCE BOOKS:
1. Introduction to Computation and Programming Using Python. John V. Guttag, The MIT Press.
2. James Payne, “Beginning Python using Python 2.6 and Python 3”, Wrox publishing.
3. Paul Gries, “Practical Programming: An Introduction to Computer Science using
Python 3”, The Pragmatic Bookshelf, 2nd edition, 4 Oct. 2013.
4. Allen B. Downey, “Think Python”, 1st edition, Orielly publishing.

VFSTR 141
 B.Sc - Department Electives

VFSTR 142