DIGITAL DESIGN AND COMPUTER ORGANIZATION(BCS 302)

 

MODULE-1:

Introduction to Digital Design: Binary Logic, Basic Theorems And Properties Of Boolean Algebra,Boolean Functions, Digital Logic Gates, Introduction, The Map Method, Four-Variable Map, Don’t-Care Conditions, NAND and NOR Implementation, Other Hardware Description Language – Verilog Model of a simple circuit.

Text book 1: 1.9, 2.4, 2.5, 2.8, 3.1, 3.2, 3.3, 3.5, 3.6, 3.9

MODULE 1 NOTES

Module-2

Combinational Logic: Introduction, Combinational Circuits, Design Procedure, Binary Adder- Subtractor, Decoders, Encoders, Multiplexers. HDL Models of Combinational Circuits – Adder, Multiplexer, Encoder. Sequential Logic: Introduction, Sequential Circuits, Storage Elements: Latches, Flip-Flops.

MODULE 2 NOTES

MODULE 3:

Basic Structure of Computers: Basic Operational Concepts, Bus Structures, Performance – Processor Clock, Basic Performance Equation, Clock Rate, Performance Measurement. Machine Instructions and Programs: Memory Location and Addresses, Memory Operations, Instructions and Instruction Sequencing, Addressing Modes.

MODULE 3 NOTES

M1,M2,M3 QUESTION BANK

MODULE 4 

Input/output Organization: Accessing I/O Devices, Interrupts – Interrupt Hardware, Enabling and Disabling Interrupts, Handling Multiple Devices, Direct Memory Access: Bus Arbitration, Speed, size and Cost of memory systems. Cache Memories – Mapping Functions.

MODULE 4 NOTES

MODULE 5

Basic Processing Unit: Some Fundamental Concepts: Register Transfers, Performing ALU operations, fetching a word from Memory, Storing a word in memory. Execution of a Complete Instruction. Pipelining: Basic concepts, Role of Cache memory, Pipeline Performance. 

MODULE 5 NOTES

COMPUTER ORGANIZATION AND ARCHITECTURE 21CS34

MODULE 1

Basic Structure of Computers: Basic Operational Concepts, Bus Structures, Performance – Processor Clock, Basic Performance Equation, Clock Rate, Performance Measurement. Machine Instructions and Programs: Memory Location and Addresses, Memory Operations, Instructions and Instruction Sequencing, Addressing Modes

Textbook 1: Chapter1 – 1.3, 1.4, 1.6 (1.6.1-1.6.4, 1.6.7), Chapter2 – 2.2 to 2.5

MODULE 1 NOTES 

 MODULE 1 NOTES

MODULE 2

Input/output Organization: Accessing I/O Devices, Interrupts – Interrupt Hardware, Direct Memory Access, Buses, Interface Circuits

Textbook 1: Chapter4 – 4.1, 4.2, 4.4, 4.5, 4.6

MODULE 2 NOTES

QUESTION BANK

MODULE 3

Memory System: Basic Concepts, Semiconductor RAM Memories, Read Only Memories, Speed, Size, and Cost, Cache Memories – Mapping Functions, Virtual memories

Textbook 1: Chapter 5 – 5.1 to 5.4, 5.5 (5.5.1, 5.5.2)

MODULE 3 NOTES

MODULE 4

Arithmetic: Numbers, Arithmetic Operations and Characters, Addition and Subtraction of Signed Numbers, Design of Fast Adders, Multiplication of Positive Numbers.Basic Processing Unit: Fundamental Concepts, Execution of a Complete Instruction, Hardwired control, Microprogrammed control

Textbook 1: Chapter2-2.1, Chapter6 – 6.1 to 6.3

MODULE 4 NOTES

MODULE 5

Pipeline and Vector Processing: Parallel Processing, Pipelining, Arithmetic Pipeline, Instruction Pipeline, Vector Processing, Array Processors

Textbook 2: Chapter 9 – 9.1, 9.2, 9.3, 9.4, 9.6, 9.7

MODULE 5 NOTES

M4 AND M5 QBANK

FILE STRUCTURE 18IS61

 FILE STRUCTURE 

MODULE 1

Introduction: File Structures: The Heart of the file structure Design, A Short History of File Structure Design, A Conceptual Toolkit; Fundamental File Operations: Physical Files and Logical Files, Opening Files, Closing Files, Reading and Writing, Seeking, Special Characters, The Unix Directory Structure, Physical devices and Logical Files, File-related Header Files, UNIX file System Commands; Secondary Storage and System Software: Disks, Magnetic Tape, Disk versus Tape; CD-ROM: Introduction, Physical Organization, Strengths and Weaknesses; Storage as Hierarchy, A journey of a Byte, Buffer Management, Input /Output in UNIX. Fundamental File Structure Concepts, Managing Files of Records : Field and Record Organization, Using Classes to Manipulate Buffers, Using Inheritance for Record Buffer Classes, Managing Fixed Length, Fixed Field Buffers, An Object-Oriented Class for Record Files, Record Access, More about Record Structures, Encapsulating Record Operations in a Single Class, File Access and File Organization. RBT: L1, L2, L3

MODULE 1  SOLUTION MANUAL

MODULE 1 SOLUTION MANUAL

MODULE 2

Organization of Files for Performance, Indexing: Data Compression, Reclaiming Space in files, Internal Sorting and Binary Searching, Keysorting; What is an Index? A Simple Index for Entry-Sequenced File, Using Template Classes in C++ for Object I/O, Object-Oriented support for Indexed, Entry-Sequenced Files of Data Objects, Indexes that are too large to hold in Memory, Indexing to provide access by Multiple keys, Retrieval Using Combinations of Secondary Keys, Improving the Secondary Index structure: Inverted Lists, Selective indexes, Binding. RBT: L1, L2, L3

MODULE 2 SOLUTION MANUAL

MODULE 3:

 Consequential Processing and the Sorting of Large Files: A Model for Implementing Cosequential Processes, Application of the Model to a General Ledger Program, Extension of the Model to include Mutiway Merging, A Second Look at Sorting in Memory, Merging as a Way of Sorting Large Files on Disk. Multi-Level Indexing and B-Trees: The invention of B-Tree, Statement of the problem, Indexing with Binary Search Trees; Multi-Level Indexing, B-Trees, Example of Creating a B-Tree, An Object-Oriented Representation of B-Trees, B-Tree Methods; Nomenclature, Formal Definition of B-Tree Properties, Worst-case Search Depth, Deletion, Merging and Redistribution, Redistribution during insertion; B* Trees, Buffering of pages; Virtual BTrees; Variable-length Records and keys. RBT: L1, L2, L3

module 3 NOTES

MODULE 3 SOLUTION MANUAL

MODULE 4:

Indexed Sequential File Access and Prefix B + Trees: Indexed Sequential Access, Maintaining a Sequence Set, Adding a Simple Index to the Sequence Set, The Content of the Index: Separators Instead of Keys, The Simple Prefix B+ Tree and its maintenance, Index Set Block Size, Internal Structure of Index Set Blocks: A Variable-order B- Tree, Loading a Simple Prefix B+ Trees, B-Trees, B+ Trees and Simple Prefix B+ Trees in Perspective. RBT: L1, L2, L3

MODULE 4 NOTES

MODULE 4 SOLUTION MANUAL

MODULE 5:

Hashing: Introduction, A Simple Hashing Algorithm, Hashing Functions and Record Distribution, How much Extra Memory should be used?, Collision resolution by progressive overflow, Buckets, Making deletions, Other collision resolution techniques, Patterns of record access. Extendible Hashing: How Extendible Hashing Works, Implementation, Deletion, Extendible Hashing Performance, Alternative Approaches.

MODULE 5 NOTES

MODULE 5 SOLUTION MANUAL

18CS51

Management And Entrepreneurship For It Industry (18CS51)

Module-1 

Introduction - Meaning, nature and characteristics of management, scope and Functional areas of management, goals of management, levels of management, brief overview of evolution of management theories. Planning- Nature, importance, types of plans, steps in planning, Organizing- nature and purpose, types of Organization, Staffing- meaning, process of recruitment and selection

MODULE 1 NOTES LINK:

MODULE 1

Module-2

Directing and controlling- meaning and nature of directing, leadership styles, motivation Theories, Communication- Meaning and importance, Coordination- meaning and importance, Controlling- meaning, steps in controlling, methods of establishing control.

MODULE 2 NOTES LINK:

MODULE 2

VTU QUESTION PAPERS

QUESTION PAPER 18IS51

18CS51 FEB 2021

QUESTION BANK

QUESTION BANK MODULE 1,2

MODULE 3,4 NOTES:

MODULE 3

MODULE 4

QUESTION BANK  M3,M4,M5

MODULE 5 NOTES

CASE STUDY

COMPUTER ORGANIZATION 18CS34

COURSE DESCRIPTION:

Computer organization course explains the organization of a simple stored-program computer, CPU, busses and memory. Instruction sets, machine code, and assembly language. Conventions for assembly language generated by compilers. Floating-point number representation. Hardware organization of simple processors. Address translation and virtual memory. Arithmetic Operations in digital computer, Very introductory examples of input/output devices, interrupt handling and multi-tasking systems.

MODULE	DETAILS	HOURS
I	Basic Structure of Computers: Basic Operational Concepts, Bus Structures, Performance – Processor Clock, Basic Performance Equation, Clock Rate, Performance Measurement. Machine Instructions and Programs: Memory Location and Addresses, Memory Operations, Instructions and Instruction Sequencing, Addressing Modes, Assembly Language, Basic Input and Output Operations, Stacks and Queues, Subroutines, Additional Instructions, Encoding of Machine Instructions	8
II	Input/output Organization: Accessing I/O Devices, Interrupts – Interrupt Hardware, Enabling and Disabling Interrupts, Handling Multiple Devices, Controlling Device Requests, Exceptions, Direct Memory Access, Buses, Interface Circuits, Standard I/O Interfaces – PCI Bus, SCSI Bus, USB.	8
III	Memory System: Basic Concepts, Semiconductor RAM Memories, Read Only Memories, Speed, Size, and Cost, Cache Memories – Mapping Functions, Replacement Algorithms, Performance Considerations, Virtual Memories, And Secondary Storage.	8
IV	Arithmetic: Numbers, Arithmetic Operations and Characters, Addition and Subtraction of Signed Numbers, Design of Fast Adders, Multiplication of Positive Numbers, Signed Operand Multiplication, Fast Multiplication, Integer Division, Floating-point Numbers and Operations.	8
V	Basic Processing Unit: Some Fundamental Concepts, Execution of a Complete Instruction, Multiple Bus Organization, Hard-wired Control, Micro programmed Control. Embedded Systems and Large Computer Systems: Examples of Embedded Systems, Processor chips for embedded applications, Simple Microcontroller. The structure of General-Purpose Multiprocessors.	8
TOTAL HOURS		40

MODULE NOTES

MODULE 1 NOTES

 

MODULE 2 NOTES

MODULE 2 SECOND PART

 

MODULE 3 NOTES

 

MODULE 4 NOTES

MODULE 5

PIPELINING CONCEPTS

 

 

QUESTION BANK:

QUESTION BANK

CO YOUTUBE LINKS

DATA COMMUNICATION LECTURER NOTES BY SADHANA B

 

DATA COMMUNICATION 18CS46

 

NOTES

MODULE 1 

 

MODULE 2

 

MODULE 3

 

MODULE 4

 

MODULE 5