Answer Posted / Abhishek Sharma
A simple path in a graph is a path between two vertices that does not pass through any vertex more than once, except for the initial and terminal vertices which can be visited multiple times if they are part of the path.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.
Draw a binary Tree for the expression : A * B - (C + D) * (P / Q)
Write a program for Sorting an Array. Which sorting will you prefer?
What sort of serious problems have you experienced, and how have you handled them?
Can you declare an array without assigning the size of an array?
“int a[] = new int[3]{1, 2, 3}” – This a legal way of defining the arrays?
