Академический Документы
Профессиональный Документы
Культура Документы
Assignment -1
Data Structure
Submitted To –
Mr.Kiran Kumar Kaki
Submitted by-
Name:shreyats
Section:D1803
Semester :4rth
Part A
Ans 1.Structuring of data is required because data structure is a logical or
mathematical model of a particular arrangement or organization of data.It is a
particular way of storing data in computer’s memory so that it can be used easily
and efficiently. For example, B-trees are particularly well-suited for implementation
of databases, while compiler implementations usually use hash tables to look up
identifiers.
Ans 2.An Abstract Data Type is primarily a way of looking at data structure ,focusing
on what it can do rather than how it can be done . A stack is the most common
example of an abstract data type that can be implemented either using an array or
linked list .This demonstrates the abstract nature of stack as user can simply use
the push and pop operation without being concerned about internal data
representation (data structure )or internal of push and pop operation.
2. A set of axionms that define the semantics of the operation i.e.what the
operation do to instance of the ADT, but now.
a)Operating System
b)Numerical Analysis
c)Artificial Intelligence
d)Network Analysis
Ans 4. The complexity of an algorithm is a function f(n) that gives the running time
and memory space required by an algorithm for possessing the input data of size
n.The analysis of an algorithm in terms of time and space for possessing input data
is called as Algorithm Complexity.The Study of algorithm is necessary to determine
the amount of time and storage space an algorithm may require for
execution.Measuring an algorithm efficiency is important because your choice of
algorithm for a given application often has a great impact.ATMs,Life Support
System,Flight Reservation System all depend on efficient algorithms.
[end of loop]
Step 4. return
Step 7.exit
Ans 6. Step 1.Enter the marks of m students in n no of tests while I<m and j<n
Sum=sum+a[i][j]
J j+1;
Strep 5. avg=sum/n
step 7. i i+1
Step 9. end
(a) t a[i][j]
(b) a[i][j] a[i][j+1]
(c) a[i][j+1] t
Answer 8: In this algorithm we take an array F for grade,which store the average of
student, five higher test score , the size of array F is 30.
In this algorithm we take an variable COUNT, which count the number of student
fail.
Algo -
If F[i]<60,then:
[end of if structure ]
STEP 4 – EXIT;
STEP 2 – repeat Q: =1 to 30 by 1
S= S+LA[i]
If Q: = 30, then:
AV: = S/30.
[ end of if structure ]
STEP 4 – EXIT;