|
|
CS
62 C Programming & Data Structure - Free Bca Assignment Answers
2008
Solution Submitted by - Rajeev Ranjan
|
Q. What are priority Queues? How can priority
queues be implemented? Explain.
Get
Free Answer and Tips - Click Here
|
Q. Write a program in ‘C’ programming
language to add two polynomials using linked list.
Get Free Answer and Tips - Click
Here
|
Q. Write a non-recursive function in
‘C’ programming language to reverse a doubly
linked list.
Get Free Answer and Tips - Click
Here |
Q: Let G=(V,E) be an undirected graph.
Use depth-first search to develop a program using ‘C’
language to convert each edge in G to a directed edge such
that the resulting graph is strongly connected, or determine
that this is not possible.
Get
Free Answer and Tips - Click Here
|
Q: Consider a linked list with n integers.
Each node of the list is numbered
from ‘1’ to ‘n’. Develop a program
using ‘C’ language to split this list into 4 lists
so that:
first list contains nodes numbered 1,5, 9, 13- - -
second list contains nodes numbered 2, 6, 10, 14- - -
third list contains nodes numbered 3, 7, 11, 15- - -
and fourth list contains nodes numbered 4,8, 12, 16- - -
Get Free Answer and Tips -
Click Here
|
Q: Write a program in ‘C’ programming
language to list the nodes of a binary tree in the following
way: List the root, then nodes at depth 1, followed by nodes
at depth 2, and so on.
Get
Free Answer and Tips - Click Here
|
|
|
