Scribd
Upload
111 views3 pages

JNTU MCA - Semester I (From 2004 Batch) - MC 1.2 - Computer Organization

This document outlines the course units for JNTU MCA Semester I (2004 batch) courses on Computer Organization (MC 1.2) and Data Structures (MC 1.3). The Computer Organization course covers digital logic circuits, digital components, data representation, register transfer and micro-operations, computer arithmetic, central processing unit, and memory and input-output organization. The Data Structures course covers arrays, linked lists, stacks, queues, sorting, searching, tables, trees, special binary trees, and their applications. Textbooks and reference books on computer architecture, organization, and data structures are also listed.

Uploaded by

praveenmpk
Copyright
© Attribution Non-Commercial (BY-NC)
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
111 views3 pages

JNTU MCA - Semester I (From 2004 Batch) - MC 1.2 - Computer Organization

This document outlines the course units for JNTU MCA Semester I (2004 batch) courses on Computer Organization (MC 1.2) and Data Structures (MC 1.3). The Computer Organization course covers digital logic circuits, digital components, data representation, register transfer and micro-operations, computer arithmetic, central processing unit, and memory and input-output organization. The Data Structures course covers arrays, linked lists, stacks, queues, sorting, searching, tables, trees, special binary trees, and their applications. Textbooks and reference books on computer architecture, organization, and data structures are also listed.

Uploaded by

praveenmpk
Copyright
© Attribution Non-Commercial (BY-NC)
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/ 3

JNTU MCA - Semester I (From 2004 batch) - MC 1.

2 - Computer Organization
UNIT I: DIGITAL LOGIC CIRCUITS

Logic Gates, Boolean Algebra, Map Simplification, Combinational Circuits, Flip-Flops,


Sequential Circuits.

UNIT II: DIGITAL COMPONENTS

Integrated Circuits, Decoders, Multiplexers, Shift Registers, Binary Counters, Memory Unit.

UNIT III: DATA REPRESENTATION

Data Types, Complements, Fixed-Point Representation, Floating-Point Representation, Other


Binary codes, Error Detection codes

UNIT IV: REGISTER TRANSFER AND MICRO OPERATIONS

Register Transfer Language, Register Transfer, Bus and Memory Transfers, Arithmetic Micro
operations, Logic Micro Operations, Shift Micro operations, Arithmetic logic Shift Unit

UNIT V: COMPUTER ARITHMETIC

Introduction, Addition and Subtraction, Multiplication Algorithms, Division Algorithms,


Floating-Point Arithmetic Operations, Decimal Adder, Decimal Subtraction.

UNIT VI: CENTRAL PROCESSING UNIT

Digital computers, Stored Program concept, Bus System, Computer Registers, Computer
Instructions, Timing and Control Unit, Control Design Fundamentals, Micro Programmed
Control Vs Hardwired Control. Instruction Formats, Addressing modes 

UNIT VII: MEMORY ORGANIZATION

Memory Hierarchy, Main Memory, Auxiliary Memory, Associative Memory, Cache Memory,
Virtual Memory, Memory Management Hardware

UNIT VIII: INPUT-OUTPUT ORGANIZATION

Peripheral Devices, Input-Output Interface, Asynchronous Data Transfer, Modes of Transfer,


Priority Interrupt, Direct Memory Access, Input-Output Processor, Serial Communication.

TEXT BOOKS:

1. M. Morris Mano, " Computer System Architecture", 3e, 2003,PEA

REFERENCE BOOKS:

1.John P.Hayes, " Computer Architecture and Organization"3e,TMH


2.Hamacher, Vranesic, zaky, "Computer Organization", 5e, 2002,TMH
3.William Stallings," Computer Organization and Architecture ", 6e,PEA.
4.Tenanbaum,"Structured Computer Organization", PHI.
5.Paul Choudhary," Computer Organization & Design", 2e,PHI.
6.Carpinelli," Computer System Organization and Architecture", PEA.
JNTU MCA - Semester I (From 2004 batch) - MC 1.3 - Data Structures

UNIT I: INTRODUCTION AND ARRAYS


Review of C, Definition, Concepts and Classification of Data Structures. Arrays: Definitions,
Terminology, One-dimensional, Multi Dimensional Arrays.

UNIT II: LINKED LISTS


Definition, Single linked lists, Doubly Linked lists, Circular linked lists, Circular Double linked
lists, Applications of Linked Lists: Sparse Matrix Manipulation, Polynomial Representation

UNIT III: STACKS


Introduction, Definition, Representation of stacks: Arrays and Linked lists, Operations on
stacks. Applications of stacks: Evaluation of Arithmetic Expression, Implementation of
Recursion, Factorial Calculations, Towers of Honai.

UNIT IV: QUEUES


Introduction, Definition, Representation of Queues: Arrays and Linked lists , Various Queue
Structures, Operations on Queues, Applications, Priority queues.

UNIT V: SORTING
Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Radix Sort and Quick Sort.

UNIT VI: SEARCHING & TABLES 


Linear Search, Binary Search, and Fibonacci Search.

TABLES: 
Rectangular, Inverted Tables, Hashing techniques.

UNIT VII: TREES:


Binary Tree, Binary Search Tree (BST), Representation and Operations on BST, Recursive
and Non - Recursive Tree Traversal Techniques: Inorder, Post Order, Preorder and
Applications.

UNIT VIII: SPECIAL BINARY TREES


Height Balanced Trees, Heaps, Heap Sort, B - Trees, Threaded Binary Trees, Advantages of
Special Trees.

TEXT BOOKS:
1.Samanta, "Classic Data Structures", 1e, 2001, PHI.
2. Bandyopadhyay, Dey, "Data Structures Using C" ,1e, 2004, PEA.

REFERENCE BOOKS: 
1.Weiss, "Data Structures and Algorithmic analysis in C", 2e, 2003, PEA.
2.Trembley, Sorenson," An introduction to Data Structure with Applications", 2e, TMH.
3.Seymour Lipschutz,"Data structures ", Schaum Series, TMH.
4.Horowitz, Sahani, "Fundamentals of Data Structures", Golgotia.
5.Aho, Hopcroft, Ullman," Data Structure and Algorithms", PEA.
6.Nicholas Wirth, "Algorithms + Data Structure = Programs", PHI.
7.Seymour Lipschutz," Theory & problems of Data structures ", Schaum Series, TMH.
8.Savitch, "Data Structures Using C++", PEA.
9.Tannenbaum, Augustien, "Data Structures", PEA 

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy