If you want to make money online : Register now

Min 35 out of 100 for passing
Min 18 out of 50 for passing


Lab (Data Structures using C, WINDOWS 2000, LINUX / UNIX, Java and MS-ACCESS, My SQL) 4 Credits


The lab is based on the courses MCS-021, MCS-022, MCS-023 and MCS-024.



This course will help the students to acquire the basic knowledge and practical skills relating to Relational Database Management Systems. After going through this course a student should be able to:

Describe the Database and Database Management System advantagesDescribe the file organization schemes for DBMSDescribe various types of index mechanisms for DBMSCreate small client server applicationsWrite SQL queries, create forms and queriesDraw E R diagrams and design of databasesDescribe and use features for Recovery, Concurrency and Security in DBMS.


The Database Management System Concepts: The file based system, The need of database, The structure of a database, Three level Architecture of databases, The need of three level architecture, the relational Model, The Entity relationship model, Conversion of ER diagrams to Relational Database, The database Integrity, functional dependency and Normalisation,, Conventional File Organisation, The sequential file organization, Index sequential, Hashing file organization, Multi key file organization and inverted files, Sparse and dense index, Index and B tree,  The Structured Query Language: What is SQL? The data definition of SQl,, the data manipulation through SQL, Views, Table handling, Nested Queries.Distributed and Client-Server Databases: Need for these systems, Advantages of the distributed and client server database systems, Data Replication, Fragmentation, Client server implementation examples, Distributed queries, Design issues of distributed and client server databases.Database Recovery: Transactions, States of Transactions, Checkpoints, Forward and Backward recovery, SQL commands for RecoveryConcurrency Management: Concurrency Related Problems, Locks, Two Phased Locking, Deadlocks and its Prevention, Concurrency Control, SQL commands to control concurrency.Database Security: Security and Integrity, Authorization, Data Access Control, SQL commands for Security GRANT and REVOKE.CASE STUDY: Implementation of a Database solution to an Industrial Problem. The description may include: The Problem statement, The basic requirements, Analysis details, The ER diagrams, Realistic database design, Screens and reports, Some MIS oriented query implementation, Summary.


After completing this course, the learner will be able to

Discuss the fundamental concepts of OS and computer networking concepts.Identify and describe the non-technical terms, the components of networkingProduces a plan to identify the network topology, the external communication requirements and

minimum network storage requirement.

Work with Windows 2000 and Linux OSDescribe the features of network administration.


 Graphical User Interface, Evolution of the Human and machine interaction, functionality of GUI, Examples of some GUIs, Goals of Operating system, Functions of an Operating System, System calls, system commands, Different types of operating system, Components of Operating System , File Concept, Directory Structure.

Introduction to networking concept, Network basics, Sharing information, Topology, Protocols, Types of network, Networking devices, Internetworking: concept, Architecture and protocols.

 Unix/Linux Operating System: Introduction, commands, services and utilities, user to user communication, administration.

Operating System – Windows 2000: Introduction, Managing Windows 2000 server, advanced Windows 2000 networking.


Security and Management: Network management in Windows 2000.


After completing this course, the learner will be able to

use with various concepts of Algorithm developmentuse various Data Structureapply various Sorting and Searching Techniquesapply Data Structures and other techniques to Real life problems.


Introduction to Algorithms, Algorithms for simple problems Recursive Algorithms, Array, Lists, Circular Lists, Doubly Linked Lists, Circularly Doubly Linked Lists, Stack, Queues, Undirected Graphs, Directed Graphs, Single Source Shortest Path Problem, Dijkstra’s Algorithm, Trees, Binary Trees Traversal Algorithms (Both Recursive and Non-recursive), AVL Trees, B Trees, Files, Search Techniques, Binary Search, Linear Search, Sorting Techniques, Bubble Sort, Heap Sort, Merge Sort, Radix Sort.



Program Design Concepts, Software evolution and crisis, Procedure-Oriented Approach Introduction to common PO- languages, Features of good programs and software quality, Advantages and disadvantages of PO-methodology.

Object-oriented Methodology

Basic concepts of OO approach, Evolution of OO methodology and its benefits, Comparison of OO and PO approaches, Introduction to common OO Language, Applications of OOP, Paradigms of OO approach, abstraction, Classes and Objects.

Encapsulation, Inheritance and Polymorphism, OO Software and quality.

JAVA Language

Primitive Data types and Variables, Operators, Expressions and Statements,Decision and Interactive Constructs, Classes and Objects, Inheritance and Polymorphism, Packages and Interfaces, Exception handling, Multithreaded Programming, I/O IN JAVA, Strings and Characters, Exploring JAVA I/O, Applets, Graphics and User Interfaces, Networking Features, Java Servlets.