Download sem1 - Devi Ahilya Vishwavidyalaya

School of Computer Science
Devi Ahilya Vishwavidyalaya, Indore
Scheme of Examination
M.C.A/ M.Sc.(CS) /M.Sc.(IT) - Semester - I
L
T
P
C
CS-401
Computer and Communication fundamentals
3
1
2
4
CS-411
Discrete Structures
3
1
2
4
CS-421
Programming and Problem solving through 3
“C”
1
2
4
IC-491
Organizational and Management Concepts
3
1
0
3
CS-552
Operating Systems
3
1
2
4
CS-481A
Lab- I
0
0
4
2
Comprehensive Viva
4
Scheme of Examination
MBA (CM) - Semester - I
L
T
P
C
CS-401
Computer and Communication fundamentals
3
1
2
4
CS-416
Mathematical foundation of Computer Science 3
1
2
4
CS-421
Programming and Problem solving through 3
“C”
1
2
4
IC-491
Organizational and Management Concepts
3
1
0
3
CS-552
Operating Systems
3
1
2
4
CS-481A
Lab- I
0
0
4
Comprehensive Viva
2
4
A student is permitted to undertake the semester examination of a paper only in case
he/she has attendee minimum 75% of the total periods, 85% of laboratory classes
cleared internal tests. Approximately 52 hours lectures will be held for each subject.
Student Evaluation
External Examination - 60 marks
Internal Examination - 40 marks
Total
-100 marks
Comprehensive Viva and practical exam will be held separately for each course.
CS -401 COMPUTER AND COMMUNICATION SYSTEMS FUNDAMENTALS
Course Objectives: Understand the representation and processing of information
by binary numbers, memory devices and IO devices in the computer systems and
bus communication and protocols and introduction to networks
Course Description:
Unit I
No. of hours :12
From Electron to Bits, Binary Representation of Positive Integers, Negative (Signed)
Integers, Signed Magnitude representation, Two's Complement Notation, Sign Extension,
Fixed Point Arithmetic operations on Positive and Signed (Negative) Integers, Addition
and Subtraction, Addition and Subtraction of Signed Numbers, Addition/ Subtraction
Logic Unit, Design of fast adder and Carry look ahead addition, Multiplication of
Positive Integers, Signed Operand Multiplication of Integers, Booth's Algorithm, Fast
Multiplication, Bit Pair Recording of Multipliers, Division of Integers, Overflow and
Underflow, Floating Point Numbers (IEEE754 Standard) and Operations, NaN and
Denormalized Numbers, Arithmetic Using Floating Point Numbers, Implementing
Floating Point Operations, BCD Arithmetic Operations, BCD Notation, Packed
Decimals, Unpacked Decimal, Design of ALU, Bit Slice Processor
Unit II
No. of hours :10
Memory Devices, Semiconductor RAM Memories, Average Access Times, Memory
Hierarchies Internal Organization of Semiconductor Main Memory Chips RAM,
ROM, Semiconductor Main Memories RAM Static Memories SRAM,
Asynchronous DRAM, DRAM Refresh, DRAM Access Times, Page Mode and, Newer
DRAMs, Synchronous DRAM, Latency, Throughput, Structure of Larger Memories,
Pipelining, parallels and Precharging, Interleaved Memory, Memory System
Considerations, RDRAM, Rambus Memory, Semiconductor Main Read-Only
Memories ROMs, ROM, PROM, EPROM, EEPROM, Flash, Speed, Size and Cost
Unit III
No. of hours :10
Standard IO Interfaces, PCI Bus, SCSI Bus, USB, Fire Wire, Intel Multibus Standard,
I/O Processors, External IO Devices, Input Devices, Printers (Dot matrix, ink jet and
Laser), Display Devices, Magnetic drives and Optical Drives, Secondary Storage
Magnetic Ferrite Core Memories, Hard Disk, Optical Disks CDROM Memories
Unit IV
No. of hours :10
BASICS OF NETWORKS, A Standalone Personal Computer, Computer Network,
Point to Point to Point Computer Network, Broadcast Network and a multicast Network,
TOPOLOGIES OF NETWORKS, Topology or An arrangement, LAYERS IN THE
NETWORKING, Application Layer (7th OSI Layer), Presentation Layer (6th OSI
Layer), Session Layer (5th OSI layer), Transport (4th OSI layer), Network Layer (3rd
OSI layer), Data Link Layer (2nd OSI layer), Physical Layer (1st OSI layer),
SWITCHING IN THE NETWORKS, BRIDGES, ROUTERS AND GATEWAYS, THE
TYPES OF NETWORKS, A Local Area Network (LAN), FDDI LAN, FDDI II LAN,
ATM LAN,
MAN, CLIENT SERVER NETWORK, WAN, Subnets and A Sub
networks:, Autonomous System, INTRANET, INTER-NETWORK (An internet),
INTERNET (The Internet)
Unit V
No. of hours :10
Interconnection Networks Multiprocessor System Interconnects, Hierarchical Bus and
Time Shared bus Systems, Crossbar Switch, Multi-port Memories, Hypercube Networks,
Multistage Networks, Combining Networks , Banyan and Delta Networks, Shared
Memory Systems  Memory Organization in Multiprocessors, Centralized Shared
Memory Architecture, Distributed Shared Memory Architectures, Memory Organization
 Shared Memory Systems, Bus Shared Systems, Cluster Computing
Reference Books :
1. Computer Organization by Hamacher, McGraw-Hill
2. Computer Organizations and Architecture by Hayes, McGraw-Hill
3. Understanding Data Communication and Networks by William Shay
Note: For each unit, student will be assigned 15 problems, each of which are to
solved after the self-study.
CS-401
UNIT – I
COMPUTER AND COMMUNICATION FUNDAMENTALS (MBA – CM)
No. of Hours: 12
Introduction to Computer System, Characteristics, Classification,
Components and Working of Computer system, Hardware and Software, I/O
and storage devices.
UNIT – II
No. of Hours: 10
Introduction to communication and communication system, Computer
Networks Topologies, Standards, Need for standards, Standards Organization
(Agencies), Open system Model and OSI model, Future of data Communication.
UNIT – III
No. of Hours: 10
Communication media, Communication services and devices, Codes,
Analog and Digital signals, Modulation and De-Modulation, Modems and
Modem Standards.
UNIT – IV
No. of Hours: 10
Transmission modes, Interface standards, Multiplexing, Contention Protocols, Data Compression.
UNIT – V
No. of Hours: 10
Data
UNIT – VI
Internet Protocols, Transport Protocols, Internet Applications.
No. of Hours: 10
Reference Books:
1.
Understanding Data Communication and Networks by William Shay
Pub. Mc-Graw Hill.
2.
Introduction to Computer Science by Pearson publication.
3.
Computer Fundamentals by B. Ram.
CS - 411 DISCRETE STRUCTURES
Course Objectives : Discrete Structures course has more than one purpose. Students
should be acquainted with the mathematical foundation of computer science. The
major objectives of teaching Discrete Structures are :i.
Enhance Mathematical Reasoning of students:- Students must
understand mathematical reasoning in order to read, comprehend and
construct mathematical arguments. This course offers a firm base for
improving mathematical reasoning of students.
ii.
To Understand Discrete Structures: - One of the major objectives of
this course is to teach students how to work with Discrete Structures,
iii.
iv.
which are the abstract mathematical structures used to represent discrete
objects and relationships between these objects. These structures form
mathematical base for Computer Science. These Discrete Structures
include sets, permutations, relations, graphs, trees and finite-state
machines.
Enhance Algorithmic Thinking of students :- Certain classes of
problems are solved by the specification of algorithm. After an algorithm
has been described, a computer program can be constructed
implementing it. As a student of this course one knows how to construct
algorithms and derive the complexities.
To understand major Applications and Modeling: - This course helps
student to use models for problem solving, so student is familiar with
graphical models.
Course Description: This course offers a study that aims to give the reader a
holistic understanding of discrete mathematics and computer science, through
careful illustration of relationships between the key concepts. Five important themes
are interwoven in this course mathematical reasoning, combinatorial analysis,
relations, graph theory and applications and modeling. The course designed carefully
blends and balances all these five themes.
Unit I The Foundations : Logic , Sets and Functions
No. of hours: 8
Introduction, logic, prepositional equivalences, predicates and quantifiers, set, set
operations, fuzzy sets, functions, functions for computer science, sequences and
summations.
Unit II Mathematical reasoning
No. of hours: 5
Methods of proof , mathematical induction, recursive definitions, recursive algorithms.
Unit III Combinatorics
No. of hours :8
The basics of counting, The Pigeonhole Principle, Permutations and Combinations,
Advanced counting techniques, recurrence relations, solving recurrence relations,
Algorithms, Complexity of algorithms.
Unit IV Relations
No. of hours :10
Relations and their properties, n-ary relations and their applications, representing
relations, closures of relations , equivalence relations , partial orderings.
Unit V Graphs
No. of hours :16
Introduction to Graphs, Graph terminology, representing graphs and graph isomorphism,
connectivity, Euler and Hamiltonian Paths, shortest path problems, planar graphs, graph
colouring, chromatic number, Euler’s formula, Kuratowski’s theorem The four colour
problem, Applications of Graph Colouring, Introduction to Trees, applications of trees,
tree traversal, trees and sorting, Spanning trees, minimum spanning trees.
Unit VI Languages and Grammar
No. of hours :5
Introduction to Languages and Grammars ,Phrase-Structure Grammars , Types of Phrase
structure grammars.
Reference Books:
1. Kenneth H. Rosen “Discrete Mathematics and its Applications” , 4th edition
, Tata McGraw-Hill Edition.
2. C.L. Liu, "Elements of Discrete Mathematics”.
3. Kolman, Busby & Ross "Discrete Mathematical Structures" ,5th edition
Pearson Education.
4. Trembly. J.P. & Manohar. P "Discrete Mathematical Structures with
Applications to computer Science"
5. M.O. Albertson and Joan P. Hutchinson, "Discrete Mathematics with
Algorithms" .
6. N.Ch. S.N. Iyengar, V.M. Chandrasekaran, P.S. Arunachalam, "Discrete
mathematics".
7. Narsingh Deo "Graph Theory with Applications
Computer Science".
to Engineering. &
8. Discrete Structures , Logic and Computability by James L. Hein
9. Discrete and Combinatorial Mathematics ,Fifth Edition by Ralph P.
Grimaldi
Note:
Internal evaluation will be strictly on the basis of attendance in the class and
assignments will be checked weekly.
CS-416 MATHEMATICS FOR COMPUTER SCIENCE AND
MANAGEMENT
Course summary and objective:
This course enables students to conceptualize mathematical foundation for
Computer Science. This
course builds up analytical ability required for
logical analysis.
Course Description
Unit I
hours: 8
No. of
Set theory – Sets and Membership, subsets and set equality, set operations,
fundamental laws of set operations, set construction, Cartesian products,
Relations, Functions and Binary operations, operations on functions.
Unit II
No. of
hours: 8
Algebra of propositions – Statements, Conjunctions, Disjunction, Negation,
Conditional, Bi-conditional, Polynomials and Boolean polynomials,
Propositions and Truth Tables, Tautologies and contradictions, Logical
equivalence, Algebra of Propositions, Logical implication, Logically True and
Logically equivalent statements.
Unit III
No. of
hours: 8
Co-ordinate geometry of two dimensions- Co-ordinate of a point, Distance
between two points, Point dividing the join of two points. Area of a triangle,
Locus and its equations. Transformation of co-ordinates.
Unit IV
No. of
hours: 8
Functions, limits and continuity – Functions, Construction of Functions, Linear
and Quadratic Functions. Some special functions, Zeros of Functions, Limit of
a Function, Continuous Functions, Limit of Sequences, Application to
Management problems.
Unit V
No. of
hours: 10
Differential and integral calculus– Derivative, Basic Laws of derivatives.
Higher order derivatives. Maxima and Minima of functions of one variable.
Integral, Integration by Parts and simple methods of integration of simple
algebraic and transcendental functions. Definite integral, Application to
Management problems including EOQ model for inventory control
Unit VI
No. of
hours: 10
Progressions and annuity – Progressions. A.P. and G.P. Depreciation by
double declining balance method. Present Value, Annuity, Present value of an
annuity, Depreciation by Sinking fund method. Present Value under continuous
compounding.
Books recommended:
1.
2.
Essential Computer Mathematics: Seymour Lipschutz, Schaums
Outline Series in Computers, International Ed. 1982.
A Text Book of two-dimensional Geometry: Satpal and Harbanslal,
Wiley Eastern Ltd., New Delhi 1984 Ed.
3.
4.
5.
Mathematics for management, An Introduction: M. Raghavachari,
Tata McGraw Hill Publication Co. Ltd., New Delhi, 1994 Ed.
Introductory Mathematics for Economics and Business: K. Holden
and A.W. Pearson, MacMillan Press Ltd., London 1982 Ed.
Mathematics for Business and Economics: J.K.Sharma, Asian Books
Pvt. Ltd., New Delhi.
Note:- Six questions each of equal marks will be set (one each from each
section). An examinee will be required to answer five questions.
CS-421 : PROGRAMMING & PROBLEM SOLVING THROUGH "C"
"The best way to learn how to design good software is to design good software”
Course Objectives:
 You will be able to understand and solve logical & mathematical problems
through C.

You will strengthen your knowledge of a procedural programming language
(the C language).

You will be able to design and develop solutions to intermediate level
problems using the C language.

You will be able to Read, analyze and explain intermediate level C programs.

You will learn basic concepts and some elementary programs of Data
Structures like Stacks, Queues, and Linked-List.

You will further develop your skills in software development using a
procedural language (the C language).
Course Description:
Unit I: Overview of Problem Solving
No. of
hours: 8
Introduction to Computer based Problem Solving, Programming Concepts
with Flowcharting and algorithms, Classification of programming languages,
Programming Environment {Assemblers, compilers, interpreters, linkers, and
loaders}, Developing and debugging flowcharts for Programming Problem.
Unit II: Fundamentals of C Programming
No. of
hours: 7
Overview of C: Various Constructs of a C Program, Coding style, Data types,
Constants and Variables, Expressions and Operators, Basic Input/ Output
operations, Formatting Characters, Decision making and Branching, Looping
constructs.
Unit III: Arrays and their Applications
No. of
hours: 10
Arrays {one dimensional and multidimensional array}, String Handling,
Searching and sorting techniques, Matrices Operations
Unit IV: Advanced Programming Concepts
No. of
hours: 9
Structures and Union, Functions {Standard and User defined Function,
Parameter passing, Scope Rules}, Recursion {Using Recursion, Conversion
of recursive programs into non-recursive}, Dynamic Memory allocation and
pointer {Uses, pitfalls, pointers to various user-defined and standard data
types}.
Unit V: More Advanced Programming Concepts
No. of
hours: 8
Pre-Processors: {Define, include, macro's, ifdef,…}, Introduction to File
handling, Advanced pointer {Data Structures}
Unit VI: Remaining from C
No. of
hours: 8
Arguments to main, Enumerations and bit fields, Coercion, typedef, Type
Casting, Static, global, external, register, Header files creation, Other
Programming Techniques.
Reference Books:
1. R. G. Dromey, "How to Solve it by Computer", Prentice Hall of India.
2. B.W. Kernighan & D.M. Ritchie, "The C Programming Language", Prentice Hall
of India.
Background Reading:
1. Yashwant Kanetker, “Let Us C”, BPB Publication.
2. Yashwant Kanetker, “Understanding Pointers in C”, BPB Publication.
3. Vijay Mukhi, “c odyssey: dos - the charted waters”, BPB Publication.
4. Deitel, H.M. & Deitel, P.J. “C: How to Program”, Prentice Hall of India.
5. Yashwant Kanetker, “Exploring C”, BPB Publication.
6. Yashwant Kanetker, “Test your C skills”, BPB Publication.
7. Byron S. Gottfried “Schaum's Outline of Programming with C” , McGraw Hill.
8. A.M. Tanenbaum, Y. Langsam and M.J. Augenstein, “Data Structures using C”
Prentice-Hall, India.
9. Web References will be provided as and when required.
Note:
Internal evaluation will be strictly on the basis of attendance in the class and
Laboratory.
Lab Assignments will be checked weekly.
IC-491 ORGANIZATION AND MANAGEMENT CONCEPTS
Course Objective :
1. To create awareness in the students towards corporate working.
2. To understand the philosophy, mechanism and principles of operation of
corporate world so that they are aware about their career and performance
3. To prepare individuals suitable for better performance
Course Description :
The course is specially meant for Development of personality, imparting of
essential skills and prepare students for self-management. The concepts
required to understand the processes of corporate working, ethics and
management by Indian values are included to facilitate better performance in
future.
Unit-1
No.
of
Hours : 10
Managing Self
Managing Body, Managing Mind, Managing emotion, Managing habits and
attitudes
Managing consciousness
Unit-2
No.
of
Hours : 10
Essential Managerial Skills.
Decision Making: Decision making under certainty, uncertainty and risk, Identify
real problem, Making Effective decisions, Decision support system
Problem Solving: Importance, Steps in solving structured problem,
Creativity : Creativity Process, Factors inhibiting creativity
Managing Time: The Time Management Matrix, Time Wasters, Managing
activities
Unit-3
No.
of
Hours : 10
Understanding Management
Importance of management concepts for technical persons: Requirement of career
growth, working in an organization
Understanding Organization.: Definition of organization, goals, structure and
processes
Function of business : Purpose of business, Basic function of enterprise
Understanding Management.: Definition of management nature and purpose,
Management science and art
Unit-4
No.
of
Hours : 16
Process of management
Planning : Steps in planning, Types of plans, How to set objectives
Organizing : Basis of division of work , Levels and span of management,
Departmentalization - Functional Organization, Line and staff organization, Matrix
Organization
Staffing : Matching individual with job, Selection and placement
Directing : Activation, Motivation, Leading
Controlling : Process of control, Requirements of effective controls, Role of IT in
control
Unit-5
No.
of
Hours : 4
Management by Indian Values : Understanding Indian psychology, Individual
Respect, Trust, Chitta Shuddhi, Self discipline, Inspiration to give, Renunciation
and detachment
Unit-6
No.
of
Hours : 2
Ethics In Management : Institutionalizing Ethics, Factors that raise Ethical
Standards
Text Reading
1. Harold Koontz O’ Donnel and Weihrich “ Essentials of management “
Tata McGraw Hill 1998
2. R.D Agrawal
“ Organization and Management “ Tata McGraw Hill 1995
Reference Reading
1. Kast, Rosenzweig “Organization and Management”
McGraw Hill Inc. International Student Edition
2. Peter Drucker “Effective Executive”
Pan Books
3. K. Chakraborty “Ethics in Management Vedantic Perspective”
Oxford University Press
4. W.H Newman, E.K Warren “The Process of Management”
Prantice Hall of India
5. Stephen R. Covey, “Principle Centered Leadership”
Simon & Schuster
CS – 552 OPERATING SYSTEM
Course Objectives : To familiarize students with design details and functions of
modern operating systems and algorithms used in performing various operating
systems functions.
Course Description : Functions of operating system like processor scheduling,
memory management, file management and device management. Interprocess
communication and deadlock handling. Case study on Unix / Linux operating
system.
Unit-1
No
of
hours: 10
Introduction: Review of system software e.g. assembler, macro processor,
Compilers, interpreters, loader and linkers. Evolution of operating systems,
Operating System Concepts. Introduction to Network and Distributed Operating
Systems. Real Time Operating Systems and Embedded Systems.
Unit-2
No
of
hours: 5
Processor scheduling criterion, Processor Management :algorithms for batch
processing and time sharing operating system: FCFS, SJF, Round Robin,
Multiple level queues, Multilevel feed back queue and hybrid algorithms .
Unit-3
No
of
hours: 9
Memory management Concepts: Single user memory management. Partition
memory allocation. Virtual memory management using paging and
segmentation techniques.
Unit-4
No
of
hours: 10
Concurrent processes: Mutual exclusion,
Synchronization. techniques of inter process communication, message driven
operating systems. Deadlock handling techniques.
Unit-5
No of
hours: 7
File management: Operations on a file, structure of file system, free block list,
keeping track of blocks allocated to a file, directory structure, sharing and
protection of files, file system reliability, Unix file system.
UnitNo of
hours: 6
Device management : Goal of input output software design, hardware and
software, Layers of I/O software, Structure of device drivers, disk driver, disk
arm scheduling algorithms, terminal driver, functions of clock driver, other
device drivers like printer, mouse, scanner etc.
Unit-7
No of
hours: 5
Case study : Unix and Linux operating system : file management , process
management and inter process communication. Basic and advanced Unix
commands. Unix shell programming.
.
Text/Reference Book:
1. Bech, M: Design of the UNIX operating system.
2. Silberdchatz, and Galvin : Operating System Concepts, AddisionWesley, Publ. Comp. 1985.
3. Tanenbaumb A.S., Operating system Concepts.******
3. Deitel, H.M.: An Introduction to Operating System, Addision-Wesley,
Publ. Comp. 1984.
4. Milenkovic, M.: Operating System – Concept and Design, Mc-graw-Hill
International Editions, 1987