Flashcards
Data Structure
Cards in this deck (20)
- 1represents the overall resource of the organization.Data
- 2is a way of collecting and organizing elements or items of data.Data Structure
- 3It is an arrangement of data in a computer’s memory in such a way that it can access quickly to the processor for the required calculationsData Structure
- 4The functional definition of a data structure is known as ___________ which is independent of implementation.Abstract Data Type
- 5An _______ is a finite set of instructions or procedures, written in order, to solve a certain predefined task. In programming, _____ are implemented in the form of methods or functionsAlgorithm
- 6The ______ is not a program, it is the main logic or solution to the problem, which can be stated as pseudocode. Every _____ must solve complex problems using the following steps; define the problem, second is to design the algorithm to solve the problem.Algorithm
- 7An algorithm is said to be effective and fast if it takes a lesser amount of time to perform and consumes less memory space. The following properties are the basis of its performance:1.Time Complexity
2.Space Complexity - 8is a way to signify the amount of time needed by the program to run to completion.Time Complexity
- 9It is the amount of memory space necessary by the algorithm, during the course of its execution. Space complexity must be taken extremely for multi-user systems and in situations where limited memory is available.Space Complexity
- 10An algorithm generally requires space for the following components:1.Instruction Space
2.Data Space
3.Environment Space - 11the space required to store the executable version of the program. This space is static but differs depending upon the number of lines of code in the programInstruction Space
- 12the space required to store all the constants and variables value.Data Space
- 13the space necessary to store the environment information needed to restart the suspended function.Environment Space
- 14A data structure is a type of data that can be categorized by its organization and the operations that are defined on it. Data structures are also known asData Types
- 15Data structures are divided into two types;1.Primitive data structures
2.Non-primitive data structures - 16A data structure that cannot be decomposed to other data structures. Integers, float, pointers, Booleans, and characters are under this type. These primitive data structures are the basis for the discussion of a more sophisticated data structure.Primitive data structures
- 17It is a more complicated data structure and is derived from one or more primitive data structures. The simple data structures built from primitives are strings, arrays, lists, records, and files.Non-primitive data structures
- 18A simple data structure can be combined in various ways to form more complex structures. The two important kinds of more complex data structures;1.Linear data structure
2.Non-linear data structure - 19Data items are not arranged in sequential order. Example: trees and graphsNon-linear data structure
- 20Elements are connected and accessed in sequential order by means of logically or in sequence memory locations. Example: stacks, queues, and linked listLinear data structure
Information
- Description
- 1 DSA Flashcards on Data Structure, created by Shiro Midori on 02/12/2021.
- Created by
- Shiro Midori
- Views
- 1
- History
-
- Created by Shiro Midori · Dec 2, 2021
- Copied by Shiro Midori · Dec 2, 2021
- Rating