selection repetition problem
can some one give me some problem for
for level of Programming 1
not so difficult and not so easy.
i just want to solve it. (^_^)
or can u give some site where can i find c++ problems.
thanks.
LOOP, SELECTION, REPETITIONfor level of Programming 1
not so difficult and not so easy.
i just want to solve it. (^_^)
or can u give some site where can i find c++ problems.
thanks.
LOOP, SELECTION, REPETITION?
What is that?.
In case you're speaking of Programming 1 of a degree in computer science, here are a couple of problems i made up.
-Implement the product of two matrices, A (m*n) , B (m'*n') using dynamic memory.
-We're given a list of universities. Each university has a list of students(FIELDS : Name (string), ID(unsigned char)). Each ID is unique, individual, but the names are not (For example : Two students are called 'Peter', but their ID's are 05 and 100).
* Given an ID, create an algorithm which returns the id, and the university the owner studies in. (in case he's found)
* Given a name, create an algorithm which returns the id/s and the university/ies of the students with that name.
- Design a recursive algorithm that lists all the numbers a0, a1, a2.... an such as a0*a1*a2....*an = a0+a1+a2...+an . Each ai is in the range -100..100. n is, at least 1, and at most 1000.
Have fun!
What is that?.
In case you're speaking of Programming 1 of a degree in computer science, here are a couple of problems i made up.
-Implement the product of two matrices, A (m*n) , B (m'*n') using dynamic memory.
-We're given a list of universities. Each university has a list of students(FIELDS : Name (string), ID(unsigned char)). Each ID is unique, individual, but the names are not (For example : Two students are called 'Peter', but their ID's are 05 and 100).
* Given an ID, create an algorithm which returns the id, and the university the owner studies in. (in case he's found)
* Given a name, create an algorithm which returns the id/s and the university/ies of the students with that name.
- Design a recursive algorithm that lists all the numbers a0, a1, a2.... an such as a0*a1*a2....*an = a0+a1+a2...+an . Each ai is in the range -100..100. n is, at least 1, and at most 1000.
Have fun!
Last edited on
Topic archived. No new replies allowed.