ASSIGNMENT 1
In a non-linear data structure, each item is related to its previous and next item.
Select one:TrueFalse B
Which of the following is NOT a Linear Data Structure?
Select one:a.
Array & Table
b.
Heap & Binary Tree B
c.
Tree & Stack
d.
Queue & Array
Which of the following is a function of a rate of growth of a problem?
Select one:a.
Output
b.
Input B
c.
size
d.
time
C++ is an object oriented programming language and supports easy declaration of data types.
Select one:True AFalse
Queue is an example of a linear data structure.
Select one:True AFalse
Which of the following are NOT a Linear Data Structure?
Select one:a.
Heap & Binary Tree
b.
Stack& Graph
c.
Array& Heap
d.
None of the choices D
In a Linear Data Structure, data items can be traversed in a single run.
Select one:True AFalse
implementation of a non-linear data structure is much easier than linear data structure.
Select one:TrueFalse B
In Linear data structure elements are accessed in a chronological order
Select one:True AFalse
It is a property of algorithm wherein all of the operations to be performed must be sufficiently basic that they can be done exactly in a finite time by a person using only a pencil and paper.
Select one:a.
Ambiguous
b.
Feasibility
c.
Effectiveness C
d.
Dependent
QUIZ 1
A data structure is similar to a
Select one:a.
Database structure
b.
software application
c.
Database
d.
File structure D
Which of the following best describes average case?
