ASSIGNMENT 3
SUBJECT: Find a turing machine simulator and use it to show how algorithm works.
TURING MACHINE SIMULATOR NAME: JFLAP
PROBLEM:
anbmck n+m < k
ALGORITHM:
(q0 , a) = (q1 , X , R)
(q1 , a) = (q1 , a , R)
(q1 , Y) = (q1 , Y , R)
(q1 , b) = (q2 ,
CEN342 Design and Analysis of Algorithms
QuizO2, March 1, 2016
Name: .
Number: .
1. Use the definitions of O , Q , and G) to determine whether the following assertions are true
a) TRUE FALSE: n(n+1) / 26 O(n3)
b) TRUE FALSE: n(n+1)/ 25 O(n2)
C) TRUE FALSE
CEN342 Design and Analysis of Algorithms Name: .
QuizOB, March 8th, 2016 Number: .
Consider the following algorithm:
Q01)
/Input: A positive integer
if n=1 return 1
else return Q(n1)+ 2x nl
a) What is the output of ths algorithm for n24.
b) Set up a recur
CEN342 Design and Analysis of Algorithms
Name:
Quiz05, March 28th, 2016
Number:
Problem:
An algorithm is given in the following pseudocode:
a) What does this algorithm perform? Trace the execution of this algorithm for x=34 and y=12
and print the result
CEN342 Design and Analysis of Algorithms
Name:
Quiz04, March 14th, 2016
Number:
Problem:
You work as a sales manager for a toy manufacturer, and you currently have three salespeople on the
road meeting buyers. Your salespeople Ali, Oya and Can are in st
CEN342 Design and Analysis of Algorithms
Name:
Quiz05, March 21st, 2016
Number:
Problem:
a) Apply quick sort to sort the array (44, 75, 23, 43, 55, 12, 64, 77, 33) in alphabetical order.
b) An in-place sorting algorithm is an algorithm which sorts input
Hukuk Balangc - Introduction to Law
Hukukun toplumdaki fonksiyonu, hukuk kurallarnn din, rf ve adet, ahlak kurallar
ile karlatrmas, hukukta yorum metotlar, hukukta usa vurma, kamu hukuku-zel hukuk
ayrm, normlar hiyerarisi, pozitif hukuk, tabii hukuk, huku
CENG 313 OPERATING SYSTEMS
Assoc. Prof. Dr. A. KOLTUKSUZ
2003-2004 Fall, Pop quiz
November, 11th. 2003
Q. 1 (10 points) In the solution to the dining philosophers problem, why is the state variable
set to HUNGARY in the function take_forks?
Q. 2 (60 point
CENG 313 OPERATING SYSTEMS
Assoc. Prof. Ahmet KOLTUKSUZ, Ph.D.
2008-2009 FALL TERM
Midterm, November 3rd 2008
Notes:
1. Duration is for one hour.
2. Open books and open notes exam as always, so be careful about the quality of your answers.
3. You may keep
CENG 313 OPERATING SYSTEMS
Assoc. Prof. Dr. A. KOLTUKSUZ
2002-2003 Fall, Midterm
December, 9th. 2002
Duration is for 90 minutes.
Open books & notes. The quality of your answers will be counted upon most.
Cooperation is strictly prohibited.
You may keep th
CENG 313 OPERATING SYSTEMS
Assoc. Prof. Ahmet KOLTUKSUZ, Ph.D.
2003-2004 FALL
Midterm, December 9th 2003
Notes:
Duration is for 1.5 hours.
Open books and open notes exam as always, so be careful about the quality of
your answers.
Collaboration is stric
CENG 313 OPERATING SYSTEMS
Assoc. Prof. Ahmet KOLTUKSUZ, Ph.D.
2000-2001 FALL TERM
1st Midterm, version:2, beta.
November 22nd 2000
Notes:
1. Duration is for two hours.
2. Open books and open notes exam as always, so be careful about the quality of your a
CENG 313 OPERATING SYSTEMS
Assoc. Prof. Ahmet KOLTUKSUZ, Ph.D.
2001-2002 FALL TERM
Midterm
December 10th 2001
Notes:
1. Duration is for 90 minutes.
2. Open books and open notes exam as always, so be careful about the quality of your answers.
4. Collaborat
CENG 313 OPERATING SYSTEMS
Assoc. Prof. Ahmet KOLTUKSUZ, Ph.D.
2001-2002 FALL TERM
1st Quiz, Beta Version
November 12th 2001
Notes:
1. Duration is for one hour.
2. Open books and open notes exam as always, so be careful about the quality of your answers.
CENG 313 OPERATING SYSTEMS
Assoc. Prof. Ahmet KOLTUKSUZ, Ph.D.
2000-2001 FALL TERM
1st Quiz
November 5th 2001
Notes:
1. Duration is for 30 minutes.
2. Open books and open notes exam as always, so be careful about the quality of your answers.
3. All questi
CENG 313 OPERATING SYSTEMS
Assoc. Prof. Ahmet KOLTUKSUZ, Ph.D.
2008-2009 FALL TERM
Final Exam, January 5th 2009
Notes:
1. Duration is for two hours.
2. Open books and open notes exam as always, so be careful about the quality of your answers.
3. You may k
CENG 313 OPERATING SYSTEMS
Assoc. Prof. A. KOLTUKSUZ
Instructor Serap ATAY
Research Assistant Selma TEKR
2003-2004 Fall Term
Final Exam January 14th 2004
Notes:
Open books & notes exam so pay attention to the quality of your answers.
Co-operation strict
CENG 313 OPERATING SYSTEMS
Assoc. Prof. A. KOLTUKSUZ
2000-2001 Fall Term
3 Midterm, January 10th 2001
rd
* same header -as usuall- applies *
Q.1 (5 points) Why are the page sizes always power of 2?
Q.2 (10 points) Consider a logical address space of eight
CENG 313 OPERATING SYSTEMS
Assoc. Prof. Dr. A. KOLTUKSUZ
2002-2003 Fall, Final Exam
January, 13th. 2003
Duration is for 90 minutes, Open books & notes.
Cooperation is strictly prohibited. No extra time will be given!
You may keep the questions sheet.
Q.1
CENG 313 OPERATING SYSTEMS
Assoc. Prof. Ahmet KOLTUKSUZ, Ph.D.
2008-2009 FALL TERM
Quiz, October 27th 2008
Notes:
1. Duration is for one hour.
2. Open books and open notes exam as always, so be careful about the quality of your answers.
3. You may keep th
CENG 313 OPERATING SYSTEMS
Assoc. Prof. Ahmet KOLTUKSUZ, Ph.D.
2000-2001 FALL TERM
Final Exam
January 25th 2001
Notes:
1. Duration is for two hours.
2. Open books and open notes exam as always, so be careful about the quality of your answers.
4. Collabora
CENG 313 OPERATING SYSTEMS
Assoc. Professor A. Koltuksuz, Ph.D.
Fall 2001-2002
Final Exam, January 15th. 2002
Notes:
Open books & notes exam, quality of your answers will count!
Co-operation is strictly and positively prohibited!
Duration is for two ho
Data Mining
Practical Machine Learning Tools and Techniques
Slides for Chapter 4 of Data Mining by I. H. Witten, E. Frank and
M. A. Hall
Algorithms: The basic methods
Inferring rudimentary rules
Statistical modeling
Constructing decision trees
Constructin
Data Mining
Practical Machine Learning Tools and Techniques
Slides for Chapter 1 of Data Mining by I. H. Witten, E. Frank and
M. A. Hall
Whats it all about?
Data vs information
Data mining and machine learning
Structural descriptions
Datasets
Weather, con
Data Mining
Practical Machine Learning Tools and Techniques
Slides for Chapter 5 of Data Mining by I. H. Witten, E. Frank and
M. A. Hall
Credibility: Evaluating whats been learned
Issues: training, testing, tuning
Predicting performance: confidence limits
Data Mining
Practical Machine Learning Tools and Techniques
Slides for Chapter 3 of Data Mining by I. H. Witten, E. Frank and
M. A. Hall
Input: Concepts, instances, attributes
Terminology
Whats a concept?
Whats in an example?
Relations, flat files, recurs
Data Mining
Practical Machine Learning Tools and Techniques
Slides for Chapter 3 of Data Mining by I. H. Witten, E. Frank and
M. A. Hall
Output: Knowledge representation
Tables
Linear models
Trees
Rules
Classification rules
Association rules
Rules with ex