Complete Computer Science Notes for 9th Class Urdu Medium

Computer Notes for Class 9: Urdu Medium 

Are you student of class 9 and looking for quality study notes, then you are at the right place because we have prepared computer notes for class 9 for urdu medium students. 

In these study notes, we have only selected questions that are already part of previous examinations of boards of intermediate and secondary education. You can also ask for soft copy of these notes through email, we shall send you a soft copy in PDF format. Now let us briefly know the features of these study notes as follows:- 

Easy to Understand 

Computer notes for class 9 are easy to understand because the language used in these notes is easy to understand and follow as compared to other notes on the internet. You will learn comfortably. 

Precise and to the point 

These computer notes for class 9 are precise and no unconcerned information is part of these notes. You just have to focus on the topic under study but keep in mind not to skip any line further while preparing for the exam. 

Medium of study 

All the students who are studying in urdu medium will find these computer notes for class 9 helpful because the medium followed in this material is urdu. English medium students can ask for help if needed through email. 

I will highly suggest the students of urdu medium to follow these notes since we have achieved amazing results even for such students whose intellect power was below average. So computer notes for 9 will address students of all level and all schools who have problem in study the subject of computer science. Having study these notes, a student will need no helping material or guidance from anyone. Make sure to read carefully and write the prepared questions at your own to know your progress. 

Computer Science Notes for 9th Class urdu medium

page 1

page 2

page 3

page 4

page 5

page 6

page 7

page 8

page 9

page 10

page 11

Short Questions and Answers Chapter 2 9th Class Urdu Medium

Short Questions and Answers Chapter 2 9th Class Urdu Medium

Short Questions and Answers Chapter 1 Part-II 9th Class Urdu Medium

Short Questions and Answers Chapter 1 Part-II 9th Class Urdu Medium

Short Questions and Answers Chapter 1 Part-I 9th Class Urdu Medium

Short Questions and Answers Chapter 1 Part-I  9th Class Urdu Medium

How to make Windows 7 Bootable USB

How to make Windows 7 Bootable USB

Some times we are unable to install windows 7 from CD-ROM because our computer does not have any CD ROM drive or in some situations our CD ROM is out of order and we need to install windows 7 urgently. Then there comes an idea of installing the windows 7 from USB.
Is it easy enough to copy files of windows 7 CD into a USB and install on the concerned PC. No! this is not as easy as it looks. For this purpose you will need these things in hand.

1-USB
2-Soft copy of Windows 7 stored somewhere in disk.
3-Some knowledge about DOS commands for this purpose.

We know that you can get first two things easily but so far as 3rd one is concerned, it seems difficult. We will tell you how to perform this remaining step.

Alert! The data on your USB will be lost in this process, so first of all save it on somewhere.

First of all click on start button on your PC desktop.
A menu will open, Select Run and click OK

In the Run Command Box type cmd and press Enter key.

Now you are in DOS mode or Comman Prompt.

Type this command on DOS prompt and press Enter key.

diskpart

Type this command on DOS prompt and press Enter key. This command will show the disks with serial no. locate the USB disk no. e.g. disk1

list disk

Then type this command and press Enter key

clean

Then type this command and press Enter key

create partition primary

Type this command and press Enter key

select partition1

Type the command and press Enter key

active

Type this command and press Enter key

format fs=NTFS

Type this command and press Enter key

assign

Now at last type this command and press enter key

exit

Now the USB drive has been prepared , next task is to make it booable.

1.    Suppose that your windows 7 installation is on the D: drive

2.    Again goto DOS prompt and type

3.    Cd d:\boot

4.    If your USB drive letter is e: then  type this command

5.    Bootsect/nt60 e:

6.    Now type exit to leave DOS prompt and come in windows destop

7.    By mouse, goto windows 7 folder and copy everything from there and paste into your USB drive directly.

Now we come to the PC to install windows 7 on it.

Insert USB into USB drive and restart your PC

As soon as your PC starts keep on pressing F12 key

Select USB option by pressing down arrow key from keyboard and press enter

Now your PC starts booting from USB drive with Windows 7 setup as usual.

Old Paper Virtual University CS-702 Advanced Algorithms Mid Term 2015

    Old Paper Virtual University CS-702 Advanced Algorithms Mid Term 2015

1.   Consider the problem of a chain < A1, A2, A3> of three matrices. Suppose the dimensions of the matrices are 10×100, 100×5 and 5×50. For the sequence of matrices, given above, compute the order of the product, A₁.A₂.A₃, in such a way that minimizes the total number of scalar multiplications.

2.    Write the pseudo code of n-line assembly: dynamic programming algorithm for print stations.

3.    Show that the sum of cubes of any three consecutive positive integers is divisible by 9.

That is, for any integer n, n³ + (n + 1)³ + (n + 2)³ is divisible by 9.

The sum of the cubes of 1, 2, 3 is 1+8+27=36 which is divisible by 9.

Now suppose that for some k: C(k)=k^3+(k+1)^3+(k+2)^3 is divisible by 9.

Then:

C(k+1)=C(k) - k^3 + (k+3)^3 = C(k) + 3 (k^2*3) + 3 (k*3^2) + 3^3

..............=C(k) + 9 [k^2 + 3k + 3]

hence as by assumption C(k) is divisible by 9 so is C(k+1), and as we have
established that C(1) is divisible by 9, we have established by mathematical
induction that C(n) is divisible by 9 for all positive integers n.

This proves (as it is the same thing in different words) that the sum of the
cubes of three consecutive positive integers is divisible by 9.

Verify S(1): .1³ + 2³ + 3³ .= .36 . . . divisible by 9.


Assume S(k): .k³ + (k+1)³ + (k+2)³ .= .9a . for some integer a.


Add (k+3)³ - k³ to both sides:

. . k³ + (k+1)³ + (k+2)³ + (k+3)³ - k³ .= . 9a + (k+3)³ - k³

. . (k+1)³ + (k+2)³ + (k+3)³ .= .9a + k³ - 9k² + 27k - 27 - k³

. . (k+1)³ + (k+2)³ + (k+3)³ .= .9a - 9k² + 27k - 27

. . (k+1)³ + (k+2)³ + (k+3)³ .= .9(a - k² + 3k - 3)


The left side is the left side of S(k+1); the right side is a multiple of 9.
. . The inductive proof is complete.

4.   Solve the recurrence relation given below

 

5.    We have to compute the set of maximal points from following points, using Brute Force Approach,

(2, 8), (6, 16), (8, 8), (10, 20), (12, 6), (16, 14), (18, 18), (20, 2), (24, 8)

6.    Write the pseudo code of assembly line scheduling algorithm using dynamic programming.

7.    Write the pseudo code of complete knapsack dynamic programming algorithm for 0-1 knapsack problem.