Ask the user to input three positive integers M, N and q. Make the 2 dimensional array of integers with size MxN, where all the elements of I (I = 1,…,M) line will be members of geometrical progression with first element equal to the number of line (I) and denominator q.
write a function that allocates memory for a single data
type passed as a parameter.the function uses the new
operator and return a pointer to the allocated memory.the
function must catch and handle any exception during allocation
PROBLEM #8 The cashier at the counter of a Super Store, Mr.
Khazaanchi has the following
bundles of rupee cash notes with him:
Rs. 1, 2, 5, 10, 50, 100, 500, 1000
A customer comes at his counter with various items that he
has shopped. Mr. Khazaanchi totals
the item prices and tells the customer his total amount
payable. The customer gives Mr. Khazanchi
some amount of cash. Find the total number of rupee notes of
each denomination (i.e. 1, 2, 5, 10,
50, 100, 500, 1000) Mr. Khazaanchi will have to give to the
withdrawer ensuring that the total
number of rupee notes are minimum.
Write a (n) algorithm that sorts n distinct integers,
ranging in size between 1 and kn inclusive, where k is a
constant positive integer. (Hint: Use a kn-element array.)
using friend function find the maximum number from given two
numbers from two different classes.write all necessary
functions and constructor for the classes.
A research student is given a singly-linked list. Each node
of the list has a color, which is either “Black”
or “White”. He must find if there are more black nodes than
white nodes, or vice versa. His advisor
gives him 5,000Rs to buy a computer to do the work. He goes
to the computer store and finds a
slightly defective computer which costs a mere 3,000Rs. This
computer has the small problem of not
being able to do arithmetic. This means that he cannot use a
counter to count the nodes in the list to
determine the majority color. The computer is otherwise
fully functional. He has the evil idea that he
could buy the defective computer and somehow use it to do
his work, so that he can use the rest of
the money on enjoyment. Show how he can accomplish this
amazing task. Write code for an algorithm
called ‘findMajorityColor’ which takes a singly-linked list,
L, with n nodes and returns the majority color
among nodes of L. This algorithm should have the same
asymptotic running time as counting the
nodes (O(n)). Note: No arithmetic is allowed.
write a program that creates a sequenced array of numbers
starting with 1 and alternately add 1 and then 2 to create
the text number in the series , as shown below.
1,33,4,6,7,9,............147,148,150
Then , using a binary search , searches the array 100 times
using randomly generated targets in the range of 1 to 150
3. Program to find the Sum of give series.
a. (1)+(1+2)+(1+2+3)+(1+2+3+4)+………………………………..
b. 1/1+1/9+1/25+1/49+……………...
840
write a program that can LOCATE and INSERT elements in array
using c++ programming languages.
411
Definition of priority queue was given. We have to implement
the priority queue using array of pointers with the
priorities given in the range 1..n.
The array could be accessed using the variable top. The list
corresponding to the array elements contains the items
having the priority as the array index.
Adding an item would require changing the value of top if it
has higher priority than top.
Extracting an item would require deleting the first element
from the corresponding queue.
The following class was given:
class PriorityQueue
{
int *Data[100];
int top;
public:
void put(int item, int priority); // inserts the item with
the given priority.
int get(int priority); // extract the element with the
given priority.
int count(); // returns the total elements in the priority
queue.
int isEmpty(); // check whether the priority queue is empty
or not.
};
We had to implement all these class functions.
Ask the user to input three positive integers M, N and q. Make the 2 dimensional array of integers with size MxN, where all the elements of I (I = 1,…,M) line will be members of geometrical progression with first element equal to the number of line (I) and denominator q.
201
create a stucture student containing field for roll
no,class,year and marks.create 10 student annd store them in
a file
Seat Reservation prog for the theatre. Write a function for
seat allocation for the movie tickets. Total no of seats
available are 200. 20 in each row. Each row is referred by
the Character, "A" for the first row and 'J' for the last.
And each seat in a row is represented by the no. 1-20. So
seat in diffrent rows would be represented as
A1,A2....;B1,B2.....;........J1,J2... Each cell in the
table represent either 0 or 1. 0 rep would seat is
available , 1 would represent seat is reserved.
Booking should start from the last row (J) to the first
row(A). At the max 20 seats can be booked at a time. if
seats are available, then print all the seat nos like "B2"
i.e (2 row, 3 col) otherwise Print "Seats are not
available." and we must book consecutive seats only.
write a program using virtual function to find the
transposing of a square matrix?
762
write a program that creates a sequenced array of numbers
starting with 1 and alternately add 1 and then 2 to create
the text number in the series , as shown below.
1,33,4,6,7,9,............147,148,150
Then , using a binary search , searches the array 100 times
using randomly generated targets in the range of 1 to 150
409
Write a program that print in screen a tree with its height
taken from user by entering number of 4 digits and find
the odd numbers then calculate the sum of odd numbers so he
get the height of tree?
689
can you please write a program for deadlock that can detect
deadlock and to prevent deadlock.
930
Teta-Omeg-Big-Oh
Show that f(n) = n2 + 3n3 is ;(n3).