Anna University Question Papers For CSE 3rd Semester

hii , i am looking for question papers for cse 3rd semester of Anna university so can you provide me the website address where i can download it.

[Pathak]

Here I am giving you question paper of computer science and engineering third semester of data structure subject as below:-


PART A — (10 × 2 = 20 Marks)

1. What is abstract data type?

2. Give any four applications of stack.

3. What is meant by binary search tree?

4. Write the advantages of threaded binary tree.

5. Define B-Tree.

6. What is sentinel?

7. What is primary clustering?

8. What is meant by rehashing?

9. What are articulation points?

10. What is activity-node graph?

PART B — (5 × 16 = 80 Marks)

11. (a) (i) Explain the process of postfix expression evaluation with an
example. (8)
(ii) Write a program to print the elements of a singly linked list. (8) Or

(b) (i) Explain with an example the creation of a linked list, insertion and deletion of nodes, and swapping of any two nodes. (10)

(ii) Explain the process of conversion from infix expression to postfix expression using stack. (6)

12. (a) (i) Explain the operations of insertion of nodes into and deletion of nodes from, a binary search tree with code. (10)

(ii) Construct an expression tree for the expression (a + b * c) + ((d * e + 1) * g). Give the outputs when you apply preorder, inorder and postorder traversals. (6)

Or

(b) Give the analysis of insertion and deletion operations of nodes in binary search tree. (16)
13. (a) Explain the operations which are done in B-Tree with examples. (16) Or

(b) What is heap order property? Explain the operations which can be done in heap with examples. (16)

14. (a) Briefly explain the three common collision resolution strategies in open addressing hashing. (16)

Or

(b) Give an account on the following:
(i) Dynamic equivalence problem. (8)
(ii) Smart union algorithms. (8)

15. (a) Define network flow problem. Explain the maximum flow algorithm for the graph given below. (16)
Or

(b) (i) Explain the Kruskal’s algorithm with an example. (10)
(ii) Give a short note on Euler circuits. (6)

hii sir, will you please provide me the question paper of the Anna university B.tech 4 th semester Computer science stream of the subject computer architecture ?

[Raman Vij]

As you asking for the question paper of the university B.tech 4 th semester Computer science stream of the subject computer architecture the question paper is as follow:


Part A
. Distinguish between autoincrement and autodecrement addressing mode.
2. Compare RISC with CISC architecture.
3. Under what situations the micro program counter is not incremented after a
new instruction is fetched from micro program memory?
4. What are the relative merits of horizontal and vertical microinstruction
format?
5. What is pipelining and what are the advantages of pipelining?
6. List the key aspects in gaining the performance in pipelined systems.
7. How many memory chips are needed to construct 2 M × 16 memory system
using 512 K × 8 static memory chips?
8. What is virtual memory and what are the benefits of virtual memory?
9. What is meant by bus arbitration?
10. Name and give the purpose of widely used bus standard


1PART B — (5 × 16 = 80 Marks)
11. (a) (i) Describe the role of system software to improve the performance of
a computer. (Marks 8)
(ii) Design a 4-bit adder/subtracter circuit using full adders and explain
its function. (Marks 8)
Or
(b) (i) What are the special registers in a typical computer? Explain their
purposes in detail. (Marks 8)
(ii) Design a 4-bit fast adder and explain its function in detail. (Marks 8)

rest of the question paper you may find from the below attachement that is free to download .


Anna university B.tech 4 sem CSE Computer Architecture Question paper