Your browser does not support JavaScript!
ChangingReindeer just signed up and they study Psychology 😌
TiredDonkey just signed up and they study Psychology 😌
ImmenseFowl just signed up and they study Human Resource Management 🫂
ImmediateMastodon just signed up and they study Psychology 😌
LiveBandicoot just signed up and they study Information Technology 👩‍💻
SourTapir just signed up and they study Information Technology 👩‍💻
NumerousLeopard just signed up and they study Psychology 😌
PetiteCatshark just signed up and they study Psychology 😌
GreenLadybug just signed up and they study Marketing Management 📈
IsraeliOrangutan just signed up and they study Psychology 😌

Data Structures and Algorithm Analysis

Showing 1-75 of 241 answers

A connected graph T without any cycles is called ________________.
  • no cycle graph
  • circular graph
  • free graph Correct
  • non-cycle graph
A connected graph T without any cycles is called a ____________.
  • Free tree
  • all of these Correct
  • A tree
  • A tree graph
A hierarchical data structure
  • Trees Correct
  • Stacks
  • Lists
  • Queues
A linear list in which the last node points to the first node.
  • circular linked list Correct
  • none of these
  • doubly linked list
  • singly linked list
Another name for directed graph.
  • Diregraph
  • Dir-graph
  • Direct graph
  • Digraph Correct
Any node of a tree that has child node
  • internal nodes Correct
  • prime nodes
  • external nodes
  • head nodes
Any node that does not have child nodes are also called
  • empty nodes
  • internal nodes
  • leaf nodes Correct
  • single nodes
Binary search algorithm cannot be applied to _______________.
  • sorted linear array
  • sorted linked list
  • sorted binary trees
  • pointer array Correct
Describe the following code
  • None of the choices
  • A function that will insert a node in an arbitrary position Correct
  • Identifies the current and previous data element in the linked list
  • Traverse a linked list
Each node in a linked list must contain at least ___________________.
  • Three fields
  • Five fields
  • Two fields Correct
  • Four fields
Every node (except the last node) contains the _____________________?
  • element of the next node
  • link of the next node
  • address of the next node Correct
  • data of the next node
Given an empty array with 5 in size and the following operations have been executedEnqueue(8)Enqueue(1)Enqueue(7)Enqueue(2)Enqueue(6)What will happen if an attempt to execute enqueue(3)?
  • The element will be added into the rear of the array
  • The element will be added in front of the array
  • None of the choices
  • A queue overflow error will occur Correct
Given the code, the program will ____________
  • Delete a node
  • Create a node Correct
  • Store same value to head and tail of the linked list
  • Set null value to the next node
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.
  • Directly connected
  • Widely connected
  • Literally connected
  • Unliterally connected Correct
Graphs consists of the following :
  • vertices and edges Correct
  • none of the choices
  • headers and tails
  • pointers and arrays
If a graph has a directional flow, the graph is defined to be ______________
  • connected
  • directed Correct
  • not connected
  • undirected
Search
All courses