ceng334.cankaya.edu.tr
Home - Computer Networks CourseComputer Networks, Computer Networks Course, Computer Networks Dersi, Course, Ders, Course Notes, Ders Notu
http://ceng334.cankaya.edu.tr/
Computer Networks, Computer Networks Course, Computer Networks Dersi, Course, Ders, Course Notes, Ders Notu
http://ceng334.cankaya.edu.tr/
TODAY'S RATING
>1,000,000
Date Range
HIGHEST TRAFFIC ON
Monday
LOAD TIME
PAGES IN
THIS WEBSITE
0
SSL
EXTERNAL LINKS
1
SITE IP
0.0.0.0
LOAD TIME
0 sec
SCORE
6.2
Home - Computer Networks Course | ceng334.cankaya.edu.tr Reviews
https://ceng334.cankaya.edu.tr
Computer Networks, Computer Networks Course, Computer Networks Dersi, Course, Ders, Course Notes, Ders Notu
Home - Algorithms Course
Total Visitors : 19441. Visitors This Month : 703. Last Modified : 08.05.2015. CENG 310 - Algorithms. Asymptotic notation. Divide and conquer approach. Solving recurrences: substitution method, master method. Bounding summations. Analysis of randomized quicksort. Heaps: heapsort, priority queues. Sorting in linear time. Greedy algorithms. Elementary graph algorithms: breadth-/depth-first search, topological sort, strongly connected components. Http:/ www.sorting-algorithms.com/.
Home - Operating System Course
Total Visitors : 40805. Visitors This Month : 100. Last Modified : 09.02.2018. CENG 328 Operating Systems. The student will be taught principles of modern operating systems. In particular, it will cover details of concurrent processes, multi-threads, CPU scheduling, memory management, file system, storage subsystem, and input/output management, The course will integrate theory and practice through coordinated lecture and lab hours, supported by assignments. Prof Dr. Müslim Bozyiğit.
Home - Microprocessors Course
Total Visitors : 35263. Visitors This Month : 380. Last Modified : 24.12.2015. Introduction to microprocessors. Microcomputer architecture. An example microprocessor. Arithmetic Logic Unit structure. Assembly language programming. Timers and interrupts. Parallel and serial Input/Output programming. Application examples. Students should be able to. Solve basic binary math operations. Choose an appropriate type microprocessors for practical application. Analyze assembly language programs for microprocessor.
Home - Data Communications Course
Total Visitors : 69825. Visitors This Month : 149. Last Modified : 10.03.2016. Phone: Ext. 1338. Email: reza@cankaya.edu.tr. Sinan Onur Altınuç. Phone: Ext. 1349. Email: sinanonur@cankaya.edu.tr.
ceng3336
Zé da Fisga - Signos. António Velez - Tlm: 962588130 - E-mail: antoniomachadovelez@gmail.com. Back to main menu.
Home - Computer Networks Course
Total Visitors : 33988. Visitors This Month : 1304. Last Modified : 05.05.2015. Asst Prof. Dr. Reza HASSANPOUR. Tel: 90 312 2331338. Web page : academic.cankaya.edu.tr/ reza. Efe Çiftçi. Tel: 90 312 2331349. Web page : academic.cankaya.edu.tr/ efeciftci.
Home - Data Management and File Structures Course
Data Management and File Structures. Total Visitors : 108158. Visitors This Month : 228. Last Modified : 05.01.2018. HW1 AND HW2 Grades Are Announced @ HomeWorks Page. Welcome to CENG 351. Assistant: Ulaş Güleç. Tel : (312) 2331354.
Home - Database Management Systems Course
Total Visitors : 70382. Visitors This Month : 244. Last Modified : 10.04.2017. Http:/ academic.cankaya.edu.tr/ roya.
ceng365.com
Home - Web Development Course
Total Visitors : 3261. Visitors This Month : 149. Last Modified : 26.09.2016. Assist. Prof. Dr. Murat SARAN. Office#: L220 Phone: 233 13 41 E-mail: saran[AT]cankaya.edu.tr. Assistant: Ulaş GÜLEÇ. Office#: L205 Phone: 233 13 54 E-mail: ulasgulec[AT]cankaya.edu.tr. General introduction, objectives of the course. The Internet and the World Wide Web. Object-oriented Concepts in C#. Overview of the .NET development platform. Database: SQL, LINQ, Entity framework. ASPNet and SQL Server Database Connection.
Home - Algorithms Course
Total Visitors : 4968. Visitors This Month : 146. Last Modified : 16.10.2016. CENG 383 - Algorithms. Yrd Doç. Dr. Murat YILMAZ. Asymptotic notation. Divide and conquer approach. Solving recurrences: substitution method, master method. Bounding summations. Analysis of randomized quicksort. Heaps: heapsort, priority queues. Sorting in linear time. Greedy algorithms. Elementary graph algorithms: breadth-/depth-first search, topological sort, strongly connected components. 4th Edition by Robert.