1- Write a Circular Double Linked List class which includes the following methods:
(which inserts a new element to the end of the list)
- Display (which prints all items from last to first)
CircularDoubleLinkedList CDLL = new Ci
Laboratory Worksheet #7
Asst. Prof. Dr. Gkhan DALKILI
Asst. Prof. Dr. Zerrin IIK
Res. Asst. Dr. Emel ALKIM
Res. Asst. Mustafa BATAR
Res. Asst. Fatih DCLE
April 9-10, 2015
Concepts of Programming Languages
Upload the answer of the following question from Lectures until 27.04.2014, 23:55.
1- Write an object oriented program for public transportation management system.
The system has one bus, three bus stations (B1, B2, B3), and many passengers.
B1 is t
Upload the answer of the 4th question (only the last question) (Eternas Game) from Lectures until
1- Write a java program that takes an infix expression from the user and then converts into postfix
using stack data structure.
1Define a Point class with:
Two attributes: x and y
First one is to construct a point at given coord (x, y) values
Second one is to construct a point at the origin (0,0) as default.
Define an Edge
Upload the answer of the following question from Lectures until 28.05.2014, 15:00.
1- Write a Multiple Choice Test program that
- allows teachers to prepare a test and
- allows students to take the test.
The program should support two important ope
Upload this assignment from Lectures until 26.03.2014, 15:00.
In this assignment, implement a simple Supermarket Management System.
The software will be used by Mipa which is a supermarket chain, including a range of store sizes from
1- Write a Java program that
- inserts randomly generated 8 numbers into a single linked list,
- displays the list
- takes a number from the user and removes all numbers in the list which are equal to
this given number.
The single linked list class
1- Write a program that inserts randomly generated 10 numbers into a
stack and print the content of the stack on the screen by using an another
stack (temporary stack).
Create a Stack class with:
1- Write a program that randomly generates 10 numbers (between 1 and
100), inserts odd numbers into Q1 and even numbers into Q2, and prints the
contents of the queues without removing their elements.
Create a Linear Queue class with:
1- Write a Double Linked List class which includes the following methods:
(which inserts a new element into the list (adds to the end of the list)
- Remove (which has a parameter to delete the item from the list)
(which returns the num
Due Date: March 19, 2014 (submit via ODTU-Class)
Given N axis-parallel rectangles in the plane, design a plane sweep algorithm to
report the number of intersecting rectangle pairs. Two rectangles are also
Ariel Stolerman \ CS623 Winter 2012 Assignment #2
CS623 Winter 2012 \ Assignment #2
be a set of
disjoint line segments whose upper endpoints lie on the line
, partitioning the horizontal strip [
a binary search tree of the se
Computational Geometry - Homework II (Solutions)
West Virginia University,
1. Linear Programming: A simple polygon P is said to be star-shaped, if it contains a point q, such that for a
An intoductory tutorial on kd-trees
Andrew W. Moore
Carnegie Mellon University
Extract from Andrew Moore's PhD Thesis: Ecient Memory-based Learning for Robot Control
PhD. Thesis; Technical Report No. 209, Computer Laboratory, University of
CENG 570: COMPUTATIONAL GEOMETRY HOMEWORK 4, SPRING 2017
Data Structures to Determine the Number of
Intervals of a Query Point
Kemal Oksuz, METU (2270510)
In this homework we are asked to construct data structures that are designed to count the number o
Advanced Algorithms, Fall 2007
Due: Nov 13th, 2007
Each of the problems should be solved on a separate sheet of paper to facilitate grading. Please
don't wait until the last minute to look at the problems.
Problem 1 A slab is a
CENG 570: COMPUTATIONAL GEOMETRY HOMEWORK 1, SPRING 2017
Intersecting Rectangle Pairs
Kemal Oksuz, METU (2270510)
In this homework we are asked to design a plane sweep algorithm that outputs the number of the intersecting rectangles given
N axis paralle
CENG 570: COMPUTATIONAL GEOMETRY HOMEWORK 2, SPRING 2017
Smallest Enclosing Disc Time Complexity Analysis
Kemal Oksuz, METU (2270510)
In this homework we are asked to analyze the time complexity of the smallest enclosing disc problem. The algorithm is
Department of Computer Science & Mathematics
MATH 2216 / COSC 2216 - Computational Geometry I
Instructor: A. Karassev
MIDTERM EXAMINATION - SOLUTIONS
1. Let P be a simple polygon (not necessarily convex) and n be the number
The vector direction of E gives the state of polarization.
Linearly polarized light has E vector along one direction in 3D (B is
perpendicular to this direction and determined by direction of
propagation wave from Poynting Vector)
E Eo sin(
IS100 ASSIGNMENT 2 - Data Analysis and MS Excel
Q1: 20 points(a-4 b-7 c-9), Q2: 40 points(8 points each), Q3:40 points(a-3 b-17 c-17 d-3 points each)
The data file in .txt format shows some information about goods that are delivered by an international fr
HW 4 / SUGGESTED HW PROBLEMS/ Total: 9 PROBLEMS
1. A Q-switched laser uses a cavity with a length of 1m and an average mirror reflectivity of r = 0.9.
The gain medium is an Nd:YAG crystal, which is pumped by a flashlamp.
a) What is a flashlamp, a
Journal of the Optical Society of Korea
Vol. 18, No. 5, October 2014, pp. 589-593
ISSN: 1226-4776(Print) / ISSN: 2093-6885(Online)
Design and Performance Analysis of a Multi Wavelength Terahertz Modulator
PHYSICS 420 INTRODUCTON TO OPTPELECTRONICS II
FIBER-OPTICS HANDLING, MANIPULATION
FIBER-OPTICAL DATA TRANSMISSION
Date of experiment:24/03/2016
Name & Surname: ECRN AVCI
ID Number: 1868223
Purpose: The experiment has 3 importan
Tips for Oral Citations
We generally expect presentations to include oral citations of sources.
This expectation is reflected in the material trait in the rubric. (If
you require a written outline, citations should be included in the
outline. Also conside
Detection of single nano-defects in
photonic crystals between crossed
Jon Olav Grepstad,1, Peter Kaspar,2 Ib-Rune Johansen,3 Olav
Solgaard,4 and Aasmund Sudb5,6
of Electronics and Telecommunications, Norwegian University of Science