COURSE PLAN

COURSE INFORMATION SHEET

Course file
DATA STRUCTURES LAB/BCSL305
Course Name/Subject Code
B.E/INFORMATION SCIENCE AND
Degree/Branch
ENGINEERING
Name of the Course Instructor Prof. Sindhuja M / Prof. Neelima Sahu
& Designation Asst. Professor
LAB
Course Category
[email protected] 7200017274
Course Instructor Contact Details
(Email & Mob. No)
3rd Semester 2024-2025
Semester & Academic year
1
No. Of credits
2022
Scheme

Term Dates

Verification by

Date /Time/Venue

Overall remarks

Course Instructor IQAC verifier HOD

Name /Sign/ Name /Sign/ seal Name /Sign/
seal
 Weightage of Marks (2022 Scheme)

Component Marks
Internal Exam
1. Internal Examinations I, II : 50% 50

External Exam
50
Semester End Examination (SEE) : 50%
Total 100
 PROGRAMME OUTCOMES (PO)
1. Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals,
and an engineering specialization to the solution of complex engineering problems.
2. Problem analysis: Identify, formulate, review research literature, and analyse complex engineering
problems reaching substantiated conclusions using first principles of mathematics, natural sciences,
and engineering sciences.
3. Design/development of solutions: Design solutions for complex engineering problems and design
system components or processes that meet the specified needs with appropriate consideration for the
public health and safety, and the cultural, societal, and environmental considerations.
4. Conduct investigations of complex problems: Use research-based knowledge and research methods
including design of experiments, analysis and interpretation of data, and synthesis of the information to
provide valid conclusions.
5. Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern
engineering and IT tools including prediction and modelling to complex engineering activities with an
understanding of the limitations.
6. The engineer and society: Apply reasoning informed by the contextual knowledge to assess societal,
health, safety, legal and cultural issues and the consequent responsibilities relevant to the professional
engineering practice.
7. Environment and sustainability: Understand the impact of the professional engineering solutions in
societal and environmental contexts, and demonstrate the knowledge of, and need for sustainable
development.
8. Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of
the engineering practice.
9. Individual and team work: Function effectively as an individual, and as a member or leader in
diverse teams, and in multidisciplinary settings.
10. Communication: Communicate effectively on complex engineering activities with the engineering
community and with society at large, such as, being able to comprehend and write effective reports and
design documentation, make effective presentations, and give and receive clear instructions.
11. Project management and finance: Demonstrate knowledge and understanding of the
Engineering and management principles and apply these to one’s own work, as a member and leader
in a team, to manage projects and in multidisciplinary environments.
12. Life -long learning: Recognize the need for and have the preparation and ability to engage
in independent and life -long learning in the broadest context of technological change.
 DATA STRUCTURES LABORATORY SEMESTER – III

Course Code BCSL305 CIE Marks 50

Number of Contact Hours/Week 0:0:2 SEE Marks 50
Total Number of Lab Contact Hours 28 Exam Hours 03
Credits – 1
Course Learning Objectives:
This laboratory course enables students to get practical experience in design, develop, implement,
analyze and evaluation/testing of
● Dynamic memory management
● Linear data structures and their applications such as stacks, queues and lists
● Non-Linear data structures and their applications such as trees and graphs

Descriptions (if any):

● Implement all the programs in “C ” Programming Language and Linux OS.
Programs List:
1. Develop a Program in C for the following:
a) Declare a calendar as an array of 7 elements (A dynamically Created array) to
represent 7 days of a week. Each Element of the array is a structure having three
fields. The first field is the name of the Day (A dynamically allocated String), The
second field is the date of the Day (A integer), the third field is the description of the
activity for a particular day (A dynamically allocated String).
b) Write functions create(), read() and display(); to create the calendar, to read the data
from the keyboard and to print weeks activity details report on screen.
2. Develop a Program in C for the following operations on Strings.
a. Read a main String (STR), a Pattern String (PAT) and a Replace String (REP)
b. Perform Pattern Matching Operation: Find and Replace all occurrences of PAT in
STR with REP if PAT exists in STR. Report suitable messages in case PAT does not
exist in STR
Support the program with functions for each of the above operations. Don't use Built-in
functions.
3. Develop 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 on to Stack
b. Pop an Element from Stack
c. Demonstrate how Stack can be used to check Palindrome
d. Demonstrate Overflow and Underflow situations on Stack
e. Display the status of Stack
f. Exit
Support the program with appropriate functions for each of the above operations
4. Develop 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.

5. Develop a Program in C for the following Stack Applications

a. Evaluation of Suffix expression with single digit operands and operators: +, -, *, /, %,
^
b. Solving Tower of Hanoi problem with n disks
6. Develop a menu driven Program in C for the following operations on Circular QUEUE of
Characters (Array Implementation of Queue with maximum size MAX)
a. Insert an Element on to Circular QUEUE
b. Delete an Element from Circular QUEUE
c. Demonstrate Overflow and Underflow situations on Circular QUEUE
d. Display the status of Circular QUEUE
e. Exit
Support the program with appropriate functions for each of the above operations

7. Develop a menu driven Program in C for the following operations on Singly Linked List (SLL)
of Student Data with the fields: USN, Name, Programme, Sem,
PhNo
a. Create a SLL of N Students Data by using front insertion.
b. Display the status of SLL and count the number of nodes in it
c. Perform Insertion / Deletion at End of SLL
d. Perform Insertion / Deletion at Front of SLL(Demonstration of stack)
e. Exit

8. Develop a menu driven Program in C for the following operations on Doubly Linked List (DLL)
of Employee Data with the fields: SSN, Name, Dept, Designation,
Sal, PhNo
a. Create a DLL of N Employees Data by using end insertion.
b. Display the status of DLL and count the number of nodes in it
c. Perform Insertion and Deletion at End of DLL
d. Perform Insertion and Deletion at Front of DLL
e. Demonstrate how this DLL can be used as Double Ended Queue.
f. Exit
 9. Develop a Program in C for the following operations on Singly Circular Linked List (SCLL)
with header nodes
a. Represent and Evaluate a Polynomial P(x,y,z) = 6x2y2z-4yz5+3x3yz+2xy5z-2xyz3
b. Find the sum of two polynomials POLY1(x,y,z) and POLY2(x,y,z) and store the
result in POLYSUM(x,y,z)
Support the program with appropriate functions for each of the above operations
10. Develop a menu driven Program in C for the following operations on Binary Search Tree (BST)
of Integers .
a. Create a BST of N Integers: 6, 9, 5, 2, 8, 15, 24, 14, 7, 8, 5, 2
b. Traverse the BST in Inorder, Preorder and Post Order
c. Search the BST for a given element (KEY) and report the appropriate message
d. Exit

11. 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/BFS
method

12. Given a File of N employee records with a set K of Keys (4-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. 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.
Laboratory Outcomes: The student should be able to:

● Analyze various linear and non-linear data structures

● Demonstrate the working nature of different types of data structures and their applications
● Use appropriate searching and sorting algorithms for the give scenario.
● Apply the appropriate data structure for solving real world problems
 Conduct of Practical Examination:

● Experiment distribution
o For laboratories having only one part: Students are allowed to pick one
experiment from the lot with equal opportunity.
o For laboratories having PART A and PART B: Students are allowed to pick
one experiment from PART A and one experiment from PART B, with equal
opportunity.
● Change of experiment is allowed only once and marks allotted for procedure to be made
zero of the changed part only.
● Marks Distribution (Need to change in accordance with university regulations)
c) For laboratories having only one part – Procedure + Execution + Viva-Voce:
15+70+15 = 100 Marks
d) For laboratories having PART A and PART B
i. Part A – Procedure + Execution + Viva = 6 + 28 + 6 = 40 Marks
ii. Part B – Procedure + Execution + Viva = 9 + 42 + 9 = 60 Marks

Course Outcomes (CO):

Sl. No DESCRIPTION

CO1 Analyze various linear and non-linear data structures

CO2
Demonstrate the working nature of different types of data structures and their applications
CO3
Use appropriate searching and sorting algorithms for the give scenario.
CO4
Apply the appropriate data structure for solving real world problems

Course Learning Objectives:

This course will enable students to get practical experience in design, develop, implement, analyze and evaluation/testing
of
● Dynamic memory management
● Linear data structures and their applications such as stacks, queues and lists
● Non-Linear data structures and their applications such as trees and graphs
Course Articulation Matrix
COs P PSOs
o
s
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 3 3 2 3 2 3 2 2 1 2 3 3

CO2 3 3 3 2 3 2 3 2 2 1 2 3 3

CO3 3 3 3 2 3 2 3 2 2 1 2 3 3

CO4 3 3 3 2 3 2 3 2 2 1 2 3 3

CO5 3 3 3 2 3 2 3 2 2 1 2 3 3
LESSON PLAN – C SEC
Course
S.I PROGRAM LIST Outcomes
Date
No.
Develop a Program in C for the following:
c) Declare a calendar as an array of 7 elements (A dynamically
Created array) to represent 7 days of a week. Each Element
of the array is a structure having three fields. The first field
is the name of the Day (A dynamically allocated String),
The second field is the date of the Day (A integer), the third
1) field is the description of the activity for a particular day (A CO1 to CO4
dynamically allocated String).
Write functions create(), read() and display(); to create the calendar,
to read the data from the keyboard and to print weeks activity
details report on screen.
Develop a Program in C for the following operations on Strings. CO1 to CO4
c. Read a main String (STR), a Pattern String (PAT) and a
Replace String (REP)
d. Perform Pattern Matching Operation: Find and Replace
all occurrences of PAT in STR with REP if PAT exists in
2) STR. Report suitable messages in case PAT does not
exist in STR
Support the program with ctions for each of the above operations.
Don't use Built-in functions.
Develop a menu driven Program in C for the following CO1 to CO4
operations on STACK of Integers (Array Implementation of
Stack with maximum size MAX)
g. Push an Element on to Stack
h. Pop an Element from Stack
i. Demonstrate how Stack can be used to check Palindrome
3) j. Demonstrate Overflow and Underflow situations on Stack
k. Display the status of Stack
l. Exit
Support the program with appropriate functions for each of the
above operations
Develop a Program in C for converting an Infix Expression to CO1 to CO4
Postfix Expression. Program should support for both
parenthesized and free parenthesized
4)
expressions with the operators: +, -, *, /, % (Remainder), ^ (Power)
and alphanumeric operands.
Develop a Program in C for the following Stack Applications CO1 to CO4
c. Evaluation of Suffix expression with single digit
operands and operators: +, -, *, /, %,^
5) Solving Tower of Hanoi problem with n disks
 Develop a menu driven Program in C for the following operations CO1 to CO4
on Circular QUEUE of Characters (Array Implementation of
Queue with maximum size MAX)
f. Insert an Element on to Circular QUEUE
g. Delete an Element from Circular QUEUE
h. Demonstrate Overflow and Underflow situations on
6) Circular QUEUE
i. Display the status of Circular QUEUE
j. Exit
Support the program with appropriate functions for each of the
above operations
Develop a menu driven Program in C for the following operations CO1 to CO4
on Singly Linked List (SLL) of Student Data with the fields:
USN,
Name, Programme, Sem,PhNo
f. Create a SLL of N Students Data by using front insertion.
7) g. Display the status of SLL and count the number of nodes
in it
h. Perform Insertion / Deletion at End of SLL
i. Perform Insertion / Deletion at Front of
SLL(Demonstration of stack)
Exit
Develop a menu driven Program in C for the following operations CO1 to CO4
on Doubly Linked List (DLL) of Employee Data with the fields:
SSN, Name, Dept, Designation,
Sal, PhNo
g. Create a DLL of N Employees Data by using end insertion.
h. Display the status of DLL and count the number of nodes
8) in it
i. Perform Insertion and Deletion at End of DLL
j. Perform Insertion and Deletion at Front of DLL
k. Demonstrate how this DLL can be used as Double
Ended Queue.
Exit
Develop a Program in C for the following operations on CO1 to CO4
Singly Circular Linked List (SCLL) with header nodes
c. Represent and Evaluate a Polynomial P(x,y,z) =
6x2y2z- 4yz5+3x3yz+2xy5z-2xyz3
9) d. Find the sum of two polynomials POLY1(x,y,z)
and POLY2(x,y,z) and store the result in
POLYSUM(x,y,z)
Support the program with appropriate functions for each of the
above operations
 Develop a menu driven Program in C for the following operations CO1 to CO4
on Binary Search Tree (BST) of Integers .
e. Create a BST of N Integers: 6, 9, 5, 2, 8, 15, 24, 14, 7, 8, 5,
2
10) f. Traverse the BST in Inorder, Preorder and Post Order
g. Search the BST for a given element (KEY) and report
the appropriate message
Exit
Develop a Program in C for the following operations on CO1 to CO4
Graph(G) of Cities
c. Create a Graph of N cities using Adjacency Matrix.
11)
Print all the nodes reachable from a given starting node in a digraph
using DFS/BFS method
Given a File of N employee records with a set K of Keys (4-digit) CO1 to CO4
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.
12) 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.

Text Books and Reference Books:

 Sl. Book Name Author(s) Publisher Year, Edition

Ellis Horowitz,
Text 2nd Ed,
Sartaj Sahni and
Books 1 Fundamentals of Data Structures in C Universiti 2014
Susan Anderson-
es Press
Freed,

Revised
Seymour 1st Ed,
1. , Data Structures Schaum's Outlines 2014
Reference Lipschutz McGraw
Books Hill
3rd Ed,
2. Data Structures using C Reema Thareja Oxford 2012
press

3. Data Structures using C A M Tenenbaum PHI 1989

Topics beyond syllabus /advanced topics / design:

SL PROPOSED RELEVANCE RELEVANCE
Description of Topics Beyond the Syllabus
No. ACTIONS WITH POs WITH PSOs

1. Sorting Techniques

Teaching and Learning with Electronic Repository

Exp.
Experiment Name Web Link
No
https://ds2-iiith.vlabs.ac.in/exp/selection- sort/index.html
1. Data structures

Internal Examination Portions and Date:

Internal Examination Modules Date

Internal Examination- I All Programs

Semester End Examination All Programs -

Syllabus Coverage:
subject IA-1 IA-2 IA-3
 code number of portions number of classes portions number of portions
classes covered conducted covered classes covered
conducted conducted
BCSL305

Weightage for Direct and Indirect assessment tools

Assessment Tools Percentage of Weightage

Direct Assessment Tools Internal Examination I, II 50 %

Direct Assessment Tools Semester End Examination(SEE) 50 %

 Student List: B sec

SL NO. USN STUDENT NAME 27 1EP23IS090 MANOJ KUMAR P N

1 1EP23IS064 K S SWATHI 28 1EP23IS091 MANYA K

2 1EP23IS065 KAMMA BHAVYA SREE 29 1EP23IS092 MD ASIF ALI

3 1EP23IS066 KAVANA S 30 1EP23IS093 MEGHA S N

4 1EP23IS067 KEERTHANA YADAVARAJ 31 1EP23IS094 MEGHANA B M

5 1EP23IS068 KIRAN R 32 1EP23IS095 MOHAMMED REYAN K

6 1EP23IS069 Kishore A S 33 1EP23IS096 MOHAMED YOUSUF

7 1EP23IS070 K VISHNU VARDHAN 34 1EP23IS097 MOHAMMED SAIFULLA

8 1EP23IS071 Krishna Jee 35 1EP23IS098 MOHAMMED SAMEER HAMZA

9 1EP23IS072 Krithik Manuvel 36 1EP23IS099 MOHAMMED SHAHID R

10 1EP23IS073 KRUTHIK PATEL G S 37 1EP23IS100 Nagendra

11 1EP23IS074 KUMAR ADITHYA 38 1EP23IS101 Nandita Dash

12 1EP23IS075 KUMAR N 39 1EP23IS102 NANDITHA HAVERI

13 1EP23IS076 KUSHAL R M 40 1EP23IS103 NAVEEN KUMAR K

14 1EP23IS077 KUSUMA H 41 1EP23IS104 NAVEENA B

15 1EP23IS078 Likith Reddy R 42 1EP23IS105 NAYANA G L

16 1EP23IS079 Likith Kumar K S 43 1EP23IS106 NAYANA S

17 1EP23IS080 Likith kumar CS 44 1EP23IS107 Pampangouda

18 1EP23IS081 LOHITH NAIDU R 45 1EP23IS108 PATIL KEERTHI PRIYA

19 1EP23IS082 Lokesh T 46 1EP23IS109 PAVAN B

20 1EP23IS083 M Ajay 47 1EP23IS110 PAVAN GOWDA T S

21 1EP23IS084 MADHAN S B
48 1EP23IS111 PAVAN T D
22 1EP23IS085 MADHAV A
49 1EP23IS112 PAVITHRA S
23 1EP23IS086 MAHENDRA M N
50 1EP23IS113 POOJITH S MENON
24 1EP23IS087 MAMATHA K V
51 1EP23IS114 POORNIMA S V
25 1EP23IS088 MANDLA MADHUSUDHAN
52 1EP23IS115 PRAJWAL KUMBAR
26 1EP23IS089 MANMOHAN B
53 1EP23IS116 Prajwal S
54 1EP23IS117 PRATEEK KUMAR GARHE

55 1EP23IS118 Prathiksha D

56 1EP23IS119 Praveen D S

57 1EP23IS120 PREETHI M

58 1EP23IS121 Preethi Singh

59 1EP23IS122 PRIYANKA SATHYA NARAYAN

60 1EP23IS123 PRIYANSHU KUMAR

61 1EP23IS124 ROSHAN.R

62 1EP23IS125 RACHANA R

63 1EP23IS126 RAGHAVENDRA
SL 28 1EP23IS028
USN STUDENT NAME BHARATHA KUMAR P
NO.
29 1EP23IS029 Bhavavna G M
1 1EP23IS001 A N TRISHA
30 1EP23IS030 BHAVANA R
2 1EP23IS002 AADHITHYA B NAG BOLIKONDA RISHI
31 1EP23IS031
3 1EP23IS003 KUMAR
SAINATH AARLA A
32 1EP23IS032 C AKASH
4 1EP23IS004 Abhishek D
33 1EP23IS033 Chaithanya R
5 1EP23IS005 Abhishek Angadi
34 1EP23IS034 CHAITRA B
6 1EP23IS006 ADITYA R
35 1EP23IS035 CHAITRA L
7 1EP23IS007 AFREED P
CHANCHAL KUMAR
8 1EP23IS008 36 1EP23IS036
AFWAN SAAD AHMED SHARMA
9 1EP23IS009 37 1EP23IS037 Chandan Kumar
AISHWARYA V H
10 1EP23IS010 38 1EP23IS038 Chandana G S
AKASH D
11 1EP23IS011 39 1EP23IS039 CHANDANA V
Akash V
12 1EP23IS012 40 1EP23IS040 CHARAN S E
AKSHATA
13 1EP23IS013 41 1EP23IS041 CHETHAN K S
AKSHATA JADIMATH
14 1EP23IS014 42 1EP23IS042 CHIRAG V J
AKSHAY D
15 1EP23IS015 43 1EP23IS043 CHUCHENDRA P
Akshith D S
16 1EP23IS016 44 1EP23IS044 DEEKSHITHA G R
Ambika P
17 1EP23IS017 45 1EP23IS045
ANIRUDH V JOSHI DEVIKA D
18 1EP23IS018 Arati Balwan Jadhav 46 1EP23IS046 DEXITH C U
19 1EP23IS019 ARUNDATHI R 47 1EP23IS047 DHANUSH G
20 1EP23IS020 ARUN KUMAR B 48 1EP23IS048 DHRUTHI C A
21 1EP23IS021 ARYAN JAISWAL 49 1EP23IS049 DINESH S
22 1EP23IS022 Aryan Singh 50 1EP23IS050 DIVYANJALI YADAV
23 1EP23IS023 B C MOULYA 51 1EP23IS051 Dwarika Somvanshi
24 1EP23IS024 BALAJI C V 52 1EP23IS052 ELEYARAJA R
GANGI REDDY SRAVAN
25 1EP23IS025 BALAJI S 53 1EP23IS053 KUMAR REDDY
26 1EP23IS026 Basagouda Nadagouda 54 1EP23IS054 GAVASKAR RATHOD
27 1EP23IS027 Bharath B S 55 1EP23IS055 Govardhan Reddy MV
56 1EP23IS056 HARSHA VARDHANA P
57 1EP23IS057 Harshith N
58 1EP23IS058 Harshitha R Gowda
59 1EP23IS059 Hema P M
60 1EP23IS060 HERAMBA
61 1EP23IS061 JASHWANTH REDDY T S
62 1EP23IS062 K N HARSHAVARDHANA
63 1EP23IS063 K NITHISH REDDY
SL NO. USN STUDENT NAME 27 1EP23IS153 SHAFIA NIDA

1 1EP23IS127 RAKSHA N N 28 1EP23IS154 SHAIK NAWAZ BASHA

2 1EP23IS128 RAKSHIT K PATIL 29 1EP23IS155 SADDAM HUSSAIN

RAKSHITA VENKATESH 30 1EP23IS156 Shalini AR
3 1EP23IS129
HALLUR
31 1EP23IS157 SHARAN KUMAR
4 1EP23IS130 RAKSHITHA S
32 1EP23IS158 Shoaib S W
5 1EP23IS131 RAKSHITHA L
33 1EP23IS159 SHRAVANI T N
6 1EP23IS132 RAKSHITHA S
34 1EP23IS160 SHREELAKSHMI N
7 1EP23IS133 RAKSHITHA T R
35 1EP23IS161 SHREENIVAS
8 1EP23IS134 RANJITHA S
36 1EP23IS162 Shreya Shetty
9 1EP23IS135 RASHITHA S
37 1EP23IS163 Shreyas H S
10 1EP23IS136 RASHMI M S
38 1EP23IS164 SHREYAS S
11 1EP23IS137 RITESH KUMAR
39 1EP23IS165 SHRODAN B D
12 1EP23IS138 RITISH K
40 1EP23IS166 Sindhu
13 1EP23IS139 ROHITH YADAV D M
41 1EP23IS167 Sneha Shetty
14 1EP23IS140 MAHESH S
42 1EP23IS168 Sowmya A S
15 1EP23IS141 SAGAR G S
43 1EP23IS169 Spandana V
16 1EP23IS142 SAGAR R
44 1EP23IS170 Sujay Singh
17 1EP23IS143 SAHIL GUJAR
45 1EP23IS171 Sumanth B
18 1EP23IS144 SAI SATHWIK YADLAPALLI

19 1EP23IS145 SAMEERA K 46 1EP23IS172 SushantD Patil

20 1EP23IS146 SAMEKSHA 47 1EP23IS173 Susmitha

21 1EP23IS147 SANATH KUMAR A 48 1EP23IS174 T.K.Darshan

22 1EP23IS148 SANDHYA R 49 1EP23IS175 T Priya

23 1EP23IS149 SANJAY S 50 1EP23IS176 Tejas DR

24 1EP23IS150 SANTOSH DUBARI 51 1EP23IS177 Thanu shree N

25 1EP23IS151 SANTHOSH M MADIVALAR 52 1EP23IS178 Vaishnavi D B

26 1EP23IS152 Satyjeet Kumar 53 1EP23IS179 Vaishnavi P

54 1EP23IS180 Veena Vasudeva Vaidya

55 1EP23IS181 VEERENDRA DIDAGUR 60 1EP23IS186 Yashas S H

56 1EP23IS182 Venika A 61 1EP23IS187 YASHASWINI G

57 1EP23IS183 Ventakesh R 62 1EP23IS188 Yashaswini T L

58 1EP23IS184 Vishnu Sai B 63 1EP23IS189 Yeshaasv V

59 1EP23IS185 Vishwas A

Internal and External Marks

 External
Sl.No USN Name Internal Marks Marks
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63 1EP22IS064 Manush R
64 1EP22IS065 Mohammed Sohail
65 1EP22IS066 Moneesh S
66 1EP22IS067 Murali
67 1EP22IS068 Nagamani K N
68 1EP22IS069 Nandini N
69 1EP22IS070 Naveen Kumar K
70 1EP22IS071 Naveen S B
71 1EP22IS072 Pallavi
72 1EP22IS073 Pavan S
73 1EP22IS074 Pavan Kalyan K V
74 1EP22IS075 Pavan Kumar B
75 1EP22IS076 Pavithra M
76 1EP22IS078 Pradeep S
77 1EP22IS079 Prashanth Shetteppanavar
78 1EP22IS080 Prince Kumar
79 1EP22IS081 Prithvi Raj D
80 1EP22IS082 Purushothama Melageri
81 1EP22IS083 Purvika P
82 1EP22IS084 Shiva Shankar Reddy
83 1EP22IS086 Ramya M
84 1EP22IS087 Raunak Jaiswal
85 1EP22IS088 Rohan J
86 1EP22IS089 Rohith S
87 1EP22IS090 Sachidanand Sunny
88 1EP22IS091 Sagar
89 1EP22IS092 Sagar Sahani
90 1EP22IS093 Sahana M S
91 1EP22IS094 Sandhya N
92 1EP22IS095 Sania B
93 1EP22IS096 Saqlain Ulla Shariff N
94 1EP22IS097 Shaik Foujiya
95 1EP22IS098 Shamanth N S
96 1EP22IS099 Sharan Kumar
97 1EP22IS100 Sharan Kumar S A
98 1EP22IS101 Shivaraj Pateel M
99 1EP22IS102 Shravani M R
100 1EP22IS103 Shrihari Mantur
101 1EP22IS104 Sinchana J M
102 1EP22IS105 Sonali B R
103 1EP22IS106 Sreevastsa P
104 1EP22IS107 Sri Devi S S
105 1EP22IS108 Srikanth S
106 1EP22IS109 Srishti
107 1EP22IS110 Suhas H
108 1EP22IS111 Sunitha Seervi
109 1EP22IS112 Tarun M
110 1EP22IS113 Utsav Gond
111 1EP22IS114 VaibhaV Reddy Patil
112 1EP22IS115 Varsha K
113 1EP22IS116 Varshitha R
114 1EP22IS117 Varshitha Reddy M
115 1EP22IS118 Vidhya Shree
116 1EP22IS119 Vignesh S R
117 1EP22IS120 Vimal
118 1EP22IS121 Vishwa Aradhya S M
119 1EP22IS122 Vivek A N
120 1EP22IS123 Vyshnavi N
121 1EP22IS124 Y M Ullas
122 1EP22IS125 Yashaswini N
123 coc&COB Mohammed Tanzeem
124 DIP Jayanth Gowda SN
125 DIP Chethan C Pateel