javascript only: You have been assigned to work with an undersea explorer who is attempting to identify and map undersea trenches. The explorer has provided you with several data sets.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

javascript only:

You have been assigned to work with an undersea explorer who is attempting to identify and map undersea trenches. The explorer has provided you with several data sets.

Depending on the scan, the provided matrix may be larger or smaller, but it will always be rectangular. Your task is to determine if a given data set contains a trench by comparing each node and their neighbors and determining if there is a pattern that matches the defined properties of a trench.

Neighbors are considered to be nodes that are directly above, below, or to the side. No diagonals!

A trench has the following three properties:

It has a length of three or more nodes that are neighbors.

Each node in the trench must be deeper than -5.

Trenches may not branch into (any form of) a "T" shape. A node with more than two neighbors will result in branching "T" shape.

// Example 1 sonar = [ [-5,-5,-5,-5,-5], [-5,-8,-8,-9,-7], [-5,-5,-5,-5,-8], [-5,-5,-5,-5,-5] ]

 

 

function findNeighbors (node, matrix) {
// Only consider N, S, E, W nodes
}
}
// North
}
// South
// East
function trenchTraversal (node, matrix, visited) {
// Don't bother traversing if it is to shallow
// West
// ]
// Your code here
function identifyTrench (trenchMatrix) {
// Start at 0,0 and attempt to traverse any unvisited nodes
// Your code here
// Traverse the potential trench to count it's length
// Your code here
// Uncomment for local testing
// // Example 0
// const sonar_0 = [
//
[-5, -5, -5],
//
[-6, -5, -8],
[-5, -7, -5]
// console.log(findNeighbors ([1,1], sonar_0)) // => Expect [[2, 1], [1, 0], [1, 2]];
Transcribed Image Text:function findNeighbors (node, matrix) { // Only consider N, S, E, W nodes } } // North } // South // East function trenchTraversal (node, matrix, visited) { // Don't bother traversing if it is to shallow // West // ] // Your code here function identifyTrench (trenchMatrix) { // Start at 0,0 and attempt to traverse any unvisited nodes // Your code here // Traverse the potential trench to count it's length // Your code here // Uncomment for local testing // // Example 0 // const sonar_0 = [ // [-5, -5, -5], // [-6, -5, -8], [-5, -7, -5] // console.log(findNeighbors ([1,1], sonar_0)) // => Expect [[2, 1], [1, 0], [1, 2]];
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 3 steps with 1 images

Blurred answer
Knowledge Booster
Rendering
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education