Register

Webpage

Programming in C. Recursion.
Filter

Most answered questions in Programming and DS

1 votes
1 answer
2071
UGC NET CSE | December 2007 | Part 2 | Question: 13
Which of the following is a valid C code to print character A' to C' ? x='A' ; switch(x) {case 'A'= printf ( "%d\n" , x); .... case 'C'= printf ( "%d\n" , x); } x='A'; ... , x); case 'B' =printf ( "%d\n" , x); case 'C' =printf ( "%d\n" , x); }
Which of the following is a valid C code to print character ‘A’ to ‘C’ ?x='A' ; switch(x) {case 'A'= printf ( "%d\n" , x); .... case 'C'= printf ( "%d\n" , x); }x...
User Avatar
1 votes
1 answer
2072
UGC NET CSE | December 2007 | Part 2 | Question: 21
Consider a rooted tree in which every node has at least three children. What is the minimum number of nodes at level i (i > $0$) of the tree ? Assume that the root is at level $0$: $3^i$ $3i$ $3$ $3i+1$
Consider a rooted tree in which every node has at least three children. What is the minimum number of nodes at level i (i $0$) of the tree ? Assume that the root is at l...
User Avatar
0 votes
1 answer
2073
UGC NET CSE | December 2007 | Part 2 | Question: 22
Which of the following data structure is used to implement recursion ? Arrays Stacks Queues Linked lists
Which of the following data structure is used to implement recursion ?ArraysStacksQueuesLinked lists
User Avatar
1 votes
1 answer
2074
UGC NET CSE | December 2007 | Part 2 | Question: 23
The height of a binary tree with $n$ nodes, in the worst case is : $O(log n)$ $O(n)$ $\Omega(n\log n)$ $\Omega(n^2)$
The height of a binary tree with $n$ nodes, in the worst case is :$O(log n)$$O(n)$$\Omega(n\log n)$$\Omega(n^2)$
User Avatar
0 votes
1 answer
2075
UGC NET CSE | December 2006 | Part 2 | Question: 11
When a function is recursively called, all automatic variables : are initialized during each execution of the function are retained from the last execution are maintained in a stack are ignored
When a function is recursively called, all automatic variables :are initialized during each execution of the functionare retained from the last executionare maintained in...
User Avatar
1 votes
1 answer
2076
UGC NET CSE | December 2006 | Part 2 | Question: 15
The declaration “unsigned u” indicates : u is an unsigned character u is an unsigned integer u is a character u is a string
The declaration “unsigned u” indicates :u is an unsigned characteru is an unsigned integeru is a characteru is a string
User Avatar
0 votes
1 answer
2077
UGC NET CSE | December 2006 | Part 2 | Question: 25
Which one of the following is a physical data structure ? Array Linked lists Stacks Tables
Which one of the following is a physical data structure ?ArrayLinked listsStacksTables
User Avatar
0 votes
1 answer
2078
UGC NET CSE | December 2005 | Part 2 | Question: 34
Which of the following is not collision Resolution Technique : Hash addressing Chainning Indexing None of these
Which of the following is not collision Resolution Technique :Hash addressingChainningIndexingNone of these
User Avatar
0 votes
1 answer
2080
UGC NET CSE | December 2005 | Part 2 | Question: 25
Which traversal techniques lists the nodes of a binary search tree in ascending order? post – order in – order pre – order linear – order
Which traversal techniques lists the nodes of a binary search tree in ascending order?post – orderin – orderpre – orderlinear – order
User Avatar
0 votes
1 answer
2081
UGC NET CSE | June 2005 | Part 2 | Question: 21
What is the time required to insert an element in a stack with linked implementation? $O \left(\log_{2}n \right)$ $O \left(n \right)$ $O \left(n \log_{2}n \right)$ $O \left(1 \right)$
What is the time required to insert an element in a stack with linked implementation?$O \left(\log_{2}n \right)$$O \left(n \right)$$O \left(n \log_{2}n \right)$$O \left(1...
User Avatar
0 votes
1 answer
2082
UGC NET CSE | June 2005 | Part 2 | Question: 23
In the balanced binary tree given below, how many nodes will become unbalanced when a node is inserted as a child of the node “$g$” ? $1$ $3$ $7$ $8$
In the balanced binary tree given below, how many nodes will become unbalanced when a node is inserted as a child of the node “$g$” ?$1$$3$$7$$8$
User Avatar
2 votes
1 answer
2083
UGC NET CSE | December 2004 | Part 2 | Question: 12
Consider the following statements, Int i=4, j=3, k=0; k=++i - --j + i++---j +j++; What will be the values of $i, j $ and $k$ after the statement. $7,2,8$ $5,2,10$ $6,2,8$ $4,2,8$
Consider the following statements,Int i=4, j=3, k=0; k=++i - j + i++ -j +j++;What will be the values of $i, j $ and $k$ after the statement.$7,2,8$$5,2,10$$6,2,8$$4,2,8$...
User Avatar
1 votes
1 answer
2084
UGC NET CSE | December 2004 | Part 2 | Question: 14
A function object : is an instance of a class for which operator ( ) is a member function is an instance of a class for which operator → is a member function is a pointer to any function is a member function of a class
A function object :is an instance of a class for which operator ( ) is a member functionis an instance of a class for which operator → is a member functionis a pointer ...
User Avatar
1 votes
1 answer
2085
UGC NET CSE | December 2004 | Part 2 | Question: 24
What operation is supported in constant time by the doubly linked list, but not by the singly linked list ? Advance Backup First Retrieve
What operation is supported in constant time by the doubly linked list, but not by the singly linked list ?AdvanceBackupFirstRetrieve
User Avatar
0 votes
1 answer
2090
Algorithm-Self Doubt
How in a heap there are at most $\lceil \frac{n}{2^{h+1}} \rceil$ nodes of height h.
How in a heap there are at most $\lceil \frac{n}{2^{h+1}} \rceil$ nodes of height h.
User Avatar
Page: