KLEF

Department of Basic Engineering Sciences I

Course Handout for I st Year B.Tech Program
A.Y.2018-19, 2nd Semester

Course Name : Technical Skills-2(Coding)

Course Code : 18SC1207
L.T.P structure 0006
Course Credits : 1.5
Course Coordinator : Dr. P.SIVA KUMAR
Course Instructors :

1. Dr.L.sridharrao 21. Mr.T.Ganesan

2. Dr P.Siva Kumar 22. Mrs D.Raghava Lavanya
3. Dr.S.Siva Kumar 23. Mrs.U.Harita
4. Dr.Sk.Razia 24. Mr.B.Ashok
5. Smt E SreeDevi 25. Mrs.B.Sindhu
6. Sri N V S Pavan Kumar 26. Mrs.Sai Sudha
7. Mr.CMAK Zeelan Basha 27. Mr.G.ChandraSekhar
8. Mr T.Vamsidhar 28. Mr.S Ranjan Nayak
9. Mr V.Uday Kumar 29. Ms.SK.Arshiya Julma
10. Mr D.Anand 30. Mr.M.Ram Kumar
11. Mr.T.Rajesh Kumar 31. Dr.MuthukumaranMalarvel
12. Ms. V.Premalatha 32. Mr.A.Srinivasa Rao
13. Mr.A.Krishna 33. Ms.P.Gayatri
14. Mr.Pradeep Raj Savarapu 34. Mr.Y.Ayyappa
15. Mr.ASALG Gopal Gupta 35. Mr.S.Siva Kumar
16. Mr.E.Rajesh Kumar 36. Ms.S.Harika
17. Mr.G.Rama Krishna Srinivas 37. Mr.Dorti Kumar
18. Ms.Karimunnisa 38. Mr.Naveen Kumar
19. Ms.V.lakshmi Sarvani 39. Mr.K.Chiranjeevi
20. Mr.K.Suma Anusha

Mapping of Course Outcomes (CO) to Program outcomes:

CO PO/PSO BTL
Expected Course Outcomes (CO)
# (1 TO 6)
1 Apply the concepts of basic programming to solve the basic 1,2/1 3
problems, pattern based problems
2 Build solutions for problems on Numbers and array based 1,2/1 3
problems , functions, recursion
3 Solve problems solutions for character/string based 1,2/1 3
problems and pointers
4 Build solutions to programs on Data structures concepts. 1,2/1 3
COURSE OUTCOME INDICATORS (COIs):

CO
COI-1(BTL-3) COI-2(BTL-3) COI-3(BTL-3) COI-1(BTL-3)
no.
 Design and
Design and Design and
implement
implement implement
Algorithms for Design and implement
Algorithms for Algorithms for
solving real Algorithms for solving
1 solving real solving real world
world basic real world problems using
world problems using
problems using Expresssions, Statements
problems using Operator Precedence
Basic Data
Operators Rules.
Types
2 Design and Design and Design a Project for
implement implement solving real world
Algorithms for Design and implement Algorithms for problems by using
solving real Algorithms for solving solving real Strings concept.
world basic real world basic problems world basic
problems using using Looping Control problems using
Decision Statements Nested Loops
Making
Statements
3 Design and Design and Design and
implement implement implement
Algorithms for Algorithms for Algorithms for
Design and implement
solving real solving real solving real world
Algorithms for solving
world problems world problems using
real world problems using
using user problems using different operations
different operations on
defined C different on Dictionaries of
list of data using
functions, and operations on data using Searching,
Searching techniques.
storage classes tuples of data Sorting techniques
and scope of using Sorting
variables techniques
4 Design and Design and Design a project for
implement implement solving real world
Design and implement Algorithms for problems by modular
Algorithms for Algorithms for solving
solving real solving real programming.
real world problems world
world using Modules.
problems using problems using
File Operations Packages.

Syllabus : Python interpreter and interactive mode; values and types: int, float, Boolean,
string, and list;variables, expressions, statements, tuple assignment, precedence of operators,
comments; modules and functions, function definition and use, flow of execution, parameters
and arguments.Illustrative programs: exchange the values of two variables, circulate the
values of n variables, distance between two points.Conditionals: Boolean values and
operators, conditional (if), alternative (if-else), chained conditional (if-elif-else); Iteration:
state, while, for, break, continue, pass; Fruitful functions: return values, parameters, local and
global scope, function composition, recursion; Strings: string slices, immutability, string
functions and methods, string module; Lists as arrays. Illustrative programs: square root, gcd,
exponentiation, sum an array of numbers, linear search, binary search.Lists: list operations,
list slices, list methods, list loop, mutability, aliasing, cloning lists, list parameters; Tuples:
tuple assignment, tuple as return value; Dictionaries: operations and methods; advanced list
processing - list comprehension.Illustrative programs: selection sort, Insertion sort, merge
sort, histogram.

Course Objective: This course introduces core programming basics—including data types,
control structures, algorithm development, and program design with functions—via the
Python programming language. The course discusses the fundamental concepts of arrays,
lists, tuples, dictionaries, strings, recursion,. Students will solve problems, explore real-world
software development challenges, and create practical and contemporary applications.
Course Rationale: The course takes an imperative view of problem solving through
programming using C programming language. This necessitates data abstraction, basics of
data structures, and an introduction to the GNU/Linux operating system and programming the
Medium (BTL-2) level language Student is professionally trained in algorithms, flowcharts,
analysis of a problem and translating the same into a C program. The students are made to
write C programs on their own for sets of both mathematical and other engineering problems
after exposing them to the different constructs of C language namely Input/output,
assignments, iteration and control structures. Finally the student is acquainted with basic data
structures like stacks, queues, lists etc.

Text Books:
1. Allen B. Downey, ”Think Python: How to Think Like a Computer Scientist’’, 2 nd
edition, Updated for Python 3,Shroff/O’Reilly Publishers, 2016
http://greenteapress.com/wp/thinkpython/)
2. Guido van Rossum and Fred L. Drake Jr, “An Introduction to Python – Revised and
updated for Python 3.2, Network Theory Ltd., 2011.

Reference Books:
1. Charles Dierbach, “Introduction to Computer Science using Python: A Computational
Problem-Solving Focus, Wiley India Edition, 2013.
2. John V Guttag, “Introduction to Computation and Programming Using Python’’,
Revised And expanded Edition, MIT Press, 2013
3. Kenneth A. Lambert, “Fundamentals of Python: First Programs”, CENGAGE
Learning, 2012.
4. Paul Gries, Jennifer Campbell and Jason Montojo, “Practical Programming: An
Introduction to Computer Science using Python 3”, Second edition, Pragmatic
Programmers,LLC,2013.
5. Robert Sedgewick, Kevin Wayne, Robert Dondero, “Introduction to Programming in
Python: An Inter-disciplinary Approach, Pearson India Education Services Pvt. Ltd.,
2016.
6. Timothy A. Budd, “Exploring Python”, Mc-Graw Hill Education (India) Private Ltd.,,
2015.
WEB REFERNCES/MOOCs:
1) www.hackerrank.com
2) www.codechef.com
3) www.spoj.com
4) www.hackerearth.com
5) www.geeksforgeeks.com
6) www.w3resource.com
7) http://poj.org/problem?id=1000
8) https://uva.onlinejudge.org

SESSION WISE TEACHING – LEARNING PLAN

SESSION NUMBER: 01
Session Outcome: 1. Python interpreter and interactive mode
Active
Time in Topic Teaching–
BTL Learning
Minutes Learning Method
Methods
10 Introduction to python 1

Lecture-1:
20 1
Explain about Python interpreter Lecturing
Discuss about interactive mode
Practice session-1:
40 A+B problem 1
What's Your Name?
COUINF - Infinity Problem
Practice session-2:
Practice/Discussion
25 Python Evaluation 1
Integers Come In All Sizes

10 2
Financing Management
5 conclusion

SESSION NUMBER: 02
Session Outcome: 1. Values and types: int, float, Boolean, string, and list
Active
Time in Topic Teaching–
BTL Learning
Minutes Learning Method
Methods
5 Recap 1

Lecture-1:
20 1
Discuss about Values and types: int, float, Lecturing
Boolean, string, and list
Practice session-1:
25 1
Arithmetic Operators
Python: Division Practice/Discussion
15 Practice session-2: 1
Power - Mod Power
 Practice session-3:
35 DNA Sorting 2
Hangover

10 Home assignment/Practice session 2: (LTC):

Day 2: Operators

SESSION NUMBER: 03
Session Outcome: 1. Variables, expressions, statements, tuple assignment, precedence of
operators, comments
Active
Time in Topic Teaching–
BTL Learning
Minutes Learning Method
Methods
5 Recap 1

Lecture-1:
20 Discuss about Variables, expressions, 1 Lecturing
statements, tuple assignment, precedence of
operators, comments
Practice session-1:
25 TESTINT - Test 1 1
Polar Coordinators

Practice session-2:
15 2
Herd sums Practice/Discussion
Flipping bits
Practice session-3:
35 Flipping bits 3
10038 - Jolly Jumpers

10 Home assignment/Practice session 2: (LTC):

Adding Reversed Numbers

SESSION NUMBER: 04
Session Outcome: 1. modules and functions.
2. function definition and use, flow of execution.
3. parameters and arguments.
Active
Time in Topic Teaching–
BTL Learning
Minutes Learning Method
Methods
5 Recap 1

Lecture-1:
20 Explain about modules and functions, 1 Lecturing
function definition and use, flow of
execution, parameters and arguments.
15 Practice session-1: 1
Cutting paper squares
Practice session-2: Practice/Discussion
25 2
Exponentiation
Ride to School
Practice session-3:
35 3
136 - Ugly Numbers
307 - Sticks
 10 Home assignment
12289-One-Two-Three

SESSION NUMBER: 05
Session Outcome: 1. Illustrative programs: exchange the values of two variables, circulate
the values of n variables, distance between two points
Active
Time in Topic Teaching–
BTL Learning
Minutes Learning Method
Methods
5 Recap 1

Lecture-1:
Discuss about Illustrative programs:
20 1
exchange the values of two variables, Lecturing
circulate the values of n variables, distance
between two points
Practice session-1:
Ask student to execute lecture-1
40 Big Square 1
Handshake
Lists
Practice/Discussion
Practice session-3:
35 12372-Packing for Holidays 3
256 - Quirksome Squares

10 Home assignment:
Yeehaa!

SESSION NUMBER: 06
Session Outcome: 1. Conditionals: Boolean values and operators.
2.Conditional (if), alternative (if-else), chained conditional (if-elif-else)
Active
Time in Topic Teaching–
BTL Learning
Minutes Learning Method
Methods
5 Recap 1

Lecture-1:
20 Discuss about Conditionals: Boolean values 1 Lecturing
and operators, conditional (if), alternative
(if-else), chained conditional (if-elif-else)
Practice session-1:
25 Factorial 1
BALLSUM - Ball sum

Practice session-2: Practice/Discussion

15 2
MADODDSUM - Easy Odd Sum

35 Practice session-3: 3
443 - Humble Numbers
10696 : f91
10 Home assignment/Practice session 2: (LTC):
EASYFACT - Easy Factorials

SESSION NUMBER: 07
Session Outcome: 1. Iteration: state, while, for, break, continue, pass
 Active
Time in Topic Teaching–
BTL Learning
Minutes Learning Method
Methods
5 Recap 1

Lecture-1:
20 state, while, for, break, 1
Discuss about Lecturing
continue, pass
25 Practice session-1: 2
Area
Practice session-2:
20 2
DIVFACT - Divisors of factorial
Practice/Discussion
Practice session-3:
40 Chocolate Chip Cookies 3
902-Password Search

5 conclustion

SESSION NUMBER: 08
Session Outcome: 1.String slices, immutability, string functions and methods, string module
Active
Time in Topic Teaching–
BTL Learning
Minutes Learning Method
Methods
5 Recap 1

Lecture-1:
25 Explain about tring slices, immutability, 1 Lecturing
string functions and methods, string
module.
Practice session-1:
35 2
Inversion
Find the Multiple
Practice session-2:
25 Sum1SEQ-sum of One-Sequeuce 2 Practice/Discussion
SMPDIV-Divisibility

15 Practice session-3: 3
471-MagicNumbers
5 conclusion
SESSION NUMBER: 09
Session Outcome: 1. Lists as arrays
Active
Time in Topic Teaching–
BTL Learning
Minutes Learning Method
Methods
5 Recap 1

20 Lecture-1: 1 Lecturing
Discuss about Lists as arrays
 Practice session-1:
25 1
EASYFACT-easy factoirals
LASTDIG-The Last Digit
15 Practice session-2: 2
AMR11E-Distinct Primes Practice/Discussion
Practice session-3:
40 495-Fibonacci Freez 3
10783-Odd Sum

5 Conclusion

SESSION NUMBER: 10
Session Outcome: 1. Illustrative programs: square root, gcd, exponentiation, sum an array
of numbers, linear search, binary search.
Active
Time in Topic Teaching–
BTL Learning
Minutes Learning Method
Methods
5 Recap 1

Lecture-1:
30 Discuss about Illustrative programs: square 1 Lecturing
root, gcd, and exponentiation, sum an array
of numbers, linear search, binary search.
Practice session-1:
20 Apple Tree 1
FCDC-Factorial Modulo

20 Practice session-2: 2
Practice/Discussion
Division-Divisibility by 3
Practice session-3:
30 10783-OddSum 3
10055-Hashmat The Brave Warrior

5 Conclusion
SESSION NUMBER: 11
Session Outcome: list operations, list slices, list methods, list loop, mutability,
aliasing, cloning lists, list parameters;
Active
Time in Topic Teaching– Learning
BTL
Minutes Learning Method
Methods
5 Recap 1

Lecture-1:
30 Explain about list operations, list slices, list 1 Lecturing
methods, list loop, mutability, aliasing,
cloning lists, list parameters;
20 Practice session-1: 1
The Triangle
25 Practice session-2: 2 Practice/Discussion
DivSum-Divisors Summation
25 Practice session-3: 3
100:3n+1 Problem
5 Conclusion
SESSION NUMBER: 12
Session Outcome: 1.Tuples: tuple assignment, tuple as return value
Active
Time in Topic Teaching–
BTL Learning
Minutes Learning Method
Methods
5 Recap 1

Lecture-1:
30 1
Discuss about Tuples: tuple assignment, Lecturing
tuple as return value;
Practice session-1:
30 MAIN111-STRICTLY NOT A PRIME 1

Practice session-3: Practice/Discussion

40 10370:ABOVE AVERAGE 3
245-UNCOMPRESS

5 Conclusion

SESSION NUMBER: 13
Session Outcome: Dictionaries: operations and methods; advanced list processing
Active
Time in Topic Teaching–
BTL Learning
Minutes Learning Method
Methods
5 Recap 1

Lecture-1:
20 1
Discuss about Dictionaries: operations and Lecturing
methods; advanced list processing
Practice session-1:
25 1
The Blocks Problem

Practice session-2:
20 2 Practice/Discussion
486-English Number Translator

35 Practice session-3: 3
411875-Brick game
5 Conclusion

SESSION NUMBER:14
Session Outcome: 1. list comprehension.
Active
Time in Topic Teaching–
BTL Learning
Minutes Learning Method
Methods
5 Recap 1

20 Lecture-1: 1 Lecturing
Discuss about list comprehension.
25 Practice session-1: 2
Ecological Bin Packing
15 Practice session-2: 2
529-addition chains
 Practice session-3: Practice/Discussion
40 524-PrimeRing Problem-Solving 3
10071-Back to High School Physics

5 conclusion

SESSION NUMBER: 15
Session Outcome: 1. Illustrative programs: selection sort, Insertion sort, merge sort,
histogram.
Active
Time in Topic Teaching–
BTL Learning
Minutes Learning
Methods
Method
5 Recap 1

Lecture-1:
20 1
Explain about selection sort, Insertion sort, Lecturing
merge sort, histogram.
Practice session-1:
25 2
Sum of First N natural Numbers

Practice session-2:
40 3 Practice/Discussion
106-Fermet vs Pythagoras
10469-To Carry or Not To
carry
15 Practice session-3: 3
490- Rotating Sentences
5 conclusion
Session Teaching /
Topic BTL Reference
NO. Learning
Level
Methods
10019-Funny Encryption Method 2 W REF[8]

108 - Maximum Sum 3 W REF[8]

16 Find the next biggest. Practice/Discussion
2 W REF[2]

11614 : Etruscan Warriors Never Play

Chess 3 W REF[8]

10062-Tell Me the frequencies 2 W REF[8]

123 - Searching Quickly 3 W REF[8]

17 Practice/Discussion
1225 : Digit Counting 3 W REF[8]

575 - Skew Binary 2 W REF[8]

Interchange of diagonal elements. 2 W REF[2]

Transpose and determinant of matrix. 2 W REF[2]

18 Practice/Discussion
136 - Ugly Numbers 3 W REF[8]

10499 : The Land of Justice 3 W REF[8]

 834 : Continued Fractions 3 W REF[8]

10222-Decode the man 2 W REF[8]

19 Practice/Discussion
155 - All Squares 3 W REF[8]

Rotate a matrix by clockwise. 2 W REF[2]

160 - Factors and Factorials 2 W REF[8]

138 : Street Numbers 3 W REF[8]

20 Practice/Discussion
962 - Taxicab Numbers 2 W REF[8]

Least frequent element in an array. 2 W REF[2]

164 - String Computer 3 W REF[8]

Smallest element in an array that is

repeated exactly ‘k’ times. 2 W REF[2]
21 Practice/Discussion
11805 : Bafana Bafana 3 W REF[8]

10420-List of Conquests 2 W REF[8]

22 183 - Bit Maps 3 W REF[8] Practice/Discussion

10921-Find the Telephone 2 W REF[8]

443 : Humble Numbers 3 W REF[8]

Compare two strings in the given

2 W REF[2]
priority order.

11878-Home Work Checker 2 W REF[8]

195 – Anagram 3 W REF[8]

23 Practice/Discussion
String is palindrome or not. 2 W REF[2]

11461 :Square Numbers 3 W REF[8]

12149 : Feynman 3 W REF[8]

Palindromic partitions of a string 2 W REF[2]

24 Practice/Discussion
201 – Squares 3 W REF[8]

Printing all substrings from given string 2 W REF[2]

257 – Palin words 3 W REF[8]

113 : Power of Cryptography 3 W REF[8]

25 Count distinct sub sequence W REF[2] Practice/Discussion
2

Find if first string is subsequence of

2 W REF[2]
second

Sum of all sub sequences in string 2 W REF[2]

 294 – Divisors 3 W REF[8]

11636: Hello World! 3 W REF[8] Practice/Discussion

26
Longest Repeating substring 2 W REF[2]

306 – Cipher 3 W REF[8]

Maximum Occurring character 2 W REF[2]

27 Practice/Discussion
2nd most frequent character 2 W REF[2]

107 : The Cat in the Hat 3 W REF[8]

338 - Long Multiplication 3 W REF[8]

Factorial using recursion 2 W REF[2]

28 Practice/Discussion
694 : The Collate Sequence 3 W REF[8]

Recursive Array Sum 2 W REF[2]

Reversing a string using recursion 2 W REF[2]

386 - Perfect Cubes 3 W REF[8]

29 Practice/Discussion
12502 : Three Families 3 W REF[8]

Reverse a sentence using recursion 2 W REF[2]

Tuples 1 W REF[1]

385 - DNA Translation 2 W REF[8]

30 272-TEX Quotes W REF[8] Practice/Discussion
1

Check if all the dictionaries in a list are

3 W REF[6]
empty are not.

374-Big Mod 3 W REF[8]

10696 : f91 3 W REF[8]

307 – Sticks W REF[8] Practice/Discussion

3
31
Converting a list of tuples into a
2 W REF[6]
dictionary.

10170 : The Hotel with Infinite Rooms 3 W REF[8]

12250-Language Detection 3 W REF[8]

32 Practice/Discussion
12004 : Bubble Sort 3 W REF[8]

Day 8:Dictionaries and maps 1 W REF[1]

CMPLS - Complete the Sequence! 3 W REF[3]

Chef and Tuples 1 W REF[2]

33 Practice/Discussion
And Tuples 2 W REF[2]
 10940 : Throwing Cards Away II 3 W REF[8]

621- Secret Search 1 W REF[8]

THINKBIT - Strange Pattern (Medium) 3 W REF[3]

Practice/Discussion
34 10006 : Carmichael Numbers 3 W REF[8]

11799-Horror Dash 1 W REF[8]

10114-Loansome car Buyer 3 W REF[8]

35 Iterable and Iterators 2 W REF[1] Practice/Discussion

701 : The Archeologists’ Dilemma 3 W REF[8]

11727-Cost Cutting 1 W REF[8]

11172-Relational Operators 1 W REF[8]

11332-Summing Digits 1 W REF[8]

36 Practice/Discussion
11498-Division of Nlogonia 1 W REF[8]

Your name is mine 1 W REF[2]

120-Stacks of Flapjacks 3 W REF[8]

127-“accordion”patience 2 W REF[8]
37 Practice/Discussion
551-Nesting a bunch of Brackets 3 W REF[8]

727-Equations 2 W REF[8]

540-Team queue 3 W REF[8]

10172-The lonesome Cargo distributor 2 W REF[8]

38 Practice/Discussion
11034-Ferry Loading IV 2 W REF[8]

12100-Printer queue 3 W REF[8]

11988-broken Keyboard 3 W REF[8]

974 - Kaprekar Numbers 2 W REF[8]

39 Practice/Discussion
913 - Joana and the Odd Numbers 3 W REF[8]

371-Ackerrmann Function 3 W REF[8]

Mini projects
Project-1
Title: Implementation of stack Applications

Project-2
Title: Implementation of Linked List Applications
Project-3
Title: Hash based Inventory System

Project-4
Title: Comparative study on sorting algorithms

Project-5
Title: Bill Notification System

Project –6
Title: Stock Exchange Information Base

Project -7
Title: Banking system

Project - 8
Title: Sparse Matrix Implementation

Project - 9
Title: Student Information System

Project -10
Title: Mini-Telephone Directory

Project -11
Title: Word Frequency Count Application.
.
Project -12
Title: Hospital Management

Project -13
Title: Word Tree
Project -14
Title: Binary Search Tree and its operations

Project -15
Title: AVL Tree and its operations

Project -16
Title: Dictionary
Project -17
Title: Library Book Circulation System

Project -18
Title: Movie Ticket Booking System.

Project -19
Title: Railway Ticket Booking System.

Project -20
Title: Implementation of undo redo operations

Project -21
Title: Palindrome Detector

Project -22
Title: Employee Management System

Project -23
Title: Expression Trees using BST

Project -24
Title: Tic-Tac-Toe Game

Project -25
Title: Spell Checker

Evaluation Evaluation Assessment Duration

Weightage/Marks CO1 CO2 CO3 CO4
Type Component Dates (Hours)

Blooms Taxonomy Level

Weightage 10 5 5
Semester In Semester In
Max 2
Exam-I 50M Exam-I Dates 25 25
Marks
Weightage 10 5 5
Semester In Semester In
Max 2
Exam -II 50M Exam-II Dates 25 25
Semester Marks
In
Summative Lab Weightage 25 6 6 6 7
Evaluation Continuous Continuous evaluation
Evaluation Max
Total = 60 100M 25 25 25 25
Marks
% Weightage 10 5 5
Project Max
50M 25 25
Marks
Weightage 5
Attendance Max Continuous evaluation
5M
Marks
Semester Review 30
Weightage 40 Exercise 5 10 10 10 10
 End Viva 5
Summative SE Lab Semester End 20
Max 2
Evaluation Expt. 50M Lab Exam 10 10 10 20
Marks
Total = 40 Dates
%
Evaluation Evaluation Assessment Duration
Weightage/Marks CO1 CO2 CO3 CO4
Type Component Dates (Hours)

Blooms Taxonomy Level

Weightage 10 5 5
Semester In Semester In
Max 2
Exam-I 50M Exam-I Dates 25 25
Marks
Weightage 10 5 5
Semester In Semester In
Max 2
Exam -II 50M Exam-II Dates 25 25
Semester Marks
In
Summative Lab Weightage 25 6 6 6 7
Evaluation Continuous Continuous evaluation
Evaluation Max
Total = 60 100M 25 25 25 25
Marks
% Weightage 10 5 5
Project Max
50M 25 25
Marks
Weightage 5
Attendance Max Continuous evaluation
5M
Marks
Semester Review 30
End Weightage 40 Exercise 5 10 10 10 10
Summative SE Lab Viva 5
2
Evaluation Expt. Semester End 20
Max
Total = 40 50M Lab Exam 10 10 10 20
Marks
% Dates

ATTENDANCE POLICY Every student is expected to be responsible for regularity of

his/her attendance in class rooms and laboratories, to appear in scheduled tests and
examinations and fulfill all other tasks assigned to him/her in every course. For Promotion, a
Minimum of 50% of internal marks must be obtained. In every course, student has to
maintain a minimum of 85% attendance to be eligible for appearing in Semester end
examination of the course, for cases of medical issues and other unavoidable circumstances
the students will be condoned if their attendance is between 75% to 85% in every course,
subjected to submission of medical certificates, medical case file and other needful
documental proof to the concerned departments.

DETENTION POLICY In any course, a student has to maintain a minimum of 85%

attendance and must secure a minimum of 50% marks in In-Semester Examinations to be
eligible for appearing to the Semester End Examination, failing to fulfill these conditions will
deem such student to have been detained in that course.

PLAGIARISMPOLICY Use of unfair means in any of the evaluation components will be

dealt with strictly, and the case will be reported to the examination committee.
COURSE TEAM MEMBERS, CHAMBER CONSULTATION HOURS AND
CHAMBER VENUE DETAILS:
Each instructor will specify his / her chamber consultation hours during which the student can
contact him / her in his / her chamber for consultation.
GENERAL INSTRUCTIONS:
Students should come prepared for classes and carry the text book(s) or material(s) as
prescribed by the Course Faculty to the class.

NOTICES:

Most of the notices are available on the LMS platform. All notices will be communicated
through the institution email. All notices concerning the course will be displayed on the
respective Notice Boards.

Signature of COURSE COORDINATOR:

Signature of Department Prof. Incharge Academics & Vetting Team Member:

HEAD OF DEPARTMENT:

Approval from: DEAN-ACADEMICS (Sign with Office Seal)