2023 2024 Student Forum > Management Forum > Main Forum

 
  #2  
20th July 2012, 05:16 PM
Super Moderator
 
Join Date: May 2012
Re: Alagappa University BCA Model Question Paper

As you are looking for the Alagappa University BCA question paper, these papers are already uploaded on our website. By visiting on our site you will get the BCA old papers.Given below is the link

Annamalai University distance education BCA question papers - 2012 StudyChaCha
  #3  
30th March 2014, 05:59 PM
tirupur
Guest
 
Re: Alagappa University BCA Model Question Paper

I am pursing BCA from Alagappa University and now my exams are near so I need its model question papers for examination well preparation so somebody give me web link where I go and get this University BCA model question papers?
  #4  
23rd July 2015, 04:46 PM
sathyastudio@gmail.com
Guest
 
Re: Alagappa University BCA Model Question Paper on may 2015

Respected sir,
please sent the may 2015 question papers
I am pursing BCA from Alagappa University and now my exams are near so I need its model question papers for examination well preparation so somebody give me web link where I go and get this University BCA model question papers?
  #5  
11th March 2016, 11:03 AM
Unregistered
Guest
 
Alagappa University BCA Model Question Paper

Hello, I want to apply for the BCA exam of the Alagappa University and I want the model paper of the exam. Please provide me.
  #6  
11th March 2016, 11:03 AM
Super Moderator
 
Join Date: May 2012
Re: Alagappa University BCA Model Question Paper

Hello, here I am providing you the questions of the model paper asked in the BCA exam of the Alagappa University as under:

1.
Which one of the following is not a statement ?
(a)
4 + 5 = 9
(b)
Blood of human being is white.
(c)
Canada is a country.
(d)
Close the door

The conjunction of any two tautologies is also :
(a)
a contingency.
(b)
a tautology.
(c)
bi-conditional.
(d)
conditional

In K3,3 the number of edges is
(a)
6
(b)
9
(c)
13
(d)
10

The Number of vertices in a tree with 10 edges is
(a) 10
(b) 11
(c) 9
(d) 12.

Prove that a vertexn V of a tree is a cut vertex if and
only if d (V) > 1

Prove that the sum of the degree of all vertices in G is
twice the number of edges in G.

Prove that a graph is bipartite iff it contains no odd
cycle

Prove that a non empty connected graph is Eulerian iff
it has no vertices of odd degree

Use the algorithm of Kruskal, final a shortest spanning
tree in the graph

What is User-defined word ?

What is the last statement of a COBOL program ?

List out the picture clause used for data description.

State the use of level number 66


Quick Reply
Your Username: Click here to log in

Message:
Options

Thread Tools Search this Thread



All times are GMT +5. The time now is 04:36 AM.


Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2024, vBulletin Solutions Inc.
SEO by vBSEO 3.6.0 PL2

1 2 3 4