stud
bud
Sign up
Log in
Home
Library
Explore
SAT
More
Algorithms Review Flashcards | StudBud
Explore
/
Algorithms Review
Queue is a
New nodes are added to the front of the queue
Algorithms Review
11 terms
·
StudBud Administration
·
48 plays
Imported from external platform
Flashcards
11 cards
F
Practice quiz
P
Host live
L
Questions
11
Answers
1
New nodes are added to the front of the queue
True
False
2
Queue is a
Ordered array
FIFO (First In First Out) list
Linear Tree
LIFO list
3
poping is an act of
adding values
transferring values from stack
taking values off from the stack
none of the above
4
Linked list is a linear data structure which stores the data in the sequential memory locations.
False
True
5
the following are the advantage(s) of the linked list
required less memory as we do not need memory for the pointer addresses
access specific element (node) is simpler than arrays
No specification of the fixed size
easy to add to the tail and remove from front
6
A class is a user-defined data type, it works as an object constructor, or a “blueprint” for creating objects
True
False
7
Which is the pointer associated with the stack
Top
First
Front
Rear
8
Some of object oriented programming OOP concepts ( more than one answer)
Encapsulation
None of the above
Inheritance
Abstration
9
stack data structure is:
FIFO
LILO
LOFI
None of the above
10
Delete operation is done using front in the queue
False
True
11
Object is an instance of the class, it contains data (attributes) and methods
True
False
