Writing for Computer Science 7. Algorithms 8. Editing 2008. 05. 23 Cho, Ho-Gi GNU OSLab.

Slides:



Advertisements
Similar presentations
CHAPTER 5 COMPLETING BUSINESS MESSAGES
Advertisements

Style for Special CS Components. Mathematics “Our confidence in any science is roughly proportional to the amount of mathematics it employs” (Bronowski.
Chapter 12 – Strategies for Effective Written Reports
Algorithms & Complexity
Word Tutorial 2: Editing and Formatting a Document
Revising Drafts© Dr. Ayman Abdel-Hamid, CS5014, Fall CS5014 Research Methods in CS Dr. Ayman Abdel-Hamid Computer Science Department Virginia Tech.
“Quick-Fix Workshop” Communications Centre. It isn’t over yet… Don’t finish when you finish your first copy. Editing is hard work because it demands a.
285 Final Project. Document Specification: Rough Draft Due April 10th Purpose: Purpose: Economy of effort Economy of effort Input from instructors and.
Analysis of Algorithms1 Estimate the running time Estimate the memory space required. Time and space depend on the input size.
Asymptotic Analysis Motivation Definitions Common complexity functions
Chapter 2 Web Site Design Principles Principles of Web Design, Third Edition.
Editing. Good Writers ~ Good Editors “The difference between a weak writer and a strong writer is often not the ability to write fluently, but the effort.
Cmpt-225 Simulation. Application: Simulation Simulation  A technique for modeling the behavior of both natural and human-made systems  Goal Generate.
Technical Writing Introduction What’s in store for you this semester.
Advanced Research Methodology
Algorithm analysis and design Introduction to Algorithms week1
An Introduction to Content Management. By the end of the session you will be able to... Explain what a content management system is Apply the principles.
The Writing Process: Revising, Editing and Proofreading.
Revising and Editing Checklist - Review
Welcome to the 3-day Workshop on > Presented by Saeid Abolfazli Faculty of Computer Science and IT University Malaya 23,24, and.
Writing Across the Curriculum Collins’ Writing. To develop successful, life-long writers, students must have: Opportunities to: write in many environments.
Algorithms Describing what you know. Contents What are they and were do we find them? Why show the algorithm? What formalisms are used for presenting.
Chapter 2 Web Site Design Principles
HU113: Technical Report Writing Prof. Dr. Abdelsamie Moet Fall 2012/13 Pharos University in Alexandria Faculty of Engineering Lecture 5: Preparation.
1 Computer Algorithms Lecture 3 Asymptotic Notation Some of these slides are courtesy of D. Plaisted, UNC and M. Nicolescu, UNR.
Report Writing Sylvia Corsham De Montfort University 2008/9 (in association with Vered Hawksworth BSc.)
Academic Essays & Report Writing
EE LECTURE 4 REPORT STRUCTURE AND COMPONENTS Electrical Engineering Dept King Saud University.
Organizing Your Information
Department of Computer Science 1 COSC 2320 Section Room 104 AH 5:30 – 7:00 PM TTh Professor Olin Johnson Office 596 PGH
Copyright © 2010 Pearson Education, Inc. publishing as Prentice HallChapter Writing and Completing Reports and Proposals.
The Office Procedures and Technology Chapter 4 Communicating in Written Form Copyright 2003 by South-Western, a division of Thomson Learning.
Algorithm Analysis (Algorithm Complexity). Correctness is Not Enough It isn’t sufficient that our algorithms perform the required tasks. We want them.
Algorithms & Flowchart
Algorithm Analysis CS 400/600 – Data Structures. Algorithm Analysis2 Abstract Data Types Abstract Data Type (ADT): a definition for a data type solely.
Thesis Statement-Examples
CSC – 332 Data Structures Generics Analysis of Algorithms Dr. Curry Guinn.
Mrs. Cole  A top-notch project includes four elements: Project Logbook Abstract Project Notebook (research report and forms ) Visual Display.
Data Structures Using C++ 2E
Report Technical Writing
Big-O. Algorithm Analysis Exact analysis: produce a function f(n) measuring how many basic steps are needed for a given inputs n On any input of size.
REVISING, EDITING & PROOFREADING
Revise Five Times (then proofread) Pointers on written assignments when you lack time The Five Revisions.
Written Presentations of Technical Subject Writing Guide vs. Term paper Writing style: specifics Editing Refereeing.
Asymptotic Notations By Er. Devdutt Baresary. Introduction In mathematics, computer science, and related fields, big O notation describes the limiting.
 Reading Quiz  Peer Critiques  Evaluating Peer Critiques.
TABLE OF CONTENTS 2014 BasmahAlQadheeb. What is a report? A report is a clearly structured document that presents information as clearly as possible.
Computational complexity The same problem can frequently be solved with different algorithms which differ in efficiency. Computational complexity is a.
Technical Reports ELEC422 Design II. Objectives To gain experience in the process of generating disseminating and sharing of technical knowledge in electrical.
CSE 3358 NOTE SET 2 Data Structures and Algorithms 1.
Report writing skills A Trade union training on research methodology, TMLC, Kisumu, Kenya 6-10 December 2010 Presentation by Mohammed Mwamadzingo,
Abstract  An abstract is a concise summary of a larger project (a thesis, research report, performance, service project, etc.) that concisely describes.
5-1 Chapter 5 – Completing Business Messages. Learning Objectives After studying this chapter, you will be able to: Discuss the value of careful revision.
Chapter 5 – Completing Business Messages
Preparation for Examination
Completing Reports and Proposals
Big-O notation.
What is an Algorithm? Algorithm Specification.
Literally means to “re-see”
Writing and Thinking.
Revising and editing Week 3.
Preparing Conference Papers (1)
Title of Poster in Arial, Bold, 48 Points
GEE’S Writing RULES.
Preparing Conference Papers (1)
Writing Part 2.
G.PULLAIAH COLLEGE OF ENGINEERING AND TECHNOLOGY
Engleski jezik struke 3 Sreda,
Chapter 8 Writing Formal Reports, Business Plans, and White Papers
Planning, Composing & Revising
Presentation transcript:

Writing for Computer Science 7. Algorithms 8. Editing Cho, Ho-Gi GNU OSLab

Writing for Computer Science 2 Contents 7. Algorithms  Presentation of algorithms  Formalisms  Level of detail  Figures  Environment of algorithms  Performance of algorithms  Asymptotic complexity 8. Editing  Consistency  Style  Proofreading  Choice of word-processor  An editing checklist

GNU OSLabWriting for Computer Science 3 Performance of algorithms  Basis of evaluation Where algorithms are being compared, specify not only the environment but also the criteria used for comparison. Are the algorithms being compared for functionality or speed? Is speed to be examined asymptotically or for typical data? Is the data real or synthetic? A comparison should have a realistic basis  Processing time Time depends on factors such as CPU speed, cache sizes, system load, and hardware dependencies such as prefetch strategy. Times based on a mathematical model rather than on experiment should be clearly indicated as such. 7. Algorithms

GNU OSLabWriting for Computer Science 4  Memory and disk requirements It is often possible to trade memory requirements against time, not only by choice of algorithm but also by changing the way disk is used and memory is accessed.  Disk and network traffic Because of the sophistication of current disk drives and the complexity of their interaction with CPU and OS, exact mathematical descriptions of algorithm behavior are unattainable; broad approximations are often the only manageable way of describing disk performance. 7. Algorithms

GNU OSLabWriting for Computer Science 5 Asymptotic complexity  Define : Big-O notation a function f(n) is said to be O(g(n))-that is, g(n) is an upper bound of f(n)-if for some constants c and k we have f(n) ≤ c·g(n) for all n>k to mean the complexity rather than an upper bound on the complexity  Define : Theta-Θ notation if f(n) is O(g(n)) and g(n) is O(f(n))  Define : Omega-Ω notation a function f(n) is said to be Ω(g(n))-that is, g(n) is an lower bound of f(n)-if for some constants c and k we have f(n) ≥ c·g(n) for all n>k to mean the complexity rather than an lower on the complexity 7. Algorithms n n2n2 logn x y

GNU OSLabWriting for Computer Science 6 8. Editing Thesis concepts background logical flow research or experiments editing The difference between a weak writer and a strong writer is often not the ability to write fluently, but the effort taken to diligently edit and revise. paper or publication paper or publication 8. Editing … …

GNU OSLabWriting for Computer Science 7 Consistency  Much of editing consists of checking the document for errors that fall under the heading of consistency (or lack of it). use the checklist on page 134 effective editing exercise is to pretend to be a reader  The ordering too may need to be reconsidered once the paper is complete  For many papers, then, editing leads to excision of text cutting will improve the quality edit for brevity and balance 8. Editing

GNU OSLabWriting for Computer Science 8 Style  Keep in mind the basic aim, which is to make the paper clear  Most journals have a preferred style for elements such as references, figure numbering, spelling, table layout, and capitalization. 8. Editing

GNU OSLabWriting for Computer Science 9 Proofreading  There is no excuse for a report that contains spelling errors displaying not only your inability to spell, but also your casual attitude  A common error of mine is, when intending to type a word, to instead type some other word that shares a few initial letters. “being” for begin”, “form” for “from”, “relation” for “relative”,….  Check for errors in tense and in number, that is, in the use of plural and singular form  Important to check the bibliography format should be consistent and each reference should include enough information to allow readers to locate it  avoid widows and orphans

GNU OSLabWriting for Computer Science 10 if the last line of a paragraph contains only a single, short word, that line is a widow when the last line prior to a heading is by itself at the top of a page, or a heading or the first line of the following paragraph are alone at the bottom of a page, that line is an orphan

GNU OSLabWriting for Computer Science 11 Choice of word-processor  The choice is dictated by availability, but also by how well the available word-processors cope with the demands of authoring.  Microsoft Word and Web page visual or WYSIWYG 1) style for first drafts  LaTex compiler style for technical writing 1) What you see is what you get