Ctrl + F is the shortcut in your browser or operating system that allows you to find words or questions quickly.
Ctrl + Tab to move to the next tab to the right and Ctrl + Shift + Tab to move to the next tab to the left.
On a phone or tablet, tap the menu icon in the upper-right corner of the window; Select "Find in Page" to search a question.
Share UsSharing is Caring
It's the biggest motivation to help us to make the site better by sharing this to your friends or classmates.
Is a collection of steps to solve a particular problem. Learning data structures and algorithms allow us to write efficient and optimized computer programs.
Comparing BFS and DFS, the big advantage of DFS is that it has much _____memory requirements than BFS, because it's not necessary to store all of the child pointers at each level.
Graph G is _____________ if for any pair u, v of nodes in G, there is a path from u to v or path from v to u.
The four most common are probably line graphs, bar graphs and histograms, pie charts, and ?
Which indicates pre-order traversal?
Breadth-first-search is the algorithm that will find shortest paths in an _____ graph.
Which of the following is/are the levels of implementation of data structure?
The _______ algorithm is a graph search algorithm that finds the shortest path between a given source vertex and all other vertices in the graph.
A graph is a____structure that has two types of elements, vertices and edges.
A complete digraph is a directed graph in which every pair of distinct vertices is connected by a ___of unique edges (one in each direction).
The retrieval of items in a stack is ___________ operation.
Graphs are a powerful and versatile data structure that easily allow you to represent real life relationships between different types of data (nodes).
In a graph, the vertices represent the items being modeled.
Partition and exchange sort is ____________.
This indicates the end of the list.
Herder node is used as sentinel in __________________.
____________________ is not the component of data structure.
In an extended binary tree, nodes with 2 children are called _________________.
In a linked list, the ____________ contains the address of next element in the list.
A word processor to have a PF key that causes the preceding command to be redisplayed. Every time the PF key is pressed, the program is to show the command that preceded the one currently displayed
A program to keep track of the soccer teams in a city tournament
Binary search trees are ordered.
A pointer variable which contains the location at the top element of the stack.
The average case occurs in linear search algorithm _______________.
An MD5 hash function encodes a string of information and encodes it into a___bit fingerprint.
A connected graph T without any cycles is called a ____________.
The root of a tree is the node that has no ancestors.
Indexing the ________________ element in the list is not possible in linked lists.
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.
In linked lists, there are no NULL links in ______________
The value in the left child of a node (if it exists) in a binary search tree will be greater than the value in the node itself.
A program to maintain the routes in an airline.
A graph consists of a set of nodes or vertices together with a set of edges or arcs where each edge joins two ______.
Dijkstra's algorithm is Dijkstra's algorithm, it is neither algorithm because BFS and DFS themselves are not Dijkstra's algorithm.
Which of the following data structure is non-linear type?
Which is the pointer associated with the stack?
The hash table should be an array with length about __times the maximum number of keys that will actually be in the table, and. Size of hash table array should be a prime number.
Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
In ___________ we specify an object that is used as a key, and the value we want to associate to that key.
A pseudo _____-graph is a general-graph allowing edges to connect a vertex to itself.
A bank simulation of its teller operation to see how waiting times would be affected by adding another teller.
This is a terminal node in a binary tree.
The worst case occurs in linear search algorithm when ________________.
The operation of processing each element in the list is known as ________________.
What is written by the following algorithm? Enqueue(myQueue, 5) Enqueue(myQueue, 4) Enqueue(myQueue, 4) Dequeue(myQueue, item) Dequeue(myQueue, item) Enqueue(myQueue, item) WHILE (NOT IsEmpty(myQueue)) Dequeue(myQueue, item) Write item, ' '
A linear list in which the last node points to the first node.
The following algorithm is a count-controlled loop going from 1 through 5. At each iteration, the loop counter is either printed or put on a queue depending on the result of Boolean function RanFun(). (The behavior of RanFun() is immaterial.) At the end of the loop, the items on the queue are dequeued and printed. Because of the logical properties of a queue, this algorithm cannot print certain sequences of the values of the loop counter. You are given an output and asked if the algorithm could generate the output. Set count to 0 WHILE (count < 5) Set count to count + 1 IF (RanFun()) Write count, ' ' ELSE Enqueue(myQueue, count) WHILE (NOT IsEmpty(myQueue)) Dequeue(myQueue, number) Write number, ' ' The following output is possible using a queue: 1 3 5 4 2
Breadth-____-search is the algorithm that will find shortest paths in an unweighted graph.
This is very useful in situation when data have to be stored and then retrieved in reverse order.
Tree is a hierarchical data structure which stores the information naturally in the form of hierarchy style.
Path Matrix in graph theory is a matrix sized ___ , where n is the number of vertices of the graph.
______ are a common method to visually illustrate relationships in the data.
This is a binary tree whose every node has either zero or two children.
Which of the following sorting algorithm is of priority queue sorting type?
The value in the right child of a node (if it exists) in a binary search tree will be greater than the value in the node itself.
Another name for directed graph.
New nodes are added to the ________ of the queue.
The term push and pop is related to _____________.
The complexity of linear search algorithm.
A connected graph T without any cycles is called ________________.
This is the operation of processing each element in the list.
A hash function that returns a unique hash number is called a _______hash function.
This is the insertion operation in the stack.
An electronic address book ordered by name
Dijkstra's algorithm works correctly, because all edge weights are non-________, and the vertex with the least shortest-path estimate is always chosen.
A _______________ is a data structure that organizes data similar to a line in the supermarket, where the first one in line is the first one out.
The depth of complete binary tree is given by ________________.
Linked lists are best suited _____________________.
Indicate which structure would be a more suitable choice for each of the following applications. A program keeping track of where canned goods are located on a shelf.
A ________ is a data structure that has two types of elements, vertices and edges.
Which is the pointer associated with the availability list?
___________ sorting algorithm is frequently used when n is small, where n is the total number of elements.
It is a pile in which items are added at one end and removed from the other.
Stack follows the strategy of ________________.
Which data structure allows deleting data elements from and inserting at rear?
What does the sequential representation of binary trees use?
This is a linear list in which insertions and deletions are made to form either end of the structure.
A program to receive data that is to be saved and processed in the reverse order.
The dummy header in linked list contains ____________________.
Which of the following sorting algorithm is of the divide and conquer type?
This form of access is used to add/remove nodes from a stack.
The complexity of sorting algorithm measures the __________ as a function of the number n of items to be shorter.
Shortest path algorithms are a family of algorithms designed to solve the shortest path problem.
A hash function is a function which when given a key, generates an address in the table.
A program to keep track of family relationships
Linked representation of binary tree needs ______ parallel arrays.
The elements are removal from a stack in _________ order.
In binary trees, nodes with no successor are called _______________.
A linear list in which the pointer points only to the successive node.
Deletion operation is done using __________ in a queue.
Every node N in a binary tree T except the root has a unique parent called the ________ of N.
Trees are ________ if they are similar and have the same contents at corresponding nodes.
Dynamic programming is a method of solving complex problems by breaking them down into simpler steps.
LINK is the pointer pointing to the ____________________.
The rearranging of pairs of elements which are out of order, until no such pairs remain.
_________ algorithms work by recursively constructing a set of objects from the smallest possible constituent parts.
These are binary trees with threads.
A dictionary of words used by a spelling checker to be built and maintained.
_____matrix in graph theory is a matrix sized n*n , where n is the number of vertices of the graph.
This refers to a linear collection of data items.
Each node in a linked list must contain at least ___________________.
Which of the following data structure can't store the non-homogeneous data elements?
Which of the following is true about the characteristics of abstract data types? i. It exports a type. ii. It exports a set of operations.
A stack displays FIFO behavior.
A hash table is an array containing all of the keys to search on.
A queue displays LIFO behavior.
Which data structure is suitable to represent the hierarchal relationship between elements?
Stack is also called the ________________.
A directed general-graph is a general-graph in which the set E is the set of ordered pairs of vertices.
A simple graph may be either ____________.
Which of the following is non-linear data structure?
A graph is a picture designed to express words, particularly the connection between two or more quantities.
Which of the following data structures is linear type?
What is a run list?
What is a queue?
Hashing is also used in encryption.
In a graph, if e=[u,v], then u and v are called _______________
A stack and a queue are different names for the same ADT.
The method used by card sorter.
A hash______ is a data structure that is used to store keys/value pairs.
In linked representation of stack, ___________ fields hold the elements of the stack.
Hashing provides a more reliable and_ method of data retrieval than any other data structure.
Binary search algorithm cannot be applied to _______________.
This form of access is used to add and remove nodes from a queue.
Draw the binary search tree whose elements are inserted in the following order: 50 72 96 94 107 26 12 11 9 2 10 25 51 16 17 95 If Print is applied to the tree formed above, in which order would the elements be printed?
_______ Algorithm : performs better in typical situations (sparse graphs) because it uses simpler data structures.
A binary search tree is another name for a binary tree.
Which of the following is two way lists?
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.
Sorting algorithm can be characterized as ________________.
A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is called ____________________.
If the number of records to be sorted is small, then __________ sorting can be efficient.
_______programming is a method of solving complex problems by breaking them down into simpler steps.
The Three methods in HASHING in open addressing are linear probing, quadratic probing, and _____hashing.
Value of first linked list index is _______________.
Which data structure is used in breadth first search of a graph to hold nodes?
_____Algorithm : is significantly faster in the limit when you've got a really dense graph with many more edges than vertices.
Which of the following is an application of stack?
__________________ is putting an element in the appropriate place in a sorted list yields a larger sorted order list.
Which of the following is not the part of ADT description?
A binary search cannot be applied to a tree.
The complexity of bubble sort algorithm.
In a graph, if E=(u,v), it means _____________.
Which of the following is not a limitation of binary search algorithm?
What happens when you push a new node onto a stack?
The complexity of merge sort algorithm.
______ is one of the most powerful and advanced data structures. It is a non-linear data structure compared to arrays, linked lists, stack and queue. It represents the nodes connected by edges.
What is written by the following algorithm? Push(myStack, 5) Push(myStack, 4) Push(myStack, 4) Pop(myStack, item) Pop(myStack, item) Push(myStack, item) WHILE (NOT IsEmpty(myStack)) Pop(myStack, item) Write item, ' '
On average, searching in a binary search tree is faster than searching in a list.
Bellman Ford algorithm is useful in finding shortest path from a given source vertex to all the other vertices even if the graph contains a _______ weight edge.
The Floyd-Warshall algorithm outputs the correct result as long as no negative cycles exist in the input graph.
____________________ level is where the model becomes compatible executable code.
In computer science, a problem is said to have optimal substructure if an optimal solution can be constructed from optimal solutions of its subproblems.
A ________ is a data structure that is used to store keys/value pairs.
A leaf in a tree is a node with no children.
A graph is a collection of points, called vertices, and line segments connecting those points, called _______.
Eulerian refers to the Swiss mathematician _____Euler, who invented graph theory in the 18th century.
This may take place only when there is some minimum amount or no space left in free storage list.
A binary tree is a tree in which each node can have zero, one, or two children.
The following algorithm is a count-controlled loop going from 1 through 5. At each iteration, the loop counter is either printed or put on a queue depending on the result of Boolean function RanFun(). (The behavior of RanFun() is immaterial.) At the end of the loop, the items on the queue are dequeued and printed. Because of the logical properties of a queue, this algorithm cannot print certain sequences of the values of the loop counter. You are given an output and asked if the algorithm could generate the output. Set count to 0 WHILE (count < 5) Set count to count + 1 IF (RanFun()) Write count, ' ' ELSE Enqueue(myQueue, count) WHILE (NOT IsEmpty(myQueue)) Dequeue(myQueue, number) Write number, ' ' The following output is possible using a queue: 1 3 5 2 4
Which of the following names does not relate to stacks?
The hash table should be an array with length about _ times the maximum number of keys that will actually be in the table, and. Size of hash table array should be a prime number.
In linked representation of stack, the null pointer of the last node in the list signals _____________________.
A simple graph, also called a ______graph.
Algorithms that use a list must know whether the list is array based or linked.
The term used to insert an element into stack.
A list may be linear or nonlinear, depending on its implementation.
Graph Algorithms or Graph ______ are analytic tools used to determine strength and direction of relationships between objects in a graph.
Which of the following is not the required condition for binary search algorithm?
The eight most commonly used graphs are linear, power, quadratic, polynomial, rational, ______, logarithmic, and sinusoidal.
In the linked representation of the stack, __________ pointer behaves as the top pointer variable of stack.
In a 2-tree, nodes with 0 children are called ___________.
Each node in singly linked list has _______ fields.
The situation when in a linked list START=NULL is ____________________.
Kruskal's Algorithm : performs better in typical situations (sparse graphs) because it uses simpler data structures. Prim's Algorithm : is significantly ___the limit when you've got a really dense graph with many more edges than vertices.
_____________ order is the best possible for array sorting algorithm which sorts n item.
This is the term used to delete an element from the stack.
An ______hash function encodes a string of information and encodes it into a 128-bit fingerprint.
A program to keep track of patients as they check into a medical clinic, assigning patients to doctors on a first-come, first-served basis.
To keep up this site, we need your assistance. A little gift will help us alot.
Donate- The more you give the more you receive.
Related SubjectObject Oriented Programming Laboratory
Mobile Programming
Network Security
Management Information Systems
Managing Information and Technology
Mobile Application Design and Development
Mobile Application Design and Development 2
Living in the Information Technology Era
Mail and Web Services
Information Technology Practicum
Information Technology Capstone Project
Introduction to Computing
Intro to Hardware Description Language
Introduction to Human Computer
Introduction to Information Systems
Introduction to Multimedia
Integrative Programming and Technology 2
Internet Marketing and Entrepreneurship
Internet Technology in Real Estate
Information Assurance and Security 2
Information Assurance and Security 3
Information Security and Management
Information Systems Operations and Maintenance
Fundamentals of Investigation and Intelligence
Fundamentals of Database System
Digital Imaging
Data Communications and Networking
Cyber Security: Theories and Practice
Data Communications and Networking 2
Database Management System
Chemistry for Engineers
Computer Fundamentals
Animation Project
Load Testing
3D Game Art Development
Auditing and Assurance Concepts and Applications
Integrative Programming and Technology
Linux Administration
Software Engineering
Computer Programming
Applied Business Tools and Technologies
System Administration and Maintenance
Current Trends and Issues
Data Communications and Networking 4
Principles of Operating System and its Application
Systems Integration and Architecture
Application Lifecycle Management
Data Communications and Networking 3
Information Assurance and Security
Software Development
Mechatronics
Computer Information Systems
Computer Numerical Control
Computer Science
Web Systems Technologies
Massage Machines
Knowledge Management
Intrusion Detection System
Retail Merchandising
Forensic Science
Geographic Information Systems
Engineering
System Analysis Design and Development
Thesis Writing 2
Strategic Business Analysis
Risk Management
Quantitative Methods
Reading and Writing Skills
Real Estate Consulting and Investment Analysis
Research in Psychology 2
Shopee Helmet
Shopee 3D Floor
Lazada Smart TV Box
