Get fully solved assignment. Buy online from website
online store
or
plz drop a mail with your sub code
we will revert you within 2-3 hour or immediate
Charges rs
125/subject and rs 625/semester only.
if urgent then call us
on 08791490301, 08273413412
[Spring 2015]
ASIGNMENT
PROGRAM-BSc IT
SEMESTER-FIRST
SUBJECT CODE &
NAME-BT0065, C Programming and Data Structures,
CREDIT-3
BK ID-B0949
MAX. MARKS-60
Q1. 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
Q2. Explain bubble
sort with the help of an example. 10
Answer:
Bubble Sorting: Sorting is generally understood
as a process of re-arranging a given set of objects in a specific order.
The purpose of sorting is to facilitate that later search for members of
the sorted set. As such it is an almost universally performed,
fundamental activity. Objects are sorted in telephone books, in income
tax files, in tables of contents
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
Q4. Explain all
file open functions with examples. 10
Answer:
File Open Functions:
To open a file from the disk, we must require an
opening function along with the appropriate opening mode. The standard
library provides the function fopen( ) to open a file. For special
cases, the freopen( ) and tmpfile( ) functions also open files.
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_
Q6. Write an
algorithm for selection sort. Sort the list given below in ascending order by
using this sorting technique. 64 , 25, 12, 22 , 11
Answer:
Selection Sort:
Selection sort is a sorting
algorithm, specifically an in-place comparison sort.
It has O(n2)
Get fully solved assignment. Buy online from website
online store
or
plz drop a mail with your sub code
we will revert you within 2-3 hour or immediate
Charges rs
125/subject and rs 625/semester only.
if urgent then call us
on 08791490301, 08273413412
No comments:
Post a Comment