The document lists course codes and titles for various computer science courses including:
- Operating Systems which covers processes, memory management, and file systems.
- Theory of Automata which introduces finite state models, regular expressions, and finite automata.
- Design & Analysis of Algorithms which covers algorithm efficiency, recursion, sorting, and graph algorithms.
- Numerical Computing which covers numerical methods like differentiation, integration, and solving equations.
- Human Resource Management which provides an overview of managing human resources, recruitment, and organizational change.
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
0 ratings0% found this document useful (0 votes)
152 views2 pages
4th Semester
The document lists course codes and titles for various computer science courses including:
- Operating Systems which covers processes, memory management, and file systems.
- Theory of Automata which introduces finite state models, regular expressions, and finite automata.
- Design & Analysis of Algorithms which covers algorithm efficiency, recursion, sorting, and graph algorithms.
- Numerical Computing which covers numerical methods like differentiation, integration, and solving equations.
- Human Resource Management which provides an overview of managing human resources, recruitment, and organizational change.
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/ 2
CSI-402 CSI-404 CSI-406 CSI-408 BBA-506
Operating Theory of Design & Numerical Human
Systems Automata Analysis Computing Resource of Algorithms Management History and goals Finite state models Introduction The concepts of An overview of efficiency human resource management Evolution of Language Asymptotic Reliability and An overview of multi-user definitions notations accuracy of a human resource systems preliminaries method manager Process and CPU Regular Recursion and Minimizing The environment management expressions/regular recurrence computational of human languages relations errors resource management Multithreading Finite automata Divide-and- Theory of External and (FAS). conquer approach differences internal environment Kernel and user Transition graphs Sorting Difference Equal modes (TGS), operators employment opportunity and affirmative action Protection NFAS Search trees; Difference tables Job analysis Problems of Kleene ‘s theorem Heaps Forward A basic human cooperative differences resource tool processes Synchronization Transducers Hashing Backward Human resource (automata with differences and planning output), central differences Deadlocks Pumping lemma and Greedy approach Mathematical Recruitment, and non-regular preliminaries selection language grammars and PDA: Memory Context free Dynamic Solution of Organization management and grammars programming equations in one change and virtual memory variable human resource development. Relocation Derivation Graph algorithms Interpolation and Corporate culture polynomial and organization approximation development External Derivation trees and Shortest paths Numerical Career planning fragmentation ambiguity differentiation development and numerical integration, Paging and Simplifying CFLS Network flow Initial value Performance demand paging problems for appraisal ordinary differential equations Secondary Normal form Disjoint sets Direct methods storage grammars and for solving linear parsing systems Security and Decidability Polynomial and Iterative protection matrix techniques in calculations matrix algebra File systems Chomsky ‘s String matching Solution of non- hierarchy of linear equations grammars Turing machines theory I/o systems Turing machines Np complete problems Introduction to Post machine Approximation distributed algorithms. operating systems Scheduling and Variations on tm dispatch Introduction to Tm encoding concurrency Lab assignments Universal Turing involving machine different single and multithreaded OS algorithms. Context sensitive grammars Define computers by tm