100-500 words per explanation and avoid plagiarism.
Explain the following datatypes in your own words without copying it from
anywhere.
a. int
b. float.
c. double.
d. string.
e. Bool.
Write a program that creates and then reads a matrix of 5 rows and 5 columns of type int. while
reading; the program should not accept values greater than 100. For any entered value greater
than 100, the program should ask for input repeatedly. After reading all numbers, the system
should find the smallest number in the matrix and its location or index values. The program
should print the smallest number and its location (row and column) and also print their count
Create a Date class with three
integer instance variables named
day,month,year.It has a constructor
with three parameters for initializing
the instance variables,and it has one
method named daysSinceJan1(). It
computes and returns the number of
days since January 1 of the same
year,including January 1 and the day
in the Date object.
For example,if day is a Date object
with day=1,month=3,and
year=2000,then the
calldate.daysSinceJan1() should
return 61 since there are 61 days
between the dates of January
1,2000,and March 1,2000,including
January 1 and March 1. Don’t forget
to consider leap years.
300-500 words per discussion and avoid plagiarism
discuss the following
a. pointers
b. arrays
c. structures
d. classes
e. functions
Write a code which demonstrates the use of hex,oct,dec manipulators
Write an algorithm to find the energy produced at every second of the reaction is allowed to happen for n seconds
You are set out travel for your "Magical Vacation" and you are given a choice to take two destinations. You draw up multiple destination starting at asingle origin with different routes. Suppose different routes from torigin are represented complete binary tree height h, with number of node, n = 2 ^h - 1, where each node and each leaf of this tree ha associated cost "c" (any arbitrary real number). The destination are leaves of the tree. You can compute the cost to destination (leaf node) by summing up avalues of the nodes on the path up root, including leaf node itself. You are to find two destination has the lowest cost as your choice for vacation ie., x,y (two leaves). you can find cost by summing up all nodes in the path up the root. nodes only once [ie., you are taking the union of the ancestors up to origin]. Write a program to compute the lowest destination pair – that is of all leaf combinations which pair gives the lowest cost. Example: C(x,y) = 9 + 15+12 + 14+19+54 =123
Question 5 (20 marks) avoid plagiarism.
Discuss Object oriented programming in c++ with 4 points. Each point shoult not be less
than 200 words.
Question 4 (25 marks) avoid plagiarism. Write the following program in c++.
i. Create a class of your own choice with 5 attributes.
ii. Create an object of named objone in the intmain() function
iii. Access attributes and set values for all the 5 attributes
iv. Print all the attribute values
v. Create a function in the class that add two number and access the function using the
oblject.
Question 5 (20
Write the following program in c++.
Combine your first and second name and pick only the first five characters of your name for the project.
i. Declare an array named name1 and put all the first five characters into it.
ii. Write a for loop with an if condition that will find and output the index value of a
searched character in the array. Let the program be such that the user will input the character being searched for.