Near what points may the surface be represented uniquely as a graph of a differentiable function
? Locate such a point.
Let E be an open subset of and
be a function such that each of its components function
are differentiable, then show that f is differentiable. Is the converse of this result true? Justify your answer.
Find the first derivative of the function f defined by
given by
where
.
Show that an infinite discrete metric space X is bounded but not totally bounded.
See Answer →Let and
be metric spaces. Show that
is continuous if and only if
where A is any subset of X
Find the interior, boundary and closure of the following sets A in with the usual metric and discrete metric.
i) A = , the set of rationals in
ii)
Let A and B be any two subsets of a metric space , then show that
i) int {E : is open and
}
ii) int = int A
int B
iii) int(A )B
int A
int B
iv) .
Let be a metric space and
be a fixed point of
. Show that the function
given by
is continuous. Is it uniformly continuous? Justify you answer
Let . Define
by
where the integral is the Riemann integral. Show that d is a metric on X . Find
where
and
,
What do you understand by file organisation? Explain the methods of file organisation.
See Answer →Explain the meaning of the terms garbage collection, fragmentation, relocation and compaction.
See Answer →Write a function that evaluates an expression in RPN that is given as a string.
See Answer →Define a structure of type hms containing three integer members, called hour, minute and second, respectively. Then define a union containing two members, each a structure of type hms. Call the union members local and home, respectively. Declare a pointer variable called time that points to this union.
See Answer →Write the inorder, preorder and postorder traversals of the following binary search tree
Write a C program which reads a line of text from keyboard, and writes the line to a file with lower case letters converted to upper case and vice-versa
See Answer →Consider the following structure declaration of a doubly linked list:
struct dlink
{
int nodeid;
dlink *next;
dlink *prev;
} dlink t;
A pointer of the head of the linked list is maintained as a global variable, whose
definition is
dlink t *head;
The function remove element(dlink t *rp) defined below needs to remove the
node pointed to rp and adjust the head. The first node’s prev and the last node’s
next are NULL.
remove element(dlink t *rp)
{
rp->prev->next = rp->next;
rp->next->prev = rp->prev;
if(head == rp)
head = rp->next;
}
Explain whether the function remove element() works properly or not.
What do you understand by a nested structure? Explain with an example. Also, explain how would you access the members of a structure or a nested structure using pointers?
See Answer →What does the following C function compute? Discover.
int some fun(int n)
{
if(n%2 == 0)
return 2;
int d, s = sqrt(n);
2
for(d = 3; d <= s; d = d+2)
if(n%d == 0)
return d;
return n;
}
How would you differentiate between the terms pointer to an array and array of pointers? Give proper examples.
See Answer →A C program contains the following statements:
char u, v = ‘A’;
char *pu, *pv = &v;
*pv = v+1;
u = *pv + 1;
pu = &u;
Suppose each character occupies one byte of memory. If the value assigned to u is stored in (hexadecimal) address F8C and the value assigned to v is stored in the address F8D, then
i) What value is represented by &v?
ii) What value is assigned to pv?
iii) What value is represented by *pv?
iv) What value is assigned to u?
v) What value is represented by &u?
vi) What value is assigned to pu?