Get fully solved assignment, plz drop a mail with your sub code
computeroperator4@gmail.com
Charges for mba rs 125/subject and rs 700/semester only.
For other rs 125/subject only
if urgent then call us
on 08791490301, 08273413412
[Fall 2014]
ASIGNMENT
PROGRAM-BSc IT
SEMESTER-FIRST
SUBJECT CODE &
NAME-BT0065, C Programming and Data Structures,
CREDIT-3
BK ID-B0949
MAX. MARKS-60
Q1. Write an
algorithm to check whether a given number is even or odd number and after that
draw the flowchart.
Answer.
Algorithms
1.
A sequential solution of any program
that written in human language,called algorithm.
2.
Algorithm is first step of the
solution process, after the analysis of problem, programmer write the algorithm
of that problem.
Q2. Explain the structure of the
C program. 10
Answer.
Structure of the
C program
We
have to follow
the sequence of instructions that should be maintained to be a C Programmer.
Q3. What is
structure? What is its importance? Explain with an example how to declare and
initialize structure.
Answer.
Structures
A
structure can be considered as a template used for defining a collection of
variables under a single name. Structures help programmers to group elements of
different data types into a single logical unit (Unlike arrays which permit a
programmer to group only elements of same data type).
Importance of
Q4. What do you
mean by dynamic memory allocation? Explain the three functions for dynamic
memory allocation in C language. 4+6
Answer.
Dynamic memory
allocation
C Language requires the number of
elements in an array to be specified at compile time. Many languages permit a
programmer to specify an array‟s size at run time. Such languages have the
ability to calculate and assign, during execution, the memory space required by
the variables in a program. The process of allocating memory at run time is
called
Q5. Write C program
to implement stack using arrays. 10
Answer.
C program to
implement stack using arrays
#include <stdio.h>
#include <process.h>
#define STACK_SIZE 5
void
Q6. What do you
mean by binary tree? Explain the storage representations of binary tree. 4+6
Answer.
Binary tree
A binary tree is a tree in
which no node can have more than two subtrees. In other words, a node can have
zero, one, or two subtrees. In other words, a tree in which every parent has
one or two children (but not more than that) is called as binary tree. The “root”
component of binary tree is the forefather of all children. But it can have
only upto two children one “right” child and “left” child.
These children can become fathers and each can produce only two children. In
fact a child can become a father, grandfather, great grandfather and son. Fig shows
five binary trees all with three nodes.
Get fully solved assignment, plz drop a mail with your sub code
computeroperator4@gmail.com
Charges for mba rs 125/subject and rs 700/semester only.
For other rs 125/subject only
if urgent then call us
on 08791490301, 08273413412
No comments:
Post a Comment