Data Structure & Algorithms | Computer Science
Download as PPTX, PDF3 likes619 views
The document discusses data structures, defining them as logical ways to store and organize data, and introduces abstract data types (ADTs). It details various types of data structures used in C/C++, including stacks, queues, heaps, hash tables, and graphs, along with explanations of open and closed hashing. Additionally, it covers binary search trees, linked lists, and their applications in memory allocation and data management.
![Binary SearchTree Algorithm
def search_recursively(key, node):
2 if node is None or node.key == key:
3 return node
4 elif key < node.key:
5 return search_recursively(key,
node.left)
6 else: # key > node.key
7 return search_recursively(key,
node.right)
Example of binary search tree is
build_binary_tree([1, 2, 3, 4, 5]) yields the tree (1 (2 (3 (4 (5))))).](https://image.slidesharecdn.com/datastructurealgorithms-170317073711/85/Data-Structure-Algorithms-Computer-Science-8-320.jpg)
Data Structure & Algorithms | Computer Science
- 2. Data Structure It is the logical way to store and to organize the data in a system. A abstract data type or ADT is a scientific model of data structure. It depicts a holder which holds a limited number of objects where the items might be related through a given binary relationship. There are two types of data structure.
- 3. Data Structures in C/ C++ There are five types of data structures inn C/ C++ 1. Stack – Last in First out 2. Queue – First in First out 3. Heap – Complete binary trees which are not sorted 4. Hash Tables – Implementing key array data structure 5. Graph – Method of representing connection between different places.
- 4. Difference between Open Hashing & Closed Hashing • Linear probing double or irregular hashing are good if the keys are kept as the entries in the hash table itself. This is called as closed hashing. • In open hashing, entries in hash table are the pointers to the linked list head elements. Collision determination turns out to be simple with separate chaining: while inserting a key in the linked list if it is there.
- 6. Linear Hashing • It allows the hash file to expand and shrink its number of buckets dynamically without any directory. • It starts with M buckets numbered 0 to M-1 and use the mod hash function H(K) = K mod M As the initial hash function called hi.
- 7. Binary SearchTree In a BST, every node stores some data including unique key value, and maybe some related data. A double tree is a BST iff, for each node n in the tree: • All keys in n's left subtree are not as much as the key in n, and • All keys in n's right subtree are more noteworthy than the key in n. Note: if duplicate keys are permitted, then nodes with values that are equivalent to the key in node n can be either in n's left subtree or in its right subtree. Notes: we will expect that duplicates are not permitted.
- 8. Binary SearchTree Algorithm def search_recursively(key, node): 2 if node is None or node.key == key: 3 return node 4 elif key < node.key: 5 return search_recursively(key, node.left) 6 else: # key > node.key 7 return search_recursively(key, node.right) Example of binary search tree is build_binary_tree([1, 2, 3, 4, 5]) yields the tree (1 (2 (3 (4 (5))))).
- 9. Linked List Every element in linked list data structure is represented by two nodes. One is main node and other contains reference to previous node. These are of three types: • Singly linked list • Doubly linked list • Circular linked list
- 10. Applications of Linked List • These are used in implementation of stack and queue or implementing graphs. • Hash tables can also be implemented with the help of linked lists. • Polynomial can be shown in the form of array or in linked list by saving the coefficient as well as exponent of each term. • These are also used in dynamic memory allocation.
- 11. Hey Friend, This was just a summary on Data Structure & Algorithms. For more detailed information on this topic, please type the link given below or copy it from the description of this PPT and open it in a new browser window. www.transtutors.com/homework-help/computer-science/data-structure-and-algorithms.aspx