Tech@500

aaa

2020-08-15T13:30:00.016+05:30

Data Structure

Discuss the concept of Dynamic Memory Allocation (DMS)

We develope any program for processing the data, the data which to be processed that must be input into the computer. Before input of data we have to reserve space in primary memory. This reservation process is known as "Memory Allocation" means in memory Allocation. We reserve space for keeping the data in primary memory.

Memory Allocation technique is divided into two types:-

Static Memory Allocation
Dynamic Memory Allocation

Static Memory Allocation

In this Allocation technique we reserve space during compile time of program, that space never expend or shrink during runtime of the program. So, Static Memory Allocation is apply to that program in which we know total number of data in advance.

Eg:-Variable and arrays are used to perform Static Memory Allocation.

Dynamic Memory Allocation (DMA)

In this Allocation technique we reserve space during runtime of the program. The space reserved by (DMA) i.e Dynamic Memory Allocation technique. DMA technique can expend or shrink during runtime of the program. So, this Allocation technique is applied in that program in which we don't know size of data in advance.

NOTE:-To perform DMA "C" provide concept of "Dynamic Array".

How to perform DMA:-

For this purpose C provide four readymade function i.e define in malloc.h header file. These functions are as follow:-

malloc( )
calloc( )
realloc( )
free( )

malloc( ):-

It is used to perform Memory Allocation at runtime. It take 1 argument i.e totla number of byte to be reserve. After successfull alocation it return address of first byte that address is void type. So we need to typecast this address into particular type.

Eg:-int n,*p;
printf("Enter total number of data\n");
scanf("%d",&n);
p=(int *)malloc(n * sizeof (int));

calloc( ):-

It is also used to reserve space at runtime of the program but there is a difference between malloc( ) and calloc( ) i.e calloc( ) work on two argument and its space is initialized by zero.

Eg:-int n,*p;
printf("Enter total number of data\n");
scanf("%d",&n);
p=(int *)calloc(n, sizeof (int));

realloc( ):-

It is used to add some memory block in previous created blocks either i.e created by malloc( ) or calloc( ). It works with two argument i.e "pointer to the previous created blocks" and total number of byte to the added.

Eg:-int n,*p;
printf("Enter total number of data\n");
scanf("%d",&n);
p=(int *)calloc(n, sizeof (int));

printf("Enter total number of bytes to be added \n");
scanf("%d",&n);
p=(int *)realloc(p,n* sizeof(int));

free( ):-

It is used to deallocate the allocated space. It take one argument i.e pointer of allocated blocks.

Eg:-int n,*p;
printf("Enter total number of data\n");
.
.
.
p=(int *)realloc(p,n * sizeof(int));
free(p);

Discuss the concept of Data Structure its Operation and types:-

To handle both the component we have two different concept:-

Concept of programming language
Concept of Data structure

Programming Language:-

Programming Language is used to handle instruction of the program so it provide tools for writing instruction. E.g Tools for input and output data tools for putting condition.

C program to input any string and determine whether it is palindrome or not.

2020-06-09T10:19:00.001+05:30

C program to input any string and determine wheter it is palindrome or not.

#include<stdio.h>
#include<conio.h>
void main( )
{
char str[20]; int i;
clrscr( );
printf("enter any string ");
scanf("%s",str);
i=0;
while(str[i]!='\0')
{
if(str[i]==str[i+2])
{
printf("string is palindrome ");
break;
}
else
{
printf("string is not palindrome ");
break;
}
getch( );
}

C program to input any string and determine Whether the string contain double character or not.

2020-06-09T09:35:00.003+05:30

C program to input any string and determine Whether the string contain double character or not.

#include<stdio.h>
#include<conio.h>
void main( )
{
char str[20]; int i;
clrscr( );
printf("enter any string ");
scanf("%s",str);
i=0;
while(str[i]!='\0')
{
if(str[i]==str[i+1])
{
printf("Double character %c\n", str[i]);
}
i=i+1;
}
getch( );
}

C program to input any string and count upper case and lower case char.

2020-06-09T09:27:00.001+05:30

C program to input any string and count upper case and lower case char.

#include<stdio.h>
#include<conio.h>
void main( )
{
char str[20]; int i, u=0, l=0;
clrscr( );
printf("enter any string ");
scanf("%s",str);
i=0;
while(str[i]!='\0')
{
if(str[i]>=65 && str[i]<=90)
{
u=u+1;
}
if(str[i]>=97 && str[i]<=122)
{
l=l+1;
}
i=i+1;
}
printf("Total Upper case is %d\n",u);
printf("Total Upper case is %d\n",u);
getch( );
}

C program to input any string and count total number of vowel.

2020-06-09T09:15:00.004+05:30

C program to input any string and count total number of vowel.

#include<stdio.h>
#include<conio.h>
void main( )
{
char str[20]; int i, c=0;
clrscr( );
printf("enter any string ");
scanf("%s",str);
i=0;
while(str[i]!='\0')
{
if(str[i]=='A' || str[i]=='a' || str[i]=='E' || str[i]=='e' || str[i]=='I' || str[i]=='i' || str[i]=='O' || str[i]=='o' || str[i]=='U' || str[i]=='u' )
{
c=c+1;
}
i=i+1;
}
printf("Total Vowel is %d\n",c);
getch( );
}

C program to input any string and count total char in it.

2020-06-09T09:04:00.006+05:30

C program to input any string and count total char in it.

#include<stdio.h>
#include<conio.h>
void main( )
{
char str[20]; int i, c=0;
clrscr( );
printf("enter any string ");
scanf("%s",str);
i=0;
while(str[i]!='\0')
{
if(str[i]>=65 && str[i]<=90 || str[i]>=97 && str[i]<=122)
{
c=c+1;
}
i=i+1;
}
printf("Total char is %d\n",c);
getch( );
}

All BCA syllabus of patliputra university

2020-05-18T20:41:00.000+05:30

First year

Paper - I

Full Marks - 100 (Theory - 75, Practical - 25)

Computer Fundamental.
Computer Software.
Processing Modes.
Programming Concept.
Introduction to computer Architecture.
Practical.

Paper - II

Full Marks -100 (Theory - 75, Practical -25)

Operating Systems.
Foxpro : Viewing and Editing, Data, Indexing, Sorting and Printing Report.
Programming and Error Debugging.
Multiple Data File and Custom Screens.
Practical.

Second Year

Paper - III

Full Marks - 100 (Theory - 75, Practical -25)

Computer Networking.
Internet.
Boolean Algebra.
Structured Programming.
C-Language.
Practical.

Paper -IV

Full Marks -100 (Theory - 75, Practical -25)

Data Structure.
Stack and Queues.
Linked List; Tree; Searching and Sorting Tables and Graphs.
Computer Aided Drafting.
Practical.

Final Year

Paper -V

Full Marks -100

Programming in Visual Basic.
Mapping Project.
Elements of the user Interface.
Introduction to visual basic language.
Working with forms.
Active Commands.
The text box controls.
List box and combo box; Dialog Box
Component of visual Basic
Graphics with Visual Basic
Database Management system(DBMS)

Paper -VI

Full Marks -100

Object Oriented Programming
Java Programming Overview of Java
Advance Topics in computes

Paper -VII

Full Marks - 100

Design of a database for a business application.
Design of data entry forms and report layouts for these databases.
Creation of program to access and manipulate the databases.
Development of a business application in RDBMS.
Creating, merging, and deleting tables.
Project preparation and vice versea.

Paper -VIII

Full Marks -100

Prepare a project in C++ programming project preparation and vice versa.

BCA 2nd year question paper 2 of Magadh university 2008

2020-05-17T16:33:00.001+05:30

2008

Time : 3Hours

Full Marks : 75

Candidate are required to gibe their answers in their own words as far as practicable.

Answer any Five questions.

Q.1. is Compulsary.

All Question have equal marks.

Q 1. Answer the following question.

a) What is a data structure ? Explain its three components.

b) Define abstract data type ? Discuss the properties of ADT (Abstract data type) ?

c) What are the different data types available in c language ? Explain with examples.

d) Explain algorithm and its types ? Distinguish between a structure and a class.

e) Define trees. Discuss it's usage in different application. And describe binary tree.

Q 2. Explain stack mechanism ? What do you mean by stack overflow and stack underflow ?

Distinguish between static and dynamic implementation of stack.

Q 3. Explain the different types of queues ? How is implementation of queue done ? What are the
limitation of simple queue ? Explain the insertion and deletion operations of queue.

Q 4. Discuss the linked list with it's operation ? Explain the operation of insert and delete a
node from the doubly linked list.

Q 5. Define a binary tree ? Discuss it's properties What are the differences between trees and a graph?

Q 6. Explain the types of algorithms for tree traversal List and describe the various operations
on binary tree using linked representation.

Q 7. Give the in order, Pre-order, Post-order and breadth first traversal for the following tree.

A

B C

D E F G

H

Q 8. Explain the various types of searching techniques. Write an algorithm with analysis steps
for linear search and binary search.

Q 9. Explain the characteristics of the performance of a sorting algorithm. Describe quick short
algorithm.

Q 10. Write a program in C-language to implement stack with 2-Dimensional array. Perform the
push() and pop() operations.

Discuss the Concept of Programming language.

2020-05-16T17:47:00.004+05:30

Discuss the concept of Programmimg language.

As we know that computer system work in our given instruction to write instruction for the computer system we need a language, which is used for this purpose is known as programming language.
Programming Language are Characterised into three types:-

Machine Language
Assembly Language
High Level Language

Note:-Machine and Assembly language act together known as Low Level Language.

Machine Language:- This language provide only to symbol for writing instruction that is 0,1. 0,1 is each also called binary code that is easily to understand by computer. So the instruction written in this language act quickly executed by computer.

Machine Language has many limitation.

Writing instruction in the form of 0,1 is not easy so program generate multiple errors.
All instruction are written directly for hardware of computer. So a program must know hardware knowledge.
Every computer has different configuration of hardware so the program written for one computer can't execute on another computer this is called dependency dependent.

Assembly Language:- This language come in the picture against the problem of machine language that is writing instruction become easy because it provide some ready made code like sum, multiply, subtraction, input, output etc.
But this language generate another problem that is translating because computer only understand instruction in Machine Language. So every Assembly Language program must be converted into Machine Language for those purpose we have Assembler. It is a translator that the Assembly language instruction to Machine Language.
High Level Language:- This level language reserve about all problem of above both language first of all of provide general English word for writing instruction as well as it support general mathematical expression. Due to this writing program quite easy.
The high level language also reserve the major problem of low language that is machine dependency so program become Machine independent.

Note:- When High Level Language came in picture then software.

BCA 2nd year question paper 1 of magadh university 2010

2020-05-13T11:22:00.003+05:30

2010

Time : 3hour

Full Marks : 75

Candidates are required to give their answers in their own words as far Practicable.

The question 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 are 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 Truth – 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 statement 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.

BCA 2nd year question paper 1 of Magadh university 2008

2020-05-12T16:20:00.004+05:30

2008

Time : 3Hours

Full Marks : 75

Candidate are required to give their answer in their own words as far as practicable.

Attempt any Five questions.

All Questions have equal marks.

1. What do you understand by Network ? Explain various network topologies.

2. What is communication channel ? Explain different types of communication channel.

3. Differentiate between Internet and Intranet. Discuss the growth of Internet.

4. What are pop and web based E-mail ? Write the advantages of pop based E-mail and disadvantages of web based E-mail.

5. How can you search a website by its contents ? Explain with example. Write name of any four free E-mail service providers with URL address.

6. What do understand by Boolean Algebra. Prove the following:

(a) A(A+B)=A.B

(b) AB+AB=A

7. What do you understand by operator precedence ? Give the list of precedence of various operators in C. Distinguish between a unary and Binary operator with examples.

8. Explain various data types used in C with appropriate examples.

9. What do you meant by simplex and duplex ? Describe the half duplex transmission how.

10. Write short notes on any two of the following.

(a) Logic gate.

(b) Demorgan theorem.

(d) Pointer.

BCA 2nd year question paper 2 of Magadh university 2009

2020-05-12T15:49:00.003+05:30

2009

Time : 3 Hours

Full Marks :75

Candidate are required to give their answers in their own words as far as practicable.

Answer any Five questions.

Question no.1 is compulsory.

All Questions have equal marks.

1. a) Define different data structure operations. Also define linear and non-linear data structure.

b) Explain time complexity of algorithm.

2. a) What do you mean by an array? Give their characteristics features.

b) What is Stack? How is it different from queue? What are the possible operations that can be performed on the stack?

3. Define binary search tree. How can it be stored in computer memory as an array?

4. What are the different types of sorting? Give algorithm for bubble sort. Also calculate the complexity.

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

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

7. Construct the given infix expression into postfix expression

A + (B *C – (D / E ^ F) * G) *H

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

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

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

a) Depth and breadth first tree.

b) Hash table and collision resolution technique

c) Heap sort

d) Traversal of binary tree.

BCA 2nd year question paper 1 of Magadh university 2009

2020-05-11T20:05:00.011+05:30

2009

Time: 3 Hours

Full Marks: 75

Candidate is required to give their answers in their own words as far as practicable.

Answer any Five questions.

Question no.1 is compulsory Answer any five

All Questions have equal marks.

Q.1 What do you understand by terms simplex, duplex and half-duplex? Explain giving suitable example.

Q.2 Describe the OSI reference model of networking.

Q.3 Define Internet. What is the future of internet in the Indian business scenario?

Q.4 Explain the concept of email. Describe the process of sending and receiving the message in detail through E-mail.

Q.5 Explain De Morgan theorem. What are the different logic gates used in the Boolean algebra? Draw the symbols.

Q.6 What is significance of K-maps? Draw and explain half-adder.

Q.7 Explain why documentation is needed? What are the different methods of analyzing a program requirement?

Q.8 What are the special features of c programming language? State the differences between conditional and bitwise operator giving suitable example.

Q.9 What is preprocessor directive? Explain any five preprocessor commands used in ‘c’ language with syntax.

Q.10 Write short notes on three of the following

a) Packet switching

b) Portal and URL

c) Encoder and decoder

d) Data flow diagram

e) File handling function

BCA 2nd year question paper 2 of magadh university 2010

2020-05-05T11:27:00.008+05:30

2010

Time : 3 hours

Full Marks : 75

Candidates are required to give their answers in their Own words as far as practicable.

The question 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 queul.

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

BCA 2nd year question paper 2 of magadh university 2011

2020-05-04T11:32:00.001+05:30

2011

Time : 3 Hours

Full Marks – 75

Candidates are required to give their answers in own words as far as practicable.

The figues in the margin indicate full marks. Questions are of equal value.

Answer any Five Questions including AutoCad.

1. What do you mean by algorithms & Flow Charts? Discuss the complexity of an algorithm?

2. Trams form the following infix expression into postfix notation:-

a.) 5*x3(x*x*x)+3*(x-11)
b.) 2(a+b)-7(c+d)

3. What do you mean by linked list ? Discuss it’s advantage over array ?Write an algorithm an item in the singly linked list.

4. What are the application of Stack? Discuss INFIX, POSTFIX and PREFIX Notation? With examples?

5. Discuss doubly linked list & circular linked list with necessary algorithm.

6. Explain Traversal of binary tree Inorder, Pre-order & Postorder? Also discuss application of binary tree?

7. a.) Explain the process the 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(DFS) ?

9. What do you mean by AUTO CAD ? Explain the features of AUTO CAD in detail ?

10. Write sort notes on any three:
i.) Circular Queue
ii.) Radix Sort
iii.) Hash Table
iv.) Recursion
v.) Hight Balanced Tree(AVL Tree)

BCA 2nd year question paper 1 of magadh university 2011

2020-05-04T11:22:00.005+05:30

2011

Time : 3 Hours

Full Marks – 75

Candidates are required to give their answers in own words as far as practicable.

The figues in the margin indicate full marks. Questions are of equal value.

Answer two-two questions in each group & One any other.

(Answer Five Questions in all group)

GROUP-A

1. What do you mean by Computer Networks ? Describe different modes of data communication ?

2. What is Switching ? Discuss the circuit switching, packet switching and message switching.

3. Explain K-map and it’s significant ? Discuss 2-variable K-map.

4. Discuss different network devices in details? 5. Write sort 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 and unformatted Input/Output functions in C, with suitable Examples?

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 an Array? How to declear and initialize it ? Write a program to sort a list of no’s in ascending order ?

10. Write notes on the folloeing :-
i) POINTER
ii) FUNCTION
iii) BREAK & CONTINUE

BCA 2nd year question paper 2 of magadh university 2012

2020-05-04T10:47:00.004+05:30

2012

B.C.A (2nd YEAR)

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 thealgorithms 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

BCA 2nd year question paper 1 of magadh university 2012

2020-05-04T10:40:00.005+05:30

2012

B.C.A (2nd YEAR)

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.

BCA 2nd year question paper 2 of magadh university 2013

2020-05-04T10:23:00.003+05:30

2013

Time : 3 Hours

Full Marks-75

Candidates 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.

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

______________________

BCA 2nd year question paper 1 of magadh university 2013

2020-05-04T10:18:00.002+05:30

2013

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 do you mean by data communication? What are the different types of transmission mode? Explain.

2. What do you mean by guided and unguided media? Describe about the different types of unguided media?

3. What do you mean by switching? What are the three fundamental switching method? Explain.

4. (a) What is the purpose of domain name system? Discuss the three main division of the domain name space.

(b) What do you mean by electronic-mail? What are its protocol?

5. Write short notes on any three of the following :
(a) Satellite communication
(b) Bridge
(c) Serial and parallel communication
(d) Encode and Decoder
(e) Internet and intranet

Group- B

6. (a) Who developed C language? What is the goal of structured programming?
(b) Explain about the popular features of C language?

7. (a) What are the different types of operators available in C? Mention the operand types they work with?
(b) What is constant? Explain the four basic types of constant in C ?

8. (a) What is the difference between scanf() and gets() with respect to data input embedded white space character?
(b) Using printf, print a triangle of stars(*) like

*
* * *

* * * * *

9. What are pointers? What is function of a pointer variable? What are its uses?

10. Write short notes on any three of the following :
(a) Single and multi dimensional array
(b) The need and from of C function
(c) Union
(d) Pre- processor directive
(e) Switch statement

BCA 2nd year question paper of English magadh university 2014

2020-05-04T10:00:00.006+05:30

ENGLISH

2014

Time : 3 hours

Full Marks : 100

Candidates are required to give their answers in their own words as far as practicable.

The figures in the margin indicate full marks.

Answer all questions.

1. Explain any three of the following with reference to the context:

(a) Some books are to be tasted others to be swallowed, and some few to be chewed and Digested.

(b) A man must arrange physical and cultural circumstances so that they do not hider Him in his service of humanity on which all his energies should be concentrated.

(c) “Cut it off and sold it” said Della, “Don‟t you like me just as well anyhow? I‟m me Without my hair amn‟t I ?”

(d) You should not judge a stronger always by the clothes he wears.

(e) The creatures outside looked from pig to man, from man to pig, and from to man Pig to man again; but already it was impossible to say which was which.

(f) And in a few day‟s time the pigs intended to hold a memorial banquet in Boxer‟s Honor. Nepoleon ended his speech with a reminder of Boxer‟s two favorite maxims.

2. Discuss Animal Farm as a political satire. 17

Or

Sketch the character of Napoleon or Snowball.

3. Give a critical appreciation EITHER of The Speckled Band OR of The Parrot in the Cage.

4. Sum up the ideas contained EITHER in On Habits, OR in Definition of a Gentleman.

5. Write an essay on any one of the following topics :

a) Role of the Media

b) Democracy in India

c) Wonders of Science

d) Brain Drain

e) National Integration

f) Role of Women in Nation Building

g) Unemployment.

6. Correct the following sentences :

a) Mouse have caused havoc in the house.

b) He is not very attached with this family.

c) When will you return back from Bombay.

d) Unless you do not read you cannot pass.

e) There were none in the shop.

Or

Frame sentences with the following words: 10

a) Adopt – Adapt

b) Prescribe – Proscribe

c) Human – Hamane

d) Complement- Compliment

e) Effect – Affect.

Or

Use the following phrases in sentences of your own :

a) Off and on

b) Before long

c) Play false d) Break loose

e) Steer Clear.

BCA 2nd year question paper 2 of magadh university 2014

2020-05-03T16:16:00.004+05:30

2014

Time : 3 Hours

Full Marks – 75

Candidates are required to give their answers. In their own words as far as practicable.

The question are of equal value.

Answer any five questions.

Group A

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 :

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

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

8. Explain Breadth first travessal and Depth travessal 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

e) Directed and Undirected graphs.

BCA 2nd year question paper 1 of magadh university 2014

2020-05-03T16:06:00.003+05:30

   2014

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 do you mean by Data transmission modes? Describe simplex, Half Duplex and full Duplex. Communications with suitable example.

2. What is switching network? Explain the techniques of circuit switching.

3. Explain the architecture of OSI model with the functionality of each layer in OSI model.

4. a) Prove the Distributive laws of Boolean algebra.

b) Explain logic gates with their truth tables.

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

a) URL

b) Email address

c) Portals

d) Internet Vs Intranet

e) ISP

   Group B

6. a) What are the characteristics of expression in the "C‟- language?

b) Explain different ways of representing expressions.

7. What do you mean by formatted I/O operations in "C‟? Explain scan f ( ) and print f ( ) functions With suitable examples.

8. What is an array? How an array is declared and initialized in a "C‟ – Program? Explain with example.

9. a) Explain " call by value‟ and "call by reference‟ technique.

b) Write a "C"- program to swap two numbers.

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

a) Pointer

b) Dynamic memory management

c) Text file Vs Binary file

d) Macros

e) #include directive

------------------------------------

BCA 2nd year question paper 2 of magadh university 2015

2020-05-01T13:28:00.003+05:30

2015

Time : 3 Hours

Full Marks :75

The questions are of equal value.

Answer any five questions.

1. What do you mean by Data Structure ? Explain the different categories of data structure with example.

2. Define stack ? What are the different possible operations on stack ? 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) Level 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 algebraic 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 generate a minimum cost spanning tree for any given weighted tree.

BCA 2nd year question paper 1 of magadh university 2015

2020-04-29T20:04:00.013+05:30

2015

Time : 3 Hours

Full Marks : 75

The questions are of equal value.

Answer five questions, selecting at least two questions from each section.

Section-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 layer 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
1. POP and Web-based E-mail
2. VSAT
3. Internet v/s Intranet
4.Growth of internet.

Section - B

6. (a) What is the function of if-statement ? Explain with example.

(b) Write a program in C to determine whether n given number is "odd" or "even" and print the message.

NUMBER IS EVEN

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 string ? State some library functions for string manipulation. 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++

(d) >> and << operators.

(e) While and do-while loops.

Tech@500

aaa

Data Structure

Discuss the concept of Dynamic Memory Allocation (DMS)

Memory Allocation technique is divided into two types:-

Static Memory Allocation

Dynamic Memory Allocation (DMA)

How to perform DMA:-

C program to input any string and determine whether it is palindrome or not.

C program to input any string and determine wheter it is palindrome or not.

C program to input any string and determine Whether the string contain double character or not.

C program to input any string and determine Whether the string contain double character or not.

C program to input any string and count upper case and lower case char.

C program to input any string and count upper case and lower case char.

C program to input any string and count total number of vowel.

C program to input any string and count total number of vowel.

C program to input any string and count total char in it.

C program to input any string and count total char in it.

All BCA syllabus of patliputra university

BCA 2nd year question paper 2 of Magadh university 2008

Discuss the Concept of Programming language.

Discuss the concept of Programmimg language.

BCA 2nd year question paper 1 of magadh university 2010

BCA 2nd year question paper 1 of Magadh university 2008

BCA 2nd year question paper 2 of Magadh university 2009

BCA 2nd year question paper 1 of Magadh university 2009

BCA 2nd year question paper 2 of magadh university 2010

BCA 2nd year question paper 2 of magadh university 2011

BCA 2nd year question paper 1 of magadh university 2011

BCA 2nd year question paper 2 of magadh university 2012

BCA 2nd year question paper 1 of magadh university 2012

BCA 2nd year question paper 2 of magadh university 2013

BCA 2nd year question paper 1 of magadh university 2013

BCA 2nd year question paper of English magadh university 2014

BCA 2nd year question paper 2 of magadh university 2014

BCA 2nd year question paper 1 of magadh university 2014

BCA 2nd year question paper 2 of magadh university 2015

BCA 2nd year question paper 1 of magadh university 2015