Posts

Featured post

Image Processing

 Image Processing covers the investigation, creation and manipulation of digital images by computer. The course consists of theoretical material introducing the mathematics of images and imaging. Topics include representation of two-dimensional data, time and frequency domain representations, filtering and enhancement, the Fourier transform, convolution, interpolation. The student will become familiar with Image Enhancement, Image Restoration, Image Compression, Morphological Image Processing, Image Segmentation, Representation and Description, and Object Recognition. The objective of this course is to make students able to: develop a theoretical foundation of Digital Image Processing concepts. provide mathematical foundations for digital manipulation of images; image acquisition; preprocessing; segmentation; Fourier domain processing; and compression. gain experience and practical techniques to write programs for digital manipulation of images; image acquisition; preprocessing; se...
Post a Comment
Read more

Web Technology

Web Technology covers the fundamental concepts of HTML, CSS, JavaScript, XML, and PHP. The main objective of this course is to provide basic knowledge of web design using HTML and CSS, client side scripting using JavaScript, handling web data using XML and server side scripting using PHP. 🕮  Syllabus 🕮  Books 🕮  Notes 🕮  Old Questions 🕮  Solutions
Post a Comment
Read more

Cryptography

 Cryptography introduces the underlying the principles and design of cryptosystems. The course covers the basics concepts of cryptography including: traditional ciphers, block ciphers, stream ciphers, public and private key cryptosystems. The course also includes the theory of hash functions, authentication systems, network security protocols and malicious logic. The objectives of this course are to familiarize the students with cryptography and its applications. The students will be able to develop basic understanding of cryptographic mechanisms. 🕮  Syllabus 🕮  Books 🕮  Notes 🕮  Old Questions 🕮  Solutions Labsheet
Post a Comment
Read more

Simulation and Modeling

 Simulation and Modeling consists of introduction to system, modeling and simulation of different types of systems. It includes the modeling of systems, its validation, verification and analysis of simulation output. It comprises the concept of queuing theory, random number generation as well as study of some simulation languages. The main objective of this course is to make students understand the concept of simulation and modeling of real time systems. 🕮  Syllabus 🕮  Books 🕮  Notes 🕮  Old Questions 🕮  Solutions
Post a Comment
Read more

System Analysis and Design

System Analysis and Design familiarizes students with the concepts of information systems development including systems development life cycle, different approaches to systems development, project management, planning, analysis, design, implementation and maintenance. This course also covers some fundamental concepts of object oriented systems analysis and design. The main objective of this course is to provide knowledge of different concepts of system analysis and design so that students will be able to develop information systems using different methodologies, tools, techniques, and approaches. 🕮  Syllabus 🕮  Books 🕮  Notes 🕮  Old Questions 🕮  Solutions
Post a Comment
Read more

Design and Analysis of Algorithms

 Design and Analysis of Algorithms introduces basic elements of the design and analysis of computer algorithms. Topics include asymptotic notations and analysis, divide and conquer strategy, greedy methods, dynamic programming, basic graph algorithms, NP-completeness, and approximation algorithms. For each topic, beside in-depth coverage, one or more representative problems and their algorithms shall be discussed. The major objectives of this course are: Analyze the asymptotic performance of algorithms. Demonstrate a familiarity with major algorithm design techniques Apply important algorithmic design paradigms and methods of analysis. Solve simple to moderately difficult algorithmic problems arising in applications. Able to demonstrate the hardness of simple NP-complete problems 🕮  Syllabus 🕮  Books 🕮  Notes 🕮  Old Questions 🕮  Solutions <p style="text-align: center;"><button class="myb" style="appearance: none; background-color: white; borde...
Post a Comment
Read more