PRELIM-LESSON 1

Question 1

the programmatic way of storing data so that data can be used efficiently.

Answer 1

Data Structures

Question 2

true or false: almost every enterprise application uses various type of structures in one or the other way.

Answer 2

true

Question 3

systematic way to organize data in order to use it efficiently

Answer 3

data structure

Question 4

true or false: each data structure has an interface

Answer 4

interface

Question 5

represent the set of operations that a data structure supports.

Answer 5

interface

Question 6

only provides the list of supported operations, type of parameters they can accept and return type these operations.

Answer 6

interface

Question 7

provides the internal representation of a data structure

Answer 7

Implementation

Question 8

It also provides the definition of the algorithms used in the operations of the data structure.

Answer 8

Implementation

Question 9

true or false: data structure are used to implement the physical forms of abstract data types.

Answer 9

true

Question 10

true or false: Data structures are a
crucial part of designing efficient software. They also play a
critical role in algorithm design and how those algorithms are
used within computer programs.

Answer 10

true

Question 10

examples of how data structures are used:

Answer 10

storing data
managing resources and services
data exchange
ordering and sorting
indexing
searching
scalability

Question 10

they use algorithms that are tightly coupled with the data structures-such as lists, queues, and mapping from one set of values to another.

Answer 10

software engineers

Question 11

Data structures are used for efficient data persistence, such
as specifying the collection of attributes and corresponding structures used
to store records in a database management system.

Answer 11

storing data

Question 12

Core operating system (OS) resources
and services are enabled through the use of data structures such as linked
lists for memory allocation, file directory management and file structure
trees, as well as process scheduling queues.

Answer 12

managing resources and services

Question 13

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

Answer 13

data exchange

Question 14

Data structures such as binary search trees – also known
as an ordered or sorted binary tree – provide efficient methods of sorting objects,
such as character strings used as tags. With data structures such as priority
queues, programmers can manage items organized according to a specific
priority.

Answer 14

ordering and sorting

Question 15

Even more sophisticated data structures such as B-trees are used to
index objects, such as those stored in a database.

Answer 15

indexing

Question 16

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

Answer 16

searching

Question 17

Big data applications use data structures for allocating and managing
data storage across distributed storage locations, ensuring scalability and
performance. Certain big data programming environments – such as Apache
Spark – provide data structures that mirror the underlying structure of database
records to simplify querying

Answer 17

scalability

Question 18

need for data structure

Answer 18

data search
processor speed
multiple request

Question 19

Consider an inventory of 1 million(106) items of a store. If the
application is to search an item, it has to search an item in 1 million(106) items
every time slowing down the search. As data grows, search will become
slower.

Answer 19

data search

Question 20

although being very high, falls limited if
the data grows to billion records.

Answer 20

processor speed

Question 21

As thousands of users can search data simultaneously on
a web server, even the fast server fails while searching the data.

Answer 21

multiple requests

Question 22

execution time cases

Answer 22

worst case
average case
best case

Question 23

This is the scenario where a particular data structure operation takes maximum time it can take. If an operation's worst case time is ƒ(n) then this operation will not take more than ƒ(n) time where ƒ(n) represents function of n.

Answer 23

worst case

Question 24

This is the scenario depicting the average execution time of an operation of a data structure. If an operation takes ƒ(n) time in execution, then m operations will take mƒ(n) time.

Answer 24

average case

Question 25

This is the scenario depicting the least possible execution time of an operation of a data structure. If an operation takes ƒ(n) time in execution, then the actual operation may take time as the random number which would be maximum as ƒ(n).

Answer 25

best case

Question 26

are values or set of values

Answer 26

data

Question 27

refers to single unit of values

Answer 27

data item

Question 28

data items that cannot be divided into sub item are called as

Answer 28

group items

Question 29

data items that cannot be divided are called as

Answer 29

elementary items

Question 30

−An entity is that which contains certain attributes or properties, which may be assigned values

Answer 30

attribute and entity

Question 31

Entities of similar attributes form an

Answer 31

entity set

Question 32

single elementary unit of information representing an attribute of an entity.

Answer 32

field

Question 33

collection of field values of a given entity.

Answer 33

record

Question 34

collection of records of the entities in a given entity set

Answer 34

file

Question 35

8 common data structures concepts

Answer 35

array linked lists stacks queues hash tables trees heaps graphs

Question 36

specialized means of organizing and storing data in computers in such a way that we can perform operations on the stored data more efficiently.

Answer 36

data structures

Question 37

have a wide and diverse scope of usage across the fields of Computer Science and Software Engineering.

Answer 37

data structures

Question 38

a structure of fixed-size, which can hold items of the same data type. It can be an array of integers, an array of floating-point numbers, an array of strings or even an array of arrays (such as 2-dimensional arrays). Arrays are indexed, meaning that random access is possible

Answer 38

array

Question 39

Used as the building blocks to build other data structures such as array lists, heaps, hash tables, vectors and matrices.

Answer 39

applications of array

Question 40

Used for different sorting algorithms such as insertion sort, quick sort, bubble sort and merge sort.

Answer 40

application of arrays

Question 41

sequential structure that consists of a sequence of items in linear order which are linked to each other. Hence, you have to access data sequentially and random access is not possible. Linked lists provide a simple and flexible representation of dynamic sets.

Answer 41

linked lists

Question 42

Used for symbol table management in compiler design.

Answer 42

applications of linked lists

Question 43

Used in switching between programs using Alt + Tab (implemented using Circular Linked List).

Answer 43

applications of linked lists

Question 44

(Last In First Out — the element placed at last can be accessed at first) structure which can be commonly found in many programming languages. This structure is named as “stack” because it resembles a real-world stack — a stack of plates.

Answer 44

stacks

Question 45

Used for expression evaluation (e.g.: shunting-yard algorithm for parsing and evaluating mathematical expressions).

Answer 45

applications of stacks

Question 46

Used to implement function calls in recursion programming

Answer 46

applications of stacks

Question 47

FIFO (First In First Out — the element placed at first can be accessed at first) structure which can be commonly found in many programming languages. This structure is named as “queue” because it resembles a real-world queue — people waiting in a queue.

Answer 47

queues

Question 48

use to manage threads in multithreading

Answer 48

applications of queues

Question 49

Used to implement queuing systems (e.g.: priority queues).

Answer 49

applications of queues

Question 50

data structure that stores values which have keys associated with each of them. Furthermore, it supports lookup efficiently if we know the key associated with the value. Hence it is very efficient in inserting and searching, irrespective of the size of the data.

Answer 50

hash table

Question 51

Used to implement database indexes. * Used to implement associative arrays. * Used to implement the “set” data structure.

Answer 51

applications of hash tables

Question 52

a hierarchical structure where data is organized hierarchically and are linked together. This structure is different from a linked list whereas, in a linked list, items are linked in a linear order.

Answer 52

trees

Question 53

application of trees

Answer 53

binary trees binary search tree heaps treaps

Question 54

Used to implement expression parsers and expression solvers

Answer 54

binary trees

Question 54

used in many search applications where data are constantly entering and leaving.

Answer 54

binary search tree

Question 55

used by JVM (Java Virtual Machine) to store Java objects.

Answer 55

heaps

Question 56

used in wireless networking

Answer 56

treaps

Question 57

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

Answer 57

heaps

Question 58

Used in heapsort algorithm. * Used to implement priority queues as the priority values can be ordered according to the heap property where the heap can be implemented using an array. * Queue functions can be implemented using heaps within O(log n) time. * Used to find thekᵗʰsmallest (or largest) value in a given array.

Answer 58

applications of heaps

Question 59

consists of a finite set of vertices or nodes and a set of edges connecting these vertices. The order of a graph is the number of vertices in the graph. The size of a graph is the number of edges in the graph.

Answer 59

graphs