Cinsdikici's Diary

Assoc.Prof.Dr. Muhammed Cinsdikici

Archive for the ‘@CompEng other Unv’ Category

MAB-233 Intro to Object Oriented Programming with JAVA

Posted by cinsdikici on October 22, 2012

OOBP

OOBP

Course Time: Wednesday, 10:30-12:30
Place: Izmir Unv., Room 304
Instructor: Assoc.Prof.Dr.Muhammed G. Cinsdikici, cinsdikici@gmail.com
Assistant: Deniz Özsoyeller
Lab Hour: Friday,10.30-12.20
Office Phone: +90(232) 311 3205
Platforms
* Group Info: izmirjava@googlegroups.com
Content: Introduction to Java. Class and Object Concepts, Control definitions, Methods in detail, arrays, Classes in detail, inheritence, multiclass, exception handling, files and streams, recursion, search and sorting.
Prerequisites: Graduate/undergraduate degrees from engineering faculties or software related departments. Fundemental computer archite. Familiarity with Operating Systems.
Textbooks: Java: How to Program, 9nd edition, Deitel & Deitel, 2012
Projects All Projects are due at the beginning of class. Due dates for projects will be announcedat least a week ahead of time. No late submission will be accepted!.
Tests: Students will have one final exam. Students will be tested on all material covered from lectures and text. Exams will test student’s ability of solving problems and understandingof concepts.
Grading: %20 HomeWorks + %30 MidTerm + %50 Final Exam
Late Submission: Late submission of projects will not be accepted.
Tools & Materials: 1. Netbeans / Eclips2. Java sdk & re
Week Date Lecture Readings Notes HomeWorks
1 03 October 2012 Introduction to Object Oriented Prg & Java
2 10 October 2012 Object and Class Concept
3 17 October 2012 Controls-I Hmw# 1
4 24 October 2012 Controls-II
5 31 October 2012 Deep Looking to Methods
6 07 November 2012 Arrays Hmw# 2
7 14 November 2012 Deep Looking to Object Classes
8 19-26  November 2012 Midterm
9 28  November 2012 Inheritance Hmw# 3
10 05 December 2012 Polymorphisim
11 12  December 2012 Exception Handling
12 19  December 2012 Strings & Character Objects Hmw# 4
13 26  December 2012 Files, Streams & Object Serialization
14 02 February 2012 Recursion, Search & Sort – I
15 09 February 2012 Recursion, Search & Sort – II
16 14-25 February 2012 Final Exam

 

Projects / Assignments:
Advertisements

Posted in OOP with Java | Leave a Comment »

MBIL 203 – Data Structures

Posted by cinsdikici on December 3, 2011

Course Time: Thursday, 09:30-12:00
Place: UBE, Room 19
Instructor: Assoc.Prof.Dr.Muhammed G. Cinsdikici, muhammed.cinsdikici@ege.edu.tr // cinsdikici@gmail.com
Assistant: Res.As. Züleyha Dağdeviren
Ofice Hour: Thursday,13.30-15.00
Office Phone: +90 (232) 484 34 34
Platforms 1. Netbeans / Eclipse

2. Java SDK & RE

Outcomes:
The purposes of the course for students are.1. Learn to program in Java
2. Learn to use the STL (Standard Template Library)
3. Learn to evaluate, select, and use libraries implementing algorithms and data structures
4. Learn key principles of algorithm and data structure design, students successfully completing the course will be able to;
a. Produce Java programs using, classes, objects, templates, pointers, references and I/O
b. Programs using binary trees and associated algorithms,
c. Designs of programming solutions independent of programming languages
d. Descriptions of the time and space requirements of algorithms and data structures to make appropriate design decisions5. The concept of templates in terms of generic programmingThe students successfully completing the course will be able to
1. Participate in project design teams
2. Contribute to various phases of software development from requirements through implementation
3. Trouble-shoot programs and implement fixes for software with performance problems
4. Port difficult-to-maintain legacy code to smaller, efficient, extensible code
Overview: How to program in Java, including how to evaluate, select, and use libraries that implement a variety of algorithms and data structures- Familiarize themselves with some of the key principles for designing algorithms and data structures.- Know how to write Java codes using templates, classes and objects, references, and Java input and output.

– Know how to write programs using binary search trees, and pointer and array representations of graphs.

– Learn about the time and space requirements of various algorithms and data structures, which will help them make sound programming choices.

-Learn how to implement the design principles of divide-and-conquer, backtracking, and dynamic programming.

Prerequisites: Graduate/undergraduate degrees from engineering faculties or software related departments. Fundemental computer architecture background. Familiarity Operating Systems
Textbooks Data Structures and Other Objects Using Java, 4/E, M.Main, Pearson, 2012Data Structures & Algorithms, M.T. Goodrich, R.Tamassia, Wiley, 2011

Data Structures & Algorithm Analysis in Java, M.A.Weiss, Pearson, 2007

Programlama ve Veri Yapılarına Giriş (C, C++ ve JAVA ile), Şadi Evren ŞEKER, 2009

 

Projects All Projects are due at the beginning of class. Due dates for projects will be announcedat least a week ahead of time. No late submission will be accepted!.
Tests: Students will have one final exam. Students will be tested on all material covered fromlectures and text. Exams will test student’s ability of solving problems and understandingof concepts.
Grading: %20 HomeWorks + %30 MidTerm + %50 Final Exam
Late Submission: Late submission of projects will not be accepted.
Tools & Materials:
* Microsoft Academic Program – Operating Systems- Student Resource Kit (1.93 Gbyte – ISO)
Lectures:
Week Date Lecture Reading Notes Homework
1 03 October 2012 Introduction to Java Programming
2 10 October 2012 Object Oriented Design
3 17 October 2012 Arrays Hmw# 1
4 24 October 2012 Linked Lists
5 31 October 2012 Stacks
6 07 November 2012 Queues Hmw# 2
7 14 November 2012 Generic Programming
8 19-26 November Midterm Exam
9 28 November 2012 Recursion Hmw# 3
10 05 December 2012 Tree’s: Fundementals
11 12 December 2012 Tree’s: More.. (Heap, B-Tree)
12 19 December 2012 Search Algorithms Hmw# 4
13 26 December 2012 Sort Algorithms
14 02 February 2012 Text Processing
15 09 February 2013 Graphs
16 14-25 February 2013 Final Exam
Projects / Assignments: Assignment 01 – Assignment#0Assignment 02 – Assignment#1Assignment 03 – Assignment#2Assignment 04 – Assignment#3Assignment 05 – Assignment#4Final Project – FINAL PROJECT

Posted in Data Structures | Leave a Comment »

MBIL-102 INTRODUCTION to C PROGRAMMING

Posted by cinsdikici on December 3, 2011

Course Time: Monday, 09:30-12:30
Place: UBE, Room 220
Instructor: Assoc.Prof.Dr.Muhammed G. Cinsdikici, cinsdikici@gmail.com
Assistant:
Ofice Hour: Monday,13.30-14.30
Office Phone: +90(232) 311 3205
Platforms
* Group Info: gedizcprog@googlegroups.com
Content: Programming with C, Structured Development in C, Functions, Arrays, Pointers, Data Structures, File Processing and other important programming concepts.
Prerequisites: Graduate/undergraduate degrees from engineering faculties.Fundemental computer architeFamiliarity with UNIX/Linux Operating Systemscture background.
Textbooks: C How to Program (6.th Edt), Paul Deitel and Harvey Deitel, Pearson, 2010The bookseller info:

1. Pandora, pandora.com.tr

http://www.pandora.com.tr/urun/c-how-to-program-6e-pie/191946

2. Amazon, amazon.com

http://www.amazon.com/C-How-Program-Paul-Deitel/dp/0136123562/ref=sr_1_1?ie=UTF8&qid=1300043301&sr=8-1

Projects All Projects are due at the beginning of class. Due dates for projects will be announcedat least a week ahead of time. No late submission will be accepted!.
Tests: Students will have one final exam. Students will be tested on all material covered from lectures and text. Exams will test student’s ability of solving problems and understandingof concepts.
Grading: %20 HomeWorks + %30 MidTerm + %30 Final Exam + %20 Final Project
Late Submission: Late submission of projects will not be accepted.
Tools & Materials: 1. Microsoft Visual C++ Express Edition (for Windows) [http://www.microsoft.com/express/vc]

2. GNU C++ (for Linux) [http://gcc.gnu.org/install]

3. Deitel’s Home for book [http://www.deitel.com/Books/C/CHowtoProgram6e/tabid/3527/Default.aspx]

Lectures:

Lecture01 – Introduction to Computers, the Internet and the Web

Lecture02 – Introduction to C Programming

Lecture03 – Structured Program Development in C

Lecture04 – C Program Control

Lecture05 – C Functions

Lecture06 – C Arrays

Lecture07 – C Pointers

Lecture08 – C Characters and Strings

Lecture09 – C Formatted Input/Output

Lecture10 – C Structures, Unions, Bit Manipulations and Enumerations

Lecture11 – C File Processing

Lecture12 – C Data Structures

Lecture13 – C Preprocessor

Lecture14 – Other C Topics

Lecture15 – C++ as a Better C; Introducing Object Technology

Lecture16 – Introduction to Classes and Objects

Lecture17 – Classes: A Deeper Look, Part 1

Lecture18 – Classes: A Deeper Look, Part 2

Lecture19 – Operator Overloading

Lecture20 – Object-Oriented Programming: Inheritance

 

Lecture21 – Object-Oriented Programming: Polymorphism

Lecture22 – Templates

Lecture23 – Stream Input/Output

Lecture24 – Exception Handling

Projects / Assignments: Assignment 01 – Assignment#0Assignment 02 – Assignment#1

Assignment 03 – Assignment#2

Assignment 04 – Assignment#3

Assignment 05 – Assignment#4

Final Project – FINAL PROJECT

Posted in C Programming | Leave a Comment »