Is merge sort algorithm sensitive to the input data (Yes/No)? Why?

Exhaustive Search Approach belongs to the Brute-Force design paradigm 

If f(n) = n and g(n) = log n3, which of the following statements is true?

Based on your understanding of the Traveling Salesman Problem (TSP), what is its time complexity using the Exhaustive Search Approach

Write code to implement one of the sorting algorithms you know.

Given the following functions: f(n) = 2n, w(n) = n2 and y(n) = nn, which one has the worst complexity?

The elimination of mistakes by eliminating them before they can occur is called:  a) Poka-Yoke b) Main Streaming c) Kaizen Scheduling d) Quality Screening e) Six Sigma 

Period Actual Demand Forecast1               172               283               334               ___ →  Compute the weighted average forecast for Period 4  using three (3) periods with a weighting  – 25% for first period, 25% for 2nd period and 50% for last period   Numerical response should be accurate to 2 decimal levels (Example: 99.75)  for your reply response into entry box    

What is  the running time of the following pseudo code in O notation:           for (int i = 0; i < n; i++)                 for (int j = 0; j < n*n; j++)                        cout

Which statement below is FALSE:    a: Truckload (motor) transportation has the most flexibility of any mode of transport in the United States b: On a global basis, air and ocean are the most commonly used modes of transportation c:  A NVOCC serves as a type of intermediary or middleman between ocean carriers and customers for ocean cargo shipping d:  Return/Reverse logistics functions have little to no impact upon a firm’s supply chain and their customers e:  Some types of inventory are raw materials, Work-In-Process (WIP), finished goods, and MRO                 (Maintenance/Repair Operations)