DATA STRUCTURES EXAM
QUESTIONS WITH CORRECT
ANSWERS
linear data structures - Correct Answers -arrays and lists. its elements form a sequence
arrays data structure - Correct Answers -Array
Bit array
Bit field
Bitboard
Bitmap
Circular buffer
Control table
Image
Dope vector
Dynamic array
Gap buffer
Hashed array tree
Heightmap
Lookup table
Matrix
Parallel array
Sorted array
Sparse array
Sparse matrix
Iliffe vector
Variable-length array
lists data structure - Correct Answers -Doubly linked list
Array list
Linked list
Self-organizing list
Skip list
Unrolled linked list
VList
Conc-Tree list
,Xor linked list
Zipper
Doubly connected edge list
Difference list
Free list
trees data structure - Correct Answers -a widely used abstract data type (ADT)—or data
structure implementing this ADT—that simulates a hierarchical tree structure, with a root
value and subtrees of children with a parent node, represented as a set of linked nodes.
binary trees, b-trees, heaps, trees, multiway trees, space-partitioning trees, application-
specific trees
abstract data type (ADT) - Correct Answers -a mathematical model of the data objects
that make up a data type as well as the functions that operate on these objects. a data
type is defined by its behavior (semantics), specifically in terms of possible values,
possible operations on data of this type, and the behavior of these operations. This
contrasts with data structures, which are concrete representations of data, and are the
point of view of an implementer, not a user.
Container
List
Associative array
Multimap
Set
Multiset
Stack
Queue
Double-ended queue
Priority queue
Tree
Graph
data structures - Correct Answers -concrete representations of data from the point of
view of an implementer, not a user
data types - Correct Answers -Primitive types, Composite types, Abstract data types. a
classification identifying one of various types of data that determines the possible values
for that type, the operations that can be done on values of that type, the meaning of the
data, and the way values of that type can be stored. Data types are used within type
systems, which offer various ways of defining, implementing and using them. Different
type systems ensure varying degrees of type safety.
primitive data types - Correct Answers -a basic type or a built-in type. In most
programming languages, all basic data types are built-in. In addition, many languages
also provide a set of composite data types. Opinions vary as to whether a built-in type
that is not basic should be considered "primitive".
Boolean, true or false
,Character
Floating-point, single-precision real number values
Double, a wider floating-point size
Integer, integral or fixed-precision values
Enumerated type, a small set of uniquely-named values
basic type - Correct Answers -a data type provided by a programming language as a
basic building block. Most languages allow more complicated composite types to be
recursively constructed starting from basic types.
built-in type - Correct Answers -a data type for which the programming language
provides built-in support.
Composite types - Correct Answers -a data type. a composite data type or compound
data type is any data type that can be constructed in a program using the programming
language's primitive data types and other composite types. It is sometimes called a
structure or aggregate data type, although the latter term may also refer to arrays, lists,
etc. The act of constructing a composite type is known as composition.
Array
Record (also called tuple or struct)
Union
Tagged union (also called variant, variant record, discriminated union, or disjoint union)
Binary trees - Correct Answers -AA tree
AVL tree
Binary search tree
Binary tree
Cartesian tree
Left-child right-sibling binary tree
Order statistic tree
Pagoda
Randomized binary search tree
Red-black tree
Rope
Scapegoat tree
Self-balancing binary search tree
Splay tree
T-tree
Tango tree
Threaded binary tree
Top tree
Treap
WAVL tree
Weight-balanced tree
B-trees - Correct Answers -B-tree
, B+ tree
B*-tree
B sharp tree
Dancing tree
2-3 tree
2-3-4 tree
Queap
Fusion tree
Bx-tree
AList
Heaps - Correct Answers -tree data structure. a specialized tree-based data structure
that satisfies the heap property: If A is a parent node of B then the key (the value) of
node A is ordered with respect to the key of node B with the same ordering applying
across the heap. A heap can be classified further as either a "max heap" or a "min
heap". In a max heap, the keys of parent nodes are always greater than or equal to
those of the children and the highest key is in the root node. In a min heap, the keys of
parent nodes are less than or equal to those of the children and the lowest key is in the
root node. Heaps are crucial in several efficient graph algorithms such as Dijkstra's
algorithm, and in the sorting algorithm heapsort. A common implementation of a heap is
the binary heap, in which the tree is a complete binary tree (see figure).
-In a heap, the highest (or lowest) priority element is always stored at the root. A heap is
not a sorted structure and can be regarded as partially ordered. As visible from the
heap-diagram, there is no particular relationship among nodes on any given level, even
among the siblings. When a heap is a complete binary tree, it has a smallest possible
height—a heap with N nodes always has log N height. A heap is a useful data structure
when you need to remove the object with the highest (or lowest) priority.
-Note that, as shown in the graphic, there is no implied ordering between siblings or
cousins and no implied sequence for an in-order traversal (as there would be in, e.g., a
binary search tree). The heap relation mentioned above applies only between nodes
and their parents, grandparents, etc. The maximum number of children each node can
have depends on the type of heap, but in many types it is at most two, which is known
as a binary heap.
-The heap is one maximally efficient IMPLEMENTATION of an abstract
Trees - Correct Answers -In these data structures each tree node compares a bit slice
of key values.
Trie
Radix tree
Suffix tree
Suffix array
Compressed suffix array
FM-index
Generalised suffix tree
B-trie
Judy array
QUESTIONS WITH CORRECT
ANSWERS
linear data structures - Correct Answers -arrays and lists. its elements form a sequence
arrays data structure - Correct Answers -Array
Bit array
Bit field
Bitboard
Bitmap
Circular buffer
Control table
Image
Dope vector
Dynamic array
Gap buffer
Hashed array tree
Heightmap
Lookup table
Matrix
Parallel array
Sorted array
Sparse array
Sparse matrix
Iliffe vector
Variable-length array
lists data structure - Correct Answers -Doubly linked list
Array list
Linked list
Self-organizing list
Skip list
Unrolled linked list
VList
Conc-Tree list
,Xor linked list
Zipper
Doubly connected edge list
Difference list
Free list
trees data structure - Correct Answers -a widely used abstract data type (ADT)—or data
structure implementing this ADT—that simulates a hierarchical tree structure, with a root
value and subtrees of children with a parent node, represented as a set of linked nodes.
binary trees, b-trees, heaps, trees, multiway trees, space-partitioning trees, application-
specific trees
abstract data type (ADT) - Correct Answers -a mathematical model of the data objects
that make up a data type as well as the functions that operate on these objects. a data
type is defined by its behavior (semantics), specifically in terms of possible values,
possible operations on data of this type, and the behavior of these operations. This
contrasts with data structures, which are concrete representations of data, and are the
point of view of an implementer, not a user.
Container
List
Associative array
Multimap
Set
Multiset
Stack
Queue
Double-ended queue
Priority queue
Tree
Graph
data structures - Correct Answers -concrete representations of data from the point of
view of an implementer, not a user
data types - Correct Answers -Primitive types, Composite types, Abstract data types. a
classification identifying one of various types of data that determines the possible values
for that type, the operations that can be done on values of that type, the meaning of the
data, and the way values of that type can be stored. Data types are used within type
systems, which offer various ways of defining, implementing and using them. Different
type systems ensure varying degrees of type safety.
primitive data types - Correct Answers -a basic type or a built-in type. In most
programming languages, all basic data types are built-in. In addition, many languages
also provide a set of composite data types. Opinions vary as to whether a built-in type
that is not basic should be considered "primitive".
Boolean, true or false
,Character
Floating-point, single-precision real number values
Double, a wider floating-point size
Integer, integral or fixed-precision values
Enumerated type, a small set of uniquely-named values
basic type - Correct Answers -a data type provided by a programming language as a
basic building block. Most languages allow more complicated composite types to be
recursively constructed starting from basic types.
built-in type - Correct Answers -a data type for which the programming language
provides built-in support.
Composite types - Correct Answers -a data type. a composite data type or compound
data type is any data type that can be constructed in a program using the programming
language's primitive data types and other composite types. It is sometimes called a
structure or aggregate data type, although the latter term may also refer to arrays, lists,
etc. The act of constructing a composite type is known as composition.
Array
Record (also called tuple or struct)
Union
Tagged union (also called variant, variant record, discriminated union, or disjoint union)
Binary trees - Correct Answers -AA tree
AVL tree
Binary search tree
Binary tree
Cartesian tree
Left-child right-sibling binary tree
Order statistic tree
Pagoda
Randomized binary search tree
Red-black tree
Rope
Scapegoat tree
Self-balancing binary search tree
Splay tree
T-tree
Tango tree
Threaded binary tree
Top tree
Treap
WAVL tree
Weight-balanced tree
B-trees - Correct Answers -B-tree
, B+ tree
B*-tree
B sharp tree
Dancing tree
2-3 tree
2-3-4 tree
Queap
Fusion tree
Bx-tree
AList
Heaps - Correct Answers -tree data structure. a specialized tree-based data structure
that satisfies the heap property: If A is a parent node of B then the key (the value) of
node A is ordered with respect to the key of node B with the same ordering applying
across the heap. A heap can be classified further as either a "max heap" or a "min
heap". In a max heap, the keys of parent nodes are always greater than or equal to
those of the children and the highest key is in the root node. In a min heap, the keys of
parent nodes are less than or equal to those of the children and the lowest key is in the
root node. Heaps are crucial in several efficient graph algorithms such as Dijkstra's
algorithm, and in the sorting algorithm heapsort. A common implementation of a heap is
the binary heap, in which the tree is a complete binary tree (see figure).
-In a heap, the highest (or lowest) priority element is always stored at the root. A heap is
not a sorted structure and can be regarded as partially ordered. As visible from the
heap-diagram, there is no particular relationship among nodes on any given level, even
among the siblings. When a heap is a complete binary tree, it has a smallest possible
height—a heap with N nodes always has log N height. A heap is a useful data structure
when you need to remove the object with the highest (or lowest) priority.
-Note that, as shown in the graphic, there is no implied ordering between siblings or
cousins and no implied sequence for an in-order traversal (as there would be in, e.g., a
binary search tree). The heap relation mentioned above applies only between nodes
and their parents, grandparents, etc. The maximum number of children each node can
have depends on the type of heap, but in many types it is at most two, which is known
as a binary heap.
-The heap is one maximally efficient IMPLEMENTATION of an abstract
Trees - Correct Answers -In these data structures each tree node compares a bit slice
of key values.
Trie
Radix tree
Suffix tree
Suffix array
Compressed suffix array
FM-index
Generalised suffix tree
B-trie
Judy array
