AR23-CSD
AR23-CSD
(AUTONOMOUS)
Approved by AICTE, Accredited by NBA & NAAC, Recognized under 2(f) and 12(b) of UGC
Permanently Affiliated to JNTUGV, Vizianagaram
K. Kotturu, Tekkali, Srikakulam-532201, Andhra Pradesh, India
A student will be declared eligible for the award of the B.Tech Degree/B.Tech Degree with
Honors if he/she fulfills the following academic regulations:
Registered for 160 credits and he/she must secure total 160 credits.
In case of B.Tech Degree with Honors, student has to secure additional 15 credits fulfilling all
the requisites of a B.Tech program i.e., 160 credits. Registering for Honors is optional and
Honors is to be completed simultaneously with B.Tech programme.
Students, who fail to complete their four-year course of study within 8 years or fail to acquire
the 160 Credits for the award of the degree within 8 academic years from the year of their
admission, shall forfeit their seat in B.Tech programme and their admission shall stand
cancelled.
2. Courses of study:
The following courses of study are offered at present with specialization in the B.Tech
Programme:
And any other course as approved by the authorities of the University from time to time.
Credit: A unit by which the course work is measured. It determines the number of hours of
instruction required per week. One credit is equivalent to one hour of teaching
(Lecture/Tutorial) or two hours of practical work/field work per week.
Credit Definition:
Academic Year: Two consecutive (one odd + one even) semesters constitute one
academic year.
Choice Based Credit System (CBCS): The CBCS provides a choice for students to
select from the prescribed courses.
4. Course pattern:
The entire course of study is of four academic years and each year will have TWO
Semesters (Total EIGHT Semesters).
A student is eligible to appear for the end examination in a subject, but when absent
for it or failed in the end examinations he/she may appear for that subject’s
supplementary examinations, when offered.
5. Evaluation Methodology:
The performance of a student in each semester shall be evaluated subject wise with
a maximum of 100 marks for theory and 100 marks for practical subject. Summer
Internships shall be evaluated for 100 marks, Full Internship & Project work in final
semester shall be evaluated for 200 marks, and mandatory courses with no credits
shall be evaluated for 100 marks.
A student has to secure not less than 35% of marks in the end examination (in
fraction rounded to lower digit) and a minimum of 40% of marks in the sum total of
the mid semester and end examination marks taken together for the theory,
practical, design, drawing subject or project etc. In case of a mandatory course,
he/she should secure 40% of the total marks.
Theory Course:
2 of 13
Continuous internal assessment:
For theory subjects, during the semester, there shall be two midterm examinations.
Each midterm examination shall be evaluated for 30 marks of which 5 marks for
objective paper (10X0.5=5 marks) (10 minutes duration), 20 marks for subjective
paper (90 minutes duration) and 5 marks for assignment.
Each subjective paper is to be held for 30 marks, with the duration of 90 minutes and
scale down to 20 marks.
Subjective paper contains three descriptive type questions with internal choice.
Weightage of Marks
I MID I OBJECTIVE II MID II OBJECTIVE
I Unit 12 Marks 2 Marks III Unit 6 Marks 1 Mark
II Unit 12 Marks 2 Marks IV Unit 12 Marks 2 Marks
III Unit 6 Marks 1 Mark V Unit 12 Marks 2 Marks
The objective paper shall be conducted along with subjective paper test.
Sum of marks obtained in objective paper and subjective paper is taken as MID term
exam marks.
Final mid semester marks (25 marks) shall be arrived by considering the marks
secured by the student in both the mid examinations with 80% weightage given to
the better mid exam and 20% to the other.
The question paper shall have descriptive type questions held for 70 marks, with the
duration of 180 minutes. There shall be one question from each unit with internal
choice. Each question carries 14 marks (5X14M=70 marks).
Laboratory Course:
Day-to-day work in the laboratory shall be evaluated for 15 marks by the concerned
laboratory teacher based on the regularity/record/viva and 15 marks for the internal
test.
3 of 13
(a) Semester end examination:
The end examination shall be conducted by the teacher concerned and external
examiner from outside the college.
Procedure 20 marks, experimental work 10 marks, Results 20 marks and Viva voce
20 marks (or)
Description 10 marks, Programming Code 20 marks, Output 20 marks and Viva voce
20 marks.
Day-to-day work shall be evaluated for 20 marks by the concerned teacher based on
the submission of sheets prepared in the class and 10 marks for the MID term test.
During the semester, there shall be two midterm examinations. Each midterm
examination shall be evaluated for 30 marks subjective paper (120 minutes
duration).
Subjective paper contains three descriptive type questions with internal choice.
Weightage of Marks
I MID II MID
I Unit 12 Marks III Unit 6 Marks
II Unit 12 Marks IV Unit 12 Marks
III Unit 6 Marks V Unit 12 Marks
MID term marks (10 marks) shall be arrived by considering the marks secured by the
student in both the mid examinations with 80% weightage given to the better mid
exam and 20% to the other.
In case of Engineering Graphics the question paper shall have descriptive type
questions for 70 marks. There shall be one question from each unit with internal
choice. Each question carries 14 marks (5X14M=70 marks).
4 of 13
Mandatory course:
Mandatory course is one among the compulsory courses and does not carry any
Credits. The list of mandatory courses is as below:
➢ Induction Program
➢ Constitution of India
➢ Environmental Science
➢ Human Values
A student can select 6 activities of his/her choice with a minimum of 01 activity per
unit. Each activity shall be evaluated by the concerned teacher for 15 marks, totalling
to 90 marks.
6. Attendance Requirements:
5 of 13
A Student will not be promoted to the next semester unless he satisfies the
attendance requirement of the present semester. He/she may seek re-admission for
that semester when offered next.
The overall attendance in each semester of regular B.Tech course and Honors
course shall be computed separately.
A student detained due to lack of attendance in Honors course shall not be permitted
to continue Honors programme, but he/she can continue regular B.Tech programme.
On passing a course of a programme, the student shall earn assigned credits in that
Course.
A letter grade and grade points will be awarded to a student in each course based on
his/her performance as per the grading system given below.
The performance of each student at the end of the each semester is indicated in
terms of SGPA.
6 of 13
The SGPA is calculated as below:
Σ(CR GP)
SGPA = (for all courses passed in a semester)
ΣCR
Both SGPA and CGPA shall be rounded off to 2 decimal points and reported in the
transcripts.
Award of Class:
8. Supplementary Examinations:
9. With–holding of Results:
If the candidate has any dues not paid to the university or if any case of indiscipline
or malpractice is pending against him/her, the result of the candidate shall be
withheld in such cases.
A student will be promoted from one semester to another semester if he/she satisfies
the minimum attendance requirement.
7 of 13
A student shall be promoted from II to III year only if he fulfills the academic
requirement of total 50% credits (if the number of credits is in fraction, it will be
rounded off to a lower digit) from regular and supplementary examinations of I year
and II year examinations, irrespective of whether the candidate takes the
examination or not.
A student shall be promoted from III year to IV year only if he fulfills the academic
requirements of total 50% credits (if number of credits is in fraction, it will be rounded
off to lower digit) from regular and supplementary examinations of I Year, II Year and
III Year examinations, irrespective of whether the candidate takes the examinations
or not.
Discontinued, detained, or failed candidates are eligible for readmission as and when
the semester is offered after fulfillment of academic regulations. Candidates who
have been detained for want of attendance or not fulfilled academic requirements or
who have failed after having undergone the course in earlier regulations or have
discontinued and wish to continue the course are eligible for admission into the
unfinished semester from the date of commencement of class work with the same or
equivalent subjects as and when subjects are offered, subject to Section 1 and they
will follow the academic regulations into which they are readmitted.
14. General:
Wherever the words “he,” “him,” “his,” occur in the regulations, they include “she,”
“her,” “hers” as well.
The academic regulation should be read as a whole for the purpose of any
interpretation.
In the case of any doubt or ambiguity in the interpretation of the above rules, the
decision of the Principal is final.
The college may change or amend the academic regulations or syllabi at any time
and the changes or amendments made shall be applicable to all the students with
effect from the dates notified by the college.
*********
8 of 13
DISCIPLINARY ACTION FOR MALPRACTICES / IMPROPER CONDUCT IN
EXAMINATIONS
9 of 13
continuation of the course by the
student is subject to the academic
regulations in connection with
forfeiture of the seat. If the
imposter is an outsider, he will be
handed over to the police and a
case is registered against him.
4 If the student smuggles the answer book or Expulsion from the examination
additional sheet or takes out or arranges to hall and cancellation of
send out the question paper or performance in that subject and all
answer book or additional sheet during or the other subjects the student has
after the examination already appeared including
practical examinations and project
work and shall not be permitted for
the remaining examinations of the
subjects of that semester/year.
The student is also debarred for
two consecutive semesters from
class work and all semester-end
examinations. The continuation of
the course by the student is
subject to the academic
regulations in connection with
forfeiture of the seat.
5 If the student uses objectionable, abusive Cancellation of the performance in
or offensive language in the answer script that subject.
or in letters to the examiners or writes to
the examiner requesting him to award pass
marks
6 If the student refuses to obey the orders of In case of students of the college,
the Chief Superintendent/Assistant - they shall be expelled from
Superintendent / any officer on duty examination hall and cancellation
or misbehaves or creates disturbance of of their performance in that subject
any kind in and around the and all other subjects the
examination hall or organizes a walkout candidate(s) has (have) already
or instigates others to walk out or threatens appeared and shall not be
the officer-in charge or any person on permitted to appear for the
duty in or outside the examination hall remaining examinations of the
or causes any injury to any of his relatives subjects of that semester/year.
either by words spoken or written or by The students also are debarred
signs or by visible representation, assaults and forfeit their seats. In case of
the officer-in-charge or any person on duty outsiders, they will be handed over
in or outside the examination hall or any of to the police and a police case is
his relatives, or indulges in any other act of registered against them.
misconduct or mischief which results in
damage or destruction of property in the
examination hall or any part of the college
campus or engages in any other act which
in the opinion of the officer on duty
amounts to use of unfair means or
10 of 13
misconduct or has the tendency to disrupt
the orderly conduct of the examination
7 If the student leaves the exam hall taking Expulsion from the examination
away answer script or intentionally tears off hall and cancellation of
the script or any part thereof inside or performance in that subject and all
outside the examination hall the other subjects the student has
already appeared including
practical examinations and project
work and shall not be permitted for
the remaining examinations of the
subjects of that semester/year.
The student is also debarred for
two consecutive semesters from
class work and all university
examinations. The continuation of
the course by the candidate is
subject to the academic
regulations in connection with
forfeiture of the seat.
8 If the student possesses any lethal weapon Expulsion from the examination
or firearm in the examination hall hall and cancellation of the
performance in that subject and all
other subjects the student has
already appeared including
practical examinations and project
work and shall not be permitted for
the remaining examinations of the
subjects of that semester/year.
The student is also debarred and
forfeits the seat.
9 If student of the college, who is not a In case of student of the college,
candidate for the particular examination or expulsion from the examination
any person not connected with the college hall and cancellation of the
indulges in any malpractice or improper performance in that subject and all
conduct mentioned in clauses 6, 7, 8 other subjects the student has
already appeared including
practical examinations and project
work and shall not be permitted for
the remaining examinations of the
subjects of that semester/year.
The candidate is also debarred
and forfeits the seat. Person(s)
who do not belong to the college
will be handed over to police and.
a police case will be registered
against them.
10 If the student comes in a drunken condition Expulsion from the examination
to the examination hall hall and cancellation of the
performance in that subject and all
other subjects the student has
11 of 13
already appeared including
practical examinations and project
work and shall not be permitted for
the remaining examinations of the
subjects of that semester/year.
11 Copying detected on the basis of internal Cancellation of the performance in
evidence, such as, during valuation or that subject and all other subjects
during special scrutiny the student has already appeared
including practical examinations
and project work of that
semester/year examinations.
12 of 13
AR 23 - B.Tech. - CSD Course Structure
I YEAR I SEMESTER
Category Code Theory/Lab L T P C
MC 23MCS101 Induction Program 3 weeks 0
BH 23BHT101 Communicative English 3 0 0 3
BH 23BHT102 Linear Algebra and Calculus 2 1 0 3
BH 23BHT105 Chemistry 3 0 0 3
ES 23EST105 Introduction to Programming 3 0 0 3
ES 23ESL106 IT Workshop 1 0 4 3
BH 23BHL101 Communicative English Lab 0 0 3 1.5
BH 23BHL104 Chemistry Lab 0 0 3 1.5
ES 23ESL105 Computer Programming Lab 0 0 3 1.5
MC 23MCS103 Health and Wellness, Yoga and Sports 0 0 1 0.5
Total 12 1 14 20
I YEAR II SEMESTER
Category Code Theory/Lab L T P C
BH 23BHT103 Differential Equations and Vector Calculus 2 1 0 3
BH 23BHT104 Engineering Physics 3 0 0 3
PC 23CST101 Data Structures 3 0 0 3
ES 23EST102 Basic Electrical and Electronics Engineering 3 0 0 3
ES 23ESL103 Engineering Drawing 1 0 4 3
BH 23BHL102 Engineering Physics Lab 0 0 3 1.5
PC 23CSL101 Data Structures Lab 0 0 3 1.5
PC 23ESL102 Basic Electrical and Electronics Engineering Lab 0 0 3 1.5
MC 23MCS102 NSS/NCC/Scouts &Guides/Community Service 0 0 1 0.5
Total 12 1 14 20
1
AR 23: B.Tech. CSD I Year I Semester
INDUCTION PROGRAMME
Course Objectives
To enable students to build vocabulary appropriate to their levels and to make students
understand printed texts of different genres
To enhance basic writing skills of the students in different forms of written communication
To assist students implicitly synthesize the rules of grammar for the production of accurate
sentences
To aid students to acquire appropriate and adequate letter writing skills
To get students enhance their essay writing skills and develop reading skills
Course Outcomes
1. Students will be able to comprehend printed texts of different genres easily and they will be
able to make appropriate word choice for writing.
2. Students will be able to write short texts efficiently.
3. Students will be able to construct grammatically correct sentences.
4. Students will be able to communicate through letters effectively.
5. Students will be able to write essays and comprehend unfamiliar passages.
Unit 1
A Power of a Plate of Rice by Ifeoma Okoye
Skimming and Scanning Capital letters and Punctuation Spellings
Parts of speech Root words Prefixes and Suffixes Synonyms and Antonyms
Unit II
Night of the Scorpion by Nissim Ezekiel
Sequencing Paragraph writing Cohesive devices Articles Prepositions
Homonyms, Homographs, homophones
Unit III
Biography of Steve Jobs
Drawing inferences Paraphrasing, Summarizing, Note-making Verbs and Tenses,
Subject-verb agreement Compound words Collocations
Unit IV
The Toys of Peace by Saki
Data interpretation Official letters and Résumé Direct and Indirect speech
Academic reporting verbs Active and passive voice Words often confused Jargon
Unit V
The Power of Intrapersonal Communication (An Essay)
Reading comprehension Essay writing Correcting errors Technical Jargon
Textbooks:
1. Pathfinder: Communicative English for Undergraduate
Students,
st
1 Edition, Orient BlackSwan, 2023 (Units 1, 2 & 3)
2. Empowering English by Cengage Publications, 2023 (Units 4 & 5)
Reference Links:
Grammar
1. www.bbc.co.uk/learningenglish
2. https://dictionary.cambridge.org/grammar/british-grammar/
3. www.eslpod.com/index.html
4. https://www.learngrammar.net/
5. https://english4today.com/english-grammar-online-with-quizzes/
6. https://www.talkenglish.com/grammar/grammar.aspx
Vocabulary
1. https://www.youtube.com/c/DailyVideoVocabulary/videos
2. https://www.youtube.com/channel/UC4cmBAit8i_NJZE8qK8sfpA
Course Objectives
To equip the students with standard concepts and tools of mathematics to handle various real-world
problems and their applications as follows.
Course Outcomes
At the end of the course, the student will be able to
1. Develop matrix algebra techniques that are needed by engineers for practical applications.
2. To find the eigen values and eigen vectors and solve the problems by using linear
transformation
3. Learn important tools of calculus in higher dimensions.
4. Familiarize with functions of several variables which is useful in optimization.
5. Familiarize with double and triple integrals of functions of several variables in two and
three dimensions.
Unit 1 Matrices
Rank of a matrix by echelon form, normal form. Inverseof Non- singular matrices by Gauss-Jordan
method.
System of linear equations: Solving system of Homogeneous and Non-Homogeneous equations by
Gauss elimination method, Gauss Seidel Iteration Method.
Unit 3 Calculus:
Mean Value Theorems: Theorem, mean value theorem with their geometrical
remainders
(without proof), Problems and applications on the above theorems.
Text books:
1. B.S.Grewal,HigherEngineeringMathematics,44/e,Khanna Publishers,2017.
2. Erwin Kreyszig, Advanced Engineering Mathematics, 10/e,John Wiley & Sons, 2018.
Reference Books:
1. R.K.Jain and S.R.K.Iyengar, Advanced Engineering Mathematics, 5/e, Alpha
ScienceInternational Ltd.,2021 (9th reprint).
2. George B. Thomas, Maurice D.Weir and Joel Hass, Thomas Calculus,14/e,
PearsonPublishers, 2018.
3. Glyn James, Advanced Modern Engineering Mathematics, 5/e, Pearson publishers, 2018.
4. Michael Greenberg, Advanced Engineering Mathematics, 9thedition, Pearson edn
5. H. K Das, Er. Rajnish Verma, Higher Engineering Mathematics, S. Chand,2021.
Text Books:
1. Jain and Jain, Engineering Chemistry, 16/e, DhanpatRai, 2013.
2. ical Chemistry, 10/e, Oxford
University Press, 2010.
Reference Books:
1. Skoog and West, Principles of Instrumental Analysis, 6/e, Thomson, 2007.
2. J.D. Lee, Concise Inorganic Chemistry, 5th Edition, Wiley Publications, Feb.2008
3. Textbook of Polymer Science, Fred W. Billmayer Jr, 3rd Edition
Course Outcomes
1. Understand the fundamentals of Computers and C programming
2. Develop programs using control structures and Arrays to store and manipulate data
3. Design modular programs using functions and storage classes
4. Use structures and pointers to manipulate record based data
5. Implement and manipulate files on secondary storage media
Unit I
Introduction to Programming: Introduction to components of Computer system, Algorithm, Flow
chart, Program development steps, C Tokens, Data Types, Operator precedence and associativitiy,
Structure of C program, simple programs using Basic I/O statements.
Unit II
Control Structures: Decision statements: if, if-else, nested if, if-else-if ladder, and switch
Iterative statements: while loop, do-while loop, for loop, nested loops
Branching: Break, continue
Arrays: Definition, Types: Single Dimensional arrays, Multi Dimensional arrays, declaration,
initialization, accessing elements, Matrix operations and String Handling
Unit III
Functions: Definition, Declaration, Types of Functions, Parameter passing, Call byvalue and call by
reference, Passing Arrays to functions, Recursion, Scope and lifetime of variables, Command line
arguments, Storage classes.
Pointers: Definition, Declaration, Initialization, Pointer arithmetic, functions and pointers, Pointer to
pointer, Uses of Pointers, arrays and pointers.
Unit IV
Structures: Definition, Declaration, Accessing the structure elements, Array of structures, Arrays
with in structures, pointer to structure, Self referential structure, passing structure to function, nested
structures and unions, Dynamic memory allocation.
Unit V
File Handling: Introduction, Types of files, Defining and Opening a File, Closing a File, Input/Output
operations on Files, Error Handling during I/O operations, Random Access to Files.
Text Books
1. B. W Kernighan, Dennis M. Ritchie. The C Programming Language. 2nd Edition, PHI.
2. Behrouz A. Forouzan, Structured Approach Using Richard F. Gilberg 3rd Edition
References
1. Yashwant Kantikar. 2012. Let Us C, 8th Ed. PBP Publications.
2. E. Balagurusamy. 2011. C Programming. Tata Mc Graw Hills, New Delhi, India.
Web Links:
1. https://www.tutorialspoint.com C programming C Home
2. https://www.programiz.com/c-programming
Course Outcomes:
Students should be able to:
Gain knowledge of computer systems such as system units, input devices, and Output devices
connected to the computer. Students gain knowledge to understand the booting process that
includes switching on the system and being familiar with all the commands of an operating
system.
Able to explain and execute basic Linux commands.
Gain knowledge to understand the working of the internet that include the use of protocols,
domains, IP addresses, URLs, web browsers and search engines etc.
Create a static webpage using HTML.
Get familiarized with parts office tools like Ms-Word, Excel, and PowerPoint.
Computer Hardware:
Experiment 1:
Identification of peripherals of a PC: Prepare a report containing the block diagram along with
the configuration of each component and its functionality, Input/ Output devices, I/O ports,
and interfaces. A practice on disassembling the components of a PC and assembling them to
working condition (optional task).
Operating Systems:
.Experiment 2: Operating System installation:
Installing an Operating System Windowson a PC
Experiment 8: MS Word
Word Orientation: Describe the Importance of MS- Word
Task 1:Using MS Word to create a project certificate. Features to be covered:-Formatting
Fonts in Word, Drop Cap in Word, Applying Text effects, Using Character Spacing, Borders
and Colors, Inserting Header and Footer, Using Date and Time options in Word.
Task 2: Creating project abstract for using MS-WORD: Abstract Features to be covered:-
Formatting Styles, Inserting table, Bullets, and Numbering, Changing Text Direction, Cell
alignment, Footnote, Hyperlink, Symbols, Spell Check, Images from files and clipart, Drawing
toolbar and Word Art, Formatting Images, Textboxes, and Paragraphs.
Task 4: Creating a Feedback form - Features to be covered- Forms, Text Fields, Inserting
objects, Mail Merge in Word.
Experiment 9: MS-Excel
Excel Orientation: The mentor needs to tell the importance of MS/ equivalent (FOSS) tool
Excel as a Spreadsheet tool, give the details of the four tasks and features that would be
covered in each. Using Excel Accessing, overview of toolbars, saving excel files, Using help
and resources
Task 2: Creating Performance Analysis - Features to be covered:- Split cells, freeze panes,
group and outline, Sorting, Boolean and logical operators, Conditional formatting.
Task 2: Concentrating on the in and out of Microsoft PowerPoint, Helping them learn the best
Practices in designing and preparing PowerPointpresentations. Topic covered during this week
Includes: - Master Layouts (slide, template, and notes), Types of views (basic, presentation,
Text Books:
1.
2. ition, WILEY
Dreamtech
3.
4. PHI (Microsoft)
5. Grannell, Craig, Victor Sumner, and DionysiosSynodinos. The essential guide to HTML5 and
CSS3 web design. Friends of ED, 2012.
Reference Books:
1 Scott. Mueller, 2008, Upgrading and Repairing PCs, 22/e, QUE,
2 Cheryl A Schmidt ,The Complete Computer upgrade and repair book,3/e , Dreamtech
Course Objectives
To enable students to cultivate proper speech habits
To enhance the ability of students to make extempore speeches
To help students master techniques of being successful in debates and group discussions
To assist students to acquire effective and adequate presentation skills
To prepare students to face interviews in an assertive manner
Course Outcomes
1. Students will be able to pronounce words accurately.
2. Students will be able to speak spontaneously.
3. Students will be able to participate in debates and group discussions and contribute
proactively.
4. Students will be able to present data on select topics using pre-existing slides.
5. Students will be able to face interviews confidently.
Unit 1
Phonetics Neutral English Accent
Unit 2
JAM session Role play
Unit- 3
Debate Group Discussion
Unit 4
Poster Presentation PPT Presentations
Unit 5
Cover letter Résumé Interview Skills
Suggested Software:
Walden InfoTech
Young India Films
Reference Books:
1. Meenakshi Raman, Sangeeta-Sharma. Technical Communication. Oxford Press.
2018.
2. Samson T : Innovate with English, Foundations
3. Grant Taylor: English Conversation Practice, Tata McGraw-Hill Education India, 2016.
4. -Speaking skills in English. Sage
Publications.
5. in. Cambridge Academic English (B2). CUP, 2012.
6. T. Balasubramanyam, A Textbook of English Phonetics for Indian Students, (3rd Ed.) Trinity
Press.
Course Objectives
Verify the fundamental concepts with experiments.
Course Outcomes
At the end of the course, the students will be able to
1. Determine the cell constant, conductance and potential of solutions.
2. Prepare advanced polymer Bakelite materials.
3. Measure the strength of an acid present in secondary batteries by pH metry.
4. Analyse the sample using spectroscopic techniques.
5. Measure molecular/system properties such as chloride content, hardness of water, dissolved
oxygen, of surface tension and viscosity etc
List of Experiments:
Text Books
1. "Vogel's Quantitative Chemical Analysis 6th Edition 6th Edition" Pearson Publications by J.
Mendham, R.C. Denney, J.D. Barnes and B. Sivasankar
Course Objectives
To gain experience about structured programming
To help students to understand the implementation of C language
To understand various features in C
Course Outcomes
1. Solve the given problem using the syntactical structures of C language.
2. Design programs involving decision structures and loops.
3. Apply programming to solve different operations on arrays and strings.
4. Develop modularity concept using functions and write programs for allocating memory
dynamically.
5. Construct C program that uses structures and unions and implement file operations on
givenapplication.
List of Experiments
Text Books:
1. B. W Kernighan, Dennis M. Ritchie. The C Programming Language. 2 nd Edition, PHI.
2.
Reference Books:
1. Yashwant Kantikar. 2012. Let Us C, 8th Ed. PBP Publications.
2. E. Balagurusamy. 2011. C Programming. Tata Mc Graw Hills, New Delhi, India.
Web References:
1. https://www.tutorialspoint.com Home
2. https://www.programiz.com/c-programming
Course Objective
The main objective of introducing this course is to make the students maintain their mental and
physical wellness by balancing emotions in their life. It mainly enhances the essential traits required
for the development of the personality.
Course Outcomes
After completion of the course the student will be able to
1. Understand the importance of yoga and sports for Physical fitness and sound health.
2. Demonstrate an understanding of health-related fitness components.
3. Compare and contrast various activities that help enhance their health.
4. Assess current personal fitness levels.
5. Develop Positive Personality
Unit 1
Concept of health and fitness, Nutrition and Balanced diet, basic concept of immunity Relationship
between diet and fitness, Globalization and its impact on health, Body Mass Index (BMI) of all age
groups.
Activities:
i) Organizing health awareness programmes in community
ii) Preparation of health profile
iii) Preparation of chart for balance diet for all age groups
Unit 2
Concept of yoga, need for and importance of yoga, origin and history of yoga in Indian context,
classification of yoga, Physiological effects of Asanas- Pranayama and meditation, stress management
and yoga, Mental health and yoga practice.
Activities:
Yoga practices Asana, Kriya, Mudra, Bandha, Dhyana, Surya Namaskar
Unit 3
Concept of Sports and fitness, importance, fitness components, history of sports, Ancient and Modern
Olympics, Asian games and Commonwealth games.
Activities:
i) Participation in one major game and one individual sport viz., Athletics, Volleyball,
Basketball, Handball, Football, Badminton, Kabaddi, Kho-kho, Table tennis, Cricket etc.
ii) Practicing general and specific warm up, aerobics
iii) Practicing cardiorespiratory fitness, treadmill, run test, 9 min walk, skipping and running.
1. Gordon Edlin, Eric Golanty. Health and Wellness, 14th Edn. Jones & Bartlett Learning, 2022
2. T.K.V.Desikachar. The Heart of Yoga: Developing a Personal Practice
3. Archie J.Bahm. Yoga Sutras of Patanjali, Jain Publishing Company, 1993
4. Wiseman, John Lofty, SAS Survival Handbook: The Ultimate Guide to Surviving Anywhere
Third Edition, William Morrow Paperbacks, 2014
5. The Sports Rules Book/ Human Kinetics with Thomas Hanlon. -- 3rd ed. Human Kinetics,
Inc.2014
General Guidelines:
1. Institutes must assign slots in the Timetable for the activities of Health/Sports/Yoga.
2. Institutes must provide field/facility and offer the minimum of five choices of as many as
Games/Sports.
3. Institutes are required to provide sports instructor / yoga teacher to mentor the students.
Evaluation Guidelines:
Course Objectives:
To equip the students with standard concepts and tools of mathematics to handle various real-
world problems and their applications as follows
To furnish the learners in the concept of first order and first degree differential equations and
multivariable calculus.
To enlighten the learners in the concept of higher order differential equations with constant
coefficients.
To furnish the learners with solution methods for partial differential equations that model
physical processes
To equip knowledge with basic concepts and techniques to interpret the physical meaning of
different operators such as gradient, curl and divergence by handling various real-world
applications
To furnish the learners with basic concepts and techniques the work done against a field,
circulation and flux using vector calculus by handling various real-world applications.
Course Outcomes:
At the end of the course, the student will be able to:
1. Solve the differential equations related to various engineering fields.
2. Model engineering problems as higher order differential equations and solve analytically.
3. Identify solution methods for partial differential equations that model physical processes.
4. Interpret the physical meaning of different operators such as gradient, curl and divergence.
5. Estimate the work done against a field, circulation and flux using vector calculus.
Unit 1
Differential equations of first order and first degree Exact equations and equations reducible to
exact form. Linear differential equations Bernoul Law
of natural growth and decay- Electrical circuits
Unit 2
Linear differential equations of higher order (Constant Coefficients)
Definitions, homogenous and non-homogenous, complimentary function, general particular
integral, method of variation of parameters. L-C-R Circuit problems.
Unit 3
Partial Differential Equations Introduction and formation of Partial Differential Equations by
elimination of arbitrary constants and arbitrary functions, solutions of first order linear equations
coefficients.
Unit 4
Vector differentiation Scalar and vector point functions, vector operator del, del applies to scalar
point functions-Gradient, del applied to vector point functions - Divergence and Curl, Vector
identities.
Unit 5
Vector integration Line integral- circulation- work done, surface integral-
the plane (without proof), St
(without proof) and problems on these theorems.
Textbooks:
1. Erwin Kreyszig, Advanced Engineering Mathematics, 10/e,John Wiley & Sons, 2018.
2. B.S.Grewal,HigherEngineeringMathematics,44/e,Khanna publishers,2017.
Reference Books:
1. Dennis G.Zill and Warren S.Wright, Advanced Engineering Mathematics, Jones andBartlett,
2018.
2. Micheael Greenberg, Advanced Engineering Mathematics, 9th edition, Pearson edn
3. George B. Thomas, Maurice D. Weir and Joel Hass, Thomas Calculus, 14/e, Pearson
Publishers, 2018.
4. R. K. Jain and S. R. K. Iyengar, Advanced Engineering Mathematics, 5/e, Alpha Science
International Ltd., 2021 (9th reprint).
5. B.V. Ramana, Higher Engineering Mathematics, McGraw Hill Education, 2017
Course Objectives
Bridging the gap between the Physics in school at 10+2 level and UG level engineering
courses.
To identify the importance of the optical phenomenon. interference, diffraction and
polarization related to its Engineering applications
To explain the significant concepts of dielectric and magnetic materials that leads to potential
applications in the emerging micro devices.
Enlightenment of the concepts of Quantum Mechanics and to provide fundamentals of de
Broglie matter waves, quantum mechanical wave equation and its application, the importance
of free electron theory for metals.
To Understand the Physics of Semiconductors and their working mechanism, Concept
utilization of transport phenomenon of charge carriers in semiconductors.
Course Outcomes
1. Explain the need of coherent sources and the conditions for sustained interference (L2).
Identify the applications of interference in engineering (L3). Analyze the differences between
interference and diffraction with applications (L4). Illustrate the concept of polarization of light
and its applications (L2).
2. Classify various crystal systems (L2). Identify different planes in the crystal structure (L3).
Analyze -ray diffractometer (L4).
3. Explain the concept of dielectric constant and polarization in dielectric materials (L2).
Summarize various types of polarization of dielectrics (L2). Interpret Lorentz field and
Claussius-Mosotti relation in dielectrics (L2). Classify the magnetic materials based on
susceptibility and their temperature dependence (L2).
4. Describe the dual nature of matter (L1). Explain the significance of wave function (L2).
Identify -
dimensional infinite potential well (L3). Identify the role of classical and quantum free electron
theory in the study of electrical conductivity (L3).
5. Classify the crystalline solids (L2). Outline the properties of charge carriers
insemiconductors(L2). Identify the type of semiconductor using Hall effect (L2). Apply the
concept of effective mass of electron (L3).
Unit 1
WAVE OPTICS Interference: Introduction - Principle of superposition Interference of light -
Interference in thin films (Reflection Geometry) & applications - Colors in thin films-
Rings- Determination of wavelength and refractive index.
Diffraction: Introduction - Fresnel and Fraunhofer diffractions - Fraunhofer diffraction due to
single slit, double slit & Diffraction Grating (Qualitative).
Polarization: Introduction -Types of polarization - Polarization by reflection, and Double
refraction - -Half wave and Quarter wave plates.
Unit Outcomes
The students will be able to
Explain the need of coherent sources and the conditions for sustained interference (L2)
Identify engineering applications of interference (L3)
Unit 3
DIELECTRIC AND MAGNETIC MATERIALS Dielectric Materials: Introduction -
Dielectric polarization - Dielectric polarizability, Susceptibility, Dielectric constant and
Displacement Vector - Types of polarizations- Electronic (Quantitative), Ionic (Quantitative) and
Orientation polarizations (Qualitative) - Lorentz internal field - Clausius-Mossotti equation.
Magnetic Materials: Introduction - Magnetic dipole moment - Magnetization-Magnetic
susceptibility and permeability - Classification of magnetic materials: Dia, Para, Ferro, Antiferro &
Ferri magnetic materials - Domain concept for Ferromagnetism (Qualitative) - Hysteresis - soft and
hard magnetic materials.
Unit Outcomes
The students will be able to
Explain the concept of dielectric constant and polarization in dielectric materials (L2)
Summarize various types of polarization of dielectrics (L2)
Interpret Lorentz field and Claussius- Mosotti relation in dielectrics(L2)
Classify the magnetic materials based on susceptibility and their temperature
dependence(L2)
Unit 4
Qantum Mechanics and Free electron theory Quantum Mechanics: Dual nature of matter
Significance and properties of wave function
time independent and dependent wave equations Particle in a one-dimensional infinite potential
well.
Free Electron Theory: Classical free electron theory (Qualitative with discussion of merits and
demerits) Quantum free electron theory electrical conductivity based on quantum free electron
theory - Fermi-Dirac distribution and its temperature dependence.
Unit Outcomes
The students will be able to
Explain the concept of dual nature of matter (L2)
Understand the significance of wave function (L2)
Interpret the concepts of classical and quantum free electron theories (L2)
Text Books
1. - M. N. Avadhanulu, P.G.Kshirsagar & TVS
ArunMurthy, S.Chand Publications, 11th Edition 2019.
2. - D. K. Bhattacharya and Poonam Tandon, Oxford press (2015).
3. - P. K. Palanisamy SciTech publications.
Reference Books
1. - Halliday, Resnick and Walker, John Wiley &Sons.
2. - M.R. Srinivasan, New Age international publishers (2009).
3. - Shatendra Sharma, Jyotsna Sharma, Pearson Education, 2018.
4. - Sanjay D. Jain, D. Sahasrabudhe and Girish, University Press.
5. - A. Donald, Neamen, Mc GrawHill.
6. - B.K. Pandey and S. Chaturvedi, Cengage Learning
7. A.J.Dekker ,Pan Macmillan publishers
8. - Charles Kittel ,Wiley
Course Objectives
To provide the knowledge of basic data structures and their implementations.
To understand importance of data structures in context of writing efficient programs.
To develop skills to apply appropriate data structures in problem solving.
Course Outcomes
On completion of this course, the student will be able to:
1. Compute the time and space complexities and calibrate the performance of a given algorithm.
2. Compare the performances of various Searching and Sorting techniques.
3. Demonstrate the advantages of dynamic memory allocation via linked lists.
4. Illustrate the applications of Stacks and Queues.
5. Implement the basic operations, search and traversals on Trees and Graphs.
Unit I
Introduction: Basic Concepts of Data Structures; Notations of Time & Space Complexity:
Performance Analysis of algorithms: Iterative & Recursive Algorithms; Asymptotic Notations (O,
, o, ).
Unit II
Searching: Linear Search, Binary Search: Algorithm & Analysis;
Hashing: Hash functions, Collision Resolution techniques;
Sorting: Methodology & Performance Analysis: Selection, Bubble, Insertion, Quick, Merge, Heap
Sort.
Unit III
Single Linked List: Comparison with Arrays; Efficient Operations: Creation, Insertion, Deletion,
Traversing, Searching;
Doubly and Circular Linked Lists: Efficient Representation Operations: Creation, Insertion,
Deletion, Traversing; Applications: Polynomial expressions.
Unit IV
Stacks: Definition & Efficient operations: Push & Pop; Applications of Stacks: Conversion &
Evaluation of expressions.
Queues: Types of Queues: Simple Queue; Circular Queue: Efficient Operations on Queues;
Implementation of Stack and Queue using Linked Lists.
Unit V
Trees: Basic Terminology; Binary Tree Traversals; Binary Search Tree Operations;
Graph: Basic Terminologies and Representations; Traversal algorithms: BFS, D
Algorithm.
Text Books
Refrerence Links:
1. https://www.tutorialspoint.com C programming C Home
2. https://www.programiz.com/c-programming
Course Objectives
To introduce the basic knowledge of electric circuits
To analyze AC circuits.
To provide knowledge on Magnetic circuits.
To understand the working, characteristics of PN Junction diode, Zener diode
To explain the working, characteristics of transistor (BJT) in different configurations, JFET
and MOSFET.
Course Outcomes
1. Able to summarize different electrical circuits.
2. Able to outline the basics of AC circuits.
3. Able to examine DC Generator & DC Motor.
4. Able Describe the working principle of PN Junction diode, Zener diode
5. Able to Describe the working and behavior of transistor (BJT) in different configurations,
JFET and MOSFET.
Unit 1
Introduction to Electric Circuits Basic definitions, Electrical circuit elements (R, L and C),
Voltage and current sources Independent and , Series & Parallel
problems.
Unit 2
AC Circuits Representation of sinusoidal waveforms, peak and rms values, phasor representation,
Analysis of single-phase ac circuits consisting of R, L, C, RL, RC, RLC combinations (series
only), real power, reactive power, apparent power, power factor, simple problems.
Unit 3
DC Machines DC Generator Generator-Principle of Operation, Construction, EMF equation,
Classification, O.C.C, internal and externalcharacteristics of shunt generator, Applications.
DC Motor Motor-principle of operation, Torque equation, Classification Speed Control
Methods, Operation of 3 pointstarter, Applications.
Unit 4
Diode Characteristics Formation of PN junction diode, V-I Characteristics of Diode, Diode as a
switch, Zener Diode Characteristics, Zener Diode as Voltage Regulator.
Unit 5
Transistor Characteristics: Bipolar Junction Transistors (BJT) - input & output Characteristics of
transistor in CB, CE, CC configurations, Relationship between effect transistors
(FET) -Characteristics of JFET, MOSFET (Enhancement and depletion)
Text Books:
1. Principles of Electrical and Electronics Engineering by V.K.Mehta, S.Chand& Co.
2. Integrated Electronics Jacob Millman, Chritos C. Halkies, Tata Mc-Graw Hill,2009.
Reference Books:
1. Basic Electrical Engineering Dr.K.B.MadhuSahuscitech publications (india) pvt.ltd.
2. Electronic Devices and Circuits R.L. Boylestad and Louis Nashelsky, Pearson/Prentice Hall,
9thEdition,2006.
3. D. P. Kothari and I. J. Electrical McGraw Hill,2010.
Course Objectives
To enable the students with various concepts like dimensioning, conventions and standards
related to Engineering Drawing
To impart knowledge on the projection of points, lines and plane surfaces
To improve the visualization skills for better understanding of projection of solids
To make the students understand the viewing perception of a solid object in Isometric and
Perspective projections.
Course Outcomes
On completion of course, student should be able to
1. To draw general constructions and conic sections
2. To draw the projection of points and lines with respect to HP & VP
3. To project and draw straight lines, and project plane surfaces with respective to one
reference plane
4. Develop the projections for a simple solids and their inclinations with respect to one
reference plane.
5. Convert orthographic views into isometric projections and vice-versa.
List of Exercises:
Geometrical Constructions
Drawing Instruments and their uses, Types of Lines and Dimensioning, Line bisecting, Angle
bisecting, Line divided into equal number of parts, Construction of Regular Polygons (Pentagon
and Hexagon).
Construction of Conics: General method, Oblong method and Concentric circles method.
Simple Projections
Introduction to Orthographic Projections (First Angle Projection only).
Projections of Points: A point situated in I,II,III & IV quadrants.
Projections of Straight Lines: Line parallel to one or both the of the planes, Line contained by one
or both the planes, Line perpendicular to one of the planes, Line inclined one plane and parallel to
other.
Projections of Planes: Types of planes, Traces of planes, planes parallel to one of the planes and
plane inclined to one reference plane.
Projections of Solids
Polyhedra: Types of Solids, Projections of Solids in simple positions, Projections of Solids axis
inclined to the V.P. and parallel to the H.P. Projections of Solids axis inclined to the H.P. and
parallel to the V.P.
Solids of Revolution: Projections of Solids axis inclined to the V.P. and parallel to the H.P.
Projections of Solids axis inclined to the H.P. and parallel to the V.P.
Orthographic-Isometric Projections
Conversion of pictorial view (Isometric views) into orthographic views.
Isometric Projections: Isometric axes, lines & planes. Isometric scale, Isometric drawing, Isometric
drawing of plane figures, prisms and pyramids. Conversion of orthographic views into Isometric
views.
Reference Books:
1. Engineering Drawing and Graphics, 2nd ed., K. Venugopal, New Age International Pub.
2. Fundamentals of Engineering Drawing, 11th ed., Luzadder, J. Warren, D.M. Jon, Prentice Hall
India Pub.
List of Experiments
1. Determination of radius of curvature of a given Plano-convex lens by rings.
2. Determination of wavelengths of different spectral lines in mercury spectrum
usingdiffraction grating in normal incidence configuration.
3. Determination of width of a slit using diffraction phenomenon.
4. Determination of wavelength of Laser light using diffraction grating.
5. Estimation of constant using photo cell.
6. To study V-I characteristics of a PN junction diode in forward and reverse biasing conditions.
7. Magnetic field along the axis of a current carrying circular coil by Stewart
Method.
8. Determination of Hall voltage and Hall coefficient of a given semiconductor using Halleffect.
9. Determination of temperature coefficients of a thermistor.
10. Determination of acceleration due to gravity and radius of Gyration by using a compound
pendulum.
11. Determination of rigidity modulus of the material of the given wire using Torsional
pendulum.
12. Sonometer: Verification of laws of stretched string.
13. Determination of Frequency of electrically maintained tuning fork by experiment.
14. Determination of energy bandgap of a given semiconductor
15. Determination of thickness of a thin object using wedge shaped film.
16. Determination of crystal structure and lattice parameter of a given crystal using powder
diffraction data.
17. -uniform bending.
18. Determination of dielectric constant using resonance method.
Note: Any TEN of the listed experiments are to be conducted. Out of which any TWOexperiments
may be conducted in virtual mode.
References Books
A Textbook of Practical Physics - S. Balasubramanian, M.N. Srinivasan, S. Chand
Publishers, 2017.
Reference Links
www.vlab.co.in
https://phet.colorado.edu/en/simulations/filter?subjects=physics&type=html,prototype
Course Objectives
Develop skills to design and analyze simple linear and non linear data structures. It strengthen the
ability to the students to identify and apply the suitable data structure for the given real world
problem. It enables them to gain knowledge in practical applications of data structures
Course Outcomes
1. Develop Programs as recursive solutions for common searching and sorting algorithms.
2. Illustrate the use of dynamic memory allocation through linked list operations.
3. Design programs for linear data structures such as Stacks, and Queues.
4. Develop Programs for implementing various operations on Binary Trees and Binary Search
Trees.
5. Apply the fundamental graph algorithms to solve problems using Depth-First and Breadth-
First Search.
List of Experiments
1.
b) Write a C program to reverse the digits of a number using recursive function.
c) Write a C program to solve the Towers of Hanoi problem using recursive function.
2. a) Design & Develop a C program to perform linear search for a key value in a given list.
b) Design & Develop a C program to perform Binary search for a key value in a given list.
3. Given a File of N employee records with a set K of Keys(6-digit) which uniquely determine the
records in file F. Assume that file F is maintained in memory by a Hash Table(HT) of m
memory locations with L as the set of memory addresses (2-digit) of locations in HT. Let the
keys in K and addresses in L are Integers.
Design and develop a Program in C that uses Hash function H: K L as H(K)=K mod m
(remainder method), and implement hashing technique to map a given key K to the address
space L. Resolve the collision (if any) using linear probing.
4. a) Design, Develop and Implement a C program that implement Selection Sort to sort a given
list of integers.
b) Design, Develop and Implement a C program that implement Bubble Sort to sort a given list
of integers.
5. a) Design, Develop and Implement C program that implement Quick Sort to sort a given list of
integers.
b) Design, Develop and Implement C program that implement Heap Sort to sort a given list of
integers.
6. Design, Develop and Implement a menu driven Program in C to represent polynomials using a
single linked list and implement functions Polynomials. Each Node: [Coefficient, Exponent,
Next]
7. Design, Develop and Implement a menu driven Program in C for the following operations on
STACK of Integers (Array Implementation of Stack with maximum size MAX)
a. Push an Element onto Stack.
b. Pop an Element from Stack.
c. Demonstrate how Stack can be used to check Palindrome.
d. Display the status (No. of elements, Empty/Full/not) of Stack.
e. Exit
Support the program with appropriate functions for each of the above operations
8. Design, Develop and Implement a Program in C for converting an Infix Expression to Postfix
Expression. Program should support for both parenthesized and free parenthesized expressions
with the operators: +, -, *, /, %(Remainder), ^(Power) and alphanumeric operands.
9. Design, Develop and Implement a menu driven Program in C for the following operations on
QUEUE of Characters (Array Implementation of Queue with maximum size MAX)
a. Insert an Element into QUEUE
b. Delete an Element from QUEUE
c. Display the status (No. of elements, Empty/Full/not) of QUEUE
d. Exit
Support the program with appropriate functions for each of the above operations
10. a) Design, Develop and Implement a C program to implement Binary tree traversals using
iterative functions.
b) Design, Develop and Implement a C program to implement Binary tree traversals using
recursive functions.
11. Design, Develop and Implement a menu driven Program in C for the following operations on
Binary Search Tree (BST) of Integers
a. Create a BST of N Integers: 89, 38, 24, 40, 95, 76, 57, 11, 59, 18
b. Traverse the BST in In-order, Pre-order and Post-Order
c. Search the BST for a given element (Key) and report the appropriate message
e. Exit
12. Design & Develop a Program in C for the following operations on Graph (G) of Cities
a. Create a Graph of N cities using Adjacency Matrix.
b. Print all the nodes reachable from a given starting node in a digraph using DFS or BFS
method.
Text Books:
1. Mark Allen Weiss , Fourth Edition , Pearson.
2. Fundamentals of Data Structures and
Computer Science Press.
ReferenceBooks:
1. Michel T. Goodrich, Roberto Tamassia, David
Mount, 2nd Edition, John Wiley & Sons, Inc.
2. Second Edition, Debasis Samanta, PHI, 2012, New
Delhi, India.
3. Third
edition, B.A. Forouzan and R.F. Gilberg, 2011, Thomson, New Delhi, India.
Reference Links:
1. https://www.geeksforgeeks.org/data-structures/
Course Outcomes:
Students will be able to
1. Label various types of electrical & electronics components.
2. Demonstrate various basic electrical laws.
3. Determine resistance of the series and parallel connected circuits.
4. Analyze the V-I characteristics of P-N diode.
5. Analyze the Transistor characteristics.
List of Experiments:
1. Study of electrical components.
2. To verify
3. To verify current law
4. To voltage law.
5. To verify the total resistance of the series and parallel connected circuits.
6. Study of electronics components.
7. PN Junction diode forward and reverse bias characteristics
8. Zener diode characteristics.
9. Transistor CB characteristics (Input and Output)
10. Transistor CE characteristics (Input and Output)
Additional Experiments:
11. Half wave rectifier
12. To find voltage current relationship for series RL circuit and determine power & power
factor.
Course Objective
The objective of introducing this course is to impart discipline, character, fraternity,
teamwork, social consciousness among the students and engaging them in selfless service.
Course Outcome
After completion of the course the students will be able to
1. Understand the importance of discipline, character and service motto.
2. Solve some societal issues by applying acquired knowledge, facts, and techniques.
3. Explore human relationships by analyzing social problems.
4. Determine to extend their help for the fellow beings and downtrodden people.
5. Develop leadership skills and civic responsibilities.
Unit 1 Orientation
General Orientation on NSS/NCC/ Scouts & Guides/Community Service activities, career
guidance.
Activities:
i) Conducting ice breaking sessions-expectations from the course-knowing personal talents
and skills
ii) Conducting orientations programs for the students future plans-activities-releasing road
map etc.
iii) Displaying success stories-motivational biopics- award winning movies on societal issues
etc.
iv) Conducting talent show in singing patriotic songs-paintings- any other contribution.
1. Nirmalya Kumar Sinha & Surajit Majumder, A Text Book of National Service Scheme
2. Vol;.I, Vidya Kutir Publication, 2021 ( ISBN 978-81-952368-8-6)
3. Red Book - National Cadet Corps Standing Instructions Vol I & II, Directorate General of
NCC, Ministry of Defence, New Delhi
4.
Hill, New York 4/e 2008
5.
General Guidelines:
1. Institutes must assign slots in the Timetable for the activities.
2. Institutes are required to provide instructor to mentor the students.
Evaluation Guidelines:
Evaluated for a total of 100 marks.
A student can select 6 activities of his/her choice with a minimum of 01 activity per unit.
Each activity shall be evaluated by the concerned teacher for 15 marks, totalling to 90
marks.
A student shall be evaluated by the concerned teacher for 10 marks by conducting viva
voce on the subject.
Course Outcomes:
1. Upon completion of this course students can aware of ethical behavior in the work place
2. To shapes the students by the end of this curriculum being harmony himself
3. To understand the human relationship and values
4. To understand the Nature and its existence of connectivity
5. Learn the importance of Human values and universal order
UNIT - I:
Introduction: Understanding the need, basic guidelines, content and process for Value
Education- Self Exploration - what is it?- Continuous Happiness and Prosperity Morals, Values
and Ethics – Integrity – Work Ethics – Service Learning- Respect for others- Caring – Sharing
– Honesty –Courage – Value time – Co-operation – Commitment Self-confidence – Spirituality.
UNIT - II:
Understanding Harmony in the Human Being: Harmony in Myself! : Understanding human
being as a co-existence of the sentient 'I' and the material 'Body'- Understanding the needs of Self
('I') and 'Body'- Understanding the Body as an instrument of 'I' (I being the doer, seer and enjoyer)
UNIT - III:
Understanding Harmony in the Family and Society: Harmony in Human-Human Relationship-
Understanding harmony in the Family- the basic unit of human interaction Understanding values
in human-human relationship- Trust (Vishwas) and Respect (Samman) as the foundational values
of relationship- Understanding the meaning of Vishwas; Difference between intention and
competence -Understanding the meaning of Samman, Difference between respect and
differentiation; the other salient values in relationship
UNIT - IV:
Understanding Harmony in the Nature and Existence: Whole existence as Co-existence-
Understanding the harmony in the Nature- Interconnectedness and mutual fulfillment among the
four orders of nature- recyclability and self-regulation in nature- Holistic perception of
harmony at all levels of existence
Reference Books:
1. R. R. Gaur, R Sangal, G P Bagaria, 2009, A Foundation Course in Human Values and
Professional Ethics
2. “Professional Ethics and Human Values” by Prof. D.R. Kiran.
3. “Engineering Ethics & Human Values” by M.Govindarajan, S.Natarajan and
V.S.SenthilKumar-PHI Learning Pvt. Ltd-2009.
4. A N Tripathy, 2003, Human Values, New Age International Publishers
5. R. Subramanian, Professional Ethics includes Human Values, Oxford Univ. Press
6. M Govindrajan, S Natrajan& V. S Senthilkumar, Engineering Ethics ( including Humna
Values), Eastern Economy Edition, Prentice Hall of India Ltd.
Course Objectives:
Python programming course aims to empower students with the knowledge, skills, and practical
experience essential for becoming proficient Python programmers. By mastering Python
fundamentals, exploring its rich ecosystem, and learning software development best practices,
students develop problem-solving abilities and gain the confidence to tackle real- world
challenges.
Course Outcomes:
At the end of the course, the student will be able to:
1. Examine Python syntax and semantics and be fluent in the use of Python flow control and
functions.
2. Demonstrate proficiency in handling Strings and File Systems.
3. Create, run and manipulate Python Programs using core data structures like
Lists, Dictionaries and use Regular Expressions.
4. Implement file handling functions and user defined functions in python.
5. Interpret the concepts of Object-Oriented Programming as used in Python and
Regular Expressions.
UNIT - I:
Introduction to Python: History, Features, Installing Python, Running Python, Operators,
Statements and Expressions.
Control Structures: Conditional Statements, Loops
UNIT - II:
Data Types: Mutable vs immutable data type, Numbers - Introduction to Numbers, Integers,
Floating Point Real Numbers, Complex Numbers, Operators, Built-in Functions, Related Modules.
Sequences - Strings, Lists, and Tuples, Dictionaries and Set Types
UNIT - III:
Functions: Definitions, Declaration, Parameter passing, calling functions
File Handling: creating a file, opening a file, I/O with file (read, write, append), closing a file
UNIT - IV:
Modules: Modules and Files, Namespaces, Importing Modules, Importing Module Attributes,
Module Built-in Functions, Packages, Other Features of Modules.
UNIT - V:
Classes in Python: Principles of Object Orientation, Creating Classes, Instance Methods, Special
Methods, class Variables and Inheritance, Data base connectivity.
Regular Expressions: Introduction, Special Symbols and Characters, Res and Python
Textbooks:
1. Wesley J .C hun "Core Python Applications Programming", 3rd Edition, 2012, PrenticeHall.
2. Brian jones, David Beazley “Python Cookbook ”, 3rd Edition.
Reference Books:
1. Mark Lutz "Programming Python, 4th Edition" O'Reilly Media.
2. Think Python, Allen Downey, Green Tea Press
Reference Links:
1. https://docs.python.org/3/tutorial/index.html
2. https://pythonprogramminglanguage.com
Course Objectives:
Databases form the backbone of all major applications today – tightly or loosely coupled,
intranet or internet based, financial, social, administrative, and so on. Structured Database
Management Systems (DBMS) based on relational and other models have long formed the basis
for such databases. Consequently, Oracle, Microsoft SQL Server, Sybase etc. have emerged as
leading commercial systems while MySQL, PostgreSQL etc. lead in open source and free
domain.
Course Outcomes:
At the end of this course, the students will be able to:
1. Describe the fundamental elements of relational database management systems
and SQL.
2. Explain the basic concepts of relational data model, relational database design,
relational algebra, constraints and functions of SQL.
3. Design ER-models to represent simple database application scenarios and formulate
SQL queries on data
4. Improve the database design by normalization and applies transaction management concepts.
5. Familiar with basic database storage structures and access techniques: file and
page organizations, indexing methods including B tree, and hashing
UNIT - I:
Introduction: Database Systems versus file Systems, Database System Applications,
Purpose of Database Systems, View of Data, Database Design, Database Engine,
Database and Application Architecture, Database Users and Administrators.
Overview of the SQL Query Language, Data Types, Data Definition Language,
Data Manipulation Language.
UNIT - II:
Relational Model: Structure of Relational Database, Database Schema, Keys, Schema
Diagrams.
Integrity Constraints, Set Operations, Groupby and Having, Aggregate Functions, Null
values
UNIT - III:
Database Design Using the E-R Model: Overview of the Design Process, The Entity-
Relationship Model, Complex Attributes, Mapping Cardinalities.
Nested Queries, Join Operations, Views, Data Control Language, Transaction Control
Language, Triggers
Case Study: Reducing E-R Diagrams to Relational Schemas
UNIT - IV:
Schema refinement and Normal forms: Problems Caused by Redundancy, Decompositions,
Problem related to Decomposition, Functional Dependencies, Reasoning about FDS, FIRST,
SECOND, THIRD Normal Forms, BCNF, Fourth, Fifth Normal Forms, Properties of
Decompositions: Lossless join Decomposition, Dependency preserving Decomposition, Schema
refinement in Database Design.
UNIT - V:
Transaction Concept; ACID Properties, Transaction State, Concurrent Executions,
Serializability, Recoverability, Lock–Based Protocols: Locks, Granting of locks, 2PL,
implementation of locking, Timestamp Based Protocols.
Data on External Storage: File Organization and Indexing: Cluster Indexes, Primary and
Secondary Indexes; Index Data Structures, Hash Based Indexing, Tree based Indexing,
Comparison of File Organizations, B+ Trees, A Dynamic Index Structure.
Textbooks:
1. Silberschatz, A., Korth, H. F., and Sudarshan, S. Database System Concepts,McGraw-Hill,
7th Edition. 2019.
2. Raghurama Krishnan, Johannes Gehrke: Database Management Systems.TATA
McGrawHill , 3rd Edition
Reference Books:
1. Silberschatz, Korth :Database System Concepts. McGraw hill,5th Edition – 2006.
2. Peter Rob ,Carlos Coronel: Data base Systems design Implementation
andManagement. Cengage Learning, 7th Edition
Reference Links:
https://archive.nptel.ac.in/courses/106/105/106105175/
Course Objectives:
• To provide insight about networks, topologies, and the key concepts.
• To gain comprehensive knowledge about the layered communication architectures
(OSI and TCP/IP) and its functionalities.
• To understand the principles, key protocols, design issues, and significance of each
layers in ISO and TCP/IP.
• To know the basic concepts of network services and various network applications.
Course Outcomes:
By the end of the course, the student will be able to
1. Demonstrate different network models for networking links OSI, TCP/IP, B-ISDN, N-BISDN
and get knowledge about various communication techniques, methods and protocol standards.
2. Discuss different transmission media and different switching networks.
3. Analyses data link layer services, functions and protocols like HDLC and PPP.
4. Compare and Classify medium access control protocols like ALOHA, CSMA, CSMA/CD,
CSMA/CA, Polling, Token passing, FDMA, TDMA, CDMA protocols
5. Determine application layer services and client server protocols working with the client server
paradigms like WWW, HTTP, FTP, e-mail and SNMP etc.
UNIT - I:
Introduction: Network Hardware, Network Software; Reference Models: OSI Reference Model,
TCP/IP Reference Model, Comparison between OSI and TCP/IP Models; Example Networks:
The ARPANET, Internet. Addressing: Physical Address, Logical Address, Port Address, Specific
Address.
UNIT - II:
Data Link Layer: Data Link Layer Design Issues: Services Provided to Network Layer, Framing,
Error Control and Flow Control; Error Detection and Correction: Error Correcting Codes, Error
Detecting Codes; Elementary Data Link Protocols, Sliding Window Protocols: One-Bit Sliding
Window Protocol, Protocol Using Go Back N and Selective Repeat. The Medium Access Control
Sub layer: Channel Allocation Problem: Static Channel Allocation, Dynamic Channel Allocation;
Multiple Access Protocol: ALOHA, Carrier Sense Multiple Access Protocols, Collision-Free
Protocols, Limited Contention Protocol.
UNIT - III:
The Network Layer: Network Layer Design Issues, Implementation of Connection Less Service,
Implementation of Connection Oriented Service, Routing Algorithms: Shortest Path Routing,
Flooding, Distance Vector Routing, Link State Routing, Hierarchical Routing, Broadcast Routing,
Multicast Routing, Congestion Control Algorithms: General Principles of Congestion Control,
Congestion Prevention Policies. Protocols-The IP Protocol, IP Address- IPV4, IPV6, utilization
of Cisco Packet Tracer (CPT) tool
UNIT - V:
The Application Layer: Services of application Layer ,Architecture ,DNS- Domain Name
System, Electronic Mail: Architecture and Services, The User Agent, Message Format, Message
Transfer, The World Wide Web: Architectural Overview, Static Web Document, Dynamic Web
Document; Hyper Text Transfer Protocol (HTTP).
Text Books:
1. Computer Networks, Andrew S Tanenbaum, Fifth Edition. Pearson Education/PHI
2. Data Communications and Networks, Behrouz A. Forouzan, Fifth Edition TMH.
References Books:
1. Data Communications and Networks- Achut S Godbole, AtulKahate
2. Computer Networks, Mayank Dave, CENGAGE
Course Objectives:
The course is designed with the objective to:
• To acquaint the students with the fundamental principles of two-valued logic and application
of knowledge to understand digital electronics circuits
• To understand the concepts of combinational logic circuits and sequential circuits.
• To impart basic concepts of computer architecture and or generation.
• To study the hierarchical memory system including cache memories and virtual memory.
• To study the different ways of communicating with I/O devices and standard I/O
interfaces.
Course Outcomes:
After the successful completion of this course, students will be able to
1. Distinguish different number systems
2. Construct various types of adders using combinational circuits
3. Distinguish different sequential logic circuits
4. Understand the theory and architecture of computer and various micro-operations
5. Explain memory hierarchy and memory and I/O operations.
UNIT - I:
Number systems: Binary, Octal, Decimal, Hexadecimal Number Systems, Base conversions,
r’s Complement and (r-1)‟s Complement. Binary number subtraction of unsigned numbers.
Logic Gate &Boolean algebra:
Digital Signals, Digital Circuits, Logic Gates, Introduction to Boolean algebra, Axioms and Laws of
Boolean Algebra, Minimization of logic equations using Boolean theorems
UNIT - II:
Gate-Level Minimization using K-Map:
Canonical and Standard Forms, Karnaugh Map Method (K-Map): Minimization of Boolean
Functions up to four variables, POS and SOP Simplifications with don’t care conditions using K
map.
Combinational circuits:
Introduction to combinational logic circuits, Binary adder and subtractor, 4-bit binary adder,
carry Look ahead Adder, Applications of full adders
UNIT - III:
Sequential Circuits Fundamentals:
Basic Architectural Distinctions between Combinational and Sequential circuits, SR Latch,
Flip Flops: SR, JK, D and T Type Flip Flops, Excitation Table of all Flip Flops, Conversion
from one type of Flip-Flop to another.
Registers and Counters:
Design of Bi-directional shift register, universal shift register, Design of Ripple Counters, and
synchronous Counters.
UNIT - IV:
Basic Organization of computer: Computer organization, computer architecture, difference
between computer architecture and computer organization. Machine instructions and
addressing modes, ALU, data path and control unit. Instruction pipelining. Register Transfer
and Micro operation: Register transfer language, register transfer, bus and memory transfer,
arithmetic micro-operations, logic micro-operations, shift micro-operations and arithmetic logic
shift unit.
UNIT - V:
Memory organization: Memory hierarchy, Primary memory, Auxiliary memory,
Associative memory, Cache memory, mapping functions, Virtual memory
Input-output organization:
I/O interface, I/O Bus and interface modules, I/O versus Memory Bus, isolated versus memory
mapped I/O. Asynchronous data transfer, Modes of Transfer: Programmed I/O, Interrupt driven
I/O.
Text Books:
1. Digital Design ,4/e, M.Morris Mano, Michael D Ciletti, PEA
2. Computer System Architecture– M.Moris Mano, PHI/Pearson,Revised3rd edition.
Reference Books:
1. Switching and Finite Automata Theory,3/e,Kohavi, Jha, Cambridge.
2. Digital Logic Design, Leach, Malvino, Saha,TMH
3. Computer Architecture and Organization– John P. Hayes, McGraw Hill International
editions.
4. Switching theory and logic Design – A Anand Kumar 3rd Addition
Reference Links:
1. https://archive.nptel.ac.in/courses/106/105/106105163/
2. https://nptel.ac.in/courses/108/105/108105132/
Exercise Questions: 1
Ex 1: Write the python programs to calculate the following
a) Find the factorial of given number
b) To print all the prime numbers below n. n value should be taken from
the user at the time of execution
Ex 2: Write the python programs to perform the following
a) To check given number Armstrong or not.
b) To check Strong number.
c) To print Fibonacci series.
Exercise Questions: 2
Ex 3: Write the python programs to calculate the following
a) Write a Python program to get a string from a given string where all
occurrences of its first char have been changed to '$', except the first char
itself.
b) Write a Python program to remove the characters which have
odd index values of a given string.
c) To remove punctuations from the string
d) Write a Python program to count repeated characters in a string
e) Write a Python program to count Uppercase, Lowercase, special
character and numeric values in a given string
Ex 4: Write the python programs to perform the following
a) Implement a STACK program by using PYTHON.
b) Implement a QUEUE program by using PYTHON.
c) Implement a Python Program for creating a dictionary and
display its keys alphabetically.
d) Write a Python program to convert a list into a nested
dictionary of keys.
e) Write a python program to remove duplicates from the list
Exercise Questions: 4
Ex 7: Write the python programs to calculate the following
a) Write a python program to define a module to find Fibonacci
Numbers and import the module to another program.
b) Write a python program to define a module and import a
specific function in that module to another program.
Exercise Questions: 5
Ex 8: Write the python programs to calculate the following
a) Define a class, which have a class parameter and have a same
instance parameter.
b) Define a class named 'Shape' and its subclass 'Square'. The Square
class has an 'init' function which takes a given length as an
argument. Both classes have an area function which can print
the area of the shape, where Shape's area is 0 by default.
Ex 9: Write the python programs to calculate the following
a) implement Re.findall, re.split, re.sub, re.subn, re.search and Match.group.
b) Write a Python program to check the validity of a password
(input from users).
Validation :
• At least 1 letter between [a-z] and 1 letter between [A-Z].
• At least 1 number between [0-9].
• At least 1 character from [$#@].
• Minimum length 6 characters.
• Maximum length 12 characters.
Text Books
1. Wesley J .C hun "Core Python Applications Programming", 3rd Edition, 2012,
Prentice Hall.
2. Brian jones, David Beazley “Python Cookbook ”, 3rd Edition.
References Books
1. Mark Lutz "Programming Python, 4th Edition" O'Reilly Media.
2. Think Python, Allen Downey, Green Tea Press
Reference Links:
1. https://docs.python.org/3/tutorial/index.html
2. https://pythonprogramminglanguage.com
Course Outcomes:
1. Ability to design and implement a database schema for given problem.
2. Ability to formulate queries using SQL commands.
3. Apply the normalization techniques for development of application software to realistic problems.
4. Apply the PL/SQL for development of applications
5. Design and implement a project with support of databases
LIST OF EXPERIMENTS
Reference Links:
https://archive.nptel.ac.in/courses/106/105/106105175/
Course Objectives:
Learn basic concepts of computer networking and acquire practical notions of protocols
with the emphasis on TCP/IP. A lab provides a practical approach to Ethernet/Internet
networking networks are assembled, and experiments are made to understand the layered
architecture and how do some important protocols work.
Course Outcomes:
By the end of the course student will be able to
1. Know how reliable data communication is achieved through data link layer.
2. Suggest appropriate routing algorithm for the network.
3. Provide internet connection to the system and its installation.
4. Work on various network management tools
5. Analyze and implement the features and operations of various algorithms and protocols.
List of Experiments:
1. Study of network Devices in Detail.
2. Implement data Link layer Framing Methods:
a) Character Stuffing Method b) Bit Stuffing method.
3. Implement a data link framing method for even and odd parity.
4. Implement a simple data link layer that performs the flow control using
the sliding window protocol.
5. Implement the CRC encoding mechanism in data link layer.
6. Write a Program for Dijkstra’s algorithm to compute the shortest path
through a graph?
7. Configure a network using Distance Vector Routing Protocol?
8. Configure a network using Link State Vector Routing Protocol?
9. Write a program for congestion control using leaky bucket algorithm?
10. Write a program for congestion control using token bucket algorithm?
11. Implementation of IP address masking.
Text Books:
1. Computer Networks, Andrew S Tanenbaum, Fifth Edition. Pearson Education/PHI
2. Data Communications and Networks, Behrouz A. Forouzan, Fifth Edition TMH.
References Books:
1. Data Communications and Networks- Achut S Godbole, AtulKahate
2. Computer Networks, Mayank Dave, CENGAGE
STATISTICAL METHODS
(Common to CSE, CSM, CSD & IT)
Course Outcomes:
On completion of this course, students will be able to
1. Obtain the probability of a random variable using Binomial, Poison and Normal distribution.
2. Obtain sampling distribution of means for the given data also obtain the probability of sample
mean using central limit theorem and to estimate the parameters using point estimation and
interval estimation.
3. Perform the large sample tests – test of means and proportions.
4. Perform the small sample tests - t- test, F-test, Chi-Square and analyze ANOVA for the given
data.
5. Determine correlation and regression for given data.
Reference Books:
1. Shron L. Myers, Keying Ye, Ronald E Walpole, Probability and Statistics Engineers and the
Scientists,8th Edition, Pearson 2007.
2. William Menden Hall, Robert J. Bever and Barbara Bever, Introduction to probability and
statistics, Cengage learning.2009
3. Sheldon, M. Rosss, Introduction to probability and statistics Engineers and the Scientists,
4th edition, Academic Foundation,2011
4. Johannes Ledolter and Robert V.Hogg, Applied statistics for Engineers and Physical
Scientists, 3rd Edition, Pearson,2010
5. Erwin Kreyszig, Advanced Engineering Mathematics, 10th Edition, Wiley-India.
Course Objective
The objective of the course is to teach the basic concepts and techniques which form the
object oriented programming paradigm, Well equipped with Java SDK environment to create,
debug and run simple Java programs
Course Outcomes
By the end of this course the student will be able to
1. Knowledge of the structure and model of the Java programming language
2. Explain the concept of class and objects with access control to represent real world
entities
3. Demonstrate the implementation of inheritance by using extends and implements
keywords
4. Illustrate different techniques on creating and accessing packages (fully qualified
name and import statements)
5. Understand the impact of exception handling to avoid abnormal termination of
program using checked and unchecked exceptions and Use multithreading concepts to
develop inter process communication and also design applet Programs.
UNIT - I:
Introduction To Java: Evolution of Java, Java Buzzwords, The Java Virtual Machine, An
overview of Java- Simple Java Program, Naming Conventions in Java, Data types, Variables,
Expressions, Automatic type Conversion, Operators, Control Statements , Arrays, Strings.
UNIT - II:
Classes & Objects: Class fundamentals, Declaring Objects, Initializing the instance variables,
Access Control, Constructors, Methods in Java, Overloading Methods and constructors, Static
Methods, Recursion, final keyword, this keyword, garbage collection, finalize() method
UNIT - III:
Inheritance: Inheritance Basics, Types of Inheritance, The Keyword „super‟, Final with
inheritance. Polymorphism: Method Overriding, Dynamic Method Dispatch, Abstract Classes.
INTERFACES: Interface, Multiple Inheritance using Interface, Abstract Classes vs. Interfaces
UNIT - IV:
Packages: Packages, Different Types of Packages, Access Protection, Importing Packages.
Exception Handling: Exception-handling fundamentals, throw Clause, throws Clause. Types of
Exceptions: Built-in Exception, User Defined Exception.
UNIT - V:
Threads: Java Thread Model, Main Thread, Creating a Thread and Running it, terminating the
Thread, Creating Multiple Threads, Thread Synchronization, and Thread Priorities.
Applets: Applet Basics, Applet Life Cycle, A Simple Applet, HTML applet tag, Applet
Parameters.
Text Books:
1. Herbert Schildt, “Java The complete reference”, 12thEdition, McGraw-Hill, 2022.
2. Timothy budd, “An introduction to object-oriented programming”, 3rdEdition,
Pearson Education, 2009.
Reference Books
1. E.Balaguruswamy, “Programming with Java A Primer”, 5th Edition, Tata McGraw-
Hill, 2017.
2. Y. Daniel Liang, “Introduction to Java programming”, 9thEdition, Pearson education,
2015
Reference Link
1. http://en.wikibooks.org/wiki/Java_Programming - Java Learning Wiki Book
2. http://www.javabeginner.com - Java Beginner Tutorial
FUNDAMENTALS OF DATASCIENCE
Course Objectives:
• To provide a comprehensive knowledge of data science using Python.
• To learn these sential concepts of data analytics and data visualization.
Course Outcomes:
Up on successful completion of the course, the student will be able to:
• Apply principles of NumPy and Pandas to the analysis of data.
• Make use of various file formats in loading and storage of data.
• Identify and apply the need and importance of pre-processing techniques.
• Show the results and present the mina pictorial format.
Unit-I:
Data science: definition, Data fiction, Exploratory Data Analysis, The Data science process,
data scientist role in this process.
NumPyBasics:TheNumPyndarray:AMultidimensionalArrayObject,Creating ndarrays ,Data
Types for ndarrays, Operations between Arrays and Scalars, Basic Indexing and Slicing,
Boolean Indexing, Fancy Indexing, Data Processing Using Arrays, Expressing Conditional
Logic as Array Operations, Methods for Boolean Arrays , Sorting , Unique.
Unit-II:
Getting Started with pandas: Introduction to pandas, Library Architecture, Features,
Applications, Data Structures, Series, Data Frame, Index Objects, Essential Functionality
Reindexing, Dropping entries from an axis, Indexing, selection, and filtering),Sorting and
ranking, Summarizing and Computing Descriptive Statistics, Unique Values, Value Counts,
Handling Missing Data, filtering out missing data.
Unit-III:
Data Loading, Storage, and File Formats: Reading and Writing Data in Text Format, Reading
Text Files in Pieces, Writing Data Out to Text Format, Manually Working with Delimited
Formats, JSON Data.
XML and HTML: Web Scraping, Binary Data Formats, Using HDF5 Format, Reading
Microsoft Excel Files, Interacting with Databases, Storing and Loading Data in Mongo DB.
Unit -IV:
Data Wrangling: Combining and Merging Data Sets, Database style Data Frame Merges,
Merging on Index, Concatenating Along an Axis, Combining Data with Overlap , Reshaping
and Pivoting, Reshaping with Hierarchical Indexing, Data Transformation, Removing
Duplicates, Replacing Values.
Unit-V:
Plotting and Visualization: A Brief matplotlib API Primer, Figures and Subplots, Colors,
Markers, and Line Styles, Ticks, Labels, and Legends, Annotations and Drawing on a Subplot,
Saving Plots to File, Plotting Functions in pandas, Line Plots, Bar Plots, Histograms and
Density Plots, Scatter Plots.
Text Books:
1. WesMcKinney,“PythonforDataAnalysis”,O‟REILLY,ISBN:978-1-449-31979-3,1st
edition, October 2012.
2. Rachel Schutt & O‟neil, “DoingDataScience”,O‟REILLY,ISBN:978-1-449-35865-5,
1st edition, October 2013.
3. SeemaAcharya,SubhashiniChellappan,“BigDataandAnalytics”,Wiley,ISBN:978-
8126579518, 2nd edition, 2019.
,
Reference Books:
1. JoelGrus, “Data Science from Scratch: First Principles with Python”, O‟Reilly Media,
2015
2. MattHarrison,“LearningthePandasLibrary:PythonToolsforDataMunging,Analysis, and
Visualization , O'Reilly, 2016.
L T P C
DATA MINING 3 0 0 3
Course Objectives:
• To understand and implement classical models and algorithms in data warehousing and data
mining.
• To analyse the data, identify the problems, and choose the relevant models and algorithms
to apply.
• To assess the strengths and weaknesses of various methods and algorithms and to analyse
their behavior.
Course Outcomes:
Upon successful completion of the course, the student will be able to:
1. Summarize the architecture of data warehouse
2. Apply different pre-processing methods, Similarity, Dissimilarity measures for any
given raw data.
3. Construct a decision tree and resolve the problem of model overfitting
4. Compare Apriori and FP-growth association rule mining algorithms for frequent item set
generation
5. Apply suitable clustering algorithm for the given data set
UNIT- I:
Data Warehouse and OLAP Technology: An Overview: Data Warehouse, A
Multidimensional Data Model, Data Warehouse Architecture, Data Warehouse
Implementation, From Data Warehousing to Data
Mining.
UNIT- II:
Data Mining: Introduction, What is Data Mining?, Motivating challenges, The origins of Data
Mining, Data Mining Tasks, Types of Data, Data Quality.
Data Pre-processing: Aggregation, Sampling, Dimensionality Reduction, Feature Subset
Selection, Feature creation, Discretization and Binarization, Variable Transformation,
Measures of Similarity and
Dissimilarity.
UNIT –III:
Classification: Basic Concepts, General Approach to solving a classification problem,
Decision Tree, Induction: Working of Decision Tree, building a decision tree, methods for
expressing an attribute test conditions, measures for selecting the best split, Algorithm for
decision tree induction.
Model Overfitting: Due to presence of noise, due to lack of representation samples, evaluating
the performance of classifier: holdout method, random sub sampling, cross-validation,
bootstrap. Bayes Theorem, Naïve Bayes Classifier.
UNIT –IV:
Association Analysis: Basic Concepts and Algorithms: Problem Definition, Frequent Item Set
Generation, Apriori Principle, Apriori Algorithm, Rule Generation, Compact Representation of
Frequent Item sets, FP Growth Algorithm.
UNIT –V:
Cluster Analysis: Basic Concepts and Algorithms: Overview, What Is Cluster Analysis?
Different Types of Clustering, Different Types of Clusters; K-means: The Basic K-means
Algorithm, K-means Additional Issues, Bisecting K-means, Strengths and Weaknesses;
Agglomerative Hierarchical Clustering: Basic Agglomerative Hierarchical Clustering
Algorithm DBSCAN: Traditional Density Center-Based Approach, DBSCAN Algorithm,
Strengths and Weaknesses.
Text Books:
1. Introduction to Data Mining: Pang-Ning Tan & Michael Steinbach, Vipin Kumar,
Fifth Impression, Pearson, 2015.
2. Data Mining concepts and Techniques, 3rd Edition, Jiawei Han, Michel Kamber,
Elsevier, 2011
Reference Books:
1. Data Mining Techniques and Applications: An Introduction, Hongbo Du, Cengage
Learning, 2010
2. Data Mining: Introductoryand Advanced topics: Dunham, First Edition, Pearson, 2020
3. Data Warehousing Data Mining & OLAP, Alex Berson, Stephen Smith, TMH, 2008
4. Data Mining Techniques, Arun K Pujari, Universities Press, 2001
OPERATING SYSTEMS
L T P C
Subject Code: 23CST205 2 0 0 2
Course Objective
• Understand structure and functions of operating systems and its types.
• Learn about Processes, Process operations and scheduling Algorithms.
• Understand the principals of concurrency, Deadlocks and its characteristics.
• Learn various memory management techniques and virtual memory.
• Study about files system and Mass storage Devices.
Course outcomes
1. Explain the various structures of operating system and design scheduling algorithms.
2. Propose solutions for achieving process synchronization and design deadlocks algorithms.
3. Compare and contrast various memory management schemes and about virtual memory.
4. Design and implement file systems, file structure and disk structure.
5. Familiarize with disk structure, disk scheduling and organization of I/O devices.
UNIT- I:
Operating System structures: Overview of Operating System, Operating systems services, Types of
operating systems, System calls, Types of system calls.
Process Management: Process concept, Process scheduling, Operations on processes, Scheduling
criteria, Scheduling algorithms, and their evaluation.
UNIT- II:
Concurrency: Process synchronization, Critical-section problem, Peterson’s Solution,
Synchronization Hardware, Semaphores, Classic problems of synchronization.
Principles of deadlock: System model, Deadlock characterization, Deadlock prevention, Deadlock
detection and avoidance, Recovery from deadlock.
UNIT- III:
Memory Management: Swapping, Contiguous memory allocation, Paging, Structure of the page-
table, Segmentation.
Virtual Memory Management: Virtual memory, Demand paging, Page replacement algorithms:
FIFO, LRU and Optimal page replacement, Thrashing.
UNIT- IV:
File System Interface: The concept of file, File access methods: sequential access, direct access
and indexed access, Directory structure, file sharing and protection.
File System Implementation: File system structure, Allocation methods: contiguous allocation,
linked allocation and indexed allocation, Free-space management.
UNIT- V:
Mass-storage structure: Overview of Mass-storage structure, Disk structure, Disk attachment, Disk
management, Disk scheduling-FCFS, SSTF, SCAN, C-SCAN.
I/O management: I/O devices, Device controllers, Organization of I/O functions, I/O buffering.
Text Books:
1. Abraham Silberchatz, Peter B. Galvin, Greg Gagne Operating System Principles- 7th
Edition, John Wiley.
2. Stallings, 2005, Operating Systems – Internal and Design Principles Sixth Edition,
Pearson education.
Reference Books:
1. D.M. Dhamdhere Operating systems-A concept based approach-, 2nd Edition, TMH.
2. Andrew S Tanenbaum Modern Operating Systems, 2nd edition Pearson/PHI.
Reference Links
1. http://www.cs.kent.edu/~farrell/osf03/oldnotes/index.html : Lecture Notes
2. http://www.personal.kent.edu/~rmuhamma/OpSystems/os.html : Lecture Notes
3. http://www.computerhope.com/os.htm : Different Types of Operating Systems
4. http://nptel.iitm.ac.in/courses/Webcourse-contents/IISc-BANG/
Course Objectives:
• This course aim to enhance student proficiency in a particular programming language C++.
• Acknowledge in the value of mathematics and problem solving techniques in programming
• Learning about the optimized solution in solving problems
Course outcomes: After completion of the course, the students will be able to
1. Use programming to find solution of the problems.
2. create solution based on OOPS concept
3. Choose the right container to arrange data in order to solve problems.
4. Provide problem Solving strategies employing Recursion.
5. Apply mathematics to the problem Analysis
LAB MODULE I:
CPP Essentials: Basic Syntax, Variables, Data types, Operators, Input and output, Conditional
Statements, loops.
LAB MODULE V:
STL 1: Containers, Container Classes, Vectors, Lists, Iterators, set Vector:
https://www.geeksforgeeks.org/problems/c-stl-set-1-vector/1
https://www.hackerrank.com/challenges/vector-erase/problem?isFullScreen=true
Stack:-
Next Greater Element I:https://leetcode.com/problems/next-greater-element-
i/description/Valid Parentheses: https://leetcode.com/problems/valid-
parentheses/description/
Largest Rectangle in Histogram:https://leetcode.com/problems/largest-rectangle-in-
istogram/description/
https://leetcode.com/problems/find-all-anagrams-in-a-string/description/
Integer to Roman:
https://leetcode.com/problems/integer-to-roman/description/
Total Chocolates II:
https://www.geeksforgeeks.org/batch/cp-mathematics/track/cp-math-
primeFactorization/problem/total- chocolates-ii
Count Primes:
https://leetcode.com/problems/count-primes/description/
Make them Co-prime:
https://www.geeksforgeeks.org/batch/cp-mathematics/track/cp-math-
primeFactorization/problem/make- them-co-prime
LAB MODULE X:
Bit Manipulation:
Number of 1 Bits: https://www.geeksforgeeks.org/problems/set-bits0143/1
Bit Difference: https://www.geeksforgeeks.org/problems/bit-difference-1587115620/1
Power of 2: https://www.geeksforgeeks.org/problems/power-of-2-1587115620/1
Find position of set bit: https://www.geeksforgeeks.org/problems/find-position-of-set-bit3706/1
Missing Number: https://leetcode.com/problems/missing-number/description/
Non Repeating Numbers: https://www.geeksforgeeks.org/problems/finding-the-numbers0215/1
Text Books:
1. The Complete Reference C++ by Herbert Schildt ,4th Edition
2. E. Horowitz. et.al., Fundamentals of computer Algorithms, Universities Press, 2008, 2nd Edition.
Reference Books:
1. J.Kleinberg & E. Tardos – Algorithm Design, Pearson Education, New Delhi, 2006
2. Competitive Programming 3: The New Lower Bound of Programming Contests Book by
FelixHalim and Steven Halim, 423 pages
3. Programming Pearls Book by Jon Bentley, 258 pages.T.H. Cormen et.al. – Introduction to
Algorithms – PHI, New Delhi, 2005
4. S.Dasgupta et.al. – Algorithms, TMH, New Delhi – 2007.
Resources:
1. https://leetcode.com/problems/
2. https://nptel.ac.in/courses/106106145/
3. https://www.spoj.com/problem
Course Objective:
To develop skills to design and analyze the applications with respect to java programming
to strengthen the ability to identify and apply the suitable object oriented concept for the given
real world problem
Course Outcomes:
By the end of this course the student will be able to
1. Able to write, compile and execute simple java programs
2. Explain the concept of class and objects with access control to represent real
world entities
3. Use overloading methodology on methods and constructors to develop
application programs
4. Describe the concept of interface and abstract classes to define generic classes
5. Able to create user defined packages and handle exceptions at run time and Apply
Threading concept based on application requirement and design Applet
programming
LIST OF EXPERIMENTS
2. A) Write a java program to create a class Rectangle. The class has attributes Length and Width.
It should have methods that calculate Area and Perimeter of the Rectangle. It should have read
Attributes () method to read Length and Width from the user.
B) The Fibonacci sequence is defined by the following rule: The first two values in the
sequence are1 and 1. Every subsequent value is the sum of the two values preceding it.
3. A) Write a java program that uses both Recursive and Non-Recursive functions to find the
factorial of a given number.
B) Write a java program that checks whether the given string is Palindrome or not. Ex:
MALAYALAM is a Palindrome.
6. Write a Java program to implement the concept of importing classes from user defined
package and creating packages.
9. Write a program using Applet to display a message in the Applet and for configuring
Applets by passing parameters.
Text Books:
1. Herbert Schildt, “Java The complete reference”, 12thEdition, McGraw-Hill, 2022.
2. Timothy budd, “An introduction to object-oriented programming”, 3rdEdition,
Pearson Education, 2009.
Reference Books
1. CayS. Horstmann, Core Java Volume I–Fundamentals, 11th Edition, Pearson 2019
2. Y. Daniel Liang Introduction to Java Programming Comprehensive Version, 10th
Edition, Pearson, 2015.
FUNDAMENTALSOFDATASCIENCELAB
Course Outcomes:
Upon successful completion of the course, the student will be able to:
1. Perform various operations on numpy arrays
2. Importing data from different file formats using pandas
3. Draw different types of charts using matplotlib
List of Experiments:
1. Creating a NumPy Array
a) Basic ndarray
b) Array of zeros
c) Array of ones
d) Random numbers in ndarray
e) An array of your choice
f) Imatrix in NumPy
g) Evenly spaced ndarray
Web References:
1. https://www.analyticsvidhya.com/blog/2020/04/the-ultimate-numpy-tutorial-
for-data-science- beginners/
2. https://www.analyticsvidhya.com/blog/2021/07/data-science-with-pandas-2-
minutes-guide-to-key- concepts/
3. https://www.analyticsvidhya.com/blog/2020/04/how-to-read-common-file-
formats- python/
4. https://www.analyticsvidhya.com/blog/2016/07/practical-guide-data-
preprocessing-python-scikit- learn/
5. https://www.analyticsvidhya.com/blog/2020/02/beginner-guide-
matplotlib-data-visualization- exploration-python/
DESIGN THINKING
(Common to All Branches)
Course Outcomes:
1. Students will be able to explain the importance of Design Thinking in engineering
contexts and use empathy-building techniques
2. Students will be able to generate a diverse range of design ideas using creative ideation
techniques.
3. Students will demonstrate the ability to iteratively refine design solutions based on user
feedback.
4. Students will be able to apply Design Thinking methodologies to solve engineering
challenges effectively.
5. Students will effectively collaborate in teams to develop innovative solutions to
engineering challenges during workshop activities.
Reference Books
• Lockwood, T. (2010). Design Thinking: Integrating Innovation, Customer Experience,
and Brand Value. Allworth Press.
• Brown, T. (2009). Change by Design: How Design Thinking Transforms Organizations
and Inspires Innovation. Harper Business.
• Norman, D. (2013). The Design of Everyday Things (Revised and Expanded Edition).
Basic Books.
• Knapp, J., Zeratsky, J., &Kowitz, B. (2016). Sprint: Howto Solve Big Problems and Test
New Ideas in Just Five Days. Simon & Schuster.
• Cross, B. (2018). Design Thinking for Engineers and Technologists. Wiley.
• Kumar, V. (2012). 101 Design Methods: A Structured Approach for Driving Innovationin
Your Organization. Wiley.
• Kelley, T., & Kelley, D. (2013). Creative Confidence: Unleashing the Creative Potential
Within Us All. Crown Business.
• Mootee, I. (2013). Design Thinking for Strategic Innovation: What They Can't Teach Youat
Business or Design School. Wiley.
• Ries, E. (2011). The Lean Startup: How Today's Entrepreneurs Use Continuous
Innovation to Create Radically Successful Businesses. Crown Business.
• Polaine, A., Løvlie, L., & Reason, B. (2013). Service Design: From Insight to
Implementation. Rosenfeld Media
ENVIRONMENTAL STUDIES
(Common to All Branches)
L T P C
2 0 0 0
Course Objectives:
• Memorize the knowledge of environment and status of different resources on earth.
• Identify the significance, arrangement, causes of annihilation and conservation of
ecosystems and biodiversity..
• Discriminate causes, effects of a variety of pollutions and suitable control methods.
• Identify the hurdles of sustainable development; evaluate the different environmental
management and legal issues.
• Describe the population growths, health problems and evaluate the environmental assets.
Course Outcomes:
By Studying this Course Student will
1. Recognize and speaks well again on the general issues of environment and know how to
conserve resources for better usage.
2. Explain and demonstrate the ecosystems setup, assess. Recognize and conserving of
diversity to upkeep.
3. Examine a range of pollution problems along with control and their eco-friendly disposal
methods.
4. Translate the sustainable development practice through clean development mechanisms.
5. Evaluate the changing trends of world population and compile the information in order to
document the environmental assets.
UNIT - I:
Importance of Environmental Studies and Natural Resources: Definition of Environment –
Importance - Need for Public Awareness
Forest Resources - Use and over exploitation - deforestation – consequences – case study
Water Resources - Use and over utilization - dams - benefits and problems on Tribes and
Environment
Food Resources – Food security concept - changes caused by agriculture and overgrazing -
effects of modern agriculture – fertilizer - pesticide problems - water logging - salinity – concept
of sustainable agricultural methods - case study
Energy Resources - Non-renewable energy resources – coal – crude oil - natural gas - use of
renewable and alternate energy sources.
UNIT - II: Ecosystems and Biodiversity and its conservation: Definition – Structure of
ecosystem: producers - consumers – decomposers. Functions of ecosystem: Food chains - food
webs ecological pyramids - Energy flow – Nutrient cycles (Carbon cycle and Nitrogen cycle).
Ecological succession.
Definition of Biodiversity - Values of biodiversity - Bio-geographical classification of India -
Hot Spots of India - Endangered and endemic species of India –Threats to biodiversity -
Conservation of biodiversity
UNIT - III:
Environmental Pollution: Definition – causes - effects - control measures of Air pollution -
Water pollution - Noise pollution – Marine Pollution - Nuclear hazards.
Solid waste Management: Causes - effects - disposal methods of urban waste – biomedical
wastes - case studies
Disaster management: floods – earthquakes – cyclones
UNIT - IV: Social Issues and the Environment: Concept of Unsustainable and Sustainable
development – Water conservation: Rain water harvesting- Watershed management – Global
environmental challenges: climate change - global warming – acid rains - ozone layer depletion -
World summits on environment: Stockholm conference – Rio-earth summit – Kyoto protocol –
Environment (Protection) Act - Air (Prevention and Control of Pollution) Act – Water
(Prevention and control of Pollution) Act - Wildlife (Protection) Act -Forest (Conservation) Act
UNIT - V:
Human Population and the Environment: Population growth patterns - variation among
nations - Population problems - control -Environment and human health - Role of Information
Technology in Environment and human health
Text Books:
1. Shashi Chawla. 2015, A Text book of Environmental Studies, Revised edition, TMH,
New Delhi
2. Bharucha, E. 2005, Text book of Environmental Studies, First edition, Universities
Press (India) Pvt. Ltd., Hyderabad
3. Suresh K. Dhameja. 2006-07, Environmental Studies, Third revised edition, S.K.
Kataria & Sons (P) Ltd., New Delhi
4. Benny Joseph. 2015, Environmental Studies, Revised edition, TMH, New Delhi
Reference Books:
1. Odum, E.P, Fundamentals of Ecology, Third edition, W.B. Saunders & Co (P)
Ltd., Philadelphia.
2. P. D. Sharma, Ecology and Environment, Revised edition, Rastogi Publications (P) Ltd.
3. Cunningham, W.P., Cunningham, M.A., Principles of Environmental Science, TMH,
New Delhi.
4. Peavy, Rowe and Tchobanoglous, Environmental Engineering, Mc Graw – Hill
International edition.
5. Graedel, T.E., Allenby, B.R., Industrial Ecology and Sustainable Engineering,
Pearson Publications.