Professional Documents
Culture Documents
No.
BIT-252 205 o
B.Tech
(SEM-IV) EVEN SEMESTER
2023-2024
MINOR TEST (EXAMINATION) Architecture
and
Subject Name: Computer OIganization
Max Marks: 10
Times: 1Hrs.
Technologv)
B. Tech. (information
Semester: 4th
Year:I1nd
2022-2023
Minor Test-!I (Examination):
Python Programming
Max Marks: 10
Time: 1 Hr.
marks.
Note: Attempt ALL questions. ALL questions carry equal
following. 2. 1(a) is Marks CO BL PO PI
Q1. Atempt any Two parts of the Code
compulsory. CO3 LI,2 1,2
( Discuss file handling in python. Write
a) a py- 1.4.1
b) What is pie chart? How can you create pie chart CO4 L2,4,6 1.4.1
in matplotlib? Write a python code to plot a pie
chart with different colours for different slices.
What is Machine Learning? What are the types of 2 CO4 L1,2 14.1
Machine Learning? Explain all with the help of
an example.
Bl- Bloom's Taxonomy Levels (1-
Remembering, 2- Understanding, 3 - Applying, 4 -Analysing, 5 - Evaluating, 6 -
Creating)
CO - Course Outcomes
PO - Program Outcomes
PICode-
Performance Indicator Code
RollNo.
BIT-253 2
B.Tech
(SEM-IV) EVEN SEMESTER
(EXAMINATION) 2023-2024
MINOR TEST Network
Subject Name: Computer
Max Marks: 10
Times: 1Hrs.
(c) What is multivalued dependency (MVD)? llustrate the fourth and fifth normal form with a
suitable example. 2
Q2. Attempt any two parts of the following. Q2 (a) is compulsory.
0What do you mean by schedule in the context of concurrent execution of transactions in
RDBMS? Describe the conflict and view serializability with a suitable example. 3
(b) What is concurrency control? Describe the two-phase locking protocol(2PL)along with its
limitations. 2
What is Multiple granularity? Describe with a suitable example. 2
AUC 10
Roll No. 26
Subject Code
B.Tech.
Year: Semester: IV
Examination): 2022-23
Test -2(Minor
Optmization Techni-ues
Title of Subject:
Max Marks: 10
Time: 1 Hrs.
question carries equal marks
Note: Attempt ALL qucstions. Each
is compulsory. Ma CO BL PO P!
Q1. Attempt any two parts of the follow ing. Q1(a) rks Code
unconstrained 3 2.3 i.
a) Explain properly the procedure to solve the
Geometric minimization problem.
2 2 3
b) Optimize the geometric problem:
Minimize f(X) = 7 x,x +? 2 +5 X x, X3
x;>0, i= 1,2,3.
c) 2 2
Write the geometric dual of the given problem:
Minimize f(X) =
-1/2
X1X7 x3+2 xfx, X3 + 2 x X, X, +3 x4x
X; 2 0, i= 1,2,3.
2 1 3
Explain the procedure to find the solution of Non-linear
programming problem of the following methods (i) Steepest
Descent method (ii) Univariate method.
c) 2
Minimize f(x1,X,) = 5x - 2 xx, txf - x -X2 in the
range -3Sx s5 and -4 < x, S7 by using random search
method up to 10 iterations given the set of values as
{(,r)= (0.50,0.60), (. 25,.26), (.98, .97), (,45,.46),
(.234,.235), (.63, .64)}