Universal Human Values Exam Questions
Universal Human Values Exam Questions
'•
~ "'/"t
..
•.,J.., /'\('i
. f tt I
IN-SEMESTER EXAMINATION-I
S.E./S.T. (Semester-III)
SUBJECT- Universal Human Values -II
Coune Leaming
Marks Outcomes
~ Answer any 5 of the following questions Levels
,
State the need for value education in technical and other professional u
y. Institutions?
2 1
/z a. What is the responsibility of the self towards the body? How is it fulfilled?
. 5 2 A
I
OR
"For success in any human endeavour both values & skills are required."
/4 Justify
5 2 AN
Distinguish between excellence and competition
~-
.
/4
OR
5 3 A
Course
?f Answer any 5 of the following questions Marks Outcomes Leaming
Levels
OR
: What does it mean to truly coexist with other species and the environment?
)f. Are there situations where coexistence is not achievable, and if so, what are
the implications?
5 4 II u
/.
Prove that : (A X B) n (A X C) = A X (B n C)
2 2 R
Let A{ 1,2,3,4} and let R be the relation 'greater than' . represent Ras a set
y of a digraph , a matrix and diagram.
2 2 u
For the given Hasse Diagram find maximum and minimum elements.
a
b
.
/.
d
C>< C
Show that the "greater than or equal to" relation (~) is a partial ordering
2 3 R
I'
r ~ft'-=~"!.A'~ ~~_e. ~!._~~L~f!~~~ '.!'~==-':"'•Nf~
c.'Htf•""' • .,,1,__ ,,,,,.,-11-,-,..,_.. ....,., r (,.._,..... c.,_.._ ,.. n l{;f'J,..,, ,,,,,,..,, .,-,r, .. ,,..."'OJlit JtJ
_ .1..-u t>-ff"11"" ,-. ,tk c_ ,.,,.., .,.,_,,,.NI:,. J,or,., .,_,.it,111., ,,.,,, ,,. -n,w,th..u, \,,.,,1•
c ~ b u.,_.,
~
tt,w
~ ~ ...
.'
4..,.,"11 1111,,
,-,...,,,._. , I Olr«/11,,t
• , ... , , flol'lo ll ! ft • \ 1 •1~, • • .l<ll.l, Hh,l,il / , .,' vllf(.••.,t,/1..•I •
•,o.M , lt"-"' " ••I , . .. ,.tr,.,.,,.., , "ll PI ,,,_~., 1•~••
l!Jltlt . ~('101
•l,,,, ,,,.,r l, ,,....t,u,i t,, 1,,....,,,, ..... ..., I ,;i,- 1, '7' 1'✓11 1 •"'-'W" ' ""'
\tot ~ •,..il Jto .. .,,...,.., ,, ,..,
b.
b 5 3 u
d '
I
- ~~
..~
(.
""·•oo·,
~
rt..ut
.,..-r-'-- .Jw-,i. c,;...,,..r.r.. ...._, • , - 'L.,,.,
THAKUR C OLLEGE OF
, E NOIN EE RINO & TECHNOLOG Y
.,.,,,__ ..,(\Htiiip~ - . 1....
Jfn-'M..rt:,.Atr 1·. ,,Jy c--KJ'-•,.......,_..r.,J -~
~ ~ - - -_,.,,,.,,..J,~-,,_..o=
.,,.,,_0---,,.~1•
.,,,__,,,,.-n.,,u.c....,,._
J
M
,..,.,...,...":I.,,,,_...,
.I&..,..,_,.,.,~ g.. _ _ . •f
1"'-.,n.,:,,.,.c.,~;
...
--.-c,....,;;,.l<ICJJl,,,O, ,_,o,,..,.~,.,,c...,,,_,.,.-,y _.,A.. .·-,...,
tu..,_.olr#-<',},,lf>f)
• [Link] •voo , J"l •t •<.-..Y,..... • ,...,,,,.__,. ;/11.u 'TW~•~~.,..,,..ra.-, r.-A"•"'" ot"'...., ,.,•,. ,• ._.,,."" ;,.-fl((
•,...,..... .........,.,,,,,.~...... ._, ·"...._. ....... ,.,.. ~"'· .... .... - ....,-,.JI(..... J .,.....Jo,.
~
- ., ·- ..
w,t.110-
~
_,.,.,
.. ..,. ,.,
,,,,,,,.u..111, ,; I
-
IN-SEMEST ER EXAMINATION-II
S.E./S.T. (Semester-111)
SUBJECT - MATHEMATICS-Ill
Date: 17/10/2024
Branch: COMP, IT, CSE Timing: 02:00 PM to 03:00 PM
Div.: ALL Maximum Marks: 20
Duration: 60 Minutes
Instructions -
I. All questions are compulsory.
2. Assume suitable data wherever necessary and state the assumptions made.
3. Diagrams / sketches should be given wherever necessary.
4. Use oflogarithmic table, drawing instruments and non-programmable calculators is permitted.
5. Figures to the right indicate full marks.
Course Leaming
Answer any 5 of the following questions Marks Outcomes Levels
4 R
/. Define Directed Graph and Directed Multigraph with one Example. 2
I Explain, If (p /\ ~ r)
I
~ (q V r) is false. Here, q and r both are false then pis 2 5 u
· (True I False).
¢ 5 4 R
OR
Show that an Undirected Graph has an even number of vertices of odd 5 4 A
b.
degree.
Construct the Converse, inverse and contrapositive of the following:
(i) It is cold then he wears a hats 5 5 A
a.
(ii) Ifan integer is multiple of2 then it is even number.
OR
Show that by using mathematical induction to prove that 2n < n! , for every 5 5 u
· I integer n ~ 4.
IN-SEMESTER EXAMINATION-I
S.E. (Semester-Ill)
SUBJECT - DIGITAL CIRCUIT DESIGN
Branch: IT Date: 28/08/2024
Div.: ALL Timing: 10:00 AM to 11:00 AM
Duration: 60 Minutes Maximum Marks: 20
Instructions -
1. All questions are compulsory.
2. Assume suitable data wherever necessary and state the assumptions made.
3. Diagrams / sketches should be given wherever necessary.
4. Use of logarithmic table, drawing instruments and non-programmable calculators is permitted.
5. Figures to the right indicate full marks.
Course Learning
~ Answer any 5 of the following questions Marks Outcomes Levels
u
✓ Define two's complement number system with a suitable example. 2 1
Convert (103) 10 into its equivalent octal number.
~ 2 1 R
y: Define weighted and non-weighted codes 2 1 u
Use a combination of AND, OR, and NOT gates to implement a simple
V. logic circuit for the expression [Link]+C')
2 2 A
OR
Reduce the following Boolean expressions: 1) BC'D'+BCD' 2) 5 2 A
b. (C'+B)(C+B).
Compare and contrast the structure and function of a Half-Adder and a
~I/ Full Adder. What are the key differences in their implementation and
application?
5 3 A
OR
Course Learning
~ Answer any 5 of the following questions Marks Outcomes Levels
4 I u
/ Write the characteristic equation of a JK flip-flop. 2
OR
Compare combination circuits with sequential circuits 5 4 AN
b.
Explain the bidirectional shift register and its significance in digital
9'1 V circuits.
OR
5 5 A
- 5 AN
b. Describe the construction and operation of a 4-bit parallel register. 5
I
-
IN-SEMESTER EXAMINATION-I
S.E. (Semester-Ill)
SUBJECT- DATA STRUCTURES AND ALGORITHM
Branch: IT Date: 28/08/2024
Div.:ALL Timing: 2:00 PM to 3:00 PM
Duration: 60 Minutes Maximum Marks: 20
Instructions -
1. All questions are compulsory.
2. Assume suitable data wherever necessary and state the assumptions made.
3. Diagrams I sketches should be given wherever necessary.
4. Use oflogarithmic table, drawing instruments and non-programmable calculators is permitted.
5. Figures to the right indicate full marks.
Course Learning
~ Answer any 5 of the following questions Marks Outcomes Levels
/
/4 What is the need of Data Structures? 2 1 AN
Define Data structure and list out all the linear and Non- Linear data
y. structure 2 I u
Write the time complexity of the following code. Explain step by step
float sum(float list[], int n)
{ float tempsum = O;
inti;
C. 2 I A
for(i=O; i <n; i++)
tempsum += list[i];
i
I
return tempsum;}
d. Write the time complexity and space complexity for Radix sort. 2 2 AN
Complete the below logic of insertion sort
void insertion Sort(int aO, int n)
{int i,j, temp;
for(i = I; i < n; i++) {
temp = _ _;
j = i-1 ;
OR
Explain merge sort Algorithm with an example and state its time
b. complexity. 5 2 AN
How do you allocate and deallocate memory for the node dynamically?
~ a. Explain it with a code 5 3 A
OR
_,Explain Circular Doubly linked list and Singly linear list. State the time
y. complexity for all the operations in both the types of list 5 3 A
-
IN-SEMESTER EXAMINATION-II
S.E. (Semester-III)
SUBJECT- DATA STRUCTURES AND ALGORITHM
Branch: IT Date: 18/10n024
Div.:ALL Timing: 02:00 PM to 03:00 PM
Duration: 60 Minutes Maximum Marks: 20
Instructions -
1. All questions are compulsory.
2. Assume suitable data wherever necessary and state the assumptions made.
3. Diagrams I sketches should be given wherever necessary.
4. Use of logarithmic table, drawing instruments and non-programmable calculators is permitted.
5. Figures to the right indicate full marks.
Course Learning
~ Answer any 5 of the following questions Marks
Outcomes Levels
State the time complexity for all the operations in the queue data
V structure. 2 4 AN
- -
V -y/~/\-
2
1\ • ,1
2 6 A
~ 1/\ - \..
2
~ 1 J---\1'
/
\'. 2 • 2 •
Given the, : ,h in the figure, find what is the adjacency matrix.
1,.,, t:
3 / \
\
4
8
,
- 2 6 A
) 2/\ 7 \ ·5
~ 6~
State the applications of stacks and Queue Data Structure. Write the
time complexity for following operations
~ j: a. PUSH, b. POP, c. ENQUEUE, d. DEQUEUE
5 4 AN
I Y.,J- . .....,~ ,:,...~ '""""·' (~.I J
THAKUR COLLEGE OF
~--~·:M--1.t
t ENGINEERING & TECHNOLOGY
. c--1,-,-.,..---..,CJIII-~_.,_ _ _
..........aal".....
: .,,---~_.,,.,
~ [Link]. 2001
~ : ~!..--~=:1=:= ~~~:.-:;==:-~~~
• ,IS,C, f/llOOl' ~ JJ, l .fOOl [Link].J, ,,O,OOJ120./4(.'rrf(/t,,,,£• ~ , 1A,-r,w"Jt,J',,NfH1-.f'.,_,,-~.A,""'1,.,._ """4JU~ctW1,(
. ,____,.,.~ ,_, ~ ..-.-••*.A,.,,..,..,.,_._Ott-"'~ Q ..~
OR
b. Write an Algorithm to evaluate Prefix Expression 5 4 A
>Y-3. l,✓. List at least 5 applications ofBinary Tree and elaborate them. 5 5 u
OR
Perfonn the following operations on the given Binary Search Tree:
i) Insert the values 20, 15, 25, 10, and 17 into an initially empty BST.
b. ii) Delete the node with the value 15 from the resulting BST. 5 5 AN
iii) Show the final structure of the BST after the operations
I
IN-SEMESTER EXAMINATION-I
S.E. (Semester-III)
EMS
SUB JEC T- DATABASE MANAGEMENT SYST
Date: 29/08/2024
Branch: IT Timing: 10:00 AM to 11 :00 AM
Div.: ALL Maximum Marks: 20
Duration: 60 Minutes
Instructions -
I. All questions are compulsory.
the assumptions made.
2. Assume suitable data wherever necessary and state
ever necessary.
3. Diagrams/ sketches should be given wher
ments and non-p rogrammable calculators is permitted.
4. Use oflogarithmic table, drawing instru
5. Figures to the right indicate full marks.
Course Learning
Marks Outcomes Levels
Q.1 Answer any S of the following questions
2 1 C
a DBMS.
V. Discuss and exemplify four real-time applications of
in database design. 1 R
µ< Infer data redundancy and explain why it's a concern 2
!?" List two categories of users in a database system and give an example 2 I R
I for each. 2 2 R
V. Oefine Multi-valued attribute. Give an example.
2 2 R
e. Describe Super Key. Give an example.
role in establishing
Define the term "foreign key" and explain its 2 3 R
/. relationships between tables in a database.
in relational algebra
Discuss the purpose of the "natural join" operation 2 3 u
g. and how it is used to combine related tuples from different relations.
where this concept
Clarify the idea of aggregation. Give two examples of 5 2 R
9a' a. is useful.
OR
ple? 5 2 u
y Explain the four types of mapping cardinality with exam
with an example.
Illustrate the concept of primary key and foreign key 5 3 AN
these keys are
~ y. Consider two tables, Library and Book, and show how
used.
OR
Describe the concept of inner join, left outer join, and right outer join in
and Department AN
SQL with appropriate examples using the Employee 5 3
b.
tables.
IN-SEMESTER EXAMINATION-II
S.E. (Semester-Ill)
Course Leaming
~ Answer any S of the following questions Marks Outcomes Levels
Recall the concept of triggers in DBMS and describe their key
[,✓. functionalities. How are they typically used to automate tasks within a 2 4 R
database system?
Describe the concept of a database view and explain how it differs from
,~
a table. What are the implications of these differences for data 2 4 u
management?
OR
Analyze the security issues associated with storing critical data, such as I'
User ID and Password, in plain text within a login table. Discuss the i
I)< essential security measures that should be implemented to protect this 5 4 II
AN
sensitive information.