Return to BSD News archive
Xref: sserve comp.os.os2.programmer:13291 comp.os.linux:52570 comp.os.mach:3156 comp.os.minix:22543 comp.periphs:4086 comp.unix.bsd:12389 comp.unix.pc-clone.32bit:4026 comp.os.386bsd.development:1028
Path: sserve!newshost.anu.edu.au!munnari.oz.au!news.Hawaii.Edu!ames!agate!howland.reston.ans.net!wupost!news.miami.edu!usenet.ufl.edu!suntan.eng.usf.edu!eggo!duren
From: duren@eggo.usf.edu (Michael J Duren)
Newsgroups: comp.os.os2.programmer,comp.os.linux,comp.os.mach,comp.os.minix,comp.periphs,comp.unix.bsd,comp.unix.pc-clone.32bit,comp.os.386bsd.development
Subject: Programming Contest: Contest Clarification
Date: 11 Aug 1993 12:47:06 GMT
Organization: University of South Florida, Department of Computer Science and Engineering
Lines: 20
Message-ID: <24apoa$n8c@suntan.eng.usf.edu>
References: <jmonroyCBKrE9.76n@netcom.com> <1993Aug11.111931.1065@ica.philips.nl>
NNTP-Posting-Host: eggo.csee.usf.edu
Keywords: DMA FDC timing problem QIC-40/80
Contest Clarification: The intent of providing a broad scope "Data
Communications Algorithms" was to open the contest up to a wide range
of programmers working in diverse segments of data communications.
However, to assist in further definition here are some "possibilites":
Terminal Emulation Programs Async Drivers
Sync Drivers LAP-B, LAP-M Implementations
HDLC, SDLC, Bisync ...Implementations CRC algorithms
Data Encryption algorithms Data Compression algorithms
Data Communications Monitors Modem and Port Diagnostic
Finite State Machines Auto Dialers
Caveat: These examples are only provided as a guide. Any algorithm that
can be effectively applied to data communications will be accepted
and considered seriously. So we encourage you to be as creative
and inventive as you wish.
Good Luck!