3rd Semester Computer Science and Engineering (ACU) Question papers

of 16
ADICHUNCHANAGIRI UNIVERSITY
18DIPMAT-301
Third Semester BE Degree Examination November 2020
(CBCS Scheme)
Time: 3 Hours Max Marks: 100 marks
Sub: Additional Mathematics I
Q P Code: 60306
Instructions: 1. Answer five full questions.
2. Choose one full question from each module.
3. Your answer should be specific to the questions asked.
4. Write the same question numbers as they appear in this question paper.
5. Write Legibly
Module – 1
1 a
Express the complex number
i
i
5
1
3
1


in the form of a+ib
6 marks
b
Find the Sine of the angle between






 k
j
i
a 2
2 and






 k
j
i
b 2
2 .
7 marks
c Find the modulus and amplitude of 
 sin
cos
1 i

 7 marks
Or
2 a
If






 k
j
i
A 2
3 and






 k
j
i
B 2 then find the value of (

A +

B ).(

A -

B )
6 marks
b
Express the complex number
i
i
4
1
4
3


in the form of a+ib
7 marks
c
Find the Sine of the angle between






 k
j
i
a 2
3 and






 k
j
i
b 2 .
7 marks
Module – 2
3 a Find the nth
derivative of )
sin( b
ax  6 marks
b
Estimate
 
 
z
y
x
w
v
u
,
,
,
,


if u= x + 3y2
– z3
, v = 4x2
yz, w = 2z2
– xy
7 marks
c Find the angle between the tangent and radius vector of  

cos
1
a
r 7 marks
Or
4 a Find the nth
derivative of )
sin( b
ax  6 marks
b Find the pedal equation of the curve 
n
a
r n
n
cos
 7 marks
c If u = 𝑥 + 𝑦 + 𝑧, v= 𝑦 + 𝑧, w = 𝑧. Find 𝐽 = (
𝑢,𝑣,𝑤
𝑥,𝑦,𝑧
) 7 marks
Module – 3
5 a Find the Reduction formula for  dx
x
n
sin 6 marks
b Evaluate ∫ ∫ ∫ (𝑥 + 𝑦 + 𝑧)
1
0
1
0
1
0
𝑑𝑥. 𝑑𝑦. 𝑑𝑧. 7 marks
c
Evaluate 
1
0
.
.
X
X
dx
dy
xy
7 marks
PTO

of 16
Or
6 a Find the Reduction formula for  dx
x
n
cos 6 marks
b
Evaluate dx
dy
dz
z
y
x
c
c
b
b
a
a
.
.
)
( 2
2
2


  
  
7 marks
c
Evaluate dx
x
x .
)
1
( 2
3
2
1
0
2


7 marks
Module – 4
7 a A particle moves along the curve    k
t
j
t
i
t
r 5
2
1
)
1
( 2
3





 Find the velocity and
acceleration at any time t.
6 marks
b Show that the vector field      k
y
x
z
j
zx
y
i
yz
x
f 




 2
2
2
is irrotational. 7 marks
c
If






 k
yz
j
yz
x
i
xy
F 4
2
3
2
2 find

 F
. and


 F
7 marks
Or
8 a A particle moves along the curve    k
t
j
t
i
e
r t
3
sin
2
3
cos
2
)
( 

 
. Find the velocity and
acceleration at any time t.
6 marks
b Find the values of a, b if the vector      k
y
bxz
j
z
x
i
z
axy
f 




 2
2
3
3 is irrotational 7 marks
c
If 2
2
y
x
yj
xi
f


 , find


 F
7 marks
Module – 5
9 a
Solve x
x
y
dx
dy
cos
cot 

6 marks
b Solve 0
)
3
(
)
3
( 3
2
2
3



 dy
x
xy
dx
y
x
y 7 marks
c
Solve x
y
x
y
dx
dy 2


7 marks
Or
10 a
Solve x
x
y
dx
dy
sin
cot 

6 marks
b Solve: 0
)
2
(
)
3
4
( 2




 dy
y
x
x
dx
x
y
xy 7 marks
c Solve: 0
)
2
9
3
(
)
4
3
( 




 dy
y
x
dx
y
x 7 marks
*****

3 | P a g e
18CS32
(CBCS Scheme)
Sub: Analog and Digital Electronics
Q P Code: 60302
4. write the same question numbers as they appear in this question paper.
5. Write Legibly
Module – 1
1 a Explain with neat diagram current to voltage converter and voltage to current converter 10 marks
b With neat diagram explain comparator 6 marks
c In the case of certain opamp 0.5V change in the common mode input causes a DC o/p offset
changes of 5µV. Determine CMRR in dB
4 marks
Or
2 a Explain monostable multivibrator circuit using Timer IC 555 6 marks
b Explain Integrator and Differentiator of operational amplifier 8 marks
c Ideal and practical characteristics can be specified and problem could be asked to calculate the
value.
6 marks
Module – 2
3 a Give the simplest logic circuit for following equation where d represents don’t care conditions
for following locations.
F(A,B,C,D) =∑m(1,4,5,6,7)+d(11,15)
6 marks
b Explain the concepts of duality in digital circuits 4 marks
c Y= ∑m(0,1,5,6,8,9,10,13)+d(7,11,12) solve using Tabulation method. 10 marks
Or
4 a Simplify the following Boolean function by using QMC method
Y=∑m(0,2,3,6,7,8,10,12,13)
10 marks
b Y=πM(0,4,6,8,9,10) + dc(2,3,12). Simplify using K-Map 5 marks
c Reduce the Following function using K map
Y=πM (0,2,,8,9,12,13,15)
5 marks
PTO

4 | P a g e
Module – 3
5 a Explain BCD to decimal Decoder 10 marks
b Generate the following Boolean function using PAL
Y4=∑m(0,1,4,9)
Y3=∑m(0,1,5,6,7)
Y2=∑m (2,4,5,8,9)
Y1=∑m (3,7,11)
10 marks
Or
6 a What is multiplexer? Design 16:1 mux using 2:1 mux 6 marks
b Implement Y=∑m(0,2,3,4,5,8,9,10,11) using 8:1 Mux 6 marks
c Design 7 segment decoder using PLA 8 marks
Module – 4
7 a Explain Serial in Parallel out register 10 marks
b Explain the working of JK MSFF along with implementation using NAND gates 10 marks
Or
8 a Explain Ring counter and Johnson Counter in detail 10 marks
b Write HDL implementation for D Flipflop 4 marks
c Give state transition diagram and characteristic equation for JKFF 6 marks
Module – 5
9 a Explain Decade counter in detail 6 marks
b Explain 4bit binary ladder 6 marks
c Explain 2 bit Simultaneous A/D conversion method 8 marks
Or
10 a Design mod 8 counter as a synthesis Problem using JKFF 12 marks
b Write HDL implementation for mod 8 up counter 4 marks
c What are the output voltages caused by each bit in 5-bit ladder if input levels are 0=0V and
1=+10V
4 marks
*****

Page | 5
18EC33
(CBCS Scheme)
Sub: Computer Organization and Architecture
Q P Code: 62303
5. Write Legibly
Module – 1
1 a Explain function of Processor Registers with a neat block diagram. 10 marks
b What are the functions of system software 10 marks
Or
2 a Explain the three number representation formats in a computer with an example.
What decimal value does the binary word 1010 1111 0101 0100 have when it represents
i. unsigned integer
ii. 1’s complement integer
iii.2’s complement integer
iv. sign-magnitude integer.
10 marks
b Explain Big-Endian and little Endian schemes. Show how can a 32-bit word and 64 bit word
can be stored in memory
10 marks
Module – 2
3 a What is an assembler? Explain functions of assembler directives with examples 10 marks
b Define addressing modes? Explain any five addressing modes with an example for each. 10 marks
Or
4 a Explain interfacing of Keyboard and Display using program controlled I/O 10 marks
b Explain Parameter passing to subroutines, with suitable example. 10 marks
Module – 3
5 a Explain data transfer using Interrupt I/O method 10 marks
b Describe two methods of handling interrupts from multiple devices 10 marks
PTO

Page | 6
Or
6 a Write a note on bus arbitration 10 marks
b Write a note on working of 2 channel DMA controller 10 marks
Module – 4
7 a Explain the organization of bit cells in a memory chip. Describe how a 1K x 1 memory chip
is organized internally
10 marks
b Define ROM. Explain various types of ROM 10 marks
Or
8 a Describe the terms : Latency, Bandwidth, locality of reference, mapping function and
replacement algorithm, with reference to cache memory
10 marks
b Discuss how read and write operations are carried out in cache memory 10 marks
Module – 5
9 a Explain Single Bus organization of datapath inside a processor 10 marks
b Write a note on multiple bus organizations and its advantages 10 marks
Or
10 a Explain in detail and with necessary step involved in execution of instruction
Add(R3), R1
10 marks
b With a neat block diagram explain
i) Basic organization of microprogrammed control unit
ii) Organization of Control unit to allow conditional branching in the micro program
10 marks
*****

Page | 7
18CS33
(CBCS Scheme)
Sub: Data Structures using C
Q P Code: 60303
5. Write Legibly
Module – 1
1 a List and explain the Operations that can be performed on arrays? 8 marks
b What is polynomial? What is the degree of polynomial? Write a function to add two
polynomials.
8 marks
c What is primitive and non primitive data structures with example. 4 marks
Or
2 a List and explain the different types of dynamic memory allocation functions with syntax and
suitable examples.
10 marks
b Differentiate between Structure and Union with example. 6 marks
c Define the following:
i. Pointer constants
ii. Pointer values
iii. Pointer variable
iv. Dangling pointer
4 marks
Module – 2
3 a Write the postfix form of the following expression using stack.
i) a $ b * c – d – e f ( g + h)
ii) a- b ( c * d $ e)
6 marks
b What is recursion? What are the various types of recursion? 6 marks
c Implement addq and delete functions for the circular queue. 8 marks
Or
4 a Define Queue. Give the C implementation of insert and delete element from a queue. 7 marks
b Write a C program to implement Tower of Hanoi problem using recursive function. 6 marks
c Give a node structure for the sparse matrix. Write a linked representation for the given sparse
matrix?
A=
[
2 0 0 0
4 0 0 3
0 0 0 0
8 0 0 1
0 0 6 0]
7 marks
PTO

Page | 8
Module – 3
5 a Write a C program to implement insertion and deletion operation on queue using linked list. 10 marks
b Define stack. Give the C implementation of PUSH and POP operation using stack. 7 marks
c Define linked list. List its types. 3 marks
Or
6 a Write a C program to implement QUEUE operations using single linked list. 10 marks
b Differentiate between single linked list and double linked list. 6 marks
c For the given sparse matrix and its transpose, give the triplet representation, A is the given
sparse matrix, B will be its transpose
A=
[
11 0 0 0 0 0
0 0 3 −2 0 24
0 7 0 −6 0 0
34 0 0 0 0 0
0 0 0 0 0 0
0 16 0 0 0 0 ]
4 marks
Module – 4
7 a
1) What is Binary tree? State its properties. How it is represented using array and linked list.
Give example.
10 marks
b Define Traversals. What are the different traversal techniques of a binary tree explain with
its Functions.
10 marks
Or
8 a Describe binary search tree with an example. Write a recursive function to search for a key
value in a binary search tree.
10 marks
b Draw the binary search tree for the following list 14, 15, 4, 9, 7, 18, 3, 5, 16, 4, 20, 17, 9, 14,
5.
7 marks
c What are the applications of Trees? 3 marks
Module – 5
9 a Define Graph? What are the different methods of representing a graph? Give example. 8 marks
b What is DFS? Briefly explain the traversal of DFS with example. 6 marks
c Write a short note on Static and Dynamic hashing. 6 marks
Or
10 a What is Hashing function and what are its types explain with example. 8 marks
b What are the basic operations that can be performed on files? Explain briefly 8 marks
c Write a brief note on Elementary graph operation. 4 marks
*****

9 | P a g e
ADICHUNCHANAGIRI UNIVERSITY 18CS34
BE Third Semester Examination November 2020
(CBCS Scheme)
Sub: Discrete Mathematical Structures
Q P Code: 60304
2. Choose one full question from each module
5. Write Legibly
Module – 1
1 a Determine whether the following compound statements are tautology or not.
(i) [(p→ 𝑞) ∧ (𝑞 → 𝑟)] → (𝑝 → 𝑟)
(ii) [(𝑝 ∨ 𝑞) ∧ (𝑝 → 𝑟) ∧ (𝑞 → 𝑟) → 𝑟
7 marks
b Prove the logical equivalence by using laws of logic.
(p→ 𝒒)⋀[¬𝒒⋀(𝒓 ∨ ¬𝒒)] ⇔ ¬(𝒒⋁𝒑)
6 marks
c Establish the validity of the following arguments.
𝑝
𝑝 → 𝑟
𝑝 → (𝑞 ∨ ¬𝑟)
¬𝑞 ∨ ¬𝑠
∴ 𝑠
7 marks
Or
2 a Verify the principle of duality for the following logical equivalence
[¬(𝒑 ∧ 𝒒) → ¬𝒑 ∨ (¬𝒑 ∨ 𝒒)] ⇔ (¬𝒑 ∨ 𝒒).
6 marks
b Establish the validity of the following argument
𝒑 → 𝒒
𝒒 → (𝒓⋀𝒔)
¬𝒓 ∨ (¬𝒕 ∨ 𝒖)
𝒑⋀𝒕
∴ 𝒖
7 marks
c (i) Define open sentence and quantifiers with an example each.
(ii) Negate and simplify the following:
(a) ∀𝑥[𝑝(𝑥)⋀¬𝑞(𝑥)]
(b) ∃𝑥[𝑝(𝑥)⋁𝑞(𝑥)] → 𝑟(𝑥)
7 marks
PTO

10 | P a g e
Module – 2
3 a Using mathematical induction,
Prove that 4n< (n2
-7) for all positive integer n≥6.
6 marks
b For the Fibonacci sequence F0, F1, and F2...
Prove that Fn=
1
√5
[(
1+√5
2
)
𝑛
− (
1−√5
2
)
𝑛
].
7 marks
c Find the number of arrangement of the letters in TALLAHASSEE which have no
adjacent A’s
7 marks
Or
4 a Find an explicit formula for an=an-1+an, a1=4 for n≥2. 6 marks
b Prove∑
1
𝑖(𝑖+1)
𝑛
𝑖=1 =
𝑛
𝑛+1
∀𝑛 ∈ ℤ+
. 7 marks
c Find the coefficient of a2
b3
c2
d5
in the expansion of (a+2b-3c+2d+5)16 7 marks
Module – 3
5 a Determine whether or not each of the following relations is a function. If a relation is
a function, find its range.
(i) {(x,y) | x,y ∈ R, y=3x+1}, a relation from R to R
(ii){(x,y) | x,y ∈ Q, x2
+ y2
=1}, a relation from Q to Q.
6 marks
b If f: R → R is defined by, f(x)= x2
+5 find f-1
({6}),f-1
([6,7]), f-1
([-4,5]),
f-1
([6,10]), f-1
([5,∞)).
7 marks
c
Let f: R → R be defined by, f(x)={
3𝑥 − 5, 𝑥 > 0
−3𝑥 + 1, 𝑥 ≤ 0
Find f-1
(-10), f-1
(0), f-1
(4) also determine pre images under f for
each of the following intervals: [-5,-1], [-5,0],
7 marks
Or
6 a Define the Cartesian product of two sets. For any three non empty sets A, B, C
Prove that (i) A x (B-C) = (AxB)-(AxC) (ii) A x (B∩C) = (AxB) ∩ (AxC)
6 marks
b Let f: R → R, g: R → R be defined by f(x)=x2
and g(x)=x+5.
Determine f∘g and g∘f.
6 marks
c
Let f: R → R is defined by, f(x) ={
𝑥 + 7, 𝑥 ≤ 0
−2𝑥 + 5, 0 < 𝑥 < 3
𝑥 − 1, 𝑥 ≥ 3
Find f-1
(-10), f-1
(0), f-1
(4) and also determine pre images under f for each of the
following intervals: [-5,-1], [-5,0], [-2,4]).
8 marks
Module – 4
7 a For A={a,b,c,d,e}, the Hasse diagram for the poset (A,R) is shown below: 6 marks
b Let A={1,2,3,4} and let R the relation defined by R={(x,y)|x,y∈A, x≤y}.
Determine whether R is reflexive, symmetric, antisymmetric or transitive.
6 marks
c In how many ways can the 26 letters of the English alphabet be performed so that none of the
letters CAR,DOG,FUN,BYTE occurs?
8 marks

11 | P a g e
Or
8 a Let A={1,2,3,4,6,8,12} and R be the partial ordering on A defined by aRb
if a divides b then
i) Draw the Hasse diagram of the POSET(A,R)
ii) Determine the relation matrix for R
iii) Topologically sort the Poset (A,R)
8 marks
b Define an equivalence relation and equivalence class with an example. 4 marks
c In how many ways can one arrange the letters in the word CORRESPONDENTS so that
i)There is no consecutive identical letters?
ii)There is exactly 2 pairs of consecutive identical letters?
iii)There are at least 3 pairs of consecutive identical letters?
8 marks
Module – 5
9 a Define and give an example for each of the following
i) Graph
ii) Directed Graph and Undirected Graph
iii) Walk, Open and Closed Walk
iv) Trail and Circuit
6 marks
b Show that the following graphs are isomorphic. 6 marks
c Obtain an optimal prefix code for the message MISSION SUCCESSFUL indicate the code. 8 marks
Or
10 a Discuss Konisberg bridge problem and the solution of the problem. 6 marks
b Prove that in every graph, the number of vertices of odd degree is even 6 marks
c Define prefix code. Obtain an optimal prefix code for the message
ROAD IS GOOD indicate the code
8 marks
****

of 3
18MAT31
(CBCS Scheme)
Sub: Engineering Mathematics - III
Q P Code: 60301
5. Write Legibly
Module – 1
1 a Find the Laplace transform of 𝑡𝑐𝑜𝑠𝑎𝑡 6 marks
b
A periodic function f(t) of period a , a > 0 is defined by 𝑓(𝑡) = {
𝐸 0 < 𝑡 < 𝑎/2
−𝐸
𝑎
2
< 𝑡 < 𝑎
Show that 𝐿[𝑓(𝑡)] =
𝐸
𝑠
𝑡𝑎𝑛ℎ(
𝑎𝑠
4
).
7 marks
c Solve the differential equation
𝑑2𝑦
𝑑𝑡2 + 4
𝑑𝑦
𝑑𝑡
+ 3 y = 𝑒−𝑡
with y ( 0 ) = 1 = 𝑦′
( 0 ) using
Laplace transforms.
7 marks
Or
2 a Find 𝐿−1 [ 𝑙𝑜𝑔 (
𝑠+𝑎
𝑠+𝑏
) ] 6 marks
b
Express 𝑓(𝑡) = {
𝑠𝑖𝑛𝑡, 0 < 𝑡 < 𝜋
𝑠𝑖𝑛2𝑡, 𝜋 < 𝑡 < 𝜋
𝑠𝑖𝑛3𝑡 , 𝑡 > 2𝜋
in terms of unit step function and hence find their Laplace transform f (t)
7 marks
c Using Convolution theorem obtain inverse transformation of
𝑠
(𝑠2+ 𝑎2)2
7 marks
Module – 2
3 a Find the Fourier series for the function 𝑥2
in −𝜋 ≤ 𝑥 ≤ 𝜋 . 6 marks
b
Find half range sine series of f(x)= {
𝑥 0 < 𝑥 < 𝜋/2
𝜋 − 𝑥 𝜋/2 < 𝑥 < 𝜋
7 marks
c Express y as a Fourier series up to the first harmonic given.
𝑥0 0 60 120 180 240 300 360
y 7.9 7.2 3.6 0.5 0.9 6.8 7.9
7 marks
PTO

of 3
Or
4 a Find the Fourier series for the function
𝜋−𝑥
2
in 0 < 𝑥 < 2𝜋 .
Hence deduce
𝜋
4
= 1 −
1
3
+
1
5
-
1
7
……
6 marks
b Expand f (x) = 2𝑥 − 𝑥2
as a cosine half range Fourier series in 0 < x < 2 7 marks
c Obtain constant term and the coefficients of the first sine and cosine terms in the Fourier
expansion of y from the table
x 0 1 2 3 4 5
f(x) 4 8 15 7 6 2
7 marks
Module – 3
5 a
Find the Fourier transforms of 𝑓(𝑥) = {
1 𝑓𝑜𝑟 |𝑥| ≤ 𝑎
0 𝑓𝑜𝑟 |𝑥| > 𝑎
Hence evaluate ∫
𝑠𝑖𝑛𝑥
𝑥
∞
0
dx
6 marks
b Find cosine transform of f(x) = 𝑒−𝛼𝑥
, 𝑓𝑜𝑟 𝛼 > 0 7 marks
c Solve the difference equation 𝑦𝑛+2 − 4𝑦𝑛 = 0, 𝑤𝑖𝑡ℎ 𝑦𝑜 = 0, 𝑦1 = 2. by using z transform 7 marks
Or
6 a Find the Fourier sine transform of 𝑒−|𝑥|
. Hence show that ∫
𝑥𝑠𝑖𝑛𝑚𝑥
1+𝑥2 .
∞
0
dx =
𝜋
2
𝑒−𝑚
, m > 0 6 marks
b Obtain the Z-transform of (n + 1) 2 7 marks
c Obtain the inverse Z-transform of
𝑧
(𝑧−1)(𝑧−2)
7 marks
Module – 4
7 a Employ Taylor’s method to find y at x=0.1 given
𝑑𝑦
𝑑𝑥
=𝑥2
+ 𝑦2
,y(o)=1 6 marks
b Using fourth order Runge – kutta method to find y at x = 0.1
given that
𝑑𝑦
𝑑𝑥
= 3𝑒𝑥
+ 2y , y( 0 ) = 0 , taking h = 0.1
7 marks
c Given that
𝑑𝑦
𝑑𝑥
= x – y2
and the data y(0) = 0, y(0.2) = 0.02, y(0.4) = 0.0795 , Y(0.6) = 0.1762,
find y(0.8) by using Adam- Bashforth method.
7 marks
Or
8 a Using modified Euler’s method find y(0.2) given that
𝑑𝑦
𝑑𝑥
= x – y2
with y(0) =1 taking
h=0.1.
6 marks
b Solve : ( 𝑦 − 𝑥 )𝑑𝑥 = (𝑦 + 𝑥)𝑑𝑦 𝑓𝑜𝑟 𝑦 (0.2) given that 𝑦 = 1 𝑎𝑡 𝑥 = 0 initially, taking
h=0.1. by applying Runge-Kutta Method of order 4.
7 marks
c Apply Milne’s Predictor and Corrector formula to compute y(0.4) given
𝑑𝑦
𝑑𝑥
=2𝑒𝑥
− 𝑦
with
x 0 0.1 0.2 0.3
y 2 2.010 2.040 2.090
7 marks

of 3
Module – 5
9 a Find y(0.1) by using Runge-Kutta method of 4th
order,
given .
0
)
0
(
1
)
0
(
,
1
2
2








 y
and
y
xy
y
x
y
6 marks
b
Find the extremal of the functional ∫ ( 𝑦2
− 𝑦′2
− 2𝑦𝑠𝑖𝑛𝑥)
𝜋
2
0
dx with y(0) = 0 ,y(
𝜋
2
) = 1
7 marks
c A heavy cable hangs freely under gravity between two fixed points. Show that the shape of the
cable is a catenary.
7 marks
Or
10 a Apply Milne’s method to solve y
y
y 



 2
1 given the following table of initial values
Compute y (0.8) numerically
X 0 0.2 0.4 0.6
Y 0 0.02 0.0795 0.1762
𝑦′ 0 0.1996 0.3937 0.5689
6 marks
b Derive Euler’s equation in the Standard form
𝜕𝑓
𝜕𝑦
-
𝑑
𝑑𝑥
(
𝜕𝑓
𝜕𝑦′
) = 0 7 marks
c Prove that the shortest distance between two points in a plane is a straight line joining them. 7 marks
*****

15 | P a g e
18CS35
(CBCS Scheme)
Sub: Unix and Shell Programming
Q P Code: 60305
5. Write Legibly
Module – 1
1 a Describe the features of the UNIX . 10 marks
b Explain the following commands with suitable examples:
i. cal and who
ii. echo and printf.
10 marks
Or
2 a With the help of examples, explain the knowing the user terminal, displaying its
characteristics and setting characteristics.
10 marks
b i. Differentiate between internal and external commands.
ii. Discuss the significance of the /etc/passwd and /etc/shadow files.
10 marks
Module – 2
3 a List and explain the basic categories of files. 10 marks
b Explain the directory commands used in the UNIX. 10 marks
Or
4 a Write the UNIX command for the following:
i. List all the files in print working directory which are having exactly 5 character in
their filename and any number of characters in their extension.
ii. To copy all files stored in /home/bgsit/cs with .c ,.cpp and .java extensions to progs
directory in the current directory.
iii. To delete all files containing .c,.html,.js and .pl in their filename extensions.
iv. To remove all file with three-character extension except .out from the current
directory.
10 marks
b Explain the ls command and its options. 10 marks
Module – 3
5 a Explain how you can switch from one mode to another mode in vi editor. 10 marks
b Illustrate how Input and output redirection works in UNIX standard files. 10 marks
PTO

16 | P a g e
Or
6 a List and explain shell wild cards of UNIX with examples. 10 marks
b Explain the features of the pipe and tee command with suitable examples. 10 marks
Module – 4
7 a Write a shell script to accept an option from the terminal and to display the following menus.
MENU
1. List of files
2. Processes of user
3. Today’s Date
4. Quit to UNIX
10 marks
b Explain the shell features of while and for control statements with syntax. 10 marks
Or
8 a Explain the following commands with suitable examples.
i. cut
ii. paste
iii. sort
iv. umask
10 marks
b Describe the significance of hard links and symbolic links in UNIX. 10 marks
Module – 5
9 a Explain the mechanism of process creation and also given the details about ps command
with its options.
10 marks
b Explain string handling function in perl with examples. 10 marks
Or
10 a Explain the following perl script functions with suitable examples:
i. push ( ) and pop ( )
ii. split ( ) and join ( )
10 marks
b Briefly explain the following:
i. Cron and corntab
ii. Associative arrays.
10 marks
*****

3rd Semester Computer Science and Engineering (ACU) Question papers

Recommandé

Recommandé

Contenu connexe

Tendances

Tendances (20)

Similaire à 3rd Semester Computer Science and Engineering (ACU) Question papers

Similaire à 3rd Semester Computer Science and Engineering (ACU) Question papers (20)

Plus de BGS Institute of Technology, Adichunchanagiri University (ACU)

Plus de BGS Institute of Technology, Adichunchanagiri University (ACU) (20)

Dernier

Dernier (20)

3rd Semester Computer Science and Engineering (ACU) Question papers