7/28/2019 I Sem CourseInfo 2011 With Questions
1/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
1
PES Institute of Technology Dept. of MCA
GENERAL GUIDELINES
1. The course information is to be brought to the classroom daily.2. Students should be in time for the first class and subsequent classes thereafter.3.
Students should keep the classroom and Laboratories clean and tidy.
4. Students are informed to clarify their doubts in the respective subjects with the facultyby taking prior appointments.
5. Students are advised to show due respect to all faculty regardless of the departmentand maintain affable personality.
6. Students are to maintain absolute discipline and decorum, so as to promote the fairname of their college in all its activities.
7. Students having less the 85% attendance in any subject (both Theory and Practical)will not be allowed to take up the university examination.
8. Students who fail to get minimum of 25 marks in Internal assessment of any subjectwill fall in NSSR category and / or not eligible to take up that particular subject.
9. Parents are to follow the progress of their wards by being in touch with the collegeauthorities at regular intervals.
10. Writing on desks and walls is strictly prohibited, failing which the students will be fined aminimum of Rs. 500. If the identity of the individual is not established the entire classwill be fined ranging from Rs.100 to Rs.500
11. Attendance of the students will be displayed on the department notice board as well asavailable in the Web site at the end of the 5th, 10th, and 16th week of the semester along
with list of students having shortage in attendance.
12. Students should bring the observation book as well as the laboratory record bookcompleted in all respect to the laboratory.
13. Take the print outs of the source listing and output of the code after execution anddelete your files.
14. Students are not supposed to alter the configuration / any software on the system.15. Final examination is of 3 hours duration.16. Students are supposed to fill details in the LOG BOOK at the time of entering and leaving
the lab.
17. Students should wear IDENTITY CARD all the time. Students without the same will notbe allowed to enter either the class room or the lab.
18. Those students who have less than 85% attendance should sign the undertaking givenby their class teachers from time to time.
19. Students are not allowed to bring the mobile phones and Ragging is strictly prohibited inthe campus.
7/28/2019 I Sem CourseInfo 2011 With Questions
2/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
2
I SEMESTER PROGRAMME STRUCTURE
Time Table
Class Teachers:
I SEM Section A Mrs. A.Lekha
I SEM Section B Mrs. Prema Latha H.M
Sl.No
SubCode
SUBJECTMARKS
Total Page #IA UE
1 10MCA11 Problem solving using C 50 100 150
2 10MCA12 Discrete Mathematics 50 100 1503 10MCA13
Fundamentals of ComputerOrganization
50 100 150
4 10MCA14 Introduction to Unix 50 100 150
5 10MCA15ProfessionalCommunication & Ethics
50 100 150
6 10MCA16 C Programming Laboratory 50 50 100
7 10MCA17 Unix Laboratory 50 50 100
8 10MCA18IT and Digital ElectronicsLaboratory
50 50 100
Total 400 650 1050
Day/Time
08:15-09:15
09:15-10:15
10.15-10.45
10:45-11:45
11.45-12.45
12.45-01.30
01.30-02.30
02.30-03.30
Mon
Tea
Break
Lunc
h
Break
Tue
Wed
Thu
Fri
7/28/2019 I Sem CourseInfo 2011 With Questions
3/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
3
PROBLEM SOLVING USING C
Subject code : 10MCA11 Hours/week : 4
Faculty : Mrs. A Lekha Total Hours : 52
The subject focuses about the C language: to interact with the computer, solve the problems by
implementing logic in the language chosen, the flexibility and effective storage which C languageoffers to the user. The purpose of C is to precisely define a series of operations that a computer
can perform to accomplish a task. Most of these operations involve manipulating numbers and
text, but anything that the computer can physically do can be programmed in C. The study also
deals about the features of C such as file management, dynamic allocation.
Class
No.
Chapter
No.Topics Covered
% of portions
covered
Chapter
wise
Cumu
lative
1
1
Algorithms and
Flowcharts
T2 :Chapters
1.1, 1.3, 2.1,2.3
The meaning of algorithm, flowcharts and
their need, writing algorithms and
Flowcharts 6 6
2Simple exercises
3
2
Constants
Variables andData types
T1: Chapter 2
Character set, C tokens, keywords and
identifiers, constants, variables, Data
types
8 144
Variable declarations, Declaration of
storage classes, Assigning values to
variables.
5
Declaring a variable as constant,
Declaring a variable as volatile
Overflow and underflow of data
6 Structure of a C program
7
3
Operators and
expressions
T1:Chapter 3
Arithmetic, Relational, Logical,
Assignment, Increment and Decrement,
Conditional, Bitwise, Special operators.
4 188
Arithmetic expressions, Evaluation of
expression, precedence of arithmeticoperators
9
Type conversions in expressions,
Operator precedence and associativity,
mathematical functions
10 4
Managing Input
and Output
operations
T1 :Chapter 4
Reading a character, writing a character,
6 2411 Address operator & , formatted input
12 Formatted output using format specifiers
13 Simple C programs
7/28/2019 I Sem CourseInfo 2011 With Questions
4/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
4
14
5
Control
statements
T1 :Chapter 5
If Statement, Simple if, If..Else
statement, nesting of if..Else, Else-if
ladder.
6 3015Switch statement, The? : (conditional)
operator
16 go to statement, break statement
17 Programming examples
18 6
Loop control
structures
T1 :Chapter 6
While, do..while statements
6 3619For, nested loops, jumps in loops,
continue statement.
20 Programming examples
21
7
Arrays
T1 :Chapter 7
Introduction, One dimensional arrays,
Declaration, Initializing 1D array
6 4222Two dimensional arrays, Initializing 2D
array.
23Multidimensional arrays, dynamic arrays,
Programming examples
248
Character
arrays and
strings
T1 :Chapter 8
Declaring and initializing string variables.
Reading string from terminal, writing
string to screen
6 4825
Arithmetic Operations on characters,
Putting strings together, comparison of
two strings.
26String handling functions, table of strings
and Programming examples
27
9
User defined
functions
T1 :Chapter 9
Need for user defined functions, A Multi-
Function program, Elements of User-
Defined Functions
12 60
28Definition of Functions, its return values
and their types.
29
Function calls, Function Declaration,
Category of functions: Functions with No
arguments and No return values.
30
Arguments but no return values,
arguments with return values, no
arguments but returns a value.
31Functions that return a multiple values,
Nesting of functions, recursion
32Passing arrays to functions, passing
strings, Programming examples
33
10
Structures
and Unions
T1 :Chapter 10
Definition, Declaration of Structure
variables, Accessing of structure
variables. Structure initialization, copying
and comparing of structure variables.
6 66
7/28/2019 I Sem CourseInfo 2011 With Questions
5/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
5
34
Operations on individual members.
Arrays of structures, Arrays within
structures, structures within structures.
35
Structures and functions, Unions, size of
structures, bit fields, Programming
examples
36
11
Pointers
T1 :Chapter 11
Understanding pointers, accessing theaddress of a variable, declaring and
initializing pointers.
10 76
37
Accessing a variable through its pointer,
chain of pointers, pointer expressions,
pointers and arrays.
38Pointer and character strings, array of
pointers, pointers as function arguments.
39Functions returning pointers, pointers to
functions, pointers and structures.
40 Programming examples
41
12
File
Management
in C
T1 :Chapter 12
Introduction, Defining, opening and
closing a file
12 88
42 I/O operations on files,
43 Error handling
44 Random access to files
45 Command line arguments
46 Programming examples
47 13
Dynamic
memory
allocation
T1 :Chapter 13.1
To 13.6
Dynamic memory allocation, allocating aBlock of memory: malloc
6 94
48Allocating multiple blocks of memory:
calloc
49releasing the used space: free, Altering
the size of a block: realloc
50 Programming examples
5114
The
Preprocessor
T1 :Chapter 14
Introduction, macro substitution, file
inclusion, Compiler control directives,6 100
52ANSI additions, Programming examples
TEST SYLLABUS:
7/28/2019 I Sem CourseInfo 2011 With Questions
6/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
6
Test 1: Chapters:1,2,3,4,5 Test 2: Chapters:6,7,8,9 Test 3:Chapters:10,11,12,13, 14
LITERATURE:
Book
Type
Book
No.Book Name Author
Publication Information
Edition Publisher Year
Text
BookT1
Programming in
Ansi CE Balagurusamy
3rd
Edition
McGraw
Hill2003
Text
BookT2
Computer
programming in CV. Rajaraman
-PHI 2000
Ref.
Book R1
Structured
Programming
Approach C
Behrouz A Forouzan
and Richard F Gilberg
2nd
Edition Thomson 2005
QUESTION BANK
7/28/2019 I Sem CourseInfo 2011 With Questions
7/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
7
Chapter1,2,3,4: Algorithms and Flowcharts, Constants Variables and
Data types, Operators and expressions, Managing Input and Output operations
Objective: The objective of this chapter is to familiarize you with the basic need foralgorithms/flowcharts. Writing algorithms and drawing flowcharts for simple programs isexplained. Structure of C program is discussed. The unit also gives an idea what arevariable, constant and operators. We also discuss the data types, expressions.
1. Draw the flowchart whether the given number is odd or even2. Write an algorithm to find the smallest and largest of given N numbers.3. What is an algorithm? What are its characteristics?4. Write a flow chart for finding biggest among n-numbers5. Write an algorithm to find roots of quadratic equation.6. Write the different symbols used in flow chart7. What for algorithms and/or flow charts are used?8. C is a middle level language. Justify your answer.9. What is a variable and what is meant by value of a variable?10. What is an identifier? Explain. List the rules required to form variable names in C.11. Write an explanatory note of fundamental data types in C.12. What are trigraph characters? How are they useful?13. How do variables and symbolic names differ? Give an example.14. What is meant by initialization? Why is it important during execution of a program?15. What is meant by const and volatile? Give examples.16. What are C tokens?
17.
Find errors if any
1 int x;
2 float letter, DIGIT;
3 double =p,q4 exponent alpha, beta;
5 m,n,z: INTEGER
6 short char c;
7 long int m; count;
8 long float temp;
18. What are the steps that have to be taken to improve the accuracy of thecalculations involving very small or very large numbers?
19. Why are escape sequence characters used? Write their characteristics.20. What are the qualifiers that an int can have at a time? Give examples.21. Explain increment & decrement operators with suitable examples.22. Explain the different relational operators in C with examples.
23.
Find errors if any and rectify
1 x = y = z = 0.5, 2.0, -5.75;
2 m = ++a * 5;
3 y = sqrt(100);
4 p *=x/y;
5 s =/5;
6 a = b++ -c *2
7/28/2019 I Sem CourseInfo 2011 With Questions
8/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
8
24. Give the format of a C-program. Give a typical example.
25.Find errors if any and rectify
1 if(m==1 & n!=0) printf(OK);
2 if(x=
7/28/2019 I Sem CourseInfo 2011 With Questions
9/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
9
36. Explain iterative constructs in C. Give an example for each construct.37. Write a program to list all the prime numbers between n1 and n2. Also make a
count of them.
38. Write a program to count number of 1s in a given binary number.39. Give the syntax of ifelse statement and illustrate it with an example.40. Write a C program to accept an integer number and print the digits using words.
41.
What will be the output for the following program?int func(int i) {
if (i%2) return 0;
else return 1;
}
main() {
int i=3;
i=func(i);
printf(i=%d,i);
}
42.Rewrite each of the following without using compound relationship.a) if (number > 100) OR (number < 0) printf (out of range);
else sum + = number;
b) if ((M1 > 60) && (M2 > 60) OR (T > 200) printf (success);else printf (Fail);
43. Explain the different kinds of loop statement available in C with example.
44.
What would be the output of each of the code segment
1 for(n=1;n!=10;n+=2)
sum = sum + n;
2 for(n=5;n100||!x
4 x==100||x>100||!x
47. Assuming that x = 10, y = 0 and z = 5 initially what will be their values after thecode segments are executed?
7/28/2019 I Sem CourseInfo 2011 With Questions
10/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
10
1 if(x&&y) x = 100;
else y = 100;
2 if(x||y||z) y = 100;
else z = 100;
3 if(x)
if(y)
z = 100;else z = 0;
4 if(x==0 ||x & & y)
if(!y)
z = 0;
else y = 5;
48. What is a null statement? Explain a typical use of it.49. How is a for loop used when the number of iterations are not known?
50.
What is the output of the following code segments?
1 count =5;
while(count-- > 0) printf(%d,count);2 count =5;
while(--count > 0) printf(%d,count);
3 count =5;
do printf(%d,count); while(count > 0) ;
4 for(m=10; m>7;m-=2)
printf(%d,m);
51.
Compare in terms of their execution
1. Whileanddowhile2. Whileandfor3. Breakandgoto4. Breakandcontinue5. Continueandgoto
52.Write a for statement to print the following sequences of integers
1. 1,2,4,8,16,322. 1,3,9,27,81,2433. 4,2,0,2,44. 10,12,14,18, 26, 42
53.When do we use the following statements
1. for(;;)2. while(true)3. while(1)
54. How does a programmer decide the use of one of the three loops in C for a givenproblem?
Chapters 7,8,9: Arrays, Character arrays and strings, User defined functions
Objective: The unit describes the arrays and also discuss about the need for functions,
category of functions. The unit also deals with character arrays and the library functions
used to work on the arrays.
7/28/2019 I Sem CourseInfo 2011 With Questions
11/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
11
55. Briefly discuss how arrays are declared and initialized in C.56.
Write a program in C to read N integers(N
7/28/2019 I Sem CourseInfo 2011 With Questions
12/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
12
81. Describe the ways of passing parameters to the functions with examples.
82.
Distinguish between
1. Actualandformalarguments2. Globalandlocalvariables3. Automaticandstaticvariables4. Scopeandvisibilityofthevariables5. &and*operator
83. What are the rules that govern the passing of arrays to a function?84. Write a function to find the largest element of an m by n matrix.Chapters 10,11: Structures , Unions and Pointers
Objective: This unit gives an idea about the structures, Unions and Pointers. It also deals
with the enumerated data types.
85. What is a pointer? Mention the advantages of pointers and list out the operationsused with pointers.
86. Explain the difference between structure tag and structure variable with example.87. Explain with examples how the structure is initialized.88. Explain the difference between structure and union with examples.89. What is a structure? Explain the structure definition.90. Demonstrate how pointer can be used to access data items of structure with in a
structure.
91.Create an array of 10 elements where each element is a structure with the following
fields: IDNO, NAME, MARKS and AGE. Read data into this array. Find the average
marks of these 10 students and also display the name of youngest student.
92. Explain the operators that are used to access members of structures.93. Explain key word typedef with example94. Compare structures and unions.95. Compare structures and arrays.96. Explain enumerated data types.97. Explain enumerated data types.98. Explain the concept of structures within structures.99. What is a slack byte? How does it affect the implementation of structures?100. Describe the different approaches that can be used to pass structures as function
arguments?
101.
What is the error in the following code?
typedef struct product
{
char name [ 10 ];
float price;
}PRODUCT products [ 10 ];
102. What are the arithmetic operators permitted on pointers? Give examples.103. Distinguish between (*m)[5] and *m[5].104. Explain the concept of const qualifier with pointers.105. Write a c program to accept an array and print it in reverse order. Use a pointer
variable p that points to the elements of the array
106. What are the advantages of using pointers?
7/28/2019 I Sem CourseInfo 2011 With Questions
13/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
13
107. What is the difference between the name of the array and pointer to an array?108. Explain about pointer comparisons with examples.109. What is a pointer to pointer? Explain with examples.110. Explain the concept of arrays of pointers?111. Explain pointers to function.
112.Find the error if any
1. intx=10;2. int*y=10;3. inta,*b=&a;4. intm;int**x=&m;
113.
Given the following declarations int x = 10, y= 10;
int *p1 = &x, *p2 = &y;
What is the value of the following expressions?
1. (*p1)++;2. (*p2);3. *p1+(*p2) 4. ++(*p2) *p1
114.There are two different definitions of the function search(). Are they equivalent?
Explain.
void search(int* m[], int x){}
void search(int** m, int x) {}
115.Which one of the following is the correct way of declaring a pointer to a function?
1. int(*p)(void);2. int*p(void);
116. Write a program to read an array of integers using pointers and print the elementsin the reverse order.
117. Write a function using pointer parameters that compares two integer arrays to see ifthey are identical. The function returns a 1 if they are identical, 0 otherwise.
Chapters 12,13,14: File Management, Memory Management in C, The
Preprocessor
Objective: This unit deals with the concepts of files in C. It deals with the different modes
and functions. It also deals with dynamic memory management with the understanding of
malloc, calloc and realloc functions. We also understand the C preprocessor and the
macros.
118. How does an append mode differ from write mode?119. What is the significance of EOF?
120.Distinguish between
1. getcandgetchar2. printfandfprintf3. feofandferror
121. Explain the general format of fseek function.122. What are the common uses of rewind and ftell functions?123.
Find error if any
FILE fptr;
fptr = fopen (data, a+);
7/28/2019 I Sem CourseInfo 2011 With Questions
14/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
14
124.
What is the output of
1 while ((c=getchar() !=EOF)
putc(c, f1);
2 while ((m=getw(f1) !=EOF)
printf(%5d,m);
3 for(i=1;i0)?(x):(x)3. #ifdef(FLAG)
#undefFLAG
#endif
4. #ifn==1update(item)#elseprintout(item)
#endif
140. Enumerate the differences between functions and parameterized macros.141. Differentiate between calloc and realloc function.142. What is dynamic memory allocation? What are memory allocation functions?143. What is malloc? Explain with an example.144. Write a c program to store a character string in a block of memory space created bymalloc and then modify the same to store a larger string.145.
Find errors is any,
1. *ptr=(int*)malloc(m,sizeof(int));2. table=(float*)calloc(100);
7/28/2019 I Sem CourseInfo 2011 With Questions
15/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
15
3. node=free(ptr);
146.
What is the output of
1 int * p;
p = malloc(sizeof(int));
2 float *p;
p = calloc(10, sizeof(float));
3 int i, *ip;ip = calloc(4, sizeof(int));
for(i=0;i
7/28/2019 I Sem CourseInfo 2011 With Questions
16/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
16
5 3.3, 3.4 Countable and uncountable sets Examples
6 Problem solving.
7 Introduction to Logic
8 Basic Connectives and Truth Tables.
9 Problems
Chapters: Fundamentals of Logic
19 36
10
Book: T1
Chapter N0. 2
2.2,2.3,2.4,2.5
Logical Equivalence
11 Problems on connectives
12 Laws of Logic
13 Principle of duality
14 Problems on Principle of duality
15 Logical Implication
16 Rules of Inference
17 Problems on Rules of Inference
18 Quantifiers, definitions
19 Use of quantifiers and proof of theorems
Chapters: Relations & Functions
19 55
20
Book T1
Chapter No.4 & 5
4.1,4.2,5.1
The Well Ordering Principle- Definition-Examples
21 Problems
22 Mathematical Induction
23 Problems
24 Recursive Definitions
25 Examples
26 Miscellaneous problems
27 Introduction to Relations, Examples
28 Cartesian Products and Relations
29 Problems
Chapters: Relations & Functions(Continued)
21 76
30
Book: T1
Chapter No.5 & 7
5.2 to 5.67.1 to 7.4
Introduction to functions, Plain and One to One functions, Examples
31Onto Functions Stirling Numbers of theSecond Kind, Examples
32 Special Functions
33 The Pigeon-hole Principle
34Function Composition and Inverse Functions,Problems
35 Properties of Relations
36 Computer Recognition Zero-One Matrices
37 Directed Graphs
38 Partial Orders Hasse Diagrams
39 Equivalence Relations - Problems
40 Partitions - Examples
7/28/2019 I Sem CourseInfo 2011 With Questions
17/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
17
Chapters: Groups, Coding Theory & Rings, Modular Arithmetic
24 100
41
Book: T1
Chapter No.15
15.1 to 15.3
15.5 to 15.9
Groups-Definition-Examples-Elementaryproperties
42 Homomorphisms- Isomorphisms- Examples.
43 Cyclic Groups
44 Cosets Lagranges Theorem
45 Elements of Coding theory-The HammingMetric
46 The Parity Check- Generator Matrices
47 Decoding with Coset Leaders
48 Hamming Matrices
49 The Ring Structure Definition -Examples
50 The Ring Properties -Substructures
51 The Integer Modulo n
52 Problems
TEST SYLLABUS:
Test 1: Chapters: 2, 3 Test 2: Chapters: 4, 5 Test 3: Chapters: 7, 15.
LITERATURE:
Book
Type
Book
No.Book Title Authors
Publication Information
Edition Publisher Year
Text
BookT1
Discrete andCombinatorialMathematics, anApplied Introduction.
RalphP.Grimaldi
&B.V.Ramana
5th
Edition
Pearson
Education2004
Reference
BookR1
Discrete Mathematicsand its Applications Kenneth H.
Rosen
6thEdition
McGraw Hill 2007
Reference
BookR2
A Treatise on Discrete
Mathematical
Structures
Jayant
Ganguly ---
Pearson
Education2010
Reference
BookR3
Discrete MathematicalStructures- Theory &Applications
D.S.Malik
and M.K.Sen ----Thomson 2004
7/28/2019 I Sem CourseInfo 2011 With Questions
18/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
18
QUESTION BANKChapters: 2&3Set Theory & Fundamental Logic:Objective: This unit introduces basic concepts of sets and counting principles. And the basicconcepts of fundamental logic. The concepts of Set theory are used in switching circuits. Thelogic of mathematics is applied to decide whether one statement follows from, or is a logicalconsequence of one or more other statements.
Questions:
1) Define the following and give an example to eachi) Empty set ii) Power set iii) Multiset iv) Ordered setv) Symmetric difference of two sets
2) If A and B are 2 sets show that (AUB) = A B3) State and establish the principle of inclusion and exclusion.4) Show that the symmetric difference of 2 sets is commutative.5) Prove that symmetric difference is associative.6) Show that
(1) A X (B C) = ( A X B ) (A X C)(2) A X (B U C) = ( A X B ) U (A X C)(3) A (B - C) = (A B) C(4) (A - B) (A - C) = A - (B U C)(5) (A B) C = (A C) (B C)
7) Prove that for any three sets A,B,C
(i) A B A B
(ii) A (B C) (A B) (A C)
(iii) A (B C) (A B) (A C)
8) Let X be the set of all students at a university. Let A be the set of students who arefirst year students, B the set of students who are second-year students, C the set ofstudents who are in a discrete mathematics course, D the set of students who areinternational relations majors, E the set of students who went to a concert on Monday
night, and F the set of students who studied until 2 A.M. on Tuesday. Express in set
7/28/2019 I Sem CourseInfo 2011 With Questions
19/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
19
theoretic notation the following sets of students:(a) All second-year students in the discrete mathematics course.(b) All _rst-year students who studied until 2 AM on Tuesday.(c) All students who are international relations majors and went to the concert on
Monday night.(d) All students who studied until 2 AM on Tuesday, are second-year students, and
are not international relations majors.(e) All _rst- and second-year students who did not go to the concert on Monday
night but are international relations majors.(f) All students who are _rst-year international relations majors or who studied until
2 AM on Tuesday.(g) All students who are _rst- or second-year students who went to a concert on
Monday night.(h) All _rst-year students who are international relations majors or went to a concert
on Monday night.9) Write three descriptions of the elements of the set (2, 5, 8, 11, 14).10) Which of the following pairs of sets are equal? For each pair that is unequal, and an
element that is in one but is not in the other.(a) {0, 1, 2} and {0, 0, 1, 2, 2, 1} (b) {0,1,3,{1, 2}} and {0,1,2,{2, 3}}(c) {{1,3,5}, {2,4,6}, {5,5,1,3}} and {{3,5,1}, {6,4,4,4,2}, {2,4,4,2,6}}
(d) {{5,3,5,1,5}, {2,4,6}, {5,1,3,3}} and {{1,3,5,1}, {6,4,2}, {6,6,4,4,6}}(e) and {x N : x > 1 and x2 = x } (f) and { }
11) Let A = {1;2;3; : : : ; 10}; B = {2;3;6;8}; and C = {3;5;4;8;2}: Find the following:(a) B UC (b) B C (c) B C (d) A B (e) A C
12) Find three sets A, B, and C where A B U C but A B and A C whereA = {2,3,4}. B = {1,2,3}. C = {3,4,5}.
13) In a class of 35 students who are either biology majors or have blonde hair, thereare 27 biology majors and 21 blondes. How many biology majors must be blonde?
14) A tennis camp has 39 players. There are 25 left handed players and 22 players havea two-handed back stroke. How many left-handed players have a two-handed backstroke if every player is represented in these two counts?
15) A marketing class did a sample survey to _nd out how many of a class of 125 people
owned CD's of the Beatles, Alabama, or Bob Marley. The results of the survey showedthe following:Recording Artist No. of Students Owning CD'sBeatles 65Alabama 46Bob Marley 29Beatles & Alabama 18Beatles & Bob Marley 21Bob Marley & Alabama 12Beatles, Bob Marley, & Alabama 9How many of the students owned no CD featuring these performers?
16) How many integers between 1 and 250 are divisible by 3 or 5?
17) How many numbers between 1 and 1000 are not divisible by 3, 7, or 9?18) Find the number of integers between 1 and 1000, including 1 and 1000, that are notdivisible by any of 4, 5, or 6.
19) 30 cars were assembled in a factory. The options available were a radio, airconditioner, white wall tyres. It is known that 15 of the cars have radios, 8 of themhave air conditioner and 6 of them have white wall tyres, 3 of them have all threeoptions. Determine at least how many cars do not have any options at all.
20) In a survey of 254 college students, the following data were obtained:64 had takenMathematics course, 94 had taken Physics course, 58 had taken chemistry course,28 had taken both Mathematics and chemistry course, 26 had taken bothMathematics and Physics course, 22 had taken both Physics and chemistry course,and 14 had taken all three types of courses. Find how many of these students hadtaken none of the three courses?
7/28/2019 I Sem CourseInfo 2011 With Questions
20/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
20
21) Define with an example(i) Statement (ii) Well-defined formula (iii) Tautology(iv) Contingency (v) Contradiction
22) Show that the truth values of the following statements are independent of the truthvalues their components.(1) (P ^ (PQ)) -> Q(2) (P Q) (~P v Q)(3) Determine whether the following compound statement is tautology or not:
[(p q) ^(q r)] (p r)23) Show that S v R is tautologically implied by (P v Q), (PR) and (QS).24) (a) Show that the set of all finite sequences of elements of the one element set {0}
is countably infinite.(b) Show that the set of all finite sequences of elements of the two element set{0,1} is countably infinite.
Fundamental Logic:Objective: In this chapter we study the fundamentals of logic .Also, this involves truth tablesand proofs using reasoning or inference theory. In computer science, logic has many applicationsin areas such as database theory, artificial intelligence, program language design, and automatedverification of software and hardware.Also,used in digital electronics for different type switches or
gates.
Questions:25) Define the basic connectives and give their truth tables.26) What is logical equivalence? Define and give examples.27) Show that S v R is tautologically implied by (P v Q), (PR) and (QS).28) Define Tautology and contradiction. Prove that for any propositions p, q, r the
compound proposition {P (Q R)} { (P Q) (P R)} is a Tautology.29) Construct a truth table to show that
( ) (( ) ( ))p q p q q p is a tautology.
30) Let proposition p be T, proposition q be F, and proposition r be T. Find the truthvalues for the following:
(a) p q r (b) p (q r) (c) p (q r) (d) (q p) r(e) r (p q) (f) (p q) r (g) ((p r) (q p)) (q r).31) A restaurant displays the sign \Good food is not cheap" and a competing restaurant
displays the sign \Cheap food is not good." Are the two restaurants saying the samething?
32) Let U be the set of all human beings living in the year 2001, and translate thefollowing English sentences into quanti_ed formulas. Let P(x) stand for x is young,Q(x) for x is female,and R(x) for x is an athlete.Express symbolically each of the statements:(a) All athletes are young (b) Not all young people are athletes(c) All young people are not athletes (d) Some young people are not athletes(e) Some athletes are young females (f) All athletes are young males
(g) Some athletes are female and are not young(h) Some young females are not athletes (i) All young females are athletes(j) Some athletes are not young (k) No young people are athletes(l) All athletes are either female or are young(m) If all athletes are female, then all athletes are young; otherwise, no
athletes are young.33) Prove the following by using the laws of logic:
i) P (q r) (p q) rii) [(~P (~q r)] [(q r) (p r)] r
34) Using the rules of inference, show that the following argument is valid:P
P
p
7/28/2019 I Sem CourseInfo 2011 With Questions
21/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
21
S rr q
s t
Properties of the Integers & Relations:Objective: Here as an application of sets, relations are defined. Different types of relations aredefined and their properties are discussed. In particular, equivalence relations are studied indetail.
Questions:35) Define: i) Well-ordering principle
ii) Principle of mathematical induction.36) Show that for n = 0, 1, 2 the following is true
12 + 22 + 32 + .. + n2 = n(n + 1)(2n + 1)/6 for n 037) By mathematical induction, prove that n 2n-1, for all n 1.38) Prove by induction:
13 + 23 + 33 + .. + n3 = (1 + 2 + 3 + _ _ _ + n)2 for n 039) Prove by induction that the sum of the cubes of any three consecutive natural numbers
is divisible by 9.
40) Let A = {0; 3} and B = {x; y; z}: Find the following:(a) A x B (b) A x A x B (c) B x A (d) B x A x B
41) Let A={1,2,3,..,10}.LetR={(1,2),(1,4),(1,6),(1,8),(1,10),(3,5),(3,7),(4,6),(6,8),(7,10)} be a relation on A.Let S ={(2,4),(3,6),(5,7),(7,9),(8,10),(8,9),(8,8),(9,9),(3,8),(4,9)} be a second relationon A.Find:(a) R S (b) S R:
42) Define Cartesian product of sets, with example.Show that i) A X (B U C) = ( A X B ) U (A X C)
ii)(A U B) X C = (A X C) U (B X C)
Relations and Functions:Objective: Here as an application of sets, relations are defined. Different types of relations aredefined and their properties are discussed. In particular, equivalence relations are studied indetail. : Searching and sorting operations are based on relations. Relations concepts can beapplied in relational database.
Questions:43) If R1 and R2 are equivalence relations, prove that R1 R2 is an equivalence relation.44) Show that an equivalence relation R on a non-empty set A determines a partition of A.45) Define an equivalence relation. Let A = {1,2,3,6}. Define R on A by aRb if a divides
b. Show that R is an equivalence relation. Find the partition of A generated by R.46) Define a partition of a set with an example.47) Given A = { 1,2,3,4} and R = {(1,1),(1,2),(2,1),(2,2),(3,3),(3,4),(4,3),(4,4)},
determine whether the relation R is reflexive, symmetric, anti symmetric or transitive.48) Define the composition R S of relations R and S. In the usual form,
prove that (S R)-1=R-1 S
-1
49) Define partition of a set with example. If A=Z(set of all integers) andR={ (a,b) AXA/2 divides (a-b)} is a relation on A, then show that R is an equivalencerelation.
50) Define matrix representation of relation with example. IfR={(1,1),(1,2),(1,3),(1,4),(2,2),(2,4),(3,3),(4,4)} is a relation on A={1,2,3,4} then
find digraph of R and list in-degree, out-degree of all vertices.51) For a fixed integer n>1, prove that the relation Congruent modulo n is an equivalence
relation on the set of all integers, Z.52) Let A={1,2,3,4,5,6,12}. On A, define the relation R by aRb if and only if a divides b.
7/28/2019 I Sem CourseInfo 2011 With Questions
22/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
22
Prove that R is a partial order on A. Draw the Hasse diagram for this relation.53) Which of the following are functions? If not, why not?
(a) X is the set of students in a discrete mathematics class. For x X,define g(x) to beThe youngest cousin of x.
(b) X is the set of senators serving in 1998. For x 2 X, define g(x) to be the number ofterms a senator has held.
54) What are the domain and range of the addition function on the real numbers?Multiplication? Subtraction? Division?
55) Let X = {1; 0; 1; 2}and Y = {4;2; 0; 2}: Define the function F :X Y asF(x) = x2 x: Prove that F is neither 1-1 nor onto.
56) Let A = {1,2,3,4} and B ={a,b,c}. Define a function F : A B as F(1) = a, F(2) = b,
F(3) = c, and F(4) = c, List the ordered pairs of the equivalence relation R defined on Aas xRy if and only if F(x) = F(y). List the elements of the partition of A determined bythis equivalence relation.
57) Let X = {1,2,3,4} and Y = {5,6,7,8,9}: Let F = {(1,5), (2,7), (4,9),(3,8)}.Show that F is a function from X to Y . Find F1 and list its elements. Is F1 afunction? Why, or why not.
58) Let X ={1,2,3,4}. Let F : X R be a function defined as the set of ordered pairs{(1,2),(2,3),(3,4),(4,5)}. Let G : RR be the function defined as G(x) = x2. What is
G F?59) Prove that in any class of more than 101 students; at least two students must receive
the same grade for an exam with grading scale of 0 to 100.60) A man has 10 black socks and 11 blue socks scrambled in a drawer. Still half asleep the
man reaches in the drawer to get a pair of matching socks. How many socks shouldhe select, one at a time, before he will be sure that he has a matching pair. Howmany selections are needed to be sure he has a blue pair?
61) Let A = {1,2,3,4}. Let R be a relation on A, defined by xRy iff x/y and y=2x. Findi) R is relation of set of ordered pairsii) Draw digraph of Riii) Determine in degree and out-degree of all vertices.
Groups, Coding Theory and Rings; Group Codes, Rings and Modular Arithmetic:Objective: In this unit we examine properties shared by particular mathematical systems. Thenwe generalize our findings in order to study the underlying structure common to cryptology,coding theory and sime counting methods.
Questions:62) Prove that symmetric difference is commutative operation on sets.63) Let * be a binary operation on N with m*n = m + n + k where k is a constant. Show
that * is commutative and associative.64) Show that (N,*) is a semigroup where x*y = min{x,y} for any x,y N. Is (N,*) a monoid.65) Which of the following functions f are homomorphism from (Z+,+) to (Z+,.)? Which of
them are isomorphic.
(i) f(n) = 2
n
(ii) f(n) = n (iii) f(n) = 2n (iv) f(n) = (-1)
n
(v) f(n) = 3
n+1
66) Let G = {q Q|q -1}. Define the binary operation on G by x y = x + y + xy.Prove that (G,) is an abelian group.
67) Define the following algebraic structures, giving an example for each:i) Monoid ii) Semigroup iii) Group iv) Normal Groupv) Homomorphism and Isomorphism of groups.\
68) If G is a group, prove that for all a,b G, (i) (a-1)-1 = a (ii) (ab)-1 = b-1 a-1.69) A binary symmetric channel has probability p = 0.5 of incorrect transmission. If the
code word is c= 011011101 is transmitted, what is the probability that (a) wereceive r = o11111101? (b) we receive r = 111011100? (c) a single error occurs?(d) a double occurs? (e) a triple error occurs? Three errors occur, no two of themconsecutive?
70) What is the minimum distance of a code consisting of the following code words:
7/28/2019 I Sem CourseInfo 2011 With Questions
23/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
23
001010, 011100, 010111, 011110, 101001?71) Use the parity check matrix H given below to decode the following received words:
(i) 11101 (ii) 110101 (iii) 001111 (iv) 100100 (v) 110001 (vi) 111111(vii) 111100 (viii) 010100.
H =
101100
110010
011001
72) Construct a decoding table (with syndromes) for the group code given by the generatormatrix G=
11010
01101, using the decoding table, decode the following received
words, 11110, 11011, 10000, 10101.b) Show that Z5 is an integral domain.c) Prove that Zn is a field iff n is a prime.
FUNDAMENTALS OF COMPUTER ORGANIZATION
Subject code: 10MCA13 Hours / Week: 4
Faculty:Mrs. Prema Latha H M Total Hours : 52
Computer organization is a study of functionality of the computer system. It comprised ofvarious components and their interconnection. The study also focuses different memory systemand performing various operations. As a part of structural study logic gates and theirinterconnection to represent Boolean function also incorporated.
Class#
Chapter # Topics to be covered
% of Portioncovered
Chapter
- wise
Cumula
tive
1
Chapter 1 :Number
systems andLogic gates
T1:Chapters 2.1To 2.4, 2.6 To2.8, 3.1 To 3.10
Counting in decimal and binary, placevalue, binary to decimal conversion
14% 14%
2decimal to binary conversion, hexadecimalnumbers, octal numbers,
3bits, bytes, nibbles and wordsize, ANDgate, OR gate, NOT(inverter) and buffer,
4NAND gate, NOR gate, EX-OR gate, EX-
NOR gate,
5 NAND gate as an universal gate,
6 Gate with more than two inputs,
7 Using Inverters to convert gates.
8
Chapter 2:
Combininglogic gates and
arithmeticcircuits
T1 :Chapters
4.1 To 4.9,4.16, 10.1 To
10.11
Constructing circuits from Booleanexpression, drawing a circuit from amaxterm Boolean
17% 31%
9truth tables and Boolean expressions,sample problem simplifying Booleanexpression
10karnaugh maps, karnaugh maps withthree variables,
11 karnaugh maps with four variables
12more karnaugh maps, using demorganstheorem,
7/28/2019 I Sem CourseInfo 2011 With Questions
24/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
24
13
Chapter 3:Basic structure
of computer
T2 : Chapters1.1 To 1.4, 1.6,
2.2
Binary Addition, half adders, full adders,three bit adders, Binary subtraction, parallelsubtractors,
12% 43%
14 IC adders, Binary multiplication, Binarymultipliers, 2s complement notation
15 addition and subtraction, 2s complementadder/subtractor16
17 Computer types,18 Functional units
19 Basic Operational Concepts,
20 Bus Structures
21 Performance,Memory Locations and addresses
22
23
Chapter 4:
Machineinstruction and
programsT2 :Chapters
2.3 To 2.7
Memory operations, Instructions andSequencing, Basic Instruction types
15% 58%
24
25 Instruction Execution and Straight LineSequencing, Generating Memory
addresses
26
2728 Addressing modes
29 Assembly Language, Basic I/O Operations
30
31
Chapter 5:Input/Output
organizationT2 : Chapters
4.1, 4.2, 4.4 To4.6.
Accessing I/O Devices
15% 73%
32 Interrupts
33 Direct Memory Access (DMA)
34 Buses 240 :Synchronous busasynchronous bus
35
36
37
38 Interface circuits:Parallel port, serial port
39
Chapter 6:Memory
systemT2 :Chapters
5.1 To 5.5, 5.7.
Basic Concepts, Semiconductor RAM Memo
15% 88%
40 Static Memories, Asynchronous DRAMs
41 Synchronous DRAMs
42 Memory system considerations
43 RAMbus Memory, Read Only Memory
44 Cache Memories
45 Virtual Memories
4647
Chapter 7:Arithmetic unitT2 :Chapters
6.1 To 6.7
Addition of Signed Numbers
12% 100%
48 Subtraction of Signed Numbers
49 Design of Fast Adders
50 Multiplication of Positive Numbers
51Signed-Operand Multiplication: BoothAlgorithm, Fast Multiplication.
52
Bit Pair recoding of Multipliers, IntegerDivision, Floating Point Numbers andOperations
7/28/2019 I Sem CourseInfo 2011 With Questions
25/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
25
TEST SYLLABUS
Test 1: Chapters: 1, 2 Test 2: Chapters: 2, 3,4 Test 3: Chapters: 5, 6, 7
LITERATURE:
BOOK
TYPE
BOOK
NO. BOOK NAME AUTHOR
PUBLICATION INFORMATION
Edition Publisher year
TextBook
T1
Digitalelectronics
principles andapplications
Tokheim6th edition
McGrawHill
2004
TextBook
T2Computer
Organization
V.C.HamacherZ.G.Vranesic.
S.G.Zaky5th edition
McGrawHill
2002
RefBook
R1Digital logic andcomputer design
Morris Mano27th
edition
Pearsoneducation 2002
RefBook R2
Logic andcomputer design
fundamentals
Morris Manoand Charles R
Kime
2ndEdition
Pearsoneducation 2001
7/28/2019 I Sem CourseInfo 2011 With Questions
26/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
26
QUESTION BANK
1. Convert octal to decimal : 7532. Convert hexadecimal to decimal : 3E673. Explain the basic gates with diagram.4. Comment on The NAND gate as an universal gate5. Explain the purpose of inverters.6. Brief out the terms bits, bytes and nibbles.7. Explain about places values.8. Draw the diagram of gates with more than 2 inputs.
1. What is K-map?2. simplify the Boolean expression:
ABC+ABC+ABC+ABC=Y
ABC+ABC+ABC+ABC=Y3. Explain half adder.4. Explain Full adder.5. Write short notes on Parallel adder.6. Define Boolean algebra? Give out Demorgans law.7. Explain 2s complement adder/subtractor.8. Explain about binary half subtractor.9. Brief out about full subtractor.10.Explain 4 variable k-map with an example of Boolean expression.
1. Explain the functional units of a digital computer.2. Explain different registers that are available in a processor of a digital computer.3. What is a bus? How it affects the performance of a computer.4. What are the different types of computer?5. Explain basic operations of computer with the help of diagram.6. Differentiate single bus structure from multiple bus structure.
CHAPTER 1: Number systems and Logic gatesObjective: This chapter gives focus on number systems in computer system and essence ofbasic logic gates to construct logic circuits.
CHAPTER 2:Combining logic gates and arithmetic circuitsObjective: This chapter concentrates on Boolean expression, simplification of Booleanexpression and various circuits used for arithmetic operation.
CHAPTER 3: Basic Structures of Computer
Objective: This chapter gives overview about the digital computers, their types, functionunits of a computer and basic operations of a computer.
7/28/2019 I Sem CourseInfo 2011 With Questions
27/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
27
CHAPTER 4:Machine instructions & ProgramsObjective: This chapter gives overview about Memory operations, Instruction execution,branching, Addressing modes, Assembly Language and basic i/o operations.
1. Explain Byte addressability & Big-endian Assignment.2. What are assembler directives? Explain any two directives.3. What is an addressing mode? Explain different types of addressing modes.
4. What are the types of instructions?5. Explain basic input/output operation.
CHAPTER 5:Input/Output Organization
Objective: This tells how the I/O devices communicates with memory directly or indirectlythrough some supportive devices and also briefs out ports.
1. What are Interrupts?2. Explain DMA (Direct Memory Access)3. What are Interrupts? How computer handles the interrupts?4. Explain synchronous bus structure with timing diagram.5. List and explain the sequence of steps that takes place when an interrupt is received by
CPU.
CHAPTER 6: Memory SystemsObjective: This chapter gives overview about Semiconductor RAM memories, Internalmemory organization, Read only Memories, Cache and Virtual memories.
1. Explain the internal organization of 2M X 8 dynamic memory chip.2. What is cache? Explain any two cache mapping functions.3. Explain with a neat diagram how write and read operations takes place in 1K X 1 memory
chip.4. Explain different types of ROMs.5. Explain the working of Static RAM cell.6. Explain the internal organization of 16 X 8 memory chip.7. Discuss DRAM with its block diagram.
CHAPTER 7: Arithmetic UnitObjective: This chapter discusses about Addition and subtractions of signed numbers,Fast Adders, Multiplication of positive numbers, Multiplication of negative numbers, BoothsAlgorithm, Integer division, Floating point numbers and its operations.
1. Explain Carry-look ahead adder. Explain the operation of carry look ahead adder2. Explain Bit pair recoding method of multiplying two signed numbers with an example.
3. With a neat diagram explain floating point addition/subtraction unit.4. Discuss the working of a 4-bit carry look ahead adder.
-------------------------------
7/28/2019 I Sem CourseInfo 2011 With Questions
28/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
28
Introduction to UNIX
Subject code: 10MCA14 Hours/Week: 04Faculty: Mr. Chengappa B S Total Hours : 52
UNIX is vastlydifferent from other operating systems. After three decades of use, theUNIX computer operating system from Bell Labs is still regarded as one of the most powerful,versatile, and flexible operating systems (OS) in the computer world. Its popularity is due tomany factors, including its ability to run a wide variety of machines, from micros tosupercomputers, and its portability -- all of which led to its adoption by many manufacturers. Wewill learn to play with the UNIX system and acquire familiarity with some of its commands that
are used everyday for interacting with the system.
Class
NoChapter title Topics Covered
% of portion
covered
Chapter
wise
Cumul
ative
General Purpose Utilities Navigating File System and Handling
ordinary Files
20 20
1
T1:
Chapter No. 1,
2,3,4,5.
1.2,2.1-
2.9,3,4,5.1-5.12
Introduction unix operating system, features,
2 Banner, cal, date, who, printf, echo, tput, bc
3tty, sty, uname, passwd, lock, script, spell and
ispell
4The file, whats in filename? The parent-child
relationship
5 pwd, the home directory, absolute pathnames
6 The UNIX file system
7 Cat ,cp, rm, mv, more
8 Lp, file, wc, od
9 Rmdir, Relative pathnames
10 split, cmp, comm., diff
The vi editor and Basic File Attributes
24 44
11
T1:
Chapter No.
6,7,8,9,10
The three modes, input mode,
Saving, the repeat factor, command mode
12 Deletion, navigation, pattern search, joining lines
13Repeating the last command, undoing the last
editing instructions, search and replace.
14 ls l and -d option, file permissions, chmod
7/28/2019 I Sem CourseInfo 2011 With Questions
29/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
29
15Users and groups, security level,changing
permission, user masks
16 Changing ownership and group
17Interpretive cycle, Shell offerings, Pattern
matching,
18 escaping and quoting, redirection
19 Sleep and wait, while , until, for
20The here document, set, trap, sample validationand data entry scripts
21Basics, PS, internal and external commands,
running jobs in background
22Basics, PS, internal and external commands,
running jobs in background
More file attributes and Simple Filters
16 60
23
T1:
Chapter No.
11,12
System variables, profile, sty, PWD
24 aliases, command history, on-line commandediting
25 Hard link, symbolic link
26 umask, find
27 pr, head, tail
28 Cut, paste, sort
29 Uniq, tr commands
30Administartors privileges
Filter using Regular Expression and Shell Programming, Advanced
vi
24 84
31
T1:
Chapter No.
13,14,15
Grep, Regular Expression
32 Grep, Regular Expression
33 Line addressing, inserting and changing Test
34
Context addressing, writing selected lines to a
file
35The f option, substitution, properties of
Regular Expressions
36 Shell scripts, read, exit37 Example shell programs
38 Test Expression, the case conditional expr
39
Merging streams, Shell functions,exec
statement
40Operators, the ex mode, named buffers,
Numbered buffers
41Entering control characters, Searching for a
characters
7/28/2019 I Sem CourseInfo 2011 With Questions
30/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
30
42 Searching for a character
43Marking Text customising
44Vi usage
awk-Advance Filters and Advanced Shell Programming
16 100
45
T1:
Chapter No.
18,20,21
Simple awk filtering, splitting
46a line in to fields, printf, the logical and
relational operators
47 Number processing, variables, the f option
48The BEGIN and END positional parameters, get
line, built-in variables
49Arrays, functions, interface with the shell,
control flow
50 The sh command, export, cd, the command
51 Operators, the ex mode, named buffered
52Searching for a character, marking textcustomizing vi
TEST SYLLABUS:
Test 1: Chapters: 1 to 7 Test 2: Chapters: 8 to 14 Test 3: Chapters: 15, 18 to 21
LITERATURE
Book
Type
Book
No.Name Author
Publication Information
Edition Publisher Year
Text
BookT1
UNIX Concepts
and Applications
Sumitabha Das 4th
edition
Tata McGraw
Hill
2006
Text
Book T2
UNIX and Shell
programming
Behrouz A
Forouzan and
Richard F Gilberg
-
Thomson 2005
Ref.
Book R1
UNIX and shell
programming
M G
venkateshmurthy
- Pearson
education
2005
7/28/2019 I Sem CourseInfo 2011 With Questions
31/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
31
QUESTION BANK
Chapter No.1-5: General Purpose Utilities and File System
Objective: This unit begins the tour of the UNIX universe. To understand what an operatingsystem and the UNIX architecture.
1) Explain the structure of UNIX System along with block schematic.2) Mention any four communication feature commands of UNIX. Discuss each one of them
very briefly.3) Describe the architecture of UNIX O.S4) Explain the parent child relationship between various files in the organization of files in
UNIX and give the meaning of two special directory names : the dot(.) and the doubledot (..)
5) Give history of UNIX6) Mention different category of files that exist in UNIX. Discuss each one them briefly.7) What is the use of kernel in UNIX operating systems?8) How will you prevent others from using your terminal? Explain in brief.9) Explain the following commands: banner, calendar, echo, ispell each with an example.10)What is the difference between the following commands: a) cp and copy
b) cp and mv c) comm. and cmp d) comm. and diff11)Explain multi-user capability of UNIX?12)Explain tee and wc command in UNIX13)Explain echo and tput commands.
Chapter No. 6-10: The vi editor and Basic File AttributesObjective: It will explain in detail UNIX commands and will also learn vi editor. Vi uses a numberof internal commands to navigate to any point in a text file and edit the text there. the shell hasa whole set of internal commands that can be strung together as a language. A shell programruns in interpretive mode
14)What are times associated with files. Discuss their importance. Hence or otherwisediscuss how these times can be changed.
15)Write a short note on VI editor?16)Create 5 empty files empty1, empty2, empty3, empty4 and empty517)Combine the contents of file text and matter into txtmat18)List all the files in the current directory whose second character is a digit.19)Output of who should be sorted and displayed on the screen along with total number of
users. The same output should be stored in a file called file1. Construct a pipingmechanism for this.
20)Explain the command using which one can know the details of the users using thesystem currently.
21)Discuss the remainder facility available in UNIX.22)What are different modes of VI editor ? Explain23)What are the different ways a text can be inserted in Vi editor. Explain.24)Explain the command using which the arithmetic is performed in UNIX.25)What do you mean by command substitution? Explain the same with the aid of simple
example.26)How are files organized? Discuss the same with the aid of a diagram that depicts the
organizational structure.27)What do you mean by concatenating of files? Mention the command that is used for the
same and explain. Hence or otherwise write a command line that counts the totalnumber of lines on the concatenated file.
28)Explain clearly what for pipes and tees are used.
7/28/2019 I Sem CourseInfo 2011 With Questions
32/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
32
29)What do you mean by I/O redirection? With the aid of necessary illustrations explainhow redirection is accomplished in UNIX.
30)Explain tee command31)In how many modes one can work with a VI editor. Mention and discuss each one of
them briefly.32)How do you run a background process?33)List out the drawback of background process.
Chapter No. 11&12: More file attributes and Simple FiltersObjective: In this unit we will learn hard link, symbolic link and umask. It will give the
information of simple filters.34)Explain chmod command35)What are soft links and hard links. Discuss with the aid of examples.36)What are inodes. What information do they contain. Discuss.37)Explain the following commands with example: split, sort, uniq and file.38)Write a command line to search for a specific word ( say KARNATAKA ) and substitute
the word INDIA in its place over the entire file. Explain the same39)Mention at least the two most widely used special characters to construct regular
expressions. Clearly mention the special meanings associated with these characters.When do these characters loose their special meaning.
40)Write a command line using which one can obtain the long listing of a file along with itsinode number, Very briefly explain each filed of the expected output.
41)Explain the commands using which one can get into the input mode of VI editor from itscommand mode
42)With few entries write a typical profile file and explain the same.43)What is .exrc file. When and why it is used. Discuss.44)What are inodes and what are the contents of Inodes?
Chapter No.13-15: Filter using Regular Expression and Shell ProgrammingObjective: In this unit you will learn what is filter using regular expression and grep family. itprovides system administrator also known as as the super user or root user. You will learn theconcept of run levels and their role.
45)What is a grep command. Explain the families of grep command. Explain any 4 optionsof grep command with suitable example.
46)Explain sed commands with all options.47)Mention different members of grep family of commands and explain each one of them
very briefly.48)What do you mean by Daemon process. How will you kill a daemon process.49)How will you terminate a process which has gone into an infinite loop.50)Two consecutive lines are to be combined into one. Which vi command would you use to
do so.51)How are shell scripts debugged. Discuss.52)Discuss the two methods of getting input into a shell script. Illustrate the same with
examples.53)Write a shell script that reads in a message (some thing like GOOD MORNING) and
displays it ten times at regular intervals of 60 secs. .54)Write a shell script that prints out date information in the order : time day of week
number day number month year, i .e like 12.44.32 PDT MON 17 Oct 199655)Write a shell script that sends a banner THANK YOU to your screen every 40 seconds.56)Write a shell script to accept a string as command line argument and reverse it.57)Write a shell script that reads data from a text file and appends the lines starting with
an alphabet from a through k to a file name ak and the lines starting with thealhabets l through s to a file name ls and the lines between t and z into the filetz.Then display the number of the files ak ls and tz individually.
58)Write a shell script to find out whether a user whose login name passed as theparameter is currently logged in or out. If the user is logged in, send the file hellowhich is available in the current directory to his terminal.
7/28/2019 I Sem CourseInfo 2011 With Questions
33/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
33
59)What is sed instruction. Explain the following with respect to sed.60)Explain 1)Line addressing, 2) Context addressing61)What are privileges of system administrator. Discuss
Chapter No. 18, 20 & 21: awk-Advance Filters and Advanced Shell Programming
Objective: In this unit we will discuss awk command and understand special properties of awkvariables and expression how the shell uses a second to execute a shell script. When and how
commands are executed in the current shell and a sub shell.62) Explain any four built in variables of awk with examples.63) Give the general structure of an awk program. Hence or otherwise discuss the
operational mechanism of awk64) What is sed? Explain any five application of sed.65) Explain programming features supported by awk for flow control.66) Explain with an example the built in function awk.67) Explain with examples simple awk filtering.68) Write an awk sequence to find the HRA, DA and net pay of an employee, where DA is 30%
of basic, HRA is 10% of basic and net pay is the sum of HRA,DA and the basic pay withsuitable heading. files
69)With example explain the tar command.70) What is an inode. What are the contents of an inode. Explain how kernel accesses a File.71) What is fsck command. What is accomplished with this command72) What do you mean by mounting and unmounting of a file system. Explain them very
briefly.
73) Explain df and du commands.74) Who can use fsck command. What is accomplished with this command.75) Mention the commands that are used to manage disk space and explain each one of them
very briefly.
76) What are symbolic links. Explain how one can have a symbolic link to file77)
With the aid of a typical entry on a /etc/passwd file discuss the role of entries made oneach of its fields.
78) What are inodes. What information will be stored with them. Explain79) What for sticky bit is used. Who can assign this to file and how.80) How to become a super user?81) What are super users administrative privileges.82) Explain the utilities used for file system administration.83) Explain the command find? Also explain how to manage disk space.84) What are the different duties and privileges of system administration?85) Explain the usage of CPIO command with example.86) Explain the file system mounting.87) Explain the sequence of blocks organized in the UNIX file system?88) Explain the boot block in UNIX file system?89) Write short notes on internal structure of file system?90) Write a shell program that prompts the administrator for information about a new user
and creates a new entry for that user in /etc/passwd.
91) Explain how to handle multiple files.92) Explain any 5 of the advanced shell programming.
7/28/2019 I Sem CourseInfo 2011 With Questions
34/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
34
PROFESSIONAL COMMUNICATION AND ETHICS
Subject code: 10MCA15 Hours/Week: 04Faculty :Mr. V. Srikanth Total Hours : 52
Communication is the expression of facts, feelings or courses of action. Technicalcommunication discusses about all forms of communication-oral, written, formal and informal. Italso discusses about presentation strategies and various forms of group communications. Ethicstalks about the codes of conduct for a professional. It also discusses about softwaredevelopment, employer/employee issues as well as other privacy issues. In industry these skillsare required by one and all. But specially by technical writers and technical editors.
ClassNo.
ChapterNo.
Topics to be covered
% of portioncovered
Chapter wise
Cumulative
1
1Basics of Technical
CommunicationT1 : Chapter 1Page #1-19
Introduction
10 10
2 Process of Communication
3 Language as a Tool
4 Levels of Communication
5 Communication Networks
Importance of TechnicalCommunication
62
Barriers toCommunicationT1: Chapter 2Page #21-37
Definition of Noise
6 167
8Classification of Barriers
9 3Technology in
CommunicationT1: Chapter 3Page #38-69
Impact of Technology
8 24
10 Software for creating Messages
11 Software for Writing Documents
12
Software for Presenting Documents
Transmitting Documents
Effective use of Available Technology
134
Active ListeningT1: Chapter 4Page#70-78
Introduction
6 3014
Types of Listening
Traits of good Listener
15Active versus passive listening
Implications of effective listening
16
5Effective presentation
strategiesT1: Chapter 5Page# 80-111
Introduction
13 43
Defining purpose
17Analyzing Audience and Locale
Organizing Contents
18Preparing outline
Visual Aids
19
Understanding Nuances of Delivery
Understanding Nuances of Delivery(contd)
Kinesics
20
Proxemics
Paralinguistics
Chronemics
7/28/2019 I Sem CourseInfo 2011 With Questions
35/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
35
21 Sample speech
22 Sample speech(contn/..)
23
6
Group communicationT1 : Chapter 7
Page #132-166
Introduction
8 51
24Group Discussion
Organizational Group Discussion
25Group Discussion as Part of SelectionProcess
26Meetings, Conferences
277
Research paper,Dissertation and Thesis
T1: Chapter 16
Page #244-264
Introduction
8 59
28 Introduction Contd.
29 Research Paper
30
Dissertation
Thesis
31 8An Overview of Ethics
T2:Chapter1Page #1-32
What are Ethics
6 6532 Ethics in the Business World,
33Ethics in Information Technology(IT)
34 9
Ethics for ITProfessionals and IT
usersT2:Chapter 2Page#33-66
IT professionals
8 73
35 The Ethical behavior of IT professionals36 IT users
37
38 10Privacy
T2:Chapter 4Page #105-144
Privacy Protection and the Law
6 7939 Key Privacy
40 Anonymity Issues
41 11Software Development
T2:Chapter 7
Page#207-236
Strategies to Engineer Quality s/w
6 8542 Key Issues
4344 12
Employer/ Employee
IssuesT2:Chapter 8
Page#237-266
Use of non traditional workers
4 8945
Whistle Blowing
4613
Introduction to
Intellectual PropertyLaw & Indian Cyber law
T3:Chapter1:Page# 3-11
and web resource forcyber law
www.asianlaws.org/library/cyber-laws/
intro-indian-cyber-law.pdf
Intellectual property law basics,Types of Intellectual property
8 97
47Agencies responsible for Intellectualproperty registration, Internationalorganizations Agencies and Treaties
48
The increasing importance of
Intellectual property rights,Introduction to Cyber Law What iscyber law, Need for cyber law
49Jurisprudence of Indian Cyber Law,Evolution of Key terms and Concepts,Evolution of Cyber Crime
5014
Case studiesAnd Discussions
Case studies and Discussions3 100
51
52
7/28/2019 I Sem CourseInfo 2011 With Questions
36/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
36
TEST SYLLABUS:
Test 1: Chapters 1,2,3,4 Test 2: Chapters 5,6,7,8 Test 3: Chapters 9, 10,11,12,13, 14
LITERATURE:
BookType
BookNo.
Title of the BookPublication Information
Authors Publisher Edition
Textbook
T1Technical Communication-Principles
and PracticesChapters:1,2,3,4,5,7,16
MeenakshiRaman andSangeetaSharma
OxfordUniversityPress,2004
-
Textbook
T2Ethics in Information Technology
Chapters: 1,2,4,7,8George
Reynolds
ThomsonCourse
Technology,2003
2nd
TextBook
T3Intellectual Property-the law of
trademarksDeborah E
BouchouxCengageLearning,
20052nd
RefBook
R1 Effective Technical Communication
M.AshrafRizivi Tata McGraw
Hill,20051st
RefBook
R2 Ethics In Engineering
Mike WMartin
And RonaldSchinzinger
Tata McgrawHill
20073rd
7/28/2019 I Sem CourseInfo 2011 With Questions
37/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
37
QUESTION BANK
1. Describe the process of communication.2. What are the characteristics of language.3. Write a note on the levels of communication.4. Describe with suitable examples the flow of communication.5. Which are various communication networks.6. Explain the process and flow of communication with a neat diagram.
CHAPTER 2: Barriers to CommunicationObjective: This chapter talks about what noise is and classifies these barriersaccordingly.
1. What is noise?2. Which are the different types of communication barriers?3. Explain the different causes that lead to intrapersonal barriers of communication.
CHAPTER 3: Technology in CommunicationObjective: This chapter discusses about the various types of technologies available foreffective communications
1. What are the advantages and disadvantages of the use of computer packages fortechnical communication.
2. How do you create message for technical communication.3. Describe in brief LaTex and ChiWriter.4. Discuss the impact of technology on communication.5. Briefly explain the steps involved in creating messages.
CHAPTER 4: Active Listening
Objective: This chapter discusses the importance of listening.
Which are the types of listening.1. Explain about the traits of a good listener.2. What is active listening and passive listening? Explain with an example.
CHAPTER 5: Effective Presentation StrategiesObjective: This chapter discusses about how communication can be made effectiveusing various presentation strategies.
1. How do you organize the contents of a presentation.2. Which are the different modes of presentation deliveries.3. Write a note on kinesics and proxemics.4. Which are the different paralinguistic qualities.5. What are the four modes of delivery used for making presentations.6. What are paralinguistic features. Discuss their impact on your presentation.
CHAPTER 6: Group CommunicationObjective: This chapter discusses about the different types of group communications inorganization as well as a part of the selection process.
1. Which are the organizational group discussion techniques.2. Which are the various evaluation components of group discussion as part
of a selection process.3. Explain in brief how meetings and conferences should be conducted.4. Explain the different components for evaluating group discussions.5. Write short notes on Meetings.
CHAPTER 7: Research Paper, Dissertation, and Thesis
Objective: This chapter discusses about the difference between research paper,
CHAPTER 1: Basics of Technical CommunicationObjective: This chapter discusses about the process of communication, how language isa tool of communication, different levels and networks of communication
7/28/2019 I Sem CourseInfo 2011 With Questions
38/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
38
dissertation and thesis and how each of these need to be presented.1. Which are the various components of a research paper.2. Write a note on dissertation.3. How should a thesis be compiled?4. Discuss about the chief characteristics of a research paper.
CHAPTER 8: An Overview of Ethics
Objective: This chapter discusses about the professionalism in business world and IT. 1. What is ethics?2. Why is it necessary to foster good business ethics.3. What is ethical decision making.4. Explain the seven step approach for ethical decision making.
CHAPTER 9:Ethics for IT Professionals and IT UsersObjective: This chapter discusses about the codes of conduct of IT professionals and ITusers.
1. What are the benefits of a professional code of ethics.2. Which are the common ethical issues that IT users face.3. Discuss briefly the various relationships that must be managed by the IT professionals.
CHAPTER 10: PrivacyObjective: This chapter discusses about the various privacy issues.
1. What is privacy protection and the various laws.2. Which are the key privacy and anonymity Issues.3. What is the right of privacy and what is the basis for the protection of an individuals
privacy under law.4. What is safety critical system. What specific additional actions must be taken during the
development of such a system.
CHAPTER 11:Software DevelopmentObjective: This chapter discusses about the quality of software and issues related withthem
1. What is the importance of quality software.2. Describe in brief the software development process.3. Write short notes on Software quality.
CHAPTER 12: Employer/Employee IssuesObjective: This chapter discusses about the various tussles existing within theorganization. It also discusses about other employer/employee issues.
1. Write a note on contingent workers.2. What is offshore outsourcing.3. What is whistle blowing.4. List out the advantages and disadvantages of offshore outsourcing approach.
CHAPTER 13: Introduction to Intellectual Property Law &Indian Cyber LawObjective: This chapter discusses about the types of intellectual property , agencies and
treaties and the need for cyber law and its evolution.
7/28/2019 I Sem CourseInfo 2011 With Questions
39/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
39
1. What are the various types of intellectual property.2. What is cyber law.3. Discuss about the need for cyber law.4. Elaborate upon the evolution of cyber crime.5. Write short notes on Intellectual property law.
CHAPTER 14: Case studies and discussions
Objective: Here we do case studies and have discussions on various factors that have beendiscussed in the syllabus
C Programming Laboratory
Subject Code: 10MCA16 Hour/Week: 03
7/28/2019 I Sem CourseInfo 2011 With Questions
40/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
40
Faculty: Mrs.A Lekha Total Hours: 42
Part A1. a. Write a program to find the area of a triangle (Given the three sides).
b. Write a program to find the area of a circle (Given the radius).2. Write a program to find the Simple interest, given the principle, time and rate of interest
with appropriate validations.3. Write a program to find out whether a given year is a leap year or not.4. Write a program to find the roots of a quadratic equation with appropriate error messages.5. Write a program to display the following files of current directory.
i) .EXE files ii) .BAT files iii) .OBJ files iv) .BAK files.By using system DOS command.
6. Write a program to find GCD and LCM of given two numbers.7. Write a program to find the value of Sin (x) using the series.
Sin (x) = x x3/3! + x5/5! x7/7! + .8. Write a program to print all prime numbers between m and n.9. Write a program to reverse a number and check whether it is palindrome or Not.10.Write a program to generate and print first n Fibonacci numbers using function.11.Write a program to find a factorial of a given number using recursive function.12.Write a program to convert UPPERCASE alphabets to LOWERCASE alphabets in a given
string and vice-versa.13.Write a program to read two strings and concatenate them (without using library
functions).14.Write a program to read a sentence and count the number of vowels and constants.
PART - B1. Write a program to read N integers (zero, + ve and ve) into an array and find sum of
positive numbers, sum of negative numbers and average of all input numbers.2. Write a program to input N real numbers and to find the mean, variance and standard
deviation, where,
3. Write a program to input N numbers (integers or real) and store them in an array.Conduct a Linear search for a given key number and report success or failure in the formof a suitable message.
4. Write a program to sort N numbers in ascending or descending order using bubble sort.5. Write a program to accept N numbers sorted in ascending order and search for a given
number using binary search. Report success or failure in the form of suitable messages.6. Write a program to read two matrices A and B of size M x N and perform product of two
given matrices.7. Write a program to list the names of students who have scored more than 60% of total
marks in three subjects using structure variables.8. Write a program to compute the sum of two complex numbers passing a structure to a
function.9. Define a book structure having title of the book, ISBN, author, price and month and year
of publication as its members. Use a substructure to store the month and year ofPublication information. Develop a program to accept a date (in the form of monthand year) and list out all the book titles (along with price and ISBN) published duringthat date.
10.Define a student structure having the name, USN (university seat number), marks in fivesubjects, total and percentage of marks as its members. Marks of all the subjects are to
Mean = xi / N(xi mean)
2
Variance = ----------------NDeviation = variance and 0 i < n
7/28/2019 I Sem CourseInfo 2011 With Questions
41/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
41
be stored in an array. Develop a program to list the names of all the students who havefailed.
11.Write a program to read N integers and store them in an array, find the sum of all theseelements using pointer. Output the given array and the computed sum with suitableheading.
12.Write a program to read and write to a file.13.Write a program to Create and count number of characters in a file.14.Write a program to handle files with mixed data type.
Remarks
1.Algorithms are essential for the examination and practice.2.Flowcharts are desirable for practice.3.Each student has to execute two programs, one from Part A and one from Part B for the
examination.
-------
UNIX PROGRAMMING LABORATORY
Subject code: 10MCA17 Hour /Week: 03
7/28/2019 I Sem CourseInfo 2011 With Questions
42/44
Course outline Semester: I Session: Sept 2011- J an 2012
_____________________________________________________________________________________Perseverance Excellence Service
42
Faculty: Mr.B.S.Chengappa Total Hours: 42
1. a) Write a non-recursive shell script which accepts any number of arguments and prints themin the reverse order (For example, if the script is named rags, then executing rags ABC shouldproduce CBA on the standard output).b) write a shell script that accepts two file names as arguments, checks if the permissions forthese files are identical and if the permission are identical, output common permissions andotherwise output each file name followed by its permissions.
2. a. Write a shell script that takes a valid directory name as an argument and recursivelydescent all the subdirectories, finds the maximum length of any file in that hierarchy andwrites this maximum value the standard outputb) Write a shell script that accepts a path name and creates all the components in that pathname as directories for examples, if the script is named mpc, then the commandmpc.a/b/c/cd should create directions a.a/b,a/b/c,a/b/c/d
3. a) write a shell script which accepts valid log-in names as arguments and prints theircorresponding home directories, if no arguments are specified \, print a suitable errormessage.b) Writes a shell script to implement terminal locking (similar to the lock command). It shouldprompt the user for a password. After accepting the password entered by the user, it mustprompt again for the matching password as confirmation and it match occurs \, it must lock
the keyword until a matching password is entered again by the user. Note that the scriptmust be written to disregard BREAK, control D.No. time limit need be implemented for thelock duration .
4. a.) Create a script file called file-properties that reads a file name entered and outputs itproperties.b) Write a shell script that accept one or more filenames as argument and convert all of themto uppercase, provided they exist in current directory.
5. a. Write a shell script that displays all the links to a file specified as the first argument to thes
Top Related