Re: [techtalk] USB Support?
On Thu, Mar 22, 2001 at 10:34:04AM -0600 or thereabouts, Betsy wrote: > i think i remember that RH doesn't support USB... could be wrong tho. > anybody know for sure? It certainly supports -some-. I have a USB trackball on my laptop (I hate the mousepad thing there, I need three buttons :)) and it works beautifully. I know the Other One upstairs in the machine room has USB keyboards, mice, and I dread to think what working. Alas, the original question on a CD-RW drive sounds less hopeful from Shari's later post. But I had to comment that at least some works. Telsa ___ techtalk mailing list [EMAIL PROTECTED] http://www.linux.org.uk/mailman/listinfo/techtalk
Re: [techtalk] USB Support?
i know a lot of gimpers have usb wacoms running. something about a kernel fix to get usb working. sorry i dont know more. im not the vat of unlimited URLs that telsa is. ___ techtalk mailing list [EMAIL PROTECTED] http://www.linux.org.uk/mailman/listinfo/techtalk
[techtalk] This talk of N-ary trees and other things...
I have a question for the group. I imagine many of you are self taught, as I am. Although I've been programming on and off (on for about 8 years, then off for about 8, then on for the last 3), and have learned, in that time, BASIC, C, Pascal and Perl, plus SQL and HTML, and smatterings of Javascript and Java, I'm realizing that I have some rather large gaps in my computer science knowledge. I didn't study computer science in college, since where I went to college didn't have it - although I spent a lot of time in college programming. I have the added twist in that although I absolutely love coding, I don't think it's going to end up being how I spend most of my time - I'm lucky if I get to spend 1/3 of my time coding. I'd be ectstatic if I could spend 1/2-2/3 but I don't think that's realistic. In any event, I'm looking to fill in some of those gaps - like algorithms. I have worked with them some in learning the languages I've learned. But I don't understand them in my bones the way I feel like perhaps I should, and I think that that means I'm not as good a coder as I could be. There are other things like that - theory behind operating systems, data structures, etc. The advantage is that I am exclusively at this time a web app programmer, so most of what I've written is short, and pretty specific. But I'd really like to take my web apps to another level (I'm working on building a large web app to allow mere mortals to easily develop complex web database applications entirely by using a web interface.) Do folks have suggestions on how to go about learning some of this stuff- I've thought about just getting a list of CS textbooks, and going through them myself, one by one (I'm a very good book learner). I don't have time to go back to school, either virtually or otherwise. If you are self taught, and have managed to learn some of that stuff, how did you do it? Thanks. Michelle -- Michelle Murrain, Ph.D. President Norwottuck Technology Resources [EMAIL PROTECTED] http://www.norwottuck.com ___ techtalk mailing list [EMAIL PROTECTED] http://www.linux.org.uk/mailman/listinfo/techtalk
Re: [techtalk] This talk of N-ary trees and other things...
On Fri, Mar 23, 2001 at 08:32:08AM -0500, Michelle Murrain wrote: > I have a question for the group. > > I imagine many of you are self taught, as I am. Although I've been > programming on and off (on for about 8 years, then off for about 8, then on > for the last 3), and have learned, in that time, BASIC, C, Pascal and Perl, > plus SQL and HTML, and smatterings of Javascript and Java, I'm realizing that > I have some rather large gaps in my computer science knowledge. I didn't > study computer science in college, since where I went to college didn't have > it - although I spent a lot of time in college programming. > > I have the added twist in that although I absolutely love coding, I don't > think it's going to end up being how I spend most of my time - I'm lucky if I > get to spend 1/3 of my time coding. I'd be ectstatic if I could spend 1/2-2/3 > but I don't think that's realistic. > > In any event, I'm looking to fill in some of those gaps - like algorithms. I > have worked with them some in learning the languages I've learned. But I > don't understand them in my bones the way I feel like perhaps I should, and I > think that that means I'm not as good a coder as I could be. There are other > things like that - theory behind operating systems, data structures, etc. > > The advantage is that I am exclusively at this time a web app programmer, so > most of what I've written is short, and pretty specific. But I'd really like > to take my web apps to another level (I'm working on building a large web app > to allow mere mortals to easily develop complex web database applications > entirely by using a web interface.) > > Do folks have suggestions on how to go about learning some of this stuff- > I've thought about just getting a list of CS textbooks, and going through > them myself, one by one (I'm a very good book learner). I don't have time to > go back to school, either virtually or otherwise. > > If you are self taught, and have managed to learn some of that stuff, how did > you do it? Knuth is, of course, the canonical source for algorithms. If it's not in Knuth, it's probably not worth knowing. :-) If you're looking for a gentler introduction to algorithms than Knuth, you might try getting a cookbook type book on algorithms in your language of choice. It is much easier to learn algorithms with example code in a language you already know than it is to learn the pure theory. Do try for a book in the lowest level language with which you are familiar. Seeing some algorithms and data structures implemented in BASIC will be less than helpful. There is also a diminishing return as you go deeper into the theory. 20% of what you would study in an algorithms class will give you 80% of the real world benefit. In most situations, anyway. Kernel hackers would tell you otherwise! hth, -- Dr. David C. Merrill http://www.lupercalia.net Linux Documentation Project [EMAIL PROTECTED] Collection Editor & Coordinatorhttp://www.linuxdoc.org Finger me for my public key You have mail. ___ techtalk mailing list [EMAIL PROTECTED] http://www.linux.org.uk/mailman/listinfo/techtalk
[techtalk] Snort - Sensor and Analyst console HW config
Hello, I have posted the same question to Snort mailing list and did not get a satisfactory answer. I am planning to deploy a Snort IDS for a client of mine. The Internet connection is at 256K to their ISP. What kind of processor and memory would be recommended for a sensor with 4 NICs monitoring about 3 DMZs? There will be only one analysis system. What kind of processor and memory is required on this system? Hopefully someone here has configured HW for Snort in production. Thank you in advance for any input. -- Subba Rao [EMAIL PROTECTED] http://members.home.net/subba9/ ___ techtalk mailing list [EMAIL PROTECTED] http://www.linux.org.uk/mailman/listinfo/techtalk
[techtalk] SCSI and RedHat
Hi everyone.. quick question- I'm needing to put together information on my 'dream computer' for my new boss, and I know I want SCSI - the thing I don't know is what's going to work best for me. This box will need to run RedHat7, Windows 2000 and possibly solaris, any of the BSD's, and anything else we come up with. What are my best options, in anyone's opinions? I'm planning to use an Abit KT7A motherboard, and want to use a Plextor burner on this as well as a harddrive... Thanks! --Sarah ___ techtalk mailing list [EMAIL PROTECTED] http://www.linux.org.uk/mailman/listinfo/techtalk
RE: [techtalk] Snort - Sensor and Analyst console HW config
Snort by itself doesn't seem to use a lot of CPU. What eats up CPU on my Snort system is the snortsnarf tool that takes the log information and outputs it to HTML reports. A "reasonably fast" system like a Pentium II or higher should work just fine. It's not a memory hog either. If you are building this box put in 128MB since it's cheap right now and you should be fine. Jason -Original Message- From: Subba Rao [mailto:[EMAIL PROTECTED]] Sent: Friday, March 23, 2001 4:50 AM To: [EMAIL PROTECTED] Subject: [techtalk] Snort - Sensor and Analyst console HW config Hello, I have posted the same question to Snort mailing list and did not get a satisfactory answer. I am planning to deploy a Snort IDS for a client of mine. The Internet connection is at 256K to their ISP. What kind of processor and memory would be recommended for a sensor with 4 NICs monitoring about 3 DMZs? There will be only one analysis system. What kind of processor and memory is required on this system? Hopefully someone here has configured HW for Snort in production. Thank you in advance for any input. -- Subba Rao [EMAIL PROTECTED] http://members.home.net/subba9/ ___ techtalk mailing list [EMAIL PROTECTED] http://www.linux.org.uk/mailman/listinfo/techtalk ___ techtalk mailing list [EMAIL PROTECTED] http://www.linux.org.uk/mailman/listinfo/techtalk
[techtalk] [Fwd: ALERT - A DANGEROUS NEW WORM IS SPREADING ON THE INTERNET]
Hey all, if you are running BIND you might want to take a look at this. Nasty indeed. Melissa > -Original Message- > From: The SANS Institute [mailto:[EMAIL PROTECTED]] > Sent: Friday, March 23, 2001 1:35 PM > Subject: ALERT - A DANGEROUS NEW WORM IS SPREADING ON THE INTERNET > > -BEGIN PGP SIGNED MESSAGE- > Hash: SHA1 > > ALERT! A DANGEROUS NEW WORM IS SPREADING ON THE INTERNET > > March 23, 2001 7:00 AM > > Late last night, the SANS Institute (through its Global Incident > Analysis Center) uncovered a dangerous new worm that appears to be > spreading rapidly across the Internet. It scans the Internet looking > for Linux computers with a known vulnerability. It infects the > vulnerable machines, steals the password file (sending it to a > China.com site), installs other hacking tools, and forces the newly > infected machine to begin scanning the Internet looking for other > victims. > > Several experts from the security community worked through the night to > decompose the worm's code and engineer a utility to help you discover > if the Lion worm has affected your organization. > > Updates to this announcement will be posted at the SANS web site, > http://www.sans.org > > DESCRIPTION > > The Lion worm is similar to the Ramen worm. However, this worm is > significantly more dangerous and should be taken very seriously. It > infects Linux machines running the BIND DNS server. It is known to > infect bind version(s) 8.2, 8.2-P1, 8.2.1, 8.2.2-Px, and all > 8.2.3-betas. The specific vulnerability used by the worm to exploit > machines is the TSIG vulnerability that was reported on January 29, > 2001. > > The Lion worm spreads via an application called "randb". Randb scans > random class B networks probing TCP port 53. Once it hits a system, it > checks to see if it is vulnerable. If so, Lion exploits the system using > an exploit called "name". It then installs the t0rn rootkit. > > Once Lion has compromised a system, it: > > - - Sends the contents of /etc/passwd, /etc/shadow, as well as some > network settings to an address in the china.com domain. > - - Deletes /etc/hosts.deny, eliminating the host-based perimeter > protection afforded by tcp wrappers. > - - Installs backdoor root shells on ports 60008/tcp and 33567/tcp (via > inetd, see /etc/inetd.conf) > - - Installs a trojaned version of ssh that listens on 33568/tcp > - - Kills Syslogd , so the logging on the system can't be trusted > - - Installs a trojaned version of login > - - Looks for a hashed password in /etc/ttyhash > - - /usr/sbin/nscd (the optional Name Service Caching daemon) is > overwritten with a trojaned version of ssh. > > The t0rn rootkit replaces several binaries on the system in order to > stealth itself. Here are the binaries that it replaces: > > du, find, ifconfig, in.telnetd, in.fingerd, login, ls, mjy, netstat, > ps, pstree, top > > - - "Mjy" is a utility for cleaning out log entries, and is placed in > /bin > and /usr/man/man1/man1/lib/.lib/. > - - in.telnetd is also placed in these directories; its use is not known > at this time. > - - A setuid shell is placed in /usr/man/man1/man1/lib/.lib/.x > > DETECTION AND REMOVAL > > We have developed a utility called Lionfind that will detect the Lion > files on an infected system. Simply download it, uncompress it, and > run lionfind. This utility will list which of the suspect files is on > the system. > > At this time, Lionfind is not able to remove the virus from the system. > If and when an updated version becomes available (and we expect to > provide one), an announcement will be made at this site. > > Download Lionfind at http://www.sans.org/y2k/lionfind-0.1.tar.gz > > REFERENCES > > Further information can be found at: > > http://www.sans.org/current.htm > http://www.cert.org/advisories/CA-2001-02.html, CERT Advisory > CA-2001-02, > Multiple Vulnerabilities in BIND > http://www.kb.cert.org/vuls/id/196945 ISC BIND 8 contains buffer > overflow > in transaction signature (TSIG) handling code > http://www.sans.org/y2k/t0rn.htm Information about the t0rn rootkit. > The following vendor update pages may help you in fixing the original > BIND > vulnerability: > > Redhat Linux RHSA-2001:007-03 - Bind remote exploit > http://www.redhat.com/support/errata/RHSA-2001-007.html > Debian GNU/Linux DSA-026-1 BIND > http://www.debian.org/security/2001/dsa-026 > SuSE Linux SuSE-SA:2001:03 - Bind 8 remote root compromise. > http://www.suse.com/de/support/security/2001_003_bind8_ txt.txt > Caldera Linux CSSA-2001-008.0 Bind buffer overflow > http://www.caldera.com/support/security/advisories/CSSA-2001-008.0.txt > http://www.caldera.com/support/security/advisories/CSSA-2001-008.1.txt > > This security advisory was prepared by Matt Fearnow of the SANS > Institute and William Stearns of the Dartmouth Institute for Security > Technology Studies. > > The Lionfind utility was written by William Stearns. William is an > Open-Source developer, enthusiast
RE: [techtalk] SCSI and RedHat
Go find the list of supported SCSI adapters for each UNIX and match them up. :) Adaptec cards are good, and have good support so start there. Some like the 2940U2 should be supported under about every OS. The KT7A boards work just fine under Linux. I have the KT7 (100MHz bus instead of 133, same chipset though) in this workstation and run Debian on it all the time. Very good choice going with an Athlon...they are fast and Linux loves them. I use NVidia chipset vid cards and they work very well under Linux and Win2K, but I'm not sure about BSD support. ATI or Matrox may be a better choice. Jason -Original Message- From: [EMAIL PROTECTED] [mailto:[EMAIL PROTECTED]] Sent: Friday, March 23, 2001 5:08 PM To: [EMAIL PROTECTED] Subject: [techtalk] SCSI and RedHat Hi everyone.. quick question- I'm needing to put together information on my 'dream computer' for my new boss, and I know I want SCSI - the thing I don't know is what's going to work best for me. This box will need to run RedHat7, Windows 2000 and possibly solaris, any of the BSD's, and anything else we come up with. What are my best options, in anyone's opinions? I'm planning to use an Abit KT7A motherboard, and want to use a Plextor burner on this as well as a harddrive... Thanks! --Sarah ___ techtalk mailing list [EMAIL PROTECTED] http://www.linux.org.uk/mailman/listinfo/techtalk ___ techtalk mailing list [EMAIL PROTECTED] http://www.linux.org.uk/mailman/listinfo/techtalk
[techtalk] Small request
Could you guys ping www.kathweb.net and send a test email to [EMAIL PROTECTED] if you don't mind?Just testing my web/email server. - Kath
Re: [techtalk] [Fwd: ALERT - A DANGEROUS NEW WORM IS SPREADING ON THE INTERNET]
On Fri, Mar 23, 2001 at 04:34:37PM -0600, Melissa Plunkett wrote: > > The t0rn rootkit replaces several binaries on the system in order to > > stealth itself. Here are the binaries that it replaces: > > > > du, find, ifconfig, in.telnetd, in.fingerd, login, ls, mjy, netstat, > > ps, pstree, top For people who aren't familiar with rootkits, this means that these binaries won't show any suspisious processes or files running. The only box I've seen rootkited with t0rn had a very high port open running ssh though, so perhaps nmap could tell you something. If you suspect a box is rooted, get it off the net fast, get some fresh binaries of the afore mentioned programs and have a dig around. Then you'll probably want to reinstall, secure and change passwords. Incidently, if you have a box on a semi-permanent (cable) or permanent IP address, you should have learnt about securing a box - shutting down processes and closing ports. If none of those words are familiar to you, and neither are the words portmap, nfs, or BIND you very probably have a vulnerable box. Mary. -- Mary Gardiner <[EMAIL PROTECTED]> GPG Key ID: 77625870 ___ techtalk mailing list [EMAIL PROTECTED] http://www.linux.org.uk/mailman/listinfo/techtalk
Re: [techtalk] This talk of N-ary trees and other things...
Michelle Murrain wrote: > I have a question for the group. > > I imagine many of you are self taught, as I am. > Do folks have suggestions on how to go about learning some of this stuff- > I've thought about just getting a list of CS textbooks, and going through > them myself, one by one (I'm a very good book learner). I don't have time to > go back to school, either virtually or otherwise. I'm college-taught (or university - I'm not sure what our tertiary education system corresponds to). To an extent, you never learn /everything/. There's just too much to learn! However, I have noticed that formally-trained programmers who attended really good courses seem to know stuff that people who have just learned this-language and that-language don't seem to know. I'm not sure how to learn it, or how to teach it, though I am planning to try writing a set of articles on 'this stuff'. Oddly enough, I have some recommendations: * study calculus, especially propositional and predicate calculus. * study the theory of programming languages, get familiar with the language families, become familiar with the fact that you can write a pseudocode for a language family and then translate from that into any language in the family. * learn the architecture of computers. Learn how the CPU works. Learn at least one assembly language, though you don't need to write anything more difficult than a fibionacci sequence. This is to ensure that you KNOW how your program actually runs through the CPU, or can at least make a good guess. There's other stuff - you can't summarise a 3-year degree in a single email. But that's a start. Jenn V. -- "Do you ever wonder if there's a whole section of geek culture you miss out on by being a geek?" - Dancer. [EMAIL PROTECTED] Jenn Vesperman http://www.simegen.com/~jenn/ ___ techtalk mailing list [EMAIL PROTECTED] http://www.linux.org.uk/mailman/listinfo/techtalk
Re: [techtalk] USB Support?
On 0, Shari <[EMAIL PROTECTED]> wrote: > I'm about to begin an installation of Redhat 7.0 on my Dell Laptop (Inspiron 3700). > I've attempted this before, unsuccessfully with RH 6.0. Had display problems and > couldn't get my dsl working. But I digress. > > I've been away from Linux for awhile, and I wouldn't call myself an OS/HW guru by > any means. My question is what is the hw support like for USB? I have a USB CD-RW > drive, that I can't seem to get running in Win2k. I haven't seen my model on > RedHat's HCL site. > > Is this an ill-fated exercise? Is anyone doing this? > I don't know what kernel you have, but the 2.2.18 does have kernel support in it. You will have to compile a new kernel, enabling the USB support. If you have a Linux expert near you, ask him/her to help you with the kernel compile. Linux is never an ill-fated excercise!! Win2K is!!! I had similar experience with existing HW and Win2k incompatibility. Good luck with Linux USB. -- Subba Rao [EMAIL PROTECTED] http://members.home.net/subba9/ ___ techtalk mailing list [EMAIL PROTECTED] http://www.linux.org.uk/mailman/listinfo/techtalk
Re: [techtalk] This talk of N-ary trees and other things...
On Sat, 24 Mar 2001 [EMAIL PROTECTED] wrote: > > Oddly enough, I have some recommendations: > > * study calculus, especially propositional and predicate calculus. > * study the theory of programming languages, get familiar > with the language families, become familiar with the fact that you > can write a pseudocode for a language family and then translate from > that into any language in the family. > * learn the architecture of computers. Learn how the CPU > works. Learn at least one assembly language, though you don't need > to write anything more difficult than a fibionacci sequence. This is > to ensure that you KNOW how your program actually runs through the CPU, > or can at least make a good guess. > Thanks, Jenn! This is helpful. Like Michelle, I'm self-taught. She's right. It leaves some holes in one's knowledge. Some folks at work laugh because at times I know how to do something that is very complex and involved, and other times I discover that I am completely ignorant of something everyone is assumed to know. One time someone told me to study Logic...but not just any logic, some specific type of logic. I can no longer remember what it's called. Maybe you know. I can see how it would help me to cover all my bases when writing programs. It involves mapping out truth tables for problems like: --- Knights and Knaves problem. Suppose you visit a strange island with three types of people. Knights, who always tell the truth, Knaves, who always lie and Normals who sometimes lie and sometimes tell the truth. It is also the custom that normals marry only normals, and knights marry only knaves. You meet two couples, Mr. and Mrs. Smith and Mr. and Mrs. Brown. They tell you the following: Mr. Brown: Mr. Smith is a knight. Mrs. Brown: My husband is right, Mr. Smith is a knight. Mrs. Smith: That?s true, my husband is indeed a knight. Can you determine which type each person must be? Explain. --- ___ techtalk mailing list [EMAIL PROTECTED] http://www.linux.org.uk/mailman/listinfo/techtalk
Re: [techtalk] This talk of N-ary trees and other things...
On Fri, Mar 23, 2001 at 04:54:47PM -0800, Nancy Corbett wrote: > > --- > Knights and Knaves problem. > > Suppose you visit a strange island with three types of people. Knights, > who always tell the truth, Knaves, who always lie and Normals who > sometimes lie and sometimes tell the truth. It is also the custom that > normals marry only normals, and knights marry only knaves. > You meet two couples, Mr. and Mrs. Smith and Mr. and Mrs. Brown. They tell > you the following: > > Mr. Brown: Mr. Smith is a knight. > Mrs. Brown: My husband is right, Mr. Smith is a knight. > Mrs. Smith: That?s true, my husband is indeed a knight. > > Can you determine which type each person must be? Explain. > --- Hm. Mr. and Mrs. Brown are normals. A knight and a knave would not agree. If Mrs. Smith were a knave, her husband would be a knight and she would not call him so. And if she were a knight, she would not call her knave husband a knight! So are they *all* normals? -- Dr. David C. Merrill http://www.lupercalia.net Linux Documentation Project [EMAIL PROTECTED] Collection Editor & Coordinatorhttp://www.linuxdoc.org Finger me for my public key fortune: cpu time/usefulness ratio too high -- core dumped. ___ techtalk mailing list [EMAIL PROTECTED] http://www.linux.org.uk/mailman/listinfo/techtalk
[techtalk] Oddness
Can anyone still ping www.kathweb.net ?I can't ping www.kathweb.net from the machine itself. Odd. I can ping it from my workstation and from an offsite place (http://visualroute.datametrics.com). Any ideas?I run my own DNS server, here is the current config file: @ IN SOA www.kathweb.net. root.ns5.kathweb.net. ( 212801 ; Serial 28800 ; Refresh 14400 ; Retry 360 ; Expire 86400 ) ; Minimum IN NS ns5.kathweb.net. IN NS ns2.kathweb.net. IN MX 10 ns5.kathweb.net. ;; host addresses;localhost IN A 127.0.0.1ns5 IN A 24.186.89.17ns2 IN A 207.127.75.180kathweb.net. IN A 24.186.89.17router IN A 192.168.0.1dhcp IN A 192.168.0.2;; canonical aliases;mail IN CNAME ns5irc IN CNAME ns5www IN CNAME ns5kathweb.net IN CNAME ns5phpmyadmin IN CNAME ns5myphpshop IN CNAME ns5dsh IN CNAME ns5secure IN CNAME ns5cybercen IN CNAME ns5sdpta IN CNAME ns5voxpop IN CNAME ns5token IN CNAME ns5reprahzent IN CNAME ns5leech IN CNAME ns5 - Kath, the slightly confused
Re: [techtalk] This talk of N-ary trees and other things...
On Fri, Mar 23, 2001 at 08:43:24PM -0500, David Merrill wrote: > On Fri, Mar 23, 2001 at 04:54:47PM -0800, Nancy Corbett wrote: > > > > --- > > Knights and Knaves problem. > > > > Suppose you visit a strange island with three types of people. Knights, > > who always tell the truth, Knaves, who always lie and Normals who > > sometimes lie and sometimes tell the truth. It is also the custom that > > normals marry only normals, and knights marry only knaves. > > You meet two couples, Mr. and Mrs. Smith and Mr. and Mrs. Brown. They tell > > you the following: > > > > Mr. Brown: Mr. Smith is a knight. > > Mrs. Brown: My husband is right, Mr. Smith is a knight. > > Mrs. Smith: That?s true, my husband is indeed a knight. > > > > Can you determine which type each person must be? Explain. > > --- > > Hm. > > Mr. and Mrs. Brown are normals. A knight and a knave would not agree. > If Mrs. Smith were a knave, her husband would be a knight and she > would not call him so. And if she were a knight, she would not call > her knave husband a knight! So are they *all* normals? No. You never said knaves marry only knights, only that knights marry only knaves. So they could be either all normals, or else Mr. and Mrs. Smith are both knaves. Two possible solutions, unless I'm still missing something. Wouldn't be the first time. -- Dr. David C. Merrill http://www.lupercalia.net Linux Documentation Project [EMAIL PROTECTED] Collection Editor & Coordinatorhttp://www.linuxdoc.org Finger me for my public key To err is human -- to blame it on a computer is even more so. ___ techtalk mailing list [EMAIL PROTECTED] http://www.linux.org.uk/mailman/listinfo/techtalk
[techtalk] Re: techtalk digest, Vol 1 #375 - 14 msgs
The one book I can truly recommend to anyone interested in learning about it, is Understanding the Linux Kernel,published by O'Reilly and Associates. ISBN 0-596-2-2 according to the back of the book. If it Windows you want to look at, check for some of the older (now out of date) MCSE books. Since they're out of date a little, they're usually 2 bucks a piece or so, and they still have enough current information to help you understand things. Especially the Windows NT4 books. Hope this helps you > I have a question for the group. > > I imagine many of you are self taught, as I am. Although I've been > programming on and off (on for about 8 years, then off for about 8, then on > for the last 3), and have learned, in that time, BASIC, C, Pascal and Perl, > plus SQL and HTML, and smatterings of Javascript and Java, I'm realizing that > I have some rather large gaps in my computer science knowledge. I didn't > study computer science in college, since where I went to college didn't have > it - although I spent a lot of time in college programming. > > I have the added twist in that although I absolutely love coding, I don't > think it's going to end up being how I spend most of my time - I'm lucky if I > get to spend 1/3 of my time coding. I'd be ectstatic if I could spend 1/2-2/3 > but I don't think that's realistic. > > In any event, I'm looking to fill in some of those gaps - like algorithms. I > have worked with them some in learning the languages I've learned. But I > don't understand them in my bones the way I feel like perhaps I should, and I > think that that means I'm not as good a coder as I could be. There are other > things like that - theory behind operating systems, data structures, etc. > > The advantage is that I am exclusively at this time a web app programmer, so > most of what I've written is short, and pretty specific. But I'd really like > to take my web apps to another level (I'm working on building a large web app > to allow mere mortals to easily develop complex web database applications > entirely by using a web interface.) > > Do folks have suggestions on how to go about learning some of this stuff- > I've thought about just getting a list of CS textbooks, and going through > them myself, one by one (I'm a very good book learner). I don't have time to > go back to school, either virtually or otherwise. > > If you are self taught, and have managed to learn some of that stuff, how did > you do it? > > Thanks. > > Michelle ___ techtalk mailing list [EMAIL PROTECTED] http://www.linux.org.uk/mailman/listinfo/techtalk
Re: [techtalk] This talk of N-ary trees and other things...
On Fri, 23 Mar 2001, David Merrill wrote: > On Fri, Mar 23, 2001 at 04:54:47PM -0800, Nancy Corbett wrote: > > > > --- > > Knights and Knaves problem. > > > > Suppose you visit a strange island with three types of people. Knights, > > who always tell the truth, Knaves, who always lie and Normals who > > sometimes lie and sometimes tell the truth. It is also the custom that > > normals marry only normals, and knights marry only knaves. > > You meet two couples, Mr. and Mrs. Smith and Mr. and Mrs. Brown. They tell > > you the following: > > > > Mr. Brown: Mr. Smith is a knight. > > Mrs. Brown: My husband is right, Mr. Smith is a knight. > > Mrs. Smith: That?s true, my husband is indeed a knight. > > > > Can you determine which type each person must be? Explain. > > --- > > Hm. > > Mr. and Mrs. Brown are normals. A knight and a knave would not agree. > If Mrs. Smith were a knave, her husband would be a knight and she > would not call him so. And if she were a knight, she would not call > her knave husband a knight! So are they *all* normals? > That's what I came up with--all normals, and all lying, too. I love these things. :) psyche ___ techtalk mailing list [EMAIL PROTECTED] http://www.linux.org.uk/mailman/listinfo/techtalk
Re: [techtalk] Oddness
On Fri, 23 Mar 2001 20:55:46 EST, Kath writes: >Can anyone still ping www.kathweb.net ? no prob at all, here's the output: PING ns5.kathweb.net (24.186.89.17): 56 data bytes 64 bytes from 24.186.89.17: icmp_seq=0 ttl=234 time=162.5 ms 64 bytes from 24.186.89.17: icmp_seq=1 ttl=234 time=162.6 ms 64 bytes from 24.186.89.17: icmp_seq=2 ttl=234 time=162.9 ms 64 bytes from 24.186.89.17: icmp_seq=3 ttl=234 time=161.0 ms 64 bytes from 24.186.89.17: icmp_seq=4 ttl=234 time=163.1 ms 64 bytes from 24.186.89.17: icmp_seq=5 ttl=234 time=163.6 ms 64 bytes from 24.186.89.17: icmp_seq=6 ttl=234 time=163.0 ms --- ns5.kathweb.net ping statistics --- 7 packets transmitted, 7 packets received, 0% packet loss round-trip min/avg/max = 161.0/162.6/163.6 ms cheers, Gina -- # Gina Lanik - [EMAIL PROTECTED] # That's what I like about this place...no LART is so good that it can't # be improved upon. -- Jeff McAdams on a.s.r. -- ___ techtalk mailing list [EMAIL PROTECTED] http://www.linux.org.uk/mailman/listinfo/techtalk
Re: [techtalk] Oddness
My sysadmin friend, DraX, was able to fix it. Something with my DNS being b0rked. - Kath P.S. Hi Gina! - Original Message - From: "Gina Lanik" <[EMAIL PROTECTED]> To: "Kath" <[EMAIL PROTECTED]> Cc: <[EMAIL PROTECTED]> Sent: Friday, March 23, 2001 9:11 PM Subject: Re: [techtalk] Oddness > On Fri, 23 Mar 2001 20:55:46 EST, Kath writes: > >Can anyone still ping www.kathweb.net ? > > no prob at all, here's the output: > > PING ns5.kathweb.net (24.186.89.17): 56 data bytes > 64 bytes from 24.186.89.17: icmp_seq=0 ttl=234 time=162.5 ms > 64 bytes from 24.186.89.17: icmp_seq=1 ttl=234 time=162.6 ms > 64 bytes from 24.186.89.17: icmp_seq=2 ttl=234 time=162.9 ms > 64 bytes from 24.186.89.17: icmp_seq=3 ttl=234 time=161.0 ms > 64 bytes from 24.186.89.17: icmp_seq=4 ttl=234 time=163.1 ms > 64 bytes from 24.186.89.17: icmp_seq=5 ttl=234 time=163.6 ms > 64 bytes from 24.186.89.17: icmp_seq=6 ttl=234 time=163.0 ms > > --- ns5.kathweb.net ping statistics --- > 7 packets transmitted, 7 packets received, 0% packet loss > round-trip min/avg/max = 161.0/162.6/163.6 ms > > cheers, > > Gina > > -- > # Gina Lanik - [EMAIL PROTECTED] > # That's what I like about this place...no LART is so good that it can't > # be improved upon. -- Jeff McAdams on a.s.r. > -- > > > ___ techtalk mailing list [EMAIL PROTECTED] http://www.linux.org.uk/mailman/listinfo/techtalk
Re: [techtalk] This talk of N-ary trees and other things...
On Fri, Mar 23, 2001 at 05:07:47PM -0900, psyche wrote: > > > > Mr. and Mrs. Brown are normals. A knight and a knave would not agree. > > If Mrs. Smith were a knave, her husband would be a knight and she > > would not call him so. And if she were a knight, she would not call > > her knave husband a knight! So are they *all* normals? > > > > That's what I came up with--all normals, and all lying, too. I love these > things. :) If they're all normals, who knows who's lying? -- Dr. David C. Merrill http://www.lupercalia.net Linux Documentation Project [EMAIL PROTECTED] Collection Editor & Coordinatorhttp://www.linuxdoc.org Finger me for my public key The first time, it's a KLUDGE! The second, a trick. Later, it's a well-established technique! -- Mike Broido, Intermetrics ___ techtalk mailing list [EMAIL PROTECTED] http://www.linux.org.uk/mailman/listinfo/techtalk
Re: [techtalk] Oddness
On Fri, Mar 23, 2001 at 09:19:36PM -0500, Kath wrote: > My sysadmin friend, DraX, was able to fix it. Something with my DNS being > b0rked. It's so nice to have sysadmin friends. It's like having a doctor in the family. -- Dr. David C. Merrill http://www.lupercalia.net Linux Documentation Project [EMAIL PROTECTED] Collection Editor & Coordinatorhttp://www.linuxdoc.org Finger me for my public key Due to lack of disk space, this fortune database has been discontinued. ___ techtalk mailing list [EMAIL PROTECTED] http://www.linux.org.uk/mailman/listinfo/techtalk
[techtalk] Boolean logic (was: This talk of N-ary trees and other things...)
Nancy Corbett wrote: > One time someone told me to study Logic...but not just any logic, some > specific type of logic. I can no longer remember what it's called. Maybe > you know. I can see how it would help me to cover all my bases when > writing programs. It involves mapping out truth tables for problems like: Boolean logic. You *CANNOT* write anything that involves an 'if' or a 'while' or any other logic evaluation test without it. Here's the basic operators for boolean logic: AND (Is the following statement true? : It is raining AND the roof is wet) Raining RoofStatement-as-a-whole TT T TF F FT F FF F OR It is raining OR the roof is wet Raining RoofStatement-as-a-whole TT T TF T FT T FF F IF-THEN (also called implies, not often used in programming) IF it is raining THEN the roof is wet Raining RoofStatement-as-a-whole TTT TFF FTT(or at least, you can't prove it to be false) FFT(ditto) XOR (exclusive or - one or the other but not both) It is raining XOR the roof is wet Raining RoofStatement-as-a-whole TTF TFT FTT FFF NOT It is NOT raining Raining Statement-as-a-whole T F F T To solve a problem, you reduce each factoid to a true/false statement, such as 'Mr Smith is a knight'. So... IF Smith-knight THEN Smith-tells-truth. IF Smith-tells-truth THEN Mrs-Smith-tells-lies IF Mrs-Smith-tells-lies THEN Mr-Smith-is-not-a-knight . and so on. Until you hit false statements, or self-contradictions like that one. This particular puzzle can also be solved by either propositional or predicate calculus, which are also on my recommended learn-list. :) Jenn V. -- "Do you ever wonder if there's a whole section of geek culture you miss out on by being a geek?" - Dancer. [EMAIL PROTECTED] Jenn Vesperman http://www.simegen.com/~jenn/ ___ techtalk mailing list [EMAIL PROTECTED] http://www.linux.org.uk/mailman/listinfo/techtalk
Re: [techtalk] This talk of N-ary trees and other things...
David Merrill wrote: > Hm. > > Mr. and Mrs. Brown are normals. A knight and a knave would not agree. > If Mrs. Smith were a knave, her husband would be a knight and she > would not call him so. And if she were a knight, she would not call > her knave husband a knight! So are they *all* normals? That's how I worked that set - that's the answer I came up with. Of course, I didn't overtly use the fancy logical skills I have, though I did use this as an example of one way to use boolean logic in my last post. Jenn V. -- "Do you ever wonder if there's a whole section of geek culture you miss out on by being a geek?" - Dancer. [EMAIL PROTECTED] Jenn Vesperman http://www.simegen.com/~jenn/ ___ techtalk mailing list [EMAIL PROTECTED] http://www.linux.org.uk/mailman/listinfo/techtalk
