3rd semester computer organisation

SYLLABUS

CS010 304: Computer Organization

Teaching scheme Credits: 4


Module I (10 hours)

CPU - Arithmetic: Signed addition and subtraction –BCD adder –Multiplication – Array multiplier – Booth’s Algorithm, Division – Restoring and non-restoring division.

Module II (12 hours)

Floating-point arithmetic- addition, subtraction, multiplication, division. Decimal arithmetic- addition subtraction, multiplication, division. ALU - design of arithmetic, logical, arithmetic logical unit

Module III (14 hours)

Control Logic Design – Control Organization – Hardware control, Microprogram control (design for specific problems)– Microprogram sequencer, Horizontal and vertical micro instructions.

Module IV (12 hours)

Memory: - Memory hierarchy –Principle of inclusion-memory interleaving techniques. Disk memory - Data organisation on disk-Disk performance –Disk caching. Main memory-SRAM, DRAM, ROM –Associative memory, Scratchpad memory-Cache memory –Levels of Cache-Mapping techniques, Associative, Direct,
and Set Associative-Main memory update policies.

Module V (12 hours)

Virtual Memory:-Overlay-Need for virtual memory-Address translation-Translation Look Aside Buffer-Relocation techniques-static, dynamic-Paged memory-Page table, Page frame data table-Segmented memory-Paged segments.

Reference Books:-

1. M.Morris Mano- Computer System Architecture- PHI- Third Edition-2006
2. M.Morris Mano – Digital Logic and Computer Design - PHI -2004
3. Carl Hamacher, Zvonko Vranesic, Safwat –Computer Organization-McGrawHill-
Fifth Edition
4. David A.Patterson,John L.Hennessy-Computer Organization and Design-MKArm
Edition
5. V.Carl Hamacher,Zvonko G. vranesic,Safwat G.Zaky-Computer Organization-
McGrawHill-Fourth Edition
6. Behrooz parhami-Computer Architecture-Oxford University Press
7. Naresh Jotwani-Computer System Organisation- McGrawHill

click the link to download:-

module-1

module-2

Module IV

Module V

B.TECH computer science s3 previous question papers

Here, iam posting previous question papers for btech computer science semester 3.


click the below link to download:-

download

3rd semester Engineering Mathematics-II study materials

SYLLABUS

EN010301 B Engineering Mathematics II

Teaching scheme Credits: 4


MODULE 1 Mathematical logic (12 hours)

Basic concept of statement , logical connectives, Tautology and logical equivalence – Laws of algebra of propositions – equivalence formulas – Tautological implications (proof not expected for the above laws , formulas and implications). Theory of inference for statements – Predicate calculus – quantifiers – valid formulas and equivalences – free and bound variables – inference theory of predicate calculus.

MODULE 2 Number theory and functions (12 hours)

Fundamental concepts – Divisibility – Prime numbers- relatively prime numbers – fundamental theorem of arithmetic – g.c.d - Euclidean algorithm - properties of gcd (no proof) – l cm – Modular Arithmetic – congruence – properties – congruence class modulo n – Fermat’s theorem – Euler’s Totient functions - Euler’s theorem - Discrete logarithm Function – types of functions – composite functions – inverse of a function – pigeon hole principles.

MODULE 3 Relations (10 hours)

Relations – binary relation – types of relations – equivalence relation –partition – equivalence classes – partial ordering relation – Hasse diagram - poset.

MODULE 4 Lattice (14 hours)

Lattice as a poset – some properties of lattice (no proof) – Algebraic system – general properties – lattice as algebraic system – sublattices – complete lattice – Bounded Lattice - complemented Lattice – distributive lattice – homomorphism - direct product.

MODULE 5 Graph Theory (12 hours)

Basic concept of graph – simple graph – multigraph – directed graph- Basic theorems (no proof) . Definition of complete graph , regular graph, Bipartite graph, weighted graph – subgraph – Isomorphic graph –path – cycles – connected graph.- Basic concept of Eulergraph and Hamiltonian circuit – trees – properties of tree (no proof) - length of tree – spanning three – sub tree – Minimal spanning tree (Basic ideas only . Proof not excepted for theorems)


Click on the below links to download:

1.Discrete mathematics –Schaum’s outlines – Mc Graw Hill-S.Lipschutz, M.L.Lipson

DOWNLOAD

2.Discrete mathematics & its Application - Mc Graw Hill-Kenneth H Rosen

DOWNLOAD

3rd Semester PSCP lab programs

Here you can download the 1st cycle Problem Solving and Computer Programming lab programs with comments for the steps.

Click below link to download:

1st cycle

MG University B.TECH Computer Science Syllabus Revision 2010

Here,Iam Posting the MG University BTECH Computer Science & Engineering Syllabus on the new scheme Revision 2010.

Click on the below links for download :

Note:- To download the files,4shared account is necessary.If not,Create a free account click here

3rd Semester

4th Semester

5th Semester

6th Semester

7th semester

8th Semester

Full Syllabus

Scheme