DSA EXAM QUESTIONS WITH
CORRECT ANSWERS
Data - Correct Answers -represents the overall resource of the
organization, it can exist in different forms; such as numbers and characters/text on
pieces of paper, as bits and bytes stored in computer memory, or as raw facts stored
in a person's mind.
Data Structure - Correct Answers -it is a way of collecting and organizing elements or
items of data.
It is
an arrangement of data in a computer's memory in such a way that it can access
quickly to the processor for the required calculations.
Abstract Data Type - Correct Answers -It is which is independent of implementation.
Algorithm - Correct Answers -is a finite set of instructions or procedures,
written in order, to solve a certain predefined task.
Time Complexity - Correct Answers -It is a way to signify the amount of time needed by
the
program to run to completion.
Space Complexity - Correct Answers -It is the amount of memory space necessary by
the
algorithm, during the course of its execution. Space complexity must be taken
extremely for multi-user systems and in situations where limited memory is
available.
Instruction Space - Correct Answers -space required to store the executable version of
the
program. This space is static but differs depending upon the number of lines of
code in the program
Data Space - Correct Answers -space required to store all the constants and variables
value.
Environment Space - Correct Answers -space necessary to store the environment
information
needed to restart the suspended function.
, Traffic system - Correct Answers -In computer-controlled traffic system, circular queues
are
used to switch on the traffic lights one by one repeatedly as per the time set.
CPU Scheduling - Correct Answers -Operating systems often maintain a queue of
processes
that are ready to execute or that are waiting for a particular event to occur.
Priority Queues - Correct Answers -each element was based on the urgency of the
need.
Primitive data structures - Correct Answers -A data structure that cannot be
decomposed to other data structures.
Integers, float, pointers, Booleans, and characters are under this type.
These primitive data structures are the basis for the discussion of a more
sophisticated data structure.
Non-primitive data structures - Correct Answers -It is a more complicated data structure
and is derived from one or more
primitive data structures. The simple data structures built from primitives
are strings, arrays, lists, records, and files.
Linear data structure - Correct Answers -Elements are connected and accessed in
sequential order by means of
logically or in sequence memory locations.
stacks, queues, and linked list - Correct Answers -examples of linear data structure
Non-linear data structure - Correct Answers -Data items are not arranged in sequential
order.
trees, graphs - Correct Answers -Examples of Non-linear data structure
list - Correct Answers -It is a collection of an ordered sequence of items.
linked list - Correct Answers -It is a data structure that uses pointers to connect
individual list elements
and it is also made up of multiple nodes that contain the address of the next node.
Head - Correct Answers -The figure represents the linked list with a pointer to the first
node of the list
Null - Correct Answers -It indicates that there is no next node.
Pointers - Correct Answers -It is used to store addresses of a variable.
CORRECT ANSWERS
Data - Correct Answers -represents the overall resource of the
organization, it can exist in different forms; such as numbers and characters/text on
pieces of paper, as bits and bytes stored in computer memory, or as raw facts stored
in a person's mind.
Data Structure - Correct Answers -it is a way of collecting and organizing elements or
items of data.
It is
an arrangement of data in a computer's memory in such a way that it can access
quickly to the processor for the required calculations.
Abstract Data Type - Correct Answers -It is which is independent of implementation.
Algorithm - Correct Answers -is a finite set of instructions or procedures,
written in order, to solve a certain predefined task.
Time Complexity - Correct Answers -It is a way to signify the amount of time needed by
the
program to run to completion.
Space Complexity - Correct Answers -It is the amount of memory space necessary by
the
algorithm, during the course of its execution. Space complexity must be taken
extremely for multi-user systems and in situations where limited memory is
available.
Instruction Space - Correct Answers -space required to store the executable version of
the
program. This space is static but differs depending upon the number of lines of
code in the program
Data Space - Correct Answers -space required to store all the constants and variables
value.
Environment Space - Correct Answers -space necessary to store the environment
information
needed to restart the suspended function.
, Traffic system - Correct Answers -In computer-controlled traffic system, circular queues
are
used to switch on the traffic lights one by one repeatedly as per the time set.
CPU Scheduling - Correct Answers -Operating systems often maintain a queue of
processes
that are ready to execute or that are waiting for a particular event to occur.
Priority Queues - Correct Answers -each element was based on the urgency of the
need.
Primitive data structures - Correct Answers -A data structure that cannot be
decomposed to other data structures.
Integers, float, pointers, Booleans, and characters are under this type.
These primitive data structures are the basis for the discussion of a more
sophisticated data structure.
Non-primitive data structures - Correct Answers -It is a more complicated data structure
and is derived from one or more
primitive data structures. The simple data structures built from primitives
are strings, arrays, lists, records, and files.
Linear data structure - Correct Answers -Elements are connected and accessed in
sequential order by means of
logically or in sequence memory locations.
stacks, queues, and linked list - Correct Answers -examples of linear data structure
Non-linear data structure - Correct Answers -Data items are not arranged in sequential
order.
trees, graphs - Correct Answers -Examples of Non-linear data structure
list - Correct Answers -It is a collection of an ordered sequence of items.
linked list - Correct Answers -It is a data structure that uses pointers to connect
individual list elements
and it is also made up of multiple nodes that contain the address of the next node.
Head - Correct Answers -The figure represents the linked list with a pointer to the first
node of the list
Null - Correct Answers -It indicates that there is no next node.
Pointers - Correct Answers -It is used to store addresses of a variable.
