Search & Filtering
#include <iostream>
#include <vector>
std::vector<std::string> getUniqueBrands(const std::vector<std::string>& brand1, const std::vector<std::string>& brand2)
{
throw std::logic_error("yet to be implemented");
}
int main()
{
std::vector<std::string> brand1 = {"LOUIS_VUITTON", "HERMES", "PRADA");
std::vector<std::string> brand2 = {"GUCCI", "PRADA", "HERMES");
std::vector<std::string> result = getUniqueBrands(brand1 , brand2);
for(auto element : result)
{
std::count << element<< ' ';
//should print GUCHHI HERMES LOUIS_VUITTON PRADA
}
}
Write a C++ program that takes five alphabets from the user and ask the user to delete any
alphabet. You should store the alphabets in a char array.
Write a C++ program that asks the user to enter 10 integer values in an array. After entering 10
elements find the maximum number and display it on output screen.
**Using a three dimensional array***
Sample:
Enter a number of tables: 2
Enter a number of rows: 2
Enter a number of columns: 2
Enter 8 number of elements:
1
2
3
4
5
6
7
8
The biggest number among them is: 8
The smallest number among them is: 1
Then second to the biggest number is: 7
Create a program the user will input 5 grades (choose any subjects and input any grades). Determine individual subjects either passed or failed. Lastly, calculate the average grade and determine whether if passed or failed.
Sample output:
Student Name: Jessica
Math: 74 - Failed
Science: 89 - Passed
English: 74 - Failed
*If the average grade is >= 75
the output should be
PASSED!
*If the subject grade is below 74 the output should be
You need to re-take in Math Subject and English Grade
*If the average grade is <= 74 the output should be
YOU FAILED!
words with vowels
The goal of this coading exam is to quickly get you off the ground with the array method filter().
given vowel list in the prefilled code and wordList as input,write a js program to,
filrer the words from wordslist with at least one vowel in it
log the array containning the filtered words in the console
input:
['Sword' , 'Myth' , 'Patient', 'Rhythm']
output:
['Sword', 'Patient']
input:
['Road' , 'Printer' , 'Eye' , 'Hymn']
output:
['Road' , 'Printer' , 'Eye' ]
Write C++ Program that obtains several number of students’ info and displays it to
the console. Define a structure Student, structure data members char ID[15], char
grade.
: Facing in any direction and given enough turns, it can move from any square on the board to any other square. If you want to know the simplest way your knight can move from one square (or node) to another in a two-dimensional setup, you will first have to build a function like the one below. knight plays ([0,0], [1,2]) == [[0,0], [1,2]] knight plays ([0,0], [3,3]) == [[0,0], [1,2], [3,3]] knight plays ([3,3], [0,0]) == [[3,3], [1,2], [0,0]] You are required to do the following: 1. Explain how you can ensure that any move do not go off the board. 2. Choosing a search algorithm for finding the shortest path for the knight’s travails.3. Create a diagrammatical tree structure, to illustrate all possible moves of the knight as children in the tree structure. In this task, you need to understand two algorithms which can be helpful, the Breadth-First Search which utilizes the Queue data structure to find the shortest path and the Depth-First Search which can traverse a Stack data structures.
You have been contracted by Toyota Zambia to design a system that can make the Toyota Mark X a smart vehicle. The company has proposed to install four infrared radars on the car, just below each light set, to use as sensors. Each sensor has a range of 20m. The company wants the car to be able to avoid collisions at the rear, and the front, and to be able to auto accelerate to a recommended spend if the course is clear or when collision is eminent at the rare and the front is clear, and to be able to overtake a vehicle on the road without causing any accident. The sensors can pick human body heat at a distance of 15m, and a vehicle body heat at 20m.
the car to be able to avoid collisions at the rear, and the front, and to be able to auto accelerate to a recommended spend if the course is clear or when collision is eminent at the rare and the front is clear, and to be able to overtake a vehicle on the road without causing any accident.
