C++ Answers

write a C++ programme to take in put from user in a dynamic array and find positive ,negative ,neutral, maximum and minimum number.it must be function

Write a program to read the elements of a sparse matrix from the user and display 

it in its 3-tuple form. Your program should verify whether at the entire matrix 

is sparse or not.

Write a C++ Program to Read Write Lecturer Details using File Handling. Data members , Name, EmployeId, Department. Member functions are setter and getter function. Array of 3 lecturer data should be written and read in a file.

2. Make another file and read data from first file and write into second file in reverse order.

Create a C++ program that will accept input of any number then press 0 to stop. Count and display the positive and negative numbers.

Quotation marks are usually paired with a similar type, like a double quote (") paired with another double quote ("), and the same goes for single quotes ('). However, I'd like to try complicating things by putting together a pair of a double quote(") and a single quote(') in one statement!

Can you do this simple challenge?

Output

A line containing a string.

"'

create a c++ program that will perform the four basic mathematical operation. design the program to choose which operation to use, then ask the user to enter two values which will be use in computation

Manually show how bubble sort algorithm works on the following array:

a) {30,60,20,50,40,10}

b) {30,19,20,25,40,30}

c) {20,60,27,50,21,10}

create a program that will accept 1 input number then display the even numbers base from the inputted number

Write your OWN CLASS for realization one of data structure - Queue, Stack, Singly linked list, Doubly linked list, Circular list, Random access array.

Develop a program that reads from the keyboard sequence of N unique integers N (1 <N <256), saves them to a data structure (Queue, Stack, Singly linked list, Doubly linked list, Circular list, Random access array.) and displays the following characteristics: 

- number of elements; 

- average of saved items; 

- minimum and maximum element; 

- fourth element of the sequence; 

- element that is before the minimum element.

We emphasize that all the characteristics necessary must be define for a filled data structure. Only those operations that are inherent to given structure are allowed, for example, one must not access an element on an arbitrary position in a queue which is based on an array. Usage of ready data structures (e.g., STL) is prohibited. 

Search all occurrences of an element in an array of 10 elements using ptr notation.