|
AIOU |
Course:
Data Structure (3408)
Level: B.S (CS) Semester: Spring, 2015
Total Marks: 100 Pass Marks: 50
ASSIGNMENT
No. 1
Note:
All questions carry equal marks.
number is a prime numberor not.
different operations (Insert, Delete and Search) on
both array’s.
the example of
place and serve operations.
c) Write
an Algorithm of data insertion and deletion into
expression by usingthe Stack.
a) 9+3*4/7-10
b) (A+B)*((D-E)+F)-G
ASSIGNMENT
No. 2
Total Marks: 100 Pass Marks: 50
Note:
All questions carry equal marks.
serve model and
how we can fix this?
ans: Disadvantage of Single Step Append-Serve Model Although time efficiency
of single step
append-serve mode is good and no need to move n element
on each serve but space utilization is
poor. 22. Circular Queue ● The
solution of append-serve model is circular queue.
b) Write
an algorithm to store non-leap years in circular queue
of array size
10 YEAR[9]. Make sure if queue full then
delete the older years and
store the newer year in circular
queue until the last year stored in
queue.
(Note:
Starting year 1980 and Last year 2014. Leap year is a
year which is
divisible by 4 and not divisible by 100 or A
year divisible by 400).
below mentionedundirected graph.
Q.3 a) Perform
Quick sort on below mentioned unsorted list to
ascending order.
“44,
20, 5, 8, 100, 99, 1, 2, 6, 10”
b) Perform
a more suitable step-by-step search algorithm on sorted array.
“2,
8, 10, 12, 15, 25, 51, 65, 73, 92”
Post-Order Treetraversal.
structure with some
examples.
Recommended
Book:
Introduction
to Data Structure with Application by Paul Trembley Sorenson
Course
Outlines:
Unit No.
2 Arrays
Unit No.
3 Stacks
Unit No.
4 Queues
Unit No. 5 Linked Lists
types
of Linked Lists
Unit
No. 6 Trees
Basic Operation
(Insertion Deletion)
Unit
No.7 Sorting & Searching
Unit
No. 8 Graphs
Unit No. 9 Files and Data
Storage
Basic
Operations on Different Files Organizations,
Add, Update and Delete
Record,
File Organizations,
Sequential, Indexed Sequential,
Direct
(Hashing), Merging Files.
old papers data structure 3408