NOTICE for updating our site

-

NOTICE !

We are in starting phase so we are trying to update our content..so please keep touch with us and try to follow us to get better experience... 😀😀😀


Location: Nepal
I am a BCA student and I try to share my thought through my site. I provide you many study materials and supported files which make your study better. We provide support just keep follow us.. Thank You !

Comments

Post a Comment

Popular Posts

Lab Report of Operating System BCA 4th semester

-
Image
  1     Introduction of Process scheduling Process scheduling is a fundamental concept in operating systems that deals with the efficient and orderly execution of multiple processes running concurrently on a computer system. In a multitasking operating system, such as Windows, macOS, or Linux, there are typically many processes competing for the CPU's (Central Processing Unit) attention. The process scheduler is responsible for determining which process should run next and allocating CPU time to each process in a fair and efficient manner. The primary goals of process scheduling are: Fairness: Ensure that each process gets a fair share of the CPU time, preventing any single process from monopolizing the CPU and starving others. Efficiency: Maximize CPU utilization and throughput by keeping the CPU busy with productive tasks as much as possible. Responsiveness: Prioritize interactive processes, like user interface applications, to ...
Read more

Binary Arithmetic Operation (Digital Logic Notes)

-
Image
In mathematics, the four basic arithmetic operation applied on numbers are addition, subtraction, multiplication and division. In computers the same operation are performed inside the central processing unit by the arithmetic and logic unit (ALU). However, the arithmetic and logic unit cannot perform binary subtractions directly. It performs binary subtraction using a process known as complementation. For multiplication and division, the arithmetic and logic unit uses a method called shifting before adding the bits. Binary Addition The five possible addition in binary are:  1. 0 + 0 = 0 2. 0 + 1 = 1 3. 1 + 0 = 1 4. 1 + 1 = 10 (read as sum 0, carry 1) 5. 1 + 1 = 11 (read as sum 1, carry 1) Example : Find the sum of 111+001 base 2. Solution : Arrange the bits vertically :  Working from the right to the left, we proceed as follows: +011 Step 1: 1 + 1 = 10 (write down 0 and carry 1) 1010 Step 2: 1 + 1 + 1 = 11 (add and carry over digit to 1 + 1 in order to get 1 + 1 + 1. From the ...
Read more

Contact Us

Name

Email *

Message *

Followers