DSTL, DS, COA, Python Previous Sessional 2 Paper
DSTL, DS, COA, Python Previous Sessional 2 Paper
CO - 3: Apply propositional caculus, predicates, and inference rules to solve problems of theory of logic.
CO - 4: Explore knowledge of algebraic structures to solve advanced technological problems.
Q4 Attempt three parts of (medium answer type) question. Each part is of six marks. (3 x 6= 18 Marks)
(a) Define a binary operation * on the set of positive rational numbers Qt as
a*b:= ab/3, for a, b E Q.
(b) Justify that the group U4 ={1,-1, i,-i} of the fourth roots of unity is cyclic group. Also, find all its
generators. (K3)
(c) Show that the intersection of two subgroups of a group Gis also a subgroup. Give an example of two
subgroups of a group such that their union is not a subgroup. (K3)
(d) Let Gbe a finite group, and H be a subgroup of G. Justify that |H| divides |G|. (K3)
(e) Justify that the subgroup K;= {e, (132), (123)} of the group S; is anormal subgroup. (K3)
MPERT INSTITUTEOF ENGINEERING AND
NII-58, Delhi-Roork.e TEGHNOAOGY
llighway, Baghpat Rod, Mcerut -250 00S U.P.
Second Sessional Examination: Odd Semester 2022-23
D Tech-CSE an.|
abject Name Alled Branches Semeter :III
. "jet Code
Computer Arehieeture and Organization Mas. Marks :60
: KCS302
I. cO-2 Time :120 min
: To Apply the basic-I.-gic for
arithmctic & logic unit design and summarize the
Noating && fixed points arithnmeti.. operations.
(03 : To understand the c ntrol unit (K2, K3)
vompute diflierent p1pcline echniques. (K2, K3) techniques & microprogramnming controls and
Co.4 :. To Understand the hic:archical memory systems and correlate the cache and virtual
emory. (K2, KA)
What is diference between sequential (lincar) Search and binary scarch (2 x 612 Marks)
technique? (K2 Level)
Wite ashort note on indexed sequential search. (K2 Level)
c) What do you mean by hashing?
(K2 Level)
Explain process of radix sort with example. (K2 Level)
Differentiate between linear and quadratic probing techniques.
(K2 Level)
9 Explain any two type of hash function. (K2 Level)
) Write down the complexity of bubble, quick and merge sort.
(K2 Level)
Q.4: Attempt any THREEquestions (Medium Answer Type). Each question is of 6 marks.
a) Write aC program for merge sort and apply on following (3 x6=18 Marks)
67, 22, 87 for sorting the elements in ascending order. elements 45, 32, 65,76, 23, 12, 54,
b) What is selection sort? Sort the given values (K3 Level)
using selection sort; present all stepsfiterations:
38, 81,22,48, 13, 69, 93, 14, 45, 58, 79, 72.
- Ahash function H defined as H (key) (K3 Level)
=key%7, with linear
37, 38, 72, 48, 98, 11, 66 intoa table indexed from 0 to probing, used to insert the key
is
6.
11? Justify your answer , also count the total number of What will be the location of key
Level)HOT collisions in this probing (BKL :K3
Vd) Write a program for binary search using recursion. (BKL :K3
v) Write a C program for Quick sort. (BKL :K3 Level)
Level)
Roll No.: .....«.
12
123
1234
12345
rExplain built in list functions: lis(), len(), max(), append(0, extepa) with a suitable example (BKL = K3
Levei).