Paper 3 2008 Full Marks : 75
Paper- 4 2008 Full Marks : 75
Paper - 4 2010 Time: 3 hours Full Marks: 75 Candidates are required to give their answers in their own words as far as practicable. The questions are of equal value. Answer any five questions. 1. (a) Define and explain the concept of data structures. (b) What do you mean by abstract data structures?
2. What do you mean by stack? Explain the primitive operation which can be performed on stack. 3. What do you mean by queues? Discuss Circular queue and priority queue. 4. What do you mean by linked list of stack and linked list of queue? Explain doubly linked list and circular linked list. 5. Discuss the basic terminology of tree. Explain the tree representation of array and Linked list. 6. What are the applications of binary tree and threaded binary tree? Explain the binary tree representation of trees. 7. Explain sequential searching and binary search. Discuss insertion sort, selection Sort and quick sort. 8. What do you mean by Hash table? Explain collision resolution technique. 9. What do you mean by directed, undirected and weighted graphs? Discuss the representation of graphs. 10. Write short notes on any three of the following: (a) Bubble sort (b) Comparison of sorting methods (c) Representation of Graphs (d) Analysis of algorithms Paper - 4 2010 Time: 3hour Full Marks: 75 Candidates are required to give their answers in their own words as far Practicable. The questions are of equal value. Answer Five questions, selecting at least two from each Group. Group- A 1. What is meant by Network-Topology? Describe three commonly used Network Topologies with their relative advantages and disadvantages. 2. (a) What is the major advantage of shielded twisted pair over unshielded Twisted pair wise? (b) Why is the major advantage of shielded twisted pair cables? 3. Explain the circuit switching. Explain time division switching. What are the Functions of control signaling?
4. (a) What is e- mail? What is its Protocol? (b) What is the purpose of simplex mail Transfer Protocol (SMTP)? 5. What are the different types of basic logic gates? Explain with the help of Truths tables and give an example of each gate. Group B 6. (a) Explain the four basic date types in C. What is the size in bytes of each type in DOS and UNIX Platform? (b) What is constant? Explain the four basic types of constant in C? 7. What are the condition control transfer statements in C? Explain the Difference between while and do while loops with respect to the minimum Number of times the body of the loop is executed. 8. (a) What is the difference between scanf ( ) and get ( ) with respect to Data input with embedded white space character? (b) How many variables can be accepted by one scanf statement? 9. What is a function? How is it declared in C? What is meant by call by reference and call by value? Explain recursive function and list its merits and demerits with examples. 10. Write short notes on any three of the following: (a) Guided and Unguided media. (b) Serial and Parallel communication. (c) Internet and Intranet (d) Single and Multidimensional arrays. (e) Structure and Union. Paper - 4 2011 Full Marks: 75 Time: 3 hours Candidates are required to give their answers. In their own words as far as practicable The figures in the margin indicate full marks. Questions are of equal value. Answer any five questions 1. What do you mean by algorithms & flow charts? Discuss the complexity of algorithm? 2. Transform the following infix expression into postfix notation. ( a ) 5 * X + 3 * ( X 11 ) ( b ) 2 ( a + b ) 7 ( c + d )
3. What do you mean by linked list? Discuss its advantage over array? Write an algorithm to insert an item in the singly linked list. 4. What are the applications of stack? Discuss infix, postfix and prefix notation with example? 5. Discuss doubly linked list & circular linked list with necessary algorithm. 6. Explain traversal of binary tree inorder, preorder & pos order? Also discuss application of binary tree? 7. (a) Explain the process of searching? What is the advantage of binary search over selection search? (b) Write the algorithm for bubble sort. 8. What is Graph? Discuss the terminology of graph? Also explain Depth first search? 9. What do you mean by Auto CAD? Explain the features of Auto CAD in detail? 10. Write short notes on any three: i) Circular queue (ii) Radix sort (iii) Hash Table iv) Recursion (V) High Balanced Tree. Paper - 5 2011 Full Marks: 75 Time: 3 hours Candidate are required to give their answers in their own words as far as practicable The figures in the margin indicate full marks. Question are of equal value Answer any five questions Group A 1. What do you mean by Computer networks? Describe different modes of data communication? 2. What is switching? Discuss circuit switching, packet switching and message switching. 3. Explain K-map its significance? Discuss 2-variable K-map. 4. Discuss different network devices in details? 5. Write short notes on (a) Optical Fiber (b) URL (c) VSAT GROUP B
6. (a) Discuss the features of C language? (b) Describe variable, expressions & identifiers? 7. Discuss different formatted & unformatted Input / Output functions in C, with suitable example? 8. (a) Discuss nested if else & else if ladder? (b) Write a program to find the roots of quadratic equation ax2 + bx +c=0 9. What is array? How to declare and initialize it? Write program to sort a list of nos. in ascending order? 10. Write notes on the following i) Pointer (ii) function (iii) break & continue. Paper - 3 2012 Time: 3 hours Full Marks: 75 Candidates are required to give their answers in their own words as far as practicable. The questions are of equal value. Answer any five questions, selecting at least one from each group. GROUP A 1. What is Network Topology? Explain the different types of network topologies with the help of diagram. 2. What do you mean be communication channel? Explain any two channels with properties each. 3. Discuss the architecture of OSI model? Explain the functions of each layer in OSI model. 4. State and prove De Morgan s theorem in Boolean algebra. 5. Write short notes on any three of the following: (a) Protocols (b) E-mail (c) Logic gates (d) Dial up connectivity Group- B 6. Explain the structure of a C-program with its major elements. 7. What are the different data types available in C-language? How can you perform type conversion in expression?
8. (a) What is loop control? Differentiate between while ( ) and do- while ( ) loop controls. (b) Write a C-program to find the sum of N-natural Numbers using for ( ) loop. 9. (a) What is recursion? Write a recursive function to find factorial of n. (b) Differentiate between structure and union. 10. Write short notes on any three of the following: (a) String (b) Array (c) Dynamic memory allocation (d) File handling functions. Paper - 4 2012 Time: 3 hours Full Marks: 75 Candidates are required to give their answers in their own words as far as practicable. The questions are of equal value. Answer any five questions. 1. What is data structure? Explain the different operations to be performed on data structure. 2. How do you implement a stack in C? Write algorithms to perform push and pop operations on a stack. 3. What is circular queue? What are its advantages? Write the algorithms for the insertion and deletion operations performed on the circular queue. 4. Evaluate the following postfix expressions: (i) ABC* + given A = 12.5, B=6.35, C=5.75 (ii) AB?C* given A = 3, B = 2, C = 8 (iii) AB + CD - * given A = 1, B = 2, C = 3, D = 4 5. What are the different types of binary trees? Discuss the array representation of a binary tree. 6. Explain the properties of a B-tree? Write the algorithm for insertion in a B tree. 7. Describe the complexity analysis of sequential searching. Write the algorithm to find the desired element in an array using sequential searching technique. 8. Describe the efficiency of Quick - sort algorithm. Write a quick sort algorithm to arrange a list of integers. 9. Explain the different representations of a graph data structure.
10. Write short notes on any three of the following: (a) Abstract data type (b) Dequeue (c) Di graph (d) Recursion (e) List