41. Department Of Computer Science Course Description choices such as pipelining, memory hierarchy, input/output is conducted under thesupervision of a computer. science and/or Electrical and Electronic Engineering http://www.cs.ust.hk/course_description.html

Course Description for the department of Computer Science UG Courses PG Courses UG Course: COMP 001 Academic and Professional Development I [0 credit] A compulsory one-year course for Computer Science students. This course is designed to provide academic advising to students and to develop their communication skills in interacting with technical and non-technical audiences. Graded P or F. COMP 002 Academic and Professional Development II [0 credit] Continuation of COMP 001. A compulsory, one year course for Computer Science students. Graded P or F. COMP 003 Academic and Professional Development III [0 credit] Continuation of COMP 002. A compulsory, one year course for Computer Science students. Graded P or F. COMP 099 Industrial Training [0 credit] For Computer Science students only. A practical training course for a period of four to five weeks. Topics may include basic computer architecture and maintenance, UNIX system and network administration, Windows server implementation and administration, and safety. Graded P or F.

42. Computer Science 180 - Computer Organization computer science 180. Inner workings of modern digital computer systems and tradeoffsat output systems, interrupts and exceptions, pipelining, performance and http://www.cs.ust.hk/~cktang/cs180/

Computer Science 180 Computer Organization Lecture Session 3, Spring 2001 3:00-3:50, MWF, LTC [http://www.cs.ust.hk/~cktang/cs180] General Outline Schedule ... Grade IMPORTANT NOTE: Old final exam No lab in the last week. Final exam is comprehensive - Everything up to and including I/O. Please check your score, and let us know if there is any error. Quiz 4 solution is in Library. Lonely quiz [1-3], midterm please note that the envelop is so heavy that it dropped. I'll put it back when I find adhesive tapes that are strong enough! Problem set #5 . For the upcoming quiz, please work out problems on chapter 5 only. Get your grade sheet of assign 1 8086 student helper info Quiz 3 grade is available. Key to quiz 3 will be in Library. There is a typo in the key. The answer to the "LOOP" question should be false. Programming assignment #2 General information Instructor Chi Keung Tang Office : Room 3561 Phone : 2358-8775 (x8775) Email : cktang@cs.ust.hk Office hours: Mon, Wed, Fri, 3:50-4:20pm. Teaching Assistants Tutorial/Laboratory TAs Dickson Tong David Tang Jerry Yau Office hours ... cstws@cs.ust.hk

43. COMPUTER SCIENCE TECHNICAL REPORT ABSTRACTS CS98-127 computer science Department School of computer science, Carnegie Mellon listranking, dictionaries, balanced trees, treaps, pipelining, set operations http://reports-archive.adm.cs.cmu.edu/anon/1998/abstracts/98-127.html

CMU-CS-98-127 Computer Science Department School of Computer Science, Carnegie Mellon University CMU-CS-98-127 Experiments with Parallel Pointer-Based Algorithms Margaret Reid-Miller May 1998 Ph.D. Thesis Unavailable Electronically Keywords: PRAM, algorithms, list ranking, dictionaries, balanced trees, treaps, pipelining, set operations, pointer-based implementation The algorithms as implemented, however, do not have optimal depth (parallel time). This dissertation shows how to reduce the depth of the tree algorithms to make them optimal by using pipelining. Pipelining has been used previously, but the method used here allows for asynchronous execution and for pipeline delays that are data dependent and dynamic. Rather than making the coding more difficult, the method lets the user write the algorithms using futures (a parallel language construct) and leaves the management of the pipelining to an efficient runtime system. To determine the runtime of algorithms, I first analyze the algorithms in a language-based cost model in terms of work and depth of the computations, and then show universal bounds for implementing the language on various machines. 100 pages Return to: SCS Technical Report Collection School of Computer Science homepage This page maintained by reports@cs.cmu.edu

44. CAS Course Descriptions - Computer Science being conducted in the computer science department the hardware structure of computersystems and processor architecture, parallelism and pipelining, cache and http://www.pitt.edu/~caswww/cdesc/ds023031/cs.htm

Computer Science (CS) Courses Offered for 023/031 : Number Title Credits Undergraduate Course Offerings: Intro Computer Progrmmng-Basic 3 cr. Intro Computer Progrmmng-Pascal 3 cr. Computers and Networks 3 cr. Software for Personal Computing 3 cr. 3 cr. Intermedt Programming Using Java 4 cr. Discrete Structures for Cs 3 cr. Data Structures 3 cr. 3 cr. Algorithm Implementation 3 cr. Formal Methods in Computer Sci 3 cr. 3 cr. Intro to Theory of Computation 3 cr. Progrmmng Lang for Web Applctns 3 cr. Intro to Computer Architecture 3 cr. Intro to Operating Systems 3 cr. Database Management Systems 3 cr. Introduction Computer Graphics 3 cr. Intro to Artificial Intelligence 3 cr. Socl Implicatn Computng Technlgy 3 cr. Structure Programming Languages 3 cr. 3 cr. Internship 1 to 6 cr. Directed Study 1 to 3 cr. Graduate Course Offerings: Ms Thesis Research 1 to 6 cr. Research Topics/Computer Science 3 cr. Compiler Design 3 cr. Computer Architecture 3 cr. Wide Area Networks 3 cr. Principles of Database Systems 3 cr. Foundtns of Artificial Intellgnc 3 cr. Intro to Natural Language Proc 3 cr. Graduate Internship 1 cr.

45. CSE Computer Science And Engineering Courses processor performance and design; datapath, control (hardwired, microprogrammed),pipelining, input/output CSE 355 Introduction to Theoretical computer science. http://www.asu.edu/aad/catalogs/courses/cse.html

46. Computer Science Courses as masterslave, client-server, tast-farming, divide-and-conquer and pipelining. C490- Seminar in computer science (1-3 cr.) Syllabus not available C490 - PC http://www.cs.iusb.edu/course_descriptions.html

Computer Science Courses Indiana University South Bend Department of Computer and Information Sciences 1700 Mishawaka Avenue, P.O. Box 7111 South Bend, IN 46634-7111 Tel: (574) 237-6521, Fax: (574) 237-6589 Undergraduate Courses Graduate Courses A106 - Introduction to Computing (Was A200) A107 Programming Within Applications A150 Introduction to Operating Systems A201 - Introduction to Programming I (UNDER CONSTRUCTION) A247 Network Technologies and Administration (UNDER CONSTRUCTION) A340 Introduction to Web Programming A200 - See A106 C101 - Computer Programming I C151 Multiuser Operating Systems C201 - Computer Programming II C203 - COBOL and File Processing ... C442 - Database Systems (Was C446) C445 - See C441 C446 - See C442 C455 - Analysis of Algorithms C463 - Artificial Intelligence B481 - Interactive Computer Graphics C490 - Seminar in Computer Science ... C490 - PC Techniques M.S. in Management of Information Technology: A505 - Object Oriented Programming K506 - Web Site Development Techniques (BUSB) A510 - Database Systems A515 - Telecommunications and Computer Networks M.S. in Applied Mathematics and Computer Science: A504 Introductory C++ Programming (2 cr.)

47. Stephen Williams: Virginia Tech Computer Science Text I come to the Virginia Tech computer science Department with a Bachelor's Degreein Aerospace computer Architecture (pipelining and parallel http://csgrad.cs.vt.edu/~williams/body.html

School and Research My Resume Research Interests My computer science related interests include: Network protocols. Network performance analysis and enhancement. Scientific visualization. Picture processing. Compression (especially video). Virtual reality. My reseach area is currently in network performance analyis and will probably never include automated video characterization. Publications "Multimedia Traffic Analysis Using CHITRA95" (ACM:Multimedia-95 Conference) November 1995 "Caching Proxies: Limitations and Potentials" (WWW-4 Boston Conference) December 1995 "Complementing Surveying and Demographics with Automated Network Monitoring" (World Wide Web Journal), Summer 1996 v.1 no.3. "Removal Policies in Network Caches for World-Wide Web Documents " (ACM:Sigcomm96 Conference)August 1996 ... "HTTPDUMP Network HTTP Packet Snooper " (internal paper only) April 1996 General Info I come to the Virginia Tech Computer Science Department with a Bachelor's Degree in Aerospace Engineering. I have also taken numerous Undergrad CS classes including: Operating Systems Graphics Assemblers and Data Structures Graduate Classes include: Models and Analysis (Discrete Mathematics) Models of Computation (Logic) Research Methods (Experimentation and Paper Writing) (CS-5014) Operating Systems (with emphasis on distributed systems) (CS-5204) Interactive Accessibility Seminar (the "find a thesis" class) (CS-6604) Computer Architecture (pipelining and parallel processing) (CS-5515) Computer Architecture (Networks)

48. Take Computer Science Courses Classes - Columbia University I. 3 points Course Fee $5 Prerequisites computer science W3139 or W3131 Implementationsof basic computer under various clocking assumptions. pipelining. http://www.ce.columbia.edu/summer/compsci.cfm

49. Courses, Computer Science Columbia University Continuing computer science W4824x or y. computer Architecture. equivalent) Introduction to moderncomputer architecture analysis, basics of pipelining, advanced pipelining http://www.ce.columbia.edu/smp/courses/year/compsci.cfm

50. UCR: Computer Science Parallel and Distributed Processing. (4) S. Prerequisite(s) computer science 161or equivalent. Parallel programming languages. pipelining and supercomputing. http://www.students.ucr.edu/9697catalog/cs.html

1996-97 University of California, Riverside General Catalog This page was last updated Thursday, August 15, 1996. COMPUTER SCIENCE Faculty Department Undergraduate Curricula Graduate Curricula ... Graduate Courses Thomas H. Payne, Ph.D., Chair Department Office, A242 Bourns Hall Professors: Mart L. Molle, Ph.D. Teodor C. Przymusinski, Ph.D. Professor Emeritus: Lawrence L. Larmore, Ph.D. Associate Professors: Marek Chrobak, Ph.D. Yang-Chang Hong, Ph.D. Yu-Chin Hsu, Ph.D. Thomas H. Payne, Ph.D. Assistant Professors: Brett D. Fleisch, Ph.D. Gary S. Tyson, Ph.D. Frank N. Vahid, Ph.D. Adjunct Associate Professor: Halina Przymusinska, Ph.D. MAJOR The Computer Science Department offers a B.S. degree in Computer Science and an M.S. and a Ph.D. degree in Computer Science. These programs provide the basis for careers in research and development in the computer science field as well as technical and nontechnical related fields that are dependent on a working knowledge of computers. The Computer Science major has been designed to provide the student with a broad background in science and humanities and to provide an understanding of fundamental principles of computing and modern computing technology. It prepares the student for professional work with computer systems as well as for graduate work in computer science. Each Computer Science major is assigned a Departmental Advisor who assists the student in formulating educational goals and who monitors the student's subsequent progress in an academic program. Each quarter a study list must be approved by this advisor and filed by the student in the Department office.

51. 98-99 Computer Science And Engineering tradeoffs, instruction set design and measurements of use, processor implementationtechniques, pipelining, pipeline hazards Seminar in computer science. (14). http://www.students.ucr.edu/catalog/1998-99/cs.html

1998-99 Catalog main page Calendar Degrees ... Subject Abbreviations 1998-99 General Catalog University of California, Riverside Faculty Program Undergraduate Curricula Graduate Curricula ... Graduate Courses COMPUTER SCIENCE AND ENGINEERING Subject abbreviation: CS Thomas H. Payne, Ph.D., Chair Department Office, A159 Bourns Hall Professors: Marek Chrobak, Ph.D. Yu-Chin Hsu, Ph.D. Mart L. Molle, Ph.D. Teodor C. Przymusinski, Ph.D. Professor Emeritus: Lawrence L. Larmore, Ph.D. Associate Professors: Brett D. Fleisch, Ph.D. Yang-Chang Hong, Ph.D. Thomas H. Payne, Ph.D. Vassilis Tsotras, Ph.D. Assistant Professors: Frank N. Vahid, Ph.D. Scott R. Tilley, Ph.D. Adjunct Associate Professor: Halina Przymusinska, Ph.D. MAJOR The Department of Computer Science and Engineering offers a B.S. degree in Computer Science and an M.S. and a Ph.D. degree in Computer Science. These programs provide the basis for careers in research and development in the computer science field as well as technical and nontechnical related fields that are dependent on a working knowledge of computers. The Computer Science major has been designed to provide the student with a broad background in science and humanities and to provide an understanding of fundamental principles of computing and modern computing technology. It prepares the student for professional work with computer systems as well as for graduate work in computer science.

52. Western Washington University - Computer Science Department design arithmetic logic unit, datapath, control alternatives, pipelining; memoryorganizations Prereq 30 credits in computer science, including CS 344; GPA at http://www.cs.wwu.edu/Programs/CourseDescriptions/

Contacts Programs Facilities Advising ... Programs Course Descriptions B.S. Major B.S. Minor Combined Majors Combined Minor ... Graduate Courses BACHELOR OF SCIENCE 96 credits plus 6-8 credits of science beyond the GUR science requirement. CS Math 124, 125, 204, 226, 341 Math/CS 375 12 credits chosen from CS 400, , Math/CS 335, 435, 475, 476, of which a maximum of 4 credits may be from CS 400 or projects. A supporting sequence chosen from: Biol 204, 205, 206; Chem 121, 122, 123; Geol 211, 212, and one of Geol 310, 314, 318, 352; or Physics 121/131, 122/132, 123/133 Two additional courses of a supporting nature, each chosen by one of the two methods: (1) a course in the same discipline as the supporting sequence chosen above, but of a higher level; or (2) a course from a different discipline than the supporting sequence chosen above, but restricted to the list above. top 38-39 credits CS Math 124 or 157 Two upper division computer science courses top COMBINED MAJORS The Department of Computer Science cooperates with other departments in offering combined majors for students wishing to acquire some familiarity and experience in both areas. Accounting/Computer Science: See Accounting department section of the General Catalog. Mathematics/Computer Science: See Mathematics department section of the General Catalog. MINOR Management 24-26 credits CS MIS 314 Comm 318 Either Eng 302, 402 or Journ 207, 309

53. Home Of Nilesh Dalvi Bachelor of Technology, Deparment of computer science and Engineering. (8/97 5/01) Thesis pipelining in Multi-Query Optimization. GPA 9.23/10. http://www.cs.washington.edu/homes/nilesh/resume.html

Personal Information: Name Nilesh Dalvi Address 428 Sieg, Department of Computer Science, Box 352350, University of Washington, Seattle, WA 98195-2350 Phone Email nilesh@cs.washington.edu Objective: To obtain an internship position in a research lab/industry Education: University of Washington, Seattle, WA Ph.D., Department of Computer Science. (9/01 - till date) First Year Student Indian Institute of Technology, Bombay, India. Bachelor of Technology, Deparment of Computer Science and Engineering. Thesis: Pipelining in Multi-Query Optimization. GPA 9.23/10 Research Interests: Database Systems, Theoritical Computer Science (Common frontiers of both) Academic Honors: 2001: Was selected for the ACM Special Interest Group on Management of Data (SIGMOD) Best Undergraduate Scholarship , typically given to best five undergraduates working in databases. 2001: Presented a paper at the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS 2001). The paper was also invited for publication in a special edition of the Journal of Computers and System Science devoted to the best papers from PODS. 1997: Was selected to represent India in the 38'th International Mathematics Olympiad , held in Argentina, in July 1997. Also, secured a

54. Computer Science to robotics from a computer science perspective. an indepth study of modern computerarchitecture analysis, Instruction Set Design, pipelining Basics, Advanced http://www.cvn.columbia.edu/Courses/Descriptions/cs.html

Computer Science CS W4111 Database systems (3 points) Prerequisite: CS W3156 and W3824, or permission of the instructor. The fundamentals of database design. Review of file organization and access methods. Relational, network, and hierarchical views of databases, including the appropriate query languages and implementations. Parsing and optimization of queries; reliability, security, and integrity of databases; techniques of data compression and encryption. A programming project is required. CS W4115 Programming Languages and Translators (3 points Prerequisite: CS W3156, W3261, and W3824, or permission of instructor. Covers language design issues; syntax; the translation process; names, locations, and values; control structures; data types; input and output; procedures and parameters; nesting and scope; definition of new data types; dynamically varying structures; applicative languages; exception handling; parallel processing; and separately compiled modules. A large language implementation project is required. CS W4117 Compilers and Interpreters (3 points) Prerequisite: CS W4115 or permission of the instructor.

55. Computer Science Graduate Courses CMSC 498 SPECIAL PROBLEMS IN computer science (13 CMSC 615 ADVANCED computer ARCHITECTURE(3 pipelining, instruction scheduling, branch processing, out of order http://www.cs.umd.edu/Grad/Courses.shtml

Public home page Local home page How to contact us Search Graduate Courses in Computer Science These are the graduate courses in Computer Science, including special topics and research courses whose content varies with student and faculty interest. ( Undergraduate course listings are also available.) Note: The syllabus links below may not link to the most up to date syllabi. That is best obtained by following the links from the CMSC class pages The most accurate current scheduling information is available at UMCP Schedule of Classes . Also available are past and tentative future schedules . Due to heavy demand for Computer Science courses, we strongly advise that after the first semester students preregister for courses. CMSC 411 COMPUTER SYSTEMS ARCHITECTURE (3) Prerequisites: Grades of C or better in CMSC 311 and CMSC 330 , or a grade of C or better in CMSC 400 Notes: Three hours of lecture each week. Syllabus: HTML Description: Input/output processors and techniques. Intra-system communication, buses, caches. Addressing and memory hierarchies. Microprogramming, parallelism, and pipelining.

56. CATECS Fall 2002 Computer Science (CSCI) Course Descriptions s. Topics Detailed computer design,instruction set design processor implementation, pipelining, cache design......CATECS Fall 2002 computer science Course http://www.colorado.edu/CATECS/fallcsci.html

CATECS Fall 2002 Computer Science Course Descriptions CSCI 5582: Artificial Intelligence CSCI 5593: Advanced Computer Architecture CSCI 5606: Numerical Computation, Principles of CSCI 5654: Linear Programming ... CSCI 7717: Database Systems, Topics in CSCI 5582 Artificial Intelligence Time: 11:00 a.m. - 12:15 p.m., TR Provides a broad survey of the field of artificial intelligence. It serves as the foundation for other advanced courses in the areas of natural language processing, machine learning and neural networks. Topics: Search, problem solving, knowledge representation, uncertain reasoning, machine learning and speech and language processing. Prerequisites: Must be proficient in C, C++, JAVA or LISP. Tentative Text: Russell and Norvig, Artificial Intelligence: A Modern Aproach, Prentice Hall, 1995, ISBN 0-13-103805-2. Hardware/Software: Must have access to the web and e-mail, a programming environment for one of the above languages, and the ability to install new programming environments as needed. Instructor: Assoc. Prof. James Martin. Research: Natural language processing, machine learning and knowledge representation. Author of more than 25 papers and a book in these areas.

57. Home Page an Associate Professor of computer science and Engineering primary interests are incomputer Architecture and Embedded Systems, CMOS Wavepipelining, Low power http://www.cs.buffalo.edu/~rsridhar/

Ramalingam Sridhar Associate Professor Department of Computer Science and Engineering 201 Bell Hall, State University of New York at Buffalo Buffalo New York U.S.A. Phone: (716) 645-3180 ext. 136. Fax: (716) 645-3464 Email: rsridhar@cse.buffalo.edu Office: 135 Bell Hall Biographical Information Research Teaching ... Other Useful Links Ramalingam Sridhar is an Associate Professor of Computer Science and Engineering at the State University of New York at Buffalo . His primary interests are in Computer Architecture and VLSI Design. His research interests include Embedded Systems, CMOS Wave-Pipelining, Low power systems architecture, Pipelining in DSP processors, selective clocking, Special purpose architecture for embedded applications, multimedia systems, Foveal CMOS vision sensors, and digital systems. Dr. Sridhar is currently on the Editorial Board of IEEE Transactions on VLSI Systems, Journal of Circuits, Systems and Computers and IEEE Circuits and Devices. Dr. Sridhar was also an Associate Editor for

58. * Certificate In Computer Science CISC, pipelining, caches, I/O, virtual memory and related performance issues betterin CS 2318 and CS 3409.); 6 hours of advanced computer science electives (CS http://www.cs.swt.edu/Certificate.shtml

Certificate in Computer Science Educational Objectives: The certificate program in computer science offers a broad-based curriculum in computer science to those working professionals who already have a degree in other fields and who wish to pursue a career in a field which is in high demand. The certificate program will meet the exponentially growing demand for computer science professionals and will help industry to find scarce professionals trained in various areas of computer science.  The certificate program also provides the background courses for students with a baccalaureate degree in a field other than computer science to pursue a master's degree in computer science or software engineering. The educational objectives of the certificate program include: Provide students with a broad knowledge of computer science technology. Provide leadership in advancing the state of the practice of computer science education. Provide students with specific knowledge and skills required to develop methodologies and to analyze and design complex computer systems. Prepare students to enter master's degree programs in computer science.

59. Mathematics And Computer Science Course Catalog Principles of computer architecture, instruction set design, RISC machines, pipelining.Prerequisites computer science 221, 301. 3 sem. hrs. 315 Algorithms. http://www.mathcs.richmond.edu/catalog.html

COMPUTER SCIENCE The grade point average of the coursework comprising the major or the minor must be no less than 2.00 with no Computer Science course grade below C For the Bachelor of Arts degree: I. Computer Science 150 or 155, 221, 222, 301, 315, 323, and 330 II. Four additional 3-hour 300-level computer science courses, at least two of which must be from 321, 322 or 331, and no more than one of which can be a 3-hour Computer Science Independent Study course. III. Mathematics 111 or 211, and 245. For the Bachelor of Science degree: I. Computer Science 150 or 155, 221, 222, 301, 302, 315, 321, 323, and 330 II. Two additional 3-hour 300-level computer science courses, no more than one of which can be a 3-hour Computer Science Independent Study course. III. Mathematics 111 or 211, 212, and 245. IV. Two 3-hour courses at the 300-level or above in Mathematics or two 3-hour (or more) at the 200-level or above in one of the following fields: Physics, Chemistry, or Biology. For the Computer Science Minor: I. Computer Science 150 or 155, 221, 222, and 301.

60. Computer Science Courses For Spring 2004 microprocessors, CPU design, RISC and CISC concepts, pipelining, superscalar processing coursecompletes the broad introduction to computer science begun in CPSC http://www.cs.swarthmore.edu/Courses/4.Spring2004/spring2004.html

Please click here for printer-friendly form... Computer Science Courses for Spring 2004 Charles Kelemen is absent on leave during the 2003-2004 academic year. At the present time, the CS program expects (but does not guarantee) to offer the following courses. Precisely what we offer and who teaches what courses will depend on hiring, student interest, and other staffing considerations. The "Req Preq" column lists the "required prerequisites" . The "Rec Preq" column lists the "recommended prerequisites" . In some cases, the prerequisite rules may be waived with the permission of the instructor. Course Name Req Prereqs Rec Prereqs WWW Notes CPSC-010 Great Ideas In Computer Science Portal PDC CPSC-021 The Imperitive Paradigm in C PDC CPSC-022 The Structure and Interpretation Of Computer_Programs CPSC-025 Principles of Computer Architecture CPSC-021 or CPSC-024 A course beyond CPSC-021 Cross listed as ENGR-025 CPSC-035 Algorithms and Object-Oriented Computing CPSC-021 MATH-009 CPSC-091 Special Topics in Computer Science : Cognitive Science TBA TBA CPSC-091 Special Topics in Computer Science : Distributed Systems TBA TBA CPSC-097 Senior Conference Must be a CS major CPSC-010, Great Ideas In Computer Science

A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z

Page 3     41-60 of 87    Back | 1  | 2  | 3  | 4  | 5  | Next 20