7th Grade Unit 3 Lesson 04 Quiz

Which is NOT true about the design process workflow?

• It is only useful in designing software or apps.
• It is an iterative process.
• It is useful in making all sorts of problems.
• It is a set of repetitive steps.

Mario's team has created a registration app for the school’s upcoming 5K race. The team has designed several stress tests for the app that are meant to do what?

• Promote the app on social media.
• Generate code for the app.
• Monetize the app.
• Check the app for flaws.

A Lucidchart is a digital whiteboard used to brainstorm ideas.

• TRUE
• FALSE

Maria wants to brainstorm ideas with her team using a digital whiteboard. What kind of document would work BEST for this purpose?

• Lucidspark
• brief
• Gantt chart
• Lucidchart

In Lucidchart, if a user drags off of a decision block, what will be created?

• an “Open User Prompt” block
• a “Manual User Input” block
• a duplicate of the decision block
• two arrows with “Yes” and “No” tags

The MOST efficient algorithm step to decide what kind of clothing to pack for a hiking trip would begin with:

• gathering information about what snacks you can take.
• figuring out which friends can go with you.
• searching for photos of the trail.
• gathering information about the weather forecast.

What shape is a decision block in a Lucidchart flowchart?

• circle
• square
• diamond
• arrow

What type of data would NOT be needed by an algorithm to schedule parent-teacher conferences?

• budgets
• times
• dates
• student names

What type of software is MOST effective for creating flowcharts?

• Google Sheets
• Microsoft Excel
• SQL database
• Lucidchart

Which of the following is the MOST efficient algorithm to find the fastest driving route between two cities?

• an algorithm that chooses the fastest route based on traffic and distance
• an algorithm that gathers flight, train, and bus data to find the fastest means of transport
• an algorithm that starts at one city and tests all roads leaving the city in all directions
• an algorithm that tests alternative routes until it finds the shortest one