Font size
WorksheetsCSC 105 Data Structures and Algorithms Midterm Exam
Total questions: 50
Worksheet time: 35mins
The study of data structures helps to understand the basic concepts involved in organizing and storing data as well as the relationship among the data sets.
TRUE
FALSE
Data structures helps to determine the way information is stored, retrieved and modified in a computer’s memory.
TRUE
FALSE
(a) is a branch of computer science.
________________is the structural representation of logical relationship between data elements.
Data structure
Abstract Data structure
Structure
Data
______________are the building blocks of any program or the software.
Data
Data structures
Structures
Data types
can be defined as an elementary value or the collection of values, for example, student's name and its id are the data about the student
Information
Data
Data structures
Smallest Value
Data items which have subordinate data items
Data
Structures
Group Items
Data Structures
can be defined as the collection of various data items
(a)
is a collection of various records of one type of entity
(a)
represents the class of certain objects. it contains various attributes
File
data
Record
Attribute and Entity
is a single elementary unit of information representing the attribute of an entity.
(a)
The following are Need for Data Structure except
It gives different level of organization data
It tells how data can be stored and accessed in its elementary level.
Provide a means to manage huge amount of data efficiently.
Provide slow and inaccurate searching and sorting of data.
Data structure is designed such that it operates correctly for all kinds of input, which is based on the domain of interest.
Correctness
Efficiency
Usability
Robustness
Data structure also needs to be efficient. It should process the data at high speed without utilizing much of the computer resources such as memory space.
Efficiency
Correctness
Usability
Robustness
Robustness is a features needed all computer programmers wish to produce software that generates correct output for every possible input provided to it, as well as execute efficiently on all hardware platforms.
True
False
Developing software projects involves large software systems that work or execute correctly and efficiently for many years.
Adaptability
Reusability
Robustness
It is a known fact that the programmer requires many resources for developing any software, which makes it an expensive enterprise.
Robustness
Adaptability
Reusability
consist of the numbers and the characters which are built in programs
Primitive data structures
Non-primitive data structures
These data structures cannot be operated or manipulated directly by the machine level instructions.
Primitive Data Structure
Non-primitive Data Structure
A data structure that maintains a linear relationship among its elements
Linear Data Structure
Non-linear Data Structure
is a kind of data structure in which data elements are not arranged in a sequential order
Linear Data Structure
Non-linear Data Structure
refers to an orderly arrangement of data elements.
(a)
It has only one row of elements.
One-dimensional Array
Two-dimensional Array
Multidimensional Array
It consists of multiple rows and columns of data elements.
One-dimensional Array
Two-dimensional Array
Multidimensional Array
can be defined as array of arrays
One-dimensional Array
Two-dimensional Array
Multidimensional Array
is a data structure in which each data element contains a pointer or link to the next element in the list
Link of structures
data list
linked list
is a linear data structure in which insertion and deletion of elements are done at only one end,
stack
link
list
is a first-in, first-out (FIFO) data structure in which the element that is inserted first is the first one to be taken out.
(a)
is a non-linear data structure in which data is organized in branches
(a)
A graph is also a non-linear data structure.
True
False
is also a non-linear data structure and is considered as a mathematical structure, which is composed of a set of vertexes and a set of edges.
Trees
Graphs
queue
Stacks
In (a) data structure the size of the structure is fixed.
In (a) data structure the size of the structure in not fixed and can be modified during the operations performed on it.
It means to access each data item exactly once so that it can be processed. For example, to print the names of all the students in a class
Traversing
Searching
Inserting
Deleting
It is used to find the location of one or more data items that satisfy the given constraint.
Traversing
Searching
Inserting
Deleting
It is used to add new data items to the given list of data items.
Traversing
Searching
Inserting
Deleting
It means to remove (delete) a particular data item from the given collection of data items.
Traversing
Searching
Inserting
Deleting
Data items can be arranged in some order like ascending order or descending order depending on the type of application.
Inserting
Deleting
Sorting
Merging
Lists of two sorted data items can be combined to form a single list of sorted data items.
Inserting
Deleting
Sorting
Merging
The word (a) refers to the fact that the data and the basic operations defined on it are being studied independently of how they are implemented.
is a step-by-step procedure
(a)
Algorithm to search an item in a data structure
(a)
Algorithm to sort items in a certain order.
(a)
Algorithm to insert item in a data structure.
(a)
Algorithm to update an existing item in a data structure.
(a)
Algorithm to delete an existing item from a data structure.
(a)
The Algorithm designed must be just plain instructions that can be implemented in any language, and yet the output will be same, as expected. Choose your Answer from the Choices given.
(a)
The algorithm must be simple, generic and practical, such that it can be executed upon will the available resources. It must not contain some future technology, or anything. Choose your answer from the choices given.
(a)
The algorithm must clearly define what output will be yielded and it should be well-defined as well. Choose your answer from the given choices.
(a)
Algorithm should be clear in all aspects and must lead to only one meaning.
(a)
