DATA STRUCTURES EXAM
QUESTIONS WITH CORRECT
ANSWERS
What is data structure? - Correct Answers -Data structures refers to the way data is
organized and manipulated. It seeks to find ways to make data access more efficient.
When dealing with data structure, we not only focus on one piece of data, but rather
different set of data and how they can relate to one another in an organized manner.
Differentiate file structure from storage structure. - Correct Answers -Basically, the key
difference is the memory area that is being accessed. When dealing with the structure
that resides the main memory of the computer system, this is referred to as storage
structure. When dealing with an auxiliary structure, we refer to it as file structures.
When is a binary search best applied? - Correct Answers -A binary search is an
algorithm that is best applied to search a list when the elements are already in order or
sorted. The list is search starting in the middle, such that if that middle value is not the
target search key, it will check to see if it will continue the search on the lower half of the
list or the higher half. The split and search will then continue in the same manner.
What is a linked list? - Correct Answers -A linked list is a sequence of nodes in which
each node is connected to the node following it. This forms a chain-like link of data
storage.
How do you reference all the elements in a one-dimension array? - Correct Answers -To
do this, an indexed loop is used, such that the counter runs from 0 to the array size
minus one. In this manner, we are able to reference all the elements in sequence by
using the loop counter as the array subscript.
In what areas do data structures applied? - Correct Answers -Data structures is
important in almost every aspect where data is involved. In general, algorithms that
involve efficient data structure is applied in the following areas: numerical analysis,
operating system, A.I., compiler design, database management, graphics, and statistical
analysis, to name a few.
What is LIFO? - Correct Answers -LIFO is short for Last In First Out, and refers to how
data is accessed, stored and retrieved. Using this scheme, data that was stored last ,
should be the one to be extracted first. This also means that in order to gain access to
, the first data, all the other data that was stored before this first data must first be
retrieved and extracted.
What is a queue? - Correct Answers -A queue is a data structures that can simulates a
list or stream of data. In this structure, new elements are inserted at one end and
existing elements are removed from the other end.
What is Huffman's algorithm? - Correct Answers -Huffman's algorithm is associated in
creating extended binary trees that has minimum weighted path lengths from the given
weights. It makes use of a table that contains frequency of occurrence for each data
element.
What is Fibonacci search? - Correct Answers -Fibonacci search is a search algorithm
that applies to a sorted array. It makes use of a divide-and-conquer approach that can
greatly reduce the time needed in order to reach the target element.
Briefly explain recursive algorithm. - Correct Answers -Recursive algorithm targets a
problem by dividing it into smaller, manageable sub-problems. The output of one
recursion after processing one sub-problem becomes the input to the next recursive
process.
What are binary trees? - Correct Answers -A binary tree is one type of data structure
that has two nodes, a left node and a right node. In programming, binary trees are
actually an extension of the linked list structures.
Which data structures is applied when dealing with a recursive function? - Correct
Answers -Recursion, which is basically a function that calls itself based on a terminating
condition, makes use of the stack. Using LIFO, a call to a recursive function saves the
return address so that it knows how to return to the calling function after the call
terminates.
What is a stack? - Correct Answers -A stack is a data structure in which only the top
element can be accessed. As data is stored in the stack, each data is pushed
downward, leaving the most recently added data on top.
Explain Binary Search Tree - Correct Answers -A binary search tree stores data in such
a way that they can be retrieved very efficiently. The left subtree contains nodes whose
keys are less than the node's key value, while the right subtree contains nodes whose
keys are greater than or equal to the node's key value. Moreover, both subtrees are
also binary search trees.
What are multidimensional arrays? - Correct Answers -Multidimensional arrays make
use of multiple indexes to store data. It is useful when storing data that cannot be
represented using a single dimensional indexing, such as data representation in a board
game, tables with data stored in more than one column.
QUESTIONS WITH CORRECT
ANSWERS
What is data structure? - Correct Answers -Data structures refers to the way data is
organized and manipulated. It seeks to find ways to make data access more efficient.
When dealing with data structure, we not only focus on one piece of data, but rather
different set of data and how they can relate to one another in an organized manner.
Differentiate file structure from storage structure. - Correct Answers -Basically, the key
difference is the memory area that is being accessed. When dealing with the structure
that resides the main memory of the computer system, this is referred to as storage
structure. When dealing with an auxiliary structure, we refer to it as file structures.
When is a binary search best applied? - Correct Answers -A binary search is an
algorithm that is best applied to search a list when the elements are already in order or
sorted. The list is search starting in the middle, such that if that middle value is not the
target search key, it will check to see if it will continue the search on the lower half of the
list or the higher half. The split and search will then continue in the same manner.
What is a linked list? - Correct Answers -A linked list is a sequence of nodes in which
each node is connected to the node following it. This forms a chain-like link of data
storage.
How do you reference all the elements in a one-dimension array? - Correct Answers -To
do this, an indexed loop is used, such that the counter runs from 0 to the array size
minus one. In this manner, we are able to reference all the elements in sequence by
using the loop counter as the array subscript.
In what areas do data structures applied? - Correct Answers -Data structures is
important in almost every aspect where data is involved. In general, algorithms that
involve efficient data structure is applied in the following areas: numerical analysis,
operating system, A.I., compiler design, database management, graphics, and statistical
analysis, to name a few.
What is LIFO? - Correct Answers -LIFO is short for Last In First Out, and refers to how
data is accessed, stored and retrieved. Using this scheme, data that was stored last ,
should be the one to be extracted first. This also means that in order to gain access to
, the first data, all the other data that was stored before this first data must first be
retrieved and extracted.
What is a queue? - Correct Answers -A queue is a data structures that can simulates a
list or stream of data. In this structure, new elements are inserted at one end and
existing elements are removed from the other end.
What is Huffman's algorithm? - Correct Answers -Huffman's algorithm is associated in
creating extended binary trees that has minimum weighted path lengths from the given
weights. It makes use of a table that contains frequency of occurrence for each data
element.
What is Fibonacci search? - Correct Answers -Fibonacci search is a search algorithm
that applies to a sorted array. It makes use of a divide-and-conquer approach that can
greatly reduce the time needed in order to reach the target element.
Briefly explain recursive algorithm. - Correct Answers -Recursive algorithm targets a
problem by dividing it into smaller, manageable sub-problems. The output of one
recursion after processing one sub-problem becomes the input to the next recursive
process.
What are binary trees? - Correct Answers -A binary tree is one type of data structure
that has two nodes, a left node and a right node. In programming, binary trees are
actually an extension of the linked list structures.
Which data structures is applied when dealing with a recursive function? - Correct
Answers -Recursion, which is basically a function that calls itself based on a terminating
condition, makes use of the stack. Using LIFO, a call to a recursive function saves the
return address so that it knows how to return to the calling function after the call
terminates.
What is a stack? - Correct Answers -A stack is a data structure in which only the top
element can be accessed. As data is stored in the stack, each data is pushed
downward, leaving the most recently added data on top.
Explain Binary Search Tree - Correct Answers -A binary search tree stores data in such
a way that they can be retrieved very efficiently. The left subtree contains nodes whose
keys are less than the node's key value, while the right subtree contains nodes whose
keys are greater than or equal to the node's key value. Moreover, both subtrees are
also binary search trees.
What are multidimensional arrays? - Correct Answers -Multidimensional arrays make
use of multiple indexes to store data. It is useful when storing data that cannot be
represented using a single dimensional indexing, such as data representation in a board
game, tables with data stored in more than one column.
