Download - Alagappa University

DE–1979
13
DISTANCE EDUCATION
M.Sc. (Software Engineering) (5 Years Integrated) DEGREE EXAMINATION, MAY
2011.
DIGITAL COMPUTER FUNDAMENTALS
Time : Three hours
Maximum : 100 marks
SECTION A — (5  8 = 40 marks)
Answer any FIVE of the following.
All questions carry equal marks.
1.
Convert the following :
(a)
(456)10 = (?)2
(b)
(0.786)10 = (?)2
2.
Mention the uses of complements.
3.
State and prove De Morgan’s theorem.
4.
Give the purpose of Multiplexer.
5.
How to represent the negative numbers in ALU?
6.
Explain the technique of constructing Half Adder.
7.
Mention the uses of Shift Registers.
8.
How data is stored and accessed in computer memory?
SECTION B — (4  15 = 60 marks)
Answer any FOUR questions.
All questions carry equal marks.
9.
Explain the technique of converting Octal numbers into Hexadecimal numbers.
Discuss with examples.
10.
Mention the concepts and laws in Boolean Algebra.
11.
Simplify the expression
S  ABCD  ABCD  ABCD  ABCD
using Karnaugh mapping.
12.
How parallel Binary adder performs its job?
13.
Discuss the working style of JK flip flop.
1
DE–878
14.
What are the different generations of computers? Discuss its classifications.
15.
Explain the following Input Output devices :
(a)
Keyboard
(b)
Printer.
———————
DE–1980
14
DISTANCE EDUCATION
M.Sc. (Software Engineering) (5 Year Integrated) DEGREE EXAMINATION, MAY
2011.
C AND DATA STRUCTURES
Time : Three hours
Maximum : 100 marks
SECTION A — (5 × 8 = 40 marks)
Answer any FIVE of the following.
All questions carry equal marks.
1. How constants and variables are declared and used in C? Explain with examples.
2.
Explain the execution of switch statement with an example.
3.
Define recursion. With an example, discuss the usage of it.
4.
How to define and initialize a two dimensional array?
5.
Give the usage of pointers.
6.
How to open and close a data file?
7.
Discuss the following operations in a stack
(a) PUSH (b) POP.
8.
What is a binary tree? How to represent it?
SECTION B — (4 × 15 = 60 marks)
2
DE–878
Answer any FOUR questions.
All questions carry equal marks.
9.
Mention the different data types and operators supported in C.
10.
Write a program in C to find the average of N integers (where N is an input
value).
11.
Explain the concept of preprocessor in C.
12.
Write
a
program
order (3  3).
13.
Explain the concept of dynamic memory allocation.
14.
How elements are added, deleted and searched in a queue? Explain with
examples.
15.
How to represent list as binary trees? Discuss the applications of trees.
in
C
to
multiply
two
matrices
of
————————
DE–1981
15
DISTANCE EDUCATION
M.Sc.(Software Engineering (5 year integrated)) DEGREE EXAMINATION, MAY
2011.
DISCRETE MATHEMATICS
Time : Three hours
Maximum : 100 marks
SECTION A — (5  8 = 40 marks)
Answer any FIVE questions.
1. Explain atomic and molecular statements by giving examples.
2.
Define union, intersection and relative complement with regard to sets by
giving examples.
3.
Let X  {1, 2, ........, 7} and
R  {  x , y  /( x  y) is divisible by 3}.
Show that R is an equivalence relation. Draw the graph of R.
3
DE–878
4.
Define one-to-one and onto functions by giving examples.
5.
Explain the properties of Algebraic systems.
6.
Define homomorphism of semigroups and monoids by giving one example for
each.
7.
Explain Graphs and isomorphic graphs. Give one example for each.
8.
Explain the Konigsberg bridge problem and its solution.
SECTION B — (4  15 = 60 marks)
Answer any FOUR questions.
9.
Explain the various connectives in mathematical logic by giving examples.
10.
(a)
Explain tautology and contraction by giving examples.
(b)
Show that
((P  Q) 
( P ( Q
 ( P  Q)  ( P 
R)))
R) is a tautology.
11.
Explain the properties of binary relations on a set.
12.
(a)
Define invertible functions. Give an example.
(b)
If f : X  Y and g : Y  X are functions, then prove that g  f 1 iff
g  f  I X and f 1  g  IY .
13.
Explain in detail Hashing functions by giving examples.
14.
(a)
Define group. Give any two examples.
(b)
Explain Cosets and Lagrange’s theorem.
15.
Explain the use of MINIMA algorithm, to determine the minimum lengths of
paths.
————————
DE–2131
16
DISTANCE EDUCATION
M.Sc. (Software Engineering) (5 Years Integrated) DEGREE EXAMINATION, MAY
2011.
4
DE–878
LAB I — C PROGRAMMING LAB
Time : Three hours
Maximum : 100 marks
ONE question to be selected by lot system.
Each sub division carries 50 marks.
1. (a)
string.
(b)
Write a C program to count number of vowels and consonants in a given
Write a C program to sort ‘N’ integers.
Cut here
2.
(a)
Write a program using function to calculate n Pr  n n  r .
(b)
Write a C program to find the Roots of the equation ax 2  bx  c  0 .
Cut here
3.
(a)
Write a C program to find the individual digit sum of a given number
(for example : 1234  1  2  3  4  10 )
(b)
Write a C program to multiply two matrices also provided compatibility
check for multiplication.
4.
(a)
Write a C program to read 10 values to an array variable. Use pointer to
locate and display each value.
(b)
Write a C program to implement all string operations.
Cut here
5.
(a)
Write a C program to the find the area of a triangle using area =
S S  A S  B S  C  where S   A  B  C  / 2 .
(b)
Write a C program to convert a given number into words.
Cut here
6.
(a)
Write a C program to arrange the given 10 names in alphabetical order.
(b)
Write a C program to calculate simple interest and compound interest
using function declaration.
Cut here
7.
(a)
Write a C program to find whether the given string is palindrome or not.
Eg. MALAYALAM.
(b)
Develop
a
C
program
to
arrange
the
10 numbers in ascending and descending order.
5
DE–878
given
list
of
Cut here
8.
(a)
Write a C program to find the factorial of a given number using
recursion.
(b)
Write a C program to find Armstrong numbers, between 101 and 999.
(hint : 153  13  53  33 is an Armstrong number)
————————
DE–2132
17
DISTANCE EDUCATION
M.Sc. (Software Engineering) (5 Years Integrated) DEGREE EXAMINATION, MAY
2011.
DATA STRUCTURES LAB
Time : Three hours
Maximum : 100 marks
One question should be given to each candidate by lot system.
Each subdivision carries 50 marks.
1. (a)
Write a ‘C’ program to sort 10 Nos. in Ascending order with naming of
variables and the value before and after sorting.
2.
(b)
Write a ‘C’ program to implement push and pop operations on stack.
(a)
Write a ‘C’ program
sort a set of elements using insertion sort.
Cutto
here
(b)
Write a ‘C’ program to copy contents of one file to another file.
Cut here
3.
(a)
Write a ‘C’ program to sort a set of elements using selection sort.
(b)
Write a ‘C’ program to implement insert and delete operations on queue
using array concept.
4.
(a)
Write a menu driven program in ‘C’ to find an element using linear and
binary search method.
(b)
Write a ‘C’ program to implement insert and delete operations on queue
using array concept.
6
DE–878
Cut here
5.
(a)
Write a ‘C’ program for linked list implementation of queue operations.
(b)
Write a ‘C’ program to implement push and pop operations on stack.
Cut here
6.
(a)
Write a ‘C’ program to copy contents of one file to another file.
(b)
Write a menu driven program in C to find an element using Linear and
binary search methods.
Cut here
7.
(a)
Write a C program to evaluate the given mathematical expression using
stack.
(b)
Write a C program to sort a set of elements using insertion sort.
Cut here
8.
(a)
Write a C program to evaluate the given mathematical expression using
stack.
(b)
Write a ‘C’ program to sort 10 Nos. in ascending order with naming of
variable and the value before and after sorting.
——————
7
DE–878