(
SERVLET ERROR\nnotes on binary/hex/logic circuits
\nproblem 3\n or run it3\n
\nHere is a link to last years final exam: cs2a03 final exam.\n
\n\n\nCMOS for storing a bit in memory. Also CMOS design for reading/storing\na bit from a given address in memory.\n
\n\n\nLogic gates and implementing xor, halfadders, and adders in CMOS.\n
\n\n\nCMOS transistors and implementation of the NOT, AND, OR, and XOR gates\nin CMOS\n
\n\n\nThe final exam for this course will be on Wed 12/15/04 from 1:30-4:30 in \nthe same room the class has been using all year. This information is on\nthe syllabus and has been all semester. It should\nalso appear on the next Final Exam Schedule that is distributed...\n
\n\n\n\nToday we looked into the mechanisms underlying programs that use the network\nto communicate with other programs (e.g. chat programs, IM, network games)\nand we wrote a simple chat applet \n(run it or\nview it )\nusing the GroupClient package\nand three procedures:\n
\n ; create a connection\n (define G (make-group-client \"tim\" \"timhw5test\" \"popper.cs-i.brandeis.edu\" 14973))\n \n ; send a message to everyone in the group\n (G 'send 'key \"hi\" \"This is cool\" (readstring name-tf))\n\n ; take actions based on messages sent to the group\n (G 'add-listener KEY (lambda(key data1 data2 ... datan) ACTIONS....))\n\n\n\n\n
\nToday we continue discussing \nassembly language and machine performance and we then\nreview practice quiz 9, and give quiz 9.\n
\n\nPractice quiz 9 is now available here or on the quizzes page and an answer sheet is also available.\n
\n\nToday we assigned hw5 and went over\nquiz 8.\n
\n\nToday we cover PC performances parameters: \nmemory (gigabytes), processor speend (gigaherz, MIPS), and \nbandwidth (megabits per second).\n
\n\n\nToday we discussed the\narchitecture of the PC.\n
\n\n\n\nToday we continued our discussion of the substitution model and gave \nQuiz 8.\n
\n\nThe notes from today's lecture have been added to the\npage on the Theory of Computing\n\n
\n\n\nThe answer to Practice Quiz 8 is now available here\n
\n\nNotes from this weeks lectures on the\nTheory of Computing \nare now available. \n
\n\nAlso a practice quiz is available for Quiz 8 tomorrow.\n
\n\nToday we look more deeply into the Substution model and consider a few interesting algorithms.\n
\n\nAlso, we discussed the Halting Problem and its unsolvability by computers.\n
\n\n\n\nThere will be a quiz on Thursday covering the Substition Model.\nThe quiz will consist of a few questions which ask you \nto trace through the evolution of some Scheme processes using the\nsubstition model.\n
\n\nToday we discussed a strategy for completing hw4 which was to\n
\nTo help you with your tables, I've written a servlet,\ndbview.servlet, \nwhich will allow you to see all of the tables stored in the database. This will help you\nsee whether your dbcreate,dbdrop,dbinsert servlets are working...\n\n
\n\nAlso, we pushed back the deadline for HW4 until next Monday 11/15/2004\n
\n\nToday we discuss the Substitution Model of Scheme and showed how to evolve processes\nthat are defined in terms of themselves.\n
\n\n\n\nThe TAs will be available online using the GrewpEdit application. Just click on the (JavaWebStart)\nlink above and it will start the application. Enter your name and press \"Connect to our group\"\nand you will be connected to a GrewpServer. The GrewpServer shows who is connected to the server\nand lets you chat with everyone. You can also create a new document (or whiteboard) that \nseveral people can edit at the same time (e.g. you and a TA can go over your hw2.servlet code together).\n
\nI'll go over this tool in class, but feel free to give it a try. If you have any problems please\nsend me email and I'll look into it!\n
\nnotes on binary/hex/logic circuits
\nproblem 3\n or run it3\n
\nHere is a link to last years final exam: cs2a03 final exam.\n
\n\n\nCMOS for storing a bit in memory. Also CMOS design for reading/storing\na bit from a given address in memory.\n
\n\n\nLogic gates and implementing xor, halfadders, and adders in CMOS.\n
\n\n\nCMOS transistors and implementation of the NOT, AND, OR, and XOR gates\nin CMOS\n
\n\n\nThe final exam for this course will be on Wed 12/15/04 from 1:30-4:30 in \nthe same room the class has been using all year. This information is on\nthe syllabus and has been all semester. It should\nalso appear on the next Final Exam Schedule that is distributed...\n
\n\n\n\nToday we looked into the mechanisms underlying programs that use the network\nto communicate with other programs (e.g. chat programs, IM, network games)\nand we wrote a simple chat applet \n(run it or\nview it )\nusing the GroupClient package\nand three procedures:\n
\n ; create a connection\n (define G (make-group-client \"tim\" \"timhw5test\" \"popper.cs-i.brandeis.edu\" 14973))\n \n ; send a message to everyone in the group\n (G 'send 'key \"hi\" \"This is cool\" (readstring name-tf))\n\n ; take actions based on messages sent to the group\n (G 'add-listener KEY (lambda(key data1 data2 ... datan) ACTIONS....))\n\n\n\n\n
\nToday we continue discussing \nassembly language and machine performance and we then\nreview practice quiz 9, and give quiz 9.\n
\n\nPractice quiz 9 is now available here or on the quizzes page and an answer sheet is also available.\n
\n\nToday we assigned hw5 and went over\nquiz 8.\n
\n\nToday we cover PC performances parameters: \nmemory (gigabytes), processor speend (gigaherz, MIPS), and \nbandwidth (megabits per second).\n
\n\n\nToday we discussed the\narchitecture of the PC.\n
\n\n\n\nToday we continued our discussion of the substitution model and gave \nQuiz 8.\n
\n\nThe notes from today's lecture have been added to the\npage on the Theory of Computing\n\n
\n\n\nThe answer to Practice Quiz 8 is now available here\n
\n\nNotes from this weeks lectures on the\nTheory of Computing \nare now available. \n
\n\nAlso a practice quiz is available for Quiz 8 tomorrow.\n
\n\nToday we look more deeply into the Substution model and consider a few interesting algorithms.\n
\n\nAlso, we discussed the Halting Problem and its unsolvability by computers.\n
\n\n\n\nThere will be a quiz on Thursday covering the Substition Model.\nThe quiz will consist of a few questions which ask you \nto trace through the evolution of some Scheme processes using the\nsubstition model.\n
\n\nToday we discussed a strategy for completing hw4 which was to\n
\nTo help you with your tables, I've written a servlet,\ndbview.servlet, \nwhich will allow you to see all of the tables stored in the database. This will help you\nsee whether your dbcreate,dbdrop,dbinsert servlets are working...\n\n
\n\nAlso, we pushed back the deadline for HW4 until next Monday 11/15/2004\n
\n\nToday we discuss the Substitution Model of Scheme and showed how to evolve processes\nthat are defined in terms of themselves.\n
\n\n\n\nThe TAs will be available online using the GrewpEdit application. Just click on the (JavaWebStart)\nlink above and it will start the application. Enter your name and press \"Connect to our group\"\nand you will be connected to a GrewpServer. The GrewpServer shows who is connected to the server\nand lets you chat with everyone. You can also create a new document (or whiteboard) that \nseveral people can edit at the same time (e.g. you and a TA can go over your hw2.servlet code together).\n
\nI'll go over this tool in class, but feel free to give it a try. If you have any problems please\nsend me email and I'll look into it!\n
\nnotes on binary/hex/logic circuits
\nproblem 3\n or run it3\n
\nHere is a link to last years final exam: cs2a03 final exam.\n
\n\n\nCMOS for storing a bit in memory. Also CMOS design for reading/storing\na bit from a given address in memory.\n
\n\n\nLogic gates and implementing xor, halfadders, and adders in CMOS.\n
\n\n\nCMOS transistors and implementation of the NOT, AND, OR, and XOR gates\nin CMOS\n
\n\n\nThe final exam for this course will be on Wed 12/15/04 from 1:30-4:30 in \nthe same room the class has been using all year. This information is on\nthe syllabus and has been all semester. It should\nalso appear on the next Final Exam Schedule that is distributed...\n
\n\n\n\nToday we looked into the mechanisms underlying programs that use the network\nto communicate with other programs (e.g. chat programs, IM, network games)\nand we wrote a simple chat applet \n(run it or\nview it )\nusing the GroupClient package\nand three procedures:\n
\n ; create a connection\n (define G (make-group-client \"tim\" \"timhw5test\" \"popper.cs-i.brandeis.edu\" 14973))\n \n ; send a message to everyone in the group\n (G 'send 'key \"hi\" \"This is cool\" (readstring name-tf))\n\n ; take actions based on messages sent to the group\n (G 'add-listener KEY (lambda(key data1 data2 ... datan) ACTIONS....))\n\n\n\n\n
\nToday we continue discussing \nassembly language and machine performance and we then\nreview practice quiz 9, and give quiz 9.\n
\n\nPractice quiz 9 is now available here or on the quizzes page and an answer sheet is also available.\n
\n\nToday we assigned hw5 and went over\nquiz 8.\n
\n\nToday we cover PC performances parameters: \nmemory (gigabytes), processor speend (gigaherz, MIPS), and \nbandwidth (megabits per second).\n
\n\n\nToday we discussed the\narchitecture of the PC.\n
\n\n\n\nToday we continued our discussion of the substitution model and gave \nQuiz 8.\n
\n\nThe notes from today's lecture have been added to the\npage on the Theory of Computing\n\n
\n\n\nThe answer to Practice Quiz 8 is now available here\n
\n\nNotes from this weeks lectures on the\nTheory of Computing \nare now available. \n
\n\nAlso a practice quiz is available for Quiz 8 tomorrow.\n
\n\nToday we look more deeply into the Substution model and consider a few interesting algorithms.\n
\n\nAlso, we discussed the Halting Problem and its unsolvability by computers.\n
\n\n\n\nThere will be a quiz on Thursday covering the Substition Model.\nThe quiz will consist of a few questions which ask you \nto trace through the evolution of some Scheme processes using the\nsubstition model.\n
\n\nToday we discussed a strategy for completing hw4 which was to\n
\nTo help you with your tables, I've written a servlet,\ndbview.servlet, \nwhich will allow you to see all of the tables stored in the database. This will help you\nsee whether your dbcreate,dbdrop,dbinsert servlets are working...\n\n
\n\nAlso, we pushed back the deadline for HW4 until next Monday 11/15/2004\n
\n\nToday we discuss the Substitution Model of Scheme and showed how to evolve processes\nthat are defined in terms of themselves.\n
\n\n\n\nThe TAs will be available online using the GrewpEdit application. Just click on the (JavaWebStart)\nlink above and it will start the application. Enter your name and press \"Connect to our group\"\nand you will be connected to a GrewpServer. The GrewpServer shows who is connected to the server\nand lets you chat with everyone. You can also create a new document (or whiteboard) that \nseveral people can edit at the same time (e.g. you and a TA can go over your hw2.servlet code together).\n
\nI'll go over this tool in class, but feel free to give it a try. If you have any problems please\nsend me email and I'll look into it!\n