4th semester Data Structures and Algorithms study material

SYLLABUS

CS010 403: Data Structures and Algorithms

Teaching scheme Credits: 4

Module I (10 hours)

Principles of programming – System Life Cycle - Performance Analysis and Measurements- Time and Space complexity-Complexity calculation of simple algorithms. Hashing:- Static Hashing-Hash Tables-Different Hash Functions-Mid Square - Division-Folding-Digit Analysis, Collision-Collision Resolution Techniques.

Module II (12hours)

Study of basic data structures – Arrays- Structures-Sparse matrix – Stacks – Queues- Circular queues- Priority queues - Dqueues. Evaluation of expressions – Polynomial representation using arrays.

Module III (12hours)

Linked Lists - Linked stacks and queues - Doubly linked lists – Polynomial representation using linked lists, Garbage collection and Compaction.

Module IV (14 hours)

Trees - Binary Trees – Tree Traversal – Inorder - Preorder and Postorder, Search trees - AVL Trees, height balanced trees, Multiway search Trees- B Trees-B+ Trees. Graphs – Depth first and breadth first search.

Module V (12 hours)

Sorting methods: Selection sort, Bubble sort, Insertion sort, Merge sort, Quick sort, Heap sort, Radix sort, External sorting methods.

    You can download MG University BTech CSE 4th semester DataStructure free notes from here.

DOWNLOAD

4th semester Object Oriented Programming study material

SYLLABUS

CS010 402: Object Oriented Programming

Teaching scheme Credits: 4

Module I (8 hours)

Introduction to OOP - Evolution of object oriented languages - Need of Objects - Definition of Object Oriented Language – Classes and Objects – Creating and Using Classes and objects – Member functions and variables – Constructors –multiple and parameterized constructors ,copy constructors –constructors with default arguments- Destructors.

Module II (13 hours)

Inheritance and Access Control - Member access control in classes – Friend functions and classes – Extending classes - Public Private and Protected Inheritance – Classification of Inheritance – Single – Multiple – Multilevel – Hierarchical – Hybrid.

Module III (14 hours)

Polymorphism – Runtime and compile time polymorphism – overloading functions and operators – selecting friend member function for operator overloading - Virtual methods – pure virtual methods – Abstract classes - applications of abstract classes.

Module IV (13 hours)

Virtual Destructors – Virtual Base Classes - Template- class templates and function templates- Creating and using templates – Namespaces-Dynamic Objects - Dynamic object allocation - Inline functions. Exception Handling-basics of exception handling-exception handling mechanism- Throwing and Catching Mechanism-Rethrowing and Specifying exceptions.

Module V (12 hours)

Data file operations –opening and closing files-reading and writing from file-Classes and file operations-Other object oriented languages – Java – Object oriented features in Java – Comparison with C++-Object oriented system development-object oriented notations and graphs-object oriented analysis-object oriented design.

You can download MG University B Tech Object Oriented Programming free notes from here.

DOWNLOAD

Reference books : -

1. Object Oriented Programming in C ++, 3rd Edition - DOWNLOAD

2. Object oriented Programming with C++,E. Balaguruswamy - DOWNLOAD

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