DOC

PGDCA

By Rose Jenkins,2014-04-14 03:45
12 views 0
OBJECT ORIENTED ANALYSIS AND DESIGN. UNIT ? I. OBJECT ORIENTED DESIGN FUNDAMENTALS Craig Larman, Applying UML and patterns, Addison Wesley,2000.

    VINAYAK MISSION UNIVERSITY

    PGDCA

FUNDAMENTAL OF DIGITAL COMPUTER & COMPUTER ARCHITECTURE

UNIT I

     Number systems Machine Codes : Bindary, Octal, Decimal and Hexadecimal

    number systems Convesion from one base to another base Use of complements Binary artithmetic Number codes and Character codes.

    UNIT II

     Boolean algebra and Combinatinal Circuits : Fundamental concepts of blloean

    algebra De Morgoan’s theorems – Simoplificatins of eexpressions Sum of products and products of sums Karnaugh may simplification Quine McKuskey method Two level implementation of combinatorial circuits Enconder Decoder Multiplexer Demultiplexer.

    UNIT III

     Sequential Circuits (Elementary Qualitative Treatment only) : Flip-Flops Clocks Gated flip-flops Master slave flip-flops Shift registers Binary counters BCD Counters.

    The Arithmetic Logic Unit : construction of ALU Integer representation Half adder Full adder Parallel binary adder Positive and negative numbers Addition and subtraction in a parallel arithmetic element.

    UNIT IV

     The Memory Element : RAM Linear select memory organization Decoders Static and dynamic RAM ROM Magnetic disk memories Magnetic tape. The Control Unit : Instruction word Instruction cycle Execution cycle Control register Sequence of operation of control registers Controlling arithmetic operations Typical sequence of operations.

    UNIT V

     Input-Output Organization : Peripheral devices I/O interface Programmed I/O Interrupts Inerrupts priorities DMA I/O Processors.

Text Book:

    1. M. Morris Mano Digital Logic and Computer Design, Prentice Hall of India.

    Reference: th 1. Thomas C Bartee Digital Computer Fundamentals, 6 edn, McGraw Hill, 1985.

    2. Alert Paul Malvino Digital Computer Electrnoics, Tata McGraw Hill, 1986.

    3. Gear C W Computer Organization and Programming , McGraw Hill, 1975.

    OBJECT ORIENTED ANALYSIS AND DESIGN

    UNIT I

    OBJECT ORIENTED DESIGN FUNDAMENTALS

    The object model - Classes and Objects - Complexity - Classification - Notation - Process

    - Pragmatics - Binary and Entity Relationship - Object types - Object state - OOSD life

    cycle.

     UNIT II

    OBJECT ORIENTED ANALYSIS

    Overview of Object Oriented Analysis - Shaler/Mellor, Coad/Yourdon, Rumbagh, Booch

    - UML - Usecase - Conceptual Model - Behaviors - Class - Analysis Patterns - Overview

    - Diagrams - Aggregation.

     UNIT III

    OBJECT ORIENTED DESIGN METHODS

UML - Diagrams - Collaboration - Sequence - Class - Design patterns and frameworks -

    Comparison with other design methods.

     UNIT IV

    MANAGING OBJECT ORIENTED DEVELOPMENT

    Managing Analysis and Design - Evaluation Testing - Coding - Maintenance - Metrics.

     UNIT V

    APPLICATIONS

    Object Diagram Compiler Computer Animator Electrical Distribution System Text Books

    1. James Rumbaugh, Object Oriented Modeling and Design, Eastern Economy

    Edition.

    2. Dlea and P Faure, Object Oriented System Development, Addison Wesley.

    References:

    1. Craig Larman, Applying UML and patterns, Addison Wesley,2000.

    2. The Unified Modeling Language User Guide, Grady Booch, James Rumbaugh, Ivar

     Jacobson, Addison - Wesley Long man, 1999, ISBN 0-201-57168-4.

    3. Ali Bahrami, Object Oriented System Development, McGraw Hill International

    Edition, 1999.

    4. Fowler, Analysis Patterns, Addison Wesley,1996.

    5. Erich Gamna, Design Patterns, Addison Wesley, 1994.

    Paper 3

    DESING AND ANALYSIS OF ALGORITHMS

UNIT I

     The Complete Development of an Algorithm : algorithms Basic steps in

    development : Statement of the problem Development of a model Design of an

    algorithm Correctness of the algorithm Implementation Analysis and complexity of the algorithm Program testing Documentation.

    UNIT II

     Bais Tools : Top-down structured programming Program correctness

    Example : The Knight’s Tour – Networks (Graphs) : Fundamentals Representation

    Tress Isomorphism Linked lists Adjancency lists Push-down lists Queues

    Probabilistic model Example : Performance analysis of straight insertion sort.

    UNIT III

     Algorithm Design Methods : Basic problem solving methods : Subgoal, Hill

    climbing and Working backward Example : Jeep problem.

    UNIT IV

     Heuristics : Heuristic algorithm Properties Example : Greedy Travelling Slesman problem. Backtrack Programming : Example : Bicycle Lock problem. Branch

    and Bound: Example : Trvelling Salesman problem for Five-city Network. Recursion:

    Example: Factorials and Fibanacci Series, Ackermann’s function. Simulation: Example:

    A single que single server problem.

    UNIT V

     Computer Science Algorithms: Sorting Quicksort performance. Heapsort : A worstcase O (N log N) sorting algorithm. Searching: Binary search: Average complexity

     Binary tree search and insertion.

    Text Book :

    1. S.E. Goodman and S.T. Hedetniemi Introduction to the Design and Analysis of

    Algotithms, McGraw Hill IE, 1977.

    Reference:

    1. Ellis Horowitz and Sartaj Sahni Fundamentals of Computer Algorithms,

    Galgotia, 1984.

    2. Niklaus Wirth Algorithms and Data Structures, Prentice Hall, 1986.

    3. Knuht Fundamental Algorithms, Addison Wesley, 1973.

    4. Ali Behforooz and Onkar P. Sharma an Introduction to Computer Science,

    Prentice Hall, 1986.

    Paper - 4

    INTERNET AND JAVA PROGRAMMING

    UNIT I :

     Internet connection concepts Intranets : Connecting LANs to the internet E-

    Mail concepts E-Mail security : Reasons to secure the messages, Public key

    cryptography, Using cryptography with E-Mail Online Chatting and Conferencing Concepts WWW concepts.

    UNIT II:

     Fundamentals of Object Oriented Programming Java evolution Overview of

    JAVA Language constants, variables and Data types- Operators and Expressions

    Decision making: Branching and Looping.

    UNIT III:

     Classes, Objects and Methods Arrays, Strings and Vectors Multiple

    inheritance.

    UNIT IV:

     Packages Multithreaded Programming Managing Errors and Exceptions. UNIT V:

     Applet programming Graphics Programming Managing Input / Output files. Reference Books

    1. D.Norton and H.Schildt, Java2 : the complete reference, TMH 2000.

    2. Internet & World wide Web How to program, Deitel & Deitel, Prentice Hall 2000.

    3. Java How to program,Deitel & Deitel, Prentice Hall 1999.

    4. Core Java Vol.1 and Vol. 2, Gary Cornell and Cay S.Horstmann, Sun Microsystems

    press 1999.

    5. Active X source Book, Ted Coombs, Jason Coombs and Don Brewer, John Wiley

    &sons 1996.

Report this document

For any questions or suggestions please email
cust-service@docsford.com