COURSE DETAIL
COURSE DETAIL
This course examines the http protocol and its add ons. It covers relevant technologies and programming languages such as (X)HTML, CSS, JavaScript and framework; the development of the world wide web from a historical context; and technical aspects of the world wide web.
COURSE DETAIL
This course examines the intricacies of Android Mobile Application development. Throughout the course students must program a number of smaller tutorial applications, concurrently with a larger course long programming project, an application of their own design. In parallel with these programming assignments, students learn details of Android application design through tutorials and lectures.
COURSE DETAIL
COURSE DETAIL
COURSE DETAIL
The course provides a background on the fundamentals of cryptography for those interested in carrying out cryptographic research or employing cryptographic security. Course topics include classical cryptography, Shannon's theory of secrecy, shift register theory and stream ciphers, public key cryptography, authentication codes, and secret sharing. Students must also complete a course project.
COURSE DETAIL
This course provides an introduction to the art and craft of computer programming and object-oriented design using Java. It offers a first look at building graphical applications and forms a base from which you can learn other programming languages and techniques. COMP 160 is a prerequisite for all second year papers in Computer Science. While it is suitable for students enrolled for any degree, it is particularly designed for students taking a BSc, BA or BCom degree.
COURSE DETAIL
COURSE DETAIL
COURSE DETAIL
This course will study the design and analysis of exact and approximation algorithms for various optimization problems using advanced techniques such as combinatorial methods, probabilistic methods, linear programming, semidefinite programming, and spectral methods. The course also covers spectral algorithms and related convex programs, SDP duality, multiplicative weight update, graph spectrum, eigenvalue interlacing, Cheeger–Alon–Milman inequality, random walks, local graph partitioning, expanders, Laplacian solver, effective resistance, sparsification, matrix scaling, abstract simplicial complex, and random spanning trees.
Pagination
- Previous page
- Page 92
- Next page