Description
Course Name: CERTIFICATE IN OPERATING SYSTEMS
Course Id: COS/Q1001.
Education Qualification: 10th Pass.
Course and Exam Fee: 2000.
How You will Get Diploma Certificate:
Step 1- Select your Course for Certification.
Step 2- Click on Enroll Now.
Step 3- Proceed to Enroll Now.
Step 4- Fill Your Billing Details and Proceed to Pay.
Step 5- You Will be Redirected to Payment Gateway, Pay Course and Exam Fee by Following Options.
Card(Debit/Credit), Wallet, Paytm, Net banking, UPI and Google pay.
Step 6- After Payment You will receive Study Material and Online Examination link on your email id.
Step 7- After Completion of Course Study give Online Examination.
Step 8- After Online Examination within 7 days you will get Diploma Certificate soft copy(Scan Copy) and Hard Copy(Original With Seal and Sign) within 30 days.
Step 9- After Certification you will receive Prospect Job Opportunities as per your Interest Area.
Online Examination Detail:
Duration- 60 minutes.
No. of Questions- 30. (Multiple Choice Questions).
Maximum Marks- 600, Passing Marks- 40%.
There is No Negative marking in this module.
Benefits of Certification:
- Government Authorized Assessment Agency Certification.
- Certificate Valid for Lifetime.
- Lifetime Verification of Certificate.
- Free Job Assistance as per your Interest Area.
Or You Can Fill below Enquiry form For Regular Course Training from our Training Centers located in India.
Student Course Enquiry Form
Syllabus
Certificate in Operating System
Introduction to operating System
Data Base Management System
Data Structure
Computer Oriented Numerical & Statistical Methods
Accounting & Management Control
Data Communication
Introduction to operating System
Evolution of operating systems (History of evolution of OS with the generations of computers), Types of operating systems, Multitasking, Timesharing, Multithreading, Multiprogramming and, Real time operating systems, Different views of the operating system, System Programmer’s view, User’s view, Operating system concepts and structure, Layered Operating Systems, Monolithic Systems. Processes: The Process concept, The process control block, Systems programmer’s view of processes, Operating system services for process management, Scheduling algorithms, First come first serve, Round Robin, Shortest run time next, Highest response ratio next, Multilevel Feedback Queues, Performance evaluation of scheduling algorithms stated above. Memory Management: Memory management without swapping or paging, Concepts of swapping and paging, Page replacement algorithms namely, Least recently used, Optimal page replacement, Most recently used, Clock page replacement.
Data Base Management System
Introduction: Advantage of DBMS approach, various view of data, data independence, schema and subschema, primary concepts of data models, Database languages, transaction management, Database administrator and users, data dictionary, overall system architecture. ER model: basic concepts, design issues, mapping constraint, keys, ER diagram, weak and strong entity sets, specialization and generalization, aggregation, inheritance, design of ER schema, reduction of ER schema to tables. Functional Dependencies and Normalization: basic definitions, trivial and non trivial dependencies, closure set of dependencies and of attributes, Database Integrity: general idea. Integrity rules, domain rules, attribute rules, relation rules, Database rules, assertions, triggers, integrity and SQL, Emerging Fields in DBMS: object oriented Databases-basic idea and the model, object structure, object class, inheritance, multiple inheritance, object identity, data warehousing- terminology, definitions, characteristics. Network and hierarchical models: basic idea, data structure diagrams, DBTG model, implementations, tree structure diagram, implementation techniques, comparison of the three models.
Data Structure
Stack and Queue: contiguous implementations of stack, various operations on stack, various polish notations-infix, prefix, postfix, conversion from one to another-using stack; evaluation of post and prefix expressions. Contiguous implementation of queue: Linear queue, its drawback; circular queue; various operations on queue; linked implementation of stack and queue- operations, Trees: definitions-height, depth, order, degree, parent and child relationship etc; Binary Trees- various theorems, complete binary tree, almost complete binary tree; Tree traversals-preorder, in order and post order traversals, their recursive and non recursive implementations; expression tree- evaluation; linked representation of binary tree-operations. Threaded binary trees; forests, conversion of forest into tree. Heap-definition, Graphs: related definitions: graph representations- adjacency matrix, adjacency lists, adjacency multilist; traversal schemes- depth first search, breadth first search.
Computer Oriented Numerical & Statistical Methods
Numerical approximation, Representation of integers and real numbers in computers, fixed and floating point arithmetic, normalized floating point numbers, Round off and truncation errors, relative and absolute errors. Iterative methods: Zeros of single transcendental equations and zeros of polynomials using bisections, false position, Newton Raphson methods. Convergence of solutions, Interpolation : Forward, Backward, central (Striplings) and divided difference formulas, lagrangie’s interpolation, Inverse interpolation for equal and unequal intervals, Simultaneous linear equations: Solutions of simultaneous linear equations – Gauss elimination method and pivoting, ill conditioned equations and refinement of solutions, Gauss-seidal iterative methods. Solution of differential equation: Runge-Kutta fourth order method. Euler’s method, Picard’s, Taylor’s series, Distributions : Binomial distribution, Poisson distribution and normal distribution, 2 distribution, Rectangular distribution, hypergeometric distribution.
Accounting & Management Control
Meaning and objects of accounting, accounting concepts and conventions, accounting equations, rules of Journalizing; Cash-book, Ledger posting, preparation of trial balance, rading and profit and loss account and balance sheet with adjustments relating to closing stock , outstanding expenses, prepaid expenses , accrued income depreciation, bad debts, provision for bad debts, provision for discount on debtors and creditors, Inventory pricing , FIFO and LIFO methods; Simple problems of funds flow statement, cost volume, profit analysis, Standard costing, computation of material and labour variances, budgetary control, preparation of cash budget and flexible budget, Management control and its characteristics, goals and strategies, structure and control. Responsibility centers and control centers: concepts of Responsibility centers, revenue centers, profit centers and investment centers, transfer pricing, Responsibility reporting.
Data Communication
Introduction to data communication: Components , data representation ,data flow and basic model ,data representation ,Serial & Parallel transmission , Modes of data transmission, Encoding: Unipolar, Polar ,Bipolar line & block codes ,Data compression ,Frequency dependant codes, Run length encoding ,Relative encoding ,LZ Compression ,Image and multimedia compression. Review of analog & digital transmission methods, Nyquist Theorem, Multiplexing: FDM, TDM, WDM, Synchronous & Statistical TDM, North American digital multiplexing hierarchy, European TDM, Spread spectrum: Frequency Hopping & Direct Sequence spread spectrum. Terminal handling & polling. Switched Communication Networks: Circuit, Message, Packet & Hybrid Switching, Softswitch Architecture with their comparative study, X.25, ISDN.