HYV Syllabus: Master of Computer Science (M.Sc.) Semester (I, II,III, IV) Session 2017-19 – PG-Semester

हेमचंद यादव विश्वविद्यालय (HYV Durg) का Master of Computer Science (M.Sc.) Semester (I, II,III, IV) Session 2017-19 सिलेबस (Syllabus) PDF फ्री डाउनलोड करें – MSc। आधिकारिक सिलेबस – इकाइयाँ, अंक और पेपर की पूरी जानकारी।

PDF

Master of Computer Science (M.Sc.) Semester (I, II,III, IV) Session 2017-19

Hemchand Yadav Vishwavidyalaya, Durg
UniversityHemchand Yadav Vishwavidyalaya (HYV)
Course
Subject / PaperMaster of Computer Science (M.Sc.) Semester (I, II,III, IV) Session 2017-19
Maximum Marks100
FilePDF · 1.4 MB
👁️ Syllabus Preview
Loading preview…

✅ Free download. No sign-up needed.

🎯 परीक्षा से पहले ज़रूर देखें

सिर्फ पुराने पेपर काफ़ी नहीं — इस साल क्या आ सकता है, वो जानिए!

पिछले साल का पेपर आपको पैटर्न बताता है, लेकिन परीक्षा में इस साल के प्रश्न आते हैं। Pariksha Pass App में हमारी टीम ने पिछले कई वर्षों के पेपर्स का विश्लेषण करके हर विषय के संभावित प्रश्न पत्र (Guessing Papers) तैयार किए हैं — ताकि आप कम समय में सही चीज़ें पढ़ें।

📚 हर विषय के 3 सेटएक विषय के 3 अलग-अलग Guessing Paper — पूरे सिलेबस की अच्छी कवरेज।
✍️ सटीक और छोटे उत्तरहर प्रश्न का परीक्षा में लिखने लायक उत्तर — रटने की जगह समझकर लिखें।
🏷️ Year Tagहर प्रश्न के आगे लिखा है कि वह किस साल पूछा गया था — बार-बार आने वाले प्रश्न तुरंत पहचानें।
🏫 यूनिवर्सिटी-वारABVV, PRSU, HYV, SMKV, SGGV, SNPV — अपनी यूनिवर्सिटी के हिसाब से पेपर।
🔤 हिंदी और Englishदोनों माध्यम में उपलब्ध — जिस भाषा में परीक्षा देते हैं, उसी में पढ़ें।
📱 मोबाइल पर कहीं भीबस, कॉलेज या घर — फ़ोन पर ही पूरी तैयारी, नोट्स ढूँढने का झंझट नहीं।
  1. App डाउनलोड करें — Google Play से Pariksha Pass
  2. अपनी यूनिवर्सिटी और कोर्स चुनें
  3. Guessing Paper पढ़ें और परीक्षा की तैयारी पक्की करें
अभी Pariksha Pass App डाउनलोड करें

👀 पहले फ्री डेमो Guessing Paper देखें →

⏳ परीक्षा पास आ रही है — आख़िरी दिनों में सबसे ज़्यादा काम आते हैं सही प्रश्न। आज ही तैयारी शुरू करें!

About this HYV syllabus

This PDF contains the official syllabus "Master of Computer Science (M.Sc.) Semester (I, II,III, IV) Session 2017-19" issued for students of Hemchand Yadav Vishwavidyalaya. It lists the papers, units, credits and marks distribution you need to study for your semester examinations.

How to study with the syllabus

  • अपना सेमेस्टर और पेपर कोड ढूँढें (NEP में: DSC = मुख्य विषय, DSE = वैकल्पिक, GE = सामान्य वैकल्पिक, SEC = कौशल, VAC = मूल्य वर्धित, AEC = क्षमता संवर्धन)।
  • सभी इकाइयों के नाम एक पेज पर लिखें और जो इकाई पूरी हो जाए उस पर ✓ लगाते जाएँ।
  • हर इकाई को पिछले वर्षों के प्रश्न पत्रों से मिलाएँ, ताकि सबसे ज़रूरी टॉपिक पता चलें।

Syllabus contents (text version)

यह टेक्स्ट मूल PDF से लिया गया है ताकि आप इसे जल्दी पढ़ और खोज सकें। सूत्र, चित्र और हिंदी टेक्स्ट सही न दिखें तो ऊपर दी गई PDF देखें।

DURG VISHWAVIDYALAYA,
SCHEME OF EXAMINATION
SYLLABUS
Semester Examination
For
Session 2017-19
(Approved by Board of Studies)
Effective from July 2017
SCHEME OF TEACHING AND EXAMINATIONS
MASTER OF SCIENCE IN COMPUTER SCIENCE
FIRST SEMESTER
Subject SUBJECTS Teaching Load Credit Examination Marks
Code Per Week Max. Marks Min. Marks
Mathematical
Paper 1 Foundation of 3 2 - 4 100 50 - 150 40 30 70
Computer Science
Paper II Advance Operating 3 2 - 4 100 50 - 150 40 30 70
System
Data Structure through
Object Oriented
Paper IV Programming using 3 2 - 4 100 50 - 150 40 30 70
Paper V Computer System 3 2 - 4 100 50 - 150 40 30 70
Architecture
TOTAL 15 10 12 26 500 300 200 1000 200 180 100 480
Max Marks : 100 Min Marks : 40
NOTE :- The Question Paper setter is advised to prepare unit-wise question with the provision of
internal choice.
Mathematical Logic : Notations, Algebra of Propositions & Propositional functions, logical connectives,
Truth values & Truth table Tautologies & Contradictions, Normal Forms, Predicate Calculus, Quantifiers.
Cardinality, relations: Cartesian Products, relational Matrices, properties of relations equivalence relation
functions: Injection, Surjection, Bijection, Composition, of Functions, Permutations, Cardinality, the
characteristic functions recursive definitions, finite induction.
Lattices : Lattices as Algebraic System, Sub lattices, some special Lattices( Complement, Distributive,
Modular).
Boolean Algebra : Axiomatic definitions of Boolean algebra as algebraic structures with two operations,
Switching Circuits.
Groups : Groups, axioms, permutation groups, subgroups, co-sets, normal subgroups, free subgroups,
grammars, language).
Fields & Rings : Definition , Structure, Minimal Polynomials, Irreducible Polynomials, Polynomial roots
& its Applications.
and Isomorphic Graphs, Operations of Graphs, Path, Cycles and Connectivity, Euler and Hamilton Graph,
Planar Graphs, Applications of Graph Theory.
UNIT - V : Trees
Trees : Trees, Properties of trees, pendant vertices in a tree, center of tree, Spanning tree, Binary tree,
Tree Traversal, Applications of trees in computer science.
BOOKS RECOMMENDED :
Applications to computer science
for computer science
5. Discrete Mathematics -By Seymour Lipschutz Mare Lipson. Tata McGraw-Hill Edition.
Paper II : Advance Operating Systems
Max Marks : 100 Min Marks : 40
NOTE :- The Question Paper setter is advised to prepare unit-wise question with the provision of
internal choice.
UNIT-I
Introduction
What is operating system, basic concept, terminology, batch processing, spooling, multiprogramming,
time sharing, real time systems, protection, multiprocessor system, operating system as resource manager,
process view point, memory management, process management, device management and information
management, other views of operating system, historical, functional job control language and supervisor
service control.
UNIT-II
Advanced Processor Management Features
Multi- threaded operating system architecture micro-kernels operating system architecture multiple
operating system- subsystem and environments, client-server architecture, protected mode software
architecture ,visual machine- JAVA virtual machine and virtual 8086 mode, hard and soft real time
operating system, pre-emptive and non-pre-emptive multitasking and scheduling inter process
communication shared memory semaphore message queues, signals sessions management,
multiprocessor and distributed process synchronization, symmetric multiprocessing systems.
Advanced Memory Management
Virtual address space, description of user process and kernal, virtual memory architecture of Pentium
group of processor. Translation Lookaside Buffers, implementation of file mapping, shared memory
through virtual memoryviortual swap space.
UNIT - IV
Advanced Device Management Feature
Device driver framework classifying devices and driver, invoking driver code, devices switch table and
driver entry points,dynamic loading and unloading of device drivers
UNIT V
Advanced File Management Features
Virtual file systems and v-node architecture, distributed file system, network file system, remote
procedure call
RECOMMENDED BOOKS
1. Principles of Operating System - Peterson.
2. Operating System - Mandinick & Donovan.
Max Marks : 100 Min Marks : 40
NOTE :- The Question Paper setter is advised to prepare unit-wise question with the provision of
internal choice.
Introduction, Basic terminology, Elementary data organization, Data structure, Data structure operation,
Algorithms : complexity , time-space Tradeoff.. Mathematical Notation and functions, Algorithmic
Notation, Control Structures, Complexity of Algorithms, Sub algorithms, Variables, Data Type.
Basic Terminology, Storing String, Character Data Type, String Operations, Word Processing, Pattern
Matching Algorithms. Linear Array, Representation of linear Array in Memory, Traversing Linear
Arrays, Inserting And Deleting, Sorting; Bubble Sort, Searching; Liner Search, Binary Search,
Multidimensional Array, Pointers; Pointer Array, Records; Record Structures, Representation of Records
in Memory; Parallel Arrays, Matrices, Sparse Matrices.
Linked list, Representation of linked lists in memory, Traversing a linked list, Searching a linked list,
Memory Allocation; Garbage Collection, Insertion into a linked List, Deletion from a Linked List, Header
Linked List, Two- Way Linked Lists. Stacks, Array Representation of Stack, Arithmetic Expressions;
Polish Notation, Quick sort, an application of Stacks, Recursion, Tower of Hanoi, Implementation of
Recursive Procedures by Stacks, Queues, Dequeues, Priority Queues.
Binary Trees, Representing Binary Trees in Memory, Traversing binary tree, Traversal Algorithms using
stacks, header nodes; threads, Binary Search Tree, Searching and Inserting in Binary Search Tree,
Deleting in Binary Search tree, Heap; Heap sort, Path Lengths; Huffmans Algorithms, General Tree.
Graph Theory Terminology, Sequential Representation of Graph; Adjacency Matrix, Path Matrix, Linked
Representation of Graph.
Sorting, Insertion Sort, Selection Sort, Merging, Merge Sort, Radix Sort, Searching and data
modification, hashing.
BOOKS RECOMMENDED :
1. Data Structure - Seymour Lipschutz (Schaum's Series).
Max Marks : 100 Min Marks : 40
NOTE :- The Question Paper setter is advised to prepare unit-wise question with the provision of
internal choice.
UNIT - I : Language Fundamental
Advantages of OOP, The Object Oriented Approach, and Characteristics of object oriented languages-
Object, Classes, Inheritance, Reusability, and Polymorphism.
Control structures : if , if-else, nested if-else, while(), do-while() , for(;;), break, continue, switch, goto,
UNIT - II : Structure, Function & Array
Structures : A Simple structures ,specify the structures, Defining a structure variable, Accessing structures
member, Enumeration data type.
Function: Function Declaration, Calling Function, Function Defines, Passing Argument to function,
Passing Constant, Passing Value, Reference Argument, Passing struct variable, Overloaded Function,
Inline Function, Default Argument, return statement, returning by reference.
Array: Defining array, array element, initiation array, multi dimensional array, passing array to function.
UNIT - III : Object Classes and Inheritance
Object and Class, Using the class, class construct, class destructors, object as function argument, struct
and classes , array as class member, operator overloading. Type of inheritance, Derive class, Base class.
Access specifier: protected. Overriding, member function.
UNIT - IV : Pointers
Pointers : & and * operator pointer variables, pointer to void ,pointer and array, pointer and function,
pointer and string, memory management, new and delete, pointer to object, pointer to pointer.
UNIT - V : Virtual Function and File & Stream
Virtual Function : Virtual Function, Virtual member function, accesses with pointer, Late binding, pure
virtual function, Friend function, Friend class, static function, this pointer, Templates.
RECOMMENDED BOOKS :
5. Object Oriented Programming : Blaschek G, Springer Verlag
6. Object Data Management : Cattel R, Addison Wasley.
Paper V: Computer System Architecture
Max Marks: 100 Min Marks: 40
NOTE:- The Question Paper setter is advised to prepare unit-wise question with the provision of
internal choice.
Number system, Integer & Floating point representation Character code (ASCII, EBCDIC), Error Detect
and Correct code, Basic Building Blocks, Boolean Algebra, MAP Simplification, Combination Blocks,
Gates, Multiplexers, Decoders, etc Sequential building block, flip-flop, registers, counters, ALU, RAM
etc.
UNIT - II : Register transfer language and micro operations
Concepts of bus, data movement along registers, a language to represent conditional data transfer, data
movement from its memory, arithmetic and logical operations along with register transfer timing in
register transfer
UNIT - III : Basic Computer Organization and Design
Instruction code, Computer Instructions, Timing and Control, Execution of Instruction, Input and Output
Interrupt, Design of Computer.
UNIT - IV : Computer Software
Programming Language, Assembly Language, Assembler, Program Loops, Input /Output Programming,
System Software. Central Processor Organization: - Processor Bus Organization, Arithmetic Logic Unit,
Stack Organization, Instruction Formats, Addressing modes, Data transfer and Manipulation, Program
Control, Microprocessor Organization, Parallel Processing,.
Direct Memory Access (DMA), Priority Interrupt, Input-Output Processor, Multiprocessor System
Organization, and Data Communication Processor.
Memory Organization : Auxiliary Memory, Micro Computer Memory, Memory Hierarchy, Associative
Memory, Virtual Memory, Cache Memory, Memory Management Hardware.
BOOKS RECOMMENDED:
1. Computer System Architecture - M. Morris Mano (PHI).
2. Digital Computer Electronics - Malvino.
3. Digital Computers and Logic Design - M.Morris Mano (PHI).
4. Structured Computer Organization - Andrew M. Tanenbanm (PHI).
SCHEME OF TEACHING AND EXAMINATIONS
MASTER OF SCIENCE IN COMPUTER SCIENCE
SECOND SEMESTER
Subject SUBJECTS Teaching Credit Examination Marks
Code Load Per
Week
Programming with Oracle)
Paper II Advanced Computer
Networks 3 2 - 4 100 50 - 150 40 30 70
Paper III Programming in Visual
Basic 3 2 - 4 100 50 - 150 40 30 70
Design
Paper V Numerical Analysis
3 2 - 4 100 50 - 150 40 30 70
3x2 3 25 100 125 15 50 65
TOTAL 15 10 26 26 500 300 200 1000 200 180 100 480
Max Marks : 100 Min Marks : 40
NOTE :- The Question Paper setter is advised to prepare unit-wise question with the provision of
internal choice.
Data, Information and knowledge, Increasing use of data as a corporate resource, data processing verses
data management, file oriented approach verses database oriented approach to data management; data
independence, database administration roles, DBMS architecture, different kinds of DBMS users,
importance of data dictionary, contents of data dictionary, types of database languages. Data models:
network, hierarchical, relational. Introduction to distributed databases, Client/Server databases, Object-
oriented databases, Object-relational databases, Introduction to ODBC concept.
UNIT - II : Relational Model & Relational Algebra -
Entity - Relationship model as a tool for conceptual design-entities, attributes and relationships. ER
diagrams; Concept of keys; Case studies of ER modeling Generalization; specialization and aggregation.
Representation in UML diagram (Class Diagram etc.).
Relational Algebra: select, project, cross product different types of joins (inner join, outer joins, self join);
set operations, Tuple relational calculus, Domain relational calculus, Simple and complex queries using
relational algebra, stand alone and embedded query languages.
Nested queries, and correlated nested queries, Integrity constraints: Not null, unique, check, primary key,
foreign key, references, Triggers. Embedded SQL an
Never miss an update for this examGet a notification when new results, admit cards or notices are published. / नई अपडेट की सूचना पाएं।

More HYV MSc papers