Computer Science, asked by Pathanjuned88371, 10 months ago

In what way the computer practical is taken isc

Answers

Answered by joybiswas1000000
0

Answer:

IT IS YOUR ANSWER

Explanation:

This article consists of few of the basic things which you need to take into consideration while preparing for your ISC Computer Science Practicals.

To begin with I would like to inform you all that you don’t need to practice Inheritance or Recursion programs as you won’t get programs in your practical examination related to these concepts.

You may use the concept of recursion in solving practical programs, but it will be upto you to do so. There won’t be specifically mentioned that you have to do so.

The paper will consist of 3 questions out of which you have to do any one. You will be allotted 3 hours in all which will be divided into:

Planning session (where you write the programs in the answer sheet) – Maximum 90 minutes

Writing session (where you write and run the program on the computer) – Maximum 90 minutes

1) How to prepare:

Just after you finish reading this advice, switch on your computer and start typing in the programs you know. Try and run every program you know and see what are the common errors which you encounter. Try and be perfect with regards to those errors.

The more you practice programs on the computer, the better you will do in your practical examination. So don’t be lazy. There is no other alternative.

2) Types of programs to practice:

(Given in order of the importance to be given while practicing, Examples are just to make you understand the type of question)

2-D array programs

Examples:

Magic Matrix

Spiral (Circular) Matrix

Matrix Multiplication

Mirror Image

Finding maximum and minimum element

Sorting

Searching

Filling a 2-D array with any give type of numbers. (Example: Fill a n*n matrix with n*n Fibonacci numbers)

Operations on Diagonals of a 2-D array

Operations on Border elements of a 2-D array

Operations on every row or column (Example: Swapping rows or columns or finding maximum and minimum of every row)

String programs which involve the use of String Tokenizer or split() concepts

Examples: Input a sentence and

convert each of its word into piglatin

find the reverse of every word

replace any given word with another

frequency of every word

find words which are palindrome

find words which begin and end with vowels

encode or decode words in circular fashion

sorting the words alphabetically

Similar questions