Dear students,
You are clever.
Be positive and be inspired.
Prepare all modules for arrear subject. (evethough Open Choice QP)
Prepare easy topics from all modules first.
Better start revision or practive in reverse order i.e. Module 5 , Module 4 , Module 3, Module 2 and Module 1
Attemept that question first in exam whichever you know perfect.
Write the practiced programs as example for answered question.
Always write more examples.
For example, if you have practiced some programs like bubble sort, if you are not getting the practied program question in exam, then write this practiced program as example for Array or For loop or if condition...i.e. highlight the part of that program as example for the answered question. Then possibility of getting more marks from valuators.
All valuators are good and they are interested in giving marks to you.so, if you write more examples with quality points and neatly , defninetly, you get good marks.
So, make the valuator happy by good handwriting with quality points and more examples.
Whatever the topics you preprare for exams, use that knowledge to write as a part of any of the question from QP wherever it matches.
For every answers:
There must be EXPLANATION
There must be SYNTAX if any (Draw box around syntax)
If necessary draw FLOWCHART
Write PROGRAMMING EXAMPLES for all answered questions.
Prepare the following programs and use as examples for few of the questions from question paper.
simple inetrest
area and circumefrence of circle
area and perimeter of rectangle
area of triangle by reading breadth and height
area of triangle by reading 3 sides of it.
eligible for VOTE or NOT
largest of 2 nos
largest of 3 nos
largest of N nos
Palindrome or NOT
Factorial of N
Programming example for switch
Buuble sort
Linear search
Binary search
Read and Display N students information using array of structure
Example for Dynamic Memory Allocation
Using Pointers, swap two values.
Practice all the above programs...use these examples for some topics while answering questions in examination.
No comments:
Post a Comment