Font size
WorksheetsDATA STRUCTURE Basic Info
Total questions: 41
Worksheet time: 25mins
It refers to collection of variables, possibly of several different data types connected in various ways.
Data Structures
Database
Arrays
Abstraction
The process of accessing data stored in a serial access memory is similar to manipulating data on a/an:
Array
BInary Tree
Heap
Stack
Which of the following data structure store the homogeneous data elements?
Records
Arrays
Lists
Pointers
Which of the following is NOT a Type of Data Structures?
Arrays
Tables
Stacks
Trees
Which of the following data structures CANNOT store the non-homogeneous data elements?
Pointers
Array
Records
Stack
Data that a variable can hold in a programming language, all programming language has a set of it.
Programming
Algorithms
Data Types
Variables
Storage for data defined in terms of set of operations to be performed on the data
Arrays
Variables
Abstract Data Types
Algorithms
Are the data items presented to the algorithm. An algorithm has either no input or a predetermined number of them.
Data
Procedure
Output
Input
Are the data items presented to the outside world as the result of the execution of a program based on the algorithm.
Input
Procedure
Output
Raw data
The number of edges from the node to the deepest leaf is called ___ of the tree.
Depth
Height
Length
Width
Which of the following is non-liner data structure?
Stacks
List
Stringd
Tress
It can be used to encapsulate parts of an algorithm by localizing in one section of a program all the statements relevant to a certain aspect of a program.
Algorithms
Pseudocodes
Flowcharting
Procedures
Ordered set of a variable number of elements to which additions and deletions may be made
Array
List
Variables
Constant
Ordered collection of data items of the same type referred to collectively by a single name
List
Array
Variables
Constants
Which of the following definitions of Array Terms is CORRECT?
Index - each variable or cell in an array
Dimensions - an integer from 1 - n called dimensioned variables
Elements-Individual data indicated by the array name
All of the Choices
A series of values stored in memory is called ___
A struct
A matrix
A tress
An array
n some languages, arrays are also called ___
Groups of arrows
roots or leaves
lists of vectors
Lines or strings
Almost all programming languages start arrays at index 0.
True
False
Arrays of characters, like letters, numbers, punctuation and other written symbols, are called ___
Structs
Ventors
Strings
Groups
type of struct that stores a variable, like a number, and also a pointer is called ___
A nodule
a radix
a node/ element
a root
A flexible data structure that can store many nodes is called ___
A tree
A linked list
A pointer
A queue
Complex data structures built on top of linked lists, that use First-In First-Out behaviour, are called ___
Queues
Vectors
Strings
Stacks
When linked lists are used as stacks, what kind of behaviour is implemented?
First-In-First_Out (FIFO)
First-In-Last-Out (FILO)
Last-In-Last-Out (LILO)
Last-In-First-Out (LIFO)
Which data structure is used for data that links arbitrarily, and includes things like loops?
Stack
Tree
Graphs
Queue
What is a static structure?
A structure fixed in size
A structure that cannot be changed
A structure that cannot be moved
A structure that is influenced by electricity
What is a dynamic structure?
A structure that can be moved
A structure that moves by itself
A structure which's size can change
A structure that works
Which structures does an array have?
Dynamic and immutable structures
Dynamic and mutable structures
Static and immutable structures
Static and mutable structures
What is an array?
A list of things
Collection of elements with array keys
Mathematical division
None of the above
What do you call a collection of items stored at contiguous memory locations?
Linked List
Linear List
Array
Data Structure
Which of the following are examples of Data Structures? (Click 2 possible answers)
Linear List
Linked List
Stacks
Pseudocodes
A _____d L___ is a linear data structure, in which elements are not stored at contiguous memory locations.
(a)
What does LIFO stand for?
(a)
What do you this data structure classification in which the elements are stored/accessed on a non-linear order such as trees and graphs.
trees
linear
non-linear
graphs
G (a) are used to represent networks. The networks may include paths in a city or telephone network or circuit network.
In linked list, the elements are using P (a) s to linked the data item to the next address in memory location.
Arranging the books in order and removing from the topmost book is an example for________
Linked List
Queue
Stack
In ___________ type of linked lists we can traverse in both the directions.
Singly linked list
Circular linked list
One dimensional linked list
Doubly linked list
._____________ is a data structure in which every individual node consists of INFO to store data and LINK to store the address of the next node.
Queue
Stack
Singly Linked List
Circular queue
Which of the following is a linear data structure?
Graph
Tree
Linked list
How can we describe an array in the best possible way?
The Array shows a hierarchical structure.
Arrays are immutable (Not Modifiable)
The Array is not a data structure
Container that stores the elements of similar types
Which of the following is not the correct statement for a stack data structure?
Arrays can be used to implement the stack
Stack follows FIFO
Elements are stored in a sequential manner
Top of the stack contains the last inserted element
