Table of Contents
CS301: Data Structures Handouts
JOIN VU ASSIGNMENT SOLUTION GROUPS AND ALSO SHARE WITH FRIENDS. IN THESE WHATSAPP GROUPS WE SEND A SOLUTION FILE AND LINK FOR YOU. TO JOIN WHATSAPP GROUPS CLICK BELOW LINK.
MUST JOIN VU STUDY GROUPS
CS301: Data Structures
Course Category: Computer Science/Information Technology
Introduction, The Array data type, The List abstract data type (ADT), Linked lists, Stacks, Queues, Trees, AVL Trees, Huffman encoding, The Heap ADT, Priority queue implementation using the heap ADT, The Disjoint Sets ADT, The Table ADT, Implementation using arrays, Skip lists, Table ADT implementation using Hashing, Collision resolution in Hashing, Other uses of Hashing, Sorting, and Selection sort, Insertion sort, Bubble sort algorithms, Divide and conquer strategy: Merge sort, Quicksort.
Data structure is the storage space used to store and organize data. It is a way of organizing data on a computer so that it can be accessed and updated properly. Depending on your need and project, it is important to choose the right data structure for your project. More precisely, the data structure is a collection of data values, relationships between them, and functions or functions that can be applied to data, that is, algebraic structure in relation to data.
why do we need data structures?
why do we need data structures and what kind of problems can be solved with their use. Data structures help us to organize data on a computer, which leads to more efficient programs. The operating system works faster and helps reduce the use of resources such as memory and disk. Computers become more powerful over time with the increase in CPU speed at GHz, faster network availability, and increased disk space. Thus, humans have begun to solve complex problems.
As computer programs become more complex, so is the need for additional resources. This does not mean that we have to buy a new computer to make the system run faster. Our effort should be to ensure that the solution is achieved with the help of programs, data structures, and algorithms.
What does data organization mean? It means that the data must be organized in such a way that it is easily accessible. Data is inside the computer and we want to see it. We can also do some math on it. Suppose the data contains numbers and the editor wants to calculate the rate, standard deviation etc. Maybe we have a list of words and want to search for a specific word in it. To solve such problems, data structures and algorithms are used. Sometimes you may find that the app is very slow and time consuming.
It is likely that it is due to the data structure used, not because of CPU speed and memory. We will see such examples. In the activities to be performed, you will also check whether the data structure in the system is beneficial or not. You might have two data structures and try to decide which one is most suitable for problem solving.
Selecting a Data Structure
How can we select the data structure needed to solve the problem? You have already learned where to use the list and program size and when and where the directions etc. First, we need to analyze the problem in order to determine the service issues the solution should address. Suppose, the data is very large namely Gega bytes (GBs) while the available disk space is also only 200 Megabytes. This problem cannot be solved by a program. Instead, we will have to buy a new disk.
CS301: Data Structures Handouts
Computer Science/Information Technology
CS301 HANDOUTS CS301 HANDOUTS CS301 HANDOUTSCS301: Data Structures Handouts CS301: Data Structures HandoutsVU All Subjects HandOuts