B.31 Specification for program ntree (Document ES7)

Size: px
Start display at page:

Download "B.31 Specification for program ntree (Document ES7)"

Transcription

1 ISERN B.31 Specification for program ntree (Document ES7) B.31 Specification for program ntree (Document ES7) Name ntree Functions for managing a tree Usage ntree input-file Description ntree reads commands from a file and processes them in order to test a few functions. Considered together, the functions implement a tree in which each node can have any number of child nodes. The number of children is not limited by the program. A node holds two strings (key, content). Options None. Input Data Only the following commands are allowed in the input files. Each command must start on a new line. Lower and upper case is relevant in the keys. The separator between commands and arguments is a space; this means that spaces may not appear within a string. In this implementation, command lines (command plus corresponding parameters) read from the file are limited to a maximum length of root <key> <content> Creates and initializes the root of the tree. This command must be the first command in the input file. If it does not appear as the first command, or if the command is repeated, the behavior of the program is not defined. child <father-key> <child-key> <child-content> Attaches the new child node with the given data onto the given father node. If the father node is not found in the tree, a corresponding error message is printed. If the key of the father-node appears more than once in the tree, the new child is attached to the first node found (see also search below). search <key> The tree is searched for the node with the key <key>. The tree is searched from left to right using depth-first search, in which the key of a node is checked on the first visit (preorder traversal). If the node with the given key is found, the contents are printed out; if not, a corresponding error message is printed. If multiple nodes have the same key, only the contents of the first one found are printed. sibs <key1> <key2> Tests whether the nodes with the given keys are siblings; i.e., whether they share the same father node. If one or the other key is not found in the tree, a corresponding error message is printed. Every node counts as its own sibling. See also search for a description of the search method. 108 An Empirical Evaluation of Three Defect-Detection Techniques

2 B.31 Specification for program ntree (Document ES7) ISERN print Prints out the complete contents of the tree. A new line is printed for each node with the key, content, and the depth in the tree. Each line is indented to correspond with the depth of the node (4 blanks per level). Example Because the output of the program as presented here was formatted by a typesetting program, the indentation shown here may not correspond exactly with the actual indentation. % cat eingabe root Lamb SE:_Planning_for_Change child Lamb Rombach Software_Specifications child Lamb Brackett Software_Requirements child Rombach Parnas Predicate_Logic_for_SE print % ntree eingabe Eingabedatei eingabe wird bearbeitet. Die Zeile root Lamb SE:_Planning_for_Change wird ausgewertet: Die Zeile child Lamb Rombach Software_Specifications wird ausgewertet: Die Zeile child Lamb Brackett Software_Requirements wird ausgewertet: Die Zeile child Rombach Parnas Predicate_Logic_for_SE wird ausgewertet: Die Zeile print wird ausgewertet: Knoten (Ebene 0): Schluessel Lamb, Inhalt SE:_Planning_for_Change Knoten (Ebene 1): Schluessel Rombach, Inhalt Software_Specifications Knoten (Ebene 2): Schluessel Parnas, Inhalt Predicate_Logic_for_SE Knoten (Ebene 1): Schluessel Brackett, Inhalt Software_Requirements Ende der Eingabedatei eingabe. Author Ch. Lott Bugs The functionality for reading files is only for test purposes and is therefore not especially faulttolerant. For example, one can assume that incorrectly spelled commands, commands with missing arguments, or commands with too many arguments will not be handled especially carefully. An Empirical Evaluation of Three Defect-Detection Techniques 109

3 ISERN B.32 Supplement Code reading and ntree (Document E17) B.32 Supplement Code reading and ntree (Document E17) This is the supplemental sheet for the program ntree and technique code reading. Brief description of the library functions used assert(expression) Macro that expects the expression to be true at the time the program is executed and in that case does nothing. Otherwise an error message with the expression is printed and the program is ended. char* malloc(unsigned size) Returns a pointer to a block of memory that is at least as large as size bytes. In case of failure, NULL is returned. int free(ptr) Gives a previously allocated block back to the system. ptr must have been allocated using malloc or a similar function. If successful, 1 is returned; otherwise 0 is returned. int strcmp(s1,s2) Compares two strings. Returns a value greater than, equal to, or less than 0 depending on whether st1 is lexicographically (i.e., ASCII value) greater than, equal, or less than s2. void bcopy(b1,b2,length) Copies length bytes from string b1 to stringb2. Overlapping strings are treated correctly. int sscanf(s,format,pointer) Reads characters from string s, converts them according to the specification string format, and writes the result into the variables pointed to by the pointers. This is the reverse function of printf; the format specification strings are identical. char *fgets(s,n,stream) Reads characters from the stream stream and writes them in the string s, until either n-1 characters have been read or one of NEWLINE or EOF are seen. At EOF the value NULL is returned, otherwise s. char *strdup(s1) Duplicates the string s1. Allocates memory for this purpose using malloc() and returns a pointer to the duplicate if successful, otherwise NULL. Reminder Don t produce any abstractions for the test-scaffold functions. 110 An Empirical Evaluation of Three Defect-Detection Techniques

4 B.33 Supplement Functional testing and ntree (Document E27) ISERN B.33 Supplement Functional testing and ntree (Document E27) This is the supplemental sheet for the program ntree and technique functional testing. Necessary inputs Which documents belong to this exercise? 1. Document ES7, the specification of the component 2. Document EQ7, the source code of the component, which you will receive after you have written test cases and diagnosed failures. How do I fetch the files which I need? Do the following: 1. First create a new directory for this exercise with the mkdir command. mkdir ft-ntree 2. Then change to the new directory with the cd command. cd ft-ntree 3. Finally, enter the following command: path tar xf prakt00/exercise5/ft-ntree.tar What should I have? The following files must be available. Makefile ntree run-suite test-dir Creating equivalence classes and test cases The test scaffolding offers commands and their parameters to simplify addressing the program s functions. Do not create equivalence classes for syntactically incorrect commands! That would only test the test scaffolding. Examples of unnecessary test cases: delete all Command not defined. sibs Brackett Second parameter is missing. Reminder Make sure that your test cases generate output so that you can detect failures! An Empirical Evaluation of Three Defect-Detection Techniques 111

5 ISERN B.33 Supplement Functional testing and ntree (Document E27) Document E27, page 2: To be given out with the code! Brief description of the library functions used assert(expression) Macro that expects the expression to be true at the time the program is executed and in that case does nothing. Otherwise an error message with the expression is printed and the program is ended. char* malloc(unsigned size) Returns a pointer to a block of memory that is at least as large as size bytes. In case of failure, NULL is returned. int free(ptr) Gives a previously allocated block back to the system. ptr must have been allocated using malloc or a similar function. If successful, 1 is returned; otherwise 0 is returned. int strcmp(s1,s2) Compares two strings. Returns a value greater than, equal to, or less than 0 depending on whether st1 is lexicographically (i.e., ASCII value) greater than, equal, or less than s2. void bcopy(b1,b2,length) Copies length bytes from string b1 to stringb2. Overlapping strings are treated correctly. int sscanf(s,format,pointer) Reads characters from string s, converts them according to the specification string format, and writes the result into the variables pointed to by the pointers. This is the reverse function of printf; the format specification strings are identical. char *fgets(s,n,stream) Reads characters from the stream stream and writes them in the string s, until either n-1 characters have been read or one of NEWLINE or EOF are seen. At EOF the value NULL is returned, otherwise s. char *strdup(s1) Duplicates the string s1. Allocates memory for this purpose using malloc() and returns a pointer to the duplicate if successful, otherwise NULL. 112 An Empirical Evaluation of Three Defect-Detection Techniques

6 B.34 Supplement Structural testing and ntree (Document E37) ISERN B.34 Supplement Structural testing and ntree (Document E37) This is the supplemental sheet for the program ntree and technique structural testing. This exercise primarily tests several C functions. To save you time and effort in this exercise, a test scaffold was created. The driver functions required for this scaffold are in the precompiled file driver.o and are bound in at link time. The drivers take care of function such as testing for and opening input files, allocating necessary memory, etc. See also the notes about one visible driver function that appear below. Necessary inputs Which documents belong to this exercise? 1. Document ES7, the specification of the component, which you will receive after you have created test cases and attempted to reach 100% coverage. 2. Document EQ7, the source code of the component How do I fetch the files which I need? Do the following: 1. First create a new directory for this exercise with the mkdir command. mkdir st-ntree 2. Then change to the new directory with the cd command. cd st-ntree 3. Finally, enter the following command: path tar xf prakt00/exercise5/st-ntree.tar What should I have? The following files must be available: Makefile gct-map ntree run-suite test-dir Writing test cases All of the program s functions are fundamentally tested via the invocation ntree <input file> A parameter file holds only the name of the input file. This is somewhat awkward, but necessary to allow applying the test driver consistently. The format of the input file is as follows: command1 parameter1 paramter2 command2 paramterx... An Empirical Evaluation of Three Defect-Detection Techniques 113

7 ISERN B.34 Supplement Structural testing and ntree (Document E37) Which commands are allowed in the input and which functions are invoked by those commands can be seen in the functionfuehre kommandos aus in the file ntree.c. Because this function belongs to the test scaffold and will not be part of the eventual application, it is not especially robust. You can assume that the function, although sensitive, is free of faults. One activity of the driver from driver.o is to open the first file on the command line and to invoke the function fuehre kommandos aus with a pointer to the opened file. Don t write any test cases to cover the test scaffold! Reminder Make sure that your test cases generate output so that you can detect failures! Brief description of the library functions used assert(expression) Macro that expects the expression to be true at the time the program is executed and in that case does nothing. Otherwise an error message with the expression is printed and the program is ended. char* malloc(unsigned size) Returns a pointer to a block of memory that is at least as large as size bytes. In case of failure, NULL is returned. int free(ptr) Gives a previously allocated block back to the system. ptr must have been allocated using malloc or a similar function. If successful, 1 is returned; otherwise 0 is returned. int strcmp(s1,s2) Compares two strings. Returns a value greater than, equal to, or less than 0 depending on whether st1 is lexicographically (i.e., ASCII value) greater than, equal, or less than s2. void bcopy(b1,b2,length) Copies length bytes from string b1 to stringb2. Overlapping strings are treated correctly. int sscanf(s,format,pointer) Reads characters from string s, converts them according to the specification string format, and writes the result into the variables pointed to by the pointers. This is the reverse function of printf; the format specification strings are identical. char *fgets(s,n,stream) Reads characters from the stream stream and writes them in the string s, until either n-1 characters have been read or one of NEWLINE or EOF are seen. At EOF the value NULL is returned, otherwise s. char *strdup(s1) Duplicates the string s1. Allocates memory for this purpose using malloc() and returns a pointer to the duplicate if successful, otherwise NULL. 114 An Empirical Evaluation of Three Defect-Detection Techniques

B.43 Specification for program nametbl (Document ES9)

B.43 Specification for program nametbl (Document ES9) ISERN 95 02 B.43 Specification for program nametbl (Document ES9) B.43 Specification for program nametbl (Document ES9) Name nametbl Functions for a symbol table Usage nametbl input-file Description nametbl

More information

THE UNIVERSITY OF WESTERN ONTARIO. COMPUTER SCIENCE 211a FINAL EXAMINATION 17 DECEMBER HOURS

THE UNIVERSITY OF WESTERN ONTARIO. COMPUTER SCIENCE 211a FINAL EXAMINATION 17 DECEMBER HOURS Computer Science 211a Final Examination 17 December 2002 Page 1 of 17 THE UNIVERSITY OF WESTERN ONTARIO LONDON CANADA COMPUTER SCIENCE 211a FINAL EXAMINATION 17 DECEMBER 2002 3 HOURS NAME: STUDENT NUMBER:

More information

Cpt S 122 Data Structures. Data Structures Trees

Cpt S 122 Data Structures. Data Structures Trees Cpt S 122 Data Structures Data Structures Trees Nirmalya Roy School of Electrical Engineering and Computer Science Washington State University Motivation Trees are one of the most important and extensively

More information

$Id: asg4-shell-tree.mm,v :36: $

$Id: asg4-shell-tree.mm,v :36: $ cmps012b 2002q2 Assignment 4 Shell and Tree Structure page 1 $Id: asg4-shell-tree.mm,v 323.32 2002-05-08 15:36:09-07 - - $ 1. Overview A data structure that is useful in many applications is the Tree.

More information

Trees. (Trees) Data Structures and Programming Spring / 28

Trees. (Trees) Data Structures and Programming Spring / 28 Trees (Trees) Data Structures and Programming Spring 2018 1 / 28 Trees A tree is a collection of nodes, which can be empty (recursive definition) If not empty, a tree consists of a distinguished node r

More information

ECE264 Fall 2013 Exam 3, November 20, 2013

ECE264 Fall 2013 Exam 3, November 20, 2013 ECE264 Fall 2013 Exam 3, November 20, 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

Student Number: Instructor: Reid Section: L5101 (6:10-7:00pm)

Student Number: Instructor: Reid Section: L5101 (6:10-7:00pm) Final Test Duration 50 minutes Aids allowed: none Last Name: Student Number: First Name: Instructor: Reid Section: L5101 (6:10-7:00pm) Do not turn this page until you have received the signal to start.

More information

ECE 264 Exam 2. 6:30-7:30PM, March 9, You must sign here. Otherwise you will receive a 1-point penalty.

ECE 264 Exam 2. 6:30-7:30PM, March 9, You must sign here. Otherwise you will receive a 1-point penalty. ECE 264 Exam 2 6:30-7:30PM, March 9, 2011 I certify that I will not receive nor provide aid to any other student for this exam. Signature: You must sign here. Otherwise you will receive a 1-point penalty.

More information

Cpt S 122 Data Structures. Course Review Midterm Exam # 1

Cpt S 122 Data Structures. Course Review Midterm Exam # 1 Cpt S 122 Data Structures Course Review Midterm Exam # 1 Nirmalya Roy School of Electrical Engineering and Computer Science Washington State University Midterm Exam 1 When: Friday (09/28) 12:10-1pm Where:

More information

Dynamic Memory CMSC 104 Spring 2014, Section 02, Lecture 24 Jason Tang

Dynamic Memory CMSC 104 Spring 2014, Section 02, Lecture 24 Jason Tang Dynamic Memory CMSC 104 Spring 2014, Section 02, Lecture 24 Jason Tang Topics Memory Lifetime Dynamic Memory Allocation Dynamic Memory Deallocation Variable Lifetime (Review) Lifetime refers to when the

More information

Student Number: Instructor: Reid Section: L0101 (10:10-11:00am)

Student Number: Instructor: Reid Section: L0101 (10:10-11:00am) Midterm Test Duration 50 minutes Aids allowed: none Last Name: Student Number: First Name: Instructor: Reid Section: L0101 (10:10-11:00am) Do not turn this page until you have received the signal to start.

More information

Program Design (II): Quiz2 May 18, 2009 Part1. True/False Questions (30pts) Part2. Multiple Choice Questions (40pts)

Program Design (II): Quiz2 May 18, 2009 Part1. True/False Questions (30pts) Part2. Multiple Choice Questions (40pts) Class: No. Name: Part1. True/False Questions (30pts) 1. Function fscanf cannot be used to read data from the standard input. ANS: False. Function fscanf can be used to read from the standard input by including

More information

Announcements. assign0 due tonight. Labs start this week. No late submissions. Very helpful for assign1

Announcements. assign0 due tonight. Labs start this week. No late submissions. Very helpful for assign1 Announcements assign due tonight No late submissions Labs start this week Very helpful for assign1 Goals for Today Pointer operators Allocating memory in the heap malloc and free Arrays and pointer arithmetic

More information

CS3114 (Fall 2013) PROGRAMMING ASSIGNMENT #2 Due Tuesday, October 11:00 PM for 100 points Due Monday, October 11:00 PM for 10 point bonus

CS3114 (Fall 2013) PROGRAMMING ASSIGNMENT #2 Due Tuesday, October 11:00 PM for 100 points Due Monday, October 11:00 PM for 10 point bonus CS3114 (Fall 2013) PROGRAMMING ASSIGNMENT #2 Due Tuesday, October 15 @ 11:00 PM for 100 points Due Monday, October 14 @ 11:00 PM for 10 point bonus Updated: 10/10/2013 Assignment: This project continues

More information

Intermediate Programming, Spring 2017*

Intermediate Programming, Spring 2017* 600.120 Intermediate Programming, Spring 2017* Misha Kazhdan *Much of the code in these examples is not commented because it would otherwise not fit on the slides. This is bad coding practice in general

More information

Student Number: Instructor: Reid Section: L0201 (12:10-1:00pm)

Student Number: Instructor: Reid Section: L0201 (12:10-1:00pm) Midterm Test Duration 50 minutes Aids allowed: none Last Name: Student Number: First Name: Instructor: Reid Section: L0201 (12:10-1:00pm) Do not turn this page until you have received the signal to start.

More information

ECE551 Midterm Version 1

ECE551 Midterm Version 1 Name: ECE551 Midterm Version 1 NetID: There are 7 questions, with the point values as shown below. You have 75 minutes with a total of 75 points. Pace yourself accordingly. This exam must be individual

More information

Slide Set 8. for ENCM 339 Fall 2017 Section 01. Steve Norman, PhD, PEng

Slide Set 8. for ENCM 339 Fall 2017 Section 01. Steve Norman, PhD, PEng Slide Set 8 for ENCM 339 Fall 2017 Section 01 Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary October 2017 ENCM 339 Fall 2017 Section 01 Slide

More information

Quiz 0 Review Session. October 13th, 2014

Quiz 0 Review Session. October 13th, 2014 Quiz 0 Review Session October 13th, 2014 Topics (non-exhaustive) Binary. ASCII. Algorithms. Pseudocode. Source code. Compiler. Object code. Scratch. Statements. Boolean expressions. Conditions. Loops.

More information

CSE 530A. B+ Trees. Washington University Fall 2013

CSE 530A. B+ Trees. Washington University Fall 2013 CSE 530A B+ Trees Washington University Fall 2013 B Trees A B tree is an ordered (non-binary) tree where the internal nodes can have a varying number of child nodes (within some range) B Trees When a key

More information

Creating a Shell or Command Interperter Program CSCI411 Lab

Creating a Shell or Command Interperter Program CSCI411 Lab Creating a Shell or Command Interperter Program CSCI411 Lab Adapted from Linux Kernel Projects by Gary Nutt and Operating Systems by Tannenbaum Exercise Goal: You will learn how to write a LINUX shell

More information

Crit-bit Trees. Adam Langley (Version )

Crit-bit Trees. Adam Langley (Version ) Crit-bit Trees Adam Langley (agl@imperialviolet.org) (Version 20080926) 1. Introduction This code is taken from Dan Bernstein s qhasm and implements a binary crit-bit (alsa known as PATRICA) tree for NUL

More information

Introduction to C Language (M3-R )

Introduction to C Language (M3-R ) Introduction to C Language (M3-R4-01-18) 1. Each question below gives a multiple choice of answers. Choose the most appropriate one and enter in OMR answer sheet supplied with the question paper, following

More information

PRINCIPLES OF OPERATING SYSTEMS

PRINCIPLES OF OPERATING SYSTEMS PRINCIPLES OF OPERATING SYSTEMS Tutorial-1&2: C Review CPSC 457, Spring 2015 May 20-21, 2015 Department of Computer Science, University of Calgary Connecting to your VM Open a terminal (in your linux machine)

More information

ECE264 Spring 2013 Final Exam, April 30, 2013

ECE264 Spring 2013 Final Exam, April 30, 2013 ECE264 Spring 2013 Final Exam, April 30, 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

More information

Introduction to Computer Systems. Exam 2. April 10, Notes and calculators are permitted, but not computers.

Introduction to Computer Systems. Exam 2. April 10, Notes and calculators are permitted, but not computers. 15-213 Introduction to Computer Systems Exam 2 April 10, 2007 Name: Andrew User ID: Recitation Section: This is an open-book exam. Notes and calculators are permitted, but not computers. Write your answer

More information

Question 1. Part (a) CSC 209H1 S 2017

Question 1. Part (a) CSC 209H1 S 2017 Question 1. [8 marks] The following program reads star data from a text file in the following format. Each line contains a string (with no spaces in it) representing the name of a star followed by a space

More information

MUST. MPI Runtime Error Detection Tool

MUST. MPI Runtime Error Detection Tool MUST MPI Runtime Error Detection Tool April 18, 2012 1 CONTENTS CONTENTS Contents 1 Introduction 3 2 Installation 3 2.1 P n MPI................................. 4 2.2 GTI..................................

More information

Lecture 7: file I/O, more Unix

Lecture 7: file I/O, more Unix CIS 330: / / / / (_) / / / / _/_/ / / / / / \/ / /_/ / `/ \/ / / / _/_// / / / / /_ / /_/ / / / / /> < / /_/ / / / / /_/ / / / /_/ / / / / / \ /_/ /_/_/_/ _ \,_/_/ /_/\,_/ \ /_/ \ //_/ /_/ Lecture 7: file

More information

LESSON 4. The DATA TYPE char

LESSON 4. The DATA TYPE char LESSON 4 This lesson introduces some of the basic ideas involved in character processing. The lesson discusses how characters are stored and manipulated by the C language, how characters can be treated

More information

Crit-bit Trees. Adam Langley (Version )

Crit-bit Trees. Adam Langley (Version ) CRITBIT CWEB OUTPUT 1 Crit-bit Trees Adam Langley (agl@imperialviolet.org) (Version 20080926) 1. Introduction This code is taken from Dan Bernstein s qhasm and implements a binary crit-bit (alsa known

More information

CS 322 Operating Systems Programming Assignment 4 Writing a memory manager Due: April 5, 11:30 PM

CS 322 Operating Systems Programming Assignment 4 Writing a memory manager Due: April 5, 11:30 PM CS 322 Operating Systems Programming Assignment 4 Writing a memory manager Due: April 5, 11:30 PM Goals To understand the nuances of building a memory allocator. To create a shared library. Background

More information

C++ for Java Programmers

C++ for Java Programmers Lecture 6 More pointing action Yesterday we considered: Pointer Assignment Dereferencing Pointers to Pointers to Pointers Pointers and Array Pointer Arithmetic 2 Todays Lecture What do we know 3 And now

More information

C: Pointers. C: Pointers. Department of Computer Science College of Engineering Boise State University. September 11, /21

C: Pointers. C: Pointers. Department of Computer Science College of Engineering Boise State University. September 11, /21 Department of Computer Science College of Engineering Boise State University September 11, 2017 1/21 Pointers A pointer is a variable that stores the address of another variable. Pointers are similar to

More information

Section - Computer Science. int main() {! int a=10,b=20;! printf("a:%d B:%d\n",a,b);! a=(a+b)-(b=a);! printf("a:%d B:%d\n",a,b);!

Section - Computer Science. int main() {! int a=10,b=20;! printf(a:%d B:%d\n,a,b);! a=(a+b)-(b=a);! printf(a:%d B:%d\n,a,b);! Section - Computer Science 1. What will be the output of the following piece of code? int! int a=10,b=20;! printf("a:%d B:%d\n",a,b);! a=(a+b)-(b=a);! printf("a:%d B:%d\n",a,b);! return 1; (i) A: 10, B:

More information

Instructions: Submit your answers to these questions to the Curator as OQ02 by the posted due date and time. No late submissions will be accepted.

Instructions: Submit your answers to these questions to the Curator as OQ02 by the posted due date and time. No late submissions will be accepted. Instructions: Submit your answers to these questions to the Curator as OQ02 by the posted due date and time. No late submissions will be accepted. For the next five questions, consider the function to

More information

LECTURE 11 TREE TRAVERSALS

LECTURE 11 TREE TRAVERSALS DATA STRUCTURES AND ALGORITHMS LECTURE 11 TREE TRAVERSALS IMRAN IHSAN ASSISTANT PROFESSOR AIR UNIVERSITY, ISLAMABAD BACKGROUND All the objects stored in an array or linked list can be accessed sequentially

More information

A3-R3: PROGRAMMING AND PROBLEM SOLVING THROUGH 'C' LANGUAGE

A3-R3: PROGRAMMING AND PROBLEM SOLVING THROUGH 'C' LANGUAGE A3-R3: PROGRAMMING AND PROBLEM SOLVING THROUGH 'C' LANGUAGE NOTE: 1. There are TWO PARTS in this Module/Paper. PART ONE contains FOUR questions and PART TWO contains FIVE questions. 2. PART ONE is to be

More information

Dynamic Memory Allocation

Dynamic Memory Allocation Dynamic Memory Allocation The process of allocating memory at run time is known as dynamic memory allocation. C does not Inherently have this facility, there are four library routines known as memory management

More information

C mini reference. 5 Binary numbers 12

C mini reference. 5 Binary numbers 12 C mini reference Contents 1 Input/Output: stdio.h 2 1.1 int printf ( const char * format,... );......................... 2 1.2 int scanf ( const char * format,... );.......................... 2 1.3 char

More information

Outline. OS Interface to Devices. System Input/Output. CSCI 4061 Introduction to Operating Systems. System I/O and Files. Instructor: Abhishek Chandra

Outline. OS Interface to Devices. System Input/Output. CSCI 4061 Introduction to Operating Systems. System I/O and Files. Instructor: Abhishek Chandra Outline CSCI 6 Introduction to Operating Systems System I/O and Files File I/O operations File Descriptors and redirection Pipes and FIFOs Instructor: Abhishek Chandra 2 System Input/Output Hardware devices:

More information

MUST. MPI Runtime Error Detection Tool

MUST. MPI Runtime Error Detection Tool MUST MPI Runtime Error Detection Tool November 9, 2011 1 CONTENTS CONTENTS Contents 1 Introduction 3 2 Installation 3 2.1 P n MPI................................. 4 2.2 GTI..................................

More information

Do not start the test until instructed to do so!

Do not start the test until instructed to do so! Instructions: Print your name in the space provided below. This examination is closed book and closed notes, aside from the permitted one-page formula sheet. No calculators or other electronic devices

More information

In Java we have the keyword null, which is the value of an uninitialized reference type

In Java we have the keyword null, which is the value of an uninitialized reference type + More on Pointers + Null pointers In Java we have the keyword null, which is the value of an uninitialized reference type In C we sometimes use NULL, but its just a macro for the integer 0 Pointers are

More information

Programming Standards: You must conform to good programming/documentation standards. Some specifics:

Programming Standards: You must conform to good programming/documentation standards. Some specifics: CS3114 (Spring 2011) PROGRAMMING ASSIGNMENT #3 Due Thursday, April 7 @ 11:00 PM for 100 points Early bonus date: Wednesday, April 6 @ 11:00 PM for a 10 point bonus Initial Schedule due Thursday, March

More information

ESC101N: Fundamentals of Computing End-sem st semester

ESC101N: Fundamentals of Computing End-sem st semester ESC101N: Fundamentals of Computing End-sem 2010-11 1st semester Instructor: Arnab Bhattacharya 8:00-11:00am, 15th November, 2010 Instructions 1. Please write your name, roll number and section below. 2.

More information

ECE551 Midterm. There are 7 questions, with the point values as shown below. You have 75 minutes with a total of 75 points. Pace yourself accordingly.

ECE551 Midterm. There are 7 questions, with the point values as shown below. You have 75 minutes with a total of 75 points. Pace yourself accordingly. Name: ECE551 Midterm NetID: There are 7 questions, with the point values as shown below. You have 75 minutes with a total of 75 points. Pace yourself accordingly. This exam must be individual work. You

More information

A function is a named group of statements developed to solve a sub-problem and returns a value to other functions when it is called.

A function is a named group of statements developed to solve a sub-problem and returns a value to other functions when it is called. Chapter-12 FUNCTIONS Introduction A function is a named group of statements developed to solve a sub-problem and returns a value to other functions when it is called. Types of functions There are two types

More information

Chapter 7: User Defined Functions and Stack Mechanics

Chapter 7: User Defined Functions and Stack Mechanics Chapter 7: User Defined Functions and Stack Mechanics Objectives: (a) Demonstrate the ability to analyze simple programs that use library and user defined functions. (b) Describe the organization and contents

More information

Armide Documentation. Release Kyle Mayes

Armide Documentation. Release Kyle Mayes Armide Documentation Release 0.3.1 Kyle Mayes December 19, 2014 Contents 1 Introduction 1 1.1 Features.................................................. 1 1.2 License..................................................

More information

Slide Set 3. for ENCM 339 Fall 2017 Section 01. Steve Norman, PhD, PEng

Slide Set 3. for ENCM 339 Fall 2017 Section 01. Steve Norman, PhD, PEng Slide Set 3 for ENCM 339 Fall 2017 Section 01 Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary September 2017 ENCM 339 Fall 2017 Section 01

More information

ECE551 Midterm Version 2

ECE551 Midterm Version 2 Name: ECE551 Midterm Version 2 NetID: There are 7 questions, with the point values as shown below. You have 75 minutes with a total of 75 points. Pace yourself accordingly. This exam must be individual

More information

The output will be: marks all or nothing. 1 #include <stdio.h> 2 main() { 3 int i; int j; 4 int *p; int *q; 6 p = &i; 7 q = &j; 8 i = 1;

The output will be: marks all or nothing. 1 #include <stdio.h> 2 main() { 3 int i; int j; 4 int *p; int *q; 6 p = &i; 7 q = &j; 8 i = 1; p. 2 of 9 Q1. [5 marks] The following program compiles and runs with no problems. Indicate what the output of the program is going to be (no explanation necessary). 1 #include 2 main() { 3 int

More information

The make Utility in Unix SEEM

The make Utility in Unix SEEM The make Utility in Unix SEEM 3460 1 Recall the reverse Module reverse.h 1 /* reverse.h */ 2 3 void reverse (char before[], char after[]); 4 /* Declare but do not define this function */ SEEM 3460 2 Recall

More information

Variation of Pointers

Variation of Pointers Variation of Pointers A pointer is a variable whose value is the address of another variable, i.e., direct address of the memory location. Like any variable or constant, you must declare a pointer before

More information

This code has a bug that allows a hacker to take control of its execution and run evilfunc().

This code has a bug that allows a hacker to take control of its execution and run evilfunc(). Malicious Code Insertion Example This code has a bug that allows a hacker to take control of its execution and run evilfunc(). #include // obviously it is compiler dependent // but on my system

More information

Binghamton University. CS-211 Fall Dynamic Memory

Binghamton University. CS-211 Fall Dynamic Memory Dynamic Memory Static Memory Define variables when we write code When we write the code we decide What the type of the variable is How big array sizes will be etc. These cannot change when we run the code!

More information

The make Utility in Unix SEEM

The make Utility in Unix SEEM The make Utility in Unix SEEM 3460 1 Recall the reverse Module reverse.h 1 /* reverse.h */ 2 3 void reverse (char *before, char *after); 4 /* Declare but do not define this function */ SEEM 3460 2 Recall

More information

Data Structure and Algorithm Homework #3

Data Structure and Algorithm Homework #3 Problem 1. Binary Search Tree Data Structure and Algorithm Homework #3 === Homework Reference Solution === We can use the following structure to represent our binary search tree. struct node char word[20+1];

More information

Binary Search Tree 1.0. Generated by Doxygen Mon Jun :12:39

Binary Search Tree 1.0. Generated by Doxygen Mon Jun :12:39 Binary Search Tree 1.0 Generated by Doxygen 1.7.1 Mon Jun 6 2011 16:12:39 Contents 1 Binary Search Tree Program 1 1.1 Introduction.......................................... 1 2 Data Structure Index 3

More information

C How to Program, 6/e by Pearson Education, Inc. All Rights Reserved.

C How to Program, 6/e by Pearson Education, Inc. All Rights Reserved. C How to Program, 6/e 1992-2010 by Pearson Education, Inc. An important part of the solution to any problem is the presentation of the results. In this chapter, we discuss in depth the formatting features

More information

Lecture 8: Pointer Arithmetic (review) Endianness Functions and pointers

Lecture 8: Pointer Arithmetic (review) Endianness Functions and pointers CSE 30: Computer Organization and Systems Programming Lecture 8: Pointer Arithmetic (review) Endianness Functions and pointers Diba Mirza University of California, San Diego 1 Q: Which of the assignment

More information

Out: April 19, 2017 Due: April 26, 2017 (Wednesday, Reading/Study Day, no late work accepted after Friday)

Out: April 19, 2017 Due: April 26, 2017 (Wednesday, Reading/Study Day, no late work accepted after Friday) CS 215 Fundamentals of Programming II Spring 2017 Programming Project 7 30 points Out: April 19, 2017 Due: April 26, 2017 (Wednesday, Reading/Study Day, no late work accepted after Friday) This project

More information

Memory, Data, & Addressing II CSE 351 Spring

Memory, Data, & Addressing II CSE 351 Spring Memory, Data, & Addressing II CSE 351 Spring 2018 http://xkcd.com/138/ Review Questions 1) If the word size of a machine is 64-bits, which of the following is usually true? (pick all that apply) a) 64

More information

CS113: Lecture 7. Topics: The C Preprocessor. I/O, Streams, Files

CS113: Lecture 7. Topics: The C Preprocessor. I/O, Streams, Files CS113: Lecture 7 Topics: The C Preprocessor I/O, Streams, Files 1 Remember the name: Pre-processor Most commonly used features: #include, #define. Think of the preprocessor as processing the file so as

More information

Arrays in C C Programming and Software Tools. N.C. State Department of Computer Science

Arrays in C C Programming and Software Tools. N.C. State Department of Computer Science Arrays in C C Programming and Software Tools N.C. State Department of Computer Science Contents Declaration Memory and Bounds Operations Variable Length Arrays Multidimensional Arrays Character Strings

More information

Why Do We Need Trees?

Why Do We Need Trees? CSE 373 Lecture 6: Trees Today s agenda: Trees: Definition and terminology Traversing trees Binary search trees Inserting into and deleting from trees Covered in Chapter 4 of the text Why Do We Need Trees?

More information

Binary Trees, Binary Search Trees

Binary Trees, Binary Search Trees Binary Trees, Binary Search Trees Trees Linear access time of linked lists is prohibitive Does there exist any simple data structure for which the running time of most operations (search, insert, delete)

More information

ECE454, Fall 2014 Homework3: Dynamic Memory Allocation Assigned: Oct 9th, Due: Nov 6th, 11:59PM

ECE454, Fall 2014 Homework3: Dynamic Memory Allocation Assigned: Oct 9th, Due: Nov 6th, 11:59PM ECE454, Fall 2014 Homework3: Dynamic Memory Allocation Assigned: Oct 9th, Due: Nov 6th, 11:59PM The TA for this assignment is Xu Zhao (nuk.zhao@mail.utoronto.ca). 1 Introduction OptsRus is doing really

More information

Assignment: 7. Due: Language level: Allowed recursion:

Assignment: 7. Due: Language level: Allowed recursion: Assignment: 7 Due: Language level: Allowed recursion: CS 135 Winter 2018 Graham, Nijjar Tuesday, March 13th, 2018 9:00pm Beginning Student with List Abbreviations Pure Structural and Structural Recursion

More information

Project 3: An Introduction to File Systems. COP 4610 / CGS 5765 Principles of Operating Systems

Project 3: An Introduction to File Systems. COP 4610 / CGS 5765 Principles of Operating Systems Project 3: An Introduction to File Systems COP 4610 / CGS 5765 Principles of Operating Systems Introduction Project 3 learning objectives File system design and implementation File system testing Data

More information

CSci 4061 Introduction to Operating Systems. Programs in C/Unix

CSci 4061 Introduction to Operating Systems. Programs in C/Unix CSci 4061 Introduction to Operating Systems Programs in C/Unix Today Basic C programming Follow on to recitation Structure of a C program A C program consists of a collection of C functions, structs, arrays,

More information

CS-220 Spring 2018 Test 1 Version A Feb. 28, Name:

CS-220 Spring 2018 Test 1 Version A Feb. 28, Name: CS-220 Spring 2018 Test 1 Version A Feb. 28, 2018 Name: 1. (10 points) For the following, Check T if the statement is true, the F if the statement is false. (a) T F : Every function definition in C must

More information

INF2220: algorithms and data structures Series 1

INF2220: algorithms and data structures Series 1 Universitetet i Oslo Institutt for Informatikk A. Maus, R.K. Runde, I. Yu INF2220: algorithms and data structures Series 1 Topic Trees & estimation of running time (Exercises with hints for solution) Issued:

More information

CS61C : Machine Structures

CS61C : Machine Structures inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture 4 Introduction to C (pt 2) 2014-09-08!!!Senior Lecturer SOE Dan Garcia!!!www.cs.berkeley.edu/~ddgarcia! C most popular! TIOBE programming

More information

Recursion, Trees and Tree Traversal. Module CE System Programming & Computer Control Systems

Recursion, Trees and Tree Traversal. Module CE System Programming & Computer Control Systems Recursion, Trees and Tree Traversal Module CE00352-2 System Programming & Computer Control Systems Lists Data Pointer Data Pointer Can be used as queue or stack Data Pointer Data Pointer Tree Structure

More information

Linked-List Basic Examples. A linked-list is Linear collection of self-referential class objects, called nodes Connected by pointer links

Linked-List Basic Examples. A linked-list is Linear collection of self-referential class objects, called nodes Connected by pointer links Linked-List Basic Examples A linked-list is Linear collection of self-referential class objects, called nodes Connected by pointer links Accessed via a pointer to the first node of the list Subsequent

More information

CS 241 Data Organization Binary Trees

CS 241 Data Organization Binary Trees CS 241 Data Organization Binary Trees Brooke Chenoweth University of New Mexico Fall 2017 Binary Tree: Kernighan and Ritchie 6.5 Read a file and count the occurrences of each word. now is the time for

More information

CS61C : Machine Structures

CS61C : Machine Structures inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture 7 C Memory Management!!Lecturer SOE Dan Garcia!!!www.cs.berkeley.edu/~ddgarcia CS61C L07 More Memory Management (1)! 2010-02-03! Flexible

More information

Exercise Session 2 Systems Programming and Computer Architecture

Exercise Session 2 Systems Programming and Computer Architecture Systems Group Department of Computer Science ETH Zürich Exercise Session 2 Systems Programming and Computer Architecture Herbstsemester 216 Agenda Linux vs. Windows Working with SVN Exercise 1: bitcount()

More information

Lab 03 - x86-64: atoi

Lab 03 - x86-64: atoi CSCI0330 Intro Computer Systems Doeppner Lab 03 - x86-64: atoi Due: October 1, 2017 at 4pm 1 Introduction 1 2 Assignment 1 2.1 Algorithm 2 3 Assembling and Testing 3 3.1 A Text Editor, Makefile, and gdb

More information

CE 221 Data Structures and Algorithms

CE 221 Data Structures and Algorithms CE 221 Data Structures and Algorithms Chapter 4: Trees (Binary) Text: Read Weiss, 4.1 4.2 Izmir University of Economics 1 Preliminaries - I (Recursive) Definition: A tree is a collection of nodes. The

More information

Recitation 2/18/2012

Recitation 2/18/2012 15-213 Recitation 2/18/2012 Announcements Buflab due tomorrow Cachelab out tomorrow Any questions? Outline Cachelab preview Useful C functions for cachelab Cachelab Part 1: you have to create a cache simulator

More information

University of Toronto

University of Toronto University of Toronto Faculty of Applied Science and Engineering Midterm November, 2010 ECE244 --- Programming Fundamentals Examiners: Tarek Abdelrahman, Michael Gentili, and Michael Stumm Instructions:

More information

CS 105 Malloc Lab: Writing a Dynamic Storage Allocator See Web page for due date

CS 105 Malloc Lab: Writing a Dynamic Storage Allocator See Web page for due date CS 105 Malloc Lab: Writing a Dynamic Storage Allocator See Web page for due date 1 Introduction In this lab you will be writing a dynamic storage allocator for C programs, i.e., your own version of the

More information

Tree: non-recursive definition. Trees, Binary Search Trees, and Heaps. Tree: recursive definition. Tree: example.

Tree: non-recursive definition. Trees, Binary Search Trees, and Heaps. Tree: recursive definition. Tree: example. Trees, Binary Search Trees, and Heaps CS 5301 Fall 2013 Jill Seaman Tree: non-recursive definition Tree: set of nodes and directed edges - root: one node is distinguished as the root - Every node (except

More information

ECE551 Midterm Version 1

ECE551 Midterm Version 1 Name: ECE551 Midterm Version 1 NetID: There are 7 questions, with the point values as shown below. You have 75 minutes with a total of 75 points. Pace yourself accordingly. This exam must be individual

More information

Programming II (CS300)

Programming II (CS300) 1 Programming II (CS300) Chapter 11: Binary Search Trees MOUNA KACEM mouna@cs.wisc.edu Fall 2018 General Overview of Data Structures 2 Introduction to trees 3 Tree: Important non-linear data structure

More information

Unit III - Tree TREES

Unit III - Tree TREES TREES Unit III - Tree Consider a scenario where you are required to represent the directory structure of your operating system. The directory structure contains various folders and files. A folder may

More information

CSC209H Lecture 3. Dan Zingaro. January 21, 2015

CSC209H Lecture 3. Dan Zingaro. January 21, 2015 CSC209H Lecture 3 Dan Zingaro January 21, 2015 Streams (King 22.1) Stream: source of input or destination for output We access a stream through a file pointer (FILE *) Three streams are available without

More information

CS201: Lab #4 Writing a Dynamic Storage Allocator

CS201: Lab #4 Writing a Dynamic Storage Allocator CS201: Lab #4 Writing a Dynamic Storage Allocator In this lab you will write a dynamic storage allocator for C programs, i.e., your own version of the malloc, free and realloc routines. You are encouraged

More information

Lec 17 April 8. Topics: binary Trees expression trees. (Chapter 5 of text)

Lec 17 April 8. Topics: binary Trees expression trees. (Chapter 5 of text) Lec 17 April 8 Topics: binary Trees expression trees Binary Search Trees (Chapter 5 of text) Trees Linear access time of linked lists is prohibitive Heap can t support search in O(log N) time. (takes O(N)

More information

Trees : Part 1. Section 4.1. Theory and Terminology. A Tree? A Tree? Theory and Terminology. Theory and Terminology

Trees : Part 1. Section 4.1. Theory and Terminology. A Tree? A Tree? Theory and Terminology. Theory and Terminology Trees : Part Section. () (2) Preorder, Postorder and Levelorder Traversals Definition: A tree is a connected graph with no cycles Consequences: Between any two vertices, there is exactly one unique path

More information

15-213/18-243, Spring 2011 Exam 2

15-213/18-243, Spring 2011 Exam 2 Andrew login ID: Full Name: Section: 15-213/18-243, Spring 2011 Exam 2 Thursday, April 21, 2011 v2 Instructions: Make sure that your exam is not missing any sheets, then write your Andrew login ID, full

More information

Memory Management in C (Dynamic Strings) Personal Software Engineering

Memory Management in C (Dynamic Strings) Personal Software Engineering Memory Management in C (Dynamic Strings) Personal Software Engineering Memory Organization Function Call Frames The Stack The call stack grows from the top of memory down. sp Available for allocation The

More information

Figure 1. A breadth-first traversal.

Figure 1. A breadth-first traversal. 4.3 Tree Traversals Stepping, or iterating, through the entries of a linearly ordered list has only two obvious orders: from front to back or from back to front. There is no obvious traversal of a general

More information

Singly linked lists in C.

Singly linked lists in C. Singly linked lists in C http://www.cprogramming.com/tutorial/c/lesson15.html By Alex Allain Linked lists are a way to store data with structures so that the programmer can automatically create a new place

More information

E&CE 454/750-5: Spring 2010 Programming Assignment 1 Due: 11:59 PM Friday 11 th June 2010

E&CE 454/750-5: Spring 2010 Programming Assignment 1 Due: 11:59 PM Friday 11 th June 2010 E&CE 454/750-5: Spring 2010 Programming Assignment 1 Due: 11:59 PM Friday 11 th June 2010 For this assignment you are required to implement a crude version of Remote Procedure Call (RPC). Normally this

More information

Chapter 20: Binary Trees

Chapter 20: Binary Trees Chapter 20: Binary Trees 20.1 Definition and Application of Binary Trees Definition and Application of Binary Trees Binary tree: a nonlinear linked list in which each node may point to 0, 1, or two other

More information

CSC 1600 Memory Layout for Unix Processes"

CSC 1600 Memory Layout for Unix Processes CSC 16 Memory Layout for Unix Processes" 1 Lecture Goals" Behind the scenes of running a program" Code, executable, and process" Memory layout for UNIX processes, and relationship to C" : code and constant

More information