Blogspot - lectnote.blogspot.com - Computer Science - eGuru
General Information:
Latest News:
The Cigarette Smokers Problem 11 Mar 2013 | 10:54 am
Multithreading - Multiprocessor operating systems The Cigarette Smokers Problem Consider a simulation with three smoker threads and one agent thread. Each smoker continuously makes a cigarette and smo...
Semaphores - Multiprocessor operating systems using Java 3 Mar 2013 | 06:21 pm
/*PROGRAM 1 – Semaphores - Multiprocessor operating systems Assume there are three processes: Pa, Pb, and Pc. Only Pa can output the letter A, Pb B, and Pc C. Utilizing only semaphores (and no other v...
TCP Client Server Implementation in C 25 Nov 2012 | 08:35 pm
TCPServer.c #include "sys/types.h" #include #include #include #include void main(){ int sfd,clisize,cfd,port; struct sockaddr_in server,client; char msg1[50]="",msg2[50]=""; sfd = socket(AF_INE...
Data Structures Notes 19 Nov 2012 | 02:25 pm
PREFACE CHAPTER 1: INTRODUCTION PART I: Mathematical Foundations CHAPTER 2: GROWTH OF FUNCTIONS CHAPTER 3: SUMMATIONS CHAPTER 4: RECURRENCES CHAPTER 5: SETS, ETC. CHAPTER 6: COUNTING AND PROBABILITY P...
Qick Sort Using Java 18 Nov 2012 | 10:26 am
/* Implementation of QUICK SORT ALGORITHM using JAVA Date: 18/11/2012 Author : Sarju S */ import java.util.*; import java.io.*; public class QuickSort{ public static void main(String[] a...
Tries 18 Nov 2012 | 10:20 am
Normal 0 false false false EN-IN X-NONE X-NONE The standard Trie for a set of strings S is an ordered tree such that: Each node but the root is labeled with a character The children of a nod...
LeftistHeap - Implementation in Java 25 Oct 2012 | 03:07 pm
Leftist (min)Heap Definition: A Leftist (min)Heap is a binary tree that satisfies the follow-ing conditions. If X is a node and L and R are its left and right children, then: X.value = null path le...
Deap -Implementation in Java 25 Oct 2012 | 02:47 pm
Deap A deap is a double-ended heap that supports the double-ended priority operations of insert, delet-min, and delete-max. Similar to min-max heap but deap is faster on these operations by a constant...
Graph Implementation in C Using Adjacency Matrix 21 Jul 2012 | 10:44 pm
Adjacency Matrices There are several different ways to represent a graph in a computer. Although graphs are usually shown diagrammatically, this is only possible when the number of vertices and ed...
Asymptotic Notation in Algorithms 24 Apr 2012 | 03:49 pm
Suppose we are considering two algorithms, A and B, for solving a given problem. Furthermore, let us say that we have done a careful analysis of the running times of each of the algorithms and determi...
