Module 1

Question 1

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

Answer 1

Data structures

Question 2

It represents the set of operations that a data structure supports

Answer 2

Interface

Question 3

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

Answer 3

Implementation

Question 4

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

Answer 4

Storing data

Question 5

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

Answer 5

Core operating system

Question 6

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

Answer 6

Managing resources and services

Question 7

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

Answer 7

Data exchange

Question 8

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

Answer 8

Ordering and sorting

Question 9

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

Answer 9

Indexing

Question 10

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

Answer 10

Searching

Question 11

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

Answer 11

Scalability

Question 12

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

Answer 12

Linear or non-linear

Question 13

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

Answer 13

Homogenous or heterogenous

Question 14

This characteristic describes how the data structures are compiled

Answer 14

Static or dynamic

Question 15

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

Answer 15

Static data

Question 16

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

Answer 16

Dynamic

Question 17

Why do we need data structure?

Answer 17

Data search
Processor speed
Multiple requests

Question 18

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

Answer 18

True

Question 19

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

Answer 19

Worst case

Question 20

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

Answer 20

Average case

Question 21

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

Answer 21

Best case

Question 22

These are set of values

Answer 22

Data

Question 23

These refer to single unit of values

Answer 23

Data item

Question 24

Data items that are divided into sub items are called

Answer 24

Group items

Question 25

Data items that cannot be divided are called as

Answer 25

Elementary items

Question 26

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

Answer 26

Attribute and Entity

Question 27

These are entities of similar attribtues forming an entity set

Answer 27

Entity set

Question 28

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

Answer 28

Field

Question 29

This is a collection of field values of a given entity

Answer 29

Record

Question 30

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

Answer 30

File

Question 31

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

Answer 31

Array

Question 32

What are the different sorting algorithms

Answer 32

Insertion sort, quick sort, bubble sort, merge sort

Question 33

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

Answer 33

Linked lists

Question 34

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

Answer 34

Stack

Question 35

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

Answer 35

Queues

Question 36

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

Answer 36

Hash table

Question 37

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

Answer 37

Tree

Question 38

What are the different applications of trees

Answer 38

Binary trees Binary Search Tree Heaps Treaps

Question 39

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

Answer 39

Heap

Question 40

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

Answer 40

Heaps

Question 41

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

Answer 41

Graph

Question 42

This is the number of vertices in the graph

Answer 42

order

Question 43

This is the number of edges in the graph

Answer 43

Size

Question 44

These are used to represent social media networks

Answer 44

Graphs

Question 45

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

Answer 45

Graphs

Question 46

These are used to represent locations and routes in GPS

Answer 46

Graphs

Question 47

These are used to implement expression parsers and solvers

Answer 47

Binary Trees

Question 48

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

Answer 48

Binay Search Trees

Question 49

Used by Java Virtual Machine to store java objects

Answer 49

Heaps

Question 50

Data structure used in wireless networking

Answer 50

Treaps

Question 51

What are the 8 common datatypes?

Answer 51

Arrays Linked Lists Stack Queues Hash Table Trees Heap Graph

Question 52

Application of arrays

Answer 52

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

Question 53

Application of Linked Lists

Answer 53

- Symbol Table Management - Switching between programs using alt + tab (using circular linked list)

Question 54

Applications of stacks

Answer 54

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

Question 55

Application of Queues

Answer 55

- Multithreading - Implementing queuing systems (i.e., priority queues)

Question 56

Applications of hash tables

Answer 56

- Database indexes - Associative arrays - Set data structure

Question 57

Applications of trees

Answer 57

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

Question 58

Applications of heaps

Answer 58

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

Question 59

Applications of graphs

Answer 59

- 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

Question 60

How are data structures used:

Answer 60

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