Course No. Course Title EE432 design and analysis of algorithms Course Description Credit Hours 3+1 Introduction to algorithms. Courses include sorting, searching, pattern matching, graph and network algorithms. Classes of algorithms, such as divideandconquer, randomized, branch-and-bound, greedy and dynamic programming.
Course No. Course Title EE432 design and analysis of algorithms Course Description Credit Hours 3+1 Introduction to algorithms. Courses include sorting, searching, pattern matching, graph and network algorithms. Classes of algorithms, such as divideandconquer, randomized, branch-and-bound, greedy and dynamic programming.
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online from Scribd
Course No. Course Title EE432 design and analysis of algorithms Course Description Credit Hours 3+1 Introduction to algorithms. Courses include sorting, searching, pattern matching, graph and network algorithms. Classes of algorithms, such as divideandconquer, randomized, branch-and-bound, greedy and dynamic programming.
Copyright:
Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online from Scribd
CS Operating System 3+1 Course Description Processing and threads. Process coordination and synchronization. Scheduling and dispatching. Physical and virtual memory organization. File systems. Networking fundamentals (Protocols, RPC, Sockets) Security. Protection. Distribution system. Real time computing. Embedded Systems. Mobile Computing Infrastructure. Recommended Books(s) Book Title Author(s) Text Publisher Year Book Title Author(s) Ref. Publisher Year
Course No. Course Title Credit Hours
CS Data Base Management 3+1 Course Description Introduction to database systems, File organization, database system architectures, data models, database design, relational systems, query optimization, recovery and concurrency control. Recommended Books(s) Book Title Author(s) Text Publisher Year Book Title Author(s) Ref. Publisher Year Course No. Course Title Credit Hours EE432 Design & Analysis of Algorithm 3+1 Course Description Design and analysis of efficient algorithms such as sorting, searching, pattern matching, graph and network algorithms. Classes of algorithms, such as divide- and-conquer, randomized, branch-and-bound, greedy and dynamic programming. Measuring the time and space complexity of algorithms. Relating the empirical performance of algorithms to theoretical predictions. NP-complete problems. Recommended Books(s) Book Title Author(s) Text Publisher Year Book Title Author(s) Ref. Publisher Year