Questions : BCA 2nd Year (magadh University)
BCA Paper IV (2012)
Time : 3 hours
Full Marks : 75
Candidates are required to give their answer in their own words as far as practicable.
The Questions are of equal value.
Answer any five question.
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 algorithm to perform push and pop operations
on a
stack.
3. What is circular
queue ? What are its advantage ? Write the algorithm for the insertion
and
deletion
operations performed on the circuar queue.
4. Evaluate the following
postfix expressions:
(i) ABC*+ given A=12.5, B=6.35, C=5.75
(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 repersentation 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 repersentaion 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
Click Here to View Answer
Define Linear Data Structure
What is Linear Data Structure. Define it?
The mathematical and logical model of a particular organisation of data is known as Data Structures.
Linear Data Structure:-
The Data structure is said to be Linear Data Structures if it's elements are in a sequence and form a linear series.
For Example:- Array, Queue, linked list and Stacks.
What is Array?
Array is the collection of same data type elements under the same variable identifier referenced by index number. It is widely used in programming for the purpose of searching and sorting etc.
What is Queue?
A queue is a linear data structure in which elements are removed in the same order they were entered. So the queue is the FIFO data structures. FIFO means first in first out i.e the first element added to the queue will be the first one to be removed.
What is Stack?
Stack is the ordered collection of elements. It is a dynamic object whose size is continuously changing as elements are pushed or popped. In Stack elements are removed in the reverse order from which they were entered. This is referred as LIFO[Last In First Out]. It may contain different data type.
What is Linked List?
Linked list is the linear data structure which are used to organize data in a specific desired logical orders independent of the memory address each record assigned to it.
It is a linear collection of data elements and the linear order is given by pointers. Each element [node] has two parts:- First part contain the information of the element and Second part contains the address of the next element [node] in the list.
Questions : BCA 2nd Year (magadh University)
BCA Paper III (2012)
Time : 3 hours
Full Marks : 75
Candidates are required to give their answer in their own words as far as practicable.
The Questions are of equal value.
Answer any five question, 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 channer? 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 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() controls.
b) Write a C-program to find the sum of N-natural numbers using for() loop.
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
BCA Question :Part 2 Guessed Question 2012
Paper III
1.Write Notes about OSI Model
1.Write Notes about OSI Model
2. What do you understand by Scope and Storage Class?
3. Define Control Statement.
4. Define the Looping Stament.
5. Decscribe Demorgan Law.
Paper IV
1. Bubble Sort
2. Binary Search
3. Stack and queue
4. Define Algorithm complexity
5. Kruskal algorithm
Paper IV
1. Bubble Sort
2. Binary Search
3. Stack and queue
4. Define Algorithm complexity
5. Kruskal algorithm
Click Here to View Answer
Click Here To View Question BCA Paper III (2012)
Click Here To View Question BCA Paper IV(2012)
Click Here To View Question BCA Paper III (2012)
Click Here To View Question BCA Paper IV(2012)
Magadh University: BCA I & II exam Schedule 2012
 |
MAGADH
UNIVERSITY
BODH-GAYA-824234
(Examination
Department)
|
||||
Vocational
Courses Degree Part-I & II Examination Schedule-2012
Hons. Subs.
B.C.A. BBM., BASPSN,TTM,,F.E.,OMSP, Bio.-Tech, EEM, EWM.
BMCA, BBA,
Industrial Chemistry, Bio-Chem, Micro-Bio. & B.Sc. IT
Degree
Part-I-2012 (V/E) Hons. Paper
Time:
10:00 a.m. to 1:00 p.m.
21.04.2012 Paper-I
24.04.2012 Paper-II
Degree
Part-I-2012 (V/E) Hons. Paper
Time:
10:00 a.m. to 1:00 p.m.
21.04.2012 Paper-III
24.04.2012 Paper-IV
|
|||||
DATE
|
Time
10:00
a.m. to 1:00 p.m.
|
DATE
|
Time
2:00
p.m. to 5:00 p.m.
|
||
25/05/12
|
Stat./Soc.
|
25/05/12
|
Eco/Zoology
|
||
26/04/12
|
Composition
|
26/04/12
|
Geog./Psy.
|
||
27/04/12
|
Psy./Geog./Chem
|
27/04/12
|
Composition
|
||
28/04/12
|
Math/Philosophy
|
28/04/12
|
Pol.
Sc./Chem./MB
|
||
02/05/12
|
Pol.
Sc./Phy./B.O.
|
02/05/12
|
Soc./Stat.
|
||
03/05/12
|
Language
& Literature
|
03/05/12
|
Pl.
& ED
|
||
04/05/12
|
Hist./Bot./Pr.
Of Eco.
|
04/05/12
|
A.I.&A.S.
/Math/Hist.
|
||
05/05/12
|
Eco/Zoology
|
05/05/12
|
Bot.
/ Phy./Philosophy
|
||
07/05/12
|
A.I.
& A.S
|
07/05/12
|
Language
& Literature
|
||
Note:
The College will arrange the project/practical/IT/Viva
Voice Test on
or before 12.05.2012 at own level
and submit the marks in duplicate to Add. Controller Examinations, M.U.,
Bodh-Gaya Within Four days.
|
|||||
Note:
All Above Statement of Time table is shown as available, There are no responsibility of website if program schedule will changed in
future.
Comment and Suggest.
Comment and Suggest.
http://vjy-softworx.webs.com | vjy-softworx.webs.com | vjysoftworx.co.cc
Questions : BCA 2nd Year (magadh University)
BCA Paper -III (2006)
1. WAP to
find the simple interest.
2. differentiate
between a lan and an. what is a communication protocol? what are he normal
functions
performed
by there protocol.
3. explain
the principle of duality boolean algebra
construct logic diagram for the Booolean expression
using AND/OR/NOT gates
A.B+A.B
(A+B).(A.B)
4. explain
the store and forward method f message switchiing. Give the dvantage and
disadvantage of
this message switcing technique what is
package switching.
5. WAP to
find the average of the no entered from keyboard.
6. WAP are half
adder a full dder construct. logic circuit diagram for a half adder using only
either NAND
or NOR gates.
7. what is a
repeter? what are encoder and decoder
8. write
short notes on
a.optical fibre,
b.ISO-03I MOdel
c.K-Maps
9.satellite
communication diifferent question of computer language serial and parellel
communication.
Operating System : Blue Screen Of Death (BSOD)
The blue screen of death (BSOD), is the informal name given by users to the Windows general protection fault (GPF) error. Named in honor of the error's dreaded display image of white text on a blue background, the BSOD is generated by the operating system when it has suddenly terminated with an error. The system locks up and must be rebooted. The blue screen may include some hexadecimal values from a core dump that can potentially be used to determine what caused the crash.
The blue screen of death can strike anyone, anywhere. At the Comdex trade show, Microsoft Chairman Bill Gates encountered the blue screen during a demonstration of Windows 98. (He had a spare computer standing by.)
The blue screen of death can strike anyone, anywhere. At the Comdex trade show, Microsoft Chairman Bill Gates encountered the blue screen during a demonstration of Windows 98. (He had a spare computer standing by.)
Computer Archtecture : Floating Point Unit (FPU)
A floating point unit (FPU), also known as a math coprocessor or numeric coprocessor, is a specialized coprocessor that manipulates numbers more quickly than the basic microprocessor circuitry. The FPU does this by means of instructions that focus entirely on large mathematical operations. In the early years of personal computing, the FPU was physically separate from the main microprocessor. Starting with the Intel Pentium and Motorola 68000 series in the late 1990s, the FPU became a physical part of the microprocessor chip.
A floating point number is a binary number carried out to a specific number of digits, and containing a radix (or decimal) point somewhere in the digit sequence. Such numbers are stored in three parts: the sign (either plus or minus), the mantissa (sequence of meaningful digits), and the exponent (power or order of magnititude), which determines the position in the mantissa where the radix point is placed. The main operations of the FPU consist of conventional arithmetic such as addition and multiplication. Some FPUs can also perform more sophisticated functions such as exponentials, logarithms, and trigonometry.
Some programs commonly downloaded from the Internet, such as Macromedia's Shockwave, require that a computer have an FPU. If a computer is old and its microprocessor does not have an FPU built in, a program called an FPU emulator can be downloaded. This can, in many cases, allow such programs to run, but not as fast as they would in a computer that has a hardware FPU.
A floating point number is a binary number carried out to a specific number of digits, and containing a radix (or decimal) point somewhere in the digit sequence. Such numbers are stored in three parts: the sign (either plus or minus), the mantissa (sequence of meaningful digits), and the exponent (power or order of magnititude), which determines the position in the mantissa where the radix point is placed. The main operations of the FPU consist of conventional arithmetic such as addition and multiplication. Some FPUs can also perform more sophisticated functions such as exponentials, logarithms, and trigonometry.
Some programs commonly downloaded from the Internet, such as Macromedia's Shockwave, require that a computer have an FPU. If a computer is old and its microprocessor does not have an FPU built in, a program called an FPU emulator can be downloaded. This can, in many cases, allow such programs to run, but not as fast as they would in a computer that has a hardware FPU.
Computer Architecture : PCMCIA card
PCMCIA Stands on Personal Computer Memory Card International Association. Some People Called it as People Cannot Memorize the Computer Industries Acronyms.as joking to remember it.
A PCMCIA card is a credit card-size memory or I/O device that
connects to a personal computer, usually a notebook or laptop computer.
Probably the most common example of a PCMCIA card is the 28.8 Kbps
modem for notebook computers.
The Personal Computer Memory Card International Association was
organized in 1989 to promote standards for both memory and I/O
integrated circuit cards. The PCMCIA 2.1 Standard was published in
1993. As a result, PC users can be assured of standard attachments for
any peripheral device that follows the standard.
A PCMCIA card has a 68-pin connector that connects into a slot in the PC. There are three sizes (or "Types") of PCMCIA cards:
| Type | Thickness (mm) | Typical use |
|---|---|---|
| I | 3.3 | Memory |
| II | 5.0 | Modems, LANs. SCSI, sound |
| III | 10.5 | ATA hard drive |
The Type I and II cards work in a Type III slot and a Type I card will
work in a Type II slot. (On the other hand, the thicker cards can't be
fitted into the slots for the thinner cards.)
The PCMCIA standard is most commonly applied to portable PCs but it can also be used on desktop computers.
The PCMCIA card is not to be confused with another credit-size electronic card, the smart card.
Magadh University : BCA I & II Exam Date 2012
Exam Date of Vocational Courses (BCA, BBA, Bio.Tech) Magadh University Has been decleared. It will be started from 21st April 2012
come Back I will Publish Time Table SOON
Data Structure : Binary Tree Introduction
The simplest form of tree is a binary tree. A binary tree consists of
- a node (called the root node) and
- left and right sub-trees.
Both the sub-trees are themselves binary trees.
You now have a recursively defined data structure. (It is also possible to define a list recursively)
The nodes at the lowest levels of the tree (the ones with no sub-trees) are called leaves.
In an ordered binary tree,
- the keys of all the nodes in the left sub-tree are less than that of the root,
- the keys of all the nodes in the right sub-tree are greater than that of the root,
- the left and right sub-trees are themselves ordered binary trees.
Data Structure
The data structure for the tree implementation simply adds left and right pointers in place of the next pointer of the linked list implementation. [Load the tree struct.]
The AddToCollection method is, naturally, recursive. [ Load the AddToCollection method.]
Similarly, the FindInCollection method is recursive. [ Load the FindInCollection method.]
Analysis
Complete Trees
Before we look at more general cases, let's make the optimistic assumption that we've managed to fill our tree neatly, ie that each leaf is the same 'distance' from the root. | This forms a complete tree, whose height is defined as the number of links from the root to the deepest leaf. |
First, we need to work out how many nodes, n, we have in such a tree of height, h.
Now,
n = 1 + 21 + 22 + .... + 2hFrom which we have,
n = 2h+1 - 1and
h = floor( log2n )
Examination of the Find method shows that in the worst case, h+1 or ceiling( log2n ) comparisons are needed to find an item. This is the same as for binary search.
However, Add also requires ceiling( log2n ) comparisons to determine where to add an item. Actually adding the item takes a constant number of operations, so we say that a binary tree requires O(logn) operations for both adding and finding an item - a considerable improvement over binary search for a dynamic structure which often requires addition of new items.
Deletion is also an O(logn) operation.
General binary trees
However, in general addition of items to an ordered tree will not produce a complete tree. The worst case occurs if we add an ordered list of items to a tree.
What will happen?
This problem is readily overcome: we use a structure known as a heap. However, before looking at heaps, we should formalise our ideas about the complexity of algorithms by defining carefully what O(f(n)) means.
Key terms |
- Root Node
- Node at the "top" of a tree - the one from which all operations on the tree commence. The root node may not exist (a NULL tree with no nodes in it) or have 0, 1 or 2 children in a binary tree.
- Leaf Node
- Node at the "bottom" of a tree - farthest from the root. Leaf nodes have no children.
- Complete Tree
- Tree in which each leaf is at the same distance from the root. A more precise and formal definition of a complete tree is set out later.
- Height
- Number of nodes which must be traversed from the root to reach a leaf of a tree.
Subscribe to:
Posts
(
Atom
)
1 comment :
Post a Comment