UGC Net Computer Science Paper 3 July-16 Page 4

31. the number of different binary trees with 6 nodes is

(1) 6

(2) 42

(3) 132

(4) 256

Answer : 3

32. Let A[1…n] be an array of n distinct numbers. If i<j and a[i]>a[j], the the pair (I,j) is called an inversion of A. what is the expected number of inversion in any permutation on n elements

(1) Θ(n)

(2) Θ(lgn)

(3) Θ(nlgn)

(4) Θ(n2)

Answer : 1

Queue implementation using array

//Girfa Student Help
// For More DS Program Visit
// http://girfahelp.blogspot.in/p/data.html
#include<stdio.h>
#include<conio.h>
#define MAX 5
void main()
{
int ar[MAX],front=-1,rear=-1,opt,n;
do
{
clrscr();
printf("\n1. Enqueue\n2. Dequeue\n3. Print\n0. Exit\nEnter your choice>> ");
scanf("%d",&opt);
switch(opt)

Stack Using Array

//Girfa Student Help stack using array
#include<iostream.h>
#include<conio.h>
#define MAX 5
void main()
{
int ar[MAX],top=-1,i,opt;
do
{
clrscr();
cout<<"\n\t1. Push\n\t2. Pop\n\t0. Exit\n\tEnter your choce>> ";
cin>>opt;
switch(opt)
{
case 1:

Face stone effect

Face stone effect

Step 1

• ·         Open your image
• ·         And select face area of girl