Tula's Institute, Dehradun

(Affiliated to Uttarakhand Technical University)

Dhoolkot, Chakrata Road, Dehradun-248011, Uttarakhand

COURSE RECORD

Academic Year 2018 -2019 (Even)

Faculty Name:

Course Title: Advanced Computer Networks (MCA 715)

Semester: Fourth

Department: Computer Application

Tula's Institute, Dehradun Page1

 CONTENTS
1. Institute Vision & Mission i

2. Department Vision & Mission ii

3. Academic Calendar iii

4. PEO, PO, PSO iv

5. Course Learning Objectives & Course Outcomes 1

6. Course Syllabus 2

7. CO-PO Mapping 3

8. Individual Time Table 4

9. Students Name List 5

10.Lecture Plan 6

11.Summary of Compensatory /Extra Classes Taken 10

12.Effectiveness of Lecture Plan Delivery 11

13.Question Bank& Previous University Question Papers (Filed Separately) 12

14.Assignment Questions 13

15.Continuous Internal Evaluation 13

16. Audit of Evaluated Papers 21

17. Result Analysis 22

18.Remedial Class Attendance 25

19.Attendance Register 27

Tula's Institute, Dehradun Page2

 Institute Vision & Mission
Vision:

To emerge as an academic center producing world class professionals

promoting innovation and research.

Mission:

M1: Promote intellectual and skilled human capital generating employment and
entrepreneurship.
M2: Be educational center of excellence of multi ethnicity and diversity.
M3: Establish as technology driven teaching learning institution.
M4:Provide world class platform for research and innovation.
M5: Inculcate social, environmental, heritage values

Department Vision & Mission

Tula's Institute, Dehradun Page3
 Vision:

To become center of excellence in teaching and research.

Mission:

DM1 Induce ethical values and spirit of social commitment.

DM2 Provide a learning ambience to enhance innovations and problem solving
Skills.
DM3 To provide a comprehensive education, benchmarked against the
highestglobal standards.
DM4 Collaborate with software industry and adopting technology for achieving
qualityof technical education.
DM5 Promote research based projects/activities in the emerging areas of
technology convergence.

Tula's Institute, Dehradun Page4

 ACADMIC CALANDER

Programme Educational Objectives (PEOs):

The program educational objectives are set in line with Institutional and Departmental
mission statements. The program educational objectives of MCA are to produces the

Tula's Institute, Dehradun Page5

programmer, developer and academicians who later take the responsibility as professionals in
particular field and with following qualities:

PEO1. Apply basic knowledge of Computer Technology, Networking, Web Development,

Software Testing, Computing Algorithms, Database Handling, Distributed System
configuration and interdisciplinary problems and find their solution related the
subject’s matter.

PEO2. Demonstrate the application of industrial practices and principles through

development of innovative products that are of beneficial for the Industries as well
as human welfare and the nation.

PEO3 Exhibit skills of designing and production of different products based on principles
of Computer Science.

PEO4 Exhibit strong, independent learning, analytical and problem-solving skills with
special emphasis on design, communication, and ability to work in teams.

PEO5. To pursue higher education and research in this reputed our institute at national and
international importance by level quality teaching and its accountability.

Program Outcomes (POs):

In addition to PEOs, the Master in Computer Application program established a set of

Program Outcomes (POs), expected to be met by every post-graduating student from the
program at the time of his/her post-graduation.
The Post -Graduates of MCA will have aptitude of:
PO1. Computer Application majors will gain proficiency in basic laboratory techniques
in both Hardware and Software, and be able to apply the mathematical method to
the processes of development and software testing.

PO 2. Senior System Analyze majors will be able to demonstrate an understanding of

fundamental of development, such as the structure/function of programming,
configuration of software instalment, and the regulation of industry processes.

PO 3. Students in the computer science majors will be able to apply and effectively
communicate practical knowledge and development methodology and data
analysis in both written and oral forums.
Students will be able gathering information, design, programming, testing,
PO 4.
configuration and installation for investigating complex problems in the software
industries.
Students will be able to decide and apply appropriate tools and techniques.
PO 5.
Students will be able to justify conceptual and application-oriented skills of IT
PO 6.
Application in Business context practices.

Tula's Institute, Dehradun Page6

 Students will be able to understand the need and impact of IT solutions on for
PO 7.
societal context keeping in view need for sustainable solution.
Use the techniques, skills and modern to develop and manage policies to
PO 8.
organizations’ IT system.
In-depth knowledge and sustained learning leading to innovation to fulfil global
PO 9.
design system, components or processes to meet realistic needs of society and
industries.
Recognize the need for and an ability to manage in long time solution of problem.
PO 10
Acquire knowledge of contemporary issues.
PO 11
Students will be able to demonstrate knowledge of project and finance
PO l2
management when dealing with Software products problems.

Program Specific Outcomes (PSOs):

Program Specific Outcomes for Bachelor in Computer Application set by Faculty in the
Department of Computer Science are as follows:

Demonstrate proficiency in software design and foundation of the concerned

PSO 1.
courses.

Demonstrate a working knowledge of program development and solution of

PSO 2.
problem for the industrial applications and human welfare.

Demonstrate the application in software practically at industries label and

PSO 3. designing, of new products developments and providing solutions for
product/processes/technology.

Course Learning Objectives:

Tula's Institute, Dehradun Page7

The primary objective of this course is tomake student familiar with the key concept behind
the algorithms, why the analysis of algorithm is required and based on that analysis how
effective algorithms can be designed and the real world impact of these algorithms.

Course Outcomes:

CO Description BLOOMS Module

TAXONOMY
CO1: To make student familiar with basic concept of analysis 3, 4 1
of algorithm and apply these algorithms with the
respective problem.
CO2 To analyze the use of Advanced Data Structure 3,4 2
algorithms and apply these algorithms in real world
problem
CO3: To analyze and apply the advanced analysis algorithm 3,4 3
like dynamic programming etc.
CO4: To apply and analyze the different graph algorithms and 3,4 4
it’s applicability in real world problem
CO5: To analyze the advanced algorithms and their uses in 3,4 5
real world problem

COURSE SYLLABUS

Tula's Institute, Dehradun Page8

 MCA 302: ANALYSIS AND DESIGN OF ALGORITHM
L T P C
3 1 0 4

MODULES Lectures Levels

MODULE 1: 10 L L3
Introduction:
Algorithms, Analysis of algorithms, Design of Algorithms and Complexity
of Algorithms, Asymptotic Notations
Growth of function, Recurrence Sorting in polynomial Time: Insertion sort,
Merge sort, Heap sort, and Quick sort Sorting in Linear Time: Counting
sort, Radix Sort, Bucket Sort, Medians and order statistics.

MODULE 2: 10 L L4
Advanced Data Structure: Red-Black Trees, Augmenting Data Structure.
B Trees, Binomial Heaps, Fibonacci Heaps, Data Stricture for Disjoint
Sets.

MODULE3: 10 L L3
Advanced Design and Analysis Techniques: Dynamic programming,
Greedy Algorithm, Backtracking, Branch-and-Bound, Amortized Analysis

MODULE 4: 9L L6
Elementary Graph Algorithms, Breadth First Search, Depth First Search,
Minimum Spanning Tree, Kruskal’s Algorithms, Prim’s Algorithms, Single
Source Shortest Path, All pair Shortest Path, Maximum flow and Traveling
Salesman Problem.

MODULE 5: 8L L4
Randomized Algorithms, String Matching, NP-Hard and NP-Completeness,
Approximation Algorithms.

Text Books
1. Patrick Naughton and Herbert Schildt: The Complete Reference Java, Latest Edition, Tata
McGraw-Hill.

References
1. Hans Bergstan: Java Server Pages.
2. Bill Siggelkow, S P D O’Reilly: Jakarta Struts, Cookbook.
3. Murach: Murach’s beginning JAVA JDK 5, SPD

CO PO MAPPING
Tula's Institute, Dehradun Page9
 PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3 2 1 1 2 1 0 0 0 0 1 2

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

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

CO4 2 2 2 1 2 1 0 0 1 2 2 2

CO5 2 2 0 0 0 1 0 0 0 1 1 2

13/15 11/15 7/15 4/15 8/15 5/15 0/15 0/15 3/15 4/15 8/15 10/15

88 73 46 26 53 33 0 0 20 26 53 61

3 2 1 0 1 1 0 0 0 0 1 2

1- LOW45-59
2-MODERATE 60-75
3-HIGH76-100

Tula's Institute, Dehradun Page10

 TULA'S INSTITUTE, DEHRADUN
(Affiliated to MG Uttarakhand Technical University)
Dhoolkot,, Chakrata Road, Dehradun-248011, Uttarakhand
INDIVIDUAL TIME TABLE

Faculty: Department:Computer Application Academic Year:2018-2019

Time 9:45-10-35 10:35-11:25 11:25-12:15 12:15-01:05 01:05-01:45 01:45-02:35 02:35-03:25
Day
Course: MCA302
Monday Class: L
Room: H403
Course:
Tuesday Class:
Room:
Course: MCA302
Wednesday Class: L
Room: H403
Course: MCA302
Thursday Class: L
Room: H403
Course: MCA302
Friday Class: L
Room: H403
Course:
Saturday Class:
Room:
Signature of HOD with date & seal: …………………………..

Tula's Institute, Dehradun Page11

 STUDENT NAME LIST

SNo ID Number NAME 42.

. 43.
1. Ravi Kumar 44.
2. Subodh Dhyani 45.
3. Shubham Singh Chauhan 46.
4. Muin Alam 47.
5. Pawan Singh Chauhan 48.
6. Deepander Sharma 49.
7. Ankit Singh 50.
8. Farhad Alam Ansari 51.
9. Deepanshi Chaudhary 52.
10. Sanjana Saini 53.
11. Tushar Agrawal
54.
12. Yogesh Bhatt
55.
13. Shivam Pandith
56.
14. Rahul Bisht
57.
15. Priyanshu Tayal
58.
16. Danish
59.
17. Shubham Jugran
60.
18. 61.
19. 62.
20. 63.
21. 64.
22. 65.
23. 66.
24. 67.
25. 68.
26. 69.
27. 70.
28. 71.
29. 72.
30. 73.
31. 74.
32. 75.
33.
34.
35. Signature of
36. HOD……………………………….
37.
38.
39.
40.
41.

Tula's Institute, Dehradun Page 12

 LECTURE PLAN
Course Name:………………… Course Code: …………………….
Lecture Plan Lecture Delivered
No Date LP Topic Date Methodology
No.
1. 16-Aug-18 MODULE 1:
L-1
Introduction about algorithm
2. 17-Aug-18
L-2 Complexity Analysis

3. 20-Aug-18
L-3 Asymptotic notations

4. 22-Aug-18
T1 Asymptotic notations

5. 23-Aug-18
L-4 Recurrence relation

6. 24-Aug-18
L-5 Insertion sort, Merge sort

7. 27-Aug-18
L-6 Heap sort

8. 29-Aug-18
L-7 Quick sort

9. 30-Aug-18
L-8 Liner time sorting

10. 31-Aug-18
L-9 Counting sort

11. 5-Sep-18
L-10 Radix sort

12. 6-Sep-18
L-11 Bucket sort

13. 7-Sep-18 MODULE 2:

T2
B Trees
14. 10-Sep-18
L-12 Red Black Tree

15. 12-Sep-18 L-13

Augmenting Data Structure

16. 13-Sep-18
L-14 Binomial Heaps

Tula's Institute, Dehradun Page 13

 17. 14-Sep-18
Fibonacci Heaps
L-15
18. 17-Sep-18
L-16 Data Structure

19. 19-Sep-18
L-17 Disjoint Sets

20. 20-Sep-18
T3 Class test 1

21. 21-Sep-18 L-18 MODULE 3:

Dynamic Programming
22. 24-Sep-18 L-19
Greedy Algorithms

23. 26-Sep-18 T4
Greedy Algorithms

24. 3-Oct-18
L-20 Greedy Algorithms

25. 4-Oct-18 L-21

Backtracking

26. 5-Oct-18 L-22

Branch and Bound

27. 8-Oct-18
T5 Branch and Bound

28. 10-Oct-18 L-23

Amortized analysis

29. 15-Oct-18 MODULE 4:

L-24
Elementary Graph
30. 17-Oct-18 L-25
BFS

31. 22-Oct-18 L-26

DFS

32. 24-Oct-18 T6
BFS, DFS

33. 25-Oct-18 L-27

Minimum spanning tree

34. 26-Oct-18 L-28

Kruskal’s Algorithm

Tula's Institute, Dehradun Page 14

 35. 29-Oct-18 L-29
Prims Algorithm

36. 31-Oct-18 L-30

Single Source Shortest Path

37. 1-Nov-18
T7 Spanning Tree and Graph Algorithms

38. 2-Nov-18 L-31

All Pair shortest path

39. 5-Nov-18
L-32 Maximum flow

40. 12-Nov-18
L-33 Traveling salesman problem

41. 14-Nov-18 MODULE 5:

L-34
Randomized algorithm
42. 15-Nov-18
L-35 String Matching

43. 16-Nov-18
L-36 NP Problem

44. 19-Nov-18
L-37 NP Problem

45. 21-Nov-18
L-38 Approximation Algorithms

46. 22-Nov-18
T8 NP Problem

47. 23-Nov-18
L-39 Class Test 2

Total Classes Planned: 39L + 8 T = 47 Delivered:

Signature of HOD with date & seal……………………………………………..

Summary of Compensatory & Extra Classes Taken

Extra Class Leave Details
SNo Month Date of
Date of
Date LP No. Compensatory LP No.
CL/EL/OD
Class taken

Tula's Institute, Dehradun Page 15

 1. August
2.
3.
4.
5.
6.
7.
8. September
9.
10.
11.
12.
13.
14.
15. October
16.
17.
18.
19.
20.
21.
22. November
23.
24.
25.
26.
27.
28.
29.
30.
Signature of Faculty………………… Signature of HOD……………………………

Effectiveness of Lecture Plan Delivery

Tula's Institute, Dehradun Page 16
Course Name:…………………………………
Course Code:……………………………………..

Module Planned Hours Actual Hours Strike Rate

(Planned Hours/Actual Hours)
L
1
T
2 L
T
3 L
T
4 L
T
5 L
T
6 L
T
7 L
T
8 L
T

L
Total
T

Signature of Faculty………………………..SignatureHOD…………………………………………

Question Bank
MODULE 1. [CO1 , L3, L4]
1. Define Algorithm.
2. Write a short note on Algorithm Design and Analysis of Process.
3. What are the 2 kinds of Algorithm Efficiency?
4. How can you specify Algorithms?
5. What is Pseudo Code?
Tula's Institute, Dehradun Page 17
6. What is Sorting Problem?
7. What is Stable Sorting Algorithm?
8. What is Non-Stable Algorithm?
9. What is Searching Problem?
10. Differentiate between Recursion and Iterative way of writing a program.

MODULE 2[CO2 , L3, L4]

11. Define Red black tree.

12. Prove that any red black tree at least half the nodes on any path from the root to a leaf must be black.
13. Prove that any red black tree, no path from any node, N to a leaf is more than twice as any other path
from N to any other leaf.
14. Show the tree that results from inserting the values 2, 1,4,5,9,2,6,7 into an initially empty red black tree.
Show the tree after each insertion. Do this using both bottom up and top down insertion.
15. What is the output of the following code.
intmyfun(heap_arr[])
{
int mini=INF;
for(int i=0;i<tot_node;i++)
mini=min(mini,heap_arr)
return mini;
}

16. Explain the possible AVL rotations with algorithm and example.
17. Explain insertion and deletion operations on Fibonacci heap.
18. Construct a B-tree with order m=3 for the key values 2,3,7,9,5,6,4,8,1 and delete the values 4 and Show
the tree in performing all operations.
19. How Fibonacci heaps differ from binomial heap?

MODULE 3[CO3 , L3, L4]

20. Distinguish between greedy algorithm and dynamic programming.

21. State any three applications of binary search tree.
22. How does heap sort is better than other sorting algorithms for large number of given elements?
23. Discuss in detail about backtracking with an example.
24. Give an example, to illustrate the concept of dynamic programming.
25. Give an example to illustrate the use of greedy approach.

MODULE 4[CO4, L3, L4]

26. What is Graph Problem?

27. What is Combinatorial Problem?
28. Differentiate Time Efficiency and Space Efficiency?
29. Define graph mapping.

Tula's Institute, Dehradun Page 18

30. Explain in detail time analysis of Binary Search Tree operations with an example.
31. Discuss the various methods which used to find the spanning tree with suitable example.
32. Discuss the single source shortest path algorithm in detail.
33. Discuss all pair shortest path with suitable example.
34. Discuss traveling salesman problem in detail.
35. Discuss BFS and DFS in detail.

MODULE 5[CO5, L3, L4]

36. How many comparisons do we need to find the top two largest numbersin a sequence ofndistinct
numbers?
37. If random number generation algorithm, pass many Test, but do not pass monobit Test. randomness is
accepted or rejected.
38. Discuss NP, NP complete, NP Hard problem in detail.
39. Discuss the string matching algorithm with suitable example.
40. Discuss topological shorting process in detail

Tula's Institute, Dehradun Page 19

 Previous University Question Papers

Assignment No01

Given Date: 29-Aug-2018

Submission Date: 5-Aug-2018

Q Questions [CO1] 5 Marks Blooms

No. Level
1 Why analysis of algorithm is required? Discuss space and time complexity in detail. L3
2 Discuss master theorem in detail. L4
3 Discuss recurrence relation in detail? L4
4 Discuss radix and bucket short algorithm is detail. L4

Tula's Institute, Dehradun Page 20

 5 Given any two functionsf(·) andg(·), show thatf(n) +g(n) = Θ(max{f(n),g(n)}) L3

Faculty Signature…………… HOD Signature………………

Assignment No 02

Given Date: 24-Sep-2018

Submission Date: 3-Oct-2018

Q Questions [CO2, CO3] 10 Marks Blooms

No. Level
1 Given the following BST, show its value after deleting 95. L3

95
/ \
40 113
/ \ / \
15 42 110 125
/ \
41 112 L4

2 Question: Given the following array that represents a heap,

show the value of the heap after removing an element:

-- 20 12 18 7 3 6 4

3 Show the red-black trees after successively inserting the keys 41, 38, 31, 12, 19, 8 into L4
and initially empty red-black tree

4 How Fibonacci heap is different from binary Heap? Discuss with suitable example. L4

5 Discuss max and min heap in detail. L3

Faculty Signature…………… HOD Signature……………

Assignment No. 03

Given Date:24-Oct-18Submission Date:1-Nov-18

Q Questions [CO3, CO4] 10 Marks Blooms

No. Level

Tula's Institute, Dehradun Page 21

 1 Discuss how Dynamic programming approach is different form greed algorithm. L3
2 Discuss the branch and bound technique with suitable example. L3
3 Discuss the type of backtracking problem in detail. L3
4 By giving a suitable example discuss the single source shortest path and all pair shortest L3
path problem.

5 Discuss the traveling salesman problem with suitable example. L3

Faculty Signature…………… HOD Signature……………

Assignment No:04

Given Date: 14 Nov 18Submission Date: 23 Nov 18

Q Questions [CO4, CO5] 10 Marks Blooms

No. Level
1 Discuss string matching algorithm with suitable example. L3
2 By using a suitable example discuss the BFS algorithm. Also discuss where BFS L4
algorithm is applicable in real world scenario.

3. Discuss the DFS algorithm and it’s applicability in detail. L4

4. What is spanning tree? Discuss all the suitable method for obtaining the spanning tree L4
from the graph with suitable example.

Faculty Signature…………… HOD Signature…………

CONTINUOUS INTERNAL EVALUATION

Scheme of Evaluation ………….Internal Assessment
Course Name: ANALYSIS AND DESIGN OF ALGORITHMCourse Code: MCA 302

Tula's Institute, Dehradun Page 22

QNo. Question Marks

Attempt all questions. (2.5X4= 10)

Q1 a. Explain the case complexity in algorithm? [L3]

b. Why analysis of algorithm is required? Justify your answer with suitable example.
[L3]
c. In what ways an algorithm can be design? Discuss. [L3]
d. Explain the time complexity of insertion sort and write an algorithm for sorting
the data using insertion sort? [L3]
Q2 (2.5X4= 10)

a. What are the different methods of solving recurrences? Discuss in detail. [L4]
b. Explain the quick sort with the help of an example. [L4]
c. Illustrate the operation of heap-sort in the array A=(19,13,21,25,73,17,20,8,4) [L3]
d. Using merge sort algorithm sort the following elements:21,15,3,18,6,45,22 [L3]
Q3 (5X2=10)

a. Solve T (n) =3T(n4)+nlogn by master method? [L4]

b. Analyse the merge sort with the help of an example? [L4]

QNo. Solution Marks

Tula's Institute, Dehradun Page 23

Faculty Signature…………… HOD Signature………………

CONTINUOUS INTERNAL EVALUATION

Tula's Institute, Dehradun Page 24

 Scheme of Evaluation ………….Internal Assessment
Course Name: ANALYSIS AND DESIGN OF ALGORITHM Course Code: MCA 302
Q Question Marks
No
.
All questions are compulsory. (2.5*4=10)

Q1
a. Diffentiate divide &conquer and greedy algorithm with the help of an
example  [L4].
b. Discuss the various properties of binary search?[L4]
c. Discuss different rules of insertion in a red – black tree. [L4]
d. Discuss the properties of binomial heap with suitable examples. [L4]

Q2
.
a. Diffentiate between the knapsack and fractional knapsack problem. (2.5*4=10)
b. Analyze the travelling salesman problem with the help of an example.
c. Discuss the properties of dynamic programing paradigm in detail.
d. Find out the longest common subsequence.
X= abaaba
Y= babbab

Q3
. (5*2=10)

a. Compute the minimum spanning tree of the graph below  using [L4]
(i)Kruskal’s method
(ii)Prim’s method

b. Construct each step during insertion and creation of red-black tree result after
successively inserting the keys 41,38,31,12,19,8 in an initially empty red black tree
.show all rotations and red colouring at each step. [L5]

Q Solution Marks
No

Tula's Institute, Dehradun Page 25

.

Faculty Signature…………… HOD Signature………………

Tula's Institute, Dehradun Page 26

 RESULT ANALYSIS - 1
Faculty………………… Course Name: ANALYSIS AND DESIGN OF ALGORITHM
Course Code: … MCA 302……….Section
Total
Grade
No Student ID Student Name T1 T2 Avg Quiz Assn CIE SEE (CIE+
/Class
SEE)
1. 170120600001 Abhishek Purohit 30 26 28 10 10 48 61 109 FC
2. 170120600002 Benin P John. 29 29 29 10 10 49 55 104 FC
3. 170120600003 Nikhil Kamboj 16 24 20 5 5 30 60 90 FC
4. 680120600002 Himanshu Ranjan 20 24 22 4 4 30 33 63 -
5. 680120600003 Jitendra Kumar 18 22 20 8 5 33 32 65 -
6. 680120600004 Md. Izhar 15 13 14 8 8 30 56 86 SC
7. 680120600005 Pinky Nishad 22 18 20 10 7 37 47 84 SC
8. Vipul Kumar 15 25 20 9 10 39 35 74 SC
680120600006
Chauhan
9. 680120600007 Vishvas Shukla 22 28 25 9 5 39 50 89 SC
10. 680120600008 Waseem 21 19 20 7 6 33 49 82 SC
11.
12.
13.
14.
15.
16.
17.
18.
19.
Faculty Signature……………………………………………Signature of HOD…………………………

Tula's Institute, Dehradun Page 27

 RESULT ANALYSIS – 2
(Academic Year: …2018-2019)

Faculty: ………………… Course Name: ANALYSIS AND DESIGN OF ALGORITHM

Course Code: ……MCA302……..

Total Students:10Total No. Male: …09… Total No. Female: 01

Student Feedback: ……………………………….

SNo Regular Lateral Entry Detained/Readmitted

Details
. M F M F M F

1 Total No. of Students 9 1

2 No. of Students Appeared 9 1

3 No. of Students Absent NA NA

4 Pass 9 1

5 Fail 0 0

6 FCD 0 0

7 FC 3 0

8 SC 4 1

9 % of pass 100 100

10 Total % of Pass 100

Total % of Pass after
11
remedial class

Remedial Class Attendance

Faculty: …………………… Course Name:

Course Code:……………..
Tula's Institute, Dehradun Page 28
 Univ
SNo SID Name Marks
1 2 3 4 5 6 7 8 9 10
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.

Faculty Signature: HOD Signature:

Tula's Institute, Dehradun Page 29

 TULA’S INSTITUTE, DEHRADUN

SN Student ID Student Name

o
01 170120600001 Abhishek Purohit
02 170120600002 Benin P John.
03 170120600003 Nikhil Kamboj
04 680120600002 Himanshu Ranjan
05 680120600003 Jitendra Kumar
06 680120600004 Md. Izhar
07 680120600005 Pinky Nishad
08 680120600006 Vipul Kumar Chauhan
09 680120600007 Vishvas Shukla
10 680120600008 Waseem

Tula's Institute, Dehradun Page 30

 TULA’S INSTITUTE, DEHRADUN

Tula's Institute, Dehradun Page 31

 TULA’S INSTITUTE, DEHRADUN

SN Student ID Student Name

o
1
2
3
4

Tula's Institute, Dehradun Page 32

 TULA’S INSTITUTE, DEHRADUN

Tula's Institute, Dehradun Page 33

 TULA’S INSTITUTE, DEHRADUN

Tula's Institute, Dehradun Page 34