stud
bud
Sign up
Log in
Home
Library
Explore
SAT
More
Data Structure Introduction Flashcards | StudBud
Explore
/
Data Structure Introduction
Data Structure Introduction
10 terms
·
StudBud Administration
·
22 plays
Imported from external platform
Flashcards
10 cards
F
Practice quiz
P
Host live
L
Questions
10
Answers
1
Which of the following data structure can’t store the non-homogeneous data elements?
Records
Linked List
Pointer
Array
2
Which linear structure has a provision of Last-In-First-Out (LIFO) mechanism for its elements?
Queue
Both A & B
None of Above
Stack
3
When is the pop operation on Stack considered to be an error?
When the stack is neither empty nor full
Cannot be predicted
Only when the stack is full
Only when the stack is empty
4
Queue is also called as
Last in last out
First in last out
First in first out
Last in first out
5
A linear collection of data elements where the linear node is given by means of pointer is called
Linked List
Stack
Node List
Array
6
When new data are to be inserted into a data structure,but there is no available space; this situation is usually called
Underflow
Housefull
Overflow
Saturated
7
Each data item in a record may be decomposed of sub-items; those items are called
Sub Item
None of these
Group Item
Elementary Item
8
Which of the following data structure is linear data structure?
Tree
Stack
Graph
None of above
9
From where does the insertion and deletion of elements get accomplished in Queues?
Only Rear ends
Rear & Front ends respectively
Only Front ends
Front & Rear ends respectively
10
A mathematical-model with a collection of operations defined on that model is called
Algorithm
Abstract Data Type
Primitive Data Type
Data Structure
