Wednesday, 5 March 2014

// // Leave a Comment

DIGITAL COMPUTER PRINCIPLES SYLLABUS

THIRD SEMESTER COMPUTER SCIENCE SYLLABUS  
DIPLOMA COMPUTER SCIENCE DIGITAL COMPUTER PRINCIPLES REVISION-06 SYLLABUS

UNIT-1
1.UNDERSTAND THE VARIOUS NUMBER SYSTEMS
*Explain binary,octal ,decimal and Hexadecimal number systems
*Convert decimal nos.to binary,octal and Hexadecimal and vice versa
*Convert  binary to octal,binary to hexadecimal,octal to binary,octal to Hexadecimal,hexadecimal to binary,Hexadecimal to octal
*Perform binary addiction,substraction,multiplication and division
*Perform octal and hexadecimal arithmetic
*Write 1’s complement and 2’s complement for  a binary number
*Perform binary subtraction using 1’s and 2’s complement
2.UNDERSTAND BINARY CODES
*Discuss the BCD,gray,ASCII,EBCDIC,Excess 3.2421,84-21,biquinary,card code
*State the concept of parity bit for error detection
*Explain the odd and even parity methods
*Explain Hamming code method of single bit error correction
*Define Beolean function
*State the postulates of Boolean algebra
*State the basic theorems in Boolean algebra
*State and prove De-Morgan’s Law
*State the need of truth tables
*Draw the truth tables for functions
*Explain the sum of product and product of sum forms
*Simplify equations using K maps up to 4 variables
*State the don’t care condition
*Develop simplified logic circuits for a given problem

UNIT-2
1.UNDERSTAND COMBINATION CIRCUITS AND LOGIC FAMILIES
*Define combination circuits
*Explain basic gates AND,OR,NOT with truth tables
*Realize functions using basic gates
*Explain NAND,NOR and XOR gates with truth tables
*Develop AND,OR gates using NAND NOR gates
*Realize the functions using NAND,NOR and XOR gates
*Design BCD to excess-3 code converter
*Design BCD to seven-segment code converter
*Design half adder and full adder(AND-OR,NAND-NAND)
*Explain 3 bit and 4 bit magnitude comparator.
*Define decoder and encoder
*Design 3-8 line decoder using AND gates
*Design 8-3 line encoder using OR gates
*Define multiplexer/Demultiplexer
*Draw the block diagram of a multiplexer
*Construct logic for 8-to-1 line MUX
*List the applications of multiplexer
*Draw block diagram of Demultiplexer
*Construct logic circuit of 1-to-8 line de-multiplexer
*Implement combinational circuit for 8 input logic function using MUX

UNIT-3
1.UNDERSTAND SEQUENTIAL CIRCUITS
*Define sequential circuits
*State the use of clock in sequential circuits
*Distinguish between combinational and sequential circuits
*State the basic principle of flip flops
*Illustrate how flip flop acts as a memory device(using NAND & NOR gates)
*Draw the block diagram and truth table of RS and D latches
*Draw the block diagram and truth table of JK and T Flip Flop
*Define edge triggering
*Discuss about preset and clear inputs
*Discuss the Race around condition
*State the need of master-slave flip flops
*Describe briefly the working of master-slave JK flip-flops
*List the different types of registers
*Draw the block diagram of Serial in serial out shift register and explain
*Draw the block diagram of serial in parallel out shift register and explain
*Understand binary counters
*List the different types of counters
*Differentiate between synchronous and asynchronous counters
*Draw the circuit diagram of an asynchronous ripple counter and explain with the wave forms and state table
*Define modulo-n counter
*Design modulo-n counters using T Flip flop and JK flip flops
*Design up-down counters

UNIT-4
1.UNDERSTAND D TO A AND A TO D CONVERTERS AND MORE LOGIC CIRCUITS
*Define accuracy
*Define resolution
*Calculate accuracy and resolution for DAC
*Draw the block diagram of simple binary weighted DAC
*Explain simple binary weighted DAC
*Explain briefly R-2R ladder type network for DAC
*Define ADC
*Define & calculate resolution for ADC
*Theory and block diagram of counter-ramp type ADC
*Draw the block diagram of successive approximation ADC
*Explain briefly successive approximation ADC
*List the advantages and disadvantages of SA-ADC
*Draw   the block diagram of linear  Ramp ADC(single slop type)
*Explain briefly linear ramp ADC(single slop type)
*List the advantages and disadvantages of linear ramp ADC(single slop  types)
*Draw the block diagram of Flash converter
*Explain briefly flash converter
*List the advantages and disadvantages of Flash converter

UNIT-5
*Define RAM and ROM
*Draw the block diagram of RAM
*State the steps to read  and write operations in RAM
*Explain static RAM with a neat circuit diagram
*Draw logic diagram and symbol of static RAM bit slice model
*State the advantages of DRAM
*Draw logic diagram and symbol of DRAM bit slice mosel
*Draw the block diagram of ROM
*Explain ROM design using diodes
*Explain internal logic of 32 x 8 ROM
*Using a circuit diagram explain ROM programming using decoder
*Design Combinational circuit implementation using ROM
*Define programmable Logic Array
*Design PLA with 3 input and 2 output


Read More
// // Leave a Comment

DBMS SYLLABUS

THIRD SEMESTER DIPLOMA COMPUTERSCIENCE DBMS REVISION-06 SYLLABUS

UNIT-1
1.UNDERSTAND DATABASE
*Define Field,Record,Database
*Distinguish between physical record-and Logical Record
*Explain Advantages of DBMS
*Understand Schemes,Subschema-Instances.Three schema architecture
*Define data independence
*Distinguish b/w Logical data independence and physical data independence

2.EXPLAIN DATABASE SYSTEM STRUCTURE(ARCHITECTURE)
*Explain Storage manager,Query processor,Disk storage,Database Users
*Discuss Database Languages-DDL,DML,DCL
*Understand various Database system application architecture like Centralized DBMS architecture,Basic client/server architecture,Two tier client/server architectures,and three tier client/server architectures


3.DATA MODELS
*Understand ER model
*Define Entity,Attribute,Keys,Relationship types,Relationship set
*Define Primary key,Candidate key,Super key
*Explain ER diagram,Weak entity set
*Compare ER Model and Enhanced ER Model
*Understand EER Model:”Subclasses-Super classes-Inheritance-Specialisation-Generalisation
*Untitles Modelling Language-Class diagram

UNIT-2
1.UNDERSTAND RELATIONAL MODEL CONCEPTS
*Define Domains,Attributes,Tuples
*Study Mapping ER model to Relational model
*Explain Constraints:Domain constrains,Key constrains,Entity integrity,Referential integrity,Foreign keys

2.UNDERSTAND RELATIONAL DATABASE DESIGN
*Explain design guidelines for relational schema
*Explain Functional dependency
*Define Normalization
*Explain normal forms:1NF-2NF-3NF-Boyce Codd Normal Form
*Explain Decomposition,Dependency preservation,Multi-valued dependencies
*Explain 4NF with example
*Understand join dependencies and define 5NF

UNIT-3
1.UNDERSTAND SQL
*Explain features of SQL
*Explain Data types in SQL
*Understand Domains,attributes and tuples
*Explain CREATE TABLE command
*Explain Constraints:NULL,DEFAULT,CHECK,PRIMARY KEY,UNIQUE,referential Integrity
*Understand DROP TABLE Command,ALTER TABLE
*Understand DROP TABLE Command,ALTER TABLE
*Understand commands for creating and roping indexes CREATE INDEX,CREATE UNIQUE INDEX,DROP INDEX
*Explain SELECT statements with WHERE,ORDER BY clause with example
*Explain UPDATE Statement,INSERT,DELETE with example
*Explain Nested queries,tuples and multi set comparison,Correlated nested queries
*Explain EXISTS and UNIQUE functions
*Explain explicit sets and renaming of attributes
*Explain Joining tables-aggregate functions
*Explain grouping:GROUP BY,HAVING clauses
*Explain BEGIN TRANS,COMMITT,ROLL BACK,SAVE POINT
*Explain Views:Advantages,Creation and Updation

UNIT-4
*Understand advanced SQL
*Study triggers and cursors
*Study reports and forms
*Explain stored procedures and functions
*Discuss how procedures are invoked from interface
1.UNDERSTAND EMBEDDED SQL
*Understand about Embedded SQL statements and its application
*Explain retrieving single tuples with embedded SQL
*Explain retrieving multiple tuples with embedded SQL using cursor
*Explain dynamic SQL by specifying queries at run time
*Discuss embedding SQL  commands in JAVA
*Discuss database programming with SQL using C as a host language

UNIT-5
1.UNDERSTAND FILE MANAGEMENT AND DATA STORAGE
 *Explain  placing File Records on Disk:Records,record types,Fixed length record,variable length record
*Explain Heap files,Sorted files,Hashing,files of mixed records
*Explain RAID technology,Storage area networks

2.EXPLAIN DISTRIBUTED DATABASE AND ITS ARCHITECTURE
*Explain advantages of distributed database over centralized database
*Explain data storage in distributed database:Data fragmentation and Data replication

3.UNDERSTAND VARIOUS INDEXING STRUCTURES:PRIMARY INDICES,CLUSTERING INDICES,SECONADARY INDICES,INDEX ON MULTIPLE FIELDS

4.TRANSACTION MANAGEMENT
*Define Transaction
*Explain transaction concepts
*Understand Properties of transactions,Transaction States
*Explain Concurrent Executions
*Explain Serializability



Read More
// // Leave a Comment

DATASTRUCTURE SYLLABUS

FOURTH SEMESTER DIPLOMA COMPUTER SCIENCE DATASTRUCTURE REVISION-06 SYLLABUS


UNIT-1
1.Understand Pointers
*Discuss features of pointers
*Explain pointer declaration
*Discuss pointers arithmetic
*State the method of accessing variables using pointers
*Implement One dim & two dim arrays using pointers
*Explain array of pointers
*Explain pointer to pointer
*Discuss use of pointer to handle string
*Discuss void pointer
*Explain use of pointers as function arguments
*Define recursion
*Discuss features of structure
*Explain declaration & initialization of structures
*Explain structure within structure
*Explain array of structures
*Explain use of pointers to structures
*Explain passing structure to functions
*Define union
*Differentiate Structure and union
*Implement string operations such as string length,compare,copy,sub-string using User defined functions.
*Explain and implement pattern matching
*Explain dynamic memory allocation


UNIT II
*List different sorting techniques
*Implement bubble sort
*Implement selection sort
*Implement insertion sort
*Implement quick sort
*Implement bucket sort
*Implement Heap sort
*Define merging
*Understanding external sort
*Implement merge sort
*Define searching
*implement linear search
*implement binary search
*Compare the different sorting algorithms such as bubble sort,quick sort,selection sort,heap sort ,insertion sort ,merge sort
*Compare different searching algorithms such as linear searching and binary searching

UNIT-III
*Define linked list
*Study operations on linked list-traversal,searching,insertion and deletion of nodes
*Explain singly linked list(SLL)
*Implement SLL
*Explain circular linked list
*Implement circular linked list
*Explain doubly linked list(DLL)
*Implement DLL
*Explain  circular DLL
*Implement circular DLL

UNIT-IV
*Define stack
*Describe the push and pop operation of stack
*Implement stack using arrays
*Implement stack using  pointers
*Explain applications of stack
*Define queue
*Explain the operations on queue-insert and delete
*Implement queue using arrays
*Implement queue using pointers
*implement circular implementation of a queue
*Explain double ended queue-Input  restricted Dqueue & output restricted Dqueue
*Explain priority queue-ascending and descending
*Understand applications of queue

UNIT-V
*Define tree
*Understand terms-root,node,child,parent,link,leaf,level,height,degree of a node,sibling,terminal node,path length,forest,labeled trees
*Explain binary tree
*Discuss the different operation on tree
*State the applications of trees
*Implement binary tree operations-insertion,deletion of node and searching
*Discuss tree traversal methods
*Implemet tree traversal algorithms-inorder ,preorder,postorder
*Discuss Binary Search Tree(BST)
*Discuss the use of threaded binary tree
*Define graph
*Explain searching methods-DFS,BFS
*Explain Dijkstra algorithm to find shortest path
*Implement Dijkstra algorithm


Read More