Please Help Members By Posting Answers For Below Questions

Question

Views

Select

Perform addition, multiplication, subtraction of 2-D array
using Operator Overloading.

2106

Assume an array of structure is in order by studentID field
of the record, where student IDs go from 101 to 500. Write
the most efficient pseudocode algorithm you can to find the
record with a specific studentID if every single student ID
from 101 to 500 is used and the array has 400 elements.
Write the most efficient pseudocode algorithm you can to
find a record with a studentID near the end of the IDs, say
in the range from 450 to 500, if not every single student
ID in the range of 101 to 500 is used and the array size is
only 300

496

can output 5 students using one dimensional array

700

what are the iterator and generic algorithms.

291

how can i access a direct (absolute, not the offset) memory
address?
here is what i tried:
wrote a program that ask's for an address from the user,
creates a FAR pointer to that adress and shows it. then the
user can increment/decrement the value in that address by
pressing p(inc+) and m(dec-).
NOW, i compiled that program and opened it twice (in 2
different windows) and gave twice the same address to it.
now look what happen - if i change the value in
one "window" of the program, it DOES NOT change in the
other! even if they point to the same address in the memory!
here is the code snippet:
//------------------------------------------------------
#include <stdio.h> //INCLUDE EVERY KNOWN HEADER FILE
#include <conio.h> //FOR ANY CASE...
#include <iostream.h>
#include <dos.h>
#include <process.h>
main()
{
int far *ptr; //FAR POINTER!!!
long address;
char key=0; //A KEY FROM THE KEYBOARD
int temp=0;
clrscr();
cout<<"Enter Address:";
cin>>hex>>address; //GETS THE ADDRESS
clrscr();
(long)ptr=address; temp=*ptr; //PUTS THE ADDRESS IN THE PTR
cout<<"["<<hex<<(unsigned long)ptr<<"]="<<*ptr<<" = "<<
(char)(*ptr);
//SHOWS: [address]=value=ASCII symbol.
while (key!=27) //WHILE YOU DONT PRESS ESC.
{
while(!kbhit()) //WHILE KEY IS NOT PRESSED
{
if (temp!=*ptr) { temp=*ptr; clrscr(); cout<<"["<<hex<<
(unsigned long)ptr<<"]="<<*ptr<<" = "<<(char)(*ptr); };
//IF THE VALUE HAS CHANGED, CLEAR THE SCREEN AND SHOW
//AGAIN
if (key=='p') {key=0; (*ptr)++; } //INCREMENT VALUE
if (key=='m') {key=0; (*ptr)--; } //DEC. VALUE
};
key=getch(); //IF A KEY IS PRESSED, READ IT FROM THE
//KEYBOARD
};
return 0; //IF ESC WAS THE KEY, EXIT THE PROGRAM
}
//---------------------------------------------------------

474

class base
{
public:
int fun(int)
{}
};
class base2
{
public:
int fun(float)
{
}
};
so here qustion is both function either function
overloading or over riding;

1489

Write a c program for binary addition of two 8 bit numbers.

1844

Write a program to read the data and evaluate the results of
the election. Print all output to the screen.
Your output should specify:
The total number of votes, the number of valid votes and the
number of spoilt votes.
The winner(s) of the election. Hint: An appropriate search
should be used to determine the winner(s).
The votes obtained by each candidate sorted in terms of the
number of votes obtained. Hint: An appropriate sort should
be used to sort the candidate(s).
The Source code should be saved as VotingSystem.
Project Input:
Candidates’ Names and Numbers
2501 Victor Taylor
2502 Denise Duncan
2503 Kamal Ramdhan
2504 Michael Ali
2505 Anisa Sawh
2506 Carol Khan
2507 Gary Owen
Votes
3 1 2 5 4 3 5 3 5 3 2 8 1 6 7 7 3 5 6 9 3 4 7 1 2 4 5 5 1 4 0
Project Output:
Invalid vote: 8
Invalid vote: 9
Number of voters: 30
Number of valid votes: 28
Number of spoilt votes: 2
The winner(s):
2503 Kamal Ramdhan
2505 Anisa Sawh
Candidate Score
2503 Kamal Ramdhan 6
2505 Anisa Sawh 6
2501 Victor Taylor 4
2504 Michael Ali 4
2502 Denise Duncan 3
2507 Gary Owen 3
2506 Carol Khan 2

1017

Program to check whether a word is a sub-string or not of a
string typed

474

Write a program in c++ to print the numbers from n to n2 except 5 and its multiples

638

A mXn matrix is given and rows and column are sorted as
shown below.Write a function that search a desired entered
no in the matrix .with minimum complexity
1 2 3 4
5 6 7 8
9 10 11 12
13 14 15 16

1417

A prime number is a number which is divisible only by itself
and 1. Examples of the first few primes are 2, 3, 5, 7, 11.
Consider writing a program which can generate prime numbers
for you. Your program should read in and set a maximum prime
to generate and a minimum number to start with when looking
for primes.
This program should be able to perform the following tasks:
1. Read the maximum number from user (keyboard input) to
look for primes. The program should not return any primes
greater than this number.
2. Read the minimum number from user (keyboard input) to
look for primes. The program should not return any primes
less than this number.
3. Generate and print out every prime number between the
maximum prime and minimum number specified by the user.

427

A company pays its salespeople on a commission basis. The
salespeople receive $200 per week plus 9 percent of their
gross sales for that week. For example, a saleperson who
sells $5000 worth of merchandise in a week receives $200
plus 9 percent of $5000, or a total of $650. You have been
supplied with a list of items sold by each salesperson. The
values of these items are as follows:
Item Value
A 239.99
B 129.75
C 99.95
D 350.89
Write a program that inputs one salesperson's items sold in
a week (how many of item A? of item B? etc.) and calculates
and displays that salesperson's earnings for that week.

871

Write an algorithm that determines whether or not an almost
complete binary tree is a heap.

1363

I want to write a C++ language program that:
1. Reads in the size of a square from the screen;
2. Prints a hollow square of that size out of “-“, “|” and
blanks on screen;
3. Prints the same hollow square onto a text file.
The program should work for squares of all side sizes
between 1 and 20.