Courses in Current Semester

Nothing Found

Courses in Previous Semesters

이동컴퓨팅 : Mobile Computing

Graduate students attending this lecture hopefully with at least 3 years of industrial experience or equivalence will obtain a general understanding of wireless and mobile systems, and will be able to correlate with recent advances in Mobile Computing. This course introduces basic concepts for wireless communications of both voice/video and data, and offers android-based mobile programming modules. Many underlying system issues related to mobility support and channel allocation will be covered. Mobile Computing essentials including wireless LANs, Mobile IP, PMIP, wireless ad hoc and sensor networks, Software Defined Networks (SDN) and Internet of Things (IoT) will help understand why they are useful. The course also provides a practical view of recent research topics. In special, the course requires a survey and deep understanding of recent trend in a limited subject by reporting an academic and technical paper.

인터랙션사이언스컴퓨팅2 : Computing for Interaction Science II

This course provides an introduction to and overview of the field of humancomputer interaction (HCI). HCI is an interdisciplinary field that integrates theories and methodologies from computer science, cognitive psychology, design, and many other areas. It provides principles and methodologies studied from human factors, design, and cognitive psychology for the development of computer applications. The course is not only designed for technical HCI students (background in computer engineering or other engineering areas), but also non-technical HCI students (background in psychology, business, design, sociology, etc.). It also encourages students to exchange their ideas for developing solutions of problems common in HCI. It aims to provide the comprehensive understanding and applicative capabilities related to HCI issues. Recent advances in Web2.0, TinyOS, Social Networking Service, mWSN, Mobile OS, Mobile VoIP, Mobile IPTV, IPTV, IMS, Femtocell, Cloud Computing, Android OS, iPhone OS, QPS, and Social Network Social Technology IT Convergence will be discussed in the lecture if schedule allows.

Advanced Data Networks – ATM Networks

As a result of the continuing dramatic increase in the performance of computer systems, data networks with transmission bandwidths in Ethernet/Token Ring range of 10 Mbps, which is unable to transport real-time multimedia data, are no longer adequate to the task. As it is not possible to upgrade these traditional network topologies to higher bandwidth with real-time ability, an evolutionary leap towards a new technology will take place. This technology for data communication, which has already begun to replace the traditional data networks, is ATM. We will study “what ATM is” and “how ATM works” in this class.

SSIT : Generic Algorithms

This course covers advanced techniques after Data Structures course for analyzing upper and lower bounds for many essential alogorithms in Computer Science and Engineering. Problem discussed during the semester include sorting, advanced data structures, graphs, dynamic programming, divide-and-conquer method, greedy methods, combinatorial algorithms, and a brief introduction to NP-completeness.

정보통신대학원 : Data Structures

Design and analysis of data structures(DS) in terms of efficiency of programs. The purpose of this course is to introduce data structures necessary for solving computer-oriented problems, principles, and techniques for specifying algorithms. Classical DS design techniques are mostly discussed. Elementary DS for sorting, searching, and other operations on them include arrays, stacks, (circular) queues, linked lists, hash tables, trees, graphs, and strings.

정보통신대학원 : Algorithms and Complexity Theory

This course covers advanced techniques after Data Structures course for analyzing upper and lower bounds for many essential alogorithms in Computer Science and Engineering. Problem discussed during the semester include sorting, advanced data structures, graphs, dynamic programming, divide-and-conquer method, greedy methods, combinatorial algorithms, and a brief introduction to NP-completeness.