LOVELY PROFESSIONAL UNIVERSITY
Academic Task No.
School of Computer Applications
2 __
Faculty of Technology & Sciences
Name of the faculty member : Dr S Jahangeer
Course Code: CAP 267
Course Title: Data Structure
Program: BCA/MCA
Term: 20212
Max. Marks: 30
Is Rubric Applicable: NA
Date of Allotment: 24-3-2021
Date of Submission: 26-03-2021
Important Guidelines:
1. All questions in this Academic Task are compulsory.
2. It is mandatory to attempt all questions of the assignment in your own handwriting on A4 size
sheets/pages with a blue colour ink pen. Any other mode of attempt (typed or printed codes or table)
except hand written/drawn will not be accepted/considered as valid submission(s) under any
circumstances.
3. Every attempted sheet/page should carry clear details of student such as Name, Registration number,
Roll number, Question number and Page number. The page numbers should be written clearly on the
bottom of every attempted sheet in a prescribed format as: for page 1; Page 1 of 4, for page 2; Page 2 of
4, for page 3; Page 3 of 4 and for page 4; Page 4 of 4, in case your assignment/document is of 4 pages.
4. After attempting the answer(s), student needs to take photograph of each of these answer sheets/pages
and needs to convert the jpeg format images into a sequential single pdf format document (can be done
with many free online available converters).
5. This PDF file should be uploaded onto the UMS interface on or before the last date of the submission.
6. Refrain from indulging into plagiarism as copy cases will be marked zero.
Set:-1
S.
No.
Roll No.
List
attached
1
Objectives of
Academic Activity
1. understand how
basic
data
structures are
represented in
memory
2. demonstrate
different
Topic/Question
Details
1. What are the
advantages of
using linked
list over array
and
vice
versa, explain
with suitable
examples
Evaluation
Parameters




Logic
Effectiveness
towards
the
solution
Originality
Formatting
Expected
Outcomes
1.
Student will
learn about
traversing,
inserting, and
deleting
elements in
linked list.
3.
List
attached
1.
2
2.
3.
List
1.
attached
3
2.
3.
methods
for
linked lists.
apply
appropriate
data structures
to solve real
world problems
efficiently
understand
1. Explain why
how basic data
Stack is a
structures are
recursive
represented in
data
memory
structure
demonstrate
using
different
suitable
methods stack
example.
apply
appropriate
data structures
to solve real
world
problems
efficiently
apply
1. what
is
appropriate
queue? List
data structures
some real-life
to solve real
examples of
world problems
queue.
efficiently
demonstrate
different
methods queue
apply
appropriate
data structures
to solve real
world problems
efficiently








Student
will
learn
about
inserting and
deleting
elements from
stack
using
sequential
representation
Logic
1.
Effectiveness
towards
the
solution
Originality
Formatting
Logic
Effectiveness
towards
the
solution
Originality
Formatting
1.
Student will
learn about
inserting and
deleting
elements
from queue
using
sequential
representatio
n
Set:-2
S.
No.
Roll No.
1
List
attached
Objectives of
Academic Activity
Topic/Question
Details
1.
Describe
the
1. understand
algorithm to
how basic data
pint the data
structures are
Evaluation
Parameters
Expected
Outcomes
1.
Student
will
learn
about
traversing,
2.
3.
List
attached
1.
2
2.
3.
List
attached
1.
3
2.
3.
values from a
represented in
circular
memory
linked list.
demonstrate
different
methods for
linked lists.
apply
appropriate
data
structures to
solve
real
world
problems
efficiently
understand
1. Describe the
how basic data
algorithm to
structures are
find
the
represented in
frequency of
memory
odd numbers
demonstrate
from a stack
different
using stack’s
methods stack
rules only.
apply
appropriate
data
structures to
solve
real
world
problems
efficiently
understand
1. Describe the
how basic data
algorithm to
structures are
implement
represented in
the concept
memory
of
doubly
demonstrate
linked list
different
with suitable
methods
explanation.
queue
apply
appropriate
data
structures to
solve
real
world
problems
efficiently
inserting, and
deleting
elements
in
linked list.
Student
will
learn
about
inserting and
deleting
elements from
stack
using
sequential
representation
1.




Logic
Effectiveness
towards
the
solution
Originality
Formatting
1.
Student will
learn about
inserting and
deleting
elements
from queue
using
sequential
representatio
n
Set:-3
S.
No.
Roll No.
List
attached
1
List
attached
2
List
attached
3
Objectives of
Academic Activity
Topic/Question
Details
1. Describe the
1. understand
algorithm to
how basic data
delete
a
structures are
particular
represented in
node (on the
memory
bases of data
2. demonstrate
item) from a
different
circular
methods for
linked list.
linked lists.
3. apply
appropriate
data
structures to
solve
real
world
problems
efficiently
1. understand
1. Describe the
how basic data
algorithm to
structures are
represent
represented in
stack using
memory
linked list.
2. demonstrate
Also
different
describe the
methods stack
advantages
3. apply
with
such
appropriate
approach.
data
structures to
solve
real
world
problems
efficiently
1. understand
1. Describe the
how basic data
algorithm to
structures are
represent
represented in
linked list.
memory
Also
2. demonstrate
describe the
different
advantages
Evaluation
Parameters
Expected
Outcomes
Student
will
learn
about
traversing,
inserting,
and
deleting
elements
in
linked list.
1.




1.
Student
will
learn
about
inserting and
deleting
elements from
stack
using
sequential
representation
1.
Student
will
learn
about
inserting and
deleting
elements from
queue
using
sequential
Logic
Effectiveness
towards
the
solution
Originality
Formatting
methods
queue
3. apply
appropriate
data
structures to
solve
real
world
problems
efficiently
with
such
approach.
representation
Set:-4
S.
No.
Roll No.
List
attached
1
List
attached
2
Objectives of
Academic Activity
Topic/Question
Details
1. Describe the
1. understand
algorithm to
how basic data
delete
a
structures are
particular
represented in
node (on the
memory
bases of data
2. demonstrate
item) from a
different
circular
methods for
linked list.
linked lists.
3. apply
appropriate
data
structures to
solve
real
world
problems
efficiently
1. understand
1. Describe the
how basic data
algorithm to
structures are
solve postfix
represented in
notation’s
memory
expression.
2. demonstrate
Also explain
different
the
same
methods stack
with
3. apply
example
appropriate
data
structures to
solve
real
world
Evaluation
Parameters




Logic
Effectiveness
towards
the
solution
Originality
Formatting
Expected
Outcomes
1.
Student
will
learn
about
traversing,
inserting, and
deleting
elements
in
linked list.
1.
Student
will
learn
about
inserting and
deleting
elements from
stack
using
sequential
representation
List
attached
3
problems
efficiently
1. understand
1. Describe the
how basic data
algorithm to
structures are
implement
represented in
insertion a
memory
node
into
2. demonstrate
circular
different
linked
list
methods
according to
queue
the value in
3. apply
a
sorted
appropriate
valued
data
queue.
structures to
solve
real
world
problems
efficiently
1.
Student
will
learn
about
inserting and
deleting
elements from
queue
using
sequential
representation
Set:-5
S.
No.
1
2
Roll No.
Objectives of
Academic Activity
Topic/Question
Details
1. Describe the
List
1. understand
algorithm to
attached
how basic data
add a node
structures are
(on the bases
represented in
of data item)
memory
in a circular
2. demonstrate
linked list.
different
methods for
linked lists.
3. apply
appropriate
data
structures to
solve
real
world
problems
efficiently
List
1. understand how
1. Describe the
attached
basic
data
algorithm to
structures are
find
the
represented in
frequency of
memory
Evaluation
Parameters




Logic
Effectiveness
towards
the
solution
Originality
Formatting
Expected
Outcomes
1.
Student
will
learn
about
traversing,
inserting, and
deleting
elements
in
linked list.
1.
Student
will
learn
about
inserting and
deleting
elements from
3
2. demonstrate
different
methods stack
3. apply
appropriate
data structures
to solve real
world problems
efficiently
List
1. understand
attached
how basic data
structures are
represented in
memory
2. demonstrate
different
methods
queue
3. apply
appropriate
data
structures to
solve
real
world
problems
efficiently
prime
numbers
from a stack
using stack
rule.
1. Describe the
algorithm to
find
the
frequency of
prime
numbers
from
a
queue using
queue rule.
stack
using
sequential
representation
1.
Student
will
learn
about
inserting and
deleting
elements from
queue
using
sequential
representation
Student Roll numbers with Set number Detail
Set No
Name
RollNumber
1
Prashant Kholiya
RD1906A01
2
Arnav Dhoundiyal
RD1906A02
3
Deshmukh Kirti Vijay
RD1906A03
4
Sharib Hayat
RD1906A04
5
Bandgi Kaur
RD1906A05
1
Abdul Haseeb
RD1906A06
2
Mula Pradeep
RD1906A07
3
Ashmeet Singh
RD1906A08
4
Naman Kumar
RD1906A09
5
Akash Kumar Gautam
RD1906A10
1
Sai Chandu Boya
RD1906A11
2
Nitika
RD1906A12
3
Vishal Kumar Choudhary
RD1906A13
4
Anshul Sharma
RD1906A14
5
Ankit Kumar Pathak
RD1906A15
1
Vishal Kumar Kanaujia
RD1906A16
2
Pranshu Singh
RD1906A17
3
Duodu Lawrence
RD1906A18
4
Saprava Roy
RD1906A20
5
Rahul Sharma
RD1906A21
1
Winner Le Paradoxe Konou
RD1906A22
2
Martin Mundu
RD1906A23
3
Emil Entsie
RD1906A24
4
Mohammad Shakhawat Hossain
RD1906A25
5
Saurav Kumar
RD1906A26
1
Ashmit Chaudhary
RD1906A27
2
Nakade Pooja Balu
RD1906A28
3
Engole Pratiksha Pandit
RD1906A29
4
Shlok Paliwal
RD1906A30
5
Rakesh
RD1906A31
1
Nidhi Prakash
RD1906A32
2
Avishek Pandey
RD1906A33
3
Jeevan Prakhar Singh
RD1906A34
4
Abdul Basit
RD1906B35
5
Prachi Nadar
RD1906B36
1
Dharmveer Yadav
RD1906B37
2
Lanka Srinivas Sai Manikanta Saketh
RD1906B38
3
Chavan Mahesh Anil
RD1906B39
4
Abdul Samim Istalifi
RD1906B40
5
Abhay
RD1906B41
1
Mukkera Goutham
RD1906B42
2
Damini
RD1906B43
3
Samuel Addae
RD1906B44
4
Mohammad Monjurul Haque Fahim
RD1906B45
5
Shah Shabbir Ahmmed
RD1906B46
1
Shahab Uddin Ishaq
RD1906B47
2
Antwi Nathaniel Koranteng
RD1906B48
3
Ramisetty Venkata Pavansai
RD1906B49
4
Walakada Athawudage Pubudika Madhushi Weerasinghe
RD1906B50
5
Akash Shrihari Wandhare
RD1906B51
1
Rahul Pandey
RD1906B52
2
Kariyawasam Narigama Gamage Nipuni Sandeeka Kariyawasam
RD1906B53
3
Hamidullah Aminzai
RD1906B54
4
Ranjit Barman
RD1906B55
5
Shashank Kumar Rao
RD1906B56
1
Md Redwanul Hoque
RD1906B57
2
Aimal Amiri
RD1906B58
3
Prince Charles Allotey
RD1906B59
4
Samandar Amiri
RD1906B60
5
Ashish Tomar
RD1906B61
1
Aditya Srivastava
RD1906B62
2
Akash Choudhary
RD1906B63
3
Shayali Verma
RD1906B65
4
Shivani Akhtar
RD1906B66
5
Murtaza Ahmad Sunan
RD1906B67
1
Samiul Haque
RD1906B68
2
Gayam Samara Simha Reddy
RD1906B69