| | |
Exam Prep Approaches and Question Databases
![]() |
•
•
Join Date: May 2008
Posts: 17
Reputation:
Solved Threads: 0
Hi guys,
This may well have been covered in another post and, if so, feel free to direct me to that one. Also, I hope that I am in the correct section!
I am approaching the end of my semester and face the upcoming exams. Obviously most of the work for computing is achieved by doing the homework throughout the semester and learning as you go, which I hasten to add I have done! However, I would also like to perform really well in the exam and demonstrate what I know. Therefore, my question has two parts:
1 - What strategies do you recommend in preparation for these kind of examinations? This may sound a little vague, but what I mean is: hardest topics first, last or mix it up? suggestions for breaking down the structure of a session. Also, any hints for good exam technique would be greatly appreciated, eg. do you do easy questions first or just standard order?
2 - I hope this is not an inappropriate question, but are there collections of questions to practise and, if so, is this ok? For example, things like: write an iterative function that finds the max value in an array, write a recursive function which does y. I would love to be able to just practise basic functions to really drill the concepts into my head.
Thanks very much for your time, guys. I hope that this sort of stuff is not a problem to ask. I really am just looking for pointers from people with experience.
Cheers
This may well have been covered in another post and, if so, feel free to direct me to that one. Also, I hope that I am in the correct section!
I am approaching the end of my semester and face the upcoming exams. Obviously most of the work for computing is achieved by doing the homework throughout the semester and learning as you go, which I hasten to add I have done! However, I would also like to perform really well in the exam and demonstrate what I know. Therefore, my question has two parts:
1 - What strategies do you recommend in preparation for these kind of examinations? This may sound a little vague, but what I mean is: hardest topics first, last or mix it up? suggestions for breaking down the structure of a session. Also, any hints for good exam technique would be greatly appreciated, eg. do you do easy questions first or just standard order?
2 - I hope this is not an inappropriate question, but are there collections of questions to practise and, if so, is this ok? For example, things like: write an iterative function that finds the max value in an array, write a recursive function which does y. I would love to be able to just practise basic functions to really drill the concepts into my head.
Thanks very much for your time, guys. I hope that this sort of stuff is not a problem to ask. I really am just looking for pointers from people with experience.
Cheers
•
•
•
•
Hi guys,
This may well have been covered in another post and, if so, feel free to direct me to that one. Also, I hope that I am in the correct section!
I am approaching the end of my semester and face the upcoming exams. Obviously most of the work for computing is achieved by doing the homework throughout the semester and learning as you go, which I hasten to add I have done! However, I would also like to perform really well in the exam and demonstrate what I know. Therefore, my question has two parts:
1 - What strategies do you recommend in preparation for these kind of examinations? This may sound a little vague, but what I mean is: hardest topics first, last or mix it up? suggestions for breaking down the structure of a session. Also, any hints for good exam technique would be greatly appreciated, eg. do you do easy questions first or just standard order?
2 - I hope this is not an inappropriate question, but are there collections of questions to practise and, if so, is this ok? For example, things like: write an iterative function that finds the max value in an array, write a recursive function which does y. I would love to be able to just practise basic functions to really drill the concepts into my head.
Thanks very much for your time, guys. I hope that this sort of stuff is not a problem to ask. I really am just looking for pointers from people with experience.
Cheers
Here are some questions for you to answer--
"What is the difference between a constant pointer and a pointer to a constant? Write out the syntax for both and then write a block comment with information about each types functionality."
"Write a Structure named BASE_STRUCT and another structure named DERIVED_STRUCT where DERIVED_STRUCT is a polymorphic object that inherits information from BASE_STRUCT"
"What is the difference between a Union, Struct and Class?"
"True or False: A Pointer is an Array, but an Array is not a Pointer."
"True or False: NULL and 0 have the exact same functionality when assigning a pointers address to either."
"True or False: You can change the address pointed by a constant pointer but cannot change the address pointed by a pointer to a constant."
Multiple Choice: What is the value of the pointer after this syntax--
int array[] = {10, 20, -10, -20, 5}, *p = array;
p = &p[2];
array[1] = 5;
p++;
A) 10
B) 20
C) -10
D) -20
E) 5
-------------------
Multiple Choice: What is the difference between--
// information about pointers int x[] = {1, 2}, y[] = {3, 4}, *p = x, *q = y;
*p++ = *q++;
p++ = q++;
A) The first line increments the values and copies the values from q to p whereas the second line increments the addresses and assigns the address of q to p
B) The first line copies the values from q to p then increments the address whereas the second line assigns the address of q to p and then increments the address pointed by both pointers.
C) The first line increments the addresses and copies the values from q to p whereas the second line increments the addresses and assigns the address of q to p
D) The first line assigns the value of q to p then increments the values of q and p whereas the second line assigns the address of q to p then increments the address pointed by both pointers.
E) There is no difference
int array[] = {10, 20, -10, -20, 5}, *p = array;
p = &p[2];
array[1] = 5;
p++;
A) 10
B) 20
C) -10
D) -20
E) 5
-------------------
Multiple Choice: What is the difference between--
// information about pointers int x[] = {1, 2}, y[] = {3, 4}, *p = x, *q = y;
*p++ = *q++;
p++ = q++;
A) The first line increments the values and copies the values from q to p whereas the second line increments the addresses and assigns the address of q to p
B) The first line copies the values from q to p then increments the address whereas the second line assigns the address of q to p and then increments the address pointed by both pointers.
C) The first line increments the addresses and copies the values from q to p whereas the second line increments the addresses and assigns the address of q to p
D) The first line assigns the value of q to p then increments the values of q and p whereas the second line assigns the address of q to p then increments the address pointed by both pointers.
E) There is no difference
Last edited by Alex Edwards; Jun 3rd, 2008 at 12:22 am.
its so hard to guide you on how to best prepare becasue we dont know what the focus of material was, and we dont know which aspects the professor deems to be more/less important.
make sure you understand the whys and wherefores of all the problems in previous assignments.
Generally speaking, i would definitely hit up the TA's or whatever the assistants/graders are called at your school. if theres any sort of "practice exam" available, DO THAT. check the library if there are some sort of "course reserves" and the course online repository for old exams. finding a study group to join, if not too late .... Sorry if these are generic suggestions, but honestly, it's how i got through engineering school.
the things that Alex posted above are good general problems, but may not be the best use of your preparation time. Unfortunately, there's just no way for any of us here to tell.
good luck.
.
make sure you understand the whys and wherefores of all the problems in previous assignments.
Generally speaking, i would definitely hit up the TA's or whatever the assistants/graders are called at your school. if theres any sort of "practice exam" available, DO THAT. check the library if there are some sort of "course reserves" and the course online repository for old exams. finding a study group to join, if not too late .... Sorry if these are generic suggestions, but honestly, it's how i got through engineering school.
the things that Alex posted above are good general problems, but may not be the best use of your preparation time. Unfortunately, there's just no way for any of us here to tell.
good luck.
.
Last edited by jephthah; Jun 3rd, 2008 at 1:28 am.
•
•
Join Date: Jan 2008
Posts: 3,832
Reputation:
Solved Threads: 501
I read in another one of your posts that you are a "first year" student, if I recall correctly. Alex raises some good questions, but I think they may be a bit more advanced than "first year". At least they were at my school (CSU system). Maybe some of the people here went to other schools where they taught that earlier (flame war, anyone?
). Ditto what jephthah said. Every professor is different and they test differently. Tailor it to their priorities. I've had 100% essay question tests with no coding like Alex's questions and vice versa.
). Ditto what jephthah said. Every professor is different and they test differently. Tailor it to their priorities. I've had 100% essay question tests with no coding like Alex's questions and vice versa. Last edited by VernonDozier; Jun 3rd, 2008 at 2:11 am.
•
•
Join Date: May 2008
Posts: 17
Reputation:
Solved Threads: 0
Thanks very much guys. Some of the questions posed are quite advanced (for me, anyways!), however, I will research them and generate some code to better understand some of these rather subtle distinctions. I am not really familiar with the idea of incrementing pointers so I look forward to an extended session working that one out!
Can I just say how great this site is and how much I have appreciated the help provided by people, which has been really fantastic. As an aspiring programmer, it is really great to have somewhere to turn when I hit a brick wall! Thanks again.
Kind regards,
Daniel
Can I just say how great this site is and how much I have appreciated the help provided by people, which has been really fantastic. As an aspiring programmer, it is really great to have somewhere to turn when I hit a brick wall! Thanks again.
Kind regards,
Daniel
Hey Interesting Questions above. But i was wondering how do i do that polymorphic structs for this question,
Should we actually write a constructor For Base_struct and then write some code like this.
•
•
•
•
Write a Structure named BASE_STRUCT and another structure named DERIVED_STRUCT where DERIVED_STRUCT is a polymorphic object that inherits information from BASE_STRUCT"
struct Base_Struct
{
int a;
int b;
string c;
Base_Struct()
{
new Derieved_Struct s;
s.a=a;
s.b=b;
s.c=s;
};
}•
•
•
•
Multiple Choice: What is the value of the pointer after this syntax--
int array[] = {10, 20, -10, -20, 5}, *p = array;
p = &p[2];
array[1] = 5;
p++;
A) 10
B) 20
C) -10
D) -20
E) 5
-------------------
Multiple Choice: What is the difference between--
// information about pointers int x[] = {1, 2}, y[] = {3, 4}, *p = x, *q = y;
*p++ = *q++;
p++ = q++;
A) The first line increments the values and copies the values from q to p whereas the second line increments the addresses and assigns the address of q to p
B) The first line copies the values from q to p then increments the address whereas the second line assigns the address of q to p and then increments the address pointed by both pointers.
C) The first line increments the addresses and copies the values from q to p whereas the second line increments the addresses and assigns the address of q to p
D) The first line assigns the value of q to p then increments the values of q and p whereas the second line assigns the address of q to p then increments the address pointed by both pointers.
E) There is no difference
•
•
•
•
Hey Interesting Questions above. But i was wondering how do i do that polymorphic structs for this question,
Should we actually write a constructor For Base_struct and then write some code like this.
struct Base_Struct { int a; int b; string c; Base_Struct() { new Derieved_Struct s; s.a=a; s.b=b; s.c=s; }; }
struct BASE
{
};
struct DERIVED : public BASE
{
};Here DERIVED inherits the data of BASE (in a sense, it IS-A BASE) so you can do something like...
DERIVED der;
BASE *bPtr = &der;
which is perfectly legal because it makes sense. DERIVED has data of BASE and BASE is publically accessible.
In order to fulfill polymorphism, BASE must contain at least one virtual function to make BASE (and then therefore make DERIVED which contains data of BASE) be polymorphic.
Answer to question:
struct BASE
{
public:
virtual ~BASE(){};
};
struct DERIVED : public BASE
{
};![]() |
Other Threads in the IT Professionals' Lounge Forum
- Previous Thread: iPhone 3G is finally official
- Next Thread: newbie
| Thread Tools | Search this Thread |
1gbit advertising advice amazon answers archive broadband business businessprocesses career censorship cern china cio collectiveintelligence connectivity consumer corporateearnings css datatransfer debtcollectors dictionary digg digital ebay ecommerce email employment environment facebook food government grid high-definition hottub infodelivery infotech intel internet interview ipod isp japan kindle lhc library malware marketing mit moonfruit news php piracy piratebay pope porn program questions r&d religion remoteworking research retail schools security sex shopping simple skype smallbusiness smb sms socialmedia socialnetworking software softwareengineer spam speed spending startrek statistics stocks study stumbleupon survey tabletpc technology touch-screen touchscreen training twitter uk vbulletin videoinprint voips web webdesign webdeveloper windows words






