1. Count the number of squares in the given figure.





Write Comment

Type in
(Press Ctrl+g to toggle between English and the chosen language)

Comments

Tags
Show Similar Question And Answers
QA->HOW MANY SQUARES ARE THERE IN A CHESS BOARD....
QA->On November 30, 2014, the Simon Wiesenthal Center reported that a senior Nazi figure who centrally involved in the implementation of the Holocaust had died in Syria around 2010, or four years earlier. Who is that Nazi figure?....
QA->Which literary figure of the Gupta Age is given the title of 'Indian Shakespeare'?....
QA->Which literary figure of the Gupta Age is given the title of 'Indian Shakespeare' ?....
QA->The three-fifth of a number is 40 more than the 40 percent of the same number. The number is :....
MCQ->Which of the following statements are correct about the C#.NET code snippet given below? namespace IndiabixConsoleApplication { class index { protected int count; public index() { count = 0; } } class index1: index { public void increment() { count = count +1; } } class MyProgram { static void Main(string[] args) { index1 i = new index1(); i.increment(); } } } count should be declared as public if it is to become available in the inheritance chain. count should be declared as protected if it is to become available in the inheritance chain. While constructing an object referred to by i firstly constructor of index class will be called followed by constructor of index1 class. Constructor of index class does not get inherited in index1 class. count should be declared as Friend if it is to become available in the inheritance chain.....
MCQ->What will be the output of the program? class BoolArray { boolean [] b = new boolean[3]; int count = 0; void set(boolean [] x, int i) { x[i] = true; ++count; } public static void main(String [] args) { BoolArray ba = new BoolArray(); ba.set(ba.b, 0); ba.set(ba.b, 2); ba.test(); } void test() { if ( b[0] && b[1] | b[2] ) count++; if ( b[1] && b[(++count - 2)] ) count += 7; System.out.println("count = " + count); } }....
MCQ->What will be the output of the following program? #include<iostream.h> class IndiaBix { static int count; public: static void First(void) { count = 10; } static void Second(int x) { count = count + x; } static void Display(void) { cout<< count << endl; } }; int IndiaBix::count = 0; int main() { IndiaBix :: First(); IndiaBix :: Second(5); IndiaBix :: Display(); return 0; }....
MCQ-> In each of the following questions two rows of number are given. The resultant number in each row is to be worked out separately based on the following rules and the question below the row is to be answered. The operations of number progress from the left to right. Rules: (i) If an even number is followed by another even number they are to be added. (ii) If an even number is followed by a prime number, they are to be multiplied. (iii) If an odd number is followed by an even number, even number is to be subtracted from the odd number. (iv) If an odd number is followed by another odd number the first number is to be added to the square of the second number. (v) If an even number is followed by a composite odd number, the even number is to be divided by odd number.I. 84 21 13 II. 15 11 44 What is half of the sum of the resultants of the two rows ?....
MCQ->What will be the output of the following program? #include<iostream.h> class BaseCounter { protected: long int count; public: void CountIt(int x, int y = 10, int z = 20) { count = 0; cout<< x << " " << y << " " << z << endl; } BaseCounter() { count = 0; } BaseCounter(int x) { count = x ; } }; class DerivedCounter: public BaseCounter { public: DerivedCounter() { } DerivedCounter(int x): BaseCounter(x) { } }; int main() { DerivedCounter objDC(30); objDC.CountIt(40, 50); return 0; }....
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
DMCA.com Protection Status Powered By:Omega Web Solutions
© 2002-2017 Omega Education PVT LTD...Privacy | Terms And Conditions