Devi Ahilya Vishwavidyalaya School of Computer Science … Kit/MScCS_I.pdf · Devi Ahilya...

STUDENT KIT

M.Sc.(CS) – 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] Specification

mailto:[email protected]

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

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-4116 Discrete Structures 3 1 0 4 40 - 60 100IC-2911 Communication

Skills2 1 0 3 40 - 60 100

Lab Viva 2Comprehensive Viva 4

29

CS- 4007 Computer and Communication Fundamentals

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

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)

MCA, M.Sc. (CS), M.Sc. (IT), MBA (CM) – First 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

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.

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).

The course objectives being implemented includes 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.712) 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: 06

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

Ms. Preeti Saxena, 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


Assessment

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 5511)

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 processing

SG Ch5

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:1) Define key concepts: Definition of operating system, Operating System History,

Components of operating systems, System calls , concept of process, Process states, multiprogramming, Scheduling theory

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

3) 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

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

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

6) 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.

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

8) 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


Week due

Proportion of Final Assessment

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.jsp5- Other learning material such as computer-based programs/CD, professional standards/regulations

CS-4116 Discrete Structures1. Course title and code: Discrete Structures CS-4116

2. Credit hours: 43. 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)4. Name of faculty member responsible for the course Ms. Archana Chaudhary

5. Level/year at which this course is offered: I Semester of learning6. Pre-requisites for this course (if any): Graduate with mathematical background

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


9. Location if not on main campus: Not applicable

B Aim and Objectives

1. Aim of the Course: The aim of this course is to enhance mathematical reasoning of students so that they can understand various Discrete Structures and algorithms used in Computer Science. This course also helps students to use models for problem solving, so that students are familiar with various models that are used in computer science.

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)This course offers a study that gives 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- its applications and modelling. The course designed carefully blends and balances all these five themes.

Course Description

Week TOPIC READINGWeek 1 Unit1 The Foundations: Logic, Sets and Functions:

Introduction to set theory, mathematical logic, prepositions, prepositional equivalences, predicates and quantifiers. Importance of Quantifiers.

Chapter 1 Kenneth H. Rosen -page no.1-76 Chapter 1 C.L. Liu page no.1-15

Week 2 Unit 1 The Foundations: Logic, Sets and Functions: Sets, set operations, fuzzy sets, functions, functions for computer science, sequences and summations.

Chapter 1 Kenneth H. Rosen -page no.77-111 Chapter 1 C.L. Liu page no.16-33

Week 3 Unit 2 Mathematical reasoning: Introduction to Methods of proof, mathematical induction. Use of mathematical induction to solve different problems.

Chapter 3 Kenneth H. Rosen -page no.214-256 and Lecture Notes

Week 4 Unit 2 Mathematical reasoning: Importance of recursions in computer science, scope of recursions, Recursive definitions, recursive algorithms.

Chapter 3 Kenneth H. Rosen -page no. 257-290 and Lecture Notes

Week 5 Unit 3 Combinatorics:The basics of counting,The sum rule , The product rule , The Pigeonhole Principle, Permutations with repetitions , Permutations without repetitions , Circular Permutations. Applications of combinations.Applications of Combinatorics to solve Committee problems,word problems , puzzle problems etc.

Chapter 4 Kenneth H. Rosen -page no.301-320 and Chapter 3 C.L. Liu page no.66-78

Week 6 Unit 3 Combinatorics : Applications of Combinatorics to understand Telephone numbering plan , understanding internet addresses, Advanced counting techniques, recurrence relations, solving recurrence relations, algorithm design, Basic understanding of complexities, basic problems of complexity of algorithms.

Chapter 4 Kenneth H. Rosen -page no.321-349 and Chapter 3 C.L. Liu page no.79-95

Week 7 Unit 4 Relations: Relation definition , Importance of relations in computer science, Relations and their properties, Unary relations , Binary relations, Ternary relations , n-ary relations and their applications, closures of relations, equivalence relations, partial ordering.

Chapter 7 Kenneth H. Rosen -page no.471-488 and Chapter 4 C.L. Liu page no. 103-110

Week 8 Unit 4 Relations: Representing relations, relation matrix , relation graph, composite relation.. Operations on relations – union , intersection and join .


Week 9 Unit 4 Relations : Concepts of least upper bond, Greatest lower bond, maximal element, minimal element, Greatest element, Least element of a partially ordered set ,lattices, sub lattices , chains and antichains.


Week 10 Unit 5 Graphs: Introduction to Graphs, Importance of graph theory in computer science, Graph terminology, representing graphs, graph types, graph models, and graph isomorphism.

Chapter 8 from Kenneth H. Rosen -page no. 537-566 and Chapter 5 from C.L. Liu page no. 137-160

Week 11 Unit 5 Graphs: Connectivity, Euler and Hamiltonian Paths, shortest path problems, planar graphs, graph colouring, chromatic number, Euler’s formula, kuratowski’s theorem.

Chapter 8 from Kenneth H. Rosen -page no. 567-612 and Chapter 5 from C.L. Liu page no. 161-186

Week12 Unit 5 Graphs: The four colour problem, Applications of Graph Colouring, Introduction to Trees, applications of trees, tree traversal, trees and sorting, Spanning trees, minimum spanning trees.

Chapter 8 ,9 from Kenneth H. Rosen -page no. 613-694 and Chapter 6 from C.L. Liu page no. 187-219

Week 13 Unit 6 Languages and Grammars: Introduction to Languages and Grammars, solving problems for validity of statements according to the grammar.


Week 14 Unit 6 Languages and Grammars: Importance of Language theory in Computer Science, Importance of Derivation trees, solving problems of Derivation trees, Importance of Parsing , Phrase-Structure Grammars, Types of Phrase structure grammars.

Chapter 11 Kenneth H. Rosen -page no. 745 -751 and Chapter 2 C.L. Liu page no. 51-61



1) An overview of the subject, future scope of the subject, evaluation criteria.2) Define key terms, sets, set operations, fuzzy sets, and functions for computer

science. Student will understand the importance of sequences and summations, fuzzy sets in computer science.

3) Introduction to propositions, predicates,sequences etc .Student will be able to solve problems of propositions , predicates , sequences and summations.

4) Student will understand terms like combinatorics, Pigeon hole principle, generalized Pigeon hole principle. Students will be able to solve problems of

computing internet addresses, solving recurrence relations of different sorting problems and will be able to compute time complexity of simple algorithms.

5) Students should be able to categorize function types , differentiate between the terms functions and relations and understand the importance of relations in computer science.

6) Students will develop an understanding about relations and their properties, n-ary relations and their applications, representing relations, closures of relations, equivalence relations, partial ordering and concepts of least upper bond, greatest lower bond, maximal element, minimal element, greatest element, least element of a partially ordered set.

7) Students will be able to represent relations. Understand relational matrix and relation graph, closures of a relation, composite relation, operations on relations – union, intersection and join. Student will understand well the concepts of lattices, sub lattices, chains and antichains.

8) Student will develop an understanding of the concepts of graph, graph representation, graph terminology, graph types, graph models, and graph isomorphism, connectivity, Euler and Hamiltonian Paths, shortest path problems, planar graphs, graph colouring, chromatic number, Euler’s formula, kuratowski’s theorem.

9) Student will develop an understanding of four colour problem, Applications of Graph Colouring, Introduction to Trees, applications of trees, tree traversal, trees and sorting, Spanning trees, minimum spanning trees.

10) Student will be acquainted with language theory and will categorize language types. Student will get a clear understanding of derivation trees, parsing concepts.


Assessment



1 Assignment 1 3rd 15%2 Test 1 6th 15%3 Assignment 2 9th 5%4 Test 2 12th 5%6 Final Exam I week of

Dec.60%

Learning Resources

1. Required Text(s)

1. Kenneth H. Rosen “Discrete Mathematics and its Applications” , 5th

edition , Tata McGraw-Hill Edition.Let us C, Yashavant Kanetkar, BPB Publications.

2. C.L. Liu, "Elements of Discrete Mathematics”. 4th edition,TataMcGraw-Hill publication.

Reference Books: 1. Kolman, Busby & Ross "Discrete Mathematical Structures" ,5th edition

Pearson Education.2. Tremblay. J.P. & Manohar. P "Discrete Mathematical Structures with

Applications to computer Science" McGraw International edition.3. M.O. Albertson and Joan P. Hutchinson, "Discrete Mathematics with

Algorithms" 5th edition, John Wiley and Sons publication.4. Narsingh Deo "Graph Theory with Applications to Engineering. &

Computer Science",4th edition, Prentice Hall of India . 5. Discrete Structures , Logic and Computability by James L. Hein,2nd

edition,Narosa Publishing House.6. Discrete and Combinatorial Mathematics ,5th Edition by Ralph P.

Grimaldi,Addison-Wesley publication

Assignment list

1. Find a formula for the sum of the first n even positive integers.2. Use mathematical induction to prove the formula that you found in Exercise 1.3. Use mathematical induction to prove that 3 + 3 • 5 + 3 .52 +-----+ 3-5" = 3(5"+' - l)/4 whenever n is a nonnegative integer.4. Use mathematical induction to prove that 2 — 2 . 7 + 2.72------+ 2(-7)" = (1 - (-7)"+l )/4 whenever n is a nonnegative integer.5. Find a formula for ½ +1/4 + 1/8 +……….+1/2n

by examining the values of this expression for small values of n. Use mathematical induction to prove your result.

6. Show that l2 + 22 + • • • + n2= n(n + l)(2n + l)/6 whenever n is a positive integer.7. Show that l3 + 23 + • • • + n3 = [n(n + l)/2]2 whenever n is a positive integer.8. Prove that l2 + 32 + 52 + ….. + (2n + l)2 = (n + 1) (n + l)(2n + 3)/3 whenever n is a nonnegative integer.9. Prove that 1 • 1! + 2 . 2! +----+ -n . n! = (n +1)! - 1whenever n is a positive integer.10. Show by mathematical induction that if h > — l , then 1 + nh <= (1 + h)n for all nonnegative integers n. This is called Bernoulli's inequality.11. Prove that 3" < n! whenever n is a positive integer greater than 6.12. Show that 2n > n2 whenever n is an integer greater than 4.13. Use mathematical induction to prove that n! < n n whenever n is a positive integer greater than 1.14. Prove using mathematical induction that1 -2 + 2-3 +………..+ n(n+1) = n(n + l)(n+2)/3Whenever n is a positive integer.15. Use mathematical induction to show that 3 divides n 3 + 2n whenever n is a nonnegative integer.20. Use mathematical induction to show that 5 divides n 5 — n whenever n is a

nonnegative integer.21. Use mathematical induction to show that 6 divides n 3 — n whenever n is a

nonnegative integer.22. Use mathematical induction to show that n2 — 1 is divisible by 8 whenever n is an

odd positive integer.23. Use mathematical induction to show that n2 — 7n + 12 is nonnegative if n is an

integer greater than 3.

http://www.ntsearch.com/search.php?q=computer&v=56

24. Use mathematical induction to prove that a set with n elements has n(n — l)/2 subsets containing exactly two elements whenever n is an integer greater than or equal to 2.

25. Use mathematical induction to prove that a set with n elements has n(n — \)(n — 2)/6 subsets containing exactly three elements whenever n is an integer greater than or equal to 3.

26. List the triples in the relation {(a, b, c) | a, b, and c are integers with 0<a<b<c<5}.27. Which 4-tuples are in the relation {(a, b, c, d) \ a, b, c, and d are positive integers with abcd = 6}?

Table 3. EnrolmentsStudent Major CourseGlauser Biology BI290Glauser Biology MS475Glauser Biology PY410Marcus Mathematics MS511Marcus Mathematics MS603Marcus Mathematics CS322Miller Computer Science MS575Miller Computer Science CS455

Table 5.Teaching AssignmentsProfessor Department Course-numberCruz Zoology 335Cruz Zoology 412Farber Psychology 501Farber Psychology 617Grammar Physics 544Grammar Physics 551Rosen Computer Science 518Miller Mathematics 575

Table 6.Class ScheduleDepartment Course-number Room TimeComputer Science

518 N521 2.00 P.M.

Mathematics 575 N502 3.00 P.M.Mathematics 611 N521 4.00 P.M.Physics 544 B505 4.00 P.M.Psychology 501 A100 3.00 P.M.Psychology 617 A110 11.00 A.M.Zoology 335 A100 9.00 A.M.Zoology 412 A100 8.00 A.M.

Table 8 FlightsAirline Flight-number Gate Destination TimeNadir 122 34 Detroit 2.00 P.M.Acme 221 26 Denver 3.00 P.M.Acme 122 11 Anchorage 4.00 P.M.Acme 323 34 Honolulu 4.00 P.M.Nadir 199 12 Detroit 3.00 P.M.Acme 617 45 Denver 11.00 A.M.

Nadir 335 13 Denver 9.00 A.M.Nadir 412 34 Detroit 8.00 A.M.

List the 5-tuples in the relation in Table 8.28. Assuming that no new n -tuples are added, find all the primary keys for the relations displayed ina) Table 3. b) Table 5.c) Table 6. d) Table 8.29. 29.Assuming that no new n -tuples are added, find a composite key with two fields

containing the Airline field for the database in Table 8.30. Assuming that no new n -tuples are added, find a composite key with two fields

containing the Professor field for the database in Table 5.31. The 3-tuples in a 3-ary relation represent the following attributes of a student

database: student ID number, name, phone number.a)Is student ID number likely to be a primary key?b)Is name likely to be a primary key?c)Is phone number likely to be a primary key?32. The 4-tuples in a 4-ary relation represent these attributes of published books: title,

ISBN, publication date, number of pages.a)What is a likely primary key for this relation?b)Under what conditions would (title, publication date) be a composite key?c)Under what conditions would (title, number of pages) be a composite key?33. The 5-tuples in a 5-ary relation represent these attributes of all people in the

United States: name, Social Security number, street address, city, state. a) Determine a primary key for this relation.

a)Under what conditions would (name, street address) be a composite key?b)Under what conditions would (name, street address, city) be a composite key?34. What do you obtain when you apply the selection operator sc , where C is the

condition Room = A100. to the database in Table 6?35. What do you obtain when you apply the selection operator sc , where C is the

condition Destination = Detroit, to the database in Table 8?36. What do you obtain when you apply the selection operator sc , where C is the

condition (Course-number = 412) ^ (Room=A100), to the database in Table 6?37. What do you obtain when you apply the selection operator sc , where C is the

condition (Airline = Nadir) v (Destination = Denver), to the database in Table 8?38. What do you obtain when you apply the projection P2,3,5 to the 5-tuple (a. b, c, d,

e) ?39. Which projection mapping is used to delete the first, second, and fourth

components of a 6-tuple?40. Display the table produced by applying the projection P1,2,4 to Table 8.41. Display the table produced by applying the projection P1,4 to Table 8.42. How many components are there in the n -tuples in the table obtained by applying

the join operator J3 to two tables with 5-tuples and 8-tuples, respectively?43. Construct the table obtained by applying the join operator J2 to the relations in

Tables 5 and 6.44. Consider a set A={4,9,16,36}.Is the relation ‘divides’ a partial order.45. Consider A={1,2,3,5,6,10,15,30} is ordered by divisibility. Determine all

comparable and non comparable pairs of elements of A.46. Consider the set A={4,5,6,7}.Let R be the relation ≤ on A.Draw the directed

graph and Hasse diagram of R.47. Let A={2,3,4,6,8,24,48} with partial ordering of divisibility.Determine all the

minimal and maximal elements of A.

48. Let P(S) be the power set of the set S={1,2,3}.Construct the Hasse diagram of the partial order induced on P(S) by the lattice (P(S), ∩,∪)

49.A gift certificate at a local bookstore allows the recipient to choose 6 books from the combined list of 10 best-selling fiction books and 10 best-selling non fiction books. In how many different ways can the selection of 6 books be made. 50 A={a,b,c,d} and R = {(a,a),(b,a),(b,b),(c,c),(d,d),(d,c)} . Determine whether the relation R defined on A is an equivalence relation.

51.Find a grammar the following language {bb,bbbb,………..(bb)n+1 | n is a non negative integer}. 52.Find a grammar the following language {a,ba,bba,bbba…….(bna| n is a non negative integer}.

53. Is the poset A={2,3,6,12,24,36,72} under the relation of divisibility a lattice ? 54. Prove that Kn , the complete graph on n vertices with n ≥ 3, has (n-1)! Hamiltonian circuits.

55.Give an example of a graph that has an Euler circuit and a Hamiltonian circuit that are not the same.

56.Write a small procedure for addition of a node in a binary search tree. 57.Define the following terms :-

i. Graph Isomorphismii. Map coloring

iii. Chromatic Polynomialiv. Phrase structure grammarv. Euler graph.

vi. Bipartite Graphvii. Hamiltonian circuits

58. Write a small C code to create a digraph. 59.Write a small C code for insertion of a node in binary search tree. 60.Implement Topological sorting algorithm in C language. 61 Write a C code to decide whether a graph is Bipartite. 62 Write a small C code to create a graph and find its adjacency matrix. 63 Write a small C code to create a graph and find its adjacency list. 64 Write a small C code to create a graph and find its incidence matrix. 65 Implement Dijstra’s algorithm in C. 66 Write a small C code to determine isomorphism of two graphs. 67 Write a small C code to determine whether a graph is euler graph. 68 Write a small C code to determine whether a graph has Hamilton path. 69 Implement Prim’s algorithm in C for finding minimum spanning tree. 70 Implement Kruskal’s algorithm in C for finding minimum spanning tree. 71 Write a small C code to create a graph and find its subgraphs. 72 Write a small C code for breadth first traversal.

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

Course 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: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. The concepts required understanding the processes of communication, building effective communication, public and written communication, and preparation of various professional documents to facilitate better performance in future.

Course Description

Date Contents HoursI Fundaments of Communication (OHP & PPP):

Definitions, importance, forms of communication, process of communication, channels, barriers and strategies to overcome barriers of communication.

6

II Listening (PPP): Def, Importance, Benefits, barriers, approaches, be a better listener, exercises and cases. Assignment 1

4

III Advance Communication (PPP and Exercises on handouts)Why communication? Art of communication, V3 communication, Key elements of IP communication, Quizzes, exercises and cases / incidents for practice. Test 1- written and Assignment 2

5

IV Group Discussions:(PPP)Definitions, importance, process, points to be borne in mind while participating, Dos and Don’ts.Practice- if time permits or to be covered in PDP.

7

V Interview (PPP)Types of Interviews, Points to be borne in mind as an interviewer or an Interviewee, commonly asked questions, Dos and Don’ts.Practice- if time permits or to be covered in PDP. Test - practical

7

VI Transactional Analysis: (PPP)Transactional analysis, Johari Window, FIRO-B (PPP) Assignment 3

4

VII Written Communication: Cover letter, Report writing, documentation, business correspondence, preparation of manuals and project reports, Drafting emails.

5

VIII Negotiation Skill: Basic principles, Building understanding, process of negotiation, essentials of negotiations. Test 2-written

4

IX Contemporary Communication Styles, technology enabled communication

3

IX Tests and presentations 3Total Hours 48

Text Read-ings

1. 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.

References Read-ings

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.

Subject Learning Outcomes:


The Student should acquire a complete understanding of role of communication in day

to day life, business, and job.

1. The students should have an understanding of objectives of communication, its importance and the importance of feedback.

2. They will be well versed in every kind of communication, verbal, non-verbal, formal, informal, internal and external.

3. They will be an expert in giving presentation by analyzing the audience and selecting the appropriate medium and channel.

4. They will learn different Styles of writing resumes, reports and proposals, drafting emails, conducting formal meetings.

5. They will understand the Do’s and Don’ts of interviews, and develop techniques used in group discussions and presentations.

Scheduling of Assessment Tasks for StudentsAssessment



2

Test I 06 10

4 Test II 12 10

5 Practical 15 10

6 Performance in lab assignments, quizzes and tutorials

Continuous basis

05

7 Classroom interaction and attendance Continuous basis

05

8 End semester exam After completion of the course

60

ASSIGNMENTS: 1. Making their Resumes.2. Writing formal letters, Memos, drafting emails, notices. 3. Create a questionnaire, and meet new people they never met and know about

them.

Note: Extra assignments may be given in classroom.

Group Discussions:1. On the current Topics.

Devi Ahilya Vishwavidyalaya School of Computer Science … Kit/MScCS_I.pdf · Devi Ahilya...

Documents

Transcript of Devi Ahilya Vishwavidyalaya School of Computer Science … Kit/MScCS_I.pdf · Devi Ahilya...