CS212 Data Structures 2018 Second Semester.

Slides:



Advertisements
Similar presentations
JAVA Coursework (the same for 2A and 2B). Fundamental Information The coursework is 30 marks in your O’Level = 15% of the exam Must be word processed.
Advertisements

Lecture 1: Overview of Computers & Programming
CSC 171 – FALL 2004 COMPUTER PROGRAMMING LECTURE 0 ADMINISTRATION.
Introduction to Programming G50PRO University of Nottingham Unit 1 : Introduction Paul Tennent
6 Steps of the Programming Process
COMP 111 Programming Languages 1 First Day. Course COMP111 Dr. Abdul-Hameed Assawadi Office: Room AS15 – No. 2 Tel: Ext. ??
CSc 2310 Principles of Programming (Java) Dr. Xiaolin Hu.
1 Functions 1 Parameter, 1 Return-Value 1. The problem 2. Recall the layout 3. Create the definition 4. "Flow" of data 5. Testing 6. Projects 1 and 2.
Program 6 Any questions?. System.in Does the opposite of System.out.
8/19/2003CS 303 – Administrivia Lecture 0 1 Administrivia Labs Homework Grades Exams Quiz.
CS212: DATA STRUCTURES Lecture 1: Introduction. What is this course is about ?  Data structures : conceptual and concrete ways to organize data for efficient.
Computational Algorithms David Davenport Computer Eng. Dept., Bilkent University Ankara - Turkey. lightning introduction.
ORDER OF CONTENT AND INSTRUCTIONS A program in its simplest form usually contains three kinds of activity:  INPUT : The program asks the user for some.
1 Ch. 1: Software Development (Read) 5 Phases of Software Life Cycle: Problem Analysis and Specification Design Implementation (Coding) Testing, Execution.
CS161 Topic #16 1 Today in CS161 Lecture #16 Prepare for the Final Reviewing all Topics this term Variables If Statements Loops (do while, while, for)
Software Development Problem Analysis and Specification Design Implementation (Coding) Testing, Execution and Debugging Maintenance.
CS139 – Algorithm Development Aug 23, 2004 WELCOME!
Lecture 2 Programming life cycle. computer piano analogy Piano + player - computer hardware Musical score/notes - software or program Composer - programmer.
1 Faculty Orientation Fall 2012 International Technological University.
CS1010: Programming Methodology
Computer Programming 12 Lesson 6 – Loop structure By: Dan Lunney.
CIS 115 AID Peer Educator/cis115aid.com FOR MORE CLASSES VISIT
CIS 115 Slingshot Academy / Tutorialrank.com Tutorialrank.com For More Tutorials
Programming revision Revision tip: Focus on the things you find difficult first.
CIS 115 All Exercises Devry University (Devry) FOR MORE CLASSES VISIT CIS 115 All Exercises Devry University.
CIS 115 ALL EXERCISES DEVRY UNIVERSITY (DEVRY)  CIS 115 All Exercises Devry University CIS 115 ALL ILABS DEVRY UNIVERSITY (DEVRY)  CIS 115 All iLabs.
CIS 115 AID Teaching Effectively/cis115aid.com FOR MORE CLASSES VISIT
Advanced Higher Computing Science
CIS 115 Slingshot Academy / cis115.com
CSc 1302 Principles of Computer Science II
CSC 321: Data Structures Fall 2016
Software Development Expansion of topics page 28 in Zelle
Control Structures II Chapter 3
Lecture – 2 on Data structures
CSC 321: Data Structures Fall 2015
ICS103 Programming in C Lecture 1: Overview of Computers & Programming
Chapter 7 Part 1 Edited by JJ Shepherd
National 5 Computing Science Specimen Question Paper
Lecture 2 of Computer Science II
Understand the Programming Process
CIS 115 Possible Is Everything/snaptutorial.com
CIS115 Education for Service-- snaptutorial.com
CIS 115Competitive Success/tutorialrank.com
CIS 115 Lessons in Excellence-- cis115.com. CIS 115 All Exercises Devry University (Devry) For more course tutorials visit CIS 115 All.
CIS 115 Education for Service-- tutorialrank.com.
CIS 115 Education for Service-- cis115.com. CIS 115 All Exercises Devry University (Devry) For more course tutorials visit CIS 115 All.
CIS 115 Teaching Effectively-- snaptutorial.com
Final Grade Averages Weighted Averages.
Data Structures (CS212D) Overview & Review.
For Monday Read WebCT quiz 18.
CS139 – Fall 2010 How far we have come
Chapter 4: Algorithm Design
CS 1302 Programming Principles II
Python I/O.
Review for Test1.
For -G7 programing language Teacher / Shamsa Hassan Alhassouni.
Week # 1: Overview & Review
Understand the Programming Process
Data Structures (CS212D) Overview & Review.
Stella Kakavouli & Panagiotis Metaxas Computer Science Department
Algorithm Design and Analysis
Language Constructs Construct means to build or put together. Language constructs refers to those parts which make up a high level programming language.
Can you think of 2 purposes of the operating system?
Semester Averages: The whole story
COP3530- Data Structures Introduction
Basic Concepts of Algorithm
Dr. David Matuszek Spring, 2003
CS 1054 Final Exam Coverage Final exam will cover Chapters 1-8, 10-11
CSC 241: Introduction to Computer Science I
Week 5 - Friday CS 121.
Presentation transcript:

CS212 Data Structures 2018 Second Semester

Welcome to Data Structures Course & Wish you a Happy semester 

Percentage from overall grade Grading Assessment method Assessment Week   Grade Percentage from overall grade Quiz1 Week 6 2.5 2.5% Quiz2 Week 10 Lab Work& Assignment Weekly 5 5% Final Practical Exam Week 13 20 20% Blog Name: www.CS212.yolasite.com

What is Data Structures? In Java we learned how to program correctly (following user requirements) and coding with no errors Now, we need to be more professional programmers and not focus only on the correctness of the program, but on its “Efficiency” Efficiency will be concerned if the program is complex (huge data and users requests) For example, Google search is one the complex programs which need to be maintained in terms of its efficiency.

What is Data Structures? Program’s efficiency can be reached by structuring out the huge amount of data stored on it, and organize it in someway which makes it easy for the program to access it and thus it be more efficient. (i.e. organizing lots of papers in real life makes it easy for use to reach specific paper) Data structures have many formats; each one can be used for a specific program’s purpose. Examples: Array (classes’ grades), Queue (requests of a restaurant), Stack (undo in Microsoft word), etc.

Algorithms In order to make an efficient program we need to use data structure as well as writing an efficient algorithm i.e. 2 programmers may write same method doing the same purpose, but one may write it in a complex way (many for loops) and the other write it in “smart” way (single for loop). O( ) is a method efficiency measurement

Revision on Java Before diving into the data structures, let us review the Java language and write some code to refresh out ourselves 

Lab 1 Revision Questions Q1: Write a Java program to print a triangle shape of stars. Sample output:

Lab 1 Revision Questions Q2:  Write a Java program to compute the average of three numbers. The numbers should be enter by the user. Sample output:

Lab 1 Revision Questions Q3: Write a program, which reads Letters from the user , store them in an array ,and outputs how many times a particular letter appears in the array. Your program must: Read from the user the size of the array Get the letters from the user and store them in the array. Create CountLetters Method which gets an array as a parameter and counts how many times the letter appears. Your method should ask the user to enter a letter and it will print how many times this letter appears in an array.