Data Structures and Algorithms

BY-LANGGA
PRELIM QUIZ 1
1. Linked lists are best suited …..

A. for relatively permanent collections of data.

B. the size of the structure and the data in the structure are constantly changing.
C. data structure
D. for none of the above situation
2) The operation of processing each element in the list is known as ……
A. sorting
B. merging
C. inserting
D. traversal

3) The situation when in a linked list START=NULL is ….

A. Underflow
B. Overflow
C. Houseful
D. Saturated

4) Each node in singly linked list has …….. fields.

A.2
B.3
C.1
D. 4

5) Which of the following are two-way lists?

A. Grounded header list

B. Circular header list
C. Linked list with header and trailer nodes
D. List traversed in two directions

6) Which is the pointer associated with the availability list?

A. FIRST
B. AVAIL
C. TOP
D. REAR

7) Value of first linked list index is ….

A. 0
B. 1
C. -1
D. 2

8) In linked lists, there are no NULL links in

A. single linked list
B. linear doubly linked list
C. circular linked list
D. linked list

9) Each node in a linked list must contain at least ….

A. Three fields
B. Two fields
C. Four fields
D. Five fields

10) The dummy header in linked list contain …..

A. first record of the actual data
B. last record of the actual data
C. pointer to the last record of the actual data
D. middle record of the actual data

11) In a linked list the ………. field contains the address of next element in the list.
A. Link field
B. Next element field
C. Start field
D. Info field

12) LLINK is the pointer pointing to the …

A. successor node
B. predecessor node

C. head node
D. last node

13) ………. refers to a linear collection of data items.

A. List
B. Tree
C. Graph
D. Edge

14) A run list is ……

A. small batches of records from a file
B. number of elements having same value
C. number of records
D. number of files in external storage

15) A …… indicates the end of the list.

A. Guard
B. Sentinel
C. End pointer
D. Last pointer

16) A …….. is a linear list in which insertions and deletions are made to from either end of the
structure.
A. circular queue
B. random of queue
C. priority

D. dequeue

17) Indexing the …….. element in the list is not possible in linked lists.
A. middle
B. first
C. last
D. any where in between

18) A linear list in which the pointer points only to the successive node is ……
A. singly linked list
B. circular linked list
C. doubly linked list
D. none of the above

19) ………. may take place only when there is some minimum amount(or) no space left in free
storage list.
A. Memory management
B. Garbage collection
C. Recycle bin
D. Memory management
20) A linear list in which the last node points to the first node is ……..
A. singly linked list
B. circular linked list
C. doubly linked list
D. none of the above

PRELIM QUIZ 2
Question 1
Answer saved
Marked out of 1.00

Flag question

Question text
The term used to insert an element into stack.

Select one:
a.
pump

b.
pop

c.
pull

d.
push

Clear my choice

Question 2
Answer saved
Marked out of 1.00

Flag question
 Question text
A pointer variable which contains the location at the top element of the stack.

Select one:
a.
Last

b.
End

c.
Final

d.
Top

Clear my choice

Question 3
Answer saved
Marked out of 1.00

Flag question

Question text
Deletion operation is done using __________ in a queue.

Select one:
a.
list

b.
rear

c.
front

d.
top

Clear my choice

Question 4
Answer saved
Marked out of 1.00

Flag question

Question text
This is the insertion operation in the stack.

Select one:
a.
insert

b.
top

c.
pop

d.
push

Clear my choice

Question 5
Answer saved
Marked out of 1.00

Flag question

Question text
This form of access is used to add/remove nodes from a stack.

Select one:
a.
FIFO

b.
Both of these

c.
LIFO

d.
None of these

Clear my choice

Question 6
Answer saved
Marked out of 1.00

Flag question

Question text
Stack follows the strategy of ________________.

Select one:
a.
LRU

b.
RANDOM

c.
FIFO

d.
LIFO

Clear my choice

Question 7
Answer saved
Marked out of 1.00

Flag question

Question text
In linked representation of stack, the null pointer of the last node in the list signals
_____________________.
Select one:
a.
Bottom of the stack

b.
In between some value

c.
Beginning of the stack

d.
Middle of the stack

Clear my choice

Question 8
Answer saved
Marked out of 1.00

Flag question

Question text
New nodes are added to the ________ of the queue.

Select one:
a.
Back

b.
Middle

c.
Front

d.
Front and Back

Clear my choice

Question 9
Answer saved
Marked out of 1.00
 Flag question

Question text
Which of the following names does not relate to stacks?

Select one:
a.
Push down lists

b.
Piles

c.
FIFO lists

d.
LIFO lists

Clear my choice

Question 10
Answer saved
Marked out of 1.00

Flag question

Question text
This form of access is used to add and remove nodes from a queue.

Select one:
a.
FIFO, First In First Out

b.
Both of these

c.
None of these
 d.
LIFO, Last In First Out

Clear my choice

PRELIM EXAM
Question 1
Complete
Mark 1.00 out of 1.00

Flag question

Question text
Data
Answer  consists of raw facts, such as an employee number, total hours
worked in a week, inventory part numbers, or sales orders.

Question 2
Complete
Mark 1.00 out of 1.00

Flag question

Question text
“Information plays a vital role in organizations, and in recent years companies have
recognized the significance of corporate data as an organizational asset”.

Select one:
True
False

Question 3
Complete
Mark 1.00 out of 1.00

Flag question

Question text
Inkjet printers are also slower than comparable laser printers.

Select one:
True
False

Question 4
Complete
Mark 1.00 out of 1.00

Flag question

Question text
In this stage, mainly concentrate on building a strong relationship with suppliers of the raw
materials required for production.

Select one:
a.
Make

b.
Plan

c.
Develop
d.
Deliver

Question 5
Complete
Mark 1.00 out of 1.00
 Flag question

Question text
A network allows you to share internet connections, data and resources within your
business, improving both efficiency and speed of working.

Select one:
True
False

Question 6
Complete
Mark 1.00 out of 1.00

Flag question

Question text
In case of returns management, synchronizing material movements is a common issue that
needs to be handled is called control.

Select one:
True
False

Question 7
Complete
Mark 1.00 out of 1.00

Flag question

Question text
Match the Column A that is corresponding to Column B.
Gaining a strategic advantage over
competitors requires the innovative
Answer 1
application of information technologies.
Support of Strategies for Competitive Advantage

Information systems also help store

managers and other business professionals
Answer 2
make better decisions.
Support of Business Decision Making

As a consumer, you regularly encounter

information systems that support the
business processes and operations at the Answer 3
many retail stores where you shop. Support of Business Processes and Operations

Question 8
Complete
Mark 1.00 out of 1.00

Flag question

Question text
It is the reverse of order fill rate and marks the portion of orders lost because of a stock out.

Select one:
a.
Stock in

b.
Order refill

c.
Stock out

d.
Back order

Question 9
Complete
Mark 1.00 out of 1.00
 Flag question

Question text
System Analysts are people who use an information system or the information it produces.

Select one:
True
False

Question 10
Complete
Mark 1.00 out of 1.00

Flag question

Question text
Senior
Answer  level managers are concerned with the long-term planning of the
organization.

Question 11
Complete
Mark 1.00 out of 1.00

Flag question

Question text
Probability of on-time delivery is the portion of customer orders that are completed on-
time.

Select one:
 True
False

Question 12
Complete
Mark 1.00 out of 1.00

Flag question

Question text
Cycle time
Answer  is often called the lead time.

Question 13
Complete
Mark 1.00 out of 1.00

Flag question

Question text
In the stage, defective or damaged goods are returned to the supplier by the customer.

Select one:
a.
Develop

b.
Plan

c.
Return

d.
Make

Question 14
Complete
Mark 1.00 out of 1.00
 Flag question

Question text
Transaction processing systems are used to record day to day business transactions of the
organization.

Select one:
True
False

Question 15
Complete
Mark 1.00 out of 1.00

Flag question

Question text
Know ledge
Answer  is can be described as: “an awareness and understanding of a set
of information and the ways that information can be used to support a specific task or reach
a decision”.

Question 16
Complete
Mark 1.00 out of 1.00

Flag question

Question text
E-business and e-commerce applications involve interconnected business information
systems under applications.
Select one:
True
False

Question 17
Complete
Mark 1.00 out of 1.00

Flag question

Question text
Impact printers are more expensive than other types of printers but are more economical if
you do lots of printing and are relatively fast.

Select one:
True
False

Question 18
Complete
Mark 1.00 out of 1.00

Flag question

Question text
It was first used by IBM in 1996.

Select one:
a.
e-business

b.
e-website
 c.
online transaction

d.
e-commerce

Question 19
Complete
Mark 1.00 out of 1.00

Flag question

Question text
Managing information technology emphasizes the quality, strategic business value, and
security of an organization’s information systems.

Select one:
True
False

Question 20
Complete
Mark 1.00 out of 1.00

Flag question

Question text
feedbac
It is data about the performance of a system, it is the Answer .

Question 21
Complete
Mark 1.00 out of 1.00

Flag question

Question text
Information Systems are used by tactical managers to monitor the organization's current
performance status.

Select one:
True
False

Question 22
Complete
Mark 1.00 out of 1.00

Flag question

Question text
Tactical users make final structured decisions.

Select one:
True
False

Question 23
Complete
Mark 1.00 out of 1.00

Flag question

Question text
Impact printers
Answer are now rarely used except for special purposes.

Question 24
Complete
Mark 1.00 out of 1.00
 Flag question

Question text
Information
Answer  is a collection of facts organized and processed so that they have
additional value beyond the value of the individual facts.

Question 25
Complete
Mark 1.00 out of 1.00

Flag question

Question text
Implementing ways to use information technology in business includes designing the basic
components of information systems.

Select one:
True
False

Question 26
Complete
Mark 1.00 out of 1.00

Flag question

Question text
Management Inform
MIS is stands for Answer

Question 27
Complete
Mark 1.00 out of 1.00
 Flag question

Question text
Information S
An Answer Information System is a set of interrelated components that collect,
manipulate, store, and disseminate data and information and provide a feedback
mechanism to meet an objective

Question 28
Complete
Mark 1.00 out of 1.00

Flag question

Question text
It involves monitoring and evaluating feedback to determine whether a system is moving
Control
toward the achievement of its goal, it is called the  Answer Control.

Question 29
Complete
Mark 1.00 out of 1.00

Flag question

Question text
In this stage, the products are designed, produced, tested, packaged, and synchronized for
delivery.

Select one:
a.
Develop

b.
Make

c.
Deliver

d.
Plan

Question 30
Complete
Mark 1.00 out of 1.00

Flag question

Question text
operational
The Answer operational level is concerned with performing day to day business
transactions of the organization.

Question 31
Complete
Mark 1.00 out of 1.00

Flag question

Question text
CMR is a software allows for more efficient communication with your prospects and clients.

Select one:
True
False

Question 32
Complete
Mark 1.00 out of 1.00
 Flag question

Question text
Online Analytical Processing
OLAP is stands for Answer Online Analytical Processing.

Question 33
Complete
Mark 1.00 out of 1.00

Flag question

Question text
It involves monitoring and evaluating feedback to determine whether a system is moving
Control
toward the achievement of its goal, it is called the  Answer Control.

Question 34
Complete
Mark 1.00 out of 1.00

Flag question

Question text
Decision support sy
Answer  Decision support system sare used by senior management to make
non-routine decisions.

Question 35
Complete
Mark 1.00 out of 1.00
 Flag question

Question text
It also comprises movement and storage of raw materials that are involved in work in
progress, inventory and fully furnished goods.

Select one:
a.
OLAP
b.
e-transaction
c.
e-commerce

d.
SCM

Question 36
Complete
Mark 1.00 out of 1.00

Flag question

Question text
These are suitable for most office printing needs.

Select one:
a.
3-in-1 Printer

b.
Inkjet printers 

c.
Impact printers

d.
Laser printers 

Question 37
Complete
Mark 1.00 out of 1.00

Flag question

Question text
Computer networks are systems of information processing components that use a variety of
hardware, software, data management, and telecommunications network technologies.

Select one:
True
False

Question 38
Complete
Mark 1.00 out of 1.00

Flag question

Question text
It refers to any business conducted online using the internet and related digital
E-business
technologies called Answer E-business.

Question 39
Complete
Mark 1.00 out of 1.00

Flag question
 Question text
Data
Answer  Data is collected in order to create information and knowledge about
particular subjects that interest any given organization in order for that organization to
make better management decisions.

Question 40
Complete
Mark 1.00 out of 1.00

Flag question

Question text
Management systems mimic human expertise to identify patterns in large data sets.

Select one:
True
False

Question 41
Complete
Mark 1.00 out of 1.00

Flag question

Question text
order fill rate
 The Answer order fill rate is the portion of customer demands that can
be easily satisfied from the stock available.

Question 42
Complete
Mark 1.00 out of 1.00
 Flag question

Question text
It is as an umbrella term that encompasses e-commerce, e-sales, e-banking, e-learning and
online communication.

Select one:
a.
e- transaction

b.
online transaction
c.
online system

d.
e-business

Question 43
Complete
Mark 1.00 out of 1.00

Flag question

Question text
It can be defined as the management of flow of products and services, which begins from
the origin of products and ends at the product’s consumption.

Select one:
a.
E-commerce

b.
SCM
 c.
E-transaction

d.
OLAP

Question 44
Complete
Mark 1.00 out of 1.00

Flag question

Question text
It is used to query and analyze multi-dimensional data and produce information that can be
viewed in different ways using multiple dimensions.
OLAP
Answer: 

Question 45
Complete
Mark 1.00 out of 1.00

Flag question

Question text
Tactical users are the decisions that partly based on set guidelines and judgmental calls. 

Select one:
True
False

Question 46
Complete
Mark 1.00 out of 1.00

Flag question
 Question text
Strategic Systems are used for giving the lower advantage of competition to the
organization.

Select one:
True
False

Question 47
Complete
Mark 1.00 out of 1.00

Flag question

Question text
This stage is basically the logistics phase, where customer orders are accepted and delivery
of the goods is planned.

Select one:
a.
Develop

b.
Deliver

c.
Plan

d.
Make

Question 48
Complete
Mark 1.00 out of 1.00

Flag question

Question text
 operational
The Answer  operational level is concerned with performing day to day business
transactions of the organization.

Question 49

Complete
Mark 1.00 out of 1.00

Flag questionQuestion text

A strategic information system is not developed to respond to t he corporate world and
many business initiatives.

Select one:
True
False

Question 50
Complete
Mark 1.00 out of 1.00

Flag question

Question text
In this stage, the planning should mainly focus on designing a strategy that yields maximum
profit.

Select one:
a.
Plan

b.
Develop

c.
Make

d.
Deliver
MIDTERM QUIZ 1
Question 1
Answer saved
Marked out of 1.00

Flag question

Question text
The complexity of linear search algorithm.

Select one:
a.
O(logn)

b.
O(n2)

c.

d.
O(n logn)

Clear my choice

Question 2
Answer saved
Marked out of 1.00

Flag question

Question text
Which of the following is not the required condition for binary search algorithm?
Select one:
a.
There must be mechanism to delete and/or insert elements in list

b.
There should be the direct access to the middle element in any sub list.

c.
The list must be sorted

d.
Number values should only be present

Clear my choice

Question 3
Answer saved
Marked out of 1.00

Flag question

Question text
The average case occurs in linear search algorithm _______________.

Select one:
a.
when item is not the array at all

b.
when item is somewhere in the middle of the array

c.
when item is the last element in the array

d.
item is the last element in the array or item is not there at all

Clear my choice

Question 4
Answer saved
Marked out of 1.00
 Flag question

Question text
The complexity of sorting algorithm measures the __________ as a function of the number n
of items to be shorter.

Select one:
a.
average-case complexity

b.
case-complexity

c.
running time

d.
average time

Clear my choice

Question 5
Answer saved
Marked out of 1.00

Flag question

Question text
The method used by card sorter.

Select one:
a.
Radix sort

b.
Heap

c.
Insertion

d.
Quick

Clear my choice

Question 6
Answer saved
Marked out of 1.00

Flag question

Question text
_____________ order is the best possible for array sorting algorithm which sorts n item.

Select one:
a.
O(logn)

b.
O(n2)

c.
O(n logn)

d.
O(n+logn)

Clear my choice

Question 7
Answer saved
Marked out of 1.00

Flag question

Question text
State True or False for internal sorting algorithms.
i. Internal sorting are applied when the entire collection if data to be sorted is small enough
that the sorting can take place within main memory.
ii. The time required to read or write is considered significant in evaluating the performance
of internal sorting.

Select one:
a.
False, True

b.
False, False

c.
True, True

d.
True, False

Clear my choice

Question 8
Answer saved
Marked out of 1.00

Flag question

Question text
The complexity of merge sort algorithm.

Select one:
a.

b.
O(n logn)

c.
O(logn)

d.
O(n2)
 Clear my choice

Question 9
Answer saved
Marked out of 1.00

Flag question

Question text
The worst case occurs in linear

search algorithm when ________________.

Select one:
a.
Item is the last element in the array or item is not there at all

b.
Item is somewhere in the middle of the array

c.
Item is not in the array at all

d.
Item is the last element in the array

Clear my choice

Question 10
Answer saved
Marked out of 1.00

Flag question

Question text
___________ sorting algorithm is frequently used when n is small, where n is the total number
of elements.

Select one:
a.
Bubble

b.
Heap

c.
Insertion

d.
Quick

Clear my choice

MIDTERM QUIZ 2

Question 1
Not yet answered
Marked out of 1.00

Flag question

Question text
Which of the following is not the required condition for binary search algorithm?

Select one:
a.
Number values should only be present

b.
There must be mechanism to delete and/or insert elements in list

c.
The list must be sorted

d.
There should be the direct access to the middle element in any sub list.
 Clear my choice

Question 2
Not yet answered
Marked out of 1.00

Flag question

Question text
A connected graph T without any cycles is called a ____________.

Select one:
a.
Free tree

b.
A tree

c.
A tree graph

d.
all of these

Clear my choice

Question 3
Not yet answered
Marked out of 1.00

Flag question

Question text
This is a binary tree whose every node has either zero or two children.

Select one:
a.
extended binary tree

b.
binary search tree

c.
complete binary tree

d.
data structure

Clear my choice

Question 4
Not yet answered
Marked out of 1.00

Flag question

Question text
In a graph, if e=[u,v], then u and v are called _______________

Select one:
a.
All of the choices

b.
End points of e

c.
Adjacent nodes

d.
Neighbors

Clear my choice

Question 5
Not yet answered
Marked out of 1.00

Flag question
 Question text
This is a terminal node in a binary tree.

Select one:
a.
Branch

b.
Leaf

c.
Root

d.
Child

Clear my choice

Question 6
Not yet answered
Marked out of 1.00

Flag question

Question text
The complexity of sorting algorithm measures the __________ as a function of the number n
of items to be shorter.

Select one:
a.
average-case complexity

b.
running time

c.
average time

d.
case-complexity

Clear my choice
Question 7
Not yet answered
Marked out of 1.00

Flag question

Question text
The complexity of linear search algorithm.

Select one:
a.
O(logn)

b.

c.
O(n2)

d.
O(n logn)

Clear my choice

Question 8
Not yet answered
Marked out of 1.00

Flag question

Question text
The average case occurs in linear search algorithm _______________.

Select one:
a.
when item is somewhere in the middle of the array

b.
item is the last element in the array or item is not there at all
 c.
when item is the last element in the array

d.
when item is not the array at all

Clear my choice

Question 9
Not yet answered
Marked out of 1.00

Flag question

Question text
_____________ order is the best possible for array sorting algorithm which sorts n item.

Select one:
a.
O(logn)

b.
O(n logn)

c.
O(n+logn)

d.
O(n2)

Clear my choice

Question 10
Not yet answered
Marked out of 1.00

Flag question

Question text
Graph G is _____________ if for any pair u, v of nodes in G, there is a path from u to v or path
from v to u.

Select one:
a.
Literally connected

b.
Unliterally connected

c.
Directly connected

d.
Widely connected

MIDTERM EXAM
Question 1
Answer saved

Marked out of 1.00

Flag question

Question text
This form of access is used to add/remove nodes from a stack.
Select one:

a.

LIFO

b.

None of these

c.

Both of these
 d.

FIFO

Clear my choice

Question 2
Answer saved

Marked out of 1.00

Flag question

Question text
A pointer variable which contains the location at the top element of the stack.
Select one:

a.

Top

b.

Final

c.

Last

d.

End

Clear my choice

Question 3
Answer saved

Marked out of 1.00

 Flag question

Question text
Stack follows the strategy of ________________.
Select one:

a.

LIFO

b.

RANDOM

c.

LRU

d.

FIFO

Clear my choice

Question 4
Answer saved

Marked out of 1.00

Flag question

Question text
This is a binary tree whose every node has either zero or two children.
Select one:

a.

extended binary tree

 b.

complete binary tree

c.

data structure

d.

binary search tree

Clear my choice

Question 5
Answer saved

Marked out of 1.00

Flag question

Question text
This refers to a linear collection of data items.
Select one:

a.

Edge

b.

List

c.

Graph

d.

Tree

Clear my choice

Question 6
Answer saved

Marked out of 1.00

Flag question

Question text
The operation of processing each element in the list is known as ________________.
Select one:

a.

merging

b.

sorting

c.

inserting

d.

traversal

Clear my choice

Question 7
Answer saved

Marked out of 1.00

Flag question

Question text
This is a linear list in which insertions and deletions are made to form either end of the
structure.
Select one:
 a.

Priority

b.

Circular queue

c.

Random of queue

d.

Dequeue

Clear my choice

Question 8
Answer saved

Marked out of 1.00

Flag question

Question text
In a linked list, the ____________ contains the address of next element in the list.
Select one:

a.

Start field

b.

Link field

c.

Info field

d.

Next element field

 Clear my choice

Question 9
Answer saved

Marked out of 1.00

Flag question

Question text
Which of the following names does not relate to stacks?
Select one:

a.

Piles

b.

Push down lists

c.

FIFO lists

d.

LIFO lists

Clear my choice

Question 10
Answer saved

Marked out of 1.00

Flag question

Question text
The method used by card sorter.
Select one:

a.

Radix sort

b.

Quick

c.

Insertion

d.

Heap

Clear my choice

Question 11
Answer saved

Marked out of 1.00

Flag question

Question text
Linked lists are best suited _____________________.
Select one:

a.

for none of these situations

b.

for relatively permanent collections of data

c.

data structure

d.
for the size of the structure and the data in the structure are constantly changing

Clear my choice

Question 12
Answer saved

Marked out of 1.00

Flag question

Question text
Each node in a linked list must contain at least ___________________.
Select one:

a.

Two fields

b.

Three fields

c.

Five fields

d.

Four fields

Clear my choice

Question 13
Answer saved

Marked out of 1.00

Flag question
Question text
___________ sorting algorithm is frequently used when n is small, where n is the total number
of elements.
Select one:

a.

Heap

b.

Bubble

c.

Quick

d.

Insertion

Clear my choice

Question 14
Answer saved

Marked out of 1.00

Flag question

Question text
In linked representation of stack, ___________ fields hold the elements of the stack.
Select one:

a.

NULL

b.

LINK

c.
TOP

d.

INFO

Clear my choice

Question 15
Answer saved

Marked out of 1.00

Flag question

Question text
_____________ order is the best possible for array sorting algorithm which sorts n item.
Select one:

a.

O(n2)

b.

O(n logn)

c.

O(n+logn)

d.

O(logn)

Clear my choice

Question 16
Answer saved

Marked out of 1.00

 Flag question

Question text
Each node in singly linked list has _______ fields.
Select one:

a.

b.

c.

d.

Clear my choice

Question 17
Answer saved

Marked out of 1.00

Flag question

Question text
In a graph, if E=(u,v), it means _____________.
Select one:

a.

e begins at processor u and ends at successor v

 b.

e begins at processor v and ends at successor u

c.

u is adjacent to v but v is not adjacent to u

d.

v is adjacent to u but u is not adjacent to v

Clear my choice

Question 18
Answer saved

Marked out of 1.00

Flag question

Question text
What is a run list?
Select one:

a.

small batches of records from a file

b.

number of records

c.

number of files in external storage

d.

number of elements having same value

Clear my choice

Question 19
Answer saved

Marked out of 1.00

Flag question

Question text
This is a terminal node in a binary tree.
Select one:

a.

Root

b.

Child

c.

Leaf

d.

Branch

Clear my choice

Question 20
Answer saved

Marked out of 1.00

Flag question

Question text
This may take place only when there is some minimum amount or no space left in free
storage list.
Select one:
 a.

Memory management

b.

Maintenance

c.

Garbage collection

d.

Recycle bin

Clear my choice

Question 21
Answer saved

Marked out of 1.00

Flag question

Question text
Another name for directed graph.
Select one:

a.

Dir-graph

b.

Diregraph

c.

Direct graph

d.

Digraph
 Clear my choice

Question 22
Answer saved

Marked out of 1.00

Flag question

Question text
In a graph, if e=[u,v], then u and v are called _______________
Select one:

a.

End points of e

b.

Neighbors

c.

Adjacent nodes

d.

All of the choices

Clear my choice

Question 23
Answer saved

Marked out of 1.00

Flag question

Question text
LINK is the pointer pointing to the ____________________.
Select one:

a.

successor node

b.

last node

c.

predecessor node

d.

head node

Clear my choice

Question 24
Answer saved

Marked out of 1.00

Flag question

Question text
A connected graph T without any cycles is called ________________.
Select one:

a.

free graph

b.

non-cycle graph

c.

circular graph

d.
no cycle graph

Clear my choice

Question 25
Answer saved

Marked out of 1.00

Flag question

Question text
Which is the pointer associated with the stack?
Select one:

a.

FRONT

b.

FIRST

c.

REAR

d.

TOP

Clear my choice

Question 26
Answer saved

Marked out of 1.00

Flag question
Question text
A linear list in which the pointer points only to the successive node.
Select one:

a.

none of these

b.

doubly linked list

c.

circular linked list

d.

singly linked list

Clear my choice

Question 27
Answer saved

Marked out of 1.00

Flag question

Question text
The complexity of linear search algorithm.
Select one:

a.

O(n2)

b.

O(logn)

c.
O(n logn)

d.

Clear my choice

Question 28
Answer saved

Marked out of 1.00

Flag question

Question text
New nodes are added to the ________ of the queue.
Select one:

a.

Front

b.

Front and Back

c.

Back

d.

Middle

Clear my choice

Question 29
Answer saved

Marked out of 1.00

 Flag question

Question text
This is the insertion operation in the stack.
Select one:

a.

top

b.

pop

c.

push

d.

insert

Clear my choice

Question 30
Answer saved

Marked out of 1.00

Flag question

Question text
What happens when you push a new node onto a stack?
Select one:

a.

The new node is placed at the front of the linked list

 b.

No changes happen

c.

The new node is placed at the back of the linked list

d.

The new node is placed at the middle of the linked list

Clear my choice

Question 31
Answer saved

Marked out of 1.00

Flag question

Question text
Which of the following is not the required condition for binary search algorithm?
Select one:

a.

There should be the direct access to the middle element in any sub list.

b.

Number values should only be present

c.

There must be mechanism to delete and/or insert elements in list

d.

The list must be sorted

Clear my choice

Question 32
Answer saved

Marked out of 1.00

Flag question

Question text
The complexity of merge sort algorithm.
Select one:

a.

O(logn)

b.

O(n2)

c.

O(n logn)

d.

Clear my choice

Question 33
Answer saved

Marked out of 1.00

Flag question

Question text
Which of the following is two way lists?
Select one:
 a.

Circular header list

b.

List traversed in two directions

c.

Grounded header list

d.

Linked list with header and trailer nodes

Clear my choice

Question 34
Answer saved

Marked out of 1.00

Flag question

Question text
The worst case occurs in linear search algorithm when ________________.
Select one:

a.

Item is the last element in the array or item is not there at all

b.

Item is somewhere in the middle of the array

c.

Item is not in the array at all

d.

Item is the last element in the array

 Clear my choice

Question 35
Answer saved

Marked out of 1.00

Flag question

Question text
This form of access is used to add and remove nodes from a queue.
Select one:

a.

Both of these

b.

LIFO, Last In First Out

c.

FIFO, First In First Out

d.

None of these

Clear my choice

Question 36
Answer saved

Marked out of 1.00

Flag question

Question text
Which of the following is an application of stack?
Select one:

a.

all of these

b.

finding factorial

c.

tower of Hanoi

d.

infix to postfix

Clear my choice

Question 37
Answer saved

Marked out of 1.00

Flag question

Question text
This is the term used to delete an element from the stack.
Select one:

a.

Push

b.

Pump

c.

Pop

d.
Pull

Clear my choice

Question 38
Answer saved

Marked out of 1.00

Flag question

Question text
Value of first linked list index is _______________.
Select one:

a.

-1

b.

c.

d.

Clear my choice

Question 39
Answer saved

Marked out of 1.00

Flag question
Question text
What is a queue?
Select one:

a.

LIFO

b.

FIFO

c.

FILO

d.

LOFI

Clear my choice

Question 40
Answer saved

Marked out of 1.00

Flag question

Question text
This indicates the end of the list.
Select one:

a.

Sentinel

b.

End pointer

c.
Last pointer

d.

Guard

Clear my choice

Question 41
Answer saved

Marked out of 1.00

Flag question

Question text
The retrieval of items in a stack is ___________ operation.
Select one:

a.

pop

b.

push

c.

retrieval

d.

access

Clear my choice

Question 42
Answer saved

Marked out of 1.00

 Flag question

Question text
The dummy header in linked list contains ____________________.
Select one:

a.

first record of the actual data

b.

last record of the actual data

c.

middle record of the actual data

d.

pointer to the last record of the actual data

Clear my choice

Question 43
Answer saved

Marked out of 1.00

Flag question

Question text
The elements are removal from a stack in _________ order.
Select one:

a.

Hierarchical
 b.

Alternative

c.

Reverse

d.

Sequential

Clear my choice

Question 44
Answer saved

Marked out of 1.00

Flag question

Question text
The depth of complete binary tree is given by ________________.
Select one:

a.

Dn = n log2n

b.

Dn = n log2n+1

c.

Dn = log2n+1

d.

Dn = log2n

Clear my choice

Question 45
Answer saved

Marked out of 1.00

Flag question

Question text
The average case occurs in linear search algorithm _______________.
Select one:

a.

when item is somewhere in the middle of the array

b.

item is the last element in the array or item is not there at all

c.

when item is the last element in the array

d.

when item is not the array at all

Clear my choice

Question 46
Answer saved

Marked out of 1.00

Flag question

Question text
The term push and pop is related to _____________.
Select one:
 a.

stacks

b.

trees

c.

array

d.

lists

Clear my choice

Question 47
Answer saved

Marked out of 1.00

Flag question

Question text
The term used to insert an element into stack.
Select one:

a.

pull

b.

push

c.

pump

d.

pop
 Clear my choice

Question 48
Answer saved

Marked out of 1.00

Flag question

Question text
Which indicates pre-order traversal?
Select one:

a.

Root, Left sub-tree, Right sub-tree

b.

Right sub-tree, Left sub-tree and root

c.

Right sub-tree, Root, Left sub-tree

d.

Left sub-tree, Right sub-tree and root

Clear my choice

Question 49
Answer saved

Marked out of 1.00

Flag question

Question text
The complexity of sorting algorithm measures the __________ as a function of the number n
of items to be shorter.
Select one:

a.

average-case complexity

b.

case-complexity

c.

running time

d.

average time

Clear my choice

Question 50
Answer saved

Marked out of 1.00

Flag question

Question text
Indexing the ________________ element in the list is not possible in linked lists.
Select one:

a.

first

b.

anywhere in between

c.
last

d.

middle

Clear my choice

FINAL QUIZ 1
Question 1
Not yet answered
Marked out of 1.00

Flag question

Question text
Which of the following is not a limitation of binary search algorithm?

Select one:
a.
there must be a mechanism to access middle element directly

b.
must use a sorted array

c.
requirement of sorted array is expensive when a lot of insertion and deletions are needed

d.
binary search algorithm is not efficient when the data elements more than 1500

Clear my choice

Question 2
Not yet answered
Marked out of 1.00
 Flag question

Question text
These are binary trees with threads.

Select one:
a.
Threaded trees

b.
Special trees

c.
Pointer trees

d.
Special pointer trees

Clear my choice

Question 3
Not yet answered
Marked out of 1.00

Flag question

Question text
Sorting algorithm can be characterized as ________________.

Select one:
a.
Both of the choices

b.
Sophisticated algorithms that require the O(nlog2n) comparisons to sort items

c.
Simple algorithm which require the order of n2 comparisons to sort n items
 d.
None of these

Clear my choice

Question 4
Not yet answered
Marked out of 1.00

Flag question

Question text
Which of the following sorting algorithm is of the divide and conquer type?

Select one:
a.
Merge sort

b.
Selection sort

c.
Bubble sort

d.
Insertion sort

Clear my choice

Question 5
Not yet answered
Marked out of 1.00

Flag question

Question text
Trees are ________ if they are similar and have the same contents at corresponding nodes.

Select one:
a.
duplicate

b.
copies

c.
carbon copy

d.
replica

Clear my choice

Question 6
Not yet answered
Marked out of 1.00

Flag question

Question text
Binary search algorithm cannot be applied to _______________.

Select one:
a.
sorted linear array

b.
sorted linked list

c.
pointer array

d.
sorted binary trees

Clear my choice

Question 7
Not yet answered
Marked out of 1.00
 Flag question

Question text
Partition and exchange sort is ____________.

Select one:
a.
tree sort

b.
bubble sort

c.
quick sort

d.
heap sort

Clear my choice

Question 8
Not yet answered
Marked out of 1.00

Flag question

Question text
In a 2-tree, nodes with 0 children are called ___________.

Select one:
a.
outside node

b.
exterior node

c.
external node
 d.
outer node

Clear my choice

Question 9
Not yet answered
Marked out of 1.00

Flag question

Question text
In binary trees, nodes with no successor are called _______________.

Select one:
a.
Final nodes

b.
Terminal nodes

c.
End nodes

d.
Last nodes

Clear my choice

Question 10
Not yet answered
Marked out of 1.00

Flag question

Question text
Every node N in a binary tree T except the root has a unique parent called the ________ of N.

Select one:
a.
Antecedents

b.
Forerunner

c.
Predecessor

d.
Precursor

Clear my choice

FINAL EXAM
Question 1
Answer saved

Marked out of 1.00

Flag question

Question text
The value in the right child of a node (if it exists) in a binary search tree will be greater than the
value in the node itself.
Select one:

True

False

Question 2
Answer saved

Marked out of 1.00

Flag question

Question text
A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is
called ____________________.
Select one:

a.

AVL tree

b.

None of these

c.

Lemma tree

d.

Red-black tree

Clear my choice

Question 3
Answer saved

Marked out of 1.00

Flag question

Question text
____________________ is not the component of data structure.
Select one:

a.

Algorithms

b.

Storage structures

c.

None of these
 d.

Operations

Clear my choice

Question 4
Answer saved

Marked out of 1.00

Flag question

Question text
Indicate which structure would be a more suitable choice for each of the following applications.
An electronic address book ordered by name
Select one:

a.

Queue

b.

Tree

c.

Stack

d.

Binary search tree

e.

Graph

Clear my choice

Question 5
Answer saved

Marked out of 1.00

 Flag question

Question text
A queue displays LIFO behavior.
Select one:

True

False

Question 6
Answer saved

Marked out of 1.00

Flag question

Question text
Herder node is used as sentinel in __________________.
Select one:

a.

Queues

b.

Binary tree

c.

Graphs

d.

Stacks

Clear my choice

Question 7
Answer saved

Marked out of 1.00

Flag question

Question text
Which of the following is not the part of ADT description?
Select one:

a.

Operations

b.

None of these

c.

Both of these

d.

Data

Clear my choice

Question 8
Answer saved

Marked out of 1.00

Flag question

Question text
In a graph, the vertices represent the items being modeled.
Select one:

True
 False

Question 9
Answer saved

Marked out of 1.00

Flag question

Question text
Inserting an item into the stack when stack is not full is called ____________ while operation
and deletion of item from the stack, when stack is not empty is called ________________
operation.
Select one:

a.

pop, push

b.

push, pop

c.

delete, insert

d.

insert, delete

Clear my choice

Question 10
Answer saved

Marked out of 1.00

Flag question

Question text
A stack displays FIFO behavior.
Select one:

True

False

Question 11
Answer saved

Marked out of 1.00

Flag question

Question text
A stack and a queue are different names for the same ADT.
Select one:

True

False

Question 12
Answer saved

Marked out of 1.00

Flag question

Question text
Which of the following data structure can't store the non-homogeneous data elements?
Select one:

a.

Arrays

b.
Records

c.

Pointers

d.

Stacks

Clear my choice

Question 13
Answer saved

Marked out of 1.00

Flag question

Question text
Indicate which structure would be a more suitable choice for each of the following applications.
A program keeping track of where canned goods are located on a shelf.
Select one:

a.

Graph

b.

Tree

c.

Queue

d.

Binary search tree

e.

Stack

Clear my choice
Question 14
Answer saved

Marked out of 1.00

Flag question

Question text
Stack is also called the ________________.
Select one:

a.

Last in, first out

b.

First in, first out

c.

Last in, last out

d.

First in, last out

Clear my choice

Question 15
Answer saved

Marked out of 1.00

Flag question

Question text
What is written by the following algorithm?
Push(myStack, 5)
Push(myStack, 4)
Push(myStack, 4)
Pop(myStack, item)
Pop(myStack, item)
Push(myStack, item)
WHILE (NOT IsEmpty(myStack))
     Pop(myStack, item)
     Write item, ' '
4,5
Answer: 

Question 16
Answer saved

Marked out of 1.00

Flag question

Question text
The value in the left child of a node (if it exists) in a binary search tree will be greater than the
value in the node itself.
Select one:

True

False

Question 17
Answer saved

Marked out of 1.00

Flag question

Question text
____________________ level is where the model becomes compatible executable code.
Select one:

a.

Application level
 b.

Abstract level

c.

All of these

d.

Implementation level

Clear my choice

Question 18
Answer saved

Marked out of 1.00

Flag question

Question text
Indicate which structure would be a more suitable choice for each of the following applications.
A word processor to have a PF key that causes the preceding command to be redisplayed. Every
time the PF key is pressed, the program is to show the command that preceded the one currently
displayed
Select one:

a.

Tree

b.

Queue

c.

Graph

d.

Stack

e.
Binary search tree

Clear my choice

Question 19
Answer saved

Marked out of 1.00

Flag question

Question text
Indicate which structure would be a more suitable choice for each of the following applications.
A dictionary of words used by a spelling checker to be built and maintained.
Select one:

a.

Stack

b.

Tree

c.

Queue

d.

Graph

e.

Binary search tree

Clear my choice

Question 20
Answer saved

Marked out of 1.00

 Flag question

Question text
A list may be linear or nonlinear, depending on its implementation.
Select one:

True

False

Question 21
Answer saved

Marked out of 1.00

Flag question

Question text
The following algorithm is a count-controlled loop going from 1 through 5.  At each iteration,
the loop counter is either printed or put on a queue depending on the result of Boolean
function RanFun().  (The behavior of RanFun() is immaterial.)  At the end of the loop, the
items on the queue are dequeued and printed.  Because of the logical properties of a queue, this
algorithm cannot print certain sequences of the values of the loop counter.  You are given an
output and asked if the algorithm could generate the output. 
Set count to 0
         WHILE (count < 5)
                    Set count to count + 1
                    IF (RanFun())
                             Write count, ' '
                    ELSE
                             Enqueue(myQueue, count)
         WHILE (NOT IsEmpty(myQueue))
                    Dequeue(myQueue, number)      
                    Write number, ' '
The following output is possible using a queue: 1 3 5 2 4
 
Select one:

True

False

Question 22
Answer saved

Marked out of 1.00

Flag question

Question text
A _______________ is a data structure that organizes data similar to a line in the supermarket,
where the first one in line is the first one out.
Select one:

a.

Neither of these

b.

Stacks linked list

c.

Queue linked list

d.

Both of these

Clear my choice

Question 23
Answer saved

Marked out of 1.00

 Flag question

Question text
Which of the following is true about the characteristics of abstract data types?
i. It exports a type.
ii. It exports a set of operations.
Select one:

a.

True, True

b.

False, False

c.

False, True

d.

True, False

Clear my choice

Question 24
Not yet answered

Marked out of 1.00

Flag question

Question text
Draw the binary search tree whose elements are inserted in the following order:
50 72 96 94 107 26 12 11 9 2 10 25 51 16 17 95
If Print is applied to the tree formed above, in which order would the elements be printed?

Answer: 
Question 25
Answer saved

Marked out of 1.00

Flag question

Question text
It is a pile in which items are added at one end and removed from the other.
Select one:

a.

none of these

b.

queue

c.

stack

d.

list

Clear my choice

Question 26
Answer saved

Marked out of 1.00

Flag question

Question text
A binary search cannot be applied to a tree.
Select one:

True
 False

Question 27
Answer saved

Marked out of 1.00

Flag question

Question text
The following algorithm is a count-controlled loop going from 1 through 5.  At each iteration,
the loop counter is either printed or put on a queue depending on the result of Boolean
function RanFun().  (The behavior of RanFun() is immaterial.)  At the end of the loop, the
items on the queue are dequeued and printed.  Because of the logical properties of a queue, this
algorithm cannot print certain sequences of the values of the loop counter.  You are given an
output and asked if the algorithm could generate the output. 
Set count to 0
         WHILE (count < 5)
                    Set count to count + 1
                    IF (RanFun())
                             Write count, ' '
                    ELSE
                             Enqueue(myQueue, count)
         WHILE (NOT IsEmpty(myQueue))
                    Dequeue(myQueue, number)      
                    Write number, ' '
The following output is possible using a queue: 1 3 5 4 2
 
Select one:

True

False

Question 28
Not yet answered

Marked out of 1.00

 Flag question

Question text
Indicate which structure would be a more suitable choice for each of the following applications.
A program to keep track of family relationships
Select one:

a.

Stack

b.

Tree

c.

Graph

d.

Binary search tree

e.

Queue

Clear my choice

Question 29
Answer saved

Marked out of 1.00

Flag question

Question text
Binary search trees are ordered.
Select one:
 True

False

Question 30
Answer saved

Marked out of 1.00

Flag question

Question text
Which data structure allows deleting data elements from and inserting at rear?
Select one:

a.

binary search tree

b.

dequeues

c.

stacks

d.

queues

Clear my choice

Question 31
Answer saved

Marked out of 1.00

Flag question

Question text
Which data structure is used in breadth first search of a graph to hold nodes?
Select one:

a.

Tree

b.

Queue

c.

Array

d.

Stack

Clear my choice

Question 32
Answer saved

Marked out of 1.00

Flag question

Question text
On average, searching in a binary search tree is faster than searching in a list.
Select one:

True

False

Question 33
Answer saved

Marked out of 1.00

 Flag question

Question text
What is written by the following algorithm?
Enqueue(myQueue, 5)
Enqueue(myQueue, 4)
Enqueue(myQueue, 4)
Dequeue(myQueue, item)
Dequeue(myQueue, item)
Enqueue(myQueue, item)
WHILE (NOT IsEmpty(myQueue))
     Dequeue(myQueue, item)
     Write item, ' '
4,4
Answer: 

Question 34
Answer saved

Marked out of 1.00

Flag question

Question text
Indicate which structure would be a more suitable choice for each of the following applications.
A program to keep track of the soccer teams in a city tournament
Select one:

a.

Queue

b.

Tree

c.

Stack
 d.

Binary search tree

e.

Graph

Clear my choice

Question 35
Answer saved

Marked out of 1.00

Flag question

Question text
This is very useful in situation when data have to be stored and then retrieved in reverse order.
Select one:

a.

stack

b.

queue

c.

link list

d.

list

Clear my choice

Question 36
Answer saved

Marked out of 1.00

 Flag question

Question text
A binary search tree is another name for a binary tree.
Select one:

True

False

Question 37
Answer saved

Marked out of 1.00

Flag question

Question text
Algorithms that use a list must know whether the list is array based or linked.
Select one:

True

False

Question 38
Answer saved

Marked out of 1.00

Flag question

Question text
Indicate which structure would be a more suitable choice for each of the following applications.
 
A program to receive data that is to be saved and processed in the reverse order.
Select one:

a.

Stack

b.

Queue

c.

Binary search tree

d.

Graph

e.

Tree

Clear my choice

Question 39
Answer saved

Marked out of 1.00

Flag question

Question text
Which of the following data structure is non-linear type?
Select one:

a.

Graph

b.

Strings

c.
Lists

d.

Stacks

Clear my choice

Question 40
Answer saved

Marked out of 1.00

Flag question

Question text
A leaf in a tree is a node with no children.
Select one:

True

False

Question 41
Answer saved

Marked out of 1.00

Flag question

Question text
Identify the data structure which allows deletions at both ends of the list but insertion at only one
end.
Select one:

a.

Output restricted dequeue

b.
Priority queues

c.

Stack

d.

Input restricted dequeue

Clear my choice

Question 42
Answer saved

Marked out of 1.00

Flag question

Question text
A binary tree is a tree in which each node can have zero, one, or two children.
Select one:

True

False

Question 43
Answer saved

Marked out of 1.00

Flag question

Question text
Which of the following is/are the levels of implementation of data structure?
Select one:

a.

All of these
 b.

Implementation level

c.

Application level

d.

Abstract level

Clear my choice

Question 44
Answer saved

Marked out of 1.00

Flag question

Question text
Indicate which structure would be a more suitable choice for each of the following applications.
A program to keep track of patients as they check into a medical clinic, assigning patients to
doctors on a first-come, first-served basis.
Select one:

a.

Graph

b.

Tree

c.

Stack

d.

Binary search tree

e.
Queue

Clear my choice

Question 45
Answer saved

Marked out of 1.00

Flag question

Question text
Which of the following is non-linear data structure?
Select one:

a.

Strings

b.

Trees

c.

Stacks

d.

List

Clear my choice

Question 46
Answer saved

Marked out of 1.00

Flag question

Question text
Which data structure is suitable to represent the hierarchal relationship between elements?
Select one:

a.

Dequeue

b.

Tree

c.

Graph

d.

Priority

Clear my choice

Question 47
Answer saved

Marked out of 1.00

Flag question

Question text
Which of the following data structures is linear type?
Select one:

a.

Binary tree

b.

Stack

c.

Trees

d.

Graph
 Clear my choice

Question 48
Answer saved

Marked out of 1.00

Flag question

Question text
Indicate which structure would be a more suitable choice for each of the following applications.
 
A bank simulation of its teller operation to see how waiting times would be affected by adding
another teller.
Select one:

a.

Stack

b.

Queue

c.

Tree

d.

Graph

e.

Binary search tree

Clear my choice

Question 49
Answer saved

Marked out of 1.00

 Flag question

Question text
Indicate which structure would be a more suitable choice for each of the following applications.
A program to maintain the routes in an airline.
Select one:

a.

Graph

b.

Binary search tree

c.

Queue

d.

Stack

e.

Tree

Clear my choice

Question 50
Answer saved

Marked out of 1.00

Flag question

Question text
The root of a tree is the node that has no ancestors.
Select one:
 True

False

Finish attempt ...

◄ Final Quiz 2