Data structure: Stack Test

Result

Data structure: Stack Test - 2

Score
-
out of -
Rank
-
out of -

TIME Taken - -

SHARING IS CARING

If our Website helped you a little, then kindly spread our voice using Social Networks. Spread our word to your readers, friends, teachers, students & all those close ones who deserve to know what you know now.

Weekly Quiz Competition

Question 1
1 / -0.25

______ data strucutres refer to the lists stored and accessed in a special way, Where LIFO (Last in first out) technique is followed.

A
Stacks

B
Queue

C
Linked List

D
None of the above
Question 2
1 / -0.25

Arrays can be ___________.

A
One dimensional

B
Two dimensional

C
Multi dimensional

D
All of the above
Question 3
1 / -0.25

_______ lists are special lists of some data elements linked to one another. The logical ordering is represented by having each element pointing to the next element.

A
Stacks

B
Queue

C
Linked List

D
None of the above
Question 4
1 / -0.25

_______ data strucutres are FIFO (First in First out) lists, where insertions take place at the “rear ”end of the queues and deletions take palce at the “front ”end of the queues.

A
Stacks

B
Queue

C
Linked List

D
None of the above
Question 5
1 / -0.25

Which one of the following is not a type of queue?

A
Single –ended queue

B
Circular queue

C
Priority queue

D
Ordinary queue
Question 6
1 / -0.25

Trees are multilevel data strucutre having a hierarchical relationship among its elements called ________.

A
Node

B
Reference

C
Link

D
None of the above
Question 7
1 / -0.25

What are the basic operations that are performed on data structures _________.

A
Insertion

B
Deletion

C
Searching

D
All of the above
Question 8
1 / -0.25

Which of the following does not represent a data structure operation?

A
Operations that manipulate data in some way

B
Operations that perform a computation

C
Operations that monitor an object for the occurrence of a controlling event

D
Operations that check for syntax errors
Question 9
1 / -0.25

What data structure is necessary to change infix notation into prefix notation?

A
Stack

B
Linked list

C
Binary tree

D
Queue
Question 10
1 / -0.25

When elements of linear strucutes are homogeneous and are represented in memory by means of sequentional momoey location, these linear strucures are called _________.

A
String

B
Arrays

C
List

D
None of the above

User

Question Analysis

Correct -
Wrong -
Skipped -

My Perfomance

Score
-
out of -
Rank
-
out of -

Re-Attempt Weekly Quiz Competition

Data structure: Stack Test - 2

Result

Data structure: Stack Test - 2

Score

-

Rank

-

SHARING IS CARING

Question 1

Stacks

Queue

Linked List

None of the above

Question 2

One dimensional

Two dimensional

Multi dimensional

All of the above

Question 3

Stacks

Queue

Linked List

None of the above

Question 4

Stacks

Queue

Linked List

None of the above

Question 5

Single –ended queue

Circular queue

Priority queue

Ordinary queue

Question 6

Node

Reference

Link

None of the above

Question 7

Insertion

Deletion

Searching

All of the above

Question 8

Operations that manipulate data in some way

Operations that perform a computation

Operations that monitor an object for the occurrence of a controlling event

Operations that check for syntax errors

Question 9

Stack

Linked list

Binary tree

Queue

Question 10

String

Arrays

List

None of the above

User

Question Analysis

My Perfomance

Score

-

Rank

-

Results Announcement on: coming Monday

Stay Tuned: We’ll update you on your result via email or SMS.