Search & Filtering
Write a Java program that calculates and prints the monthly pay for an employee. The net pay is calculated after taking the following deductions:
Withholding Tax 15%
SSS Contribution 3.63%
Medicare 1.25%
Pag-IBIG PHP 100.00
2.
1. Create a class node with following attributes
a. Data
b. Next pointer
c. constructor and destructor
d. accessor and mutator
2. Now create a class LLQueue with following attributes
a. Front pointer
b. Rear pointer
c. Enqueue: Adds an item to the queue.
d. Dequeue: Removes an item from the queue.
e. Peek
f. Length
g. Clever_display
h. Clever_search
i. Create a priority queue, that rearranges the colors in a rainbow fashion.
i. Red Orange Yellow Green Indigo Blue Voilet
Find latitude and longitude of first 20 countries with a population greater than or equal to the population limit given below. Use the country details from this dataset.
Your task is to find the sum of the length of all lines (in kms) that can be drawn between co-ordinates of these countries.
Assume radius of earth: 6371 km
Round length of each line and final result to 2 decimal points
If co-ordinates are missing for any country use 0.000 N 0.000 E
Population limit: 2072
Create interface Car: two methods getName () returns the car name, getPrice () method returns the car price
Create class BMW to implementation interface Car returns the name and price of BMW
Create class Maruti car to implement the interface Car returns the name and price of Maruti.
Create CarShop class: private member variable money is used to store the total income.
The member method sellCar has no return value and has a parameter, and the parameter is the Car interface.
The member method completes the function:
1. Output model: car name , get car price;
2. Cumulative total revenue money value
Create the main class: create an automobile sales shop object. Create BMW objects, Maruti objects
Call the sellCar method to sell the car. Output the total revenue of the sales shop.
Write a C# program that has a method named ReadArray. In this method, ask the user to enter names of employees, the program stops taking new names when the user enters the word “quit”. All names must be stored in an array as the user enters them; name the array, empNames. In the ReadArray, call another method named ReverseArray and pass to it, the empNames. The ReverseArray method will reverse the content of empNames. In ReadArray, print the reversed array. In the main method, only call the ReadArray, without passing anything to it. You should demo the pass-by-reference in this question.
Sample run:
Please enter an employee name: Karein
Please enter an employee name: James
Please enter an employee name: Komal
Please enter an employee name: Rohit
Please enter an employee name: quit
The names are:
Rohit
Komal
James
Karen
Implement a calculator using bitwise operators and for loops only. Your program should run correctly for positive integers only. You calculator should be able to perform following operations. Basic arithmetic functions (Addition, subtraction, division and multiplication); Square – to compute the square of the given value and Power – to compute the power of an integer. It should take two int arguments number and its power. Any operation that uses operators other than bitwise operators will be awarded zero marks
One method of classifying the various instances of malware is by using the primary trait that the malware possesses. Identify four primary traits and give two examples of malware that have the primary trait infection
Write a c++ program which produce the given sequence (in alternative arrangement and reverse order using for loop statement)
Example input: 5
Output: 5, 1, 4, 2, 3, 3, 2, 4, 1, 5
(i) Which is the most suitable graph representation scheme for a dense graph? Draw its
representation with the help of an example. What is the space complexity of a such
graph representation scheme?
(ii) How does DFS graph traversal scheme work? Explain.
(i) Formulate the Knapsack problem and write the pseudo code for solving a fractional
Knapsack problem. Also calculate its time complexity.
(ii) Find an optimal solution for the knapsack instance n (number of objects) =7 and
W ( totalweight) =15. Profits and weights of each object are shown below:
(p1, p2………..p7) = (10, 5, 15, 7, 6, 18, 3)
(w1, w2………w7) = (2, 3, 5, 7, 6, 4, 1)
Show all the steps.
