7 2 3 7

* C20-CM-WD-CAI–304

7237
BOARD DIPLOMA EXAMINATION, (C-20)
JUNE/JULY— 2022

DCME - THIRD SEMESTER EXAMINATION

DATA STRUCTURES THROUGH C

Time : 3 hours ] [ Total Marks : 80

PART—A 3×10=30

Instructions : (1) Answer all questions.

(2) Each question carries three marks.
(3) Answers should be brief and straight to the point and shall
not exceed five simple sentences.

1. Define the term ‘data structure’.

2. Given the list 3, 6, 7, 8, 34 and 56. How many comparisons are

required to search for the element 7?

3. Explain the terms non-linear data structures and linear data structures
with examples.

4. Define the term ‘Linked list’.

5. Demonstrate the concept of creation of a sample node using malloc().

* 6. Define the terms ‘overflow’ and ‘underflow’ in stack.

7. Which data structure follows last in first out order in processing

elements? Name the two operations of respective data structure.

8. What is the principle followed by a queue for insertion and deletion?

9. Define the terms root, leaf and depth of the tree.

10. Consider a binary tree with at least 5 nodes and give it’s post-order
traversal.

/7237 1 [ Contd...

www.manaresults.co.in
 * PART—B 8×5=40

Instructions : (1) Answer all questions.

(2) Each question carries eight marks.
(3) Answers should be comprehensive and criterion for
valuation is the content but not the length of the answer.

11. (a) Apply the quicksort technique on (34, 15, 67, 89 and 24)
elements and show the output of each iteration.

(OR)

(b) Apply the concept of recursion to write a C program for non-sorted

sequence using binary search.

12. (a) Construct a single linked list with 7 nodes and perform delete
and display operations.

(OR)

(b) Use linear search technique to write a C program to find an

element in a linked list.

13. (a) Build an equivalent postfix expression of the given infix

expression (a * b) + (c + d)/e * f.

(OR)

(b) Use stack to evaluate the given postfix expression “6 9 + 4 2 ^ +”.

14. (a) Apply the concept of an array to perform all the queue operations.
* (OR)

(b) Use linked list to write a C program to implement circular

queues.

15. (a) Construct a binary search tree for the given nodes :

(10, 20, 34, 56, 68, 98, 33, 45) and give the in order, pre-order
and post-order traversals.

/7237 2 [ Contd...

www.manaresults.co.in
 * (OR)

(b) Construct a binary tree if the in-order and post-order travels are
given as
IN-ORDER : 425136
POST-ORDER : 452631

PART—C 10×1=10

Instructions : (1) Answer the following question.

(2) Question carries ten marks.
(3) Answers should be comprehensive and criterion for
valuation is the content but not the length of the answer.

16. Assume a queue data structure with a capacity of 5 elements and

the data available to be processed by queue is 10, 30, 20, 40, 50,
60, 80, 90, 78, 99. Show the status of queue for each operation to
perform consecutively 5 enqueue and 4 dequeue operations followed
by 6 enqueue operations. What will be the length of the at the end?
Is here any overflow or underflow situation occurs? Justify your
answer.

★★★

/7237 3 AA22-PDF

www.manaresults.co.in
 7 2 3 7
* C20-CM-WD-CAI–304

7237
BOARD DIPLOMA EXAMINATION, (C-20)
JUNE/JULY— 2022

DCME - THIRD SEMESTER EXAMINATION

DATA STRUCTURES THROUGH C

Time : 3 hours ] [ Total Marks : 80

PART—A 3×10=30

Instructions : (1) Answer all questions.

(2) Each question carries three marks.
(3) Answers should be brief and straight to the point and shall
not exceed five simple sentences.

1. Define the term ‘data structure’.

2. Given the list 3, 6, 7, 8, 34 and 56. How many comparisons are

required to search for the element 7?

3. Explain the terms non-linear data structures and linear data structures
with examples.

4. Define the term ‘Linked list’.

5. Demonstrate the concept of creation of a sample node using malloc().

* 6. Define the terms ‘overflow’ and ‘underflow’ in stack.

7. Which data structure follows last in first out order in processing

elements? Name the two operations of respective data structure.

8. What is the principle followed by a queue for insertion and deletion?

9. Define the terms root, leaf and depth of the tree.

10. Consider a binary tree with at least 5 nodes and give it’s post-order
traversal.

/7237 1 [ Contd...

www.manaresults.co.in
 * PART—B 8×5=40

Instructions : (1) Answer all questions.

(2) Each question carries eight marks.
(3) Answers should be comprehensive and criterion for
valuation is the content but not the length of the answer.

11. (a) Apply the quicksort technique on (34, 15, 67, 89 and 24)
elements and show the output of each iteration.

(OR)

(b) Apply the concept of recursion to write a C program for non-sorted

sequence using binary search.

12. (a) Construct a single linked list with 7 nodes and perform delete
and display operations.

(OR)

(b) Use linear search technique to write a C program to find an

element in a linked list.

13. (a) Build an equivalent postfix expression of the given infix

expression (a * b) + (c + d)/e * f.

(OR)

(b) Use stack to evaluate the given postfix expression “6 9 + 4 2 ^ +”.

14. (a) Apply the concept of an array to perform all the queue operations.
* (OR)

(b) Use linked list to write a C program to implement circular

queues.

15. (a) Construct a binary search tree for the given nodes :

(10, 20, 34, 56, 68, 98, 33, 45) and give the in order, pre-order
and post-order traversals.

/7237 2 [ Contd...

www.manaresults.co.in
 * (OR)

(b) Construct a binary tree if the in-order and post-order travels are
given as
IN-ORDER : 425136
POST-ORDER : 452631

PART—C 10×1=10

Instructions : (1) Answer the following question.

(2) Question carries ten marks.
(3) Answers should be comprehensive and criterion for
valuation is the content but not the length of the answer.

16. Assume a queue data structure with a capacity of 5 elements and

the data available to be processed by queue is 10, 30, 20, 40, 50,
60, 80, 90, 78, 99. Show the status of queue for each operation to
perform consecutively 5 enqueue and 4 dequeue operations followed
by 6 enqueue operations. What will be the length of the at the end?
Is here any overflow or underflow situation occurs? Justify your
answer.

★★★

/7237 3 AA22-PDF

www.manaresults.co.in
 7237

* C20-CM-WD-CAI-304

7237
BOARD DIPLOMA EXAMINATION, (C-20)
NOVEMBER/DECEMBER—2022
DCME – THIRD SEMESTER EXAMINATION
DATA STRUCTURES THROUGH C
Time : 3 hours ] [ Total Marks : 80

PART—A 3×10=30

Instructions : (1) Answer all questions.

(2) Each question carries three marks.
(3) Answers should be brief and straight to the point and shall
not exceed five simple sentences.

1. Define the terms ‘time complexity’ and ‘space complexity’.

2. Illustrate linear searching with an example.

3. Apply selection sort technique to sort the elements 3, 2, 6 and 8.

4. Give the structure of a node in doubly linked list.

5. List any three advantages of linked lists over arrays.

*
6. List any three applications of stacks.

7. Define the terms PUSH and POP with respect to LIFO data structure.

8. Define queue by mentioning any two operations on queues.

9. List any three applications of trees.

10. Define the terms tree, degree of node and height of the tree.
*
/7237 1 [ Contd...

www.manaresults.co.in
 PART—B 8×5=40

*
Instructions : (1) Answer all questions.
(2) Each question carries eight marks.
(3) Answers should be comprehensive and criterion for
valuation is the content but not the length of the answer.

11. (a) Use the concept of an array to write a program for binary search
for non-sorted sequence.

(OR)

(b) Apply the concept of insertion sort on (3, 5, 1, 7, 8, 9, 12) and

print the odd iteration sequences.

12. (a) Use the concept of an array to write a program for circular queues.

(OR)

(b) Build an ordinary queue with linked list and perform all the
operations.

13. (a) Build an equivalent postfix expression of the given infix

x ^ y/(5 * z )  2 .

(OR)

(b) Use stack to evaluate the given postfix expression “53 + 62/*35* +”.

14. (a) Write a program for circular queues using arrays.

(OR)
*
(b) Use recursion concept and write the pseudocode for reversing an
ordinary queue.

15. (a) Construct a binary search tree for the values 10, 20, 34, 56, 68, 98,
33, 45 and find out the (i) root node, (ii) leaf nodes, (iii) height of the
tree and (iv) internal nodes.

(OR)

(b) Construct a binary tree for the values 24, 22, 54, 11, 33, 68, 89, 91,
12, 3 and 67, and give the inorder, preorder and postorder traversals.

*
/7237 2 [ Contd...

www.manaresults.co.in
 PART—C 10×1=10

Instructions :
*
(1) Answer the following question.
(2) The question carries ten marks.
(3) Answer should be comprehensive and the criterion for
valuation is the content but not the length of the answer.

16. Design a binary search tree with the values 10, 30, 20, 40, 50, 60, 80,
90, 78, 99 nodes. Show the modified tree after inserting 1, 2 and 3
nodes and after deleting 20, 40, 50. Finally display the resultant tree
nodes from root to leaves and display the post order traversal of the final
tree.



*
/7237 3 AA22–PDF

www.manaresults.co.in
 7237
* C20-CM-WD-CAI–304

7237
BOARD DIPLOMA EXAMINATION, (C-20)

MAY—2023
DCME - THIRD SEMESTER EXAMINATION

DATA STRUCTURES THROUGH C

Time : 3 hours ] [ Total Marks : 80

PART—A 3×10=30

Instructions : (1) Answer all questions.

(2) Each question carries three marks.
(3) Answers should be brief and straight to the point and shall
not exceed five simple sentences.

1. What is Abstract Data Structure (ADT)?

2. Write the need for sorting.

3. Write about linear search method.

4. List the advantages of linked lists over arrays.

* 5. Write the purpose of dummy header.

6. Write about stack and its operations.

7. Convert the infix expression A/(B + C ) × D into postfix notation.

8. List the applications of queues.

9. Define the terms (a) subtree, (b) degree of tree and (c) internal node.

10. What is a binary search tree?

*

/7237 www.manaresults.co.in
1 [ Contd...
 * PART—B 8×5=40

Instructions : (1) Answer any five questions.

(2) Each question carries eight marks.
(3) Answers should be comprehensive and criterion for
valuation is the content but not the length of the answer.

11. Write the algorithm and explain the method of insertion sort with an
example.

(OR)

Explain binary search method with an example and write the program
for it.

12. Explain how to perform insertion operation on single linked list.

(a) At the beginning of SLL

(b) At the end of SLL

(c) Before a given node

(OR)

Write the C program to create a double linked list.

13. Write a C program to implement stack and its operations using linked
list.
*
(OR)

Write the algorithm for the conversion of infix notation of expression

into postfix notation and explain it with an example.

14. Write a C program to implement queue and its operations using arrays.

(OR)

Explain the implementation of circular queue and its operations using

linked list.
*

/7237 www.manaresults.co.in
2 [ Contd...
 15. Explain various
* binary tree traversal algorithms with examples.
(OR)

Explain the construction of binary tree from the given inorder and
preorder traversals.

INORDER : S Q T P R X

PREORDER : P Q S T R X

PART—C 10×1=10

Instructions : (1) Answer the following question.

(2) The question carries ten marks.
(3) Answer should be comprehensive and the criterion for
valuation is the content but not the length of the answer.

16. Consider two single linked lists L1 and L2 with following nodes :
L1 : 10, 50, 30, 20, 40
L2 : 20, 35, 40, 45, 50

Write a program to display data of all the common elements of

L1 and L2.



/7237 www.manaresults.co.in
3 AA23–PDF
 7237
C20-CM-WD-CAI– 304

7237
BOARD DIPLOMA EXAMINATION, (C-20)
OCTOBER/NOVEMBER—2023

DCME - THIRD SEMESTER EXAMINATION

DATA STRUCTURES THROUGH C

Time : 3 Hours ] [ Total Marks : 80

PART—A 3×10=30

Instructions : (1) Answer all questions.

(2) Each question carries three marks.
(3) Answers should be brief and straight to the point and shall
not exceed five simple sentences.

1. What is abstract data type? List any two abstract data types.

2. Define the terms linear data structure and non-linear data structure.

3. Define sorting. List any two sorting techniques along with their time
complexity.

4. List the differences between array and linked list.

5. Draw the node structure of a doubly linked list. Write the equivalent C
structure to represent the node of a doubly linked list.

6. Define queue. List the applications of queues.

7. What is stack overflow and stack underflow?

8. List the different types of expression representations along with an

example.

9. Define the terms edge, internal nodes and path.

10. Define tree traversal. List various tree traversal techniques.

/7237 1 [ Contd...

www.manaresults.co.in
 PART—B 8×5=40

Instructions : (1) Answer all questions.

(2) Each question carries eight marks.
(3) Answers should be comprehensive and criterion for
valuation is the content but not the length of the answer.

11. (a) Write a C function to implement quick sort.

(OR)

(b) Write an algorithm to sort the given elements in ascending order

using bubble sort.

12. (a) Write a C function to insert an element into a singly linked list.

(OR)

(b) Write a C program to create a doubly linked list with N elements.

13. (a) Write a C program to implement stack data structure using array.

(OR)

(b) Write the procedure to convert the following infix expression to

postfix notation :

( A  B * C )  (D  E ) * F /H

14. (a) Write a C program to implement queue using linked list.

(OR)

(b) Write a C program to implement circular queue using an array.

15. (a) Explain how to convert a general tree to binary tree with an example.

(OR)

(b) Explain in detail about an array and a linked list representation of

binary tree.

/7237 2 [ Contd...

www.manaresults.co.in
 PART—C 10×1=10

Instructions : (1) Answer the following question.

(2) The question carries ten marks.
(3) Answer should be comprehensive and the criterion for
valuation is the content but not the length of the answer.

16. Write a C program to implement two stacks from two ends of an array.



/7237 3 AA23(048)–PDF

www.manaresults.co.in
 7237
C20-CM-WD-CAI– 304
*
7237
BOARD DIPLOMA EXAMINATION, (C-20)
OCTOBER/NOVEMBER—2023

DCME - THIRD SEMESTER EXAMINATION

DATA STRUCTURES THROUGH C

Time : 3 Hours ] [ Total Marks : 80

PART—A 3×10=30

Instructions : (1) Answer all questions.

(2) Each question carries three marks.
(3) Answers should be brief and straight to the point and shall
not exceed five simple sentences.

1. What is abstract data type? List any two abstract data types.

2. Define the terms linear data structure and non-linear data structure.

3. Define sorting. List any two sorting techniques along with their time
complexity.

4. List the differences between array and linked list.

5. Draw the node structure of a doubly linked list. Write the equivalent C
structure to represent the node of a doubly linked list.
*
6. Define queue. List the applications of queues.

7. What is stack overflow and stack underflow?

8. List the different types of expression representations along with an

example.

9. Define the terms edge, internal nodes and path.

10. Define tree traversal. List various tree traversal techniques.

*
/7237 1 [ Contd...

www.manaresults.co.in
 PART—B 8×5=40

*
Instructions : (1) Answer all questions.
(2) Each question carries eight marks.
(3) Answers should be comprehensive and criterion for
valuation is the content but not the length of the answer.

11. (a) Write a C function to implement quick sort.

(OR)

(b) Write an algorithm to sort the given elements in ascending order

using bubble sort.

12. (a) Write a C function to insert an element into a singly linked list.

(OR)

(b) Write a C program to create a doubly linked list with N elements.

13. (a) Write a C program to implement stack data structure using array.

(OR)

(b) Write the procedure to convert the following infix expression to

postfix notation :

( A  B * C )  (D  E ) * F /H

* 14. (a) Write a C program to implement queue using linked list.

(OR)

(b) Write a C program to implement circular queue using an array.

15. (a) Explain how to convert a general tree to binary tree with an example.

(OR)

(b) Explain in detail about an array and a linked list representation of

binary tree.
*
/7237 2 [ Contd...

www.manaresults.co.in
 PART—C 10×1=10

Instructions :
*
(1) Answer the following question.
(2) The question carries ten marks.
(3) Answer should be comprehensive and the criterion for
valuation is the content but not the length of the answer.

16. Write a C program to implement two stacks from two ends of an array.



*
/7237 3 AA23(048)–PDF

www.manaresults.co.in
 7 2 3 8
* C20-CM-WD–305

7238
BOARD DIPLOMA EXAMINATION, (C-20)
JUNE/JULY— 2022

DCME - THIRD SEMESTER EXAMINATION

DATA BASE MANAGEMENT SYSTEM

Time : 3 hours ] [ Total Marks : 80

PART—A 3×10=30

Instructions : (1) Answer all questions.

(2) Each question carries three marks.
(3) Answers should be brief and straight to the point and shall
not exceed five simple sentences.

1. Define the terms entity and entity set.

2. State the purpose of DBMS.

3. Give the query to display the names of all the employees whose
salary >10000 from emp table.

4. List any six DDL commands of SQL with their syntax.

5. Give the structure of a PL/SQL block.

*
6. List any six features of PL/SQL.

7. Define an exception.

8. Write any three advantages of triggers.

9. What is MongoDB?

10. Define CAP theorem.

/7238 1 [ Contd...

www.manaresults.co.in
 * PART—B 8×5=40

Instructions : (1) Answer all questions.

(2) Each question carries eight marks.
(3) Answers should be comprehensive and criterion for
valuation is the content but not the length of the answer.

11. (a) Explain the structure of database system with legible sketch.

(OR)

(b) Explain CODD’s twelve rules for RDBMS.

12. (a) Explain transaction control commands in SQL with syntax.

(OR)

(b) Explain any five data types available in SQL with proper examples
in each case.

13. (a) Explain all the looping statements of PL/SQL with syntax and
examples.

(OR)

(b) Develop a PL/SQL program to reverse the given number.

14. (a) Explain the user defined exceptions with syntax in PL/SQL.

(OR)
* (b) Describe implicit and explicit cursors with examples.

15. (a) Write the procedure of inserting and updating documents in

MongoDB with example.

(OR)

(b) Explain the need of NoSQL as alternative to RDBMS.

/7238 2 [ Contd...

www.manaresults.co.in
 * PART—C 10×1=10

Instructions : (1) Answer the following question.

(2) Question carries ten marks.
(3) Answers should be comprehensive and criterion for
valuation is the content but not the length of the answer.

16. How do you create an employee table with id, name, age, address
and salary by choosing appropriate data types for the columns and
with a minimum of 5 records and can you create a view to store and
display minimum, maximum and average salaries of all the employees
without modifying the table contents? Justify your answer.

★★★

/7238 3 AA22-PDF

www.manaresults.co.in
 7 2 3 8
* C20-CM-WD–305

7238
BOARD DIPLOMA EXAMINATION, (C-20)
JUNE/JULY— 2022

DCME - THIRD SEMESTER EXAMINATION

DATA BASE MANAGEMENT SYSTEM

Time : 3 hours ] [ Total Marks : 80

PART—A 3×10=30

Instructions : (1) Answer all questions.

(2) Each question carries three marks.
(3) Answers should be brief and straight to the point and shall
not exceed five simple sentences.

1. Define the terms entity and entity set.

2. State the purpose of DBMS.

3. Give the query to display the names of all the employees whose
salary >10000 from emp table.

4. List any six DDL commands of SQL with their syntax.

5. Give the structure of a PL/SQL block.

*
6. List any six features of PL/SQL.

7. Define an exception.

8. Write any three advantages of triggers.

9. What is MongoDB?

10. Define CAP theorem.

/7238 1 [ Contd...

www.manaresults.co.in
 * PART—B 8×5=40

Instructions : (1) Answer all questions.

(2) Each question carries eight marks.
(3) Answers should be comprehensive and criterion for
valuation is the content but not the length of the answer.

11. (a) Explain the structure of database system with legible sketch.

(OR)

(b) Explain CODD’s twelve rules for RDBMS.

12. (a) Explain transaction control commands in SQL with syntax.

(OR)

(b) Explain any five data types available in SQL with proper examples
in each case.

13. (a) Explain all the looping statements of PL/SQL with syntax and
examples.

(OR)

(b) Develop a PL/SQL program to reverse the given number.

14. (a) Explain the user defined exceptions with syntax in PL/SQL.

(OR)
* (b) Describe implicit and explicit cursors with examples.

15. (a) Write the procedure of inserting and updating documents in

MongoDB with example.

(OR)

(b) Explain the need of NoSQL as alternative to RDBMS.

/7238 2 [ Contd...

www.manaresults.co.in
 * PART—C 10×1=10

Instructions : (1) Answer the following question.

(2) Question carries ten marks.
(3) Answers should be comprehensive and criterion for
valuation is the content but not the length of the answer.

16. How do you create an employee table with id, name, age, address
and salary by choosing appropriate data types for the columns and
with a minimum of 5 records and can you create a view to store and
display minimum, maximum and average salaries of all the employees
without modifying the table contents? Justify your answer.

★★★

/7238 3 AA22-PDF

www.manaresults.co.in
 7238

* C20-CM-WD-AIM-CCB-CCN-305

7238
BOARD DIPLOMA EXAMINATION, (C-20)
NOVEMBER/DECEMBER—2022
DCME – THIRD SEMESTER EXAMINATION
DATA BASE MANAGEMENT SYSTEM
Time : 3 hours ] [ Total Marks : 80

PART—A 3×10=30

Instructions : (1) Answer all questions.

(2) Each question carries three marks.
(3) Answers should be brief and straight to the point and shall
not exceed five simple sentences.

1. Define the terms instance and schema.

2. List any three important roles of DBM.

3. State the purpose of any three character handling functions of SQL( ).

4. Give the purpose of SYSDATE( ) and ROUND( ) in SQL.

5. Define input and output statements in PL/SQL with syntax.

* 6. Write any three characteristics of procedure subprogram unit in

PL/SQL.

7. List any three implicit exceptions along with their purpose.

8. What is an implicit cursor?

9. List any four advantages of MongoDB.

10. State the need of NoSQL.

*
/7238 1 [ Contd...

www.manaresults.co.in
 PART—B 8×5=40

*
Instructions : (1) Answer all questions.
(2) Each question carries eight marks.
(3) Answers should be comprehensive and criterion for
valuation is the content but not the length of the answer.

11. (a) Explain specialization and aggregation in DBMS.

(OR)

(b) Explain CODD’s twelve rules for RDBMS.

12. (a) Explain GRANT and REVOKE commands in SQL with syntax.

(OR)

(b) Explain the creation of a subquery with syntax and example.

13. (a) Explain any eight PL/SQL numeric datatypes with their subtypes.

(OR)

(b) Explain CASE and GOTO statements in PL/SQL with syntax.

14. (a) Explain creation of explicit cursor in PL/SQL with example.

(OR)
*
(b) Explain user defined exceptions with syntax and example.

15. (a) Explain the classification of NoSQL.

(OR)

(b) Explain the procedure for updating and deleting a document in

MongoDB.

*
/7238 2 [ Contd...

www.manaresults.co.in
 PART—C 10×1=10

Instructions :
*
(1) Answer the following question.
(2) The question carries ten marks.
(3) Answer should be comprehensive and the criterion for
valuation is the content but not the length of the answer.

16. Develop an application of a banking system, to reflect the changes of

banking transaction in respective tables, to transfer funds from savings
account to current account and to record the transaction in the
transaction Journal by using COMMIT and ROLLBACK to ensure the
data consistency and integrity.



*
/7238 3 AA22–PDF

www.manaresults.co.in
 7238
* C20-CM-WD-AIM-CCB-CCN–305

7238
BOARD DIPLOMA EXAMINATION, (C-20)

MAY—2023
DCME - THIRD SEMESTER EXAMINATION

DBMS
Time : 3 hours ] [ Total Marks : 80

PART—A 3×10=30

Instructions : (1) Answer all questions.

(2) Each question carries three marks.
(3) Answers should be brief and straight to the point and shall
not exceed five simple sentences.

1. List any three duties of a database administrator.

2. Define attribute and entity.

3. List various types of DDL statements.

4. Write the difference between truncate and delete commands of SQL.

*
5. What is the syntax of while LOOP in PL/SQL?

6. Define subprogram.

7. List any three named exceptions.

8. Write the syntax for ‘trigger’ creation.

9. List the commands used for CRUD operations in MongoDB.

10. * the need of NoSQL.

State

/7238 www.manaresults.co.in
1 [ Contd...
 * PART—B 8×5=40

Instructions : (1) Answer all questions.

(2) Each question carries eight marks.
(3) Answers should be comprehensive and criterion for
valuation is the content but not the length of the answer.

11. (a) Explain different levels of data abstraction.

(OR)

(b) List and explain mapping cardinalities.

12. (a) Explain about various TCL statements in SQL.

(OR)

(b) Explain any four string functions with examples in SQL.

13. (a) Explain about scope and visibility of a variable in PL/SQL.

(OR)

(b) Explain about various comparison operators in PL/SQL.

14. (a) Explain how to re-raise an exception in PL/SQL.

*
(OR)

(b) Explain about life cycle of a cursor.

15. (a) Explain the process of creating and dropping of collections in

mongoDB.

(OR)

(b) Explain about key-value stores databases.

*

/7238 www.manaresults.co.in
2 [ Contd...
 * PART—C 10×1=10

Instructions : (1) Answer the following question.

(2) The question carries ten marks.
(3) Answer should be comprehensive and the criterion for
valuation is the content but not the length of the answer.

16. Explain the process of joining 3 tables in SQL with example.



/7238 www.manaresults.co.in
3 AA23–PDF
 7238
C20-CM-WD-AIM-CCB-CCN–305

7238
BOARD DIPLOMA EXAMINATION, (C-20)
OCTOBER/NOVEMBER—2023

DCME - THIRD SEMESTER EXAMINATION

DBMS
Time : 3 Hours ] [ Total Marks : 80

PART—A 3×10=30

Instructions : (1) Answer all questions.

(2) Each question carries three marks.
(3) Answers should be brief and straight to the point and shall
not exceed five simple sentences.

1. Define primary key.

2. List the symbols used in ER model and write its purpose.

3. Write a Query in SQL to display maximum salary of employee in employee

table.

4. List TCL commands.

5. Write about IF statement in PL/SQL with syntax and example.

6. What is the difference between procedure and function?

7. Define cursor.

8. Write the advantages of triggers.

9. Mention any three advantages of NoSQL.

10. What is the purpose of MongoDB?

/7238 1 [ Contd...

www.manaresults.co.in
 PART—B 8×5=40

Instructions : (1) Answer all questions.

(2) Each question carries eight marks.
(3) Answers should be comprehensive and criterion for
valuation is the content but not the length of the answer.

11. (a) Explain database system architecture.

(OR)

(b) Explain E. F. Codd’s rules for RDBMS.

12. (a) Explain Data Manipulation Language (DML) commands.

(OR)

(b) Explain subqueries with examples.

13. (a) Explain PL/SQL tables and user defined records in PL/SQL.

(OR)

(b) Explain parameter modes in PL/SQL with examples.

14. (a) Explain explicit cursors.

(OR)

(b) What is exception handling? Explain built in exceptions with

example program.

15. (a) Compare ACID and BASE properties.

(OR)

(b) Explain creation of collection and dropping of collection in MongoDB.

/7238 2 [ Contd...

www.manaresults.co.in
 PART—C 10×1=10

Instructions : (1) Answer the following question.

(2) The question carries ten marks.
(3) Answer should be comprehensive and the criterion for
valuation is the content but not the length of the answer.

16. Write a PL/SQL function is Even(N) to find the given number ‘N’ is Even
or not. If ‘N’ is even number is Even(N) should return 1, otherwise is
Even(N) should return 0.



/7238 3 AA23(048)–PDF

www.manaresults.co.in
 7238
C20-CM-WD-AIM-CCB-CCN–305
*
7238
BOARD DIPLOMA EXAMINATION, (C-20)
OCTOBER/NOVEMBER—2023

DCME - THIRD SEMESTER EXAMINATION

DBMS
Time : 3 Hours ] [ Total Marks : 80

PART—A 3×10=30

Instructions : (1) Answer all questions.

(2) Each question carries three marks.
(3) Answers should be brief and straight to the point and shall
not exceed five simple sentences.

1. Define primary key.

2. List the symbols used in ER model and write its purpose.

3. Write a Query in SQL to display maximum salary of employee in employee

table.

4. List TCL commands.

5. Write about IF statement in PL/SQL with syntax and example.

*
6. What is the difference between procedure and function?

7. Define cursor.

8. Write the advantages of triggers.

9. Mention any three advantages of NoSQL.

10. What is the purpose of MongoDB?

*
/7238 1 [ Contd...

www.manaresults.co.in
 PART—B 8×5=40

*
Instructions : (1) Answer all questions.
(2) Each question carries eight marks.
(3) Answers should be comprehensive and criterion for
valuation is the content but not the length of the answer.

11. (a) Explain database system architecture.

(OR)

(b) Explain E. F. Codd’s rules for RDBMS.

12. (a) Explain Data Manipulation Language (DML) commands.

(OR)

(b) Explain subqueries with examples.

13. (a) Explain PL/SQL tables and user defined records in PL/SQL.

(OR)

(b) Explain parameter modes in PL/SQL with examples.

14. (a) Explain explicit cursors.

* (OR)

(b) What is exception handling? Explain built in exceptions with

example program.

15. (a) Compare ACID and BASE properties.

(OR)

(b) Explain creation of collection and dropping of collection in MongoDB.

*
/7238 2 [ Contd...

www.manaresults.co.in
 PART—C 10×1=10

Instructions :
*
(1) Answer the following question.
(2) The question carries ten marks.
(3) Answer should be comprehensive and the criterion for
valuation is the content but not the length of the answer.

16. Write a PL/SQL function is Even(N) to find the given number ‘N’ is Even
or not. If ‘N’ is even number is Even(N) should return 1, otherwise is
Even(N) should return 0.



*
/7238 3 AA23(048)–PDF

www.manaresults.co.in
 7 2 3 5
* C20-CM–302

7235
BOARD DIPLOMA EXAMINATION, (C-20)
JUNE/JULY— 2022

DCME - THIRD SEMESTER EXAMINATION

DIGITAL ELECTRONICS
Time : 3 hours ] [ Total Marks : 80

PART—A 3×10=30

Instructions : (1) Answer all questions.

(2) Each question carries three marks.
(3) Answers should be brief and straight to the point and shall
not exceed five simple sentences.

1. Define binary coded decimal coding.

2. Give the bases of octal, binary and hexa-decimal number systems.

3. State De-Morgan’s theorems.

4. Explain how EX-NOR gate is different from EX-OR gate.

5. Give the advantages of negative logic over positive logic.

* 6. What is triggering in the flip-flop?

7. How asynchronous counter differ from synchronous counter?

8. Define programmable counter.

9. State the purpose of programmable logic device.

10. List any three applications of decoders.

/7235 1 [ Contd...

www.manaresults.co.in
 * PART—B 8×5=40

Instructions : (1) Answer all questions.

(2) Each question carries eight marks.
(3) Answers should be comprehensive and criterion for
valuation is the content but not the length of the answer.

11. (a) What are the value of (i) AEF7(16) in to octal and (ii) 8F9A(16) in
to binary?

(OR)

(b) Justify how excess-3 code is the self-complementing code using

8421 code.

12. (a) Give the steps of how the Sum of Products (SOP) method gives
the Boolean expression of the below truth table.
A B C Y
0 0 0 0
0 0 1 1
0 1 0 1
0 1 1 0
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 0

(OR)
* (b) Give the steps of how the K-map reduces the given expression
Y = m(1,3,4,5,7,9,11,13,15).

13. (a) Suggest the flip-flop and give the steps of how it eliminates
forbidden state of SR flip-flop with truth table.
(OR)
(b) Recommend the inputs using truth table make the RS flip-flop
outputs into SET and RESET without triggered edge of clock
pulse.

/7235 2 [ Contd...

www.manaresults.co.in
 14. (a) Give the*steps to modify the UP counter to measure both UP
and DOWN with truth table.

(OR)

(b) Suggest a Register that is taking data in parallel and taking out
data in parallel with circuit diagram by stating the working
process clearly.

15. (a) Suggest a device and explain how it transmits the single line
data into three outputs.
(OR)

(b) Name the device in which 8 inputs are transmitted on a line

with 3-bit controllers and draw the circuit with proper explanation
of working process.

PART—C 10×1=10

Instructions : (1) Answer the following question.

(2) Question carries ten marks.
(3) Answers should be comprehensive and criterion for
valuation is the content but not the length of the answer.

16. Assume that you have an adder that adds two numbers at a time,
deconstruct it such that they are not added in serial. Comment on
time taken to add the two numbers after deconstructing. Justify
your answer by giving steps to deconstruct it.

* ★★★

/7235 3 AA22-PDF

www.manaresults.co.in
 7 2 3 5
* C20-CM–302

7235
BOARD DIPLOMA EXAMINATION, (C-20)
JUNE/JULY— 2022

DCME - THIRD SEMESTER EXAMINATION

DIGITAL ELECTRONICS
Time : 3 hours ] [ Total Marks : 80

PART—A 3×10=30

Instructions : (1) Answer all questions.

(2) Each question carries three marks.
(3) Answers should be brief and straight to the point and shall
not exceed five simple sentences.

1. Define binary coded decimal coding.

2. Give the bases of octal, binary and hexa-decimal number systems.

3. State De-Morgan’s theorems.

4. Explain how EX-NOR gate is different from EX-OR gate.

5. Give the advantages of negative logic over positive logic.

* 6. What is triggering in the flip-flop?

7. How asynchronous counter differ from synchronous counter?

8. Define programmable counter.

9. State the purpose of programmable logic device.

10. List any three applications of decoders.

/7235 1 [ Contd...

www.manaresults.co.in
 * PART—B 8×5=40

Instructions : (1) Answer all questions.

(2) Each question carries eight marks.
(3) Answers should be comprehensive and criterion for
valuation is the content but not the length of the answer.

11. (a) What are the value of (i) AEF7(16) in to octal and (ii) 8F9A(16) in
to binary?

(OR)

(b) Justify how excess-3 code is the self-complementing code using

8421 code.

12. (a) Give the steps of how the Sum of Products (SOP) method gives
the Boolean expression of the below truth table.
A B C Y
0 0 0 0
0 0 1 1
0 1 0 1
0 1 1 0
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 0

(OR)
* (b) Give the steps of how the K-map reduces the given expression
Y = m(1,3,4,5,7,9,11,13,15).

13. (a) Suggest the flip-flop and give the steps of how it eliminates
forbidden state of SR flip-flop with truth table.
(OR)
(b) Recommend the inputs using truth table make the RS flip-flop
outputs into SET and RESET without triggered edge of clock
pulse.
/7235 2 [ Contd...

www.manaresults.co.in
 14. (a) Give the*steps to modify the UP counter to measure both UP
and DOWN with truth table.

(OR)

(b) Suggest a Register that is taking data in parallel and taking out
data in parallel with circuit diagram by stating the working
process clearly.

15. (a) Suggest a device and explain how it transmits the single line
data into three outputs.

(OR)

(b) Name the device in which 8 inputs are transmitted on a line

with 3-bit controllers and draw the circuit with proper explanation
of working process.

PART—C 10×1=10

Instructions : (1) Answer the following question.

(2) Question carries ten marks.
(3) Answers should be comprehensive and criterion for
valuation is the content but not the length of the answer.

16. Assume that you have an adder that adds two numbers at a time,
deconstruct it such that they are not added in serial. Comment on
time taken to add the two numbers after deconstructing. Justify
your answer by giving steps to deconstruct it.

* ★★★

/7235 3 AA22-PDF

www.manaresults.co.in
 7235

* C20-CM-302

7235
BOARD DIPLOMA EXAMINATION, (C-20)
NOVEMBER/DECEMBER—2022
DCME – THIRD SEMESTER EXAMINATION
DIGITAL ELECTRONICS
Time : 3 hours ] [ Total Marks : 80

PART—A 3×10=30

Instructions : (1) Answer all questions.

(2) Each question carries three marks.
(3) Answers should be brief and straight to the point and shall
not exceed five simple sentences.

1. Convert AC6(16) into octal.

2. Give the table showing hexadecimal to binary conversion.

3. Construct half-adder using gates.

4. Define NAND gate.

5. Define triggering in the flip-flop.

*
6. Draw the block diagram of T flip-flop along with its truth table.

7. How asynchronous counter differs from synchronous counter?

8. Define programmable counter.

9. State the purpose of PLA.

10. List any three applications of multiplexers.

*
/7235 1 [ Contd...

www.manaresults.co.in
 PART—B 8×5=40

*
Instructions : (1) Answer all questions.
(2) Each question carries eight marks.
(3) Answers should be comprehensive and criterion for
valuation is the content but not the length of the answer.

11. (a) What are the values of (i) AEF7(16) in octal and (ii) 8F9A(16) in binary?

(OR)

(b) Explain how excess-3 code is constructed from 421 code. Justify
your answer in identifying self-complementing code among these
two.

12. (a) Give the necessary postulates in Boolean algebra and using them
prove the De Morgan’s theorems.

(OR)

(b) Give the steps of how the 4-variable K-map reduces the given
expression Y = m (2,4,5,7,8,10,12,15).

13. (a) State the reasons for calling NAND and NOR gates as universal
gates, explain the working of them with truth tables and diagrams.

(OR)

(b) Construct an adder that adds three bits at a time using half
adders only with proper truth tables.

14. (a) Give the steps to construct decade counter with truth table.
*
(OR)

(b) Give the steps to construct universal shift register with diagram.

15. (a) Give the steps to construct multiplexer with diagram and truth
table.

(OR)

(b) Construct programmable logic array and explain its working

principle.
*
/7235 2 [ Contd...

www.manaresults.co.in
 PART—C 10×1=10

Instructions :
*
(1) Answer the following question.
(2) The question carries ten marks.
(3) Answer should be comprehensive and the criterion for
valuation is the content but not the length of the answer.

16. Reconstruct a parallel adder as 2’s complement subtractor with circuit

diagrams.



*
/7235 3 AA22–PDF

www.manaresults.co.in
 7235
* C20-CM–302

7235
BOARD DIPLOMA EXAMINATION, (C-20)
MAY—2023
DCME - THIRD SEMESTER EXAMINATION
DIGITAL ELECTRONICS
Time : 3 hours ] [ Total Marks : 80

PART—A 3×10=30

Instructions : (1) Answer all questions.

(2) Each question carries three marks.
(3) Answers should be brief and straight to the point and shall
not exceed five simple sentences.

1. Convert 746(8) into decimal.

2. What is the importance of parity bit?

3. Draw the symbols and truth tables of basic gates.

4. List various postulates of Boolean algebra.

*
5. Classify different logic families.

6. Differentiate between level clocking and edge triggering.

7. State the need for preset and clear inputs.

8. Classify registers based on data I/O.

9. List any three applications of decoders.

10. * the applications of multiplexers.

List

/7235 www.manaresults.co.in
1 [ Contd...
 * PART—B 8×5=40

Instructions : (1) Answer all questions.

(2) Each question carries eight marks.
(3) Answers should be comprehensive and criterion for
valuation is the content but not the length of the answer.

11. (a) Convert the given numbers into decimal (i) 2B8(16) and (ii) 746(8).

(OR)

(b) Explain the use of alphanumeric codes (i) ASCII and (ii) EBCDIC.

12. (a) Give the steps of how the K-map reduces the given expression

Y = m (1, 2, 3, 5, 6, 7, 8, 13).

(OR)

(b) Draw and explain 4-bit parallel adder using full adders.

13. (a) Draw the logic diagram, truth table and timing diagram for an edge
triggered JK flip-flop. Explain its operation.

(OR)

(b) Draw the logic diagram, truth table and timing diagram for a
SR flip-flop. Explain its operation.

14. (a) Write the steps to modify the UP counter to measure both UP and
* DOWN with truth table.

(OR)

(b) Draw and explain the working of 4-bit shift left register with timing
diagram.

15. (a) Recommend an encoder for transmitting 3 outputs with the 8 line
controller with proper explanation.

(OR)

(b) Recommend a multiplexer using which 4 inputs are transmitted

* on a line with proper explanation.

/7235 www.manaresults.co.in
2 [ Contd...
 * PART—C 10×1=10

Instructions : (1) Answer the following question.

(2) The question carries ten marks.
(3) Answer should be comprehensive and the criterion for
valuation is the content but not the length of the answer.

16. Design a circuit that has a 3-bit binary input and a single output z
specified as follows :
z = 0 when the input is less than 510
z = 1 otherwise

(a) Write the truth table.

(b) Derive Boolean expression from truth table.



/7235 www.manaresults.co.in
3 AA23–PDF
 7235
C20-CM–302

7235
BOARD DIPLOMA EXAMINATION, (C-20)
OCTOBER/NOVEMBER—2023

DCME - THIRD SEMESTER EXAMINATION

DIGITAL ELECTRONICS
Time : 3 Hours ] [ Total Marks : 80

PART—A 3×10=30

Instructions : (1) Answer all questions.

(2) Each question carries three marks.
(3) Answers should be brief and straight to the point and shall
not exceed five simple sentences.

1. Convert (6E)16 to decimal and binary forms.

2. Define ‘BCD’ coding scheme.

3. State De Morgan’s theorems.

4. Draw the truth cable for NOR gate with symbol.

5. Define the terms multiplexer and demultiplexer.

6. Define positive and negative logic levels.

7. Differentiate between latch and flip-flop.

8. Define counter.

9. List the methods of data transfer in register.

10. Write any three applications of encoder.

/7235 1 [ Contd...

www.manaresults.co.in
 PART—B 8×5=40

Instructions : (1) Answer all questions.

(2) Each question carries eight marks.
(3) Answers should be comprehensive and criterion for
valuation is the content but not the length of the answer.

11. (a) Convert the following numbers into binary form :

(i) (256)10
(ii) (453)8
(iii) (41F)16
(iv) (25.25)10

(OR)

(b) Explain the about gray code.

12. (a) Draw and explain half adder using an exclusive OR and an AND
gate.

(OR)

(b) Explain the working of a serial adder with a block diagram.

13. (a) Explain the working of D flip-flop with a block diagram and
waveforms.

(OR)

(b) Draw and explain the need for a Master-Slave flip-flop.

14. (a) Draw and explain the operation of a 4-bit ring counter.

(OR)

(b) Explain the working of serial-in-parallel-out register with a circuit

diagram.

15. (a) Draw and explain the operation of 4 to 10 line decoder circuit with
a truth table.

(OR)

(b) Explain the operation of multiplexer circuit diagram with a truth

table.
/7235 2 [ Contd...

www.manaresults.co.in
 PART—C 10×1=10

Instructions : (1) Answer the following question.

(2) The question carries ten marks.
(3) Answer should be comprehensive and the criterion for
valuation is the content but not the length of the answer.

16. Is overlapping allowed in K-map? Explain with example.



/7235 3 AA23(048)–PDF

www.manaresults.co.in
 7235
C20-CM–302
*
7235
BOARD DIPLOMA EXAMINATION, (C-20)
OCTOBER/NOVEMBER—2023

DCME - THIRD SEMESTER EXAMINATION

DIGITAL ELECTRONICS
Time : 3 Hours ] [ Total Marks : 80

1
PART—A 3×10=30

35
Instructions : (1) Answer all questions.
(2) Each question carries three marks.
(3) Answers should be brief and straight to the point and shall
1
not exceed five simple sentences.
35
1. Convert (6E)16 to decimal and binary forms.

2. Define ‘BCD’ coding scheme.

1

3. State De Morgan’s theorems.

35

4. Draw the truth cable for NOR gate with symbol.

5. Define the terms multiplexer and demultiplexer.

1

* 6. Define positive and negative logic levels.

35

7. Differentiate between latch and flip-flop.

8. Define counter.

9. List the methods of data transfer in register.

10. Write any three applications of encoder.

*
/7235 1 [ Contd...

www.manaresults.co.in
 PART—B 8×5=40

*
Instructions : (1) Answer all questions.
(2) Each question carries eight marks.
(3) Answers should be comprehensive and criterion for
valuation is the content but not the length of the answer.

11. (a) Convert the following numbers into binary form :

(i) (256)10
(ii) (453)8

1
(iii) (41F)16
(iv) (25.25)10

35
(OR)

(b) Explain the about gray code.

12. (a)
1
Draw and explain half adder using an exclusive OR and an AND
gate.
35
(OR)

(b) Explain the working of a serial adder with a block diagram.

1

13. (a) Explain the working of D flip-flop with a block diagram and
35

waveforms.

(OR)

(b) Draw and explain the need for a Master-Slave flip-flop.

1

* 14. (a) Draw and explain the operation of a 4-bit ring counter.
35

(OR)

(b) Explain the working of serial-in-parallel-out register with a circuit

diagram.

15. (a) Draw and explain the operation of 4 to 10 line decoder circuit with
a truth table.

(OR)

(b) Explain the operation of multiplexer circuit diagram with a truth

* table.
/7235 2 [ Contd...

www.manaresults.co.in
 PART—C 10×1=10

Instructions :
*
(1) Answer the following question.
(2) The question carries ten marks.
(3) Answer should be comprehensive and the criterion for
valuation is the content but not the length of the answer.

16. Is overlapping allowed in K-map? Explain with example.

1


35
1
35
1
35
1

*
35

*
/7235 3 AA23(048)–PDF

www.manaresults.co.in
 *
7 2 3 6 C20-CM/WD–303

7236
BOARD DIPLOMA EXAMINATION, (C-20)
JUNE/JULY— 2022

DCME - THIRD SEMESTER EXAMINATION

OPERATING SYSTEMS
Time : 3 hours ] [ Total Marks : 80

PART—A 3×10=30

Instructions : (1) Answer all questions.

(2) Each question carries three marks.
(3) Answers should be brief and straight to the point and shall
not exceed five simple sentences.

1. Define the term booting process.

2. Write any two disadvantages of single-user OS.

3. Define the terms process and thread.

4. Write the differences between I/O bound process and CPU bound
process.
* 5. List necessary conditions for arising deadlocks.

6. Define the term process synchronization.

7. Write any differences between external and internal fragmentation.

8. Define the term overlay.

9. List any six disk performance characteristics.

10. List any three operations on directory structures.

/7236 * 1 [ Contd...

www.manaresults.co.in
 *
PART—B 8×5=40

Instructions : (1) Answer all questions.

(2) Each question carries eight marks.
(3) Answers should be comprehensive and criterion for
valuation is the content but not the length of the answer.

11. (a) Describe advantages of multiprocessor systems with respect to

web browsers.

(OR)

(b) Explain the security related problems in a multiprogramming

and time-sharing environment.

12. (a) Apply priority (non-preemptive) scheduling algorithm to calculate

the response time for processes given below. A higher priority
number has higher priority.

Process Burst Time Arrival Time Priority

P1 6 0 2

P2 4 4 3

P3 8 2 1

P4 2 3 4
*
(OR)

(b) Compare single level thread with multi-level threading for web
based application.

13. (a) Compare two kernel data structures in which race conditions
are possible. Be sure to include a description of how a race
condition can occur.

/7236 * 2 [ Contd...

www.manaresults.co.in
 *
(OR)

(b) Make use of resource allocation graph to check the system is

in safe state or not. Draw the reduced resource allocation graph.
Given processes resource usage and availability as described in
the following table :
Process Current Requests Resource
Allocation R1 R2 R3 Available
R1 R2 R3 R1 R2 R3
P0 100 120
P1 011 100
P2 120 101 111
P3 011 010

14. (a) Given six memory partitions of 300 KB, 600 KB, 350 KB,
200 KB, 750 KB and 125 KB (in order), how would the
first-fit, best-fit, and worst-fit algorithms place processes of size
115 KB, 500 KB, 358 KB, 200 KB and 375 KB (in order). Rank
the algorithms in terms of how efficiently they use memory.

(OR)

(b) Consider the following page reference string :

1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6.
How many page faults would occur for the optimal replacement
algorithm? Assume frame size is four.

* 15. (a) Compare absolute path and relative path with respect to UNIX
operating systems.

(OR)

(b) A disk queue with requests for I/O to blocks on cylinders

98, 183, 41, 122, 14, 124, 65, 67. The head is initially at
cylinder number 53. The cylinders are numbered from 0 to 199.
Starting from the current head position, calculate the total
distance (in number of cylinders) that the disk arm moves to
satisfy all the pending requests by applying FIFO disk scheduling
policy.

/7236 * 3 [ Contd...

www.manaresults.co.in
 *
PART—C 10×1=10

Instructions : (1) Answer the following question.

(2) The question carries ten marks.
(3) Answer should be comprehensive and criterion for valuation
is the content but not the length of the answer.

16. Why multilevel queue scheduling algorithm is better than Round

Robin scheduling algorithm. Justify your answer through any two
real time scenarios.

★★★

/7236 * 4 AA22-PDF

www.manaresults.co.in
 *
7 2 3 6 C20-CM/WD–303

7236
BOARD DIPLOMA EXAMINATION, (C-20)
JUNE/JULY— 2022

DCME - THIRD SEMESTER EXAMINATION

OPERATING SYSTEMS
Time : 3 hours ] [ Total Marks : 80

PART—A 3×10=30

Instructions : (1) Answer all questions.

(2) Each question carries three marks.
(3) Answers should be brief and straight to the point and shall
not exceed five simple sentences.

1. Define the term booting process.

2. Write any two disadvantages of single-user OS.

3. Define the terms process and thread.

4. Write the differences between I/O bound process and CPU bound
process.

* 5. List necessary conditions for arising deadlocks.

6. Define the term process synchronization.

7. Write any differences between external and internal fragmentation.

8. Define the term overlay.

9. List any six disk performance characteristics.

10. List any three operations on directory structures.

/7236 * 1 [ Contd...

www.manaresults.co.in
 *
PART—B 8×5=40

Instructions : (1) Answer all questions.

(2) Each question carries eight marks.
(3) Answers should be comprehensive and criterion for
valuation is the content but not the length of the answer.

11. (a) Describe advantages of multiprocessor systems with respect to

web browsers.

(OR)

(b) Explain the security related problems in a multiprogramming

and time-sharing environment.

12. (a) Apply priority (non-preemptive) scheduling algorithm to calculate

the response time for processes given below. A higher priority
number has higher priority.

Process Burst Time Arrival Time Priority

P1 6 0 2

P2 4 4 3

P3 8 2 1

P4 2 3 4
*
(OR)

(b) Compare single level thread with multi-level threading for web
based application.

13. (a) Compare two kernel data structures in which race conditions
are possible. Be sure to include a description of how a race
condition can occur.

/7236 * 2 [ Contd...

www.manaresults.co.in
 *
(OR)

(b) Make use of resource allocation graph to check the system is

in safe state or not. Draw the reduced resource allocation graph.
Given processes resource usage and availability as described in
the following table :
Process Current Requests Resource
Allocation R1 R2 R3 Available
R1 R2 R3 R1 R2 R3
P0 100 120
P1 011 100
P2 120 101 111
P3 011 010

14. (a) Given six memory partitions of 300 KB, 600 KB, 350 KB,
200 KB, 750 KB and 125 KB (in order), how would the
first-fit, best-fit, and worst-fit algorithms place processes of size
115 KB, 500 KB, 358 KB, 200 KB and 375 KB (in order). Rank
the algorithms in terms of how efficiently they use memory.

(OR)

(b) Consider the following page reference string :

1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, 1, 2, 3, 6.
How many page faults would occur for the optimal replacement
algorithm? Assume frame size is four.

* 15. (a) Compare absolute path and relative path with respect to UNIX
operating systems.

(OR)

(b) A disk queue with requests for I/O to blocks on cylinders

98, 183, 41, 122, 14, 124, 65, 67. The head is initially at
cylinder number 53. The cylinders are numbered from 0 to 199.
Starting from the current head position, calculate the total
distance (in number of cylinders) that the disk arm moves to
satisfy all the pending requests by applying FIFO disk scheduling
policy.

/7236 * 3 [ Contd...

www.manaresults.co.in
 *
PART—C 10×1=10

Instructions : (1) Answer the following question.

(2) The question carries ten marks.
(3) Answer should be comprehensive and criterion for valuation
is the content but not the length of the answer.

16. Why multilevel queue scheduling algorithm is better than Round

Robin scheduling algorithm. Justify your answer through any two
real time scenarios.

★★★

/7236 * 4 AA22-PDF

www.manaresults.co.in
 7236

* C20-CM-WD-AIM-CCN-303

7236
BOARD DIPLOMA EXAMINATION, (C-20)
NOVEMBER/DECEMBER—2022
DCME – THIRD SEMESTER EXAMINATION
OPERATING SYSTEMS
Time : 3 hours ] [ Total Marks : 80

PART—A 3×10=30

Instructions : (1) Answer all questions.

(2) Each question carries three marks.
(3) Answers should be brief and straight to the point and shall
not exceed five simple sentences.

1. Define the term system call in operating system.

2. Define the term multithreading in OS.

3. List various process states in process diagram.

4. What resources are shared by all of the threads of a process?

5. Define the term deadlock.

* 6. State the need of process synchronization.

7. List the methods used to select a free hole in continuous memory

allocation.

8. What is the difference between paging and demand paging?

9. List various allocation methods.

10. Define the terms seek time and latency time.

*
/7236 1 [ Contd...

www.manaresults.co.in
 PART—B 8×5=40

*
Instructions : (1) Answer all questions.
(2) Each question carries eight marks.
(3) Answers should be comprehensive and criterion for
valuation is the content but not the length of the answer.

11. (a) Explain batch operating systems.

(OR)

(b) Explain the components of an operating system.

12. (a) Identify the advantage of having different time-quantum sizes at

different levels of a multilevel queuing system.

(OR)

(b) For the processes given in table, draw a Gantt chart illustrating
their execution using priority scheduling (both preemptive and
non-preemptive). A higher priority number has higher priority.
Find out average waiting time of each process.

Process Burst Time Arrivas Priority

P1 4 1 3
*
P2 3 2 4

P3 3 0 6

P4 5 3 5

13. (a) Illustrate how a binary semaphore can be used to implement mutual
exclusion among n processes.

*
/7236 2 [ Contd...

www.manaresults.co.in
 (OR)

(b) Make use *of resource allocation graph to check the system is in
safe state or not. Draw the reduced resource allocation graph.
Given processes, resource usage and availability as described in
the following table :
Process Current Requests Resource
Allocation Available
A B C A B C A B C
P0 2 0 0 1 1 0
P1 3 1 0 0 0 0
P2 1 3 0 0 0 1 0 0 0
P3 0 1 1 0 1 0

14. (a) Make use of LRU page replacement policies. Find total number of
page faults for the page reference string given below. Assume that
the page frame size is three.

1, 3, 0, 1, 4, 2, 1, 0, 3, 2, 1, 4, 1, 0, 2

(OR)

(b) Initially usage of memory is allocated as specified in Figure below.

After receiving additional requests : 20K, 10K, and 5K, at what
starting address will each of the additional requests be allocated by
applying first-fit allocation method?
Used Hole Used Hole Used Hole Used Hole Used Hole
10K 10K 20K 30K 10K 5k 30K 20K 10K 15K
*
15. (a) Explain any five file operations.

(OR)

(b) A disk queue with requests for I/O to blocks on cylinders 98, 87,
160, 40, 140, 36, 72, 66, 15. The head is initially at cylinder number
60. The cylinders are numbered from 0 to 199. Starting from the
current head position, calculate the total distance (in number of
cylinders)that the disk arm moves to satisfy all the pending requests
by applying FIFO disk scheduling policy.

*
/7236 3 [ Contd...

www.manaresults.co.in
 PART—C 10×1=10

Instructions :
*
(1) Answer the following question.
(2) The question carries ten marks.
(3) Answer should be comprehensive and the criterion for
valuation is the content but not the length of the answer.

16. Is it possible to have a deadlock involving only one single-threaded

process? Justify your answer with an example.



*
/7236 4 AA22–PDF

www.manaresults.co.in
 7236
* C20-CM-WD-AIM-CCN–303

7236
BOARD DIPLOMA EXAMINATION, (C-20)
MAY—2023
DCME - THIRD SEMESTER EXAMINATION
OPERATING SYSTEMS
Time : 3 hours ] [ Total Marks : 80

PART—A 3×10=30

Instructions : (1) Answer all questions.

(2) Each question carries three marks.
(3) Answers should be brief and straight to the point and shall
not exceed five simple sentences.

1. What is spooling?

2. Define system call with an example.

3. List the advantages of Round Robin scheduling.

4. Write any three difference between process and thread.

*
5. Define deadlock.

6. List the inter-process communication methods.

7. What is address binding?

8. What is thrashing?

9. Define the terms latency time and transfer rate.

10. * various directory structures.

List

/7236 www.manaresults.co.in
1 [ Contd...
 * PART—B 8×5=40

Instructions : (1) Answer all questions.

(2) Each question carries eight marks.
(3) Answers should be comprehensive and criterion for
valuation is the content but not the length of the answer.

11. (a) Differentiate between multiprogramming and timesharing.

(OR)

(b) Explain about operating system services.

12. (a) Explain SJF scheduling algorithm with an example.

(OR)

(b) Explain multilevel scheduling.

13. (a) Explain deadlock avoidance with an example using Banker’s

algorithm.

(OR)

(b) Explain about deadlock recovery.

14. (a) Explain LRU page replacement algorithm with an example.

(OR)

(b) Explain about demand paging.

*
15. (a) Consider a disk system with 100 cylinders. The requests to access
the cylinders occur in the following sequence :

4, 34, 10, 7, 19, 73, 2, 15, 6, 20

Assuming that the head is currently at cylinder 50, what is the

time taken to satisfy all requests if it takes 1 ms to move from one
cylinder to adjacent one and shortest seek time first policy is used.

(OR)

(b)* List and explain various file allocation methods.

/7236 www.manaresults.co.in
2 [ Contd...
 * PART—C 10×1=10

Instructions : (1) Answer the following question.

(2) The question carries ten marks.
(3) Answer should be comprehensive and the criterion for
valuation is the content but not the length of the answer.

16. Write about semaphore. If a counting semaphore S is initialized to 10,

then 6 P operations and 4 V operations are performed on S. What is the
final value of S?



/7236 www.manaresults.co.in
3 AA23–PDF
 7236
C20-CM-WD-AIM-CCN–303

7236
BOARD DIPLOMA EXAMINATION, (C-20)
OCTOBER/NOVEMBER—2023
DCME – THIRD SEMESTER EXAMINATION
OPERATING SYSTEMS
Time : 3 hours ] [ Total Marks : 80

PART—A 3×10=30

Instructions : (1) Answer all questions.

(2) Each question carries three marks.
(3) Answers should be brief and straight to the point and shall
not exceed five simple sentences.

1. Define operating system.

2. What is Spooling?

3. What is process control block?

4. List the different scheduling criteria for schduling.

5. What is Process Synchronization?

6. List the necessary conditions for deadlock.

7. What is address binding?

8. What is Segmentation?

9. List the various file operations.

10. List the different Disk Performance Parameters.

/7236 1 [ Contd...

www.manaresults.co.in
 PART—B 8×5=40

Instructions : (1) Answer all questions.

(2) Each question carries eight marks.
(3) Answers should be comprehensive and criterion for
valuation is the content but not the length of the answer.

11. (a) Explain the components of operating system.

(OR)

(b) What is system call? Explain different types of system calls.

12. (a) Draw and explain process state diagram.

(OR)

(b) Consider a set of four processes P1, P2, P3 and P4 arriving all at
time instant 0 and CPU burst times are shown below :

Process Burst time

P1 21

P2 3

P3 6

P4 2

Draw Gantt Chart and find average turn around time and average
waiting time using SJF Scheduling Algorithm (Non-Preemptive)

13. (a) Explain inter process communication.

(OR)

(b) Define deadlock. Explain various techniques for deadlock

prevention.

14. (a) Explain paging concept with neat diagram.

(OR)

(b) Describe LRU Page Replacement Algorithm and assuming there

are 3 frames and the page reference string is 1, 2, 1, 0, 3, 0, 4, 2, 4.
Find the number of page faults using LRU Page Replacement
Algorithm.

/7236 2 [ Contd...

www.manaresults.co.in
15. (a) Explain various file access methods.

(OR)

(b) Explain SCAN Disk Scheduling Algorithms with example.

PART—C 10×1=10

Instructions : (1) Answer the following question.

(2) The question carries ten marks.
(3) Answer should be comprehensive and the criterion for
valuation is the content but not the length of the answer.

16. Consider a system with five processes P0 through P4 and three resources
of type A, B and C. Resource type A has 10 instances, type B has 5
instances and type C has 7 instances. Suppose at time to following
snapshot of the system has been taken :

Process Allocation Max Available

A B C A B C A B C
P0 0 1 0 7 5 3 3 3 2
P1 2 0 0 3 2 2
P2 3 0 2 9 0 2
P3 2 1 1 2 2 2
P4 0 0 2 4 3 3

Find out the Need Martix and check the system is in safe state or not
using Banker’s Algorithm. If yes, then what is the safe sequence?



/7236 3 AA23(048)–PDF

www.manaresults.co.in
 7236
C20-CM-WD-AIM-CCN–303
*
7236
BOARD DIPLOMA EXAMINATION, (C-20)
OCTOBER/NOVEMBER—2023
DCME – THIRD SEMESTER EXAMINATION
OPERATING SYSTEMS
Time : 3 hours ] [ Total Marks : 80

PART—A 3×10=30

Instructions : (1) Answer all questions.

(2) Each question carries three marks.
(3) Answers should be brief and straight to the point and shall
not exceed five simple sentences.

1. Define operating system.

2. What is Spooling?

3. What is process control block?

4. List the different scheduling criteria for schduling.

5. What is Process Synchronization?

*
6. List the necessary conditions for deadlock.

7. What is address binding?

8. What is Segmentation?

9. List the various file operations.

10. List the different Disk Performance Parameters.

*
/7236 1 [ Contd...

www.manaresults.co.in
 PART—B 8×5=40

*
Instructions : (1) Answer all questions.
(2) Each question carries eight marks.
(3) Answers should be comprehensive and criterion for
valuation is the content but not the length of the answer.

11. (a) Explain the components of operating system.

(OR)

(b) What is system call? Explain different types of system calls.

12. (a) Draw and explain process state diagram.

(OR)

(b) Consider a set of four processes P1, P2, P3 and P4 arriving all at
time instant 0 and CPU burst times are shown below :

Process Burst time

P1 21

P2 3

P3 6

P4 2

Draw Gantt Chart and find average turn around time and average
waiting time using SJF Scheduling Algorithm (Non-Preemptive)

13. (a) Explain inter process communication.

* (OR)

(b) Define deadlock. Explain various techniques for deadlock

prevention.

14. (a) Explain paging concept with neat diagram.

(OR)

(b) Describe LRU Page Replacement Algorithm and assuming there

are 3 frames and the page reference string is 1, 2, 1, 0, 3, 0, 4, 2, 4.
Find the number of page faults using LRU Page Replacement
Algorithm.
*
/7236 2 [ Contd...

www.manaresults.co.in
 15. (a) Explain various file access methods.

* (OR)

(b) Explain SCAN Disk Scheduling Algorithms with example.

PART—C 10×1=10

Instructions : (1) Answer the following question.

(2) The question carries ten marks.
(3) Answer should be comprehensive and the criterion for
valuation is the content but not the length of the answer.

16. Consider a system with five processes P0 through P4 and three resources
of type A, B and C. Resource type A has 10 instances, type B has 5
instances and type C has 7 instances. Suppose at time to following
snapshot of the system has been taken :

Process Allocation Max Available

A B C A B C A B C
P0 0 1 0 7 5 3 3 3 2
P1 2 0 0 3 2 2
P2 3 0 2 9 0 2
P3 2 1 1 2 2 2
P4 0 0 2 4 3 3

Find out the Need Martix and check the system is in safe state or not
* using Banker’s Algorithm. If yes, then what is the safe sequence?



*
/7236 3 AA23(048)–PDF

www.manaresults.co.in
 7224
C20-C-CM–301

7224
BOARD DIPLOMA EXAMINATION, (C-20)
OCTOBER/NOVEMBER—2023
DCE–THIRD SEMESTER (COMMON) EXAMINATION
ENGINEERING MATHEMATICS—II
Time : 3 Hours ] [ Total Marks : 80

PART—A 3×10=30
Instructions : (1) Answer all questions.
(2) Each question carries three marks.

7 3
1. Evaluate  (x   sin x )dx
x

cos(log x )
2. Evaluate  x
dx

3. Evaluate  sin 8x cos 3x dx

4. Evaluate  x 3e 2x dx

1 1
5. Evaluate 0 dx
1  x2

6. Find the mean value of y = x3 + x between x = 0 and x = 1.

7. Find the area bounded by the curve y = x2, X-axis between x = 1 and x = 2.

8. Find the differential equation of the family of curves y = A cos x + B sin x,

where A and B are arbitrary constants.

/7224 1 [ Contd...

www.manaresults.co.in
 dy 1  y2
9. Solve  0
dx 1  x2

10. Solve x4dx + y4dy = 0

PART—B 8×5=40

Instructions : (1) Answer any five questions.

(2) Each question carries eight marks.

1
11. (a) Evaluate  4  5 cos x dx

(OR)

1
(b) Evaluate  x 2  4x  13 dx

12. (a) Evaluate  sin4 x cos3 x dx

(OR)

1
(b) Evaluate  x tan x dx


13. (a) Evaluate 2 sin x
0 sin x  cos x
dx

(OR)

1 3x 
(b) Show that 1 log  3  x  dx  0

/7224 2 [ Contd...

www.manaresults.co.in
14. (a) Find the R.M.S value of 27  4x 2 from x = 0 to x = 3.

(OR)

(b) Find the area enclosed between the curve y = x2 and the line
2x – y + 3 = 0.

1 1
15. (a) Evaluate 0 dx using trapezoidal rule by taking n = 4
1 x

(OR)

(b) Find the volume generated by the revolution of the ellipse

9x2 + 25y2 = 225 about X-axis.

PART—C 10×1=10

Instructions : (1) Answer the following question.

(2) The question carries ten marks.

16. Solve (x2 + y2) dx = 2xy dy.



/7224 3 AA23(048)–PDF

www.manaresults.co.in