1 FCS Project Submission System
|
|
- Blake Fleming
- 8 years ago
- Views:
Transcription
1 1 FCS Project Submission System Teachers at FCS currently accept digital homework via . However, is cumbersome, because teachers must individually download the attached homework from every student, identify the student by his/her address and only then proceed to grade their homework. Furthermore, the students often send their homework using different formats, which makes it more difficult for the teacher to do their job. The goal of this system is to allow teachers to set up a web page where students can securely upload their homework using their own student account. After the deadline, the teacher will then proceed to download all homework at the same time, each student s homework neatly organized in its own directory. When the student uploads their homework, the system will perform some checks (that are configurable by the teacher) to verify that the homework is correctly formated (e.g. does not contain executable code, but only source code, does not contain.rar archives, it compiles, etc). Furthermore, the system should be designed so that it is easy to integrate with automated grading systems (a program that grades the homework without human intervention) Protocol Desirable experience: back-end web applications, security, LDAP Technology: web, LDAP 2 FCS automated grading system Some homework can be graded automatically by a computer that runs the homework against a set of predefined tests. The grader then automatically assigns a grade to the homework, depending on what tests it passed and what tests it did not. Automatic grading is extensively used in programming contests such as topcoder.com, acm.timus.ru, acm.uva.es and infoarena.ro. The goal of this project is to produce a secure system that will be used internally at FCS in order to automatically grade homework where fit. 1
2 submission_48.pdf 4. pdf topcoder.com 8. acm.timus.ru 9. acm.uva.es 10. infoarena.ro Desirable experience: programming contents, Linux programming Technology: C(++), Linux 3 Detecting Plagiarism in Source Code This is a research subject that involves: 1. implementing a new method for detecting plagiarism in source code submitted by students and 2. checking that the new method works as expected. The student will prototype a similarity-checking tool (call it T) that will receive as inputs two programs P1 and P2. The tool will output a number T(P1, P2) proportional to the degree of similarity between P1 and P2. In contrast with other plagiarism checking methods, T will not analyse the source code of P1 and P2 statically (because the code might have been trivially altered = renaming variables, moving function definitions around, changing while loops into for loops, etc). Instead, T will run both P1 and P2 on the same set of inputs and log the traces of P1 and P2. If the traces 2
3 are similar on similar inputs, then P1 and P2 are flagged. The difficulty is to choose the right inputs, what the traces should contain and to check that the method work well in practice code Desirable experience: strong programming skills and compilers, interpreters or parsing experience Technology: any 4 Term Rewriting Library The object of this topic is to produce a top-notch efficient C++ framework for term/tree rewriting. Success will be measured according to ease of use of the library and efficiency of the implementation Klop-TR.pdf 3. Desirable experience: strong C++ programming/design skills, strong algorithms/data structures skills Technology: C++ 5 Validated Parser The goal is to show that a parser conforms to the syntax specification (grammar) of a language. This is a research project that involves the following steps: 3
4 1. formally specifying the syntax of a language (probably using Coq or Isabelle) 2. formally defining a parser 3. proving that the parser acts according to the specification 1. pdf Desirable experience: proof assistants (Coq, Isabelle), parsing Technology: Coq, Isabelle or other specification systems 6 Teaching/Learning Tools Most of the existing visualization tools for algorithms and data structures suck. The goal of the following projects is to produce useful visualizations that allow teachers to teach and students to learn more easily about certain topics in computer science. 6.1 Comparison-Based Sorting Algoritm Visualization Framework Students have a hard time understanding algorithms such as merge-sort or quick-sort, even if the basic idea behind them is trivial. The goal of this is to produce a visual framework which makes it simple to understand how these algorithms work. The framework should support at least insertion sort, selection sort, bubble sort, quick sort and merge sort and it should be extensible to support other comparison-based sorting algorithms. Success will be judged according to how easily people understand these algorithms from the visualization Desirable experience: web technologies, game programming, algorithms 4
5 Technology: The visualization will be implemented in JavaScript/SVG or HTML Data Structures Visualization Framework The topic is the visualization of data structures such as hash maps, binary search trees, (doubly) linked-lists, b-trees, suffix arrays, (binomial) heaps, dynamic arrays, tries, skip lists, sparse matrixes, etc and functions that operate on these data structures. The goal is to produce a visualization of a set of related data structures (e.g. binary search trees (including AVLs, red-black trees, etc)) that is useful in teaching that topic. The success will be judged according to how easily people understand these data structures/algorithms from the visualization Desirable experience: web technologies, game programming, data structures Technology: The visualization will be implemented in JavaScript/SVG or HTML Most General Unifier Visualization Computing the most general unifier is a useful operation that occurs in many places in computer science. The goal of this visualization is to make students understand how the most general unifier is computed. The visualization framework should support several unification algorithms, including those with structure sharing Desirable experience: web technologies, game programming, logic Technology: The visualization will be implemented in JavaScript/SVG or HTML5. 5
6 6.4 Proof System Proof systems are ubiquitous artifacts in several subdomains in computer science. The object of this topic is to create a tool that takes as input a proof system and allows a student to apply the proof system interactively in order to reach a certain goal. The tool should be extensible in the sense that adding proof systems to it should be easy. Example proof systems: most general unifier (forwards), resolution (forwards), prenex normal form (forwards), natural deduction (backwards) html 4. pdf Desirable experience: web technologies, game programming, logic Technology: The tool will be implemented in JavaScript/SVG or HTML5. 6
340368 - FOPR-I1O23 - Fundamentals of Programming
Coordinating unit: 340 - EPSEVG - Vilanova i la Geltrú School of Engineering Teaching unit: 723 - CS - Department of Computer Science Academic year: Degree: 2015 BACHELOR'S DEGREE IN INFORMATICS ENGINEERING
More informationBinary Heap Algorithms
CS Data Structures and Algorithms Lecture Slides Wednesday, April 5, 2009 Glenn G. Chappell Department of Computer Science University of Alaska Fairbanks CHAPPELLG@member.ams.org 2005 2009 Glenn G. Chappell
More informationCode Estimation Tools Directions for a Services Engagement
Code Estimation Tools Directions for a Services Engagement Summary Black Duck software provides two tools to calculate size, number, and category of files in a code base. This information is necessary
More informationSample Syllabus (C++) CSCI 1301 Introduction to Programming Principles
Sample Syllabus (C++) CSCI 1301 Introduction to Programming Principles Knowledge Areas that contain topics and learning outcomes covered in the course Knowledge Areas Total Hours of Coverage Software Development
More informationKrishna Institute of Engineering & Technology, Ghaziabad Department of Computer Application MCA-213 : DATA STRUCTURES USING C
Tutorial#1 Q 1:- Explain the terms data, elementary item, entity, primary key, domain, attribute and information? Also give examples in support of your answer? Q 2:- What is a Data Type? Differentiate
More informationQuestions 1 through 25 are worth 2 points each. Choose one best answer for each.
Questions 1 through 25 are worth 2 points each. Choose one best answer for each. 1. For the singly linked list implementation of the queue, where are the enqueues and dequeues performed? c a. Enqueue in
More informationCOWLEY COLLEGE & Area Vocational Technical School
COWLEY COLLEGE & Area Vocational Technical School COURSE PROCEDURE FOR Student Level: This course is open to students on the college level in either Freshman or Sophomore year. Prerequisites: None INTRODUCTION
More informationWindows PowerShell Cookbook
Windows PowerShell Cookbook Lee Holmes O'REILLY' Beijing Cambridge Farnham Koln Paris Sebastopol Taipei Tokyo Table of Contents Foreword Preface xvii xxi Part I. Tour A Guided Tour of Windows PowerShell
More informationBasic Programming and PC Skills: Basic Programming and PC Skills:
Texas University Interscholastic League Contest Event: Computer Science The contest challenges high school students to gain an understanding of the significance of computation as well as the details of
More informationInstructions Account creation & Management for Maine Schools
Maine Department of Education, 2007 Instructions Account creation & Management for Maine Schools General School PrepMe Contact Person School Admin Account Student Account Creation Using MEDMS Download
More informationCSE 326, Data Structures. Sample Final Exam. Problem Max Points Score 1 14 (2x7) 2 18 (3x6) 3 4 4 7 5 9 6 16 7 8 8 4 9 8 10 4 Total 92.
Name: Email ID: CSE 326, Data Structures Section: Sample Final Exam Instructions: The exam is closed book, closed notes. Unless otherwise stated, N denotes the number of elements in the data structure
More informationIntroduction to Programming System Design. CSCI 455x (4 Units)
Introduction to Programming System Design CSCI 455x (4 Units) Description This course covers programming in Java and C++. Topics include review of basic programming concepts such as control structures,
More informationWIRIS quizzes web services Getting started with PHP and Java
WIRIS quizzes web services Getting started with PHP and Java Document Release: 1.3 2011 march, Maths for More www.wiris.com Summary This document provides client examples for PHP and Java. Contents WIRIS
More informationCS5310 Algorithms 3 credit hours 2 hours lecture and 2 hours recitation every week
CS5310 Algorithms 3 credit hours 2 hours lecture and 2 hours recitation every week This course is a continuation of the study of data structures and algorithms, emphasizing methods useful in practice.
More information2010-2011 Assessment for Master s Degree Program Fall 2010 - Spring 2011 Computer Science Dept. Texas A&M University - Commerce
2010-2011 Assessment for Master s Degree Program Fall 2010 - Spring 2011 Computer Science Dept. Texas A&M University - Commerce Program Objective #1 (PO1):Students will be able to demonstrate a broad knowledge
More informationBachelor of Games and Virtual Worlds (Programming) Subject and Course Summaries
First Semester Development 1A On completion of this subject students will be able to apply basic programming and problem solving skills in a 3 rd generation object-oriented programming language (such as
More informationUsing Web-based Tools to Enhance Student Learning and Practice in Data Structures Course
Using Web-based Tools to Enhance Student Learning and Practice in Data Structures Course 1. Introduction Chao Chen January 2014 The purpose of this project is to enhance student learning and practice in
More informationProblem Statement. Jonathan Huang Aditya Devarakonda. Overview
Jonathan Huang Aditya Devarakonda Problem Statement Overview Automated job schedulers have been extensively studied and implemented in large clusters and supercomputers. However, many of these clusters
More informationTables so far. set() get() delete() BST Average O(lg n) O(lg n) O(lg n) Worst O(n) O(n) O(n) RB Tree Average O(lg n) O(lg n) O(lg n)
Hash Tables Tables so far set() get() delete() BST Average O(lg n) O(lg n) O(lg n) Worst O(n) O(n) O(n) RB Tree Average O(lg n) O(lg n) O(lg n) Worst O(lg n) O(lg n) O(lg n) Table naïve array implementation
More informationEMC Publishing. Ontario Curriculum Computer and Information Science Grade 11
EMC Publishing Ontario Curriculum Computer and Information Science Grade 11 Correlations for: An Introduction to Programming Using Microsoft Visual Basic 2005 Theory and Foundation Overall Expectations
More informationDiskPulse DISK CHANGE MONITOR
DiskPulse DISK CHANGE MONITOR User Manual Version 7.9 Oct 2015 www.diskpulse.com info@flexense.com 1 1 DiskPulse Overview...3 2 DiskPulse Product Versions...5 3 Using Desktop Product Version...6 3.1 Product
More informationCreating Online Surveys with Qualtrics Survey Tool
Creating Online Surveys with Qualtrics Survey Tool Copyright 2015, Faculty and Staff Training, West Chester University. A member of the Pennsylvania State System of Higher Education. No portion of this
More informationML for the Working Programmer
ML for the Working Programmer 2nd edition Lawrence C. Paulson University of Cambridge CAMBRIDGE UNIVERSITY PRESS CONTENTS Preface to the Second Edition Preface xiii xv 1 Standard ML 1 Functional Programming
More informationAutomated Theorem Proving - summary of lecture 1
Automated Theorem Proving - summary of lecture 1 1 Introduction Automated Theorem Proving (ATP) deals with the development of computer programs that show that some statement is a logical consequence of
More informationPython Checker. Computer Science Department
Python Checker University of Mary Washington Computer Science Department PROJECT PLAN Prepared by Chris Zimmerman, Eric Phung, Shehan Rajapakse University of Mary Washington February 23, 2015 ii Table
More informationING Life PromoCenter. Enhanced. Getting Started. Your future. Made easier.
Enhanced ING Life PromoCenter Your full-service marketing engine is now enhanced with more expansive electronic capabilities. Personalize print and email promotion with your photo, logo and contact information
More informationBCS2B02: OOP Concepts and Data Structures Using C++
SECOND SEMESTER BCS2B02: OOP Concepts and Data Structures Using C++ Course Number: 10 Contact Hours per Week: 4 (2T + 2P) Number of Credits: 2 Number of Contact Hours: 30 Hrs. Course Evaluation: Internal
More informationAn Introduction to Programming and Computer Science
An Introduction to Programming and Computer Science Maria Litvin Phillips Academy, Andover, Massachusetts Gary Litvin Skylight Software, Inc. Skylight Publishing Andover, Massachusetts Copyright 1998 by
More informationNesstar Server Nesstar WebView Version 3.5
Unlocking data creating knowledge Version 3.5 Release Notes November 2006 Introduction These release notes contain general information about the latest version of the Nesstar products and the new features
More informationEventia Log Parsing Editor 1.0 Administration Guide
Eventia Log Parsing Editor 1.0 Administration Guide Revised: November 28, 2007 In This Document Overview page 2 Installation and Supported Platforms page 4 Menus and Main Window page 5 Creating Parsing
More information2) What is the structure of an organization? Explain how IT support at different organizational levels.
(PGDIT 01) Paper - I : BASICS OF INFORMATION TECHNOLOGY 1) What is an information technology? Why you need to know about IT. 2) What is the structure of an organization? Explain how IT support at different
More informationSQL Query Evaluation. Winter 2006-2007 Lecture 23
SQL Query Evaluation Winter 2006-2007 Lecture 23 SQL Query Processing Databases go through three steps: Parse SQL into an execution plan Optimize the execution plan Evaluate the optimized plan Execution
More information1 Recommended Readings. 2 Resources Required. 3 Compiling and Running on Linux
CSC 482/582 Assignment #2 Securing SimpleWebServer Due: September 29, 2015 The goal of this assignment is to learn how to validate input securely. To this purpose, students will add a feature to upload
More informationAUTOMATIC EVALUATION OF COMPUTER PROGRAMS USING MOODLE S VIRTUAL PROGRAMMING LAB (VPL) PLUG- IN
AUTOMATIC EVALUATION OF COMPUTER PROGRAMS USING MOODLE S VIRTUAL PROGRAMMING LAB (VPL) PLUG- IN Dominique Thiébaut Department of Computer Science Smith College Northampton, MA 01060 dthiebaut@smith.edu
More informationSTUDENT PORTAL - TURNITIN
Online STUDENT PORTAL - TURNITIN Student Manual Ver. 5 London School of Commerce & School of Business and Law IT Department 2012 1 What is new in STUDENT PORTAL? www.lsclondon.co.uk/student/studentmanual.pdf
More informationLavastorm Analytic Library Predictive and Statistical Analytics Node Pack FAQs
1.1 Introduction Lavastorm Analytic Library Predictive and Statistical Analytics Node Pack FAQs For brevity, the Lavastorm Analytics Library (LAL) Predictive and Statistical Analytics Node Pack will be
More informationSorting revisited. Build the binary search tree: O(n^2) Traverse the binary tree: O(n) Total: O(n^2) + O(n) = O(n^2)
Sorting revisited How did we use a binary search tree to sort an array of elements? Tree Sort Algorithm Given: An array of elements to sort 1. Build a binary search tree out of the elements 2. Traverse
More informationCSC148 Lecture 8. Algorithm Analysis Binary Search Sorting
CSC148 Lecture 8 Algorithm Analysis Binary Search Sorting Algorithm Analysis Recall definition of Big Oh: We say a function f(n) is O(g(n)) if there exists positive constants c,b such that f(n)
More informationJava 6 'th. Concepts INTERNATIONAL STUDENT VERSION. edition
Java 6 'th edition Concepts INTERNATIONAL STUDENT VERSION CONTENTS PREFACE vii SPECIAL FEATURES xxviii chapter i INTRODUCTION 1 1.1 What Is Programming? 2 J.2 The Anatomy of a Computer 3 1.3 Translating
More informationFaculty of Science and Technology MASTER S THESIS
Faculty of Science and Technology MASTER S THESIS Study program/ Specialization: Spring semester, 2015 Computer Science Open / Restricted access Writer: Heine Furubotten Faculty supervisor: Hein Meling
More informationCreating and grading assignments
Creating and grading assignments An assignment activity provides a simple way for an instructor to provide a task for students to complete before a given deadline, collect work form student and assign
More informationSouth Carolina Department of Education. Enrich IEP Training 2014
South Carolina Department of Education Enrich IEP Training 2014 Training Expectations Purpose: To review the Enrich IEP system features and functions specific to the creation and management of IEPs. Goal:
More information60-141 Introduction to Programming II Winter, 2014 Assignment 2
60-141 Introduction to Programming II Winter, 2014 Assignment 2 Array In this assignment you will implement an encryption and a corresponding decryption algorithm which involves only random shuffling of
More informationCOURSE SYLLABUS EDG 6931: Designing Integrated Media Environments 2 Educational Technology Program University of Florida
COURSE SYLLABUS EDG 6931: Designing Integrated Media Environments 2 Educational Technology Program University of Florida CREDIT HOURS 3 credits hours PREREQUISITE Completion of EME 6208 with a passing
More informationFreeForm Designer. Phone: +972-9-8309999 Fax: +972-9-8309998 POB 8792, Natanya, 42505 Israel www.autofont.com. Document2
FreeForm Designer FreeForm Designer enables designing smart forms based on industry-standard MS Word editing features. FreeForm Designer does not require any knowledge of or training in programming languages
More informationTexas Essential Knowledge and Skills Correlation to Video Game Design Foundations 2011 N130.0993. Video Game Design
Texas Essential Knowledge and Skills Correlation to Video Game Design Foundations 2011 N130.0993. Video Game Design STANDARD CORRELATING PAGES Standard (1) The student demonstrates knowledge and appropriate
More informationJava Software Structures
INTERNATIONAL EDITION Java Software Structures Designing and Using Data Structures FOURTH EDITION John Lewis Joseph Chase This page is intentionally left blank. Java Software Structures,International Edition
More information2. Advance Certificate Course in Information Technology
Introduction: 2. Advance Certificate Course in Information Technology In the modern world, information is power. Acquiring information, storing, updating, processing, sharing, distributing etc. are essentials
More informationAssessment Plan for CS and CIS Degree Programs Computer Science Dept. Texas A&M University - Commerce
Assessment Plan for CS and CIS Degree Programs Computer Science Dept. Texas A&M University - Commerce Program Objective #1 (PO1):Students will be able to demonstrate a broad knowledge of Computer Science
More informationConverting a Number from Decimal to Binary
Converting a Number from Decimal to Binary Convert nonnegative integer in decimal format (base 10) into equivalent binary number (base 2) Rightmost bit of x Remainder of x after division by two Recursive
More informationProduct Overview. Contents
Contents Product Overview Copyright 2002 - Xware AB. All rights reserved. xtrade is a registered trademark of Xware AB. Symphonia is a trademark of Orion Systems New Zealand Ltd. All rights reserved. 2
More informationSystem Requirement Specification for A Distributed Desktop Search and Document Sharing Tool for Local Area Networks
System Requirement Specification for A Distributed Desktop Search and Document Sharing Tool for Local Area Networks OnurSoft Onur Tolga Şehitoğlu November 10, 2012 v1.0 Contents 1 Introduction 3 1.1 Purpose..............................
More informationDeveloping Web Browser Recording Tools. Using Server-Side Programming Technology
Developing Web Browser Recording Tools Using Server-Side Programming Technology Chris J. Lu Ph.D. National Library of Medicine NLM, NIH, Bldg. 38A, Rm. 7N-716, 8600 Rockville Pike Bethesda, MD 20894, USA
More informationC Compiler Targeting the Java Virtual Machine
C Compiler Targeting the Java Virtual Machine Jack Pien Senior Honors Thesis (Advisor: Javed A. Aslam) Dartmouth College Computer Science Technical Report PCS-TR98-334 May 30, 1998 Abstract One of the
More informationAP Computer Science AB Syllabus 1
AP Computer Science AB Syllabus 1 Course Resources Java Software Solutions for AP Computer Science, J. Lewis, W. Loftus, and C. Cocking, First Edition, 2004, Prentice Hall. Video: Sorting Out Sorting,
More informationINTRODUCTION TO INFORMATION TECHNOLOGY CSIT 1110. Class Hours: 3.0 Credit Hours: 4.0 Laboratory Hours: 3.0 Revised: August 24, 2012
PELLISSIPPI STATE COMMUNITY COLLEGE MASTER SYLLABUS INTRODUCTION TO INFORMATION TECHNOLOGY CSIT 1110 Class Hours: 3.0 Credit Hours: 4.0 Laboratory Hours: 3.0 Revised: August 24, 2012 Catalog Course Description:
More informationPartitioning under the hood in MySQL 5.5
Partitioning under the hood in MySQL 5.5 Mattias Jonsson, Partitioning developer Mikael Ronström, Partitioning author Who are we? Mikael is a founder of the technology behind NDB
More informationThomas Jefferson High School for Science and Technology Program of Studies Foundations of Computer Science. Unit of Study / Textbook Correlation
Thomas Jefferson High School for Science and Technology Program of Studies Foundations of Computer Science updated 03/08/2012 Unit 1: JKarel 8 weeks http://www.fcps.edu/is/pos/documents/hs/compsci.htm
More informationBasic Unix/Linux 1. Software Testing Interview Prep
Basic Unix/Linux 1 Programming Fundamentals and Concepts 2 1. What is the difference between web application and client server application? Client server application is designed typically to work in a
More informationA Comparison of Dictionary Implementations
A Comparison of Dictionary Implementations Mark P Neyer April 10, 2009 1 Introduction A common problem in computer science is the representation of a mapping between two sets. A mapping f : A B is a function
More informationDATA STRUCTURES USING C
DATA STRUCTURES USING C QUESTION BANK UNIT I 1. Define data. 2. Define Entity. 3. Define information. 4. Define Array. 5. Define data structure. 6. Give any two applications of data structures. 7. Give
More informationMassachusetts Institute of Technology Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.035, Spring 2013 Handout Scanner-Parser Project Thursday, Feb 7 DUE: Wednesday, Feb 20, 9:00 pm This project
More informationFile S1: Supplementary Information of CloudDOE
File S1: Supplementary Information of CloudDOE Table of Contents 1. Prerequisites of CloudDOE... 2 2. An In-depth Discussion of Deploying a Hadoop Cloud... 2 Prerequisites of deployment... 2 Table S1.
More informationBasic info Course: CS 165 Accelerated Introduction to Computer Science Credits: 8 Instructor: Tim Alcon Email: timothy.alcon@oregonstate.
Basic info Course: CS 165 Accelerated Introduction to Computer Science Credits: 8 Instructor: Tim Alcon Email: timothy.alcon@oregonstate.edu Two fundamental rules 1. You are responsible for knowing the
More informationLeMoyne-Owen College Division of Natural and Mathematical Sciences COMPUTER ALGORITHMS, COSI 335 Fall 2013. Syllabus
LeMoyne-Owen College Division of Natural and Mathematical Sciences COMPUTER ALGORITHMS, COSI 335 Fall 2013 Instructor: Valerie Chu, Ph.D. Office Room: GOH 400D Office Phone: (901) 435-1378 Office Hours:
More informationEastern Washington University Department of Computer Science. Questionnaire for Prospective Masters in Computer Science Students
Eastern Washington University Department of Computer Science Questionnaire for Prospective Masters in Computer Science Students I. Personal Information Name: Last First M.I. Mailing Address: Permanent
More informationBONE Network of Excellence
SEVENTH FRAMEWORK PROGRAMME D03.1 Electronic Communication Tools Specification FP7-ICT-216863/UNIBO-UPC/R/PU/D03.1 Project Number: FP7-ICT-2007-1 216863 Project Title: Building the Future Optical Network
More informationCS473 - Algorithms I
CS473 - Algorithms I Lecture 9 Sorting in Linear Time View in slide-show mode 1 How Fast Can We Sort? The algorithms we have seen so far: Based on comparison of elements We only care about the relative
More informationAndroid Application Development Course Program
Android Application Development Course Program Part I Introduction to Programming 1. Introduction to programming. Compilers, interpreters, virtual machines. Primitive data types, variables, basic operators,
More informationCS A250 (CRN 20690-25399) C++ Programming Language 2. Syllabus Fall 2015
CS A250 (CRN 20690-25399) C++ Programming Language 2 Syllabus Fall 2015 Instructor: Gabriela Ernsberger E-mail: gernsberger@occ.cccd.edu Course Web site: www.thisclass.info Office: MB Computing Center
More informationCS 261 C and Assembly Language Programming. Course Syllabus
CS 261 C and Assembly Language Programming Course Syllabus Spring 2016 Lecture: Tuesdays and Thursdays 9:10AM to 10:25 in VSCI 255 3 Semester Hours Instructor: Dick Lang, Ph.D. dick_lang@vancouver.wsu.edu
More informationCS 300 Data Structures Syllabus - Fall 2014
CS 300 Data Structures Syllabus - Fall 2014 Catalog Description Data structures are fundamental to advanced, efficient programming. Topics including asymptotic analysis, stacks, queues, linked lists, trees,
More informationA TOOL FOR DATA STRUCTURE VISUALIZATION AND USER-DEFINED ALGORITHM ANIMATION
A TOOL FOR DATA STRUCTURE VISUALIZATION AND USER-DEFINED ALGORITHM ANIMATION Tao Chen 1, Tarek Sobh 2 Abstract -- In this paper, a software application that features the visualization of commonly used
More informationIceWarp Server Upgrade
IceWarp Unified Communications IceWarp Version 11.4 Published on 2/9/2016 Contents... 3 Best Practices... 3 Planning Upgrade... 3 Prior Upgrade... 3 Upgrade... 3 After Upgrade... 3 Upgrade to Version 11.3...
More informationWindchill Service Information Manager 10.1. Curriculum Guide
Windchill Service Information Manager 10.1 Curriculum Guide Live Classroom Curriculum Guide Building Information Structures with Windchill Service Information Manager 10.1 Building Publication Structures
More informationCCA CYBER SECURITY TRACK
CCA CYBER SECURITY TRACK 2013-2014 CCA Advanced Cyber Security Track A detailed description of the advanced cyber security track. Courses to be offered in the CCA Advanced Cyber Security Track 2013-2014
More informationPattern Insight Clone Detection
Pattern Insight Clone Detection TM The fastest, most effective way to discover all similar code segments What is Clone Detection? Pattern Insight Clone Detection is a powerful pattern discovery technology
More informationCompuScholar, Inc. Alignment to Utah's Computer Programming II Standards
CompuScholar, Inc. Alignment to Utah's Computer Programming II Standards Course Title: TeenCoder: Java Programming Course ISBN: 978 0 9887070 2 3 Course Year: 2015 Note: Citation(s) listed may represent
More informationMatrixSSL Getting Started
MatrixSSL Getting Started TABLE OF CONTENTS 1 OVERVIEW... 3 1.1 Who is this Document For?... 3 2 COMPILING AND TESTING MATRIXSSL... 4 2.1 POSIX Platforms using Makefiles... 4 2.1.1 Preparation... 4 2.1.2
More informationHow To Set Up A Smartwork Course
Instructor QuickStart Guide This brief manual provides instructions for setting up and customizing your SmartWork course, and will outline the functions of the grade book and other administrator tools.
More informationPES Institute of Technology-BSC QUESTION BANK
PES Institute of Technology-BSC Faculty: Mrs. R.Bharathi CS35: Data Structures Using C QUESTION BANK UNIT I -BASIC CONCEPTS 1. What is an ADT? Briefly explain the categories that classify the functions
More informationCopyright 2007 Ramez Elmasri and Shamkant B. Navathe. Slide 13-1
Slide 13-1 Chapter 13 Disk Storage, Basic File Structures, and Hashing Chapter Outline Disk Storage Devices Files of Records Operations on Files Unordered Files Ordered Files Hashed Files Dynamic and Extendible
More informationWilson Area School District Planned Course Guide
Wilson Area School District Planned Course Guide Title of planned course: Introduction to Computer Programming Subject Area: Business Grade Level: 9-12 Course Description: In this course, students are
More information- Easy to insert & delete in O(1) time - Don t need to estimate total memory needed. - Hard to search in less than O(n) time
Skip Lists CMSC 420 Linked Lists Benefits & Drawbacks Benefits: - Easy to insert & delete in O(1) time - Don t need to estimate total memory needed Drawbacks: - Hard to search in less than O(n) time (binary
More informationProject Plan Log Monitoring Compliance
Project Plan Log Monitoring Compliance The Capstone Experience Team Spectrum Health Kathryn Bonnen Collin Lotus Will Seeger Wayne Stiles Department of Computer Science and Engineering Michigan State University
More informationDomains and Competencies
Domains and Competencies DOMAIN I TECHNOLOGY APPLICATIONS CORE Standards Assessed: Computer Science 8 12 I VII Competency 001: The computer science teacher knows technology terminology and concepts; the
More informationTutorial: Packaging your server build
Tutorial: Packaging your server build This tutorial walks you through the steps to prepare a game server folder or package containing all the files necessary for your game server to run in Amazon GameLift.
More informationOKLAHOMA SUBJECT AREA TESTS (OSAT )
CERTIFICATION EXAMINATIONS FOR OKLAHOMA EDUCATORS (CEOE ) OKLAHOMA SUBJECT AREA TESTS (OSAT ) FIELD 081: COMPUTER SCIENCE September 2008 Subarea Range of Competencies I. Computer Use in Educational Environments
More informationBraindumps.C2150-810.50 questions
Braindumps.C2150-810.50 questions Number: C2150-810 Passing Score: 800 Time Limit: 120 min File Version: 5.3 http://www.gratisexam.com/ -810 IBM Security AppScan Source Edition Implementation This is the
More informationThe Tower of Hanoi. Recursion Solution. Recursive Function. Time Complexity. Recursive Thinking. Why Recursion? n! = n* (n-1)!
The Tower of Hanoi Recursion Solution recursion recursion recursion Recursive Thinking: ignore everything but the bottom disk. 1 2 Recursive Function Time Complexity Hanoi (n, src, dest, temp): If (n >
More informationCOURSE TITLE COURSE DESCRIPTION
COURSE TITLE COURSE DESCRIPTION CS-00X COMPUTING EXIT INTERVIEW All graduating students are required to meet with their department chairperson/program director to finalize requirements for degree completion.
More informationCS 2302 Data Structures Spring 2015
1. General Information Instructor: CS 2302 Data Structures Spring 2015 Olac Fuentes Email: ofuentes@utep.edu Web: www.cs.utep.edu/ofuentes Office hours: Tuesdays and Thursdays 2:00-3:30, or by appointment,
More informationA tool to facilitate interactive and collaborative learning of execution flow and code for novice computer science students
Institution of Innovation, Design and Engineering A tool to facilitate interactive and collaborative learning of execution flow and code for novice computer science students Author: Robert Westerlund Examiner:
More informationMicrosoft Windows PowerShell v2 For Administrators
Course 50414B: Microsoft Windows PowerShell v2 For Administrators Course Details Course Outline Module 1: Introduction to PowerShell the Basics This module explains how to install and configure PowerShell.
More informationCS 2112 Spring 2014. 0 Instructions. Assignment 3 Data Structures and Web Filtering. 0.1 Grading. 0.2 Partners. 0.3 Restrictions
CS 2112 Spring 2014 Assignment 3 Data Structures and Web Filtering Due: March 4, 2014 11:59 PM Implementing spam blacklists and web filters requires matching candidate domain names and URLs very rapidly
More informationChapter 13 Disk Storage, Basic File Structures, and Hashing.
Chapter 13 Disk Storage, Basic File Structures, and Hashing. Copyright 2004 Pearson Education, Inc. Chapter Outline Disk Storage Devices Files of Records Operations on Files Unordered Files Ordered Files
More informationOracle Universal Content Management 10.1.3
Date: 2007/04/16-10.1.3 Oracle Universal Content Management 10.1.3 Document Management Quick Start Tutorial Oracle Universal Content Management 10.1.3 Document Management Quick Start Guide Page 1 Contents
More information