MODEL QUESTION PAPER : 2023-24

Course Code: BCIAJ302

VIDYAVARDHAKA COLLEGE OF ENGINEERING

Autonomous Institute, Affiliated to Visvesvaraya Technological University, Belagavi
Gokulam, 3rd Stage, Mysuru 570 002
Third Semester B.E. Examinations
COURSE NAME: Advanced Java
Duration: 3 hours Max. Marks: 100
INSTRUCTION TO STUDENTS
1) Answer One Full question from each module
Q. No.
Module-I Marks BL CO

1. (a) Apply the usage of isAlive( ) and join( ) with a suitable example. 12 L3 CO2

1. (b) Analyse the different types to create a thread. 8 L4 CO3

Module-II

2. (a) Explain the different types of interfaces and its description. 8 L2 CO1

2. (b) Construct the program to demonstrate the usage of LinkedList class. 12 L3 CO2

OR

3.(a) Explain the different collection classes and describe any six of them. 8 L2 CO1

3.(b) Construct the program to demonstrate the usage of hashSet class. 12 L3 CO2

Module-III

Construct different string character extraction methods with suitable example. 12 L3 CO2
4.(a)

4.(b) Compare and contrast the different string modifying techniques. 8 L4 CO3

OR
Construct the different string methods with suitable example. 12 L3 CO2
i. Append()
5(a) ii. Insert()
iii. Reverse()
iv. Replace()

5(b) Compare and contrast the different string comparison method. 8 L4 CO3

Module IV

6.(a) Explain the concept handling HTTP requests and responses. 10 L2 CO1

Develop a Java Program that applies any three cookie methods with suitable 10 L3 CO2
6.(b)
example. 1
 MODEL QUESTION PAPER : 2023-24
Course Code: BCIAJ302

Module V

7.(a) Explain the different JDBC process. 12 L2 CO1

7.(b) Analyse the concept of retrieving all the rows from the customers table. 8 L4 CO3

2
 MODEL QUESTION PAPER : 2023-24
Course Code: BCIDS303/CS303/IS303

VIDYAVARDHAKA COLLEGE OF ENGINEERING

Autonomous Institute, Affiliated to Visvesvaraya Technological University, Belagavi
Gokulam, 3rd Stage, Mysuru 570 002
Third Semester B.E. Examinations
COURSE NAME: DATA STRUCTURES AND ITS APPLICATIONS
Duration: 3 hours Max. Marks: 100
INSTRUCTION TO STUDENTS
1) Answer One Full question from each module
2) Three module questions are compulsory and remaining two module will have internal choice
Q.
No. Module-I Marks BL CO

Explain the concept of dynamic memory allocation with an example. 6 L2 CO1

1.(a)
Apply the Knuth Morris Pratt pattern matching algorithm for the given pattern 8 L3 CO2
1.(b) “abcdabcy” in the text “abcxabcdabxabcdabcdabcy” and also write the algorithm
for the same.
Analyse the given two polynomials p(x)=4x3+6x2 +7x+9 and q(x)=3x2+2x+4 and 6 L4 CO3
1.(c) write a suitable ‘C’ function to add two polynomials and print the resultant
polynomial using 1D- array.
(OR)
Explain the concept of data abstraction with an example. 6 L2 CO1
2.(a)
2.(b) Develop a ‘C’ program to reverse the given string without using built-in function. 8 L3 CO2

Analyse the given input array and output array, Select the suitable sorting algorithm 6 L4 CO3
which works based on significance of digit to sort the given array and write the C
function for the same.
2.(c) Input 5 67 1 72 4 55

Output 1 4 5 55 67 72

Module-II
Describe a Priority Queue. Explain the One-way list representation of a Priority 5 L2 CO1
3.(a)
Queue.
Implement a program to solve the Tower of Hanoi problem with n disks. Show the 8 L3 CO2
3.(b)
tower representation for n=3

1
 MODEL QUESTION PAPER : 2023-24
Course Code: BCIDS303/CS303/IS303

The contents of a stack S are as follows: 7 L4 CO3

Stack(S) 99 2 44 8
Index 0 1 2 3 4 5 6 7

The stack can store a maximum of eight elements and the top pointer currently
points at index 3. Analyse and show the stack contents by indicating the position of
3.(c) the top pointer after each of the following stack operations:
a) Push(S,5)
b) Push(S,7)
c) Pop(S)
d) Pop(S)
e) Pop(S)
f) Push(S,-1)

Module-III

4.(a) Explain the advantages and disadvantages of Linked list. 6 L2 CO1

4.(b) Illustrate the following operations on singly linked list with a code segment. 8 L3 CO2
a)Insert at front end b) Delete from rear end
Assume that you have a singly linked list, rotate the linked list counter-clockwise 6 L4 CO3
by k nodes, where k is a given positive integer. Assume that k is smaller than the
count of nodes in a linked list.
4.(c) For example, if the given linked list is 10->20->30->40->50->60 and k is 4, the list
should be modified to 50->60->10->20->30->40.
Generate a C function for the same.

Module- IV

Explain the concept of Threaded Binary Tree in detail. 5 L2 CO1

5.(a)
Construct a Binary search tree for the given data: 100,85,45,55,110,20,70,65 and 10 L3 CO2
5.(b)
also perform tree traversal techniques for the same.
Analyse the given inorder and postorder traversal and construct preorder traversal 5 L4 CO3
for the same.
5.(c) Inorder: d j g b h e a f k i c
Postorder : j g d h e b k i f c a

Module- V
Explain minimum cost spanning tree with an example. 6 L2 CO1
6.(a)

6.(b) Illustrate directory less dynamic hash table to insert and delete a directory pair into 8 L3 CO2
it.

2
 MODEL QUESTION PAPER : 2023-24
Course Code: BCIDS303/CS303/IS303

Let G be a connected, undirected graph of n vertices. Infer that G must have at least 6 L4 CO3
6.(c) n-1 edges and that all are connected, undirected graphs with n-1 edges are trees.

(OR)

7.(a) Discuss the different types of hash functions. 6 L2 CO1

7.(b) Develop a C function to perform insert and left rotation operations in AVL trees. 8 L3 CO2

Analyse the following graph using DFS and display the nodes reachable from 6 L4 CO3
source vertex ‘S’ and write the algorithm for the same.

7.(c)

3
 MODEL QUESTION PAPER 2023-24
Course Code: BCICO304

VIDYAVARDHAKA COLLEGE OF ENGINEERING

Autonomous Institute, Affiliated to Visvesvaraya Technological University, Belagavi
Gokulam, 3rd Stage, Mysuru 570 002
THIRD Semester B.E. Examinations
COMPUTER ORGANIZATION
Duration: 3 hours Max. Marks: 100
INSTRUCTION TO STUDENTS
Answer One Full question from each module
Q.
No. Marks BL CO

Module-I
Explain the basic operational concepts between the processor and the 8 L2 CO1
1. (a)
memory.
1. (b) Apply straight line sequencing to perform the operation C=[A]+[B] 6 L3 CO2

Assuming that the reference computer is ultra SPARCIO workstation 6 L3 CO2

with 300 MHz ultra-SPARC processor. A company must purchase 1000
new computers, hence ordered testing of new computer with SPEC
2000.
Following observations were made.
Programs Run time on reference Run time in
computer new computer
1 50 min 5 min
1. (c) 2 75 min 4 min
3 60 min 6 min
4 30 min 3 min
The company system manager will place the order for purchasing new
computers only if the overall SPEC rating is at least 12. After the said
test will the system manager plan to place order for purchase of new
computers?

Module-II
Explain the two approaches for bus arbitration. 8 L2 CO1
2.(a)

Illustrate the situations where a number of devices capable of initiating 6 L3 CO2

2.(b) interrupts are connected to the processor? How to resolve them.

With the neat diagram, illustrate the use of PCI bus in a computer 6 L3 CO2
2.(c)
System.
OR

1
 Explain various methods of handling multiple interrupt requests. 8 L2 CO1
3.(a)

3.(b) Identify the differences between Synchronous and Asynchronous Bus. 6 L3 CO2

Consider a Distributed Arbitration scheme, assume that two devices, A 6 L3 CO2

3.(c) and B having ID number 5 and 6 respectively are requesting the use of
the bus. Illustrate which device wins the contention and why?
Module-III

By applying the concept of RAM memories, Illustrate internal 10 L3 CO2

4.(a)
organization of a 2MX8 asynchronous DRAM chip.
4.(b) With the help of neat diagram, Analyze addressing multiple module 10 L4 CO3
memory systems.
(OR)
5.(a) With a neat diagram, Illustrate synchronous DRAM. 10 L3 CO2

5.(b) Distinguish between Direct Mapping, Associative Mapping and Set 10 L4 CO3
Associative Mapping

Module- IV

Apply the three levels of Carry Save Addition operations for the 10 L3 CO2
6.(a) following bits 101101 and 111111 and show the result.
Perform the operations on 5 - bit signed numbers using 2’s complement 10 L4 CO3
system. Also analyze whether overflow has occurred.
6.(b)
i) (-10) + (-13)
ii) ii) (-10) - (-13)
Module- V
7.(a) Explain the control sequence for execution of an unconditional branch 10 L2 CO1
instructions.
Utilize the basic ideas of instruction pipeline and illustrate parallel 10 L3 CO2
7.(b)
programming concepts