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.
This form of access is used to add and remove nodes from a queue.
Indexing the ________________ element in the list is not possible in linked lists.
The root of a tree is the node that has no ancestors.
Sorting algorithm can be characterized as ________________.
Which of the following is not the part of ADT description?
Which indicates pre-order traversal?
The complexity of merge sort algorithm.
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.
A graph is a collection of points, called vertices, and line segments connecting those points, called _______.
Which of the following names does not relate to stacks?
______ are a common method to visually illustrate relationships in the data.
The complexity of sorting algorithm measures the __________ as a function of the number n of items to be shorter.
A ________ is a data structure that is used to store keys/value pairs.
Which of the following is not a limitation of binary search algorithm?
Every node N in a binary tree T except the root has a unique parent called the ________ of N.
In linked lists, there are no NULL links in ______________
Which is the pointer associated with the stack?
A bank simulation of its teller operation to see how waiting times would be affected by adding another teller.
A binary search tree is another name for a binary tree.
In an extended binary tree, nodes with 2 children are called _________________.
On average, searching in a binary search tree is faster than searching in a list.
This is the operation of processing each element in the list.
Which of the following is an application of stack?
A hash function is a function which when given a key, generates an address in the table.
What does the sequential representation of binary trees use?
The rearranging of pairs of elements which are out of order, until no such pairs remain.
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.
This is a terminal node in a binary tree.
Stack is also called the ________________.
_____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 data structure is non-linear type?
A stack displays FIFO behavior.
The Floyd-Warshall algorithm outputs the correct result as long as no negative cycles exist in the input graph.
This is a binary tree whose every node has either zero or two children.
Dijkstra's algorithm works correctly, because all edge weights are non-________, and the vertex with the least shortest-path estimate is always chosen.
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
An electronic address book ordered by name
What is a queue?
A queue displays LIFO behavior.
In computer science, a problem is said to have optimal substructure if an optimal solution can be constructed from optimal solutions of its subproblems.
Which of the following is/are the levels of implementation of data structure?
This is the insertion operation in the stack.
Herder node is used as sentinel in __________________.
Which data structure allows deleting data elements from and inserting at rear?
A list may be linear or nonlinear, depending on its implementation.
A ________ is a data structure that has two types of elements, vertices and edges.
This indicates the end of the list.
A stack and a queue are different names for the same ADT.
The worst case occurs in linear search algorithm when ________________.
In a graph, the vertices represent the items being modeled.
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.
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.
A pseudo _____-graph is a general-graph allowing edges to connect a vertex to itself.
A graph is a____structure that has two types of elements, vertices and edges.
A simple graph, also called a ______graph.
The dummy header in linked list contains ____________________.
The average case occurs in linear search algorithm _______________.
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.
The eight most commonly used graphs are linear, power, quadratic, polynomial, rational, ______, logarithmic, and sinusoidal.
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?
A linear list in which the pointer points only to the successive node.
Path Matrix in graph theory is a matrix sized ___ , where n is the number of vertices of the graph.
The complexity of linear search algorithm.
Algorithms that use a list must know whether the list is array based or linked.
A simple graph may be either ____________.
Each node in singly linked list has _______ fields.
The complexity of bubble sort algorithm.
A directed general-graph is a general-graph in which the set E is the set of ordered pairs of vertices.
____________________ level is where the model becomes compatible executable code.
______ 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.
A binary search cannot be applied to a tree.
Which of the following is two way lists?
Stack follows the strategy of ________________.
Graphs are a powerful and versatile data structure that easily allow you to represent real life relationships between different types of data (nodes).
Which data structure is used in breadth first search of a graph to hold nodes?
A linear list in which the last node points to the first node.
A connected graph T without any cycles is called ________________.
_______ Algorithm : performs better in typical situations (sparse graphs) because it uses simpler data structures.
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.
This is the term used to delete an element from the stack.
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
_______programming is a method of solving complex problems by breaking them down into simpler steps.
_________ algorithms work by recursively constructing a set of objects from the smallest possible constituent parts.
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.
This is very useful in situation when data have to be stored and then retrieved in reverse order.
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 program to keep track of patients as they check into a medical clinic, assigning patients to doctors on a first-come, first-served basis.
A binary search tree whose left subtree and right subtree differ in height by at most 1 unit is called ____________________.
What happens when you push a new node onto a stack?
In the linked representation of the stack, __________ pointer behaves as the top pointer variable of stack.
In linked representation of stack, ___________ fields hold the elements of the stack.
A leaf in a tree is a node with no children.
A hash______ is a data structure that is used to store keys/value pairs.
Partition and exchange sort is ____________.
The term push and pop is related to _____________.
Dynamic programming is a method of solving complex problems by breaking them down into simpler steps.
The elements are removal from a stack in _________ order.
A program to receive data that is to be saved and processed in the reverse order.
What is a run list?
It is a pile in which items are added at one end and removed from the other.
Breadth-first-search is the algorithm that will find shortest paths in an _____ graph.
Breadth-____-search is the algorithm that will find shortest paths in an unweighted graph.
A hash table is an array containing all of the keys to search on.
Hashing is also used in encryption.
If the number of records to be sorted is small, then __________ sorting can be efficient.
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, ' '
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.
The situation when in a linked list START=NULL is ____________________.
Each node in a linked list must contain at least ___________________.
Which is the pointer associated with the availability list?
Which of the following sorting algorithm is of the divide and conquer type?
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
Deletion operation is done using __________ in a queue.
Which data structure is suitable to represent the hierarchal relationship between elements?
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, ' '
Linked representation of binary tree needs ______ parallel arrays.
In ___________ we specify an object that is used as a key, and the value we want to associate to that key.
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.
The retrieval of items in a stack is ___________ operation.
A binary tree is a tree in which each node can have zero, one, or two children.
A connected graph T without any cycles is called a ____________.
An ______hash function encodes a string of information and encodes it into a 128-bit fingerprint.
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.
Which of the following is not the required condition for binary search algorithm?
Hashing provides a more reliable and_ method of data retrieval than any other data structure.
Binary search algorithm cannot be applied to _______________.
Which of the following sorting algorithm is of priority queue sorting type?
A program to keep track of family relationships
_____matrix in graph theory is a matrix sized n*n , where n is the number of vertices of the graph.
New nodes are added to the ________ of the queue.
These are binary trees with threads.
A program to keep track of the soccer teams in a city tournament
Linked lists are best suited _____________________.
The Three methods in HASHING in open addressing are linear probing, quadratic probing, and _____hashing.
The four most common are probably line graphs, bar graphs and histograms, pie charts, and ?
This refers to a linear collection of data items.
Value of first linked list index is _______________.
The operation of processing each element in the list is known as ________________.
In a 2-tree, nodes with 0 children are called ___________.
A graph is a picture designed to express words, particularly the connection between two or more quantities.
Tree is a hierarchical data structure which stores the information naturally in the form of hierarchy style.
In a graph, if E=(u,v), it means _____________.
A dictionary of words used by a spelling checker to be built and maintained.
In linked representation of stack, the null pointer of the last node in the list signals _____________________.
Which of the following data structure can't store the non-homogeneous data elements?
Shortest path algorithms are a family of algorithms designed to solve the shortest path problem.
In binary trees, nodes with no successor are called _______________.
This may take place only when there is some minimum amount or no space left in free storage list.
This is a linear list in which insertions and deletions are made to form either end of the structure.
Trees are ________ if they are similar and have the same contents at corresponding nodes.
This form of access is used to add/remove nodes from a stack.
Graph Algorithms or Graph ______ are analytic tools used to determine strength and direction of relationships between objects in a graph.
A hash function that returns a unique hash number is called a _______hash function.
LINK is the pointer pointing to the ____________________.
The term used to insert an element into stack.
Which of the following is non-linear data structure?
The depth of complete binary tree is given by ________________.
In a graph, if e=[u,v], then u and v are called _______________
__________________ is putting an element in the appropriate place in a sorted list yields a larger sorted order list.
A pointer variable which contains the location at the top element of the stack.
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).
Another name for directed graph.
___________ sorting algorithm is frequently used when n is small, where n is the total number of elements.
The _______ algorithm is a graph search algorithm that finds the shortest path between a given source vertex and all other vertices in the graph.
Binary search trees are ordered.
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.
____________________ is not the component of data structure.
A program to maintain the routes in an airline.
An MD5 hash function encodes a string of information and encodes it into a___bit fingerprint.
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.
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.
Eulerian refers to the Swiss mathematician _____Euler, who invented graph theory in the 18th century.
Identify the data structure which allows deletions at both ends of the list but insertion at only one end.
Which of the following data structures is linear type?
In a linked list, the ____________ contains the address of next element in the list.
_____________ order is the best possible for array sorting algorithm which sorts n item.
The method used by card sorter.
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 2
Mobile Application Design and Development
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
Cyber Security: Theories and Practice
Data Communications and Networking
Data Communications and Networking 2
Database Management System
Chemistry for Engineers
Computer Fundamentals
Load Testing
3D Game Art Development
Animation Project
Auditing and Assurance Concepts and Applications
Software Engineering
Computer Programming
Linux Administration
Current Trends and Issues
Integrative Programming and Technology
System Administration and Maintenance
Data Communications and Networking 4
Applied Business Tools and Technologies
Data Communications and Networking 3
Application Lifecycle Management
Systems Integration and Architecture
Information Assurance and Security
Principles of Operating System and its Application
Software Development
Mechatronics
Computer Information Systems
Computer Numerical Control
Computer Science
Web Systems Technologies
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
Investment and Portfolio Management
International Marketing
Modeling and Simulation
Shopee Helmet
Shopee 3D Floor
Lazada Smart TV Box
