10/4/23, 10:57 AM -: Data Structures and Algorithm

_______________ Jenny's Online Contact Us Facebook Twitter Subject Attendance

Tell us what are yo

Data Structures and Algorithm

PE
This course covers overview of C++, concepts of data structures, advance topics WO
BIG
in C++ programming including its algorithm of the different data structures Dis
big
programs in C++. the
and

HE
CR
AV
How
Sce
Ma
(MC

AI C
PAS
YO
AI C
you
Hac
cap

CR
GU
AW
Dis
Cyb
Fili
you

TAL
RP
EN
PLA
Tale
Tale
You
anime RPG game with

AG
TE
AS
AU
“W
the
wa
years!” A live…

17
THA
WIL
You
five

https://jennysonline.blogspot.com/2019/07/data-structures-and-algorithm-analysis_13.html 1/3
10/4/23, 10:57 AM -: Data Structures and Algorithm
true crime podcast The
[Complete] Data Structures and Algorithm : Sheet1
internal nodes Any node of a tree that has child node TH
KE
singly linked list A linear list in which the pointer points only to the successive node.
CU
___________ sorting algorithm is frequently used when n is small, where n is the
Insertion US
total number of elements.
PA
Max-heap When the largest element is at its root it's called Hig
Top A pointer variable which contains the location at the top element of the stack. new
Higround introduced a
TRUE In C++ using positions() means to Return a position list of all the nodes of the tree
queues Which data structure allows deleting data elements from and inserting at rear? ALW
Insertion A simple sorting algorithm that works the way we sort playing cards in our hands. NE
If the number of records to be sorted is small, then __________ sorting can be “I P
Selection He
efficient.
Ma
Underflow The situation when in a linked list START=NULL is ____________________. Co
e begins at processor u and ends at a…
In a graph, if E=(u,v), it means _____________.
successor v
Indicate which structure would be a more suitable choice for each of the following RO
Stack STO
applications.
Wa
The operation of processing each element in the list is known as
traversal for
________________. Sto
Trees An Abstract Data Type that stores elements hierarchically. gro
This may take place only when there is some minimum amount or no space left in
Garbage collection
free storage list.
O The complexity of linear search algorithm.
Dequeue "This form of access is used to add/remove nodes from a stack. "
It is a windows 7 feature that enables user to connect to their desktop computer
Remote Desktop
from another device.
predecessor node LINK is the pointer pointing to the ____________________.
O(n) The complexity of linear search algorithm.
The new node is placed at the front
What happens when you push a new node onto a stack?
of the linked list
Reverse The elements are removal from a stack in _________ order.
all of these Which of the following is an application of stack?
Hash table It uses a hash function to compute an index into an array of buckets
Radix sort The method used by card sorter.
LIFO This form of access is used to add/remove nodes from a stack.
Identify the data structure which allows deletions at both ends of the list but
Input restricted dequeue
insertion at only one end.
FALSE It doesn't require a binary tree to be traverse when using insertion or deletion.
FIFO What is a queue?
Back New nodes are added to the ________ of the queue.
TRUE We can also define a binary tree in a recursive way
Threaded trees These are binary trees with threads.
Array with pointers What does the sequential representation of binary trees use?
replace key-value pair Using put() can perform
FIFO, First In First Out This form of access is used to add and remove nodes from a queue.
TRUE In C++ using size() means to Return the number/size of nodes in the tree.
FALSE Algorithms that use a list must know whether the list is array based or linked.
__________________ is putting an element in the appropriate place in a sorted li
insertion
yields a larger sorted order list.
TRUE The tree ADT stores elements at the nodes of the tree.
The correct answer is 'False'. A binary search tree is another name for a binary tree.
_____________ order is the best possible for array sorting algorithm which sorts n
O(n+logn)
item.
The correct answer is 'False'. On average, searching in a binary search tree is faster than searching in a list.
mapping the association of keys and values defines a ____________.
circular linked list In linked lists, there are no NULL links in ______________
THANKS to our TO
A Binary Tree that stores a collection of elementswith their associated keys at its
Heap
nodes.
Binary search tree A dictionary of words used by a spelling checker to be built and maintained.
external node In a 2-tree, nodes with 0 children are called ___________.
This are point-to-point connection across a private or public network. It uses spec
Virtual Private Network
protocols, called tunneling protocol to make a virtual call to a virtual port.
LIFO Stack follows the strategy of ________________.
Graph G is _____________ if for any pair u, v of nodes in G, there is a path from
Unliterally connected
to v or path from v to u.
Stack A program keeping track of where canned goods are located on a shelf.
List traversed in two directions Which of the following is two way lists?
If Priority queues can be implemented by Heaps, Heaps can be implemented by
Array
___________?
None of these ____________________ is not the component of data structure.
The data structure that stores data in the form of key and value pairs where every
Map
key is unique.
Two fields Each node in a linked list must contain at least ___________________.
e begins at processor u and ends at JO*N, PA**O
In a graph, if E=(u,v), it means _____________.
successor v

https://jennysonline.blogspot.com/2019/07/data-structures-and-algorithm-analysis_13.html 2/3
10/4/23, 10:57 AM -: Data Structures and Algorithm
up-heap bubbling The upward movement of the newly inserted entry by means of swapping
It is a windows 7 feature that enables support staff to connect to a remote desktop
Remote Assistance
computer.
Your company has asked you to implement Network Access Protection(NAP) on t
network. You already have Windows Server 2008 installed on your servers but yo
Windows XP with SP2
organization wants to know which client operating systems will support NAP. Wha
operating system does not support NAP?
Trees are ________ if they are similar and have the same contents at
copies
corresponding nodes.
small batches of records from a file What is a run list?
Which of the following data structure can't store the non-homogeneous data
Arrays
elements?
predecessor node LINK is the pointer pointing to the ____________________.
Trees A hierarchical data structure
Indicate which structure would be a more suitable choice for each of the following
Graph
applications.
for the size of the structure and the
data in the structure are constantly Linked lists are best suited _____________________.
changing
Indicate which structure would be a more suitable choice for each of the following
Binary search tree
applications.
binary search algorithm is not
efficient when the data elements Which of the following is not a limitation of binary search algorithm?
more than 1500
Your company network includes desktop computers that have Windows 7 installed
From the Action Center, open the Microsoft updates are applied automatically at a scheduled time. A use1- reports
Windows Update window. that a proprietary application has stopped working. You need to uninstall the most
recent update from Microsoft. What should you do first?

>
Sheet1
<

Newer Post Home Older Post

Powered by Blogger.

https://jennysonline.blogspot.com/2019/07/data-structures-and-algorithm-analysis_13.html 3/3