HTMLify

sem-2.html
Views: 4 | Author: divya
<!DOCTYPE html>
<html lang="en">
 <head>
  <meta charset="utf-8"/>
  <title>
   B.R.A. Bihar University - Semester II Syllabus
  </title>
  <style>
   body {
      font-family: Arial, sans-serif;
      margin: 20px;
      line-height: 1.6;
    }
    h1, h2, h3, h4 {
      color: #003366;
      text-align: center;
    }
    h4 {
      text-align: left;
      margin-top: 15px;
    }
    ul, ol {
      margin: 10px 0 20px 40px;
    }
    table, th, td {
      border: 1px solid #333;
      border-collapse: collapse;
      padding: 8px;
    }
    table {
      margin: 10px auto;
    }
    strong, b {
      color: #000;
    }
    pre {
      background: #f8f8f8;
      padding: 10px;
      display: inline-block;
    }
  </style>
 </head>
 <body>
  <h1>
   B.R.A. Bihar University, Muzaffarpur
  </h1>
  <h2>
   SEMESTER-II
  </h2>
  <h3 id="BCA-201">
   BCA – 201: DISCRETE MATHEMATICS
  </h3>
  <p>
   <strong>
    Total Lectures:
   </strong>
   50
  </p>
  <h4>
   Unit – I: Set, Relation and Function
  </h4>
  <p>
   Notation, Inclusion and Equality of Sets, Power Set, Operations on set, Venn Diagram, Relation, Domain and range, 
        Properties of binary relation in a set, relation matrix, digraph, Equivalence Relation, Partition and covering of a set. 
        Definition and types of Functions, Composition of function, Inverse function.
  </p>
  <h4>
   Unit – II: Algebraic Structures
  </h4>
  <p>
   Definitions and illustrative examples of semi-groups, monoids, Groups, Subgroups, Ring.
  </p>
  <h4>
   Unit – III: POSET and Lattice
  </h4>
  <p>
   Partial Ordering, partially ordered set, chain, Maximal, Minimal, Lub and Glb, Hasse Diagram, 
        Definition of lattice and its properties, Sublattice, distributive and complemented lattice.
  </p>
  <h4>
   Unit – IV: Graph Theory
  </h4>
  <p>
   Definition of graph and types, Directed and undirected graph, path, walk and circuit, Regular graph, Tree.
  </p>
  <h4>
   Text Books:
  </h4>
  <ol>
   <li>
    Discrete Mathematics, S.K. Sarkar, S. Chand &amp; Co.
   </li>
   <li>
    Elements of Combinatorial Math – C.L. Liu
   </li>
   <li>
    Discrete Mathematics, J.K. Sharma, Trinity Publ.
   </li>
   <li>
    Discrete Mathematics – Tremble
   </li>
  </ol>
  <h3 id="BCA-202">
   BCA – 202: COMPUTER ARCHITECTURE
  </h3>
  <p>
   <strong>
    Total Lectures:
   </strong>
   50
  </p>
  <h4>
   Unit – I
  </h4>
  <p>
   Data representation, Data Types and Number Systems, Binary Number System, Octal &amp; Hexa-Decimal Number System, 
        Fixed Point Representation, 1's &amp; 2's Complement, Binary Fixed-Point Representation, 
        Arithmetic Operation on Binary Numbers, Overflow &amp; Underflow.
  </p>
  <h4>
   Unit – II
  </h4>
  <p>
   Boolean algebra and digital logic circuits - Logic Gates, AND, OR, NOT Gates and their Truth Tables, NOR, NAND &amp; XOR Gates, 
        Boolean Algebra, Basic Definition and Properties, Basic Boolean Law’s, Demorgan’s Theorem.
  </p>
  <h4>
   Unit – III
  </h4>
  <p>
   Sequential logic: Flip-Flops - RS, D, J K &amp; T Flip-Flop, Registers, Counters and the memory unit, 
        Shift registers, Ripple counters and Synchronous counters, Timings sequence digital logic families.
  </p>
  <h4>
   Unit – IV
  </h4>
  <p>
   Input-output organizations - I/O Interface, Properties of simple I/O Devices and their controller, 
        Isolated Vs Memory-mapped I/O, Modes of data transfer, Synchronous &amp; Asynchronous data transfer.
  </p>
  <h3>
   Unit-V
  </h3>
  <ul>
   <li>
    Memory organization – Auxiliary Memory, Magnetic Drum, Disk &amp; Tape, Semi-conductor memories, memory, Hierarchy, Associative memory, Virtual memory, Address space &amp; memory space, Cache memory, Hit ratio, Writing into cache.
   </li>
  </ul>
  <h4>
   Text Books:
  </h4>
  <ol>
   <li>
    Computer System Architecture – Morris Mano, PHI Publications.
   </li>
   <li>
    Modern Digital Electronics – R. P. Jain, TMH.
   </li>
   <li>
    Computer Fundamentals – V. Rajaraman, PHI.
   </li>
   <li>
    Digital Logic and Computer Design – Morris Mano, PHI Publications.
   </li>
   <li>
    Computer Architecture and Organisation, John P. Hayes, McGraw Hill Publ.
   </li>
  </ol>
  <h2 id="BCA-203">
   BCA – 203: DATA STRUCTURE THROUGH C
  </h2>
  <p>
   <strong>
    Total Lectures:
   </strong>
   50
  </p>
  <h4>
   Unit – I: Introduction
  </h4>
  <p>
   Array, Function, Pointer and Structure.
  </p>
  <h4>
   Unit – II: Recursion
  </h4>
  <p>
   Recursion vs Looping, Recursive Functions.
  </p>
  <h4>
   Unit – III: Sorting &amp; Searching
  </h4>
  <p>
   <strong>
    Sorting:
   </strong>
   Selection, Bubble, Insertion, Heap and Quick sorting.
   <br/>
   <strong>
    Searching:
   </strong>
   Linear and Binary searching.
  </p>
  <h4>
   Unit – IV: Linked List
  </h4>
  <p>
   Self referential structure, Dynamic memory allocation.
   <br/>
   <strong>
    Single Linked List:
   </strong>
   Addition, Deletion, Insertion, Searching of nodes.
   <br/>
   <strong>
    Double Linked List:
   </strong>
   Addition, Deletion, Insertion, Searching of nodes.
   <br/>
   <strong>
    Circular Linked List:
   </strong>
   Addition, Deletion, Insertion, Searching of nodes.
  </p>
  <h4>
   Unit – V: Stack &amp; Queue
  </h4>
  <p>
   <strong>
    Stack:
   </strong>
   Implementation using array and linked list. Push and Pop operations.
   <br/>
   <strong>
    Queue:
   </strong>
   Implementation using array and linked list. Add and Delete operations.
  </p>
  <h4>
   Unit – VI: Trees &amp; Graph
  </h4>
  <p>
   <strong>
    Trees:
   </strong>
   Binary Trees, Binary Tree Representations, Binary Search Tree, Prefix, Infix and Postfix traversal of tree.
   <br/>
   <strong>
    Graph:
   </strong>
   Concept and representation using matrix.
  </p>
  <h4>
   Text Books:
  </h4>
  <ol>
   <li>
    R.S. Salaria, Data Structures &amp; Algorithms using C, Khanna Publishing
   </li>
   <li>
    S.K. Srivastava, Depth in Data Structure through C - BPB Publication
   </li>
   <li>
    Seymour Lipschutz, “Data Structures with C”, Schaum’s Outlines, Tata McGraw-Hill.
   </li>
   <li>
    Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, Pearson Education.
   </li>
   <li>
    Robert Kruse, C.L. Tondo, Bruce Leung, Shashi Mogalla, “Data Structures and Program Design using C”, Pearson Education.
   </li>
   <li>
    Forouzan, “A Structured Programming Approach using C”, Cengage Learning India.
   </li>
   <li>
    A Practical Approach to Data Structures and Algorithms – Sanjay Pahuja, New Age Publ.
   </li>
   <li>
    Data Structure using C, Rohit Khurana, Vikas Publication
   </li>
  </ol>
    <h3 id="BCA-205">
     BCA-205: LAB ON MS-OFFICE
    </h3>
    <p>
     <strong>
      Total Lab Classes = 60
     </strong>
    </p>
    <h4>
     Microsoft Word:
    </h4>
    <p>
     Introducing Word, Entering and Editing Text, Formatting Text, Formatting Pages, Creating Tables; 
        Special Word Techniques, Word and the Web.
    </p>
    <h4>
     Microsoft Excel:
    </h4>
    <p>
     Introducing Excel, Entering Data and Formulas, Structuring the Sheet, Formatting the Sheet, Using Excel Charts, 
        Excel Database Techniques, Special Excel Techniques, Excel.
    </p>
    <h4>
     Microsoft PowerPoint:
    </h4>
    <p>
     Introducing PowerPoint, Building a Presentation, Outlining the Presentation, Creating Text Slides, 
        Creating Chart Slides, Formatting Charts, Creating Org Chart and Tables, Customizing a Presentation, 
        Drawing on Slides, Creating Slide Shows, Animation effects.
    </p>
    <h4>
     Text Books:
    </h4>
    <ol>
     <li>
      Steve Sagman,
      <em>
       Microsoft Office XP for Windows
      </em>
      , Pearson Education.
     </li>
     <li>
      <em>
       IT Tools and Applications
      </em>
      - S.K. Jain, BPB Publications
     </li>
     <li>
      <em>
       A First Course In Computer Based On Windows XP And Office XP
      </em>
      , Sanjay Saxena, Vikash Publ.
     </li>
    </ol>
    <hr/>
    <h3 id="BCA-206">
     BCA-206: LAB ON DATA STRUCTURE THROUGH C
    </h3>
    <p>
     <strong>
      Total Lab Classes = 60
     </strong>
    </p>
    <ol>
     <li>
      Programs in C related to following topics:
     </li>
     <li>
      Array – one and two dimensions.
     </li>
     <li>
      Function – passing variable and array to a function.
     </li>
     <li>
      Pointer and function – call by address/reference.
     </li>
     <li>
      Structure such as structure to represent a date, point, time etc.
     </li>
     <li>
      Recursive functions.
     </li>
     <li>
      Selection sorting, bubble sorting, insertion sorting, heap sorting, and quick sorting of elements of an array.
     </li>
     <li>
      Menu based operations on single linked list.
     </li>
     <li>
      Menu based operations on double linked list, menu based operations on circular linked list.
     </li>
     <li>
      Stack and its operations.
     </li>
     <li>
      Queue and its operations.
     </li>
     <li>
      Insertion of node in binary search tree.
     </li>
     <li>
      Traversal of binary search tree nodes in prefix, infix and postfix order.
     </li>
     <li>
      <strong>
       A Mini Project
      </strong>
     </li>
    </ol>
    <p>
     <em>
      Page-13
     </em>
    </p>
   </body>
  </html>
  <h3 id="BCA-204">
   BCA – 204: SYSTEM ANALYSIS &amp; DESIGN
  </h3>
  <p>
   <strong>
    Total Lectures = 50
   </strong>
  </p>
  <h4>
   Unit – I:
  </h4>
  <p>
   Importance of System Analysis and Design, Concept of System, characteristics and types of system,
        System Development Life Cycle – waterfall model, Prototype development strategy, Software Crisis,
        Audit Trail, Role and Attributes of System Analyst.
  </p>
  <h4>
   Unit – II:
  </h4>
  <p>
   Sources of Project request, Project Selection, Preliminary Investigation, Feasibility Study, types of feasibility study,
        Cost and benefit analysis.
   <br/>
   Systems Analysis, Requirements determination, Structured Analysis, System Requirements Specification (SRS),
        Analysis Tools, Data Dictionary, HIPO, Decision Tree, Decision Table, Warnier-Orr Diagram, ERD,
        Data Flow Design (DFD).
  </p>
  <h4>
   Unit – III:
  </h4>
  <p>
   System Design, Design process, constraints, Input and control Design, Validation checks, concept and types of Form,
        Form Design, Output Design, File Design: Types of File – Master File, Transaction File, Table / Reference File, Report File.
  </p>
  <h4>
   Unit – IV:
  </h4>
  <p>
   Software Quality and Testing: Quality concept, Testing and Testing objectives, Black Box and White Box testing,
        Unit testing, integration testing, system testing.
  </p>
  <h4>
   Unit – V:
  </h4>
  <p>
   Hardware and Software Acquisition and selection criteria, system conversion and conversion plan,
        Site preparation, training, Maintenance and types of maintenance.
  </p>
  <h4>
   Unit – VI:
  </h4>
  <p>
   Management Information System: Definition, objectives and role in organisation and for managers.
        Information system at different levels of organisation/management – OAS, TPS, MIS, DSS.
   <br/>
   Components of MIS, Failure and success of MIS.
  </p>
  <h3>
   Text Books:
  </h3>
  <ol>
   <li>
    “Analysis &amp; Design of Information System”, James A. Senn, McGraw Hill Publ. Delhi
   </li>
   <li>
    “System Analysis &amp; Design”, E.J. Awad, Galgotia Publ., N. Delhi
   </li>
   <li>
    “System Analysis &amp; Design”, V. Rajaraman, PHI Publ.
   </li>
   <li>
    “Management Information &amp; Control System”, Dr. Sushila Madan, Taxmann Publ.
   </li>
   <li>
    “Information System for Modern Management”, R.G. Murdick, Joel E. Ross, &amp; J.R.Clagget, PHI
   </li>
   <li>
    “System Analysis &amp; Design”, D. Richard, Irwin Inc., 1979.
   </li>
   <li>
    “Introduction to System Analysis &amp; Design”, B.S. Lee, Vols. Manchester, U.K.
   </li>
   <li>
    “Management Information Systems - Managing the Digital Firm”, Kenneth C. Laudon &amp; Jane P. Laudon, Pearson, 15 Ed., 2018.
   </li>
   <li>
    “Systems Analysis and Design Methods”, Jeffrey L. Whitten, Lonnie D. Bentley, Kevin C. Dittman, TMH
   </li>
   <li>
    “Modern Systems Analysis and Design”, Jeffrey A. Hoffer, Joey F. George and Valacich, Pearson
   </li>
  </ol>
  <h3>
   BCA-205: LAB ON MS-OFFICE
  </h3>
  <p>
   <strong>
    Total Lab Classes = 60
   </strong>
  </p>
  <h4>
   Microsoft Word:
  </h4>
  <p>
   Introducing Word, Entering and Editing Text, Formatting Text, Formatting Pages, Creating Tables; 
        Special Word Techniques, Word and the Web.
  </p>
  <h4>
   Microsoft Excel:
  </h4>
  <p>
   Introducing Excel, Entering Data and Formulas, Structuring the Sheet, Formatting the Sheet, Using Excel Charts, 
        Excel Database Techniques, Special Excel Techniques, Excel.
  </p>
  <h4>
   Microsoft PowerPoint:
  </h4>
  <p>
   Introducing PowerPoint, Building a Presentation, Outlining the Presentation, Creating Text Slides, 
        Creating Chart Slides, Formatting Charts, Creating Org Chart and Tables, Customizing a Presentation, 
        Drawing on Slides, Creating Slide Shows, Animation effects.
  </p>
  <h4>
   Text Books:
  </h4>
  <ol>
   <li>
    Steve Sagman,
    <em>
     Microsoft Office XP for Windows
    </em>
    , Pearson Education.
   </li>
   <li>
    <em>
     IT Tools and Applications
    </em>
    - S.K. Jain, BPB Publications
   </li>
   <li>
    <em>
     A First Course In Computer Based On Windows XP And Office XP
    </em>
    , Sanjay Saxena, Vikash Publ.
   </li>
  </ol>
  <hr/>
  <h3>
   BCA-206: LAB ON DATA STRUCTURE THROUGH C
  </h3>
  <p>
   <strong>
    Total Lab Classes = 60
   </strong>
  </p>
  <ol>
   <li>
    Programs in C related to following topics:
   </li>
   <li>
    Array – one and two dimensions.
   </li>
   <li>
    Function – passing variable and array to a function.
   </li>
   <li>
    Pointer and function – call by address/reference.
   </li>
   <li>
    Structure such as structure to represent a date, point, time etc.
   </li>
   <li>
    Recursive functions.
   </li>
   <li>
    Selection sorting, bubble sorting, insertion sorting, heap sorting, and quick sorting of elements of an array.
   </li>
   <li>
    Menu based operations on single linked list.
   </li>
   <li>
    Menu based operations on double linked list, menu based operations on circular linked list.
   </li>
   <li>
    Stack and its operations.
   </li>
   <li>
    Queue and its operations.
   </li>
   <li>
    Insertion of node in binary search tree.
   </li>
   <li>
    Traversal of binary search tree nodes in prefix, infix and postfix order.
   </li>
   <li>
    <strong>
     A Mini Project
    </strong>
   </li>
  </ol>
  <p>
   <em>
    Page-13
   </em>
  </p>
 </body>
</html>

Comments