Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

Data Structures and Algorithms > Module 1 > Flashcards

Module 1 Flashcards

1
Q

These are the programmatic way of storing data so it can be used efficiently

A

Data structures

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

It represents the set of operations that a data structure supports

A

Interface

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

This provides the internal representation of a data structure, as well as provide the definition of the algorithms used in the operations

A

Implementation

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Data structures are used for specifying the collection of attributes and corresponding structures used to store records in a DBMS

A

Storing data

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

_____ resources and services are enabled through the use of data structures

A

Core operating system

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Core operating system resources and services are enabled through the use of data structures

A

Managing resources and services

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Data structures define the organization of information shared between applications, such as TCP/IP packets

A

Data exchange

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

These provide efficient methods of sorting objects, such as character strings used as tags; programmers can manage items organized according to a specific priority

A

Ordering and sorting

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Data structures stored in a database such as B-trees are used to index objects

A

Indexing

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Indexes created using binary search trees, B-trees or hash tables speed the ability to find a specific sought-after item

A

Searching

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Big data applications use data structures for allocating and managing data storage across distributed storage locations

A

Scalability

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

This characteristic describes whether the data items are arranged in a sequential order, such as with an array, or in an unordered sequence, such as with a graph

A

Linear or non-linear

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

This characteristic describes whether all data items in a given repository are of the same type.

A

Homogenous or heterogenous

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

This characteristic describes how the data structures are compiled

A

Static or dynamic

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

These have fixed sizes, structures and memory locations at compile time

A

Static data

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

These have sizes, structures and memory locations that can shrink or expand, depending on the use

A

Dynamic

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
17
Q

Why do we need data structure?

A

Data search
Processor speed
Multiple requests

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
18
Q

True or false: Data can be organized in a data structure in such a way that all items may not be required to be searched, and the required data can be searched almost instantly

A

True

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
19
Q

This is the scenario where a particular data structure operation takes maximum time it can take

A

Worst case

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
20
Q

This is the scenario depicting the average execution time of an operation of a data structure

A

Average case

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
21
Q

This is the scenario depicting the least possible execution time of an operation of a data structure

A

Best case

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
22
Q

These are set of values

A

Data

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
23
Q

These refer to single unit of values

A

Data item

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
24
Q

Data items that are divided into sub items are called

A

Group items

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
25
Q

Data items that cannot be divided are called as

A

Elementary items

26
Q

It contains certain attributes or properties, which may be assigned values

A

Attribute and Entity

27
Q

These are entities of similar attribtues forming an entity set

A

Entity set

28
Q

This is a single elementary unit of information representing an attribute of an entity

A

Field

29
Q

This is a collection of field values of a given entity

A

Record

30
Q

This is a collection of records of the entities in a given entity set

A

File

31
Q

It is a structure of fixed-size, which can hold items of the same data type

A

Array

32
Q

What are the different sorting algorithms

A

Insertion sort, quick sort, bubble sort, merge sort

33
Q

This is a sequential structure that consists of a sequence of items in linear order which are linked to each other

A

Linked lists

34
Q

This is a LIFO (Last In First Out-the element placed at last can be accessed at first)

A

Stack

35
Q

This is a FIFO (First In First Out –the element placed at first can be accessed at first); resembles people waiting in a line

A

Queues

36
Q

This is a data structure that stores values which have keys associated with each of them

A

Hash table

37
Q

This is a hierarchical structure where date is organized hierarchically and are linked together

A

Tree

38
Q

What are the different applications of trees

A

Binary trees
Binary Search Tree
Heaps
Treaps

39
Q

This is a special case of a binary tree where the parent nodes are compared to their children with their values arranged accordingly

A

Heap

40
Q

These are used to find the smallest (or largest) value in a given array

A

Heaps

41
Q

These consist of a finite set of vertices or nodes and a set of edges connecting these vertices

A

Graph

42
Q

This is the number of vertices in the graph

A

order

43
Q

This is the number of edges in the graph

A

Size

44
Q

These are used to represent social media networks

A

Graphs

45
Q

These are used to represent web pages and links by search engines

A

Graphs

46
Q

These are used to represent locations and routes in GPS

A

Graphs

47
Q

These are used to implement expression parsers and solvers

A

Binary Trees

48
Q

Used in many search applications where data are constantly entering and leaving

A

Binay Search Trees

49
Q

Used by Java Virtual Machine to store java objects

A

Heaps

50
Q

Data structure used in wireless networking

A

Treaps

51
Q

What are the 8 common datatypes?

A

Arrays
Linked Lists
Stack
Queues
Hash Table
Trees
Heap
Graph

52
Q

Application of arrays

A
  • For building other data structures
  • Array lists
  • Heaps
  • Hash Tables
  • Vectors
  • Matrices
  • For sorting algorithms:
  • Insertion sort
  • Quick sort
  • Bubble sort
  • Merge sort -
53
Q

Application of Linked Lists

A
  • Symbol Table Management
  • Switching between programs using alt + tab (using circular linked list)
54
Q

Applications of stacks

A
  • Expression evaluation:
  • shunting-yard algorithm
  • parsing and evaluating mathematical expressions
  • implementing function calls in recursion programming
55
Q

Application of Queues

A
  • Multithreading
  • Implementing queuing systems (i.e., priority queues)
56
Q

Applications of hash tables

A
  • Database indexes
  • Associative arrays
  • Set data structure
57
Q

Applications of trees

A

Binary trees: expression parsers and solvers
Binary Search Tree
Heaps: used by Java Virtual Machine
Treaps: Used in wireless networking

58
Q

Applications of heaps

A
  • Heapsort algorithm
  • Implement priority queues
  • Queue functions within O(log n) time
  • Used to find the smallest or largest value in an array
59
Q

Applications of graphs

A
  • represent social media networks: user - vertex; users - edge
  • represent web pages and links: each page - vertex; hyperlink: edge
  • page ranking in google
  • locations and routes in GPS: location - vertices; routes: edges
  • calculate the shortest route between two locations
60
Q

How are data structures used:

A

Storing Data
Managing resources and services
Data Exchange
Ordering and Sorting
Indexing
Searching
Scalability

Data Structures and Algorithms (3 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions