C Homework Collection

This course contains homework collection for C programming language.


Object Oriented Programming with Java I
Koçyiğit, Altan(2009)
This course covers the object oriented programming in the Java Programming Language. The basics of the Java Programming Language are given, object oriented aspects of the Java Programming Language are used to introduce the concepts of object oriented programming, and using the Java libraries to manipulate objects is illustrated. At the end of the course you will be able to create and use objects to write programs in the Java Programming Language.
Multi-objective integer programming: A general approach for generating all non-dominated solutions
Oezlen, Melih; Azizoğlu, Meral (Elsevier BV, 2009-11-16)
In this paper we develop a general approach to generate all non-dominated solutions of the multi-objective integer programming (MOIP) Problem. Our approach, which is based on the identification of objective efficiency ranges, is an improvement over classical epsilon-constraint method. Objective efficiency ranges are identified by solving simpler MOIP problems with fewer objectives. We first provide the classical epsilon-constraint method on the bi-objective integer programming problem for the sake of comple...
Object Oriented Programming with Java II
Koçyiğit, Altan(2009)
This is the second course covering the object oriented programming in the Java Programming Language. In this course some advanced features of the Java Language and J2EE platform are introduced. At the and of this course you will be able to prepare a GUI for an application which can have multiple threads, communicate through the Internet and storing/retrieving information in databases. In addition, you will be able to create applets which can run in web browsers.
Some new results on binary polynomial multiplication
Cenk, Murat (2015-11-01)
This paper presents several methods for reducing the number of bit operations for multiplication of polynomials over the binary field. First, a modified Bernstein's 3-way algorithm is introduced, followed by a new 5-way algorithm. Next, a new 3-way algorithm that improves asymptotic arithmetic complexity compared to Bernstein's 3-way algorithm is introduced. This new algorithm uses three multiplications of one-third size polynomials over the binary field and one multiplication of one-third size polynomials ...
Efficient interleaved Montgomery modular multiplication for lattice-based cryptography
AKLEYLEK, SEDAT; Tok, Zaliha Yuce (2014-01-01)
In this paper, we give modified version of interleaved Montgomery modular multiplication method for lattice-based cryptography. With the proposed algorithms, we improve the multiplication complexity and embed the conversion operation into the algorithm with almost free cost. We implement the proposed methods for the quotient ring (Z/qZ)[x]/(x(n) - 1) and (Z/pZ)[x]/(x(n) + 1) on the GPU (NVIDIA Quadro 600) using the CUDA platform. NTRUEncrypt is accelerated approximately 35% on the GPU by using the proposed ...
Citation Formats
G. Üçoluk, “C Homework Collection,” 00, 2011, Accessed: 00, 2020. [Online]. Available: https://ocw.metu.edu.tr/course/view.php?id=141.