#1
 
 
Tamil Nadu Open University BCA Model Question Paper 
#2
 
 
Re: Tamil Nadu Open University BCA Model Question Paper
As you are looking for Tamil Nadu Open University, Chennai BCA programme question paper, here I am giving: TNOU BCA question paper 1. What are various types of networks? 2. Explain point to point Network system. 3. What are the differences between data rate and bandwidth? 4. Compare fiber optic and copper wire transmission media. 5. Explain the five basic functions of Email. 6. What are the applications of ATM? 7. Differentiate between Datagram and virtual circuit. 8. Distinguish between OSI Reference Model and TCP Reference model. 9. Explain various multiplexing. 10. Distinguish between non adaptive and adaptive Routing algorithms. 11. (a) Explain the MACA protocol for wire communication. (b) What is a VLAN? 12. (a) Compare switches and Hubs. (b) Explain Repeaters. 13. List the standards of modems and explain. 14. Discuss ISDN services. 
#3
 
 
Re: Tamil Nadu Open University BCA Model Question Paper
Hello sir, I’m pursuing BCA from Tamil Nadu Open University. My BCA exam will be held on next month. I want model question paper of BCA third year for Theory of Computer Science course form Tamil Nadu Open University?

#4
 
 
Re: Tamil Nadu Open University BCA Model Question Paper
Here I’m providing you BCA model question paper of third year examination of Theory of Computer Science: B.C.A. Theory Of Computer Science Time : 3 hours Maximum marks : 75 Answer for 5 marks questions should not exceed 2 pages. Answer for 10 marks questions should not exceed 5 pages. PART A — (5 5 = 25 marks) Answer any FIVE questions. Explain Sets and its description. Discuss about operations on Relations. Explain Truth table with example. Discuss about Tautology. Explain Regular sets with examples. Explain Context Free language. Define Degree of the node and its types. PART B — (5 × 10 = 50 marks) Answer any FIVE questions. Explain the functions and its types in detail. Explain the tautological Implications and equivalence of formula. Explain Forms and its types in detail. Explain Nondeterministic Finite Automata with example. Explain the Techniques for Turing Machine construction. In a simple graph, G = (V,E) prove that every node of the digraph lies in exactly one strong component. In a Simple digraph, the length of any elementary path is less than or equal to n1, where n is the number of nodes in the graph, similarly the length of any elementary cycle does not exceed n – Prove. 