CENG 218 Data Structures 2016-2017 Spring


Final exam Topics:

  • Linked List (singly linked list)
    • various insert and delete algorithms
  • Stack (implementation)
  • Queue (implementation)
  • Recursion
  • Binary Trees (implementation)
    • Traversals (Inorder, postorder, preorder and level order traversal)
    • various recursive algorithms related with binary trees (search, sum nodes, number of leaf nodes, etc..)
  • Binary Search Trees
    • Insert, delete, search (recursive and non recursive algorithms)
  • Min-Heap, Max-Heap (implementation)
    • deleteMin or deleteMax
    • insert
  • Binary Search on arrays
  • Sort Algorithms
    • insertion sort
    • bubble sort
    • selection sort
    • quick sort
      • partition algorithm


Visual Studio

C Programming Related Links:

C Coding Standards

CENG 218 MT1 Summer 2016

CENG 2018 Final Spring 2015-2016

CENG 2018 MT1 Spring 2015-2016

CENG 218 Final Spring 2014-2015

CENG 218 MT2 Spring 2014-2015

CENG 218 MT1 Spring 2014-2015 (solutions )

CENG 218 MT1 Spring 2009-2010Solution

ceng 218 MT1 Spring 2011-2012

CENG 218Final 2010-2011Spring

CENG 218MT1 2010-2011Spring

ceng218 Final Spring 2011-2012





ceng218MT1 Spring2006


Ceng 2006-2007SpringMT1

Ceng 2006-2007FallFinal



Jplag Home


JPlag is a system that finds similarities among multiple sets of source code files. This way it can detect software plagiarism.



The purpose of this course is to provide the students with solid foundations in the basic concepts of programming: data structures and algorithms. The main objective of the course is to teach students about structures and algorithms which allow them to write programs which can efficiently manipulate, store, and retrieve data.


  • Fundamentals of Data Structures in C, Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed, ISBN 0-7167-8250-2 (amazon link)
  • Data Structures and Algorithm Analysis in C, 2/E Mark Allen Weiss, Florida International University Publisher: Addison-Wesley: 1997 600 pp 
  • Richard Gilberg, Behrouz Forouzan
    ISBN: 0-534-39080-3 © 2005
    Publish date: October 11, 2004
    672 pages Hardcover
  • Langsam Y., Augenstein M., Tenenbaum A. Data Structures Using C and C++, 2nd edition, Prentice Hall Int., 1996 (ISBN 013-529322-7)
  • Data Structures and Program Design in C, by Kruse R, Tondo C and Leung B. Prentice Hall

You can optionally follow C related subjects from following text book

Computer Science: A Structured Programming Approach Using C, Third Edition
Behrouz Forouzan, Richard Gilberg
ISBN 13: 978-0-534-49132-1 © 2007
ISBN 10: 0-534-49132-4
Publish date: February 6, 2006
1184 pages



Lecture Notes

Final exam will cover above subjects.

Lab Works (click here)


  • Will be puhlished on 19/07/2016

Last update : August 17, 2017