Toggle navigation
Home
Article Category
Question Papers
General Knowlege
Popular Pages
Multiple Choice Question in 049
Multiple Choice Question in
Multiple Choice Question in TRADES-INSTRUCTOR---GR-II---SMITHY---TECHNICAL-EDUCATION
Multiple Choice Question in -current-affairs-2016
Question Answer in ASSISTANT-PROFESSOR---COMPUTER-SCIENCE-AND-ENGINEERING---TECHNICAL-EDUCATION
Multiple Choice Question in ASSISTANT-PROFESSOR---COMPUTER-SCIENCE-AND-ENGINEERING---TECHNICAL-EDUCATION
Multiple Choice Question in english
Multiple Choice Question in abbreviations-abbreviations-m
Multiple Choice Question in SSC CHSL 7 March 2018 Morning Shift
Multiple Choice Question in 072/2016
Multiple Choice Question in 100/2016
Question Answer Bank
Multiple Choice Question Bank
Question Answer Category
Multiple Choice Question Category
Home
->
Question Answer Bank
1. In linked list START=NULL condition occurs in :
Answer: Under flow.
Previous Question
Next Question
Add Tags
Report Error
Reply
Type in
(Press Ctrl+g to toggle between English and the chosen language)
Post reply
Comments
Tags
Show Similar Question And Answers
QA->In linked list START=NULL condition occurs in :....
QA->A program Graph has ‘start’ and ‘end’ nodes. The total number of paths from start to end is equivalent to the -----------set of test data required to test the software.....
QA->The minimum number of fields with each node of double linked list is :....
QA->Linked list are not suitable for:....
QA->In a circular linked list insertion of a record involves the modification of :....
MCQ-> Study the following information carefully and answer the given questions :A word and number arrangement machine when given an input line of words and number rearranges them following a particular rule in each step. The following is an illustration of input and rearrangement.Input : 51 pour 32 start now 23 46 house Step I : 23 51 pour 32 start now 46 house Step II : 23 start 51 pour 32 now 46 house Step III : 23 start 32 51 pour now 46 house Step IV : 23 start 32 pour 51 now 46 house Step V : 23 start 32 pour 46 51 now house Step VI: 23 start 32 pour 46 now 51 houseAs per the rules followed in the above steps, find out in each of the following questions the appropriate step for the given input.Step II of an input is : 18 task bear cold dish 81 63 31 How many more steps will be required to complete the rearrangement?
...
MCQ->void start() { A a = new A(); B b = new B(); a.s(b); b = null; / Line 5 / a = null; / Line 6 / System.out.println("start completed"); / Line 7 / } When is the B object, created in line 3, eligible for garbage collection?...
MCQ->After a sequence of steps in an algorithm, a linked list reaches the following step, START = NULL Then the situation is,...
MCQ->Match List I correctly with List II and select your answer using the codes given below : List I List II a) The number of events one should observe is 10 1. Alternative hypothesis b) Rejection region 2. Null hypothesis c) Confidence levels 3. - 0.96 to 1.96 d) The number of events one should observe is not 10 4. 0.01 0.05 0.10...
MCQ->What will be the output of the program? #include<stdio.h> #include<stdarg.h> void fun1(char, int, int , float , char ); void fun2(char ch, ...); void (p1)(char, int, int , float , char ); void (p2)(char ch, ...); int main() { char ch='A'; int i=10; float f=3.14; char p="Hello"; p1=fun1; p2=fun2; (p1)(ch, i, &i, &f, p); (p2)(ch, i, &i, &f, p); return 0; } void fun1(char ch, int i, int pi, float pf, char p) { printf("%c %d %d %f %s \n", ch, i, pi, pf, p); } void fun2(char ch, ...) { int i, pi; float pf; char p; va_list list; printf("%c ", ch); va_start(list, ch); i = va_arg(list, int); printf("%d ", i); pi = va_arg(list, int); printf("%d ", pi); pf = va_arg(list, float); printf("%f ", pf); p = va_arg(list, char ); printf("%s", p); }...
×
×
Type The Issue
Terms And Service:We do not guarantee the accuracy of available data ..We Provide Information On Public Data.. Please consult an expert before using this data for commercial or personal use
Powered By:Omega Web Solutions
© 2002-2017 Omega Education PVT LTD...
Privacy
|
Terms And Conditions