When we have more than one main function in a program how
does the compiler know the starting point of the program, i
mean from which main the execution or compilation of the
program begins?
Answers were Sorted based on User's Feedback
Answer / aks
Program doesn't allow more than one main function.
Is This Answer Correct ? | 15 Yes | 6 No |
Answer / rahul sharma
program doesn't allow more than one main method, where as
we have more than one function
Is This Answer Correct ? | 2 Yes | 0 No |
what is log files in qtp what is use
How to create a new dataset only duplicate observations in proc sort procedure?
For C sharp,At the time of software is implemented at client site, is it required that client machine have C sharp(Microsoft Visual Basic) setup?
Explain the types of operations? Draw the figure for shift and rotate operations?
Describe the following: (i) DNS (ii) Name Resolution (iii) Subnet Masking (iv) Urgent Pointer
what is the diffrence between software and hardware language?
What is abstract Method i want the exact definition and is there any possibility to declare class as abstract without any abstract methods in that class?If it is possible then tell me why and how?
Given a arbitrary pointer to an element in a singly linked list?what is the time complexity for its deletion .
In Bioinformatics, a DNA sequence is made up of a combination of 4 characters, namely “A,C,G,T”. A subsequence of a given sequence of characters a0, a1, …an- 1, is any subset of the characters taken in order, of the form ai0 , ai1 ,…..aik-1 where 0 ≤ i0 <i1….< ik-1 ≤ n-1. For example in the sequence “A,C,G,T,G,T,C,A,A,A,A,T,C,G”, we can have subsequences “A,G,T”, “A,C,A,A” and many more. A subsequence is palindromic if it is the same whether read left to right or right to left. For instance, the sequence “A,C,G,T,G,T,C,A,A,A,A,T,C,G”, has many palindromic subsequences, including “A,C,G,C,A” and “A,A,A,A” (on the other hand, the subsequence “A,C,T” is not palindromic). Devise an algorithm (using dynamic programming) that takes a sequence of characters X[0 … n-1] from the alphabet set (A,C,G,T) and returns the (length of the) longest palindromic subsequence. Implement the algorithm in an appropriate language.
Write a program to create a process in UNIX
HOW TO FIND NUMBER OF TWOS IN N!(N FACTORIAL)??
write algo for cobol program whichuse three flat file to extract some specific information 8 marks mainframe