What is Data Structure?
A data structure is a way of organizing data that considers not only the items stored, but also their relationship to each other. Advance knowledge about the relationship between data items allows designing of efficient algorithms for the manipulation of data.
An example of several common data structures are arrays, linked lists, queues, stacks, binary trees, and hash tables.
List out the Areas in which the Data Structures is used extensively?
Compiler Design, Operating System, Database Management System, Statistical analysis package, Numerical Analysis, Graphics, Artificial Intelligence.
What is Stack?
A stack is a linear data structure where insertion and deletion of an item can takes place at one end called "TOP" of the stack.And it is a LIFO(Last-in First-out) mechanism. It is used to perform recursion mechanism.
What is the difference between ARRAY and STACK?
1. Stack follows LIFO. Thus the item that is first entered would be the last removed whereas in array the items can be entered or removed in any order.
2. Array may be multi-dimensional or one dimensional but stack should be one dimensional.
3. Array is the collection of heterogeneous data elements,where as structure can have both heterogeneous and non heterogeneous elements.
What is push and pop operations?
In Stack, the insertion operation is referred to as push and the deletion operation is referred to as pop.
What is Linked List?
A linked list is a sequence of nodes each containing arbitrary data fields and one or two links pointing the next of previous node. The linked List is a linear data structure.
What are all the types of linked list?
Linearly,Single,Doubly,Multiple,Circularly Linked List.
What is Queue?
The queue data structure is characterized by the fact that additions are made at the end, or tail, of the queue while removals are made from the front, or head, of the queue. For this reason, a queue is referred to as a FIFO structure (First-In First-Out).
What are the Characteristics of Queue?
1. A queue differs from a stack in that its insertion and removal routines follows the first-in-first-out (FIFO) principle
2. Elements may be inserted at any time, but only the element which has been in the queue the longest may be removed.
3. Elements are inserted at the rear (enqueued) and removed from the front (dequeued).
A data structure is a way of organizing data that considers not only the items stored, but also their relationship to each other. Advance knowledge about the relationship between data items allows designing of efficient algorithms for the manipulation of data.
An example of several common data structures are arrays, linked lists, queues, stacks, binary trees, and hash tables.
List out the Areas in which the Data Structures is used extensively?
Compiler Design, Operating System, Database Management System, Statistical analysis package, Numerical Analysis, Graphics, Artificial Intelligence.
What is Stack?
A stack is a linear data structure where insertion and deletion of an item can takes place at one end called "TOP" of the stack.And it is a LIFO(Last-in First-out) mechanism. It is used to perform recursion mechanism.
What is the difference between ARRAY and STACK?
1. Stack follows LIFO. Thus the item that is first entered would be the last removed whereas in array the items can be entered or removed in any order.
2. Array may be multi-dimensional or one dimensional but stack should be one dimensional.
3. Array is the collection of heterogeneous data elements,where as structure can have both heterogeneous and non heterogeneous elements.
What is push and pop operations?
In Stack, the insertion operation is referred to as push and the deletion operation is referred to as pop.
What is Linked List?
A linked list is a sequence of nodes each containing arbitrary data fields and one or two links pointing the next of previous node. The linked List is a linear data structure.
What are all the types of linked list?
Linearly,Single,Doubly,Multiple,Circularly Linked List.
What is Queue?
The queue data structure is characterized by the fact that additions are made at the end, or tail, of the queue while removals are made from the front, or head, of the queue. For this reason, a queue is referred to as a FIFO structure (First-In First-Out).
What are the Characteristics of Queue?
1. A queue differs from a stack in that its insertion and removal routines follows the first-in-first-out (FIFO) principle
2. Elements may be inserted at any time, but only the element which has been in the queue the longest may be removed.
3. Elements are inserted at the rear (enqueued) and removed from the front (dequeued).
What are the Fundamental methods in Queue?
New(),Enqueue(),Dequeue(),Front(),Size(),IsEmpty().
No comments:
Post a Comment