2016  Paper (H‐3) Answer any five questions, selecting at least two from each group ..

 
                                              ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐Group  ‐‐ A‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ 

1. What is computer network ? What are the advantages and disadvantages of computer network ? 
Explain. 
 
2. What do you mean by guided and unguided media ? Describe about the different types of guided 
and unguided media. 
 
3. What  do  you  mean  by  data‐transmission  ?Explain  about  the  different  categories  of  data‐
transmission with example.  
 
4. What is TCP/IP model ? Explain the functions and protocols of each layer? Compare it with OSI 
model. 
 
5. What are the different types of basic logic‐gates ? Explain with the help of truth‐tables and give 
an example of each gate. 
 
                                ‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐Group – B‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐‐ 
 
6. What do you mean by variable and constant? Explain about the different types of constant in C. 
 
7. 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 example. 
 
8. (a) What do you mean by array ? Give their characteristics features. 

               (b) illustrate the initialization of a two‐dimensional array with example. 

       9.   (a) What is a loop ? what it is necessary in the program ? write the syntax of while loop ? Draw a          
control design of while‐loop . 

             (b) What will be the output of the following program when executed :‐ 
main() 
         
{ 
 
Int a= 1, sum=0; 
 
Clrscr(); 
 
While(a<=10) { 
 
    Printf(“%3d”,a); 
 
    Sum= sum + a; 
 
     a++; 
 
  } 
 
  printf(“\nSum of 10 Numbers : %d”,sum); 
 
} 
         10..  Write Short Notes on any two of the following :‐  

a) URL   b).  ISP    c).  Features of C   d).  Single and Multidimensional Array   

e)    Duality Principal 
 Year :‐ 2016   Paper (H‐4) Data Structure 
Time: 3 hours Full Marks : 75 ## Answer any five questions

1. What do you mean by data‐structure ? What are the differences between 
data type and abstract data‐type? 
 
2. What are doubly linked list? What is the difference between a linked list 
and circular linked list ? 
 
3. What is recursion ? What are the different types of recursion ? What is the 
need of stack in implementing a recursive function ? 
 
4. Define the term queue and de‐queue ? Write an algorithm to implement 
queue by using linked list . 
 
5. What do you mean by binary tree? Write a recursive function for in order , 
post order and pre order traversal of a binary tree. 
 
6. What is a Graph ? Compare graph with tree . when does a graph become a 
tree ? 
 
7. a).  What do you mean by linear search and binary search ? explain with 
example . 
 
b).  List the advantages of binary search over linear search. 
          
8. Explain about the different types of sorting . Give an algorithm for heap 
sort. Also calculate the complexity. 
 
9. a).  What do you mean by an array ? Give their characteristics features. 
 
b).  Construct the given infix expression into Postfix Expression :‐ 
                                                                                                                                                 
A + ( B * C – ( D / E ^ F ) * G ) * H 
                                                                                                             
  
10.  Write Short Notes on any Two of the following :‐ 
a) Priority Queue 
 
b) Stack and Queue as a Circular Linked list 
 
c) Depth and Breadth First Search 
 
d) Collision Resolution techniques 
e) Heap Sort   
2014 (H-4) :: Data Structure :: Answer Any Five Questions

1) Explain the classification of data structures.

2) What is an algorithm? Discuss best case, average case and worst case analysis
of algorithm.

3) What do you mean by fucue data structure? Explain the different types of fucue
data structure with their characteristics.

4) a) What are the advantages of a doubly linked list over a singly linked list?

b) Write an algorithm to insert a new node at the end of a singly linked list.

5) a) How can you represent a Binary tree?

b) Discuss In order, Preorder & Post order traversal of a Binary tree.

6) Convert the following infix expression into its equivalent prefix and postfix from:
a) a + ( b + c *( d + e )) + f / g

b) a +(( b + c) * ( d + e ) + f / g )

7) Draw a binary tree with the following sequence of nodes in pre order and In order
Traversal :
Pre order: G, B, Q, A, C, K, F, P, D, E, R, H

In order : Q, B, K, C, F, A, G, P, E, D, H, R

8) Explain Breadth first traversal and Depth traversal of a graph.

9) a) Write an algorithm for selection sort.

b) Sort the following list in ascending order using selection sort :

56, 57, 92, 38, 44, 90, 61, 73

10) Write short notes on any three the following :

a) Searching

b) Applications of stock

c) Abstract data types

d) Hash table

f) Directed and Undirected graphs.

2017 (H-3) Answer Total 5 Questions but at least two from each group .
---------------------Group – A----------------
1. What is OSI model? Explain the functions and protocols of each layer? Compare
it with TCP/ IP model.

2. What is topology ? Explain different types of topologies.

3. What do you mean by guided and unguided media? Explain the different types of
guided and unguided media.

4. What is K-Map? Design Half adder using K- Map.

5. Explain the following (any two) ::-

(a) Circuit switching.

(b) Optical fibre

(c) E-Mail

(d) Duality Principle

(e) Half Duplex

------------------------Group – B -------------------

6. What do you mean by C language? Explain the features of C language.

7. Explain different types of operators which are used in C language.

8. (a). Define switch statement. Explain it with syntax and flow-chart.

(b). What do you mean by array ? Write a C program to demonstrate the use of
an array .

9. (a). What is loop? Why it is necessary in the program? Write the syntax of the for
Loop. Draw a control diagram of for loop.

(b). What will be the output of the following program when executed:

Void main ( ) 

{ 

Int a=5; 

Clrscr(); 

For(a=1;a<=10;a++) 

{ } 
10. Write short notes on any two of the following :
a. Function Printf(“\n a = %d”,a); 
b. Sizeof( )
} 
c. Preprocessor directive & commands
d. File pointer
e. Storage classes
2017 (H-4) :: Data Structure :: Answer Any Five Questions

1. What is a binary tree? Differentiate between strictly binary tree and complete
binary tree. What will be the inorder traversal of the given tree?

2. Construct the tree if preorder and inorder

traversal of binary tree is given.

Preorder - ABCDFHJMKEGILN

lnorder – ADJMHKFCINLGEB

3. Define a queue. How it is differ from a stack?

Describe the insert and delete operation on a queue.

4. Compare the advantages and disadvantages of implementing stack as an array

with implementing a stack as a linked list.

5. Write short notes on any three of the following :

a. Heap sort
b. Header nodes
c. Non linear Data Structure
d. Traversal of Binary tree
e. Network topologies
f. Abstract data type

6. Describe DFS algorithm. Find out the DFS traversal of the following graph
starting at node A.

7. Explain the difference between Kruskal and Prims algorithm with a suitable
example.

8. What is threaded binary tree ? Mention its advantages and disadvantages.

9. Write the steps to sort the following list in ascending using selection sort :

60, 61, 96, 42, 48, 94, 65,77

10. Differentiate between any two of the following :

a. Circular queue and Dequeue
b. Btree and B+ tree
c. Double linked list and Circular linked list
d. Directed and undirected graph
 2015 (H-4) :: Data Structure :: Answer Any Five Questions

1. What do you mean by Data Structure ? Explain the different categories of

data structure with examples.

2. a). Define stack ? What are the different possible operations on stack ?

b). Evaluate postfix expression ::

E : 2 3 10 + * 8 2 / -

3. Define Double Ended Queue (deque). Write an algorithm of insertion and

deletion.

4. What is Linked list ? How does it differ from Array ?

5. Suppose POLY1 and POLY2 are polynomials which are stored in linked
lists. Write a procedure which finds the sum of POLY1 and POLY2.

6. Explain the following terms with a suitable example in context of binary

trees :-

a. Leval of a node

b. Depth of the tree

c. Degree of the tree

d. Complete binary tree

e. Threaded binary tree

7. Construct binary tree of the algebric expression and also write in prefix
and postfix notation.

E = [ a + (b – c)] * [(d – e) / (f + g – h)] 
8. Create B – Tree of order 5 from the following list of elements ::

30, 20, 35, 95, 15, 60, 55, 25, 5, 65, 70, 10, 40, 50, 80, 45 

9. Write an algorithm of Quick sort, test the algorithm manually using ::

44, 33, 11, 55, 77, 90, 40, 60, 99 , 22, 88, 66  

10. Define minimum cost spanning tree. Write Prim’s algorithm to gemerate a
minimum cost spanning tree for any given weighted tree.
 2013 (H-4) :: Data Structure :: Answer Any Five Questions

1. What is Graph? Discuss the terminology of graph? Also explain Depth first
search ?

2. What do you mean by Auto CAD? Explain the features of Auto CAD in detail?

3. What is linked list? How is it different from array? How can insertion and deletion
operation be performed in the linked list?

4. Write the algorithm of quick sort and calculate the complexity of quick sort in
worst case.

5. Differentiate among graph, tree binary tree and complete binary tree.

6. Discuss doubly linked list & Circular linked list with necessary algorithm.

7. Write the algorithm of Kruskal and Prim’s for minimum spanning tree.

8. Define binary search tree. How can it be stored in computer memory as an

array? Give suitable example.

9.
a). Explain the process of searching? What is the advantage of binary search
over selection search?

b). Write the algorithm for bubble sort.

10. Write short notes on any three of the Following :

a. Radix Sort

b. Hash table and collision resolution technique

c. Heap Sort

d. Recursion
2015 (H-3) :: C :: Answer total Five Questions (at least 2 from each group)

---------------------Group – A----------------
1. What is Computer Network ? Describe different Network Topologies.

2. What is Boolean algebra ? Design a half adder using ::

a. NAND gates only
b. NOR gates only
3. .
a. What is Switching ? Differentiate between circuit switching and packet
switching.

b. How is performance improved in CSMA/CD protocol compared to CSMA

protocol.
4. .
a. Discuss 7 layers of OSI Model, with their functionality.

b. Why transport layer protocols , like TCP and UDP are called end to end
protocols ? What is the difference between them ?

5. Write short notes on any two of the following ::-

a. POP and web-based E-mail

b. VSAT
c. Internet v/s Intranet
d. Growth of internet
---------------------Group – B----------------
6. .
a. What is the function of if-statement ? Explain with example.

b. Write a program in C to determine whether a given number is “odd” or

“even” and print the message.
NUMBER IS EVEN OR NUMBER IS ODD
without using else option.

7. What are pointers ? why are they required ? How do you declare and initialize
them ? write a program to read two integers x and y and swap the contents of the
two variables x and y using pointers.

8. What do you mean by strings ? State some library functions for string
manipulations . Also create a function in C to find the length of the string.

9. .
a. Write a program to find the number of vowels in the given line text.
b. Differentiate between an array and a structure . Explain with an example.

10. Differentiate between ::

a. Relational operators and logical operators
b. ++x and x++
c. Logical AND and logical OR operators
d. >> and << operators
e. while and do-while loops