Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for barc2016
1
votes
1
answer
1
Output of c program
void fun(int *p) { int q = 10; p = &q; } int main() { int r = 20; int *p = &r; fun(p); printf("%d", *p); return 0; }
void fun(int *p) { int q = 10; p = &q; } int main() { int r = 20; int *p = &r; fun(p); printf("%d", *p); return 0; }
bad_engineer
8.7k
views
bad_engineer
asked
Mar 13, 2016
Programming in C
programming-in-c
barc2016
pointers
+
–
3
votes
1
answer
2
Minimum Spanning tree
An undirected graph G has n nodes. Its adjacency matrix is given by an n × n square matrix whose (i) diagonal elements are 0‘s and (ii) non-diagonal elements are 1‘s. which one of the following is TRUE? 1) Graph G has multiple spanning ... , each of cost n-1 3) Graph G has a unique MST of cost n-1 4) Graph G has no minimum spanning tree (MST)
An undirected graph G has n nodes. Its adjacency matrix is given by an n × n square matrix whose (i) diagonal elements are 0‘s and (ii) non-diagonal elements ...
bad_engineer
1.2k
views
bad_engineer
asked
Mar 16, 2016
Algorithms
barc2016
algorithms
minimum-spanning-tree
easy
+
–
0
votes
3
answers
3
Which of these programs are possible in C++/Java without the use of File I/O ?
P1: A program can print its source code once. P2: A program can print its source code twice. P3: A program takes an input n and prints its source code n number of times. Which of these programs are possible in C++ ... : A. P1 possible B. P1 and P2 possible. C. None Possible. D. All are possible Option can be different
P1: A program can print its source code once.P2: A program can print its source code twice.P3: A program takes an input n and prints its source code n number of times.Whi...
bad_engineer
595
views
bad_engineer
asked
Mar 13, 2016
Programming in C
barc2016
programming
others
geeks
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register