Coding Made Easy: March 2017

Monday, 13 March 2017

C Program to Check whether a Number is Even or Odd without using Arithmetic Operators

We can check whether a number is even or odd without using arithmetic operators in C to do this let us first consider the binary of some of numbers

1:00000001
2:00000010
3:00000011
4:00000100
5:00000101
6:00000110
There is a catch here, we can see that each of the odd number has the rightmost(LSB) bit as '1'. We can use this information and find out whether a number is even or odd. If we apply 'bitwise &' operator on number and 00000001, it will result in 00000001 if the number is odd.

Here is the C code :

#include<stdio.h>
#include<conio.h>
void main()
{
int n;
clrscr();
printf("***************Even or Odd without Arithmetic Operators****************\n");
printf("Enter a Number");
scanf("%d",&n);
if(n&1==1)
printf("It is Odd");
else
printf("It is even");
getch();
}

Hope you like the solution.

Best program to find  whether a Number is Even or Odd without using Arithmetic Operators
Best algorithm to find  whether a Number is Even or Odd without using Arithmetic Operators
Best algorithm to check whether a Number is Even or Odd without using Arithmetic Operators
Best program to check whether a Number is Even or Odd without using Arithmetic Operators
Best C program to find  whether a Number is Even or Odd without using Arithmetic Operators
Best C program to check whether a Number is Even or Odd without using Arithmetic Operators
C program to check whether a Number is Even or Odd without using Arithmetic Operators

Saturday, 11 March 2017

C Program to Print Fibonacci Series

In mathematics, the Fibonacci numbers are the numbers in the following integer sequence, called the Fibonacci sequence, and characterized by the fact that every number after the first two is the sum of the two preceding ones:

1,1,2,3,5,8,13,21,34,55,89,144...

Often, especially in modern usage, the sequence is extended by one more initial term:

0,1,1,2,3,5,8,13,21,34,55,89,144...

By definition, the first two numbers in the Fibonacci sequence are either 1 and 1, or 0 and 1, depending on the chosen starting point of the sequence, and each subsequent number is the sum of the previous two.

In mathematical terms, the sequence F(n) of Fibonacci numbers is defined by the recurrence relation:

F(n) = F(n-1) + F(n-2)

It defines that the the nth term of the sequence is sum of two previous terms.

F(4) = F(3) + F(2) = 1 + 1 = 2

Here is a non-recursive code of C Program to print first 'n' terms of Fibonacci Series

#include<stdio.h>

void main()

{

int a=-1,b=1,n,i,c;

printf("\n************************Fibonacci Series****************************\n");

printf("Enter number of terms you want to print\n");

scanf("%d",&n);

for(i=1;i<=n;i++)

{

c=a+b;

a=b;

b=c;

printf("%d\t",c);

}

}

Here is a recursive version code of C Program to print first 'n' terms of Fibonacci Series

#include<stdio.h>

int fib(int n)

{

if(n==1)

return 0;

else if(n==2)

return 1;

else

return fib(n-1)+fib(n-2);

}

void main()

{

int n,s,i=1;

clrscr();

printf("\n************************Fibonacci Series****************************\n");

printf("Enter number of terms you want to print\n");

scanf("%d",&n);

for(i=1;i<=n;i++)

{

s=fib(i);

printf("%d\t",s);

}

}

Output::

C Program to print first 'n' terms of Fibonacci Series

non-recursive code of C Program to print first 'n' terms of Fibonacci Series
Fibonacci series in c
recursive version code of C Program to print first 'n' terms of Fibonacci Series
c program for Fibonacci series without and with recursion.
best program to print fibonacci series

Fibonacci Series algorithm ,Fibonacci Series non-recursive algorithm ,Fibonacci Series iterative algrothim ,Fibonacci Series recursive program in c,

Tuesday, 7 March 2017

UGC-NET January 2017 Assembly Language Question with Explanation

Q:: 32 Consider the following assembly language instructions:

mov al, 15

mov ah, 15

xor al, al

mov cl, 3

shr ax, cl

add al, 90H

adc ah, 0

What is the true in ax register after execution of above instructions?
(1)0270H (2)0170H

(3)01E0H (4)0370H

Answer:: (1)

Explanation::

mov al, 15

It means move 15 to lower part of 'ax' register

mov ah, 15

It means move 15 to higher part of 'ax' register

The 'ax' register content looks like

0000111100001111

xor al,al

It means 'XORing lower part of 'ax' register with its own content and storing result back in 'al' , now the 'ax' register content will be

00001111

xor00000000

'ax' register content:: 0000111100000000

move cl,3

It means move 3 to lower part of 'cx' register

The 'c' register content looks like

0000000000000011

shr ax, cl

It will shift right and rotate content of 'ax' register

The 'ax' register content looks like

0000000111100000

add al, 90H

Add hexadecimal 90 to al

0000000111100000

0000000010010000

+0000001001110000

adc ah,0

It means addition with carry which does not affect 'ax' register

So, content of ax register will be 0270H.

UGC-NET January 2017 Assembly Language Question with Explanation, Assembly language, assembly programs, cbse NET January 2017 Assembly Language Question with Explanation,UGC-NET January 2017 Assembly Language programs with Explanation,

UGC NET Algorithm Solved Question

Q:: What is the maximum number of comparisons to find minimum and maximum element from an array with n elements ?

(A) 2n-2 (B) 2n

(C) 1.5n-2 (D) n

Answer :: (C)

Explanation::

Let us take some array elements as 12, 34, 5, 66, 22, 43, 7, 9

First of all we will compare first and second element and keep the larger one as max and smaller as min, then we take next two elements and compare them and then compare the larger with max and smaller with min like this we have 3 comparison for every two elements So 1.5 for each element making a total of 1.5n but for the first two we only make one comparison so finally no. of comparison become 1.5n-2.
So, (C) is correct.

C Program to find Maximum and Minimum element from array

#include<stdio.h>
#include<conio.h>
void main()
{
int i,min,a[100],max,n;
clrscr();
printf("Enter no. of elements to be stored");
scanf("%d",&n);
for(i=0;i<n;i=i+2)
{
printf("Enter no.\n");
scanf("%d",&a[i]);
}
if(a[0]>a[1])
{
max=a[0];min=a[1];
}
else
{
max=a[1];min=a[0];
}

for(i=2;i<=n-2;i++)
{
if(a[i]>a[i+1])
{
if(a[i]>max)
max=a[i];
if(a[i+1]<min)
min=a[i+1];
}
else
{
if(a[i]<min)
min=a[i];
if(a[i+1]>max)
max=a[i+1];
}

}

printf("\nMAX = %d\nMIN = %d",max,min);
getch();
}

C Program to find Maximum and Minimum element from array, complexity of finding Maximum and Minimum element from array, max and min element from array, best algorithm to find Maximum and Minimum element from array

UGC-NET January 2017 Paper-2 Discrete Maths Questions Solved

Q:: 4 How many multiples of 6 are there between the following pairs of numbers? 0 and 100 – 6 and 34

(1)16 and 6 (2) 17 and 6

(3) 17 and 7 (4) 16 and 7

Answer:: (1)

Explanation::

Numbers divisible by 6 between 0 and 100 are::

6,12,18,...96 So there are 16 such numbers as nth term of A.P. is given by Tn = a+(n-1)d

In our example a = 6, d = 6, Tn=96

96 = 6 + (n-1)*6 => n = 16

Similarly between -6 and 34 numbers divisible by 6 are::

0,6,12,...30 So there are 6 such numbers as this also form an A.P.

a=0 , d=6, tn=30

30 = 0+(n-1)*6 => n=6

So correct option is (1)

cbse-NET January 2017 Paper-2 Discrete Maths Question Solved
UGC-NET January 2017 Paper-2 Solved UGC-NET January 2017 Paper-2 UGC-NET January 2017 Paper-2 questions with solution UGC-NET January 2017 Paper-2 question 1 solved complete solution UGC-NET January 2017 Paper-2

cbse-NET January 2017 Paper-2 Solved cbse-NET January 2017 Paper-2 cbse-NET January 2017 Paper-2 questions with solution cbse-NET January 2017

Monday, 6 March 2017

UGC-NET January 2017 Paper-2 Discrete Maths Questions Solved

Q:: 3 The functions mapping R into R are defined as: f(x) = and h(x) = .

Then find the value of the following composite functions: hog(x) and hogof(x)

(1)    and
(2)    and
(3)

and

(4) and

Answer:: (4)

Explanation::

hog(x) = h(g(x)) = (1/(x^2+1))^4 = (x^2 + 1)^-4

hogof(x) = ho(g(f(x))) =

Now g(f(x)) = 1/((x^3-4x)^2 + 1)

h(g(f(x))) = h(1/((x^3-4x)^2 + 1)) = (1/((x^3-4x)^2 + 1))^4

= ((x^3-4x)^2 + 1)^-4

Hence hog(x) = (x^2 + 1)^-4 and hogof(x) = ((x^3-4x)^2 + 1)^-4

So correct answer is (D)

UGC-NET January 2017 Paper-2 discrete maths questions with solution

UGC-NET January 2017 Paper-2 Solved UGC-NET January 2017 Paper-2 UGC-NET January 2017 Paper-2 questions with solution UGC-NET January 2017 Paper-2 question 3 solved complete solution UGC-NET January 2017 Paper-2

cbse-NET January 2017 Paper-2 Solved cbse-NET January 2017 Paper-2 cbse-NET January 2017 Paper-2 questions with solution cbse-NET January 2017 Paper-2 question 3 solved complete solution cbse-NET January 2017 Paper-2

UGC-NET January 2017 Paper-2 Discrete Maths Question Solved

Q::1 Consider a sequence defined as:

for n ≥ 2

Then what shall be the set of values of the sequence ?

(1) (1, 110, 1200) (2) (1, 110, 600, 1200)
(3) (1, 2, 55, 110, 600, 1200) (4) (1, 55, 110, 600, 1200)

Answer:: (1)

Explanation::

The sequence can be estimated by recursive solutions let us calculate the resul produce by F00(5)

F00(5) = (10*F00(4)+100)/F00(3)

Now, calculate F00(4)

F00(4) = (10*F00(3)+100)/F00(2)

F00(3) = (10*F00(2)+100)/F00(1)

F00(2) = (10*F00(1)+100)/F00(0)

Now substituting values of F00(0) = 1, F00(1) = 1

We get ,

F00(2) = (10*1+100)/1 = 110

Substituting F00(1)=1, F00(2)=110

We get,

F00(3) = (10*110+100)/1 = 1200

Substituting F00(2)=110, F00(3)=1200

We get,

F00(4) = (10*1200+100)/110 = 110

Substituting F00(3)=1200, F00(4)=110

We get,

F00(5) = (10*110+100)/1200 = 1

So the sequence is like F00(0) = 1, F00(1) = 1, F00(2) = 110, F00(3) = 1200,

F00(4) = 110, F00(5) = 1 and So on...(1,1,110,1200,110,1,1...)

So option A includes 1,110,1200 So it is correct.

UGC-NET January 2017 Paper-2 Discrete Maths Question Solved

cbse-NET January 2017 Paper-2 Discrete Maths Question Solved

UGC-NET January 2017 Paper-2 Solved UGC-NET January 2017 Paper-2 UGC-NET January 2017 Paper-2 questions with solution UGC-NET January 2017 Paper-2 question 1 solved complete solution UGC-NET January 2017 Paper-2

cbse-NET January 2017 Paper-2 Solved cbse-NET January 2017 Paper-2 cbse-NET January 2017 Paper-2 questions with solution cbse-NET January 2017 Paper-2 question 1 solved complete solution cbse-NET January 2017 Paper-2

UGC-NET January 2017 Paper-2

Q::1 Consider a sequence defined as:

for n ≥ 2

Then what shall be the set of values of the sequence ?

(1) (1, 110, 1200) (2) (1, 110, 600, 1200)
(3) (1, 2, 55, 110, 600, 1200) (4) (1, 55, 110, 600, 1200)

Answer:: (1)

Explanation:: http://cbsenetmaterial.blogspot.in/2017/03/ugc-net-january-2017-paper-2-solved.html

Q::2 Match the following:

List-I	List-II
(a) Absurd	(i)Clearly impossible being contrary to some evident truth.
(b)Ambiguous	(ii)Capable of more than one interpretation or meaning.
(c)Axiom	(iii)An assertion that is accepted and used without a proof.
(d)Conjecture	(iv)An opinion preferably based on some experience or wisdoms.

Codes:

	a	b	c	d
(1)	i	ii	iii	iv
(2)	i	iii	iv	ii
(3)	ii	iii	iv	i
(4)	ii	i	iii	iv

Q:: 3 The functions mapping R into R are defined as: f(x) = and h(x) = .

Then find the value of the following composite functions: hog(x) and hogof(x)

(1)    and
(2)    and
(3)

and

(4) and

Answer:: (4)

Explanation:: http://cbsenetmaterial.blogspot.in/2017/03/ugc-net-january-2017-paper-2-discrete.html

Q:: 4 How many multiples of 6 are there between the following pairs of numbers? 0 and 100 – 6 and 34
(1)16 and 6 (2) 17 and 6
(3) 17 and 7 (4) 16 and 7

Answer:: (1)

Explanation:: http://cbsenetmaterial.blogspot.in/2017/03/cbse-net-january-2017-paper-2-discrete.html

Q:: 5 Consider a Hamiltonian Graph G with no loops or parallel edges and with
|V(G)| = n ≥ 3. Then which of the following is true?

(1)deg(v) ≥ n/2 for each vertex v.

(2) |E(G)|>=1/2(n-1)(n-2) + 2

(3)deg(v) + deg(w) ≥ n whenever v and w are not connected by an edge.

(4)All of the above

Q:: 6 In propositional logic if (P → Q) ∧ (R → S) and (P ∨ R) are two premises such that

(P → Q) ∧ (R → S)

(P ∨ R)

Y is the premise:

(1)P ∨ R (2) P ∨ S

(3) Q ∨ R (4) Q ∨ S

Q:: 7 ECL is the fastest of all logic families. High speed in ECL is possible because transistors are used in difference amplifier configuration, in which they are never driven into ________.

(1)Race condition (2) Saturation

(3) Delay (4) High impedance

Q:: 8. A binary 3-bit down counter uses J-K flip-flops, FFi with inputs Ji, Ki and outputs Qi, i=0,1,2 respectively. The minimized expression for the input from following is

I. J0=K0=0

II. J0=K0=1

III. J1=K1=Q0

IV. J1=K1=Q’0

V. J2=K2=Q1Q0

Vl. J2=K2=Q’1Q’0

(1) I, Ill, V (2) I, IV, VI

(3) Il, III, V (4) Il, IV, Vl

Answer:: (4)

Q:: 9 Convert the octal number 0.4051 into its equivalent decimal number.

(1)0.5100098 (2) 0.2096

(3) 0.52 (4) 0.4192

Q:: 10 The hexadecimal equivalent of the octal number 2357 is:

(1)2EE (2) 2FF

(3) 4EF (4) 4FE

Q:: 11 Which of the following cannot be passed to a function in C++?
(1)Constant (2) Structure
(3) Array (4) Header file

Q:: 12 Which one of the following is correct for overloaded functions in C++?
(1)Complier sets up a separate function for every definition of function.
(2)Complier does not set up a separate function for every definition of
function.
(3)Overloaded functions cannot handle different types of objects.
(4)Overloaded functions cannot have same number of arguments.

Q:: 13 Which of the following storage classes have global visibility in C/C++?
(1)Auto (2) Extern
(3) Static (4) Register

Q:: 14 Which of the following operators cannot be overloaded in C/C++?
(1)Bitwise right shift assignment
(2)Address of
(3)Indirection
(4)Structure reference

Q:: 15 If X is a binary number which is power of 2 , then the value of X & (X – 1) is:
(1)11….11 (2) 00….00
(3) 100….0 (4) 000….1

Q:: 16 An attribute A of datatype varchar (20) has value ‘Ram’ and the attribute B of datatype char (20) has value ‘Sita’ in oracle. The attribute A has ____memory spaces and B has _____ memory spaces.
(1)20,20 (2) 3,20
(3) 3,4 (4) 20,4

Q:: 17 Integrity constraints ensure that changes made to the database by authorized users do not result into loss of data consistency .
Which of the following statement(s) is (are) true w.r.t. the examples of integrity constraints?
(A)An instruction Id. No. cannot be null, provided Intructor Id No. being primary key.
(B)No two citizens have same Adhar-Id.
(C)Budget of a company must be zero.
(1)(A), (B) and (C) are true. (2)(A) false, (B) and (C) are true.
(3)(A) and (B) are true; (C) false. (4)(A), (B) and (C) are false.

Q:: 18 Let M and N be two entities in an E-R diagram with simple single value attributes. and are two relationship between M and N, where as is one-to-many and is many-to-many. The minimum number of tables required to represent M, N, and in the relational modal are _____.
(1)4 (2) 6
(3) 7 (4) 3

Q:: 19 Consider a schema R(MNPQ) and functional dependencies M → N, P → Q. Then the decomposition of R into into (MN) and is ____.
(1)Dependency preserving but not lossless join.
(2)Dependency preserving and lossless join.
(3)Lossless join but not dependency preserving
(4)Neither dependency preserving nor lossless join.

Q:: 20 The order of a leaf node in a true is the maximum number of children it can have. Suppose that block size is 1 kilobytes, the child pointer takes 7 bytes long and search field value takes 14 bytes long. The order of the leaf node is ______.
(1)16 (2) 63
(3) 64 (4) 65

Q:: 21 Which of the following is true for computation time in insertion, deletion and finding maximum and minimum element in a sorted array?
(1)Insertion – 0(1), Deletion – 0(1), Maximum – 0(1), Minimum – 0(1)
(2)Insertion – 0(1), Deletion – 0(1), Maximum – 0(n), Minimum – 0(n)
(3)Insertion – 0(n), Deletion – 0(n), Maximum – 0(1), Minimum – 0(1)
(4)Insertion – 0(n), Deletion – 0(n), Maximum – 0(n), Minimum – 0(n)

Q:: 22 The seven elements A,B,C,D,E,F and G are pushed onto a stack in reverse order , i.e., starting from G. The stack is popped five times and each element is inserted into a queue. Two elements are deleted from the queue and pushed back onto the stack. Now; one element is popped from the stack. The popped item is _____.
(1)A (2) B
(3) F (4) G

Q:: 23 Which of the following is a valid heap?

Q:: 24 If h is chosen from a universal collection of hash functions and is used to hash n keys into a table of size m. where n ≤ m, the expected number of collisions involving a particular key x is less than _____.
(1)1 (2)
(3) (4)

Q:: 25 Which of the following statements is false?
(A)Optimal binary search tree construction can be performed efficiently using dynamic programming.
(B)Breadth-first search cannot be used to find connected components of a graph.
(C)Given the prefix and postfix walks of binary tree, the cannot be re-constructed uniquely.
(D)Depth-first-search can be used to find the connected components of graph
(1)A (2) B
(3) C (4) D

Q::26 Match the following Layers and Protocols for a user browsing with SSL:

Application of layer i. TCP
Transport layer ii. IP
Network layer iii. PPP
Datalink layer iv. HTTP

Codes:

a        b        c        d
(1)iv        i        ii        iii
(2)iii        ii        i        iv
(3)ii        iii        iv        i
(4)iii        i        iv        ii

Q:: 27 The maximum size of the data that the application layer can pass on to the TCP layer below is _______.

(1) (2) bytes + TCP header length

(3) bytes – TCP header length (4) bytes

Q:: 28 A packet whose destination is outside the local TCP/IP network segment is sent to _____.
(1)File server (2)DNS server
(3)DHCP server (4)Default gateway

Q:: 29 Distance vector routing algorithm is a dynamic routing algorithm. The routing tables in distance vector routing algorithm are updated ______.
(1)Automatically
(2)By server
(3)By exchanging information with neighbor nodes
(4)With back up database

Q:: 30 In link state routing algorithm after , construction of link state packets, new routes are computed using:
(1)DES algorithm
(2)Dijkstra’s algorithm
(3)RSA algorithm
(4)Packets

Q:: 31 Which of the following strings would match the regular expression:
p + [3 – 5] * [xyz]?
(I)p443y (II)p6y
(III)3xyz (IV)p35z
(V)p353535x (VI)ppp5
(1)I, III and VI only (2)IV, V and VI only
(3)II, IV and V only (4)I, IV and V only

Q:: 32 Consider the following assembly language instructions:

mov al, 15
mov ah, 15
xor al, al
mov cl, 3
shr ax, cl
add al, 90H
adc ah, 0

What is the true in ax register after execution of above instructions?
(1)0270H (2)0170H

(3)01E0H (4)0370H

Q:: 33 Consider the following statements related to compiler construction:
(I) Lexical Analysis is specified by context-free grammars and implemented by pushdown automata.

(II) Syntax Analysis is specified by regular expressions and implemented by finite-state machine.

Which of the above statement(s) is/are correct?
(1)Only I (2)Only II

(3)Both I and II (4)Neither I nor II

Q:: 34 The contents of Register (BL) and Register (AL) of 8085 microprocessor are 49H and 3AH respectively. The contents of AL, the status of carry flag (CF) and sign flag (SF) after executing ‘SUB AL,BL’ assembly language instruction, are
(1)AL = 0FH; CF = 1; SF = 1 (2)AL = F0H; CF = 0; SF = 0
(3)AL = F1H; CF = 1; SF = 1 (4)AL = 1FH; CF = 1; SF = 1

Q:: 35 Which of the following statement(s) regarding a linker software is/are true?
(I)A function of linker is to combine several object modules into a single load module.
(II)A function of a linker is to replace absolute references in an object module by symbolic references to locations in other modules.
(1)Only I (2)Only II
(3)Both I and II (4)Neither I nor II

Q:: 36 There are three processes and sharing a semaphore for synchronizing a variable. Initial value of semaphore is one. Assume that negative value of semaphore tells us how many processes are waiting in queue. Processes access the semaphore in following order:
P2 needs to access
P1 needs to access
P3 needs to access
P2 exits critical section
P1 exits critical section
The final value of semaphore will be:
(1)0 (2)1
(3)-1 (4)-2

Q:: 37 In a paging system, it takes 30 ns to search translation Look-a-side Buffer (TLB) and 90 ns to access the main memory. If the TLB hit ratio is 70%, the effective memory access time is:
(1)48 ns (2) 147 ns
(3) 120 ns (4) 84 ns

Q:: 38 Match the following w.r.t. Input/Output management:

List-I	List-II
(a)Device controller	(i)Extracts information from the controller register and store it in data buffer
(b)Device driver	(ii)I/O scheduling
(c)Interrupt handler	(iii)Performs data transfer
(d)Kernel I/O subsystem	(iv)Processing of I/O request

Codes:

a b c d

iii iv i ii
ii i iv iii
iv i ii iii
i iii iv ii

Q:: 39 Which of the following scheduling algorithms may cause starvation?
(a) First-come –first-served (b) Round Robin (c) Priority (d) Shortest process next (e) Shortest remaining time first
(1)a, c and e (2)c, d and e
(3)b, d and e (4)b, c and d

Q:: 40 Distributed operating systems consist of:
(1)Loosely coupled O.S. software on a loosely coupled hardware.
(2)Loosely coupled O.S. software on a tightly coupled hardware.
(3)Tightly coupled O.S. software on a loosely coupled hardware.
(4)Tightly coupled O.S. software on a tightly coupled hardware.

Q:: 41 Software Engineering is an engineering discipline that is concerned with:
(1)how computer systems work.
(2)theories and methods that underlie computers and software systems.
(3)all aspects of software production
(4)all aspects of computer-based systems developments, including hardware, software and process engineering.

Q:: 42 Which of the following is not one of three software product aspects addressed by McCall’s software quality factors?
(1)Ability to undergo change
(2)Adaptability to new environments
(3)Operational characteristics
(4)Production costs and scheduling

Q:: 43 Which of the following statement(s) is/are true with respect to software architecture?

S1: Coupling is a measure of how well the things grouped together in a module belong together logically.

S2: Cohesion is a measure of the degree of interaction between software modules.

S3: If coupling is low and cohesion is high then it is easier to change one module without affecting others.
(1)Only S1 and S2
(2)Only S3
(3)All of S1, S2 and S3
(4)Only S1

Q:: 44 The prototyping model of software development is:
(1)a reasonable approach when requirements are well-defined.
(2)a useful approach when a customer cannot define requirements clearly.
(3)the best approach to use for projects with large developments teams.
(4)a risky model that rarely produces a meaningful product.

Q:: 45 A software design pattern used to enhance the functionality of an object at run-time is:
(1)Adapter (2) Decorator
(3) Delegation (4) Proxy

Q:: 46 Match the following:

List-I	List-II
(a)Affiliate Marketing	(i)Vendors ask partners to place logos on partner’s site. If customers click, come to vendors and buy.
(b)Viral marketing	(ii)Spread your brand on the net by word-of-mouth. Receivers will send your information to their friends.
(c)Group purchasing	(iii)Aggregating the demands of small buyers to get a large volume. Then negotiate a price.
(d)Bartering online	(iv)Exchanging surplus products and services with the process administered completely online by an intermediary. Company receives “points” for its contribution.

codes:

a        b        c        d
(1) i ii        iii        iv
(2) i iii        ii        iv
(3) iii        ii        iv        i
(4) ii        iii        i        iv

Q:: 47 ______ refers loosely to the process of semi-automatically analyzing large databases to find useful patterns.
(1)Data-mining (2)Data warehousing
(3)DBMS (4)Data mirroring

Q:: 48 Which of the following is/are true w.r.t. applications of mobile computing?
(A)Travelling of salesman
(B)Location awareness services
(1)(A) true; (B) false
(2)Both (A) and (B) are true.
(3)Both (A) and (B) are false.
(4)(A) false; (B) true.

Q:: 49 In 3G network, W-CDMA is also known as UMTS. The minimum spectrum allocation required for W-CDMA is__________.
(1)2 MHz (2)20 KHz
(3)5 KHz (4)5 MHz

Q:: 50 Which of the following statements is/are true w.r.t. Enterprise Resource Planning (ERP)?
(A)ERP automates and integrates majority of business processes.
(B)ERP provides access to information in a Real Time Environment.
(C)ERP is inexpensive to implement.
(1)(A),(B) and (C) are false.
(2)(A) and (B) false; (C) true.
(3)(A) and (B) true; (C) false.
(4)(A) true; (B) and (C) are false

UGC-NET January 2017 Paper-2, UGC-NET January 2017 Paper-2 solved, UGC-NET January 2017 Paper-2 solution, UGC-NET January 2017 Paper-2 with solution UGC-NET January 2017 Paper-2 with explanation UGC-NET January 2017 Paper-2 complete solution