Course Descriptions

I  YEAR

II Year

SEMESTER I

Title of the Course: Introduction to Information Technology
Course Code: MCA-101
Credits of the course: 3
Year & Semester: First & I                                                                        L T P

Unit: I
The evolution of computers, Classification of computers, The control unit, computer organization &Block diagram representation, storage devices, microprocessors, instruction set, CISC & RISC processor, Input-Output devices, interconnection architectures. Low level and high level languages, assemblers,  compilers, interpreters, linkers, algorithms, flow charting, decision tables, pseudo code, software, application software packages.

Unit: II
Operating system concepts, Role of an Operating System, Types of operating systems, structure of operating system, Booting procedure and its types, Fundamentals and typical instructions of Windows & Non-Windows based Operating Systems.UNIX/LINUX commands, working with Windows, Windows 9x/NT/XP, Data Processing, File systems and Database Management Systems, different types of Database Management System..

Unit: III
Basic elements of a Communication System, Data transmission modes, Data Transmission speed, Data transmission media, Digital and Analog Transmission, Network topologies, Network Types (LAN, WAN and MAN), Communication protocols, Inter networking tools, Distributed Computing Systems.
Multimedia concepts, What is a Multimedia computer systems, Multimedia components, Multimedia applications, Internet-Definition, Basic services, Internet search tools, WWW, Web browsers.

 Text Book:
  1. ChetanSrivastva, "Fundamentals of Information Technology, Kalayani Publishers, 2003.

Reference Book (s):

1. P. K. Sinha&PritiSinha, “Foundation of Computing”, BPB Publications.
2. David Cyganski,  John A. Orr, “ Information Technology Inside and Outside” Pearson Education 2002.
3. V. Rajaraman, “Fundamentals of Computers” (2nd edition), Prentice Hall of India, New Delhi, 1996.
4. Alex Leon & Mathews Leon, “Fundamentals of Information Technology”,”, Leon Tech  world.
5. Internet and Web Page Design:  V.K. Jain, BPB Publication, First Edition, 2000.
6. D. H. Sanders, “Computers Today”, McGraw Hill, 1988.
7. B. Ram, “Computer Fundamentals”, Wiley, 1997.

________________________________________________________________________
Title of the Course: Programming Methodology using C
Course Code: MCA-103
Credits of the course: 4
Year & Semester: First & I                                                                                         L T P

Unit: I
Overview of C language: History of C, Importance of C, Translators.Programming process: Steps in program development, Algorithms, Flow Charts, Basic structure of C,  Character set, Variables, Identifiers, keywords, C Tokens, Data types, variable Declarations,  Input-Output: getchar, putchar, scanf, printf, gets, puts function.Preprocessor commands: #include, #define C Program structure. Operators and their procedure: Arithmetic, Logical, relational, Assignment, Increment-Decrement, Conditional, Bitwise, Special operators. Control Statement: Branching, Looping and Jumping Statement.

Unit: II
Functions: Definition, Function Calland function body, Function prototypes, Actual and formal parameters, Types of function, Local and global variables and passing arguments to functions: Call by value and call by reference, Recursion.  Arrays: Definition, Declaration and initialization of array, Access of Elements, Two dimensional, Multidimensional arrays, strings: Declaring strings, String handling functions..

Unit: III
Pointers: Advantages of pointers, Address of operator, declaring pointer variable, initializing pointers, Pointer arithmetic, pointers and linear array, Pointers and functions: pointers as arguments, pointers to pointers. Structure:Declaration structure, Declaring structure Variable, accessing members, structure within structure, Union.  File Handling: Data files, operations on file, opening and closing files, I/O operations on files.

Text Book:
1. E.Balaguruswamy, “Programming in ANSI ‘C’ Tata McGraw Hill.

Reference Book(s):
1. Kanetkar, “Let Us C”, BPB Publications. Tata McGraw Hill.
2. Kerighan& Richie, “The C programming language”,  PHI Publication.
3. Byron Gotfried: Programming with C, Second Edition, Schaum’s outline Series, TMH Edition.

Title of the Course: Digital Electronics
Course Code: MCA-105
Credits of the course: 3
Year & Semester: First & I                                                                                    L T P

Unit: I
Number System : Binary, Octal, Hexadecimal and Decimal. 1's and2's Complements, Inter-conversion of numbers. Codes : BCD Code,Excess-3 Code, Gray code, Alphanumeric Codes, Parity Bits, hamming Code, Floating Point Numbers.
BinaryArithmetic: Basic Rules of Binary Addition and Subtraction,Addition and Subtraction Using 2's Complement Method, Binary Multiplicity - repeated Left shift and Add Algorithm, Binary Division -Repeated Right Shift and Subtract Algorithm.

Unit: II
Positive and Negative Logic, Truth Tables, Logic Gates, Fan out ofLogic Gates, Logic Families, TTL Logic Family, CMOS Logic Family,ECL Logic Family, NMOS and PMOS Logic Family. Boolean Algebra vs. Ordinary Algebra, Boolean Expressions-Variables and Literals, Boolean Expressions-Equivalent and Complement, Theorem of Boolean Algebra, Minimization Techniques, SOPs &POSs Boolean Expressions, Quine-McCluskey Tabular Method,Karnaugh Map Method.

Unit: III
Combinational Circuits,Implementing Combinational Logic, Arithmetic Circuits-Basic Building Blocks, Adder- Subtractor, BCD Adder, Magnitude Comparator, Parity Generator and Checker, Demultiplexersand Decoders, Encoders, Read Only Memory (ROM),Programmable Logic Array (PLA).R-S Flip Flop, Level Triggered and Edge Triggered Flip Flops, J.K.Flip Flop, Synchronous and Asynchronous Inputs.
Ripple Counter vs. Synchronous Counter, Modulus of a Counter, Propagation Delay in Ripple Counters, Binary Ripple Counters, Up/Down Counters, Decade and BCDCounters, Pre-settable Counters, Shift Register, Controlled shift Registers. RAM Architecture, Static RAM (SRAM), Dynamic RAM (DRAM).

Text Book:
1. Mano, M.M., “Digital Logic and Computer Design”, Prentice-Hall of India, 2002.

Reference Book (s):
1.Kumar, A., “Fundamentals of Digital Circuits”, PHI..
2.Tokheim, “Digital Electronics”,TMH.
3. Ramesh S. Gaonkar., “Microprocessor Architecture Programming and Application with 8085”,.
4. Malvino& Leach., “Digital Principles and Application”, TMH.

5. Basaraj, B., “Digital Fundamentals”, Vikas Publications.

Title of the Course: Financial Accounting
Course Code: MCA-107
Credits of the course: 3
Year & Semester: First & I                                                                                   L T P

Unit: I
Definition, Objectives, Functions, Book Keeping, Branches of Accounting, Principles of Accounting, General Entry, Subsidiary Books, Ledger and Trial Balance., cash book  Final Accounts :Trading Account / Manufacturing Account, Profit and Loss Account, Balance Sheet, Adjustment Entries

Unit: II
Budgeting: Definition of budget; Essentials of budgeting; Kinds of budget -functional budgets, master budget; Fixed and flexible budget; Budgetary control; Zero-base budgeting; Performance budgeting. Standard Costing and Variance Analysis: Standard costing as a control technique; Setting of standards and their revision; Variance analysis - meaning and importance, kinds of variances and their uses - material, labour and overnead variances; Disposal of variances; Relevance of variance analysis to budgeting and  standard costing. Marginal Costing and Break-even Analysis: Concept of marginal cost; Marginal costing and absorption costing; Marginal costing versus direct costing.

Unit: III
Cost-volume-profit analysis Break-even analysis; Assumption and practical applications of break-even analysis; Decisions regarding sales-mix, make or buy decisions and discontinuation of product line etc. Analyzing Financial Statements: Horizontal, vertical and ratio analyses; Cash flow analysis. Contemporary Issue In Management Accounting: Value chain analysis; Activity-based costing; Quality costing; Target and life cycle,costing.

Text Book:
1.JawaharLal, “Advanced Management Accounting”, Text, Problems and Cases, S.   
   Chand & Co., New Delhi, 2009.

Reference Book (s):
1. Vij, Madhu, “Management Accounting”, McMillan, 2008.

2. Tulsion, “Financial Accounting”, Person edu.

Title of the Course: Principle of Management
Course Code: MCA-109
Credits of the course: 3
Year &Semester: First & I                                                                                      L T P

UNIT 1.       BASIS OF MANAGEMENT: Concept, importance, and Nature of management. Management ,management science or art , Development of Management Thought – taylor and scientific management,fayol administrative management ,Nature and Functions of Management ,Social Responsibility and ethical issues in management

UNIT 2.PLANNING:   Planning and decision making – concept, purpose and process of planning, kinds of plans,strategic planning, tactical planning and operational planning, goal setting, MBO; decisionmaking – nature and process, behavioural aspects of decision making, forms of group decision making in organizations.

UNIT 3.ORGANISING:Concept of organisation,design of organisationstructure,formal and informal organisation,departmentation, basis for  departmentation,Span of management,Forms of organisation structure- line and staff organisationstructure,Authority and Responsibility relationship,Conflict and coordination,organisationalchange.

UNIT  4. STAFFING:Theconcept of staffing –responsibility for staffing,importance of staffing, factors affecting staffing, concept of recuirtment and  selection, Training and development, Performance appraisal.

UNIT 5. DIRECTING:Fundamentals of directing,direction and supervision,Motivation theories-Maslow’s need hierarchy,herzberg’s motivation –hyginetheory,McGregor’stheory,Motivationalapplications,Leadership- concepts.leadership styles and importance, concept of communication.

UNIT6., CONTROLLING:controlling and other functions, concepts of controlling ,steps in controlling, types of control
Text Book:
1.         Principles of Management                                L.M Prasad, Sultan Chand
2.         Management                                                     Bhat, Kumar, Oxford

Reference Book (s):
1.         Fundamentals Of Management                         S.P. Robbins & D.A. Decenzo
2.         Principles of Management                                Kooniz&Donnel
3.         Principles of Management                                K.C. Sahu

Title of the Course: PC Packages
Course Code: MCA-111
Credits of the course: 4
Year & Semester: First & I                                                                             L T P

Unit: I
Introduction to Personal Computers, characteristics of computers,generation of computers, classification of computers, types of computer,Computer performance ( i.e. Parameters that affect computer’s performance -CPU execution speed, Clock speed, RAM size, Cache ,Disc capacity etc.),Character codes (i.e. ASCII, EBCDIC, UNICODE, Excess-3, Grey code, Errorchecking codes etc. with their needs and  utilities.)Elements of a computer processing system: Processor: Understanding some of the functions of the CPU in terms ofcalculations, logical control and immediate access memory. Storage devices and media: Compare the main types of memory storagedevices in terms of speed, cost and capacity such as: diskette, zip disk, data cartridge, CD Rom.

Unit: II
Magnetic Disk. Input- devices: Various input devices: Mouse, Keyboard, Trackball, Scanner,touch pad, light pen, Joy stick, Digital Camera and Micro phone, Scanner etc. Output – devices: Printers, Plotter and speaker, VDU etc. Input – Output devices: Touch screens. Memory: Understand different type of memory (RAM, ROM, EPROM, EEPROM, Flash RAM etc.), Measuring computer memory (Bit, Byte, KB etc.). Types of software: System software, Application software. Operating system software: Functions of OS and brief introduction of someOS. Batch, multi-programming, time sharing, multiprocessing, PC operatingsystem, network operating system, on-line and real time operating system.

Unit: III
Application software: Common Application software such as: Word processing, spreadsheet, database, Web browsing, desktop publishing, accounting, Computer aided designing and drafting (CADD), MATLAB, LAB VIEW & simulation software Programming paradigms and languages: classification, machine code, assembly language, Programming paradigms and higher level languages. Utility of Application software Understanding of word processing, spreadsheet and presentation packageusing (MS – Office or Open Office) for data analysis.

Text Book:
1.Taxali R. K., “PC Software for Windows made simple”, Tata McGraw-Hill Publishing Co. Ltd.

Reference Book(s):
1. D. S. Yadav, “Foundation of Information Technology” New Age.
2. P. K. Sinha, “Foundation of Computing”, BPB Publication.
3. Sanders, D.H., “Computer Today”, McGraw Hill.
4. Rajaraman V., “Fundamental of Computers”, 2nd Edition, PHI.
5. Ron Mansfield, “Working in Microsoft Office”, Tata McGraw-Hill Publishing Co. Ltd.

SEMESTER II

Title of the Course: Management Information system
Course Code: MCA-102
Credits of the course: 3
Year & Semester: First & II                                                                         L T P

Unit I
Introduction to systems and Basic systems concepts, Types of systems, The systems Approach,
Information systems: Definition and characteristics, types of Information, role of Information in
Decision – Making, Sub – systems of information systems: EDP and MIS, management levels,
EDP/MIS/DSS

Unit II
An overview of Management Information System: Definition and Characteristics, Components of MIS, Frame Work understanding MIS: Robert Anthony’s Hierarchy of Management Activity. Information requirements and Levels of Management, Simon’s Model of decision – Making, structured Vs un-structured decisions,

Unit III
Formal Vs. Information systems Developing Information systems: Analysis and design of information systems: Implementation and evaluation, Pitfalls in MIS development. Functional MIS: A study of Marketing, Personnel, financial and Production MIS

Text Book:
1. J. Kanter,” Management Information Systems”, PHL.

Reference Book (s):
1.Robert G. Murdick& Joel E. Ross & James R. Claggett, “ Information Systems for ModernManagement”, PHI.
2. Goirden B. Davis &M.H.Olsca“ ManagementInformation Systems: Conceptual Foundation, Structure and Development.

Title of the Course: Object Oriented Programming using C++
Course Code: MCA-104
Credits of the course: 4
Year & Semester: First & II                                                                               L T P

Unit: I
Evolution of OOP: Procedure Oriented Programming, OOP Paradigm, Advantages and disadvantages of OOP over its predecessor paradigms. Characteristics of Object Oriented Programming: Abstraction, Encapsulation, Data hiding, Inheritance, Polymorphism, Code Extensibility and Reusability, User defined Data Types. Introduction to C++: Identifier, Keywords, Constants, Operators: Arithmetic, relational, logical, conditional and assignment. sizeof operator, Operator precedence and associativity. Type conversion, Variable declaration, expressions, statements, manipulators Input and output statements, stream I/O, Conditional and Iterative statements, breaking control statements.

Unit: II
Storage Classes: Automatic, Static, Extern, Register. Arrays, Arrays as Character Strings, Structures, Unions, Bit fields, Enumerations and User defined types.
Pointers: Pointer Operations, Pointer Arithmetic, Pointers and Arrays, Multiple indirections, Pointer to functions. Functions: Prototyping, Definition and Call, Scope Rules. Parameter Passing: by value, by address and by reference, Functions returning references, Const functions, recursion, function overloading, Default Arguments, Const arguments.
Classes and Objects: Class Declaration and Class Definition, Defining member functions, making functions inline, Nesting of member functions, Members access control, this pointer. Union as space saving classes. Objects: Object as function arguments, array of objects, functions returning objects, Const member functions. Static data members and Static member functions.Friend functions and Friend classes.

Unit: III
Constructors: properties, types of constructors, Destructors: Properties, Virtual destructors. Array of objects. Dynamic memory allocation using new and delete operators, Nested and container classes Scopes: Local, Global, Namespace and Class Inheritance: Defining derived classes, inheriting private members, single inheritance, types of derivation, function redefining, constructors in derived class. Types of inheritance: Single, Multiple, Multilevel and Hybrid. Types of base classes: Direct, Indirect, Virtual. Polymorphism: Methods of achieving polymorphic behavior. Operator overloading: overloading binary operator, overloading unary operators, operator overloading using friend function. Function overloading: early binding, Polymorphism with pointers, virtual functions, late binding, abstract base class Difference between function overloading and overriding. Templates: Generic Functions and Generic Classes, Overloading of template functions. Exception Handling catching class types, handling derived class exceptions, catching exceptions, restricting exception, rethrowing exceptions, terminate and unexpected, uncaught exceptions.

Text Book:
1. BjarneStrautrup, “The C++ Programming Language”, Addition- Wesley Publication Co., 2001.
Reference Book (s):
1. Robert Lafore, “Object Oriented Programming in C++”, Galgotia Publications, 1994.
2..Stanley B. Lippman, JoseeLajoie, “C++ Primer”, Pearson Education, 2002
3. E. Balagurusamy, “Object Oriented Programming with C++”, Tata McGraw-Hill, 2001
4. Deitel and Deitel, “C++ How to Program”, Pearson Education, 2001.

Title of the Course: Operating System
Course Code: MCA-106
Credits of the course: 3
Year & Semester: First & II                                                                              L T P

Unit: I
Introduction to operating system, its need and operating system services; operating systemclassification – single user, multi user, simple batch processing, Multiprogramming, Multitasking, parallel Systems, Distributed system, Real time system, Process Management: Process concept, Process scheduling, threads, overview of Inter process communication, CPU scheduling: Basic concepts, Scheduling Criteria, Scheduling algorithms.

Unit: II
Processes: Process Concept, Process Scheduling, Operation on Processes, Cooperating Processes, Interprocess Communication. CPU Scheduling: Basic Concepts, Scheduling Criteria, Scheduling Algorithms, Multiple- Processor Scheduling, Real-Time Scheduling, Algorithm Evaluation.Process Synchronization: Background, The Critical-Section Problem, Synchronization Hardware, Semaphores, Classical Problems of Synchronization, Critical Regions, Monitors, Synchronization in Solaris 2, Atomic Transactions.

Unit: III
Memory Management: Background, Logical versus Physical Address space, swapping, Contiguous allocation, Paging, Segmentation, Segmentation with Paging.Virtual Memory: Demand Paging, Page Replacement, Page-replacement Algorithms, Performance of Demand Paging, Allocation of Frames, Thrashing, Other Considerations, Demand Segmentation.Deadlocks: System Model, Deadlock Characterization, Methods for Handling Deadlocks, Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, Recovery from Deadlock, Combined Approach to Deadlock Handling.Device Management: Techniques for Device Management, Dedicated Devices, Shared Devices, Virtual Devices; Device Characteristics- Hardware Consideration, Input or Output Devices, Storage Devices, Channels and Control Units, Independent Device Operation.

Text Book:
1.Silbersachatz and Galvin, “Operating System Concepts”, Pearson, 5th Ed., 2001.

Reference Book (s):
1. Madnick E., Donovan J., “Operating Systems”, Tata McGraw Hill, 2001.
2..Tannenbaum, “Operating Systems”, PHI, 4th Edition, 2000.
3. Peterson, Silberscahatz, “Operating System Concepts”, Addison-Wesley publishing Co; 2nd, Ed., 1985.

4. A.S. God bole: Operating Systems (TMH), 1997.

Title of the Course: Discrete Mathematics
Course Code: MCA-108
Credits of the course: 3
Year & Semester: First & II                                                                        L T P

Unit: I
Sets,  Relations  and  Functions: Definition of  Sets  and  subsets,  Types of Sets, Multi Sets, Operations on Sets, Relations and Properties of Relations, Representation of Relations, Equivalence Relation,De Morgan's  law, Cardinality, Mathematical induction; Propositions;  Equivalence relations;  Binary, Equivalence and  partial ordering  relations,   chains   and  anti chains,   Job sequencing  problem,  Pigeonhole principle.

Unit: II
Algebra : Groups,  Subgroups,  Cosets,  Lagrange's Theorem,  Permutation Group, Isomorphism and  Homomorphism,  Normal  Subgroups, Rings, Integral Domain, Fields.   Mathematical Logic : Notation; Connectives; Normal forms; Principal Normal Forms; Theory of Inference for Statement Calculus; Predicate calculus; Inference theory of the Predicate Calculus.Permutation &Combinations :Introduction, Rules sum & products, Permutations, Combinations, Generation of permutation & combinations, Discrete probability, Conditional probability.

Unit:III
Discrete Numeric Functions and Generating Functions: Manipulation, Asymptotic behavior; Generating Functions. Recurrence Relations.Boolean Algebra: Lattices and Algebra Systems; Principle of Duality; Basic Properties of Algebraic System defined by Lattice; Distributive and Complemented Lattices; Boolean Lattices and Boolean Algebra; Uniqueness of Finite Boolean algebra; Boolean Functions and Boolean Expressions; Propositional Calculus.

Text Book:
1. C. L. Liu., “Elements of Discrete Mathematics”,  McGraw Hill, 1985.

Reference Book (s):
1.B. Colman and R.C.Busby, “Discrete Mathematical Structure for Computer Science”,   
(PHI), 1989.

2. P. Trembley and R. P. Manohar, “Discrete Mathematical Structures with Applications to Computer Science”, McGraw Hill, 1988.
3. Richard Johnson Baugh, “Discrete Mathematics”, FifttEdiion, Pearson Education.
4. Ralph P. Grimaldi, “Discrete and Combinational Mathematics”, 4th Edition, Pearson   
Education.
5. Vinay Kumar, “Discrete Mathematics”, BPB Publications.

Title of the Course: Communication Skills
Course Code: MCA-110
Credits of the course: 3
Year & Semester: First & II                                                                             L T P

Unit: I

Process, Characteristics, Levels, Flow, Networks and Importance: Basics of Technical Communication. Interpersonal, Intrapersonal, and Organizational, Barriers to Communication. Kinesics, Proxemics, Paralinguistics, Chronemics: Non Verbal Communication. Software for Creating, Messages, Software for writing, Documents, Software for Presenting Documents, and Transmitting Documents: Technology in Communication. Types, Traits of a good Listener, Active versus Passive Listening, and Implications of Effective Listening: Active Listening, Words and Phrases, Sentences and Paragraphs: Fundamentals of Effective Writing.

Unit: II
Art of Condensation, Reading Comprehension: Fundamentals of Effective Writing. Practice: Fundamentals of Effective Writing. Analysing Audience, Organising Contents, Preparing an outline, Visualaids, Types of Delivery: Effective Presentation Strategies. Mock Presentation followed by Discussion: Effective Presentation Strategies. Presentation for Evaluation: Effective Presentation Strategies. Importance, Preparatory Steps and Structure: Technical Reports. Written Practice: Technical Reports. Structure, Principles, Types ,Letters, Memos and E-mails. Group Discussions, Meetings and Conferences: Group Communication. Mock GD followed by comments: Group Communication.

Unit: III
GD for Evaluation: Group Communication. Types, Preparation, Success and Failure Factors: Interviews. Practice for Interview: Interviews. Definition, Types, Structure and Style: Technical Proposals. Definition, Characteristics Style and Presentation: Research Paper, Dissertation and Thesis. Preparing List of References and Bibliography: Referencing Conventions.     

Text Book:
1.Raman, Meenakshi and Sangeeta Sharma. 2003. Technical Communication: Principles and Practice.New Delhi: OUP.

Reference Book (s):
1.Raman, Meenakshi and Prakash Singh.2006 Business Communication.New Delhi: Oxford University Press.
2.Rizvi, M Ashraf. 2006. Effective Technical Communication. New Delhi: Tata McGraw-Hill Publishing Company Ltd.
3.Guffey, Mary Ellen. 2004. Essentials of Business Communication. 6thEdition. USA: Thomson (South-Western).
4.Sharma, R.C. and Krishna Mohan. 2002 Business Correspondence and ReportWriting.3rd Edition. New Delhi: Tata McGraw-Hill Publishing Company Ltd
5.Lesikar, Raymond V. et al. 2001. Lesikar’s Basic Business Communication.8thEdition. New Delhi: Tata McGraw-Hill CompanyLimited.

Unit: I
Introduction: data structures and data structure operations, Basic concepts and notations, mathematical notation and functions, Big ‘O’ notations, algorithmic complexity and time space trade off. Basic data structures:  Arrays, Stack and Queues and their applications, linked and sequential representation. Linked list, representation of linked list, multi linked structures.
Trees-definitions and basic concepts, linked tree representation, representations in contiguous storage, binary trees, binary tree traversal, searching insertion and deletion in binary trees, heap tree and heap sort algorithm, AVL trees, Minimum Spanning Tree Algorithms, Kruskal’s Algorithm, Prim’s Algorithm, Algorithms of discrete Mathematics.

Unit: II
Graphs: Graphs and their application, topological sort, activity network, critical path, path enumeration sequential and linked representation of graph – adjacency matrix, operations on graph, traversing a graph, Dijkstra’s algorithm for shortest distance, DFS and BFS, Hashing. Coloring of Graphs.Searching and sorting: Searching and sorting use of various data structures for searching and sorting, Linear and Binary search, Insertion sort, Selection sort, Merge sort, Radix sort, Bubble sort, Quick sort, Heap Sort.

Unit: III
Files: Files, Queries and sequential organization;Cylinder surface indexing, Hashed Indexed, Tree Indexing, Trie Indexing, Sequential file organizational, random file organization, Hashed file organization, Inverted files, cellular partitions.Hashing :Various Hashing Techniques, Dynamic Storage.

 Text Book:
1.A. Tannenbaum, Y. Lanhgsam and A.J.Augenstein, “Data Structures Using C”, Prentice Hall of India, 1990.

Reference Book (s):
1. Seymour Lipschultz, “ Theory and Practice of Data structures”, McGraw Hill, 1988.
2. E. Horowitz and S.Sahni, “Data structures with Pascal”, Galgotia, 3rd edition, 1991.
3.E. Horowitz and S.Sahni,”Data structures with Pascal”, Galgotia, 3rd edition, 1991.
4.E. Horowitz and S. Sahani, Galgotia, “Fundamentals of Data Structures”, Booksource Pvt. 
Ltd., 1999.
5.R. S. Salaria, “Data Structure & Algorithms”, Khanna Book Publishing Co. (P) Ltd., 2002.
6. SartajSahani, “Data structure using C”, Galgotia Publication Pvt. Ltd.