fakecineaste

Saturday, April 7, 2012

Deadlock prevention

›
Deadlock prevention Removing the mutual exclusion condition means that no process will have exclusive(not shared) access to a resource Algor...

Ostrich algorithm

›
Solutions to deadlock There are several ways to address the problem of deadlock in an operating system. Just ignore it and hope it doesn...

Necessary conditions for deadlock

›
Conditions for Deadlock Mutual exclusion: resources cannot be shared. Hold and wait: processes request resources incrementally, and ...

The Bounded-Buffer semaphores

›
The Bounded-Buffer semaphores We assume that the pool consists of $ n$ buffers, each capable of holding one item. The mutex semaphore provid...
Friday, April 6, 2012

The consumer producer problem (also known as the bounded-buffer problem)

›
The consumer producer problem (also known as the bounded-buffer problem) The consumer producer problem (also known as the bounded-buffer pro...

Semaphore (programming)

›
In computer science, a semaphore is a variable or abstract data type that provides a simple but useful abstraction for controlling access by...

Inter-process communication(IPC)

›
Inter-process communication In computing, Inter-process communication (IPC) is a set of methods for the exchange of data among multiple thre...

Semaphore vs. mutex

›
Semaphore vs. mutex A mutex is essentially the same thing as a binary semaphore the term "mutex" is used to describe a construct w...

Principles of Operating System - Lecture 6

›
producer-consumer problem producer process consumer process buffer(shared) synchronization between producer and consumer processes race cond...

Producer Consumer Problem code examples

›
Producer consumer in Java 2 http://www.java2s.com/Code/Java/Threads/ProducerconsumerinJava2.htm Implementation of the Producer/Cons...

Banker’s Algorithm code examples

›
Program for Banker’s Algorithm http://labprograms.wordpress.com/2009/07/31/program-for-bankers-algorithm/

course pages

›
Operating Systems Course Notes Main Page http://www.cs.uic.edu/~jbell/CourseNotes/OperatingSystems/index.html CS 140: Operating System...
Thursday, April 5, 2012

banker's algorithm explained

›
The Banker's algorithm is a resource allocation and deadlock avoidance algorithm developed by Edsger Dijkstra that tests for safety by s...

high-level architecture (HLA)

›
A high-level architecture (HLA) is a general purpose architecture for distributed computer simulation systems Using HLA, computer simulatio...
Friday, March 30, 2012

stateful vs stateless EJB

›
Stateless Session Beans (SLSB) are not tied to one client and there is no guarantee for one client to get the same instance with each met...

Explain RMI Architecture?

›
Explain RMI Architecture? Application Layer: The client and server program Stub & Skeleton Layer: Intercepts method calls made b...

marshalling vs serialization

›
Marshaling Marshaling is process of encoding object to put them on the wire (network) Unmarshaling is the process of decoding from the...

CPU Scheduling Algorithms

›
Operating Systems (CS/CPE 408) : CPU Scheduling Non-Preemptive Vs Preemptive Scheduling Non-Preemptive: Non-preemptive algo...

Operator Precedence And Associativity

›
Operator Precedence And Associativity http://www.youtube.com/watch?v=n_eDAzzgzkA Two characteristics of operators determine how the...

Lexical Analysis

›
Lexical Analysis http://www.youtube.com/watch?v=B-nkdR4H530 http://www.youtube.com/watch?v=_1o9z4XIyx4 Lexical analysis In co...

How does Dijkstra's shortest path algorithm work?

›
http://www.youtube.com/watch?v=UG7VmPWkJmA&feature=related http://www.youtube.com/watch?v=psg2-6-CEXg&feature=related

How does Huffman Code work?

›
How does Huffman Code work? http://www.youtube.com/watch?v=0PahtaFK640 Huffman coding In computer science and information theo...

Infix to Prefix Notation Conversion

›
http://www.youtube.com/watch?v=fUxnb5eTRS0 http://www.youtube.com/watch?v=qmGS2M6uV8g

Explain EJB , EJB Types and RMI

›
EJB 3 Introduction http://www.youtube.com/watch?v=W-Tq93LUdMM&feature=results_video&playnext=1&list=PLCAD48825EA5D4B49 st...

difference between call-by-value and call-by-reference

›
Call by Reference vs. Call by Value http://www.youtube.com/watch?v=loDpVao0Jik&feature=related Java Parameter passing: call by ref...

How does RMI work in java?

›
Java RMI http://www.youtube.com/watch?v=qyqqisPV5Qs&feature=related Part 1 of 3: Simple Java RMI Tutorial http://www.youtube.com/watch?v...
Thursday, March 29, 2012

what does JVM do?

›
Learn about JVM internals - what does the JVM do? http://www.youtube.com/watch?v=UwB0OSmkOtQ Java Programming Tutorial 2: Java Virt...
1 comment:

How are stack and heap organized?

›
Stack & Heap : Java Programming 16 http://www.youtube.com/watch?v=VQ4eZw6eVtQ&feature=related Lecture 14 | Programming Methodology (...

how does garbage collector work? what algorithm does it use?

›
CS 61B Lecture 38: Garbage Collection http://www.youtube.com/watch?v=rp8PvFvSO_c Java Programming - Garbage Collection - Video 15 ...
Tuesday, March 27, 2012

network quiz exam solutions

›
Jackson State University Department of Computer Science CSC 435 Computer Networks Spring 2012 http://www.jsums.edu/cms/tues/html/CSC435-Sp...

Newton's method

›
In numerical analysis, Newton's method (also known as the Newton–Raphson method), named after Isaac Newton and Joseph Raphson, is a meth...

binary search

›
Binary Search Binary search relies on a divide and conquer strategy to find a value within an already-sorted collection http://algorithms...

merge sort

›
Algorithms Lesson 3: Merge Sort http://www.youtube.com/watch?v=GCae1WNvnZM merge sort with game cards http://www.youtube.com/wat...
Saturday, March 24, 2012

Yerellik Düzeyi (Locality)

›
Görev isletiminin, belirli bir adres bölgesinde ne kadar süreyle kaldığı, görevin yerellik düzeyi (locality) ile açıklanır

what's trashing?

›
İsletim sisteminin eksik sayfa uyarılarının gerektirdiği islemlerle yoğun bir biçimde uğrasmaya baslamasına,trashing denir. A process that i...

what's working set?

›
Working Set (WS), bir görevin, belirli bir zaman aralığı içinde, eksik sayfa uyarısı üretmeden çalısabileceği en küçük sayfa takımıdır.

what's belady anomaly?

›
The Belady's anomaly accurs in case of the FIFO page replacement policy in the OS. When this FIFO is used and the number of page frames ...

sinav sorulari-3

›
http://w3.gazi.edu.tr/web/akcayol/files/JavaOrnekVize.pdf

sinav sorulari-2

›
http://w3.gazi.edu.tr/web/akcayol/files/JavaOrnekVize.pdf

sinav sorulari-1

›
Örnek 1.2.1 : 1'den 100'e kadar olan sayıların toplamını veren algoritma. 1. Toplam T, sayılar da i diye çağırılsın. 2. Başlangıçta ...

Is memory leak possible in Java?

›
In any programming language, application-level memory management problems revolve around the deallocation of memory. These problems fall in...
1 comment:

Is http stateful or stateless?

›
HTTP as a protocol is stateless. In general, though, a stateless protocol can be made to act as if it were stateful, assuming you've got...
Friday, March 23, 2012

most used tcp ports

›
http 80 smtp 25 ftp 21 pop3 110 https 443

What Is a MAC Address?

›
A Media Access Control address (MAC address) is a unique identifier assigned to network interfaces for communications on the physical networ...

What is a subnet mask?

›
What is a subnet mask? A subnet mask is used to divide an IP address into two parts. One part identifies the host (computer), the other...
1 comment:
‹
›
Home
View web version
Powered by Blogger.