Best Practices: Coding Questions For Engineers

Size: px
Start display at page:

Download "Best Practices: Coding Questions For Engineers"

Transcription

1 For Work Best Practices: Coding Questions For Engineers Why Use Coding Questions? 1. Candidates write real working code (and not just pseudocode). 2. Code is evaluated automatically based on test cases of varying difficulty levels. 3. Code is also measured on space and time complexity. 4. You can playback the code to understand the thought process of candidates. 5. Candidates enjoy the overall hiring process while solving a real life challenge. Got a question? support@hackerrank.com 01

2 For Work Creating Coding Questions: 3 Simple Steps 1. Write a problem statement 2. Add code stubs 3. Add test cases 1. PROBLEM STATEMENT Here is a sample Problem Statement. Go through it once. We will refer it throughout this document. Image Problem Description 1. Variable naming convention: a. The variables in the problem statement must match those in the code stubs (to be specified in Step 2). If you refer to a variable in the problem statement as N, it should not be n in the code stubs. b. All variable names, function names etc. should be Italicized, e.g. Notice nonrepeated in the example above (Image 1). Got a question? support@hackerrank.com 02

3 For Work 2. Terminology Usage: A void ambiguity in the problem statement by being as specific as possible e.g. when you want to refer to a binary search tree, do not use tree or binary tree. 1.2 Sample Test Case With Explanation A sample test case, with input and expected output, is strongly recommended to clarify the problem statement to the candidates. This sample test case will be later used in step 3 (Add Test Case) to automate the code evaluation process. 1.3 Constraints Unless you expect candidates to figure out possible constraints of a problem, mention them for clarity. For example, 1. If the code has to read a number as an input, specify the range of that number. This will help candidate decide if int or long int or long long int has to be used. 2. If the input is a string, specify if special characters (like?,. ^%) are also present in the string. You can also specify if it contains consecutive spaces. 2. CODE STUBS 2.1 Set Languages HackerRank supports over 35 programming languages 1. You can choose the set of languages you want to enable for the candidates. 2.2 Add Code Stubs HackerRank helps generate boilerplate code that saves you time while setting up a coding question. This boilerplate code (a.k.a. code stubs) handles input/output in the code. Adding code stubs is strongly recommended as it helps prevent wastage of time for the candidates due to minor errors pertaining to the input/output format. The idea is to let them focus on the algorithm required to solve the problem and not let them worry about the input/output syntax. In the example above (Image 1), code reads a string as input and displays a string as output. So to generate the code stub, you will mention a function name, its input argument and its return type as shown below: 1 Some languages like Go, Groovy, Rust, R, Racket, XQuery, Octave, and Swift can be enabled from backend only. Write a mail to support@hackerrank.com. Got a question? support@hackerrank.com 03

4 For Work Image 2 Once done, click on Generate Code. You will notice a code stub for all the selected languages. Image 2 also shows you code stub generated for Python. 3. TEST CASES Test cases form the basis for automated evaluation of a candidate s code. 3.1 Evaluation A test case consists of an input to the code and an expected output. Once candidates submit the code, it is run against all the test cases. The output from the candidate s code is compared with the expected output to see whether the test case has passed or failed. Image 3 Got a question? support@hackerrank.com 04

5 For Work 3.2 Test Case Basics 1. Sample vs hidden test cases: You can mark a test case as a sample test case. This means that input and expected output are shown to the candidates. For hidden test cases (i.e. ones which are not sample), a candidate will be able to see if the test case passed or not, but will not be able to see the expected output. 2. Score: The overall score for a coding question is the sum of the scores of all the test cases which are successfully passed. You should create test cases of varying difficulty levels and assign points accordingly. This leads to better distinction between outstanding, good and average programmers. 3. Ensure that your input and expected output are in sync with the code stubs you have provided in step 2 (Add Code Stubs) Test Case Pro Tips 1. Use corner test cases e.g. a. a test case where only a single space is present, or b. a test case where only special characters are present in the string 2. You can upload a zip file of all the test cases, especially when input and/or output is too big. The input files in the zip are named input000.txt, input001.txt, & the output files are named output000.txt, output001.txt and so on. 3. Make sure the problem is solvable. Ideally, you should write solution code and check if it works for all the test cases within the specified time limit (see details here). As a rule of thumb, your code should execute in half of the time limit to provide a good buffer When You re Ready to Send a Test Ask the engineers in your team to try the coding question as well. This ensures: 1. Correctness and clarity of the coding question 2. Time provided for the solving the coding question is sufficient 3. Benchmark your internal engineers to your potential hires 2 Check Appendix B for more details Got a question? support@hackerrank.com 05

6 For Work Appendix A: Write Code From Scratch If you expect candidates to be familiar with the handling of input/output, you may choose not to generate any code stubs. Candidates will then have to write full code from scratch. To ensure a smooth candidate experience in this scenario, you will have to clearly specify your input and output format. For the given example: Appendix B: Sync Test Cases With Code Stubs When you are using autogenerated code stubs, ensure that your input and expected output are in sync with the code stubs provided in step 2 (Add Code Stubs). You can refer to the tail portion to understand this. For example: 1. If the input is an array, you will always read in n (denotes array_size) first and then read n array elements in n separate lines. This is required to ensure consistency in reading input across different languages. 2. If the input is a linked list, you will always read in n (denotes the number of elements to be added to the input linked list) and then read n elements in n separate lines. Got a question? support@hackerrank.com 06

TestOut Client Pro - English RELEASE NOTES. Modified

TestOut Client Pro - English RELEASE NOTES. Modified TestOut Client Pro - English 5.1.0 RELEASE NOTES Modified 2017-07-06 Contents Overview... 2 Version 5.1.0 Release... 2 Entire Course... 2 Text Lessons... 2 Exams and Quizzes... 2 Demos, Videos, and Simulations...

More information

TestOut Security Pro English RELEASE NOTES. Modified

TestOut Security Pro English RELEASE NOTES. Modified TestOut Security Pro English 6.0.2 RELEASE NOTES Modified 2018-05-01 Contents Overview... 2 Version 6.0.2 Release... 3 Version 6.0.1 Release... 4 Entire Course... 4 Text Lessons... 4 Exams and Quizzes...

More information

Cost of Your Programs

Cost of Your Programs Department of Computer Science and Engineering Chinese University of Hong Kong In the class, we have defined the RAM computation model. In turn, this allowed us to define rigorously algorithms and their

More information

Try typing the following in the Python shell and press return after each calculation. Write the answer the program displays next to the sums below.

Try typing the following in the Python shell and press return after each calculation. Write the answer the program displays next to the sums below. Name: Date: Instructions: PYTHON - INTRODUCTORY TASKS Open Idle (the program we will be using to write our Python codes). We can use the following code in Python to work out numeracy calculations. Try

More information

CS2223: Algorithms D- Term, Homework I. Teams: To be done individually. Due date: 03/27/2015 (1:50 PM) Submission: Electronic submission only

CS2223: Algorithms D- Term, Homework I. Teams: To be done individually. Due date: 03/27/2015 (1:50 PM) Submission: Electronic submission only CS2223: Algorithms D- Term, 2015 Homework I Teams: To be done individually Due date: 03/27/2015 (1:50 PM) Submission: Electronic submission only 1 General Instructions Python Code vs. Pseudocode: Each

More information

Table of Contents. Revision History. 1. Introduction Purpose Document Conventions Intended Audience and Reading Suggestions4

Table of Contents. Revision History. 1. Introduction Purpose Document Conventions Intended Audience and Reading Suggestions4 Software Requirements Specification for Python Checker Version 1.0 approved Prepared by Matthew Arnold, Seong, Ian Computer Science Team 4 February 4th 2015 Table of Contents Table of Contents Revision

More information

CSC324 Principles of Programming Languages

CSC324 Principles of Programming Languages CSC324 Principles of Programming Languages http://mcs.utm.utoronto.ca/~324 November 14, 2018 Today Final chapter of the course! Types and type systems Haskell s type system Types Terminology Type: set

More information

Algorithms and Problem Solving

Algorithms and Problem Solving Algorithms and Problem Solving Introduction What is an Algorithm? Algorithm Properties Example Exercises Unit 16 1 What is an Algorithm? What is an Algorithm? An algorithm is a precisely defined and ordered

More information

FME Certified Professional Guidelines and Processes

FME Certified Professional Guidelines and Processes Introduction This document is designed to help users meet the requirements for FME Certified Professional accreditation. Table of Contents Introduction... 1 Table of Contents... 1 General Guidelines...

More information

Algorithms. Chapter 8. Objectives After studying this chapter, students should be able to:

Algorithms. Chapter 8. Objectives After studying this chapter, students should be able to: Objectives After studying this chapter, students should be able to: Chapter 8 Algorithms Define an algorithm and relate it to problem solving. Define three construct and describe their use in algorithms.

More information

OOP Design Conclusions and Variations

OOP Design Conclusions and Variations CS108, Stanford Handout #20 Fall, 2008-09 Osvaldo Jiménez OOP Design Conclusions and Variations Thanks to Nick Parlante for much of this handout Part 1 -- Mainstream OOP Design First, we have the standard,

More information

TestOut PC Pro English RELEASE NOTES. Modified

TestOut PC Pro English RELEASE NOTES. Modified TestOut PC Pro English 6.0.3 RELEASE NOTES Modified 2019-03-19 Contents Overview... 2 Version 6.0.3 Release (19 March 2019)... 3 Version 6.0.2 Release (23 January 2019)... 4 Version 6.0.1 Release (16 January

More information

Database Design. 8-4 Drawing Conventions for Readability. Copyright 2015, Oracle and/or its affiliates. All rights reserved.

Database Design. 8-4 Drawing Conventions for Readability. Copyright 2015, Oracle and/or its affiliates. All rights reserved. 1 Database Design 8-4 Objectives This lesson covers the following objectives: Apply the Oracle drawing conventions to a data model diagram Identify high volume entities in a data model diagram and explain

More information

SU2017. LAB 1 (May 4/9) Introduction to C, Function Declaration vs. Definition, Basic I/O (scanf/printf, getchar/putchar)

SU2017. LAB 1 (May 4/9) Introduction to C, Function Declaration vs. Definition, Basic I/O (scanf/printf, getchar/putchar) SU2017. LAB 1 (May 4/9) Introduction to C, Function Declaration vs. Definition, Basic I/O (scanf/printf, getchar/putchar) 1 Problem A 1.1 Specification Write an ANSI-C program that reads input from the

More information

CSE 373 Winter 2009: Midterm #1 (closed book, closed notes, NO calculators allowed)

CSE 373 Winter 2009: Midterm #1 (closed book, closed notes, NO calculators allowed) Name: Email address: CSE 373 Winter 2009: Midterm #1 (closed book, closed notes, NO calculators allowed) Instructions: Read the directions for each question carefully before answering. We may give partial

More information

A. Generating sliding block puzzle child states

A. Generating sliding block puzzle child states CSCI 4150 Introduction to Artificial Intelligence, Fall 2004 Assignment 3 (132 points), out Thursday September 16, due Thursday September 30 Introduction This assignment is on A* search and solving sliding

More information

Writeup for first project of CMSC 420: Data Structures Section 0102, Summer Theme: Threaded AVL Trees

Writeup for first project of CMSC 420: Data Structures Section 0102, Summer Theme: Threaded AVL Trees Writeup for first project of CMSC 420: Data Structures Section 0102, Summer 2017 Theme: Threaded AVL Trees Handout date: 06-01 On-time deadline: 06-09, 11:59pm Late deadline (30% penalty): 06-11, 11:59pm

More information

Evaluating the Style of your programs

Evaluating the Style of your programs Evaluating the Style of your programs Objectives At the end of this exercise, students will: Roles Be able to evaluate a program for conformance to style guide for the class. Be able to evaluate arithmetic

More information

UEE1302 (1102) F10: Introduction to Computers and Programming

UEE1302 (1102) F10: Introduction to Computers and Programming Computational Intelligence on Automation Lab @ NCTU Learning Objectives UEE1302 (1102) F10: Introduction to Computers and Programming Programming Lecture 00 Programming by Example Introduction to C++ Origins,

More information

1.1 Create a New Survey: Getting Started. To create a new survey, you can use one of two methods: a) Click Author on the navigation bar.

1.1 Create a New Survey: Getting Started. To create a new survey, you can use one of two methods: a) Click Author on the navigation bar. 1. Survey Authoring Section 1 of this User Guide provides step-by-step instructions on how to author your survey. Surveys can be created using questions and response choices you develop; copying content

More information

University Program Office. Clarity - Quick Reference Guide Project and Portfolio Management Tool. Published - 14 September 2017 (Launch Version)

University Program Office. Clarity - Quick Reference Guide Project and Portfolio Management Tool. Published - 14 September 2017 (Launch Version) University Program Office Clarity - Quick Reference Guide Project and Portfolio Management Tool 1 Published - 14 September 2017 (Launch Version) Getting Started with Clarity To access Clarity click the

More information

Unit 6 Chapter 15 EXAMPLES OF COMPLEXITY CALCULATION

Unit 6 Chapter 15 EXAMPLES OF COMPLEXITY CALCULATION DESIGN AND ANALYSIS OF ALGORITHMS Unit 6 Chapter 15 EXAMPLES OF COMPLEXITY CALCULATION http://milanvachhani.blogspot.in EXAMPLES FROM THE SORTING WORLD Sorting provides a good set of examples for analyzing

More information

Once you see the screen below click on the MESA Dropbox

Once you see the screen below click on the MESA Dropbox The following provides instructions for uploading competition files to the online dropbox. The dropbox can be used to submit the following MESA competition components: Elementary School SCRATCH Interactive

More information

Australian Informatics Olympiad Thursday 23 August, Information Booklet

Australian Informatics Olympiad Thursday 23 August, Information Booklet Australian Informatics Olympiad Thursday 23 August, 2018 Information Booklet Information for Teachers and Students Contest Rules Why Did I Score Zero? Please read this booklet before the day of the contest

More information

LMS INTEGRATION RELEASE NOTES

LMS INTEGRATION RELEASE NOTES 1 LMS INTEGRATION RELEASE NOTES 2 Overview... 3 20190122 Release... 4 20190108 Release... 5 20181218 Release... 6 20181204 Release... 7 20181126 Release... 8 20181023 Release... 9 20181009 Release... 10

More information

Faster Sorting Methods

Faster Sorting Methods Faster Sorting Methods Chapter 9 Contents Merge Sort Merging Arrays Recursive Merge Sort The Efficiency of Merge Sort Iterative Merge Sort Merge Sort in the Java Class Library Contents Quick Sort The Efficiency

More information

EZCLOUD CONTENTS INTRODUCTION

EZCLOUD CONTENTS INTRODUCTION CONTENTS INTRODUCTION... 1 EZCLOUD REGISTRATION... 1 ACCOUNT SIGN UP... 2 ACCOUNT LOGIN... 3 EZCLOUD MANAGEMENT... 3 REGISTER CODE... 3 EZCLOUD WEB... 5 MY CLOUD DEVICES... 7 SHARED CLOUD DEVICES... 9

More information

Exchange Network Schema Conformance Report Preparation and Review Process

Exchange Network Schema Conformance Report Preparation and Review Process Exchange Network Schema Conformance Report Preparation and Review Process Version: 2.0a Revision Date: December 29, 2009 Prepared for: Network Technology Group Prepared by: Schema Review Task Force Document

More information

8 Algorithms 8.1. Foundations of Computer Science Cengage Learning

8 Algorithms 8.1. Foundations of Computer Science Cengage Learning 8 Algorithms 8.1 Foundations of Computer Science Cengage Learning 8.2 Objectives After studying this chapter, the student should be able to: Define an algorithm and relate it to problem solving. Define

More information

King Abdulaziz University Faculty of Computing and Information Technology Computer Science Department

King Abdulaziz University Faculty of Computing and Information Technology Computer Science Department King Abdulaziz University Faculty of Computing and Information Technology Computer Science Department CPCS204, 1 st Term 2014 Program 1: FCIT Baqalah Assigned: Monday, February 10 th, 2014 Due: Thursday,

More information

Introduction 3 Account Access 3 Getting Acquainted 3 Home Tab (Dashboard) 3 Recordings Tab 4 Recorded Calls 5 Calls In Progress 7

Introduction 3 Account Access 3 Getting Acquainted 3 Home Tab (Dashboard) 3 Recordings Tab 4 Recorded Calls 5 Calls In Progress 7 Contents Introduction 3 Account Access 3 Getting Acquainted 3 Home Tab (Dashboard) 3 Recordings Tab 4 Recorded Calls 5 Calls In Progress 7 2 P age Introduction This guide provides information about the

More information

Textbook. Topic 6: Functions. Motivation. What is a Function? What s a function? How can we use functions to write better software?

Textbook. Topic 6: Functions. Motivation. What is a Function? What s a function? How can we use functions to write better software? Textbook Topic 6: Functions What s a? How can we use s to write better software? Strongly Recommended Exercises The Python Workbook: 85, 86, 98 and 103 Recommended Exercises The Python Workbook: 84, 88,

More information

How to use People Admin Creating Staff Postings. How to Create Staff Postings How to Select Applicants for interview 25 26

How to use People Admin Creating Staff Postings. How to Create Staff Postings How to Select Applicants for interview 25 26 How to use People Admin Creating Staff Postings Index Page How to Create Staff Postings 2 24 How to Select Applicants for interview 25 26 How to Recommend a Candidate for Hire 27 How to Complete Hiring

More information

1 DOMjudge Overview Scoreboard... 2

1 DOMjudge Overview Scoreboard... 2 Contents 1 DOMjudge 2 1.1 Overview................................................. 2 1.2 Scoreboard................................................ 2 2 Solving a Problem 3 2.1 Reading the Problem Statement....................................

More information

SCIENTIFIC AND INDUSTRIAL BENCHMARKING SYSTEM

SCIENTIFIC AND INDUSTRIAL BENCHMARKING SYSTEM SCIENTIFIC AND INDUSTRIAL BENCHMARKING SYSTEM Anđelko KATALENIĆ, Tihomir ŽILIĆ, Željko ŠITUM, Josip KASAĆ Department of Control Engineering Faculty of Mechanical Engineering and Naval Architecture Ivana

More information

Exercise 1: Tail Sum of Squares (2 points) Homework 3 READ THIS BEFORE YOU BEGIN:

Exercise 1: Tail Sum of Squares (2 points) Homework 3 READ THIS BEFORE YOU BEGIN: built on 2018/05/14 at 09:29:40 Data Structures & Algorithms (Term III/2017 18) due: thu may 17 @ 11:59pm This assignment contains both a coding portion and a written portion. The aim of this assignment

More information

ECE264 Fall 2013 Exam 1, September 24, 2013

ECE264 Fall 2013 Exam 1, September 24, 2013 ECE264 Fall 2013 Exam 1, September 24, 2013 In signing this statement, I hereby certify that the work on this exam is my own and that I have not copied the work of any other student while completing it.

More information

CSCE 310 Assignment 3 Summer 2018

CSCE 310 Assignment 3 Summer 2018 Name(s) CSE Login Programming Language(s) Used Question Points Score 1 10 2 10 3 20 4 5 5 5 6 10 7 20 8 120 Total: 200 Graders Notes: Instructions Follow instructions carefully, failure to do so may result

More information

CSCE150A. Administrivia. Overview. Hardware. Software. Example. Program. Pseudocode. Flowchart. Control Structures. Hello World Program CSCE150A

CSCE150A. Administrivia. Overview. Hardware. Software. Example. Program. Pseudocode. Flowchart. Control Structures. Hello World Program CSCE150A Computer Science & Engineering 150A Problem Solving Using Computers Lecture 01 - Course Introduction Stephen Scott (Adapted from Christopher M. Bourke) Roll Syllabus Course Webpage: http://cse.unl.edu/~sscott/teach/classes/cse150af09/

More information

Computer Science & Engineering 150A Problem Solving Using Computers

Computer Science & Engineering 150A Problem Solving Using Computers Computer Science & Engineering 150A Problem Solving Using Computers Lecture 01 - Course Introduction Stephen Scott (Adapted from Christopher M. Bourke) 1 / 43 Fall 2009 Roll Syllabus Course Webpage: http://cse.unl.edu/~sscott/teach/classes/cse150af09/

More information

Lab 4 Prelab: MIPS Function Calls

Lab 4 Prelab: MIPS Function Calls Lab 4 Prelab: MIPS Function Calls Name: Sign the following statement: On my honor, as an Aggie, I have neither given nor received unauthorized aid on this academic work 1 Objective The main objective of

More information

CPSC 311, 2010W1 Midterm Exam #2

CPSC 311, 2010W1 Midterm Exam #2 CPSC 311, 2010W1 Midterm Exam #2 2010/11/02 Page 1 of 18 CPSC 311, 2010W1 Midterm Exam #2 Name: Q1: 20 Student ID: Q2: 20 Signature (required; indicates agreement with rules below): Q3: 20 Q4: 20 Q5: 20

More information

Table of Contents. Cisco IP Addressing and Subnetting for New Users

Table of Contents. Cisco IP Addressing and Subnetting for New Users Table of Contents IP Addressing and Subnetting for New Users...1 Document ID: 13788...1 Introduction...1 Prerequisites...1 Requirements...1 Components Used...1 Additional Information...1 Conventions...2

More information

USER'S GUIDE. SUNY College at Plattsburgh Online Hiring System. November PeopleAdmin, Inc. 816 Congress Ave Suite 1800 Austin, TX

USER'S GUIDE. SUNY College at Plattsburgh Online Hiring System. November PeopleAdmin, Inc. 816 Congress Ave Suite 1800 Austin, TX USER'S GUIDE November 2008 SUNY College at Plattsburgh Online Hiring System PeopleAdmin, Inc. 816 Congress Ave Suite 1800 Austin, TX 78701-2482 TABLE OF CONTENTS INTRODUCTION... 3 GETTING STARTED... 4

More information

King Abdulaziz University Faculty of Computing and Information Technology Computer Science Department

King Abdulaziz University Faculty of Computing and Information Technology Computer Science Department King Abdulaziz University Faculty of Computing and Information Technology Computer Science Department CPCS204, 1 st Term 2014 Program 2: FCIT Baqalah Assigned: Thursday, September 26 th, 2013 Due: Wednesday,

More information

Introduction. Do you have any difficulty in choosing an ideal mobile phone?

Introduction. Do you have any difficulty in choosing an ideal mobile phone? IT Prefects Team Newsletter Vol.1 Introduction Do you have any difficulty in choosing an ideal mobile phone? Nowadays, using Smartphones has become a new trend in our society. Smartphones are not only

More information

DOWNLOAD PDF LINKED LIST PROGRAMS IN DATA STRUCTURE

DOWNLOAD PDF LINKED LIST PROGRAMS IN DATA STRUCTURE Chapter 1 : What is an application of linear linked list data structures? - Quora A linked list is a linear data structure, in which the elements are not stored at contiguous memory locations. The elements

More information

A Walkthrough of the Learning Aids

A Walkthrough of the Learning Aids x Walkthrough A Walkthrough of the Learning Aids The pedagogical elements in this book work together to focus on and reinforce key concepts and fundamental principles of programming, with additional tips

More information

CS2110 Assignment 2 Lists, Induction, Recursion and Parsing, Summer

CS2110 Assignment 2 Lists, Induction, Recursion and Parsing, Summer CS2110 Assignment 2 Lists, Induction, Recursion and Parsing, Summer 2008 Due Thursday July 3, 2008, 6:00PM 0 General Instructions 0.1 Purpose This assignment will help you solidify your knowledge of Java

More information

iems Interactive Experiment Management System Final Report

iems Interactive Experiment Management System Final Report iems Interactive Experiment Management System Final Report Pēteris Ņikiforovs Introduction Interactive Experiment Management System (Interactive EMS or iems) is an experiment management system with a graphical

More information

Algorithm must complete after a finite number of instructions have been executed. Each step must be clearly defined, having only one interpretation.

Algorithm must complete after a finite number of instructions have been executed. Each step must be clearly defined, having only one interpretation. Algorithms 1 algorithm: a finite set of instructions that specify a sequence of operations to be carried out in order to solve a specific problem or class of problems An algorithm must possess the following

More information

CS 450 Exam 2 Mon. 11/7/2016

CS 450 Exam 2 Mon. 11/7/2016 CS 450 Exam 2 Mon. 11/7/2016 Name: Rules and Hints You may use one handwritten 8.5 11 cheat sheet (front and back). This is the only additional resource you may consult during this exam. No calculators.

More information

COMPUTER SCIENCE TRIPOS

COMPUTER SCIENCE TRIPOS CST.2011.3.1 COMPUTER SCIENCE TRIPOS Part IB Monday 6 June 2011 1.30 to 4.30 COMPUTER SCIENCE Paper 3 Answer five questions. Submit the answers in five separate bundles, each with its own cover sheet.

More information

Unit 1: Working With Tables

Unit 1: Working With Tables Unit 1: Working With Tables Unit Overview This unit covers the basics of working with Tables and the Table wizard. It does not include working with fields, which is covered in Units 3 and 4. It is divided

More information

Homework 1 (a and b) Convex Sets and Convex Functions

Homework 1 (a and b) Convex Sets and Convex Functions Homework 1 (a and b) Convex Sets and Convex Functions CMU 10-725/36-725: Convex Optimization (Fall 2017) OUT: Sep 1 DUE: Prob 1-3 Sep 11, 5:00 PM; Prob 4 Sep 15, 5:00 PM START HERE: Instructions Collaboration

More information

Chapter 2. Designing a Program. Input, Processing, and Output Fall 2016, CSUS. Chapter 2.1

Chapter 2. Designing a Program. Input, Processing, and Output Fall 2016, CSUS. Chapter 2.1 Chapter 2 Input, Processing, and Output Fall 2016, CSUS Designing a Program Chapter 2.1 1 Algorithms They are the logic on how to do something how to compute the value of Pi how to delete a file how to

More information

Chapter 6: Functions

Chapter 6: Functions Chapter 6: Functions 6.1 Modular Programming Modular Programming Modular programming: breaking a program up into smaller, manageable functions or modules Function: a collection of statements to perform

More information

LMS INTEGRATION RELEASE NOTES

LMS INTEGRATION RELEASE NOTES 1 LMS INTEGRATION RELEASE NOTES 2 Overview... 3 20190416 Release... 4 20190402 Release... 5 20190320 Release... 6 20190306 Release... 7 20190205 Release... 8 20190122 Release... 9 20190108 Release... 10

More information

Module 16. Software Reuse. Version 2 CSE IIT, Kharagpur

Module 16. Software Reuse. Version 2 CSE IIT, Kharagpur Module 16 Software Reuse Lesson 39 Basic Ideas on Software Reuse Specific Instructional Objectives At the end of this lesson the student would be able to: Explain the advantages of software reuse. Identify

More information

ENGI 4892: Data Structures Assignment 2 SOLUTIONS

ENGI 4892: Data Structures Assignment 2 SOLUTIONS ENGI 4892: Data Structures Assignment 2 SOLUTIONS Due May 30 in class at 1:00 Total marks: 50 Notes: You will lose marks for giving only the final answer for any question on this assignment. Some steps

More information

INSTRUCTIONS for PLANNING RECOMMENDATIONS in TracDat Program Level

INSTRUCTIONS for PLANNING RECOMMENDATIONS in TracDat Program Level INSTRUCTIONS for PLANNING RECOMMENDATIONS in TracDat Program Level Table of Contents Introduction to TracDat... 2 Background... 2 Logging into TracDat... 2 Definitions... 2 Recommendations... 3 TracDat

More information

HIRING MANAGER S USER S GUIDE

HIRING MANAGER S USER S GUIDE HIRING MANAGER S USER S GUIDE Northern Kentucky University Hiring System PeopleAdmin, Inc. 1717 W. 6 th Street Austin, TX 78703 512-997-2500 TABLE OF CONTENTS INTRODUCTION... 3 GETTING STARTED... 4 jobs.nku.edu/hr...

More information

Chapter 1. Introduction to Computers and Programming. M hiwa ahmad aziz

Chapter 1. Introduction to Computers and Programming.   M hiwa ahmad aziz . Chapter 1 Introduction to Computers and Programming www.raparinweb.com M hiwa ahmad aziz 1 Ch 1 - Introduction to Computers and Programming Hardware Terminology Main Memory Auxiliary Memory Drives Writing

More information

Problem Set 2. Problem 2-1.

Problem Set 2. Problem 2-1. Introduction to Algorithms: 6.006 Massachusetts Institute of Technology September 15, 2011 Professors Erik Demaine and Srini Devadas Problem Set 2 Problem Set 2 Both theory and programming questions are

More information

Computer Science Foundation Exam. Dec. 19, 2003 COMPUTER SCIENCE I. Section I A. No Calculators! KEY

Computer Science Foundation Exam. Dec. 19, 2003 COMPUTER SCIENCE I. Section I A. No Calculators! KEY Computer Science Foundation Exam Dec. 19, 2003 COMPUTER SCIENCE I Section I A No Calculators! Name: KEY SSN: Score: 50 In this section of the exam, there are Three (3) problems You must do all of them.

More information

Program Verification! Goals of this Lecture! Words from the Wise! Testing!

Program Verification! Goals of this Lecture! Words from the Wise! Testing! Words from the Wise Testing On two occasions I have been asked [by members of Parliament], Pray, Mr. Babbage, if you put into the machine wrong figures, will the right answers come out? I am not able rightly

More information

Programming II (CS300)

Programming II (CS300) 1 Programming II (CS300) Chapter 01: Procedural Programming MOUNA KACEM mouna@cs.wisc.edu Fall 2018 Procedural Programming 2 Introduction Procedural Programming: General Overview Procedural Programming:

More information

Introduction to Computer Engineering (E114)

Introduction to Computer Engineering (E114) Introduction to Computer Engineering (E114) Lab 7: Floating-Point Addition Introduction In this lab, you will write a MIPS assembly language function that performs floatingpoint addition You will then

More information

CSE 332 Spring 2014: Midterm Exam (closed book, closed notes, no calculators)

CSE 332 Spring 2014: Midterm Exam (closed book, closed notes, no calculators) Name: Email address: Quiz Section: CSE 332 Spring 2014: Midterm Exam (closed book, closed notes, no calculators) Instructions: Read the directions for each question carefully before answering. We will

More information

Assembly labs start this week. Don t forget to submit your code at the end of your lab section. Download MARS4_5.jar to your lab PC or laptop.

Assembly labs start this week. Don t forget to submit your code at the end of your lab section. Download MARS4_5.jar to your lab PC or laptop. CSC258 Week 10 Logistics Assembly labs start this week. Don t forget to submit your code at the end of your lab section. Download MARS4_5.jar to your lab PC or laptop. Quiz review A word-addressable RAM

More information

Computer Components. Software{ User Programs. Operating System. Hardware

Computer Components. Software{ User Programs. Operating System. Hardware Computer Components Software{ User Programs Operating System Hardware What are Programs? Programs provide instructions for computers Similar to giving directions to a person who is trying to get from point

More information

CSE 332: Data Structures & Parallelism Lecture 10:Hashing. Ruth Anderson Autumn 2018

CSE 332: Data Structures & Parallelism Lecture 10:Hashing. Ruth Anderson Autumn 2018 CSE 332: Data Structures & Parallelism Lecture 10:Hashing Ruth Anderson Autumn 2018 Today Dictionaries Hashing 10/19/2018 2 Motivating Hash Tables For dictionary with n key/value pairs insert find delete

More information

Object Oriented Programming

Object Oriented Programming Object Oriented Programming Objectives To review the concepts and terminology of object-oriented programming To discuss some features of objectoriented design 1-2 Review: Objects In Java and other Object-Oriented

More information

Smart Serial. Show interfaces. Shut down. logging synchronous

Smart Serial. Show interfaces. Shut down. logging synchronous SEMESTER 2 Chapter 2 Static Networking V 4.0 2.1.1 What are the primary responsibilities of the router? 2.1.3 What is the first serial connector described called at the router end? What is the first serial

More information

Project 5 (Kd-Trees) Clarifications and Hints 1 / 14

Project 5 (Kd-Trees) Clarifications and Hints 1 / 14 Project 5 (Kd-Trees) Clarifications and Hints 1 / 14 Prologue Project goal: create a symbol table data type whose keys are two-dimensional points The zip file (http://www.swamiiyer.net/cs210/project5.zip)

More information

Functional abstraction. What is abstraction? Eating apples. Readings: HtDP, sections Language level: Intermediate Student With Lambda

Functional abstraction. What is abstraction? Eating apples. Readings: HtDP, sections Language level: Intermediate Student With Lambda Functional abstraction Readings: HtDP, sections 19-24. Language level: Intermediate Student With Lambda different order used in lecture section 24 material introduced much earlier sections 22, 23 not covered

More information

Functional abstraction

Functional abstraction Functional abstraction Readings: HtDP, sections 19-24. Language level: Intermediate Student With Lambda different order used in lecture section 24 material introduced much earlier sections 22, 23 not covered

More information

Functional Programming Mid-term exam Tuesday 3/10/2017

Functional Programming Mid-term exam Tuesday 3/10/2017 Functional Programming Mid-term exam Tuesday 3/10/2017 Name: Student number: Before you begin: Do not forget to write down your name and student number above. If necessary, explain your answers in English.

More information

STEAM Clown Productions. Python lab. Binary Register. STEAM Clown & Productions Copyright 2017 STEAM Clown. Page 1

STEAM Clown Productions. Python lab. Binary Register. STEAM Clown & Productions Copyright 2017 STEAM Clown. Page 1 Python lab Binary Register Page 1 Copyright 2017 Overview Introduction Task: Get an input string from the user in the form of 1 s and 0 s and convert it to a list of Integers, and then an actual binary

More information

Family Treatment Court Certification

Family Treatment Court Certification Family Treatment Court Certification Application Instructions December 2, 2016 Why Certify? State funding Certification is Required by O.C.G.A. 15-11-70 to receive state funding. Improve court functioning

More information

HUMAN RESOURCES USER S GUIDE

HUMAN RESOURCES USER S GUIDE HUMAN RESOURCES USER S GUIDE for the Rensselaer Polytechnic Institute Hiring System PeopleAdmin, Inc. 816 Congress Avenue Suite 1800 Austin, TX 78701-2482 512-997-2500 Copyright 2003 PeopleAdmin, Inc.

More information

Programming Exercise 3: Multi-class Classification and Neural Networks

Programming Exercise 3: Multi-class Classification and Neural Networks Programming Exercise 3: Multi-class Classification and Neural Networks Machine Learning Introduction In this exercise, you will implement one-vs-all logistic regression and neural networks to recognize

More information

Testing! The material for this lecture is drawn, in part, from! The Practice of Programming (Kernighan & Pike) Chapter 6!

Testing! The material for this lecture is drawn, in part, from! The Practice of Programming (Kernighan & Pike) Chapter 6! Testing The material for this lecture is drawn, in part, from The Practice of Programming (Kernighan & Pike) Chapter 6 1 Goals of this Lecture Help you learn about: Internal testing External testing General

More information

CS 445: Data Structures Final Examination: Study Guide

CS 445: Data Structures Final Examination: Study Guide CS 445: Data Structures Final Examination: Study Guide Java prerequisites Classes, objects, and references Access modifiers Arguments and parameters Garbage collection Self-test questions: Appendix C Designing

More information

CS Sorting Terms & Definitions. Comparing Sorting Algorithms. Bubble Sort. Bubble Sort: Graphical Trace

CS Sorting Terms & Definitions. Comparing Sorting Algorithms. Bubble Sort. Bubble Sort: Graphical Trace CS 704 Introduction to Data Structures and Software Engineering Sorting Terms & Definitions Internal sorts holds all data in RAM External sorts use Files Ascending : Low to High Descending : High to Low

More information

Welcome to Starting Out with Programming Logic and Design, Third Edition.

Welcome to Starting Out with Programming Logic and Design, Third Edition. Welcome to Starting Out with Programming Logic and Design, Third Edition. This book uses a language-independent approach to teach programming concepts and problem-solving skills, without assuming any previous

More information

Assignment 6: The Power of Caches

Assignment 6: The Power of Caches Assignment 6: The Power of Caches Due by: April 20, 2018 before 10:00 pm Collaboration: Individuals or Registered Pairs (see Piazza). It is mandatory for every student to register on Piazza. Grading: Packaging

More information

Integer Representation

Integer Representation Integer Representation Representation of integers: unsigned and signed Modular arithmetic and overflow Sign extension Shifting and arithmetic Multiplication Casting 1 Fixed- width integer encodings Unsigned

More information

The Lokalize Handbook. Nick Shaforostoff

The Lokalize Handbook. Nick Shaforostoff Nick Shaforostoff 2 Contents 1 Introduction 5 2 Editor 6 2.1 Main Window........................................ 6 2.2 Toolbars........................................... 7 2.3 Shortcut keys........................................

More information

ToyBox Futuristi Instruction Manual

ToyBox Futuristi Instruction Manual ToyBox Futuristi Instruction Manual Contents Welcome to ToyBox Futuristi... 2 What can you do with this software?... 2 The Instructional Video... 2 Installing the software... 3 Windows... 3 Mac... 3 The

More information

One of Mike s early tests cases involved the following code, which produced the error message about something being really wrong:

One of Mike s early tests cases involved the following code, which produced the error message about something being really wrong: Problem 1 (3 points) While working on his solution to project 2, Mike Clancy encountered an interesting bug. His program includes a LineNumber class that supplies, among other methods, a constructor that

More information

Project #1 Computer Science 2334 Fall 2008

Project #1 Computer Science 2334 Fall 2008 Project #1 Computer Science 2334 Fall 2008 User Request: Create a Word Verification System. Milestones: 1. Use program arguments to specify a file name. 10 points 2. Use simple File I/O to read a file.

More information

This sheet must be the cover page for every programming assignment. Total

This sheet must be the cover page for every programming assignment. Total This sheet must be the cover page for every programming assignment. Name Joe Student Assignment Title May the Greatest Integer Win (do not write below this line; for grader use only) Validity (up to 70%)

More information

JSON - Overview JSon Terminology

JSON - Overview JSon Terminology Announcements Introduction to Database Systems CSE 414 Lecture 12: Json and SQL++ Office hours changes this week Check schedule HW 4 due next Tuesday Start early WQ 4 due tomorrow 1 2 JSON - Overview JSon

More information

Array Basics: Outline. Creating and Accessing Arrays. Creating and Accessing Arrays. Arrays (Savitch, Chapter 7)

Array Basics: Outline. Creating and Accessing Arrays. Creating and Accessing Arrays. Arrays (Savitch, Chapter 7) Array Basics: Outline Arrays (Savitch, Chapter 7) TOPICS Array Basics Arrays in Classes and Methods Programming with Arrays Searching and Sorting Arrays Multi-Dimensional Arrays Static Variables and Constants

More information

CMSC 201 Spring 2017 Project 1 Number Classifier

CMSC 201 Spring 2017 Project 1 Number Classifier CMSC 201 Spring 2017 Project 1 Number Classifier Assignment: Project 1 Number Classifier Due Date: Design Document: Saturday, March 11th, 2017 by 8:59:59 PM Project: Friday, March 17th, 2017 by 8:59:59

More information

CSE 252A Computer Vision Homework 3 Instructor: Ben Ochoa Due : Monday, November 21, 2016, 11:59 PM

CSE 252A Computer Vision Homework 3 Instructor: Ben Ochoa Due : Monday, November 21, 2016, 11:59 PM CSE 252A Computer Vision Homework 3 Instructor: Ben Ochoa Due : Monday, November 21, 2016, 11:59 PM Instructions: Homework 3 has to be submitted in groups of 3. Review the academic integrity and collaboration

More information

LECTURE 06 FUNCTIONS

LECTURE 06 FUNCTIONS PowerPoint Slides adapted from *Starting Out with C++: From Control Structures through Objects, 7/E* by *Tony Gaddis* Copyright 2012 Pearson Education Inc. COMPUTER PROGRAMMING LECTURE 06 FUNCTIONS IMRAN

More information

Recursion. Chapter 7. Copyright 2012 by Pearson Education, Inc. All rights reserved

Recursion. Chapter 7. Copyright 2012 by Pearson Education, Inc. All rights reserved Recursion Chapter 7 Contents What Is Recursion? Tracing a Recursive Method Recursive Methods That Return a Value Recursively Processing an Array Recursively Processing a Linked Chain The Time Efficiency

More information