Scribd
Upload
307 views1 page

Foundation of Computer Science

The document outlines the course content for two computer science courses: Foundation of Computer Science and Advanced Algorithms. Foundation of Computer Science covers data structures, operating systems, automata theory, and database systems. Advanced Algorithms focuses on algorithm fundamentals, sorting algorithms, advanced data structures, parallel algorithms, algorithm design techniques, graph algorithms, and NP-complete problems.

Uploaded by

Backup Contact iPhone Manu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
307 views1 page

Foundation of Computer Science

The document outlines the course content for two computer science courses: Foundation of Computer Science and Advanced Algorithms. Foundation of Computer Science covers data structures, operating systems, automata theory, and database systems. Advanced Algorithms focuses on algorithm fundamentals, sorting algorithms, advanced data structures, parallel algorithms, algorithm design techniques, graph algorithms, and NP-complete problems.

Uploaded by

Backup Contact iPhone Manu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

FOUNDATION OF COMPUTER SCIENCE (MTCS101)

UNIT-I: DATA STRUCTURE

List, Stack, Queue, Tree, Hash Table, Graph, Search and Sorting Algorithms.

UNIT-II: OPERATING SYSTEM

Scheduling Algorithm, Synchronization Technique, Paging and Segmentation, Virtual Memory.

UNIT-III: AUTOMATA THEORY

Finite Automata, Regular Expression, Context Free Grammar, Push Down Automata, Turing

Machine, P and NP Class.

UNIT-IV: DATABASE SYSTEM

Concepts and Architecture; Data Model; Normalization; SQL Advanced Transaction Processing,

Deadlock and Concurrency Control; Object Oriented and Object Relational Databases: Parallel

and Distributed Databases; Backup and Recovery Concepts, Emerging Database Technologies.

ADVANCED ALGORITHM (MTCS102)

Algorithm Fundamentals: Basic Concept, Analysis of Algorithm, Growth of Functions,

Master’s Theorem.

Analysis of sorting Algorithms: Overview, Merge sort, Quick sort, Heap sort, radix sort.

Advance Data Structure: Red-Black Trees, B/B+ Trees.

Parallel Algorithm: Performance Measures of Parallel Algorithms, Parallel Merging/Sorting

Algorithms on CREW/EREW, Parallel searching algorithms.

Advance Design and Analysis Techniques: Dynamic Programming, Greedy Algorithms,

Branch and ound, Back Tracking.

Graph Algorithm: DFS and BFS algorithm.

NP Complete Problem

You might also like