C++ Support for Abstract Data Types
|
|
- Molly Smith
- 2 years ago
- Views:
Transcription
1 Topics C++ Support for Abstract Data Types Professor Department of EECS Vanderbilt University (615) Describing Objects Using ADTs Built-in vs. User-defined ADTs C++ Support Vanderbilt University 1 Describing Objects Using ADTs Built-in ADTs An ADT is a collection of data and associated operations for manipulating that data ADTs support abstraction, encapsulation, and information hiding They provide equal attention to data and operations Common examples of ADTs: Built-in types: boolean, integer, real, array User-defined types: stack, queue, tree, list boolean Values: true and false Operations: and, or, not, nand, etc. integer Values: Whole numbers between MIN and MAX values Operations: add, subtract, multiply, divide, etc. arrays Values: Homogeneous elements, i.e., arrayofx... Operations: initialize, store, retrieve, copy, etc. Vanderbilt University 2 Vanderbilt University 3
2 User-defined ADTs stack Values: Stack elements, i.e., stackofx... Operations: create, destroy/dispose, push, pop, is empty, is full, etc. queue Values: Queue elements, i.e., queue of X... Operations: create, destroy/dispose, enqueue, dequeue, is empty, is full, etc. tree search structure Values: Tree elements, i.e., treeofx Operations: insert, delete, find, size, traverse (inorder, post-order, pre-order, level-order), etc. C++ Support for ADTs C++ Classes Automatic Initialization and Termination Friends Assignment and Initialization Overloading Parameterized Types Iterators Miscellaneous Issues Vanderbilt University 4 Vanderbilt University 5 C++ Classes C++ Classes (cont d) Classes are containers for state variables and provide operations, i.e., methods, for manipulating the state variables A class is separated into three access control sections: class Classic_Example { // Data and methods accessible to any user of the class protected: // Data and methods accessible to class methods, // derived classes, and friends only // Data and methods accessible to class // methods and friends only A struct is interpreted as a class with all data objects and methods declared in the public section By default, all class members are private and all struct members are public A class definition does not allocate storage for any objects Data members and member functions (i.e., methods) Vanderbilt University 6 Vanderbilt University 7
3 C++ Class Components (cont d) Class Data Members The this pointer Used in the source code to refer to a pointer to the object on which the method is called Friends Non-class functions granted privileges to access internal class information, typically for efficiency reasons Data members may be objects of built-in types, as well as userdefined types, e.g., class Bounded Stack #include "Vector.h" template <class T> class Bounded_Stack { Bounded_Stack (int len) : stack_ (len), top_ (0) { Vector<T> stack_; int top_; Vanderbilt University 8 Vanderbilt University 9 Class Data Members (cont d) Base/Member Initialization Section Important Question: How do we initialize class data members that are objects of user-defined types whose constructors require arguments? Answer: use the base/member initialization section That s the part of the constructor after the :, following the constructor s parameter list (up to the first f ) Note, it is a good habit to always use the base/member initialization section Base/member initialization section only applies to constructors Five mandatory cases for classes: 1. Initializing base classes (whose constructors require arguments) 2. Initializing user-defined class data members (whose constructors require arguments) 3. Initializing reference variables 4. Initializing consts 5. Initializing virtual base class(es), in most derived class (when they don t have default constructor(s)) One optional case: 1. Initializing built-in data members Vanderbilt University 10 Vanderbilt University 11
4 Base/Member Initialization Section (cont d) class Vector { Vector (size_t len); /*... */ class String { String (const char *str); /*... class Stack : private Vector // Base class { Stack (size_t len, const char *name) : Vector (len), name_ (name), max_size_ (len), top_ (0) { String name_; // user-defined const int max_size_; // const size_t top_; // built-in type Base/Member Initialization Section (cont d) References (and consts) must be initialized class Vector_Iterator { Vector_Iterator (const Vector &v): vr_ (v), i_ (0) { Vector &vr_; // reference size_t i_; Vanderbilt University 12 Vanderbilt University 13 Friends A class may grant access to its private data and methods by including friend declarations in the class definition, e.g., class Vector { friend Vector &product (const Vector &, const Matrix &); int size_; Function product can access Vector s private parts: Vector &product (const Vector &v, const Matrix &m) { int vector_size = v.size_; Vanderbilt University 14 Do Friends (cont d) A class may confer friendship on entire classes, selected methods in a particular class, ordinary stand-alone functions Friends allow for controlled violation of informationhiding e.g., ostream and istream functions: #include <iostream.h> class String { friend ostream &operator<< (ostream &, String &); char *str_; ostream &operator<< (ostream &os, String &s) { os << s.str_; return os; Vanderbilt University
5 Friends (cont d) Assignment and Initialization Using friends weakens information hiding In particular, it leads to tightly-coupled implementations that are overly reliant on certain naming and implementation details For this reason, friends are known as the goto of access protection mechanisms! Note, C++ inline (accessor) functions reduce the need for friends... Some ADTs must control all copy operations invoked upon objects This is necessary to avoid dynamic memory aliasing problems caused by shallow copying A String class is a good example of the need for controlling all copy operations... Vanderbilt University 16 Vanderbilt University 17 Assignment and Initialization (cont d) class String { String (const char *t) : len_ (t == 0? 0 : strlen (t)) { if (this->len_ == 0) throw range_error (); this->str_ = strcpy (new char [len_ + 1], t); String (void) { delete [] this->str_; size_t len_; char *str_; Assignment and Initialization (cont d) void foo (void) { String s1 ("hello"); String s2 ("world"); s1 = s2; // leads to aliasing s1[2] = x ; assert (s2[2] == x ); // will be true! // double deletion in destructor calls! Vanderbilt University 18 Vanderbilt University 19
6 Assignment and Initialization (cont d) s1 s2 Assignment and Initialization (cont d) In C++, copy operations include assignment, initialization, parameter passing and function return, e.g., #include "Vector.h" Vector<int> bar (Vector<int>); void foo (void) { Vector<int> v1 (100); world Vector<int> v2 = v1; // Initialize new v2 from v1 // Same net effect as Vector v2 (v1); v1 = v2; // Vector assign v2 to v1 Note that both s1.s and s2.s point to the dynamically allocated buffer storing world (this is known as aliasing) Vanderbilt University 20 v2 = bar (v1); // Pass and return Vectors Note, parameter passing and function return of objects by value is handled using the initialization semantics of the copy constructor Vanderbilt University 21 Assignment and Initialization (cont d) Assignment and Initialization (cont d) Assignment is different than initialization because the left hand object already exists for assignment Therefore, C++ provides two different operators, one for initialization (the copy constructor, which also handles parameter passing and return of objects from functions)... template <class T> Vector<T>::Vector (const Vector &v) : size_ (v.size_), max_ (v.max_), buf_ (new T[v.max_]) { for (size_t i = 0; i < this->size_; i++) this->buf_[i] = v.buf_[i];... and one for assignment (the assignment operator), e.g., template <class T> Vector<T> &Vector<T>::operator= (const Vector<T> &v) { if (this!= &v) { if (this->max_ < v.size_) { delete [] this->buf_; this->buf_ = new T[v.size_]; this->max_ = v.size_; this->size_ = v.size_; for (size_t i = 0; i < this->size_; i++) this->buf_[i] = v.buf_[i]; return *this; // Allows v1 = v2 = v3; Vanderbilt University 22 Vanderbilt University 23
7 Assignment and Initialization (cont d) Assignment and Initialization (cont d) Constructors and operator= must be class members and neither are inherited Rationale If a class had a constructor and an operator=, but a class derived from it did not what would happen to the derived class members which are not part of the base class?! Therefore If a constructor or operator= is not defined for the derived class, the compiler-generated one will use the base class constructors and operator= s for each base class (whether user-defined or compiler-defined) In addition, a memberwise copy (e.g., using operator=) isused for each of the derived class members Bottom-line: define constructors and operator= for almost every non-trivial class... Also, define destructors and copy constructors for most classes as well... Note, you can also define compound assignment operators, such as operator +=, which need have nothing to do with operator = Vanderbilt University 24 Vanderbilt University 25 Restricting Assignment and Initialization Assignment, initialization, and parameter passing of objects by value may be prohibited by using access control specifiers: template <class T> class Vector { Vector<T> (void); // Default constructor Vector<T> &operator= (const Vector<T> &); Vector<T> (const Vector<T> &); void foo (Vector<int>); // pass-by-value prototype Vector<int> v1; Vector<int> v2 = v1; // Error v2 = v1; // Error foo (v1); // Error Restricting Assignment and Initialization (cont d) A similar idiom can be used to prevent static or auto declaration of an object, i.e., only allows dynamic objects! class Foo { void dispose (void); Foo (void); // Destructor is private... Foo f; // error Now the only way to declare a Foo object is off the heap, using operator new, Foo *f = new Foo; Note, the delete operator is no longer accessible delete f; // error! Therefore, a dispose function must be provided to delete the object, f->dispose (); Vanderbilt University 26 Vanderbilt University 27
8 Restricting Assignment and Initialization (cont d) If you declare a class constructor protected then only objects derived from the class can be created Note, you can also use pure virtual functions to achieve a similar effect, though it forces the use of virtual tables... class Foo { protected: Foo (void); class Bar : private Foo { public Bar (void); Foo f; // Illegal Bar b; // OK Note, if Foo s constructor is declared in the private section then we can not declare objects of class Bar either (unless class Bar is declared as a friend of Foo) Overloading C++ allows overloading of all function names and nearly all operators that handle user-defined types, including: the assignment operator = the function call operator () the array subscript operator [] the pointer operator ->() the sequence (comma) operator, the ternary operator? : the auto-increment operator ++ You may not overload: the scope resolution operator :: the member selection (dot) operator. Vanderbilt University 28 Vanderbilt University 29 Overloading (cont d) Ambiguous cases are rejected by the compiler, e.g., int foo (int); int foo (int, int = 10); foo (100); // ERROR, ambiguous call! foo (100, 101); // OK! A function s return type is not considered when distinguishing between overloaded instances e.g., the following declarations are ambiguous to the C++ compiler: int divide (double, double); double divide (double, double); Overloading (cont d) const and non-const functions are different functions, so constness may be used to distinguish return values, e.g., char &operator[] (unsigned int); const char &operator[] (unsigned int) const; Vanderbilt University 30 Vanderbilt University 31
9 Overloading (cont d) Function name overloading and operator overloading relieves the programmer from the lexical complexity of specifying unique function identifier names. e.g., class String { // various constructors, destructors, // and methods omitted friend String operator+ (const String&, const char *); friend String operator+ (const String&,const String&); friend String operator+ (const char *, const String&); friend ostream &operator<< (ostream &, const String &); Overloading (cont d) String str_vec[101]; String curly ("curly"); String comma (", "); str_vec[13] = "larry"; String foo = str_vec[13] + ", " + curly" String bar = foo + comma + "and moe"; /* bar.string::string ( operator+ (operator+ (foo, comma), "and moe")); */ void baz (void) { cout << bar << "\n"; // prints larry, curly, and moe Vanderbilt University 32 Vanderbilt University 33 Overloading (cont d) Overloading becomes a hindrance to the readability of a program when it serves to remove information This is especially true of overloading operators! e.g., overloading operators += and -= to mean push and pop from a Stack ADT For another example of why to avoid operator overloading, consider the following expression: Matrix a, b, c, d; a = b + c * d; // *, +, and = are overloaded // remember, standard precedence rules apply... Overloading (cont d) This code will be compiled into something like the following: Matrix t1 = c.operator* (d); Matrix t2 = b.operator+ (t1); a.operator= (t2); destroy t1; destroy t2; This may involve many constructor/destructor calls and extra memory copying... Vanderbilt University 34 Vanderbilt University 35
10 Overloading (cont d) So, do not use operator overloading unless necessary! Instead, many operations may be written using functions with explicit arguments, e.g., Matrix b, c, d;... Matrix a (c); a.mult (d); a.add (b); or define and use the short-hand operator x= instead, a = b + c * d; can be represented by: Matrix a (c); a *= d; a += b; e.g., Parameterized Types Parameterized types serve to describe general container class data structures that have identical implementations, regardless of the elements they are composed of The C++ parameterized type scheme allows lazy instantiation i.e., the compiler need not generate definitions for template methods that are not used (or non-template methods) ANSI/ISO C++ allows a programmer to explicitly instantiate parameterized types, e.g., template class Vector<int>; Vanderbilt University 36 Vanderbilt University 37 Parameterized Types (cont d) C++ templates may also be used to parameterize functions. compiler generates all the necessary code! template <class T> inline void swap (T &x, T &y) { T t = x; x = y; y = t; int main (int, char *[]) { int a = 10, b = 20; double d = 10.0, e = 20.0; char c = a, s = b ; The Parameterized Types (cont d) C++ standard library provides standard containers, algorithms iterators and functors. The library is generic in the sense that they are heavily parameterized. Containers - e.x, vectors, list, map, queue etc. Algorithm - e.x, copy, sort, find, count etc. Iterators - e.x, Input, Output, Forward, BiDirectional, Random Access and Trivial Function Objects or Functors - e.x, plus, minus, multiplies etc. They were called STL in earlier versions of C++ swap (a, b); swap (d, e); swap (c, s); return 0; Vanderbilt University 38 Vanderbilt University 39
11 Template Metaprograms Make the compiler act as an interpreter. Made possible by C++ template features. These programs need not be executed. They generate their output at compile time. template<int N> class Power2 { enum { value = 2 * Power2<N-1>::value class Power2<1> { enum { value = 2 Template Metaprograms (cont d) Very powerful when combined with normal C++ code. A hybrid approach would result in faster code. Template metaprograms can be written for specific algorithms and embedded in code. Generates useful code for specific input sizes during compile times. Basically, it is an extremely early binding mechanism as opposed to traditional late binding used with C++. Can torture your compiler, and not many compilers can handle this. Vanderbilt University 40 Vanderbilt University 41 Template Metaprograms (cont d) A simple do while loop template<int I> class loop { enum { go = (I-1)!= 0 static inline void f() { // Whatever needs to go here loop<go? (I-1) : 0>::f(); class loop<0> { static inline void f() { loop<n>::f(); Iterators Iterators allow applications to loop through elements of some ADT without depending upon knowledge of its implementation details There are a number of different techniques for implementing iterators Each has advantages and disadvantages Other design issues: Providing a copy of each data item vs. providing a reference to each data item? How to handle concurrency and insertion/deletion while iterator(s) are running Vanderbilt University 42 Vanderbilt University 43
12 Iterators (cont d) Iterators (cont d) Iterators are central to generic programming 1. Pass a pointer to a function NotveryOO... Clumsy way to handle shared data Use in-class iterators (a.k.a. passive or internal iterators) Requires modification of class interface Generally not reentrant Use out-of-class iterators (a.k.a. active or external iterator) Handles multiple simultaneously active iterators May require special access to original class internals... i.e., usefriends Three primary methods of designing iterators 1. Pass a pointer to a function NotveryOO... Clumsy way to handle shared data Use in-class iterators (a.k.a. passive or internal iterators) Requires modification of class interface Generally not reentrant Use out-of-class iterators (a.k.a. active or external iterator) Handles multiple simultaneously active iterators May require special access to original class internals... i.e., usefriends Vanderbilt University 44 Vanderbilt University 45 Pointer to Function Iterator Example #include <stream.h> template <class T> class Vector { /* Same as before */ int apply (void (*ptf) (T &)) { for (int i = 0; i < this->size (); i++) (*ptf) (this->buf[i]); template <class T> void f (T &i) { cout << i << endl; Vector<int> v (100); v.apply (f); In-class Iterator Example #include <stream.h> template <class T> class Vector { // Same as before void reset (void) {this->i_ = 0; int advance (void) {return this->i_++ < this->size (); T value (void) {return this->buf[this->i_ - 1]; size_t i_; Vector<int> v (100); for (v.reset (); v.advance ()!= 0; ) cout << "value = " << v.value () << "\n"; Vanderbilt University 46 Vanderbilt University 47
13 Out-of-class Iterator Example #include <stream.h> #include "Vector.h" template <class T> class Vector_Iterator { Vector_Iterator(const Vector<T> &v) : vr_(v), i_(0) { int advance() {return this->i_++ < this->vr_.size(); T value() {return this->vr_[this->i_ - 1]; Vector<T> &vr_; size_t i_; Vector<int> v (100); Vector_Iterator<int> iter (v); while (iter.advance ()!= 0) cout << "value = " << iter.value () << "\n"; Out-of-class Iterator Example (cont d) Note, this particular scheme does not require that Vector Iterator be declared as a friend of class Vector However, for efficiency reasons this is often necessary in more complex ADTs Vanderbilt University 48 Vanderbilt University 49 const methods New (ANSI) casts References Miscellaneous ADT Issues in C++ Const Methods When a user-defined class object is declared as const, its methods cannot be called unless they are declared to be const methods i.e., a const method must not modify its member data directly, or indirectly by calling non-const methods static methods static data members Vanderbilt University 50 Vanderbilt University 51
14 Const Methods (cont d) This allows read-only user-defined objects to function correctly, e.g., class Point { Point (int x, int y): x_ (x), y_ (y) { int dist (void) const { return ::sqrt (this->x_ * this->x_ + this->y_ * this->y_); void move (int dx, int dy) { this->x_ += dx; this->y_ += dy; int x_, y_; const Point p (10, 20); int d = p.dist (); // OK p.move (3, 5); // ERROR New (ANSI) casts static_cast performs a standard, nonpolymorphic cast unsigned int invalid = static_cast<unsigned int> (-1); const_cast removes const-ness void Foo::func (void) const { // Call a non-const member function from a // const member function. Often dangerous!!!! const_cast<foo *> (this)->func2 (); Vanderbilt University 52 Vanderbilt University 53 New (ANSI) casts, (cont d) reinterpret_cast converts types, possibly in an implementationdependent manner long random = reinterpret_cast<long> (&func); dynamic_cast casts at run-time, using RTTI void func (Base *bp) { Derived *dp = dynamic_cast<derived *> (bp); if (dp) // bp is a pointer to a Derived object References Parameters, return values, and variables can all be defined as references This is primarily done for efficiency Call-by-reference can be used to avoid the run-time impact of passing large arguments by value Vanderbilt University 54 Vanderbilt University 55
15 References (cont d) References are implemented similarly to const pointers. Conceptually, the differences between references and pointers are: Pointers are first class objects, references are not e.g., you can have an array of pointers, but you can t have an array of references References must refer to an actual object, but pointers can refer to lots of other things that aren t objects, e.g., Pointers can refer to the special value 0 in C++ (often referred to as NULL) Also, pointers can legitimately refer to a location one past the end of an array In general, use of references is safer, less ambiguous, and much more restricted than pointers (this is both good and bad, of course) Static Data Members A static data member has exactly one instantiation for the entire class (as opposed to one for each object in the class), e.g., class Foo { int a_; // Must be defined exactly once outside header! // (usually in corresponding.c file) static int s_; Foo x, y, z; Vanderbilt University 56 Vanderbilt University 57 Static Data Members (cont d) Note: There are three distinct addresses for Foo::a, i.e., &x.a_, &y.a_, &z. There is only one Foo::s, however... Also note: Static Methods A static method may be called on an object of a class, or on the class itself without supplying an object (unlike non-static methods...) Note, there is no this pointer in a static method &Foo::s_ == (int *); &Foo::a_ == (int Foo::*); // pointer to data member Vanderbilt University 58 Vanderbilt University 59
16 Static Methods (cont d) i.e., a static method cannot access non-static class data and functions class Foo { static int get_s1 (void) { this->a_ = 10; /* ERROR! */; return Foo::s_; int get_s2 (void) { this->a_ = 10; /* OK */; return Foo::s_; int a_; static int s_; Static Methods (cont d) Most of the following calls are legal: Foo f; int i1, i2, i3, i4; i1 = Foo::get_s1 (); i2 = f.get_s2 (); i3 = f.get_s1 (); i4 = Foo::get_s2 (); // error Note: &Foo::get_s1 == int (*)(); // pointer to method &Foo::get_s2 == int (Foo::*)(); Vanderbilt University 60 Vanderbilt University 61 Summary A major contribution of C++ is its support for defining abstract data types (ADTs), e.g., Classes Parameterized types For many systems, successfully utilizing C++ s ADT support is more important than using the OO features of the language, e.g., Inheritance Dynamic binding Vanderbilt University 62
Object Oriented Software Design II
Object Oriented Software Design II Introduction to C++ Giuseppe Lipari http://retis.sssup.it/~lipari Scuola Superiore Sant Anna Pisa February 20, 2012 G. Lipari (Scuola Superiore Sant Anna) C++ Intro February
Summary. Pre requisition. Content Details: 1. Basics in C++
Summary C++ Language is one of the approaches to provide object-oriented functionality with C like syntax. C++ adds greater typing strength, scoping and other tools useful in object-oriented programming
Glossary of Object Oriented Terms
Appendix E Glossary of Object Oriented Terms abstract class: A class primarily intended to define an instance, but can not be instantiated without additional methods. abstract data type: An abstraction
C++ INTERVIEW QUESTIONS
C++ INTERVIEW QUESTIONS http://www.tutorialspoint.com/cplusplus/cpp_interview_questions.htm Copyright tutorialspoint.com Dear readers, these C++ Interview Questions have been designed specially to get
CSE 303 Concepts and Tools for Software Development. Magdalena Balazinska Winter 2010 Lecture 19 Inheritance (virtual functions and abstract classes)
CSE 303 Concepts and Tools for Software Development Magdalena Balazinska Winter 2010 Lecture 19 Inheritance (virtual functions and abstract classes) Where We Are We have already covered the introduction
PART-A Questions. 2. How does an enumerated statement differ from a typedef statement?
1. Distinguish & and && operators. PART-A Questions 2. How does an enumerated statement differ from a typedef statement? 3. What are the various members of a class? 4. Who can access the protected members
Advanced C++ Programming
Advanced C++ Programming Course ID CPP110 Course Description The comprehensive, five-day course consists of three modules. A preliminary module reviews topics, including inheritance, the ANSI C++ Standard
SYSTEMS PROGRAMMING C++ INTRODUCTION
Faculty of Computer Science / Institute of Systems Architecture / Operating Systems SYSTEMS PROGRAMMING C++ INTRODUCTION Alexander Warg WHY C++? C++ is the language that allows to express ideas from the
C++ Programming Language
C++ Programming Language Lecturer: Yuri Nefedov 7th and 8th semesters Lectures: 34 hours (7th semester); 32 hours (8th semester). Seminars: 34 hours (7th semester); 32 hours (8th semester). Course abstract
An Incomplete C++ Primer. University of Wyoming MA 5310
An Incomplete C++ Primer University of Wyoming MA 5310 Professor Craig C. Douglas http://www.mgnet.org/~douglas/classes/na-sc/notes/c++primer.pdf C++ is a legacy programming language, as is other languages
C++ Keywords. If/else Selection Structure. Looping Control Structures. Switch Statements. Example Program
C++ Keywords There are many keywords in C++ that are not used in other languages. bool, const_cast, delete, dynamic_cast, const, enum, extern, register, sizeof, typedef, explicit, friend, inline, mutable,
El Dorado Union High School District Educational Services
El Dorado Union High School District Course of Study Information Page Course Title: ACE Computer Programming II (#495) Rationale: A continuum of courses, including advanced classes in technology is needed.
C++ Introduction to class and data abstraction
C++ Introduction to class and data abstraction 1 Data abstraction A data abstraction is a simplified view of an object by specifying what can be done with the object while hiding unnecessary details In
Storage Classes CS 110B - Rule Storage Classes Page 18-1 \handouts\storclas
CS 110B - Rule Storage Classes Page 18-1 Attributes are distinctive features of a variable. Data type, int or double for example, is an attribute. Storage class is another attribute. There are four storage
BHARATHIAR UNIVERSITY: COIMBATORE CENTRE FOR COLLABORATION OF INDUSTRY AND INSTITUTIONS(CCII) CERTIFICATE IN ADVANCED PROGRAMMING C++ LANGUAGE
Certificate in Advanced Programming - C++ Language Page 1 of 7 BHARATHIAR UNIVERSITY: COIMBATORE 641046 CENTRE FOR COLLABORATION OF INDUSTRY AND INSTITUTIONS(CCII) CERTIFICATE IN ADVANCED PROGRAMMING C++
PROBLEM SOLVING SEVENTH EDITION WALTER SAVITCH UNIVERSITY OF CALIFORNIA, SAN DIEGO CONTRIBUTOR KENRICK MOCK UNIVERSITY OF ALASKA, ANCHORAGE PEARSON
PROBLEM SOLVING WITH SEVENTH EDITION WALTER SAVITCH UNIVERSITY OF CALIFORNIA, SAN DIEGO CONTRIBUTOR KENRICK MOCK UNIVERSITY OF ALASKA, ANCHORAGE PEARSON Addison Wesley Boston San Francisco New York London
Advanced Systems Programming
Advanced Systems Programming Introduction to C++ Martin Küttler September 23, 2016 1 / 21 About this presentation 2 / 21 About this presentation This presentation is not about learning to program 2 / 21
Chapter 4: Linked Lists
Chapter 4: Linked Lists Data Abstraction & Problem Solving with C++ Fifth Edition by Frank M. Carrano Preliminaries Options for implementing an ADT List Array has a fixed size Data must be shifted during
KITES TECHNOLOGY COURSE MODULE (C, C++, DS)
KITES TECHNOLOGY 360 Degree Solution www.kitestechnology.com/academy.php info@kitestechnology.com technologykites@gmail.com Contact: - 8961334776 9433759247 9830639522.NET JAVA WEB DESIGN PHP SQL, PL/SQL
C++ for Game Programmers
C++ for Game Programmers Course Description C++ has become one of the favourite programming language for game programmers. Reasons for wide spread acceptability of C++ are plenty, but primary reasons are,
CpSc212 Goddard Notes Chapter 6. Yet More on Classes. We discuss the problems of comparing, copying, passing, outputting, and destructing
CpSc212 Goddard Notes Chapter 6 Yet More on Classes We discuss the problems of comparing, copying, passing, outputting, and destructing objects. 6.1 Object Storage, Allocation and Destructors Some objects
Programming for MSc Part I
Herbert Martin Dietze University of Buckingham herbert@the-little-red-haired-girl.org July 24, 2001 Abstract The course introduces the C programming language and fundamental software development techniques.
The C Programming Language course syllabus associate level
TECHNOLOGIES The C Programming Language course syllabus associate level Course description The course fully covers the basics of programming in the C programming language and demonstrates fundamental programming
OpenCL Static C++ Kernel Language Extension
OpenCL Static C++ Kernel Language Extension Document Revision: 04 Advanced Micro Devices Authors: Ofer Rosenberg, Benedict R. Gaster, Bixia Zheng, Irina Lipov December 15, 2011 Contents 1 Overview... 3
Introduction to C++ Data Abstraction w/ Classes Topic #2
Introduction to C++ Data Abstraction w/ Classes Topic #2 CS202 2-1 Lecture #1 plus Review Abstract Data Types Introduction to...object Models Introduction to...data Abstraction Using Data Abstraction in
A modest STL tutorial
A modest STL tutorial By Jak Kirman I am using a software tool called hyperlatex to create this document. The tutorial is also available in compressed postscript form. For those wanting to install a copy
09336863931 : provid.ir
provid.ir 09336863931 : NET Architecture Core CSharp o Variable o Variable Scope o Type Inference o Namespaces o Preprocessor Directives Statements and Flow of Execution o If Statement o Switch Statement
OBJECT ORIENTED PROGRAMMING IN C++
OBJECT ORIENTED PROGRAMMING IN C++ For Off Campus BSc Computer Science Programme UNIT 1 1. The goal of programmers is to develop software that are. A. Correct B. Reliable and maintainable C. Satisfy all
CS 111 Classes I 1. Software Organization View to this point:
CS 111 Classes I 1 Software Organization View to this point: Data Objects and primitive types Primitive types operators (+, /,,*, %). int, float, double, char, boolean Memory location holds the data Objects
University of Illinois at Urbana-Champaign Department of Computer Science. First Examination
University of Illinois at Urbana-Champaign Department of Computer Science First Examination CS 225 Data Structures and Software Principles Fall 2007 7p-9p, Thursday, October 4 Name: NetID: Lab Section
Curriculum Map. Discipline: Computer Science Course: C++
Curriculum Map Discipline: Computer Science Course: C++ August/September: How can computer programs make problem solving easier and more efficient? In what order does a computer execute the lines of code
CSCI-1200 Data Structures Fall 2015 Lecture 10 Vector Iterators & Linked Lists
CSCI-1200 Data Structures Fall 2015 Lecture 10 Vector Iterators & Linked Lists Review from Lecture 9 Explored a program to maintain a class enrollment list and an associated waiting list. Unfortunately,
Object-Oriented Programming, Iouliia Skliarova
Object-Oriented Programming, Iouliia Skliarova Data types define the way you use the storage (memory) in the programs. By specifying a data type, you tell the sompiler how to create a particular piece
Keywords Compared in Various Languages
Keywords Compared in Various Languages Visual Studio 2010 This topic lists common programming tasks that can be summarized with a language keyword. For more information about tasks that need code examples,
Chapter 8. Arithmetic in C++
Christian Jacob Chapter 8 Arithmetic in C++ 8.1 The C++ Vocabulary 8.2 Variables and Types 8.2.1 Data Objects 8.2.2 Variables 8.2.3 Declaration of Variables 8.3 Elementary C++ Data Types 8.3.1 Integers
C++ How to Program, 8/e by Pearson Education, Inc. All Rights Reserved.
C++ How to Program, 8/e 1992-2012 by Pearson Education, Inc. 1992-2012 by Pearson Education, Inc. 1992-2012 by Pearson Education, Inc. We ve studied fixed-size data structures such as one-dimensional arrays
vector vec double # in # cl in ude tdexcept> // std::ou std t_of ::ou _range t_of class class V Vector { ector {
Software Design (C++) 3. Resource management and exception safety (idioms and technicalities) Juha Vihavainen University of Helsinki Preview More on error handling and exceptions checking array indices
CompuScholar, Inc. Alignment to Utah's Computer Programming II Standards
CompuScholar, Inc. Alignment to Utah's Computer Programming II Standards Course Title: TeenCoder: Java Programming Course ISBN: 978 0 9887070 2 3 Course Year: 2015 Note: Citation(s) listed may represent
Data Structures Using C++ 2E. Chapter 5 Linked Lists
Data Structures Using C++ 2E Chapter 5 Linked Lists Test #1 Next Thursday During Class Cover through (near?) end of Chapter 5 Objectives Learn about linked lists Become aware of the basic properties of
Operator Overloading. Lecture 8. Operator Overloading. Running Example: Complex Numbers. Syntax. What can be overloaded. Syntax -- First Example
Operator Overloading Lecture 8 Operator Overloading C++ feature that allows implementer-defined classes to specify class-specific function for operators Benefits allows classes to provide natural semantics
The if-statement. Simple and compound statements. The if-statement comes in two forms: Simple statements:
1 2 Simple and compound s The if- Simple s: E.g.: expression; Various jumps : break, goto, continue, return. k = a * p + 3; printf("k = %d\n", k); 1 + 2; ; The if- comes in two forms: or E.g.: if (expression)
The C++ Programming Language Single and Multiple Inheritance in C++ Douglas C. Schmidt www.cs.wustl.edu/schmidt/ schmidt@cs.wustl.edu Washington University, St. Louis 1 Background Object-oriented programming
2. Names, Scopes, and Bindings
2. Names, Scopes, and Bindings Binding, Lifetime, Static Scope, Encapsulation and Modules, Dynamic Scope Copyright 2010 by John S. Mallozzi Names Variables Bindings Binding time Language design issues
C++ Mini-Course. Part 1: Mechanics Part 2: Basics Part 3: References Part 4: Const Part 5: Inheritance Part 6: Libraries Part 7: Conclusion. C Rulez!
C++ Mini-Course Part 1: Mechanics Part 2: Basics Part 3: References Part 4: Const Part 5: Inheritance Part 6: Libraries Part 7: Conclusion C Rulez! C++ Rulez! C++ Mini-Course Part 1: Mechanics C++ is a
Introduction to Java A First Look
Introduction to Java A First Look Java is a second or third generation object language Integrates many of best features Smalltalk C++ Like Smalltalk Everything is an object Interpreted or just in time
Binary storage of graphs and related data
EÖTVÖS LORÁND UNIVERSITY Faculty of Informatics Department of Algorithms and their Applications Binary storage of graphs and related data BSc thesis Author: Frantisek Csajka full-time student Informatics
Applied Informatics C++ Coding Style Guide
C++ Coding Style Guide Rules and Recommendations Version 1.4 Purpose of This Document This document describes the C++ coding style employed by Applied Informatics. The document is targeted at developers
C++ Programming: From Problem Analysis to Program Design, Fifth Edition. Chapter 2: Basic Elements of C++
C++ Programming: From Problem Analysis to Program Design, Fifth Edition Chapter 2: Basic Elements of C++ Objectives In this chapter, you will: Become familiar with the basic components of a C++ program,
Online C++ FAQ/Tutorial and Advanced Questions
Online C++ FAQ/Tutorial and Advanced Questions Alexis Angelidis January 11, 2005 1 Quick notes to C programmers instead of macros use const or enum to define constants inline to prevent function call overload
Advanced C++ Exception Handling Topic #5
Advanced C++ Exception Handling Topic #5 CS202 5-1 CS202 5-2 Exception Handling Throwing an Exception Detecting an Exception Catching an Exception Examine an Example using Classes and Operator Overloading
Moving from CS 61A Scheme to CS 61B Java
Moving from CS 61A Scheme to CS 61B Java Introduction Java is an object-oriented language. This document describes some of the differences between object-oriented programming in Scheme (which we hope you
Course Name: ADVANCE COURSE IN SOFTWARE DEVELOPMENT (Specialization:.Net Technologies)
Course Name: ADVANCE COURSE IN SOFTWARE DEVELOPMENT (Specialization:.Net Technologies) Duration of Course: 6 Months Fees: Rs. 25,000/- (including Service Tax) Eligibility: B.E./B.Tech., M.Sc.(IT/ computer
Punctuation in C. Identifiers and Expressions. Identifiers. Variables. Keywords. Identifier Examples
Identifiers and Expressions CSE 130: Introduction to C Programming Spring 2005 Punctuation in C Statements are terminated with a ; Groups of statements are enclosed by curly braces: { and } Commas separate
C++FA 3.1 OPTIMIZING C++
C++FA 3.1 OPTIMIZING C++ Ben Van Vliet Measuring Performance Performance can be measured and judged in different ways execution time, memory usage, error count, ease of use and trade offs usually have
Constructors and Assignment. Mike Precup
Constructors and Assignment Mike Precup (mprecup@stanford.edu) Administrivia Actually important this time! Assignment 2 is due on Tuesday at midnight. I ll be holding LaiR hours from 8 PM - 10 PM on Sunday
Comp 245 Data Structures. Stacks
Comp 245 Data Structures Stacks What is a Stack? A LIFO (last in, first out) structure Access (storage or retrieval) may only take place at the TOP NO random access to other elements within the stack An
Java Application Developer Certificate Program Competencies
Java Application Developer Certificate Program Competencies After completing the following units, you will be able to: Basic Programming Logic Explain the steps involved in the program development cycle
Cours de C++ Utilisations des conteneurs
Cours de C++ Utilisations des conteneurs Cécile Braunstein cecile.braunstein@lip6.fr 1 / 18 Introduction Containers - Why? Help to solve messy problems Provide useful function and data structure Consistency
Fundamentals of Java Programming
Fundamentals of Java Programming This document is exclusive property of Cisco Systems, Inc. Permission is granted to print and copy this document for non-commercial distribution and exclusive use by instructors
CS1020E: DATA STRUCTURES AND ALGORITHMS I
CS1020E: DATA STRUCTURES AND ALGORITHMS I Tutorial 1 Basic C++, OOP Problem Solving (Week 3, starting 22 August 2016) 1. Evaluation Order (Note: You can use any other C++ code editor/compiler). Examine
C++FA 5.1 PRACTICE MID-TERM EXAM
C++FA 5.1 PRACTICE MID-TERM EXAM This practicemid-term exam covers sections C++FA 1.1 through C++FA 1.4 of C++ with Financial Applications by Ben Van Vliet, available at www.benvanvliet.net. 1.) A pointer
12 Abstract Data Types
12 Abstract Data Types 12.1 Source: Foundations of Computer Science Cengage Learning Objectives After studying this chapter, the student should be able to: Define the concept of an abstract data type (ADT).
CS193D Handout 06 Winter 2004 January 26, 2004 Copy Constructor and operator=
CS193D Handout 06 Winter 2004 January 26, 2004 Copy Constructor and operator= We already know that the compiler will supply a default (zero-argument) constructor if the programmer does not specify one.
Sources: On the Web: Slides will be available on:
C programming Introduction The basics of algorithms Structure of a C code, compilation step Constant, variable type, variable scope Expression and operators: assignment, arithmetic operators, comparison,
Classes and Pointers: Some Peculiarities (cont d.)
Classes and Pointers: Some Peculiarities (cont d.) Assignment operator Built-in assignment operators for classes with pointer member variables may lead to shallow copying of data FIGURE 3-22 Objects objectone
IS0020 Program Design and Software Tools Midterm, Feb 24, 2004. Instruction
IS0020 Program Design and Software Tools Midterm, Feb 24, 2004 Name: Instruction There are two parts in this test. The first part contains 50 questions worth 80 points. The second part constitutes 20 points
Language Examples of ADT: C++
Language Examples of ADT: C++ Based on C struct type and Simula 67 classes All of the class instances of a class share a single copy of the member functions Each instance of a class has its own copy of
Chapter 5 Names, Bindings, Type Checking, and Scopes
Chapter 5 Names, Bindings, Type Checking, and Scopes Chapter 5 Topics Introduction Names Variables The Concept of Binding Type Checking Strong Typing Scope Scope and Lifetime Referencing Environments Named
Final Exam Review. CS 1428 Fall Jill Seaman. Final Exam
Final Exam Review CS 1428 Fall 2011 Jill Seaman 1 Final Exam Friday, December 9, 11:00am to 1:30pm Derr 241 (here) Closed book, closed notes, clean desk Comprehensive (covers entire course) 25% of your
AFF 826. Sub. Code 4BSO1C1. Sp2. B.Sc. DEGREE EXAMINATION, NOVEMBER First Semester. Software FUNDAMENTALS OF COMPUTERS AND C PROGRAMMING
Sp2 AFF 826 Sub. Code 4BSO1C1 B.Sc. DEGREE EXAMINATION, NOVEMBER 2015 First Semester Software FUNDAMENTALS OF COMPUTERS AND C PROGRAMMING (CBCS 2014 onwards) Time : 3 Hours Maximum : 75 Marks Part A (10
C++ tutorial. C++ tutorial
Introduction I I will assume that you know some basics of C++: # include < iostream > int main ( void ) { std :: cout
Bhakta Kavi Narsinh Mehta University, Junagadh
Bhakta Kavi Narsinh Mehta University, Junagadh Draft Syllabus for B.Sc. (Computer Science) Bachelor of Science (Computer Science) (Semester - 1) Effective From June - 2016 B.Sc. (C.S.) (Semester - 1) CS-101:
Why you shouldn't use set (and what you should use instead) Matt Austern
Why you shouldn't use set (and what you should use instead) Matt Austern Everything in the standard C++ library is there for a reason, but it isn't always obvious what that reason is. The standard isn't
Object Oriented Software Design II
Object Oriented Software Design II Real Application Design Christian Nastasi http://retis.sssup.it/~lipari http://retis.sssup.it/~chris/cpp Scuola Superiore Sant Anna Pisa April 25, 2012 C. Nastasi (Scuola
ALLIED PAPER : DISCRETE MATHEMATICS (for B.Sc. Computer Technology & B.Sc. Multimedia and Web Technology)
ALLIED PAPER : DISCRETE MATHEMATICS (for B.Sc. Computer Technology & B.Sc. Multimedia and Web Technology) Subject Description: This subject deals with discrete structures like set theory, mathematical
Marathwada Institute of Technology
Marathwada Institute of Technology Master of Computer Application Title of the subject: Object Oriented Programming using C++ Course Code: MCA 101 Faculty: Shubhashree Savant Class: FY MCA Part - I (Question
Chapter 13 Storage classes
Chapter 13 Storage classes 1. Storage classes 2. Storage Class auto 3. Storage Class extern 4. Storage Class static 5. Storage Class register 6. Global and Local Variables 7. Nested Blocks with the Same
Computer Programming I
Computer Programming I COP 2210 Syllabus Spring Semester 2012 Instructor: Greg Shaw Office: ECS 313 (Engineering and Computer Science Bldg) Office Hours: Tuesday: 2:50 4:50, 7:45 8:30 Thursday: 2:50 4:50,
Chapter 13. Pointers and Linked Lists
Chapter 13 Pointers and Linked Lists Overview 13.1 Nodes and Linked Lists 13.2 Stacks and Queues Slide 13-2 13.1 Nodes and Linked Lists Nodes and Linked Lists n A linked list is a list that can grow and
Data Structures Using Java
Data Structures Using Java D. S. Malik P. S. Nair THOMSON COURSE TECHNOLOGY Australia Canada Mexico Singapore Spain United Kingdom United States TABLE OF Contents PREFACE XXV 1.Software Engineering Principles
Object-Oriented Desin and Prorammin C++ Container Classes Outline Introduction Container Class Objectives Class Library Architecture Parameterized Types Preprocessor Macros enclass void Pointer Method
1) The postfix expression for the infix expression A+B*(C+D)/F+D*E is ABCD+*F/DE*++
Answer the following 1) The postfix expression for the infix expression A+B*(C+D)/F+D*E is ABCD+*F/DE*++ 2) Which data structure is needed to convert infix notations to postfix notations? Stack 3) The
Introduction to C ++ : Questions
Introduction to C ++ : Questions Thomas Branch 28th November 204. A Tutorial Introduction. Getting Started Aim: Make sure the program compiles and runs, learn to get the program to output text. [Debug]
Chapter 7. Arrays and Collections. Instructor s Manual Table of Contents. At a Glance. Chapter Overview. Chapter Objectives.
C# Programming: From Problem Analysis to Program Design, 2nd ed. 7-1 Chapter 7 Arrays and Collections At a Glance Instructor s Manual Table of Contents Chapter Overview Chapter Objectives Instructor Notes
CORBA Programming with TAOX11. The C++11 CORBA Implementation
CORBA Programming with TAOX11 The C++11 CORBA Implementation TAOX11: the CORBA Implementation by Remedy IT TAOX11 simplifies development of CORBA based applications IDL to C++11 language mapping is easy
Habanero Extreme Scale Software Research Project
Habanero Extreme Scale Software Research Project Comp215: Java Method Dispatch Zoran Budimlić (Rice University) Always remember that you are absolutely unique. Just like everyone else. - Margaret Mead
Ivor Horton's Beginning Visual C
Brochure More information from http://www.researchandmarkets.com/reports/2708412/ Ivor Horton's Beginning Visual C++ 2013 Description: Learn C++ Programming and Visual C++ 2013 the faster, easier way This
C++ Language Tutorial
cplusplus.com C++ Language Tutorial Written by: Juan Soulié Last revision: June, 2007 Available online at: http://www.cplusplus.com/doc/tutorial/ The online version is constantly revised and may contain
Multichoice Quetions 1. Atributes a. are listed in the second part of the class box b. its time is preceded by a colon. c. its default value is
Multichoice Quetions 1. Atributes a. are listed in the second part of the class box b. its time is preceded by a colon. c. its default value is preceded by an equal sign d. its name has undereline 2. Associations
Overview of Data Structures
UNIT 3 Concrete Data Types Classification of Data Structures Concrete vs. Abstract Data Structures Most Important Concrete Data Structures Arrays Records Linked Lists Binary Trees Overview of Data Structures
Adjusted/Modified by Nicole Tobias. Chapter 2: Basic Elements of C++
Adjusted/Modified by Nicole Tobias Chapter 2: Basic Elements of C++ Objectives In this chapter, you will: Become familiar with functions, special symbols, and identifiers in C++ Explore simple data types
language 1 (source) compiler language 2 (target) Figure 1: Compiling a program
CS 2112 Lecture 27 Interpreters, compilers, and the Java Virtual Machine 1 May 2012 Lecturer: Andrew Myers 1 Interpreters vs. compilers There are two strategies for obtaining runnable code from a program
DATA STRUCTURES USING C
DATA STRUCTURES USING C QUESTION BANK UNIT I 1. Define data. 2. Define Entity. 3. Define information. 4. Define Array. 5. Define data structure. 6. Give any two applications of data structures. 7. Give
Avancerad programmering i C++ 1
Polymorphism Polymorphism and virtual Polymorphism - many forms In C++, polymorphism is implemented through virtual. Virtual (and so, of course, polymorphism) have a meaning only in the context of inheritance.
C Compiler Targeting the Java Virtual Machine
C Compiler Targeting the Java Virtual Machine Jack Pien Senior Honors Thesis (Advisor: Javed A. Aslam) Dartmouth College Computer Science Technical Report PCS-TR98-334 May 30, 1998 Abstract One of the
Variable Base Interface
Chapter 6 Variable Base Interface 6.1 Introduction Finite element codes has been changed a lot during the evolution of the Finite Element Method, In its early times, finite element applications were developed
SSEX COUNTY COLLEGE Engineering Technologies and Computer Sciences Division CSC 122 Computer Science II Course Outline
SSEX COUNTY COLLEGE Engineering Technologies and Computer Sciences Division CSC 122 Computer Science II Course Outline Course Number & Name: CSC 122 Computer Science II Credit Hours: 4.0 Contact Hours:
Introduction to C++ Introduction to C++ Week 7 Dr Alex Martin 2013 Slide 1
Introduction to C++ Introduction to C++ Week 7 Dr Alex Martin 2013 Slide 1 Introduction to Classes Classes as user-defined types We have seen that C++ provides a fairly large set of built-in types. e.g
Konzepte objektorientierter Programmierung
Konzepte objektorientierter Programmierung Prof. Dr. Peter Müller Werner Dietl Software Component Technology Exercises 3: Some More OO Languages Wintersemester 04/05 Agenda for Today 2 Homework Finish
6.096 Lab 1. Due: 7 January 12:30:00. September 20, 2011
6.096 Lab 1 Due: 7 January 1:30:00 September 0, 011 1 Additional Material 1.1 Constants A constant is an expressions with a fixed value. Kinds of constants: Literals: used to express particular values