Knowledge in Computer Networks
Computer science mcq semester 3
all Computer science mcq semester 3 for be cse students
Aarish 1224
yash pal
Work, Energy and Power (NCERT Notes)
Work, Energy and Power. ... Energy can be defined as the capacity for doing work. The simplest case of mechanical work is when an object is standing still and we force it to move. The energy of a moving object is called kinetic energy
Rishi Soni
Computer Networks (Complete session)
A computer network is a set of computers connected together for the purpose of sharing resources. The most common resource shared today is connection to the Internet. Other shared resources can include a printer or a file server. The Internet itself can be considered a computer network.
Computer Networking
This file containing about networking, Components of Networking, types of Networks - wireless network, system interconnections, wireless LANs, Wireless WANs, Inter Network, Network Services, Connection Oriented Services, Connection less services, service premitives, Reference models in communication network, etc.
Avishkant Patidar
Computer Networking
This file containing all about Computer networking.
Chirag Jhaa
CPU design
Processor design is the design engineering task of creating a processor, a key component of computer hardware. It is a subfield of computer engineering (design, development and implementation) and electronics engineering (fabrication).
Abir Biswas
Introduction to IO
In computing, input/output or I/O (or, informally, io or IO) is the communication between an information processing system, such as a computer, and the outside world, possibly a human or another information processing system.
RISC (computer science)
A reduced instruction set computer, or RISC, is one whose instruction set architecture allows it to have fewer cycles per instruction than a complex instruction set computer.
Multi-Processor-Parallel Processing
parallel processing: running a process on more than one processor. Multiprocessing operating systems enable several programs to run concurrently. UNIX is one of the most widely used multiprocessing systems.Multiprocessing means the use of two or more Central Processing Units (CPU) at the same time.
Time and Space Analysis of Algorithms
Time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the length of the input. Similarly, Space complexity of an algorithm quantifies the amount of space or memory taken by an algorithm to run as a function of the length of the input. ... Let each operation takes time.
Queue-Refernced
A java.lang.ref.ReferenceQueue is a simple data structure onto which the garbage collector places reference objects when the reference field is cleared (set to null). You would use a reference queue to find out when an object becomes softly, weakly, or phantomly reachable so your program can take some action based on that knowledge. For example, a program might perform some post-finalization cleanup processing that requires an object to be unreachable (such as the deallocation of resources outside the Java heap) upon learning that an object has become phantomly reachable. To be placed on a reference queue, a reference object must be created with a reference queue. Soft and weak reference objects can be created with a reference queue or not, but phantom reference objects must be created with a reference queue: ReferenceQueue queue = new ReferenceQueue(); PhantomReference pr = new PhantomReference(object, queue); Another approach to the soft reference example from the diagram on the previous page could be to create the SoftReference objects with a reference queue, and poll the queue to find out when an image has been reclaimed (its reference field cleared). At that point, the program can remove the corresponding entry from the hash map, and thereby, allow the associated string to be garbage collected. ReferenceQueue q = new ReferenceQueue(); Reference r; while((r = q.poll()) != null) { //Remove r's entry from hash map }