MBA CM 1st Semester - Devi Ahilya Vishwavidyalaya
Transcript of MBA CM 1st Semester - Devi Ahilya Vishwavidyalaya
School of Computer Science & IT,
Devi Ahilya Vishwa Vidyalaya, Indore
www.scs.dauniv.ac.in
Mission of SCS&IT, DAVV
To produce world‐class professionals who have excel lent analyt ical ski l ls , communication ski l ls , team bui lding spir it and abi l i ty to work in cross cultural environment. To produce international qual ity IT professionals, who can independently design, develop and implement computer appl ications. Professionals who dedicate themselves to mankind, who are environment conscious, fol low social norms and ethics.
SYLLABUS
M.B. A. (COMPUTER MANAGEMENT)
1st SEMESTER
Session 2020 ‐ 2021
MBA (CM) 1st SEM S
ession 2020 ‐ 2021
1 of 2
Course Name MBA (CM) 1st Semester
Subject Code: CS‐4121
Subject Name: Mathematical Foundation of Computer Science
Aim of the Subject
• To make students learn the fundamentals of mathematics and to develop the
knowledge, ski l ls and att itudes necessary in mathematics
Objectives
1.To develop abstract, logical and cr it ical thinking and the abi l i ty to ref lect
logical ly whi le performing calculat ion in mathematics.
2.To form the base from which to explore concepts and develop problem‐
solving ski l ls .
3.• To make students know and demonstrate understanding of the
concepts from the branches of mathematics (number, a lgebra, geometry and
tr igonometry, probabil i ty, and discrete mathematics)
Learning Outcomes
Descript ion of knowledge to be acquired:
A student completing course unit 1 should:
1. understand Sets and Membership .
2 . perform operations on sets.
3. understand fundamental law of set operations.
4 . perform Cartesian products on sets.
5. perform operations on functions.
A student completing course unit 2 should:
1. Algebra of Proposit ions
2. understand tautologies and contradict ions
3. understand Truth Tables and Logical ly equivalent statements.
A student completing course unit 3 should:
1. understand Co‐ordinate geometry of a point.
2. understand Co‐ordinate geometry of straight l ine.
3. understand Co‐ordinate geometry for tr iangle.
4. understand locus and its equation
A student completing course unit 4 should:
1. understand function .
2. understand differential and integral calculus.
3. understand basic laws of derivat ives.
A student completing course unit 5 should:
1. understand progression .
2. annuity progression
3. present value of an annuity
4. depreciat ion by double decl ining balance method
MBA (CM) 1st SEM S
ession 2020 ‐ 2021
2 of 2
Unit 1
Set Theory: Sets and Membership ,subset and set equal ity, set operations,
fundamental law of set operations . set construct ion. Cartesian products, Relat ions,
Functions and Binary operations, operations on functions.
Unit 2
Algebra of Proposit ions: Statements, Conjunctions, Dis junctions, Negation,
Condit ional , Bi ‐ condit ional , Polynomials and Boolean polynomials . Proposit ions
and Truth Tables, tautologies and contradict ions, Logical equivalence, a lgebra of
Proposit ions, Logical implicat ion, Logical ly True and Logical ly equivalent
statements.
Unit 3
Co‐ordinate geometry of two dimensions, Co‐ordinate of a point, Distance between
two points, Point div iding the join of two points. Area of tr iangle, Locus and its
equations. Transformation of co‐ordinates.
Unit 4
Functions, l imits and continuity‐ Functions, Construct ions of Functions. L inear and
quadratic Functions Sequences, Appl icat ion to Management problems. Differential
and integral calculus – derat ive, basic Laws of derivat ives. Higher order derivat ives.
Maximum and Minima of functions of one variable. Integration by parts and s imple
method of integrat ion of s imple algebraic and transcendental funct ions.
Unit 5
Definite integral applicat ion to management problems including EOO model for
Inventory control . progressions and annuity – Progressions. A.P. and G.P.
Depreciat ion by double decl ining balance method. Present Value, Annuity, Present
value of an annuity, Depreciation by s inking fund method. Present value under
continues compounding.
Text Book(s)
J . K. Sharma, Mathematics for Business and Economics, Asian Books Pvt. Ltd. , New
Delhi
Reference Material(s)
MBA (CM) 1st SEM S
ession 2020 ‐ 2021
1 of 2
Course Name MBA (CM) 1st Semester
Subject Code: CS‐4022
Subject Name: Computer Organization and Assembly Language Programming
Aim of the Subject
This course covers the basics of computer organisation with emphasis on the lower
level abstract ion of a computer system including digital logic, instruction set and
assembly language programming. Topics includes data representation, logic gates,
s impl if i
Objectives
To understand the structure, function and characterist ics of computer
systems.
To understand the design of the various functional units and components
of computers.
To identify the elements of modern instruct ions sets and their impact on
processor design.
To explain the function of each element of a memory hierarchy,
To identify and compare different methods for computer I/O.
Learning Outcomes
On completion of the course, student wi l l be able to :
Demonstrate computer architecture concepts related to design of modern
processors,
memories and I/Os.
Analyze the performance of commercial ly avai lable computers.
To develop logic for assembly language programming
Unit 1
Computer Organization: Digital and Analog computers, Major components of a
digital computer, Memory addressing capabi l i ty of a CPU, Word length of a
computer, Processing speed of a CPU, Definit ions of Hardware, Software and
Firmware. Def init ions of Dumb, Smart and Intel l igent terminals.
Binary Systems: Digital Systems, Binary Numbers, Number Base Conversions, Octal
and Hexadecimal Numbers, Complements, S igned Binary Numbers, Binary Codes:
BCD code, Gray Code, ASCII code, Excess 3 Code, Error detect ing Code.
Unit 2
Computer Arithmetic: Binary representation of Negative Integers us ing 2’s
complement and Signed magnitude representation, F ixed point Ari thmetic
operations on Posit ive and Signed (Negative) Integers l ike addit ion, subtract ion,
mult ipl ication, Booth algorithm for mult ipl icat ion, . Divis ion of posit ive and negative
binary numbers.
MBA (CM) 1st SEM S
ession 2020 ‐ 2021
2 of 2
Unit 3
Introduction of 8085 Microprocessor: Architecture of 8085 processor. Register
Architecture: Accumulator, Temporal ly Register and Flag Register. Program
Counter, Stack pointer and Instruct ion register. Addressing Modes: Direct
addressing mode and Register direct Addressing Mode. Register Indirect Addressing
Mode, Immediate Addressing Mode and Impl ic it or Impl ied Address ing Mode.
Unit 4
Introduction to Assembly Language Programming: Various Instructions
Class i f icat ions: Instruction Format, Opcode, Operand and Hex code. Instruct ion
Operation Status, Various Instruction Sets: Data Transfer Group Instructions,
Ar ithmetic Group Instruct ions, Logical Group Instruct ion, Branch Group
Instruct ions: Conditional and Uncondit ional and Machine control Instruct ions.
Unit 5
Assembly language programming: Pract ice on assembly language programming,
pinout diagram of 8085 microprocessor, interfacing of 8085, interrupts, Direct
memory access, introduction to 8086 microprocessor.
Text Book(s)
1. Ramesh S. Gaonkar, Microprocessor Architecture, Programming and Appl icat ions
with 8085/8080. Wiley Eastern Ltd. publ icat ion
2. B Ram, Computer Fundamentals: Architecture and Organizat ion, New Age
International, 2000
3. V. Rajaraman V and N. Adabala, Fundamentals of Computers, Prentice Hal l India
Learning Private L imited; 6th Revised edit ion edit ion
Reference Material(s)
1. R Theagarajan S Dhanasekaran and S Dhanapal , Microprocessor and Its
appl ications, New Age International (P) Ltd.
2. Nicholas Carter and Raj Kamal, Computer Architecture and Organizat ion,
Schaum's Outl ines Series
3. Dr. Raj kamal, Digita l Systems: Pr inciples and Design, Pearson Education
MBA (CM) 1st SEM S
ession 2020 ‐ 2021
1 of 2
Course Name MBA (CM) 1st Semester
Subject Code: CS‐5511
Subject Name: Operating Systems
Aim of the Subject
The course aims to explore the importance of the operating system and its function.
The different techniques used by the operating system to achieve its goals as
resource manager.
Objectives
1. To learn and understand the Concepts of operating system
2. To Learn and understand operating system services
3. The core structure, functions and design principles of operating system
4. Interposes communications and basic concepts of v irtual izat ion
Learning Outcomes
Students wi l l be having understanding of fol lowing concepts of Operating
System:
1. Process Management
2. Memory Management
3. F i le & I/O Management
Unit 1
Introduction: Evolution of operating systems, operat ing system concepts; act iv it ies,
funct ions and services of operat ing system; Computer Systems: Mainframe,
Desktop, Mult iprocessors, Distr ibuted, Clustered, Real t ime and Hand held systems.
Computer System Operations, Storage hierarchy, Hardware protection, System cal ls ,
System structures. Process Management: Process concepts, Process schedul ing,
Operation on processes.
Unit 2
Cooperating processes, Inter‐process communication. Threads: mult ithreading
models , threading issues, thread examples. CPU Schedul ing: concepts, schedul ing
cr iter ia, schedul ing algorithms, algorithm evaluation. Process synchronizat ion:
Cr it ical sect ion problem, Mutual exclusion and synchronizat ion Techniques of inter
process: Synchronizat ion hardware, semaphore, c lass ical problems of
synchronizat ion, cr it ical regions and monitors. Deadlock: deadlock characterizat ion,
deadlock handl ing methods.
Unit 3
Memory Management: Concepts, s ingle user memory management. Part it ion
memory al location: paging, segmentation and segmentation with paging, Virtual
memory management: concept, demand paging, process creation, page
replacement, a l location of frames and thrashing.
MBA (CM) 1st SEM S
ession 2020 ‐ 2021
2 of 2
Unit 4
Fi le Management: F i le concepts, access methods, directory structure, f i le system
mounting, sharing and protect ion of f i les. F i le system structure and
implementation, a l location methods, free space management, rel iabi l i ty of f i le
system. Distr ibuted f i le system and structures.
Unit 5
Device Management: Goals of input/output software design, Structure of device
hardware and software. Layers of I/O software, structure of device dr ivers, Disk
dr iver, disk arm schedul ing algorithms, terminal dr iver, c lock dr iver, Case study of
Windows 2000.
Text Book(s)
A. Si lberschatz, P. Galvin and G. Gagne, Operating System Concepts, Addison
Wesley, 8th Edit ion, 2008.
Reference Material(s)
Will iam Stal l ings, Operating Systems: Internals and Design Pr inciples 4th Edit ion,
Pearson Education, 2003.
MBA (CM) 1st SEM S
ession 2020 ‐ 2021
1 of 2
Course Name MBA (CM) 1st Semester
Subject Code: CS‐4205
Subject Name: Programming and Problem‐SolvingUsing
Aim of the Subject
To learn the concept of programming and enable students to develop the logical
ski l l to solve complex problems and handle projects
Objectives
1.To develop programs to solve basic problems by implementing
programming concepts l ike operators, control statements etc.
2.To select the r ight data representation formats based on the requirements
of the problem.
3.To develop modular, reusable and readable C Programs using the concepts
l ike functions, arrays etc.
4.To write programs using the Dynamic Memory Al location concept.
5.To create, read from and write to text and binary f i les.
Learning Outcomes
The students are expected to be able to:
1.Formulate the algorithms for s imple problems.
2.Correct syntax errors as reported by the compilers.
3. Identify and correct logical errors encountered during execution.
4.Represent and manipulate data with arrays, str ings and structures.
use pointers of different types.
5. Create, read and write to and from s imple text and binary f i les.
6.Modularize the code with functions so that they can be reused.
Unit 1
Introduction to Computer based Problem Solving; Algorithms and f lowcharts;
Programming Languages; Classi f icat ion of Programming Languages; Characterist ics
of a program; Rules/conventions of coding, documentation, naming convention;
Structured Programming; Modular Programming; Programming
Environment: Assembler, Interpreter, Compiler, L inker and Loader.
Unit 2
Fundamentals of C programming; History of C; Structure of C Program; Character
set, Identif iers and Keywords; Data types; Constants and Variables; Operators and
Expressions, Type Conversion, Operator Precedence and Associat iv ity; Basic
Input/Output operations; Decis ion control structures : i f ‐else, switch‐case ; Loop
control structure : whi le, do‐whi le, for; Jump statement : break ,continue ; goto
statement.
MBA (CM) 1st SEM S
ession 2020 ‐ 2021
2 of 2
Unit 3
Array: One dimensional array ‐Declarat ion, init ia l izat ion of one dimensional arrays;
Two dimensional array ‐Declaration, init ia l izat ion of two dimensional arrays; mult i ‐
dimensional array. Str ings: Declar ing and init ia l iz ing str ing, reading and writ ing
str ings, str ing manipulat ion functions, array of str ings. Funct ion: Need of user‐
defined function, Arguments, return value, return statement; passing parameters
– cal l by value, cal l by reference; Scope, v is ibi l i ty and l i fet ime of var iables; Nest ing
of functions; pass ing arrays to funct ion; passing str ings to function. Recursion:
basics , comparison with i teration, types of recurs ion. Storage Classes.
Unit 4
Pointer: Declar ing and init ia l iz ing pointer variables, chain of pointers, Pointer
expression, Pointer ar ithmetic, Array of pointer and its l imitat ions; Pointers as
Function arguments; Function returning pointer, Dynamic Memory management
functions. Structure: Defining a Structure, Declar ing & init ia l iz ing Structure
Variables, Membership Operator, Array in structure, Array of Structure, Structure
within structure, Pointer to structure. Union: Defining union, Declar ing &
init ia l iz ing union Variables; Bit F ields; Enumerated data type; typedef; Bitwise
operators.
Unit 5
Command l ine arguments; Fi le handl ing: Defining, opening and closing a f i le,
input/output operations on f i le, merging f i les; C preprocessors : Macro subst itut ion,
f i le inclusion, compiler control direct ive.
Text Book(s)
1. Herbert Schi ldt , “C The Complete Reference”, Osborne/McGraw‐Hi l l , 4 th Edit ion,
2000.
2. Behrouz A. Forouzan and Richard F. Gi lberg, “Computer Science: A Structured
Programming Approach Using C”, Cengage Learning, 3rd Edit ion, 2007.
Reference Material(s)
1. B.W. Kernighan, D.M. Ritchie, “The C Programming Language”, Prentice Hal l of
India, 2nd Edit ion, 1988.
2. E Balagurusami, “Programming in ANSI C”, Tata McGraw‐Hi l l , 6th Edit ion, 2012.
3. Byron S Gottfr ied, “Programming with C”, Tata McGraw‐Hi l l , 3rd Edit ion, 2010.
4. Yashavant Kanetkar, “Let us C”, BPB Publ icat ions, 13th Edit ion, 2013.
5. Yashwant Kanetkar, “Test your C ski l ls” , BPB Publ ication, 5th Edit ion, 2005.
MBA (CM) 1st SEM S
ession 2020 ‐ 2021
1 of 1
Course Name MBA (CM) 1st Semester
Subject Code: IC‐4916
Subject Name: Communication Skil ls and Report Writing
Aim of the Subject
To improve the confidence, communication ski l ls and presentation capabi l i t ies of
students that wi l l help them in p lacements and corporate l i fe.
Objectives
To develop effect ive communication ski l ls in students which wi l l help them
in facing interviews and group discussions
Learning Outcomes
1. Improved ski l ls in personal interviews and group discussions
2. Development of power of expression
Unit 1
Basics of Communication
Unit 2
Development of Group Discussion Ski l ls
Unit 3
Development of Presentation Ski l ls and facing interviews
Unit 4
Basics of Written Communication
Unit 5
Intense pract ice of Presentations, Group Discussions and Interviews
Text Book(s)
1. Communication – K. K. S inha
2. Organizational Behavior ‐ Fred Luthans
3. Organizat ional Behavior ‐ Stephen Robbins
Reference Material(s)
1. Communications Ski l ls – M.V. Rodrigues
2. T imes of India/ Hindustan Times/ The Hindu etc.
Computer Organization and Assembly Language Programming
1. 8085 architecture 2. Instruction Set: Characteristics - Operand Types - Operation Types 3. Addressing Modes - instruction Formats 4. Addressing Modes (Simple Examples) 5. Assembly language programming 6. Computer Arithmetic: ALU -. Integer Representation and Arithmetic 7. Floating Point Representation and Arithmetic 8. CPU: Organization of Processors and Registers 9. Instruction Cycle - Instruction Pipelining 10. Register Optimisation - Architecture Pipelining. Instruction Set
Architecture(ISA) 11. RISC and CISC, Compare RISC versus CISC 12. Characteristics of RISC, Large Register File 13. Characteristics of CISC, Instruction set complexity 14. Control Unit: Micro-Operations - Control of Processors 15. Explain how programs written in high-level languages are executed by a
computer system. 16. Explain what hardware factors impact program performance and how to
write programs for performance 17. Explain data representation, instruction sets, and addressing modes. 18. Write assembly language programs employing flow control constructs
and procedures. 19. Explain techniques used by computer hardware designers to improve
performance. 20. Explain how a data path can be implemented as a single-cycle or
pipelined design. 21. Explain how the memory hierarchy impacts performance. 22. Explain the reasons for the ongoing transition to multiprocessor
architectures.
CS-4121 Mathematical Foundation of Computer Science
MBA(CM)
Assignment: 01
Note :
Study the uploaded PDF and PPT that we had discussed earlier in class ,based on this study and
prepare handwritten assignment in a copy.
Q1. Describe set theory and its types and also write basic operations on sets.
Q2. Proof commutative law, associative law, idempotent law by using union operation and
intersection operation.
Q3. Proof Demorgan’s law with an example.
CS-5511
Operating Systems
Lab Assignments
1. Implementation of FCFS (First Come First Serve) CPU Scheduling. 2. Implementation of SJF (Shortest Job First) CPU Scheduling. 3. Implementation of Round Robin (RR) CPU Scheduling. 4. Implementation of Priority CPU Scheduling Algorithm. 5. Implementation of FIFO Replacement Algorithm. 6. Implementation of Optimal Page Replacement Algorithm. 7. Implementation of LRU Page Replacement Algorithm by Stack method. 8. Implement the producer-consumer problem using threads.