MISSION OF SCS Kit/MBA_CM_I.pdf · 2019-06-28 · 1. Study of Digital Logic gates with Identification numbers and Pin assignments. 2. Study of BCD Counter 3. Study of Decimal Decoder

STUDENT KIT

MBA (CM) – First Semester

July-December, 2009

Devi Ahilya VishwavidyalayaSchool of Computer Science & IT

“We make things happen . . .”

Producing world – class

IT Professionals

Since 1986

www.scs.dauniv.ac.in

MISSION OF SCS• To produce world-class professionals who have

excellent analytical skills, communication skills, team building spirit and ability to work in cross cultural environment.

• To produce international quality IT professionals, who can independently design, develop and implement computer applications.

• Professionals who dedicate themselves to mankind.

SCHOOL OF COMPUTER SCIENCE & ITDEVI AHILYA VISWAVIDYALAYA

Takshashila Campus, Khandwa Road, Indore – 452017Tel. (0731) – 2470027, 2461548 Fax : (0731) – 2763618

Email: [email protected]

mailto:[email protected]

http://www.scs.dauniv.ac.in/

Course Specification

Institution D.A. University, Indore

College/Department School of Computer Science & Information Technology

Code Subject L T P C Internal Practical/Project

End Sem

Total

CS-4007 Computer and Communication Fundamentals

3 1 2 5 30 20 50 100

CS-4205 Programming and Problem Solving Using C

3 1 4 6 30 20 50 100

CS-5511 Operating Systems 3 1 2 5 30 20 50 100CS-4121 Mathematical

Foundation of Computer Science

3 1 0 4 40 - 60 100

IC-2911 Communication Skills 2 1 0 3 40 - 60 100Lab Viva 2Comprehensive Viva 4

29

CS- 4007 Computer and Communication Fundamentals1. Course title and code: Computer and Communication Fundamentals (CS- 4007)

2. Credit hours: 56 3. Program(s) in which the course is offered. (If general elective available in many programs indicate this rather than list programs)

MCA, M.Sc. – CS, M.Sc. – IT, MBA-CM – Ist Semester 4. Name of faculty member responsible for the course: Ms. Shweta Agrawal, Ms. Ranu Runwal

5. Level/year at which this course is offered: First Year First Semester

6 .Pre-requisites for this course (if any): General Overview of electronic circuits like diodes, transistors and introduction to number system.

7. Co-requisites for this course (if any): Nil

8. Date of approval of the course specification within the institution Course is approved by BoS and has been discussed within the department 9. Location if not on main campus Main Campus

Aim and Objectives

1. Aim of the Course: The main aim of this course is to explain to a beginner how a computer works. To strengthen the basics of computer and communications to the students. To provide various methods and techniques suitable for a variety of digital system design approach. To act as prerequisite for forthcoming subjects like Computer Architecture and Computer Network.Objectives:

To understand:i) The major units of computer, their interconnection and their characteristics.ii) Various binary number systems suitable for representing information in

digital computers.iii) The basic postulates and theorem of Boolean algebra.iv) The Computer Arithmetic that is the basic of ALU design.v) The K-map and tabulation method for simplification of Boolean equations.vi) Design and analysis procedure for combinational circuits.vii) Design and analysis procedure for clocked sequential circuits.viii) The analog and digital communication.ix) Various transmission media.x) The networking basics and topologies.

2. Briefly describe any course development objectives that are being implemented. The course objectives being implemented include understanding of Digital Logic and Circuit design fundamentals, knowledge of computer arithmetic, Basics of designing of ALU, CPU and knowledge of network fundamentals.

Course Description

Week TOPIC READING

Week 1 Computer Organization: Digital and Analog computers, Major components of a digital computer, Memory addressing capability of a CPU, Word length of a computer, Processing speed of a CPU, Definitions of Hardware, Software and Firmware. Definitions of Dumb, Smart and Intelligent terminals.

Ch. 1Computer Fundamentals By B.RAM

Week 2 Binary Systems: Digital Systems, Binary Numbers, Number Base Conversions, Octal and Hexadecimal Numbers, Complements, Signed Binary Numbers, Binary Codes: BCD code, Gray Code, ASCII code, Excess 3 Code, Error detecting Code.

Assignment: Ex.1.1 to 1.34 (Page no.31-32)

Ch.1 Digital Design by Morris Mano.

Week 3 Computer Arithmetic: Binary representation of Negative Integers using 2’s complement and Signed magnitude representation, Fixed point Arithmetic operations on Positive and Signed (Negative) Integers like addition, subtraction, multiplication, Booth algorithm for multiplication, and bit pair (fast) multiplication. Division of positive and negative binary numbers

Assignment: Ex. 3.1 to 3.27 (Page no. 3.41 to 3.51)

Ch.3 Computer Architecture By Dr. RajKamal

Week 4 Boolean Algebra and Logic Gates: Basic Definitions, Basic Theorems and properties of Boolean Algebra, Boolean Functions, Canonical and standard forms, Other Logic operations, Digital Logic gates, Integrated Circuits.


Ch.2 Digital Design by Morris Mano.

Week 5 Gate-Level Minimization: The K-Map Method, 3 and 4 variable K-Map, Product of sums simplification, Sum of Products simplification, Don’t care conditions, NAND and NOR implementations, Exclusive-OR function.


Ch.3 Digital Design by Morris Mano

Week 6Combinational Logic: Combinational Circuits, Analysis Procedure, Design Procedure, Binary half adder, binary full adder, binary full subtractor, binary parallel adder, carry propagation delay and Propagation delay calculation of various digital circuits. Fast adder


Week 7

Decimal Adder, Binary multiplier, magnitude comparator, Parity generator, seven segment display, BCD to excess three code converter, Decoders, Encoders, Multiplexes, and Demultiplexers



Week 8

Synchronous Sequential logic: Sequential circuits, Latches, Flip Flops: SR, D, JK, T. Master Slave JK Flip flop. Characteristic equations and Excitation tables of flip-flops.



Week 9

Analysis of clocked sequential circuits: State diagrams, State equations for D, JK and T Flip flops. State reduction methods using all Flip Flops. Mealy and Moore Models.



Week 10

Shift Registers- Serial in Serial out, Serial in Parallel out, Parallel in Serial out and Parallel in Parallel out. Designing of Asynchronous (Ripple) Counters, Design of Synchronous Counters.



Week 11

Signal characteristics: frequency, phase and amplitude, Types of communication with and among computers, Characteristics of communication channels, allocation of channel, signal power, amplitude and frequency modulation, space division multiplexing, frequency division multiplexing, Time division multiplexing.


Ch. 13Fundamentals of computers byV. Rajaraman

Week 12

Physical communication media: bounded media and unbounded media, Infrared technology, public switched telephone networks, digital modulation: ASK, PSK and FSK, half duplex and full duplex transmission, asynchronous and synchronous transmission

Assignment: Ex. to 13.27 to 13.45 (Page no.308-309)


Week 13

Need for computer communication networks, internet and world wide web: E-mail, File transfer, Remote login. Networking topologies. LAN, MAN, WAN, Ethernet LAN.

Assignment: Ex.14.1 to 14.15 (Page no.335)


Week14

Layer 2 and layer 3 switches, Wireless LAN. Switch hub and router. Wireless LAN, interconnecting networks, IP address and IP data grams, internet and intranet; inter security, virtual private networks, future of internet technology.



Subject Learning Outcomes

Development of Learning Outcomes in Domains of Learning:

(i) Student will be able to understand the basic units of CPU and their organization.(ii) They will be able to understand how the number system other than decimal are

exist and what are their applications(iii) They will know the various coding techniques. By which we can change our

information into different form.(iv) They will learn the Boolean algebra that is the requirements base for digital circuit

design.(v) They will learn how to minimize the Boolean equations, so that their

implementation becomes easy. (vi) Student will be able to design any combinational circuit.(vii) Students will be able to design combinational circuit by using MSI and LSI(viii) They will learn how flip-flop and other sequential circuits work(ix) Students will be able to design asynchronous sequential circuits.(x) They will be able to explain about signal characteristics and various modulation

techniques.

(xi) They will be aware about various transmission media.(xii) They will be familiar with the various multiplexing techniques.(xiii) Student will be aware about various network devices and topologies.

Scheduling of Assessment Tasks for Students

Assessment

Assessment task (eg. essay, test, group project, examination etc.)

Week due Proportion of Final Assessment

1. Laboratory 20% 2. Test 1,2 4th, 8th 15% 3. Quizzes 10% 4. Assignments, Attendance 5% 5. Final Examination 15th week 50%

Learning Resources

1. Required Text(s) : Text Books :

1. Digital Design by M. Morris Mano. Publication: PHI Eastern economy edition (Year-2001)

2. Computer Architecture By Dr. Rajkamal. Publication: TMH Indian Special edition 2006.

3. Fundamentals of Computers by V. Rajaraman.Publication : PHI , Fourth edition

2. Essential References: Reference books :

1 Data communications and networking By A. Forouzan Publication: TMH Third edition (Year- 2004)

2 Computer Fundamentals – Architecture and Organization By B. Ram. 3 Computer networks by Andrew Tanenbaum Publication: PHI Fourth edition (Year- 2003)4. Principles of digital communication system & computer networks By K.V.K.K

Prasad 5. Computer organization and architecture by William Stallings.

Publication : PHI Fifth edition ( Year – 1999) 6. Digital systems principal and Design by Dr. Rajkamal Publication : PHI First impression (Year – 2006)

3. Recommended Books and Reference Material (Journals, Reports, etc) (Attach List) Digital communication systems and computer networks by K.V.K.K. Prasad.

Laboratory Experiments:

S. No. Name of the Experiment 1. Study of Digital Logic gates with Identification numbers and Pin assignments. 2. Study of BCD Counter 3. Study of Decimal Decoder and Encoder. 4 Study of Multiplexer and Demultiplexer. 5 Study of Half Adder/ Substractor and Full Adder/ Substractor 6 Study of clocked RS flip flop 7 Study of JK flips flop 8 Study of Shift Register 9 Study of Parity Generator

Note: Students are to be notified that they will have to prepare Two files, one for the class assignments and other for the Lab assignments. Assignments will be given as per the class schedule and will have to be submitted and verified, before the due date as has been assigned by the respective teacher. Students are needed to bring both the files compulsorily

at the time of their Comprehensive Viva Examination.

Class Assignments:

Assignment I (Week 1):1) Write the various units of CPU. Describe the working of each unit.2) Write the definition of hardware, software and firmware.3) What you mean by word length of a computer.4) If address bus for a CPU is 20 bits wide, then calculate the size of memory

that can be attached to it.5) If data bus for a CPU is 16 bit then what will be its word length.6) What are the major factors that decide the processing speed of a CPU?7) Write the first 20 decimal digits in base 4.8) Write the first 20 decimal digits in base 3.9) Add and multiply the following numbers in the given base without converting

to decimal.(i) (1230) 4 and (33)4

(ii) (130) 5 and (34)5

(iii) (230) 6 and (54)6

(iv) (130.4) 5 and (34.4)5

10) Write the first 100 decimal digits into binary.11) Convert the following numbers into binary.

(i) 123.56 (ii) 456.75(iii) 345.9 (iv) 890.9(v) 567.9 (vi) 668.7

12) Converts the following numbers into decimal.(i) 10101010 (ii) 101010110011(iii) 10110101.1111 (iv) 101010111.1101(v) 1011011010.101 (vi 111001100.1100

13) Perform the following conversion , without converting into decimal :(i) (3674)8 to ( )16 to ( ) 2

(ii) (1001010101010)2 to ( ) 16 to ( ) 8

(iii) (AC4)16 to ( )2 to ( ) 8(iv) (AAFF)16 to ( ) 8 to ( )2

Assignment II (Week 2, 3):1) Represent the following numbers into sign magnitude representation.

(i) -11(ii) 15(iii) –15(iv) 7(v) –7(vi) 13(vii) 31(viii) –32

2) Represent the following numbers into sign two's complement representation.(i) -11(ii) 15(iii) –15(iv) 7(v) –7(vi) 13(vii) 31(viii) –32

3) Perform the M-N and N-M using two's complement method.(i) M= 101100101 and N = 111000110(ii) M=110011001 and N = 1010101010(iii) M= 110010101 and N= 0000101(iv) M =101 and N = 110110(v) M= 45 and N =90

4) Perform the multiplication of following numbers using two's complement method(i) 16 *-6(ii) 23*-9(iii) –12 *25(iv) –12*-21(v) –4 * -6

5) Perform the multiplication of following numbers using booth algorithm.

(i) 12*5 (ii) 30*-5(iii) -13*25 (iv) -25*12

Assignment III (Week 4):

1) Simplify the following Boolean functions to minimum number of literals(i) AB+AB’+C’+ABC(ii) ABC+ABC’+AB(iii) AC+BC+ABC+BC’(iv) ABC’+BC+AB(v) ABC+ABCD+CD’+ABCD(vi) AD + ABCD' +A'B'C'D' + ABC' + A'B'CD + ABC(vii) A'CD + A'C'D' + A'B'C'D +ABC' +ABCD +A'B'C'D'

2) Simplify the problems of question no. 7 using karnaugh map.

3) Simplify the following functions using karnaugh map. (i) F=∑ (1,4, 7, 8)(ii) F=∑ (3,4, 7)(iii) F=∑ (0,1,2,4, 7, 8,10,15,)(iv) F=∑ (1,4, 7, 8,10) and D=∑ (2,11,12)(v) F=∑ (1,2,3,4,7,8,10,11,12) and D=∑ (6,9)(vi) F=∑ (0,1,2,3,6,7,8,15) and D=∑ (13,14)(vii) F=∑ (1,2,3,4,7,8,9,11,12,15)(viii) F=∑ (1,4, 7, 8)

Assignment IV (Week 5): 1) Implement the following function using AND and OR gate.

(i) F=∑ (1,4, 7, 8)(ii) F=∑ (3,4, 7)(iii) F=∑ (0,1,2,4, 7, 8,10,15,)(iv) F=∑ (1,4, 7, 8,10) and D=∑ (2,11,12)(v) F=∑ (1,2,3,4,7,8,10,11,12) and D=∑ (6,9)(vi) F=∑ (0,1,2,3,6,7,8,15) and D=∑ (13,14)(vii) F=∑ (1,2,3,4,7,8,9,11,12,15)(viii) F=∑ (1,4, 7, 8)

2) Implement the following function using only NOR gate.(i) AB+AB’+C’+ABC(ii) ABC+ABC’+AB(iii) AC+BC+ABC+BC’(iv) ABC’+BC+AB(v) ABC+ABCD+CD’+ABCD(vi) AD + ABCD' +A'B'C'D' + ABC' + A'B'CD + ABC(vii) A'CD + A'C'D' + A'B'C'D +ABC' +ABCD

3) Implement the following function using only NOR gate.

(i) AB+AB’+C’+ABC(ii) ABC+ABC’+AB(iii) AC+BC+ABC+BC’(iv) ABC’+BC+AB(v) ABC+ABCD+CD’+ABCD(vi) AD + ABCD' +A'B'C'D' + ABC' + A'B'CD + ABC

Assignment V (Week 6, 7):1) Design a combinational circuit that accepts a three-bit number and generates

an output binary number equal to the square of the input number.2) Design a combinational circuit that accept BCD values and generate cube of That number.3) Design a combinational circuit that generates 540321 weighted code for a

BCD input.

4) Design a combinational circuit with four input lines that represent a decimal digit in BCD and four output lines that generate the 9’s complement of the input number.

5) Implement a full subtractor with two half subtractor and one additional gate.6) Design a combinational circuit that converts a BCD code to 8,4,-2,-1 code.7) Design a excess 3 to BCD code converter using a four bit full adder MSI

circuit.8) Design a adder subtractor circuit using IC of full adder and some additional Gates.9) Design a combinational circuit that accepts BCD input and multiply it by 3 10) Design a 4-bit circuit that generates booth multiplier for given multiplier.

Assignment VI (Week 8, 9):1) A combinational circuit is defined by the following two functions.

F1 = x’y’+xyz’ F2 = x’+y

F3 = xy+x’y’Design the circuit with a decoder and external gates.

2) Design an even parity generator.3) Design 3 to 8 decoder by using two 2 to 4 decoder.4) Design 4 to 16 decoder by using two 3 to 8 decoder.5) Design 5 to 32 decoder by using four 3 to 8 decoder.6) Implement the following function by using decoder and some external gates.

a. F(A,B,C) = ∑ ( 1,4,5,7)b. F(A,B,C,D) = ∑ ( 1,4,5,7,9,10)c. F(A,B,C) = ∑ ( 1,4,5,6)d. F(A,B,C, D) = ∑ ( 1,4,5,7,13,15)e. F(A,B,C,D,E) = ∑ ( 1,4,5,7,8,9,12,14,16,17,27,30)

Assignment VII (Week 10):1) Derive the excitation table of all flip-flops with their truth table.2) Design a asynchronous UP counter.3) Design a synchronous down counter.

Assignment VIII (Week 11, 12, 13, 14):1) Explain the various physical mediums that are used in networking.2) Write the definition of all network devices.3) Write the characteristic of category 5 and category 6 coaxial cable.4) What you mean by signal. Write the various characteristics of a signal?6) What you mean by modulation? Write the types of modulation and explain them in brief.7) Write the comparison between unbounded and bounded media.8) Explain the ASK, and PSK with diagram.9) Write the various application of asynchronous and synchronous transmission.10) Explain the various network topologies with diagram.

CS-4205 Programming and Problem Solving Using C

1. Course title and code: Programming and Problem Solving Using C : CS-4205

2. Credit hours: 6

3. Program(s) in which the course is offered.

MCA/ M. Sc (CS)/ M. Sc (IT)/ MBA (CM)-I Semester4. Name Of Faculty Member Responsible For The Course

Mr. K.L. Suryawanshi, Ms. Ranu Runwal

5. Level/year at which this course is offered: First Semester

6. Pre-requisites for this course (if any): Fundamentals of Computer

7. Co-requisites for this course (if any): Nil

8. Date of approval of the course specification within the institution

9. Location if not on main campus: Not Applicable

Aim and Objectives

1. . Aim of the CourseMain aim of this course is to understand and solve logical & mathematical problems through C language and Flowchart. Strengthen knowledge of a procedural programming language. Design and develop solutions to intermediate level problems using the C language. Further develop your skills in software development using a procedural language.

2. Briefly describe any course development objectives that are being implemented. (Eg increased use of IT or web based reference material, changes in content as a result of new research in the field)

To enable to know the programming methodologies. To enable students for software development using C programming. The applications and features of C programming for system development will be major issue of teaching. This syllabus covers the basics of programming approaches as well as the rudimentary and advance features of C programming.

Course Description

Week TOPIC READING Text Book 1

Week 1

Overview of the course, its importance and application.Introduction to Computer based Problem Solving, Classification of programming languages, Programming Environment {Assemblers, compilers, interpreters, linkers, and loaders}.

OBJECTIVE: PROVIDING BASIC FUNDAMENTALS OF C LANGUAGE.

1) Introduction to Computer based Problem Solving, Features of good programs – Structured program, modular program, fundamentals of programming.

2) Classification of programming languages: low-level language, middle-level language, high -level language along with examples and differences.

3) Programming Environment: Assemblers, compilers, interpreters, linkers, and loaders.

Chapter 1 and Lecture Notes

Week 2

Programming Concepts with Flowcharting and algorithms, Developing and debugging flowcharts for Programming Problem.OBJECTIVE: TO DEAL WITH GIVEN PROBLEM USING FLOWCHART AND ALGORITHM.

1) Programming Concepts with Flowcharts and algorithms, How to make flowchart: Introduction of the symbols of flowchart and algorithm. Importance of Flowchart and algorithms.

2) Solving and discussing problems with flowchart and algorithm.

3) Class assignment on flowchart.

4) Developing and debugging flowcharts for Programming Problem.

Chapter 1 and Lecture Notes

Week 3

Fundamentals of C Programming: Overview of C: Various Constructs of a C Program, Coding style, Data types, Constants and Variables, Expressions and Operators.

OBJECTIVE: TO AWARE WITH BASIC RULES OF C PROGRAM.

1) Overview of C: C character set, identifiers and keywords.

2) Data types (description of different types of data types along with examples.), Coding style (first program of C). Format Specifiers associated with each data type.3) Constants and Variables: Some examples of constants and variables. 4) Expressions and Operators: Instructions, declaration, arithmetic, unary, relational, logical, assignment and conditional operators.

Chapter 2and Lecture Notes

Week 4

Decision Control Structures in C: Basic Input/ Output operations, Formatting Characters Sequence Control Structures, Decision Control Structures.OBJECTIVE: TO AWARE THE STUDENT WITH FORMAT

SPECIFIERS AND DECISION CONTROL STRUCTURE.

1) Basic Input/ Output functions like scanf() and printf() along with examples.

2) Introduction of Formatting Characters and how to use them along with examples.

3) Sequence Control Structures, Decision Control Structures (if-else and nested if-else) along with examples.

4) Some exercises based on decision control statements.


Week 5

Structures Loop Control in C: Loop Control Structures, Case Control Structures. Exercises on Control structures.OBJECTIVE: TO AWARE THE STUDENT WITH DIFFERENT TYPES OF LOOPS.

1) Loop Control Structures: Introduction of loops like for loop and some examples of “for loop”.2) Examples of do-while loop, while loop, break, continue.

3) Explanation and examples of Case Control Structures.

4) Nesting of loops i.e. loops in a loop along with examples.


Week 6

Arrays Arrays {one dimensional and multidimensional array}.OBJECTIVE: TO AWARE THE STUDENT WITH ARRAY.

1) Introduction of Arrays: Array initialization, bound checking.

2) Programs using 1D Array.

3) Advantages and disadvantages of Arrays.

4)2D and multidimensional array and programs based on it.


Week 7 Pointers and their Applications: Dynamic Memory

allocation and pointer {advantages/pitfalls of pointers in comparison with various user-defined and standard data types}.

OBJECTIVE: TO AWARE THE STUDENT WITH THE POINTERS AND THEIR APPLIATIONS.

1) Introduction of Pointers: Pointers declaration, pointer arithmetic and operation.

2) Some programs based on pointers. Concept of Functions: prototype and parameter passing and some programs based on it.

3) Advantages/pitfalls of pointers.

4) Dynamic Memory allocation: malloc() and calloc() functions.


Week 8

Pointers and their Applications: String Handling, Matrices Operations.

1) Call by reference and Call by value.

2) String Handling: Pointers and strings, standard library string functions, pointer to array of characters vs. string and its limitation.

3) Matrices Operations along with examples.

4) Introduction of Storage classes (register, static, auto and extern) and their differences.


Week 9

Advanced Programming Concepts: Structures and Union, Functions {Standard and User defined Function, Parameter passing, Scope Rules}.OBJECTIVE: TO AWARE THE STUDENT WITH STRUCTURES AND UNION.

1) Introduction of Structures: Structure declaration, program and application.

2) Introduction of Union: Union declaration, program and application.

3) Difference between Structure and Union.

4) Some standard Functions like gets(), goto(), puts(), getchar(), putchar(), getche() etc.


Week 10

Exercises on user defined functions and doubt clearing sessions.OBJECTIVE: TO AWARE THE STUDENT WITH USER DEFINED FUNCTIONS.

1) Introduction of user defined functions along with examples.

2) Functions with arguments, without arguments along with the examples.

3) Communication between functions (how one function calls the other functions).

4) Some exercise based on functions.


Week 11

Remaining from C: Arguments to main, Enumerations and bit fields. Recursion

1) Arguments to main: Introduction of argc and argv.

2) Enumerations and bit fields and program based on it.Introduction of bit wise operators along with examples.

3) Introduction of Recursion and program based on it.

4) Concept of typedef and its programming.

Chapter 7-8-9-10and Lecture Notes

Week 12

Remaining from C: Pre-Processors: {def, include, macro's, ifdef…}, Coercion, typedef, Type Casting, Header files creation.OBJECTIVE: TO AWARE THE STUDENT WITH PRE-PROCESSORS AND HEADER FILES.

1) Concept of Pre-Processors: macro expansion, file inclusionConditional compilation.

2) Macros with argument and macro versus function.

3) Concept of local and global variables.

4) Header file creation.

Chapter 8-9-10 and Lecture Notes

Week 13

File Handling: Introduction to File handling, Advanced pointer, Other Programming Techniques.OBJECTIVE: TO AWARE THE STUDENT WITH FILE HANDLING. 1) Introduction to file handling: Different operations on file

like read, write and append.

2) File Creation and programs based on file creation, reading and merging.

3) Advanced pointer.

4) Other Programming Techniques.

Chapter 8-9-10 and Lecture Notes

Development of Learning Outcomes in Domains of Learning

The course objectives are to:

• Introduce the concept of a program (i.e., a computer following a series of instructions)

• Introduce the concept of an algorithm (that is, a series of steps that can be carried out in a mechanical way) and a few specific examples of algorithms (for example, finding an average, sorting, searching)

• Introduce the concept of a variable holding a value, how a variable is declared and how it can be changed

• Introduce the concept of a loop – that is, a series of statements which is written once but executed repeatedly- and how to use it in a programming language

• Be able to use a conditional statement to select a choice from two or more alternatives

• Be able to break a large problem into smaller parts, writing each part as a module or a function

• Be able to use an array to store multiple pieces of homogeneous data, and use a structure to store multiple pieces of heterogeneous data

• Introduce the concept of Pointers Structures, Union and File handling.

Based upon above objectives the course goals / learning outcomes are defined below:

1) Define key concepts: Definition of Programming language, History of C language, structured program, modular program, fundamentals of programs, low level language, high level language, assembler, linkers and loaders.

2) Introduce Programming Environment: Flow charts, data types, keywords, character set

3) Understanding control Structures: if else statements, For loop, Do while, while, break, continue

4) Understanding Basics of 1d-array, 2d-array, multi-dimensional array5) Understanding concept of pointers, dynamic memory allocation6) Understanding concept of function, library functions and user defined functions 7) Understanding concept of storage classes (static, auto, register, extern)8) Understanding basics of file handling and operation based on it

5. Scheduling of Assessment Tasks for StudentsAssessment

Assessment task (eg. test, group project, examination etc.)


1 Test 1 6th 10%2 Test 2 12th 10%3 Lab & project 14th 20%4 Quiz , Assignments Regular basis 10 %5 Final Exam -- 50%

Learning Resources

1. Required Text(s)1. Herbert Schildt, “C++ The Complete Reference”, Osborne/McGraw-Hill 2. Let us C, Yashwant Kanetkar, BPB Publications.

2. Essential References 1. B.W. Kernighan & D.M. Ritchie, "The C Programming Language", Prentice Hall of India.2. Ashok N. Kamthane, “Programming with ANSI and Turbo C”, Pearson Education.

3- Recommended Books and Reference Material (Journals, Reports, etc) (Attach List)

Pointer in C- Yashwant Kanetkar- BPB Publication

4-.Electronic Materials, http://www.dauniv.ac.in/coursematerial.php , other Web Sites

etc5- Other learning material such as computer-based programs/CD, professional standards/regulations

Assignments:

1. Write a C program to display "Hello Computer" on the screen.2. Write a C program to display Your Name, Address and City in different lines.3. Write a C program to find the area of a circle using the formula: Area = PI * r24. Write a C program to find the area and volume of sphere. Formulas are: Area =

4*PI*R*R Volume = 4/3*PI*R*R*R.5. Write a C program to print the multiply value of two accepted numbers.6. Write a C program to convert centigrade into Fahrenheit. Formula: C= (F-32)/1.8.7. Write a C program to read in a three digit number produce following output (assuming that

the input is 347)3 hundreds4 tens7 units

8. Write a C program to read in two integer values and display one as a percentage of the other. Typically your output should look like

20 is 50.00% of 40 assuming that the input numbers were 20 and 40. Display the percentage correct to 2 decimal places. 9. Write a C program to find out whether the character presses through the keyboard is a

digit or not (using conditional operator).10. Write a C program to swap variable values of i and j.11. Write a C program to find the maximum from given three nos.12. Write a C program to find that the accepted no. is Negative, Positive or Zero.13. Write a program which reads two integer values. If the first is lesser print the message up. If

the second is lesser, print the message down if they are equal, print the message equal if there is an error reading the data, print a message containing the word Error.

14. Write a C program that prints the given three integers in ascending order using if – else.

15. Given as input three integers representing a date as day, month, year, print the number day, month and year for the next day's date. Typical input: “28 2 1992” Typical output: “Date following 28:02:1992 is 29:02:1992”.

16. Write a C program for calculator designing using switch /case loop.17. Write a C program to convert decimal to binary.18. Write a C program to convert decimal to octal.19. Write a C program to convert decimal to hexadecimal.20. Write a C program to find the sum of first 100 natural nos.21. Write a C program to find the sum of first 100 odd nos. and even nos.22. Write a C program to display first 25 Fibonacci nos.23. Write a C program to display first 100 prime nos.24. Write a C program to find factorial of accepted no.25. Write a C program to find the sum of digits of accepted no.26. Write a C program to print the accepted no and its reverse no.27. Write a C program to print all the factors of accepted no.28. Write a C program to find HCF of two given numbers.29. Write a C program to find LCM of two given numbers.

30. Write a C program to find all the prime numbers between two given numbers.31. Write C programs to print the terms of each of the following series:

i. Sin(x) ii. Cos(x) iii. Log (1+x) iv. log(1-x) v. ex vi. e-x 32. Write a C program to print the sum of series.(will be given in class)33. Display the following output on screen (assuming the value for input parameter n=5) :a.****** *********

b. 112123123412345

c. AABABCABCDABCDE

d. 123345456756789

e. 12345678910101112131415

f.************ ***

g. ABCDEABCDABCABA

h. *************************

i. 1123123451234567123456789

j. 1121123211234321123454321

k. * ** *** *********

l. ABCDE ABCD ABC AB A

m. 1 12 123 123412345

n. *****0000***00*

o. 110101101010101

p.101101010110101

q. 122333444455555

r. AABABCABA

s. ABCDEDCBAABCD DCBAABC CBAAB BAA A

t. 1

12112321

1234321123454321

34. Write a C program to find minimum, maximum, sum and average of the given one dimensional array.

35. Write a C program to perform the basic Matrix operations addition, subtraction, multiplication, Transpose.

36. Write a program to take a sentence as input and reverse every word of the sentence.37. Write a C Function for the following task

a. Calculating Factorialb. Nth Fibonacci number c. Swapping of two variablesd. Minimum/maximum value from the given input values.

38. Write User Defined Function and test them in the main program for the following standard function

a. int myatoi(Char *s)b. char *myitoa(int i)c. int mystrlen(char *s)d. char *mysubstr(char *s, int i, int j)e. char *mystrcat(char *s1,char *s2)f. int mystrcmp(char *s1, char *s2)g. int mystrchr(char *s, char c, int i)h. char *mystrrev(char *s)i. int mystrend(char *s, char *t)j. char *myreplace(char *s, char *old, char *new)k. int abs(int i)l. char *mytoupper(char *)m. char *mytolower(char*)n. int isupper(char *s)

o. int islower(char *s)p. int mypower(int a, int b)q. int mymod (int a, int b)

39. Write the following recursive C Function a. Factorial of a given numberb. Nth Fibonacci numberc. Reverse of a given Stringd. Reverse of a give Numbere. Sin(x)

40. Write a c program to create a new data type Date with the help of structure and typedef. Also write following user defined function for date manipulation.

a. To return next Date,b. To return next Month,c. To return next Year,d. To add few Days in a datee. To add few Months in a datef. To add few Years in a dateg. To return the date of the week of a given date.h. To return Month name from the date.i. To Display the Date in various format as: Date Display(Date d1, char *format)

Here Date is the newly created data type. The format string can hold the following values:

“DDMMYYYY”, “MMDDYY”, “MON, DD, YYYY”41. Write a C program to implement myprintf and myscanf functions using concept of variable

number of arguments. (using getch, putch, gets and puts function)

42. Write a C program that creates an Employee text file. Records are empid, empname, designation, qualification, salary, experience, Research work, address, city phone.

43. Write a C program that manipulates the above text file. The program must implements the operation to modify a record, delete a record and append new records.

44. Write C programs for the following operation to work like DOS Commands:a. type abc.txtb. copy source1.txt source2.txtc. copy source1.txt source2.txt source3.txt source4.txtd. compare source1.txt source2.txte. concatenate source1.txt source2.txt

45. Write a C program to open two files containing integers (in sorted order) and merge their contents.

46. Write a C program to count the number of vowels, consonants, digits, spaces, other symbols, words and lines in a given text file.

47. Write C code to check if an integer is a power of 2 or not 48. Write a C program to count bits set in an integer?49. Write a C program to set a particular bit in a given number.50. Write a C program to reset a particular bit in a given number.

CS-5511 Operating Systems

1. Course title and code: Operating Systems (CS 422)

2. Credit hours: 053. Program(s) in which the course is offered (If general elective available in many programs indicate this rather than list programs): M.Sc.(CS), M.Sc.(IT), M.C.A., M.B.A.(CM)

4. Name of faculty members responsible for the courseDr. Priyesh Kanungo, Dr. Ugrasen Suman, Mr Kunal Khanwilkar

5. Level/year at which this course is offered: I year I Sem 6. Pre-requisites for this course (if any) Computer Architecture

7. Co-requisites for this course (if any) : None

8. Date of approval of the course specification within the institution: Since beginning of the courses

9. Location if not on main campus: Main Campus

Aim and Objectives

1. Aim of the Course: To make the students familiar with design of operating systems as resource manager of a computer system. Students will study in details, various modules of the operating system like processor management, memory management, device management, file management and process management. After completing this course, the students will be acquainted with internal working of Windows and Linux OS.

2. Briefly describe any course development objectives that are being implemented. (eg increased use of IT or web based reference material, changes in content as a result of new research in the field):

Operating system is a heavily researched discipline. We will try to incorporate latest developments in the area of operating systems by referring research papers while teaching the course.

Course Description

SG: Operating Systems Concepts by Silbeschautz and Galvin.TAS: Modern Operating System, Tanenbaum A.S., Prentice/Hall of India

DATE TOPICS READINGS

Week 1 Introduction: Evolution of operating systems, operating system concepts

SG Ch1

Week 2 Processor Management: Concepts, Algorithms for batch SG Ch5

processing

Week 3 Processor Management Algorithms for time sharing operating systems, Introduction to real time systems

SG Ch5

Week 4 Memory Management: Concepts, single user memory management.Assignment 1: Implementation of RR, FIFO, MFB algorithms

SG Ch8

Week 5 Partition memory allocation SG Ch8Week 6 Virtual memory management using paging and

segmentation techniquesAssignment 2: Implementation of page replacement algorithms

SG Ch8, Ch9

Week 7 Concurrent Processes: Mutual exclusion and synchronization

SG Ch6

Week 8 Techniques of inter process communication SG Ch6 TAS Ch2

Week 9 Deadlock handling SG Ch7Week 10 File Management: Operations on a file, structure of a file

systemAssignment 3: Study of Unix file system and commands

SG Ch10 TAS Ch6

Week 11 Free block list, keeping track of blocks allocated to a file, directory structure, sharing and protection of files, file system Reliability, Unix file system

SG Ch10, Ch11 Ch6 TAS Ch6

Week 12 Device Management: Goals of input/output software design, Structure of device hardware and software

SG Ch12

Week 13 Layers of I/O software, structure of device drivers, Disk driver, disk arm scheduling algorithms, terminal driver, clock driver etc.Assignment 4: Study of various I/O devices.

SG Ch13

Week 14 Introduction to network and distributed operating systems

SG Ch16

Week 15 Case Studies: Unix/Linux, Windows operating systemAssignment 5: Study of Unix/Linux commands

S SG Ch21,Ch 22, Ch 23

Week16 Final Exam


Development of Learning Outcomes in Domains of Learning : Operating system design and usageThe course objectives are to:

• To present basic concepts of operating system architecture• Introduce the concepts of processor management• Introduce memory management techniques• Study of deadlock handling• Study of Interprocess communication• Detailed study of file systems, device management• Introduction of network and distributed systems

Case Study of Unix and Windows

Based upon above objectives the course goals / learning outcomes are defined below:

9) Define key concepts: Definition of operating system, Operating System History, Components of operating systems, System calls , concept of process, Process states, multiprogramming, Scheduling theory

10) Introduce ideas : Time Sharing system, Real time systems, Real time scheduling, Memory management of single user systems, Memory protection of single user systems

11) Understanding of Key ideas: Contiguous memory allocation, Partitioning, MFT, MVT, Virtual Memory, Paging, Segmentation, Demand Paging, Fragmentation, Superfluity, First fit, Best fit , Next fit, Compaction

12) Understanding Basics: Concurrent Processes, Critical section problem(Mutual exclusion), Interprocess communication, Synchronization, Peterson’s Solution, Semaphore, Monitors, Message passing

13) Fundamental Ideas: Definition of Deadlock, Holt’s conditions, Deadlock Prevention, Deadlock avoidance, Deadlock recovery, Banker’s algorithm, Two phase locking

14) Basic Knowledge: Definition of a file, Operations on file, Structure of file system, Free list , bit map, Directory structure, block allocation, File Allocation table, Inode, sharing and protection of files, File system reliability.

15) Rudimentary: Device management, Device Driver, I/O software design, Structure of I/O hardware, Disk driver, Disk scheduling, terminal driver, Clock driver

16) Introductory Knowledge: Network operating system, Distributed system, Case study of Unix operating system, Case study of windows operating system

Scheduling of Assessment Tasks for StudentsAssessment

Assessment task (eg. essay, test, group project, examination etc.)


1 Lab assignment I 04 052 Test I 08 103 Lab assignment II 12 054 Test II 15 105 Mini project 15 056 Performance in tutorials, classroom interaction

and attendanceContinuous basis

05

7 End semester exam After completion of the course

60

Learning Resources

1. Required Text(s): (i) Operating System Concepts, Addison Wesley, 4th Edition, A. Silberschatz and P. Galvin. 1994.(ii) Modern Operating System, A.S Tanenbaum., Prentice Hall of India

2. Essential References:

(i) Operating systems, 4rth Edition, William Stallings, Pearson Education, 2003.

(ii) Design of Unix operating system, Bach M., Pearson Education.

3- Recommended Books and Reference Material (Journals, Reports, etc) (Attach List):

IEEE & ACM Journals available to the students through university website www.dauniv.ac.in

4-. Electronic Materials, Web Sites etc

http://www.acm.org/, http://www.ieeexplore.ieee.org/Xplore/dynhome.jsp

5- Other learning material such as computer-based programs/CD, professional standards/regulations

CS-4121 Mathematical Foundation of Computer Science

1. Course title and code: CS-4121 Mathematical Foundation of Computer Science

2. Credit hours: 43. Program(s) in which the course is offered. MBA (CM) Ist Sem(If general elective available in many programs indicate this rather than list programs)

4. Name of faculty member responsible for the course : Dr. Arvind Kumar Goyal

5. Level/year at which this course is offered: MBA (CM) First Semester / First year6. Pre-requisites for this course (if any)

7. Co-requisites for this course (if any)


9. Location if not on main campus

Aim and Objectives

Aim of the Course• To develop logical thinking of the students.

• To develop computing algorithms of the students.

• To develop programming techniques for handling Scientific and

Mathematical applications.

• To develop the analytical ability required for solving a problem through

computer.

2. Briefly describe any course development objectives that are being implemented. (eg increased use of IT or web based reference material, changes in content as a result of new research in the field)

Course Description Week TOPIC Contact

hours

Week 1

Week 2

Unit I : Set Theory : Sets and Membership ,subset and set equality ,set operations, fundamental law of set operations. set construction.

Cartesian products, Relations, Functions and Binary operations, operations on functions.

Assignment 1- Some questions from the topic taught tobe given to the students and some sample questions to be solved by the students themselves using the principles learnt in the class..

4

Week 3

Week 4

Unit II : Algebra of Propositions- Statements, Conjuctions, Disjunctions, Negation, Conditional, Bi-conditional, Polynomicals and Boolean polynomials.

Propositions and Truth Tables, tautogies and contradictions, Logical equivalence, algebra of Propositions, Logical implication, Logically True and Logically equivalent statements.

Assignment 2- Some questions from the topic taught to be given to the students and some sample questions to be solved by the students themselves using the principles learnt in the class

4

Week 5

Week 6

Unit III: Co-ordinate geometry of two dimensions, Co-ordinate of a point, Distance between two points, Point dividing the join of two points.

Area of triangle, Locus and its equations. Transformation of co-ordinates.Assignment 3- Some questions from the topic taught tobe given to the students and some sample questions to be solved by the students themselves using the principles learnt in the class

4

Week 7

Week 8

Unite IV: Functions, limits and continuity- Functions, Constructions of Functions. Linear and quadratic Functions Sequences, Application to Management problems.Assignment 4- Some questions from the topic taught tobe given to the students and some sample questions to be solved by the students themselves using the principles learnt in the class

4

Week 8

Week 9

Week 10

Unite V: Differential and integral calculus – derative, basic Laws of derivatives. Higher order derivatives.

Maximum and Minima of functions of one variable. Integration by parts and simple method of integration of simple algebraic and transcendental functions.

Definite integral application to management problems including EOO model for Inventory control.Assignment 5- Some questions from the topic taught tobe given to the students and some sample questions to be solved by the students themselves using the principles learnt in the class

4

Week 11

Week 12

Week 13

Unite VI: 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 continuos compounding.Assignment 6- Some questions from the topic taught tobe given to the students and some sample questions to be solved by the students themselves using the principles learnt in the class

4

Week 14 up to exam

Revision and solving deficulty. 4


Development of Learning Outcomes in Domains of Learning The Course objectives are :To develop logical thinking of the studentsTo develop computing algorithms of students.To develop programming techniques for handling Scientific and mathematical application.To develop the analytical ability required for solving a problem through computer.

Based upon above objectives the course goals/learning outcomes are defined below.• Knowledge about how to define a set, subset, operations on sets, ordered pairs

and Cartesian product of two sets, relations and functions• Knowledge about statements, conjunctions, disjunctions, negation, conditional

statements.• Knowledge about how to write algorithm to solve a given problem by the

computer based on unit III, IV, and VI.

Scheduling of Assessment Tasks for Students

Assess Assessment task (eg. essay, test, group project, Week due Proportion

ment examination etc.) of Final Assessment

1 Test 1, 2, 3 3rd,5th,9th 40%

2

Final Examination 16th week 60%

Learning Resources

1. Required Text(s)Mathematics for Business and Economics: J. K. Sharma , Asian Books Pvt. Ltd., New Delhi

2. Essential References

3- Recommended Books and Reference Material (Journals, Reports, etc) (Attach List)

4-.Electronic Materials, Web Sites etc5- Other learning material such as computer-based programs/CD, professional standards/regulations

IC-2911 Communication Skills

1. Course title and code: IC-2911 Communication Skills

2. Credit hours-33. Program(s) in which the course is offered. MCA, M. Sc (CS), M. Sc (IT), MBA (CM)

4. Name of faculty member responsible for the course- Ms. Sonal Bamb, Ms. Pronita Mukherjee, Ms. Reema Sukhija, Ms. Smita Soni

5. Level/year at which this course is offered – First Semester/ First

6. Pre-requisites for this course – Interpersonal Skills, Ability to converse in English and General Awareness.


b. Location if not on main campus: Main Campus

Aim and Objectives

1. Aim The course is especially designed for the development of the overall personality, by imparting essentials of communication skills and preparing them in over all development. This also enhances flawless style to communicate in campus interviews.

Objectives: 1. To create awareness among the students the importance of communication skills in the corporate and social working. 2. To understand the concept of communication, listening, transactional analysis and allied aspects to have a command of communication as a master tool for their holistic development. 3. Prepare the students in group discussion, Interview, public speaking and report writing. 4. To prepare the students, to perform better, in the competitive LPG environment.

5. To develop their analytical skill by way handling selective cases

Course Description

DATE TOPIC Total hours & & assignment

Week 1 Unit 1:. Fundaments of Communication (OHP & PPP):Definitions, importance, forms of communication, process of communication, channels, barriers and strategies to overcome barriers of communication, oral communication, forms of communication.

Hr-3Chap-1,2,3

week 2 Unit 1: Linguistics And Phonetics:

Linguistics and phonetics, speech mechanism, organ of speech –articulators, English sounds, types of speech sounds, diphthongs. Consonants, place of articulation, languages on the basis of rhythm, accent & syllabus, word accent in English, rules of accentual pattern.

Lecture Notes

Hr- 3

Week 3 Unit 2: Grammer and modern usage, active and passive voice, reported speechPrepositions, modals, punctuation, verbal and non verbal.

chap-2,chap-3Lecture NotesHr-3

Week 4+week 5

Unit3 : Report writing

Précis writing, note writing, advertising, slogan writing.

Unit 3:Topics of general interest:

education, women’s rights movements, ergonomics, using dictionary, Indian railways, consumer protection movements

Unit 3: telephone media , debates, speeches

Chap-2Lecture Notes& assignmentsHr – 2Chap- 3Hr – 2Chap-4Hr-4

Week 6 Unit 4Technical report writing : meaning , definition, forwarding letters, preface, acknowledgement, table of content etc.

Lecture NotesHr - 3

Week 7 Unit 4 : vocabularyHomonyms, homophones, words often confused synonyms.

Lecture NotesHr - 2

Week 7&88

Unit 4: conversation- socializing cultural events Lecture NotesHr-4

Week 9 Unit 5: letter writing:Basic principles of letter writing, clarity, brevity, courtesy, appropriate tone , proper voice , use of concrete words, avoid negative statements, punctuations.

Lecture Notes Hr -2

Week 9 Unit 5: structure of business letter:Heading, date, reference, inside address, forms of layout, stationary.

Lecture NotesHr -1

Week 10 Unit 5:.styles of presentationThe intended styles block style, complete block style, semi block style, hanging intended style.

Lecture NotesHr - 1

Week 10 Unit 5: application letters :Intro, enclosure, body, resumes, exhibits.

Lecture NotesHr -2

Week 11 Unit 5: quotations , orders , tenders:.

Lecture NotesHr -3

Week 12

Week 13+Week 14

Unit 5 ; complaints and adjustment letters.:Elements of complaint letters imp. Point to remember while drafting, adjustment letters, expression, beginning/ starting sentence, concluding sentences, exhibits.__________________________________________________________

Interviewing skills: Types of interview, interviewing skills, mock interviews

_________________________________________________________

Chap-6Hr -3

Hr-6

Week 15 Group discussion:On current topics, students are required to have the inclusive knowledge on current updates.

Hr-4

Final exam

Learning Resources

Required Text(s)- 1. Dr Ritu benjamin1. OB by Fred Luthans2. OB by Stiphen P. Robbins3. Masterson, Johan & et. al (1989), “Invitation to Effective Speech Communication, Scott, Foreman and Co.4. Chturvedi, P.D. and Chaturvedi Mukesh (2004), “Business Communication”Pearson Education, Singapore Pvt. Ltd.2. Essential References 1. Business Communication by ICMR, Feb 2001.2. Toropov Brandon (2000), “Last Minute Interview Tips”, Jaico Publishing House, Mumbai.3. Heller Robert (1998), “Essential DK Managers: Communication Clearly”, Dorling Kindersley, London.4. Decker Bert ( ) “The Art of Communication”,5. Bone Diane (),“The Business of Listening”,a Fifty-Minute Series Book

Crisp Publications, Inc, California.

Documents

MISSION OF SCS Kit/MBA_CM_I.pdf · 2019-06-28 · 1. Study of Digital Logic gates with Identification numbers and Pin assignments. 2. Study of BCD Counter 3. Study of Decimal Decoder