Вы находитесь на странице: 1из 6

# INTRODUCTION TO IT AND COMPUTER SCIENCE

## Course Code: MCAIT 10101

Course Objective:
This course is aimed to provide a fundamental understanding of computer science for the students in their early stages of academic
career. Various computer nomenclatures regarding to hardware and software will be introduced for students to develop an in-depth
realization of several subjects and their significant roles in the field. The syllabus includes the basic concepts of memory, processing
units, Operating System, Computer Networks and Data Communications.

Course Contents:
Module I: Computer Basics
Algorithms, A Simple Model of a Computer, Characteristic of a Computer, Problem Solving Using a Computer, Generations of
Computer Systems

## Module II: Input output units

Description of Computer Input Units, Other Input Methods, Computer Output Units

## Module III: Computer Memory

Memory cells, Memory Organizations, Read only Memory, Physical devices used to construct Physical Memory, Hard Disks, Floppy
Disks, CDROM

## Module IV: Processor

Structure of instruction, Description of Processor.

## Module V: Primary Arithmetic

Addition, Subtraction, Signed Numbers, Two’s Compliment, Addition & Subtraction using 2’s Compliment Method, Multiple &
Division of Binary Numbers. Floating point Representation, Arithmetic Operations with Normalized Floating Point Numbers.

## Module VI: Introduction to Operating Systems

Why do we need Operating System. Batch Operating System, Multi Programming Operating System, Time Sharing Operating
System. Personal Computer Operating System, Online and Real Time Systems.

## Module VII: Classification of Computer Systems

Analog, Digital, Types of Computers (Micro, Mini, Main Frame) Systems.

## Module VIII: Introduction to Computer and Communication

Type of Communication among Computers, Need of computer Communication Network, Internet and World Wide Web,
Characteristics of communication Channel, Physical Communication Media, Establishing Channel for communications.

## Text & References:

Text:
• Fundamentals of IT, Satish Jain, BPB Publication
• Fundamentals of Information Technology, D S Yadav, New Age Publication
• Computer Fundamentals, VRaja Raman

References:

• Computer Today, S. K. Basandra, Galgotia Publication

## DATA STRUCTURES USING ‘C’-LANGUAGE

Course Objective:
This course gives the in-depth knowledge to the use, design, and analysis of data structures in computer programs. The
very commonly used data structures like arrays, stacks, queues, lists, trees, hashing and graphs will be discussed in detail.
Sorting and hashing are important topics in the study of algorithms. They are also closely related to the design of data
structures. Several algorithms to implement these techniques are included in the syllabus.

Course Contents:
Module I: Introduction to Data Structures
Data Types In C Language, Arrays In C Language , Implementation Of Single Dimensional & Multi Dimensional Arrays,
Address Calculation In Single And Multi Dimensional Arrays.

## Module II: Searching and Sorting Techniques

Insertion Sort, Selection Sort, Merge Sort, Heap Sort, Bubble Sort, Radix Sort, Hashing, Binary Search, Linear Search,
Finding Complexities of Sorting and Searching Algorithms.

## Module III: Stacks

Definition & Examples ,Representing Stack Using An Array, Implementing Push And Pop Operation In A Stack, Infix
Postfix & Prefix Expressions ,Evaluating A Postfix Expression ,Conversion From One Form Of An Expression To
Another Form

## Module IV: Queues

Introduction, Queues And Its Sequential Representation, Insert –Delete- Print Operations, Circular Queues And Their
Implementation, Priority Queues With Basic Operations.

## Module V: Programming With Linked Lists

Introduction ,Insertion And Deletion Of A Node To Single Linked List, Single- Doubly- Doubly Circular & Header
Linked Lists With Basic Operations, List Allocating and Freeing Dynamic Variables, Addition of two polynomials list.

## Module VI: Programming With Trees

Binary Trees- Operations On Binary Trees, Node Representation ,Internal And External Nodes ,Choosing A B.S.T.
Representation, Threaded Binary Trees, Finding An Element In The Tree, Deleting Kth Element, Tree Traversal,
Constructing A Tree, Binary Search Tree- Definition . Implementation Of B.S.T. Constructing A Binary Search Tree Based
On Its Given Infix And Pre/Post Fix Order, Deletion And Insertion Of A Node In B.S.T. Height Balanced Tree.
Constructing an AVL Tree, Insertion And Deletion of A Node, Searching A Node

## Module VII: Graph and Their Applications

Introduction, Graph Theory Terminology, Sequential Representation Of Graph (Adjacency And Path Matrix), Linked
Representation Of Graph, Different Operations On Graphs, Traversing A Graph(Dfs, Bfs).,Spanning Trees-Introduction
.Representation Of Spanning Tree, Constructing A Spanning Tree(Prim Algorithm , Krushkal Algorithm)

## Module VIII: Hashing

Introduction, Hash Functions, Collision Resolution Techniques.

## Text & References:

Text:
• Data Structure using C, Yashwant Kanetkar, BPB Publications
• Data Structure using C, Aron M. Tannen Baum, PHI

References:
• Data Structure and Program Design, Robert L Kruse, BPB

SOFTWARE ENGINEERING

## Course Code: MCASE 20401

Course Objective:
Students in this course should be able to explain and apply a broad range of concepts from software engineering, spanning
all aspects the software engineering process. They should be able to recognize, define, and make correct use of generally
accepted software engineering terminology.

Course Contents:
Module I: Introduction
Evolution of Software Engineering, Software Problems, Issues Involved In Software Engineering, Fundamental Qualities
of a Software Product, Approaches to Software Engineering, Planning the development Process

## Module II: Software Life Cycle Models

Development/Product Life-Cycle Model, Kinds of Software Life-Cycle Model Project Management Concepts, Project
Management Activities

## Module III: Software Requirement Specification

Requirement Engineering, Requirement elicitation, Requirement analysis, requirement documentation, Case Study.

## Module IV: Software Project Planning

Size Estimation, Cost Estimation, Models, COCOMO, COCOMO II, Putnam Resource allocation model, Software Risk
Management.

## Module V: Software Design

Software Designing Principles Various Strategies, Module Level Concepts, Structured Design Methodologies

## Module VI: Software Metrics

Software Metrics, Token Count, Data Structure Metrics, Information Flow Metrics and Metrics analysis.

## Module VII: Software Reliability

Basic Concepts, Software quality, software reliability models, Capability maturity models, ISO 9000.

## Module VIII: Software Testing

Testing Process, Some terminology, Functional Testing, Structural Testing, Levels of Testing, Debugging and Testing
Tools.

## Module IX: Software Maintenance

Maintenance Process, Maintenance Model, Estimation of maintenance cost, Regression Testing, Reverse Engineering,
Software Re-engineering, Configuration Management and Documetation.

## Text & References:

Text:
• Software Engineering, A Practitioner's Approach, Roger S. Pressman,
• Software Engineering, K.K. Agarwal, Yogesh Singh, New Age International Publishers
• An Integrated Approach to Software Engineering, Pankaj Jalote, Narosa Publication

References:
• Software Engineering Concepts, Richard Fairley

BASIC MATHEMATICS
Course Code: BSIMT 10101

Course Objective:
This course is aimed to solve standard topical text book-level problems by analytical means. Apply multiple concepts in
the solution of a more sophisticated problem, which may be derived from a scientific application or from basic
application. Model a topical problem from math, solve the problem, and report the results in the original problem context.

Course Contents:

## Module I: Set Theory

Sets, Types of Sets, Basic Operations on Sets, Venn diagram, Cartesian product of two sets, Distributive law, De Morgan’s
Law

## Module II: Mathematical Logic

Basic Concepts, Propositions or Statements, Truth Table, Connectives and Compound Propositions, Implication, Bi-
conditional of Connectives, Converse, Inverse and Contra positive of an Implication, Tautology, Logical Equivalence,
Switching Circuits

## Module III: Modern Algebra

Binary Operations, Properties of Binary Operations, Semi group, Monoid, Group, Subgroups and other Groups

## Module IV: Graph Theory

Graph, Multi Graph, Complete Graph, Bi Graph, Degree, Degree Sequence

## Module V: Data Analysis

Data and Statistical Data, Frequency Distribution, Graphical Representation, Measure of the Central Tendency, Measure
of Dispersion

## Text & References:

Text:
• Business Mathematics, Sancheti & Kapoor, S.Chand & Sons

References:
• Discrete Mathematical Structure, Kolman, Busby and Ross, PHI