1. Define Data structure? Explain its three components.
To storing and organizing data in a operating system so it can be access-able efficiently is called data structure in the computer science. There are various type of data structures supported by different kind of applications of systems and some of them are very highly specialized for the specific jobs. Data structure manage large amount of data very efficiently like internet indexing services and large databases. During the compiler implementation mostly use hash tables to look up identifiers, B-tree are the most suitable for implementation of database. For designing the efficient algorithms, efficient data structure are the most important key. Rather than algorithms, data structure are used in programming languages and some of formal design methods. Data retrieving and storing tasks performed on stored data in both of the locations main and secondary memory.
There are three main components in the data structure model theory. First is the Structure part: to create a database representing used collection of data structures for the objects of entities modeled by the database. Second is the Integrity part: To ensure structural integrity the constraints placed on these data structures by a colection of rules governing them. Third one is the Manipulation part: collation of operators that can be used in data structures, to query and update the data in the database.
To storing and organizing data in a operating system so it can be access-able efficiently is called data structure in the computer science. There are various type of data structures supported by different kind of applications of systems and some of them are very highly specialized for the specific jobs. Data structure manage large amount of data very efficiently like internet indexing services and large databases. During the compiler implementation mostly use hash tables to look up identifiers, B-tree are the most suitable for implementation of database. For designing the efficient algorithms, efficient data structure are the most important key. Rather than algorithms, data structure are used in programming languages and some of formal design methods. Data retrieving and storing tasks performed on stored data in both of the locations main and secondary memory.
There are three main components in the data structure model theory. First is the Structure part: to create a database representing used collection of data structures for the objects of entities modeled by the database. Second is the Integrity part: To ensure structural integrity the constraints placed on these data structures by a colection of rules governing them. Third one is the Manipulation part: collation of operators that can be used in data structures, to query and update the data in the database.
2. Discuss the properties of ADT.
A mathematical specification of data and data operations that can performed on data called Abstract data types or ADT. It is a mathematical model for the certain data types of more than one programming languages which have standardized semantics, or a certain class of data structure which have same behavior. We can only defined an abstract data type, operation performed on it and also can the mathematical constraints which effects those operations. There some properties in ADT data type or types, set of operations, specifications, signature, set of axioms and set of implementation. Set of types that the operation of the ADT must provided for implementations is signature. Many systems signatures also includes axioms that all export must obey. In the Haskell algorithms ADT is implemented with form of class or module system. And the data accessed with help if operator and methods. Multiple implementations is also supported in ADT. In the signature right operators and methods exposed.
More question
3. Write a note on i) Binary tree ii) Hash tables.
4. Write a ‘C’ program to implement the
stack operations using arrays.
5. What is queue? Explain different types
of queues.
6. Explain the Circular singly linked list
with neat diagram.
7. Discuss the various graphs with neat
diagram.
8. Explain with example how to delete a
node from the tree.
9. Write a program in ‘C’ to read N numbers and print them in descending order.
10. Explain the Pre
and Post conditions with an suitable example.
11. Explain different
Applications of stack.
12. Write a note on
Double Ended queues.
13. Write a ‘C’
program to implement deque using circular linked list.
14. Explain various
operations that can be performed on binary tree.
15. Write a note on
Binary Search Tree (BST).
16. write a ‘C’
program to sort an array of 10 elements using Bubble sort algorithm.