Your browser does not support JavaScript!
AMA University Answers
Login Register

Data Structures and Algorithm Analysis

Showing 76-150 of 228 answers

If the integers 3,6,9,12 are enqueued onto a queue in that order, what will be the result of the queue after running a dequeue?
  • 6,9,12 Correct
  • 12
  • 3
  • 3,6,9
If the number of records to be sorted is small, then __________ sorting can be efficient.
  • Selection Correct
  • Heap
  • Merge
  • Bubble
in _____________ the parent should always be greater or equal than the child nodes.
  • min heap
  • max heap Correct
  • up-heap
  • low-heap
In a 2-tree, nodes with 0 children are called ___________.
  • outside node
  • outer node
  • exterior node
  • external node Correct
In a graph, if E=(u,v), it means _____________.
  • u is adjacent to v but v is not adjacent to u
  • e begins at processor u and ends at successor v Correct
  • e begins at processor v and ends at successor u
  • v is adjacent to u but u is not adjacent to v
In a graph, if e=[u,v], then u and v are called _______________
  • Adjacent nodes
  • Neighbors
  • All of the choices Correct
  • End points of e
In a graph, the vertices represent the items being modeled.
  • TRUE Correct
In a linked list, the ____________ contains the address of next element in the list.
  • Info field
  • Start field
  • Next element field
  • Link field Correct
In an extended binary tree, nodes with 2 children are called _________________.
  • Interior node
  • Internal node Correct
  • Inner node
  • Domestic node
In binary trees, nodes with no successor are called _______________.
  • Final nodes
  • End nodes
  • Terminal nodes Correct
  • Last nodes
In C++ using positions() means to Return a position list of all the nodes of the tree.
  • True Correct
  • False
In C++ using size() means to Return the number/size of nodes in the tree.
  • True Correct
  • False
In data structure, a pop is when you remove an element in the stack
  • True Correct
  • False
In linked lists, there are no NULL links in ______________
  • linear doubly linked list
  • circular linked list Correct
  • single linked list
  • linked list
In linked representation of stack, ___________ fields hold the elements of the stack.
  • TOP
  • LINK
  • NULL
  • INFO Correct
In linked representation of stack, the null pointer of the last node in the list signals ____________
  • Bottom of the stack Correct
In order to indicate that an object is not present in the map, we assume that there exists a special sentinel ___________ called end.
  • marker
  • iterator Correct
  • terminator
  • indicator
In order to indicate that an object is not present in the map, we assume that there exists a special sentinel ___________ called end.
  • iterator Correct
In priority queue, items are removed according to time they entered
  • True
  • False Correct
In sequential implementation, the stack stored in a one-dimensional array
  • True Correct
  • False
In the linked representation of the stack, __________ pointer behaves as the top pointer variable of stack.
  • Begin
  • Stop
  • Avail
  • Start Correct
In the stack, if the user try to remove element from the empty stack then it is called as
  • Overflow of stack
  • Null operation
  • Empty collection
  • Underflow of stack Correct
Indexing the ________________ element in the list is not possible in linked lists.
  • middle Correct
Indicate which structure would be a more suitable choice for each of the following applications.
  • Tree, Binary search tree Correct
Inserting an item into the stack when stack is not full is called ____________ while operation and deletion of item from the stack, when stack is not empty is called ________________ operation.
  • push, pop Correct
It doesn't require a binary tree to be traverse when using insertion or deletion.
  • True
  • False Correct
It is a pile in which items are added at one end and removed from the other.
  • queue Correct
It uses a hash function to compute an index into an array of buckets
  • Hash
  • Hash table Correct
  • Maps
  • Bucket Array
LINK is the pointer pointing to the ____________________.
  • predecessor node Correct
Linked lists are best suited _____________________.
  • for the size of the structure and the data in the structure are constantly changing Correct
Linked representation of binary tree needs ______ parallel arrays.
  • 4
  • 2
  • 3 Correct
  • 5
Maps allows us to store elements so they can be located quickly using _________.
  • keys Correct
  • arrays
  • search
  • coordinates
Marked the birth of graph theory
  • Kneiphof path
  • Preger river problem
  • Eularpath
  • Ko"nigsberg bridge problem Correct
Moving from one node to another is called _______________
  • Traversing
  • Link hopping
  • Link hopping or pointer hopping Correct
  • Pointer hopping
New nodes are added to the ________ of the queue.
  • Front
  • Middle
  • Front and Back
  • Back Correct
Nodes of a binary tree is in particular order
  • True
  • False Correct
On average, searching in a binary search tree is faster than searching in a list.
  • FALSE Correct
Partition and exchange sort is ____________.
  • tree sort
  • quick sort Correct
  • heap sort
  • bubble sort
pop() takes the first element of the stack.
  • True
  • False Correct
Sequential implementation is represented as a linear list
  • True
  • False Correct
Sorting algorithm can be characterized as ________________.
  • Both of the choices Correct
  • Simple algorithm which require the order of n2 comparisons to sort n items
  • Sophisticated algorithms that require the O(nlog2n) comparisons to sort items
  • None of these
Stack and Queue is a linear data structure.
  • True Correct
  • False
Stack consists of five basic operations
  • True Correct
  • False
Stack follows the strategy of ________________.
  • LRU
  • RANDOM
  • LIFO Correct
  • FIFO
Stack imposes the discipline of First In First Out
  • True
  • False Correct
Stack is also called the ________________.
  • Last in, first out Correct
Stack is stored in a single dimensional array
  • True Correct
  • False
stack() creates an empty stack.
  • True Correct
  • False
Stacks can only be implemented using a linked list
  • True
  • False Correct
State True or False for internal sorting algorithms. i. Internal sorting are applied when the entire collection if data to be sorted is small enough that the sorting can take place within main memory. ii. The time required to read or write is considered significant in evaluating the performance of internal sorting.
  • True, False Correct
State True or False for internal sorting algorithms.i. Internal sorting are applied when the entire collection if data to be sorted is small enough that the sorting can take place within main memory.ii. The time required to read or write is considered significant in evaluating the performance of internal sorting.
  • True, True
  • False, True
  • True, False Correct
  • False, False
The address of the first node in the list is stored in a separate location called
  • linker
  • head Correct
  • initial
  • main
the association of keys and values defines a ____________.
  • searching
  • mapping Correct
  • pairing
  • traversing
The average case occurs in linear search algorithm _______________.
  • when item is not the array at all
  • when item is somewhere in the middle of the array Correct
  • when item is the last element in the array
  • item is the last element in the array or item is not there at all
The complexity of bubble sort algorithm.
  • O(n)
  • O(n2) Correct
  • O(logn)
  • O(n logn)
The complexity of linear search algorithm.
  • O(logn)
  • O(n logn)
  • O(n) Correct
  • O(n2)
The complexity of merge sort algorithm.
  • O(logn)
  • O(n)
  • O(n logn) Correct
  • O(n2)
The complexity of sorting algorithm measures the __________ as a function of the number n of items to be shorter.
  • average-case complexity
  • average time
  • case-complexity
  • running time Correct
The converse notion of a child, an immediate ancestor
  • Parent Correct
  • Head
  • Ancestral
  • Top
The data structure that consists of finite set of _____________which are also called nodes.
  • edges
  • links
  • vertices Correct
  • references
The data structure that stores data in the form of key and value pairs where every key is unique.
  • Map Correct
  • Tree
  • Graph
  • Heap
The delete operation in the slack is called?
  • Push
  • Pop Correct
  • Remove
  • Erase
The depth of complete binary tree is given by ________________.
  • Dn = n log2n
  • Dn = n log2n+1
  • Dn = log2n
  • Dn = log2n+1 Correct
The dummy header in linked list contains ____________________.
  • middle record of the actual data
  • pointer to the last record of the actual data
  • first record of the actual data Correct
  • last record of the actual data
The elements are removal from a stack in _________ order.
  • Hierarchical
  • Alternative
  • Reverse Correct
  • Sequential
The following are some of the applications of heaps except
  • Priority Queue
  • Stacks Correct
  • Heap Sort
  • Graph Algorithms
The following code illustrates __________________
  • Set value to the header of the linked list
  • Traversing the linked list Correct
  • Creating an element
  • Check the next element in the linked list
The heap is an efficient implementation of an abstract data type called _______________
  • linked lists
  • Heap-order
  • none of the choices
  • priority queue Correct
The item search, insertion, and deletion operations all require the binary tree to be traversed.
  • True Correct
  • False
The last step when inserting an element at the tail of a singly linked list is to assign a tail reference itself to the new created node
  • True Correct
  • False
The method used by card sorter.
  • Insertion
  • Heap
  • Radix sort Correct
  • Quick
The most important properties of Heap is that its _________________ is at its root.
  • child element
  • parent element
  • lowest element Correct
  • highest element
The operation commonly performed in graphs that store the graph in computer memory using a particular graph representation is called ________________
  • Traverse the graph
  • Clear the graph
  • Determine the graph if empty
  • Create the graph Correct
The operation of processing each element in the list is known as ________________.
  • traversal Correct
The ordering of a linked list follows the rule ________________
  • First come first serve
  • First IN Last OUT
  • Follow the leader Correct
  • First IN First Out
All courses