Courses
Tutorials
Jobs
Practice
Contests
Data Structure
Java
Python
HTML
Interview Preparation
Trending Now
DSA
Web Tech
Foundational Courses
Data Science
Practice Problem
Python
Machine Learning
JavaScript
System Design
Django
DevOps Tutorial
Java
C
C++
ReactJS
NodeJS
CP Live
Aptitude
Puzzles
Projects
GBlog
Frontend Developer Roadmap 2024
Frontend development means to design the face of a website or application. It involves working on the appearance of the website. Building interactive buttons, using images...
Read More
UGC-NET | UGC NET CS 2017 Jan - III | Question 39
Consider the following JAVA program :public class First { public static int CBSE (int x) { if (x < 100) x = CBSE (x + 10); ...
Read More
UGC-NET
UGC-NET | UGC NET CS 2017 Jan - III | Question 38
Given the array of integers ‘array’ shown below :13, 7, 27, 2, 18, 33, 9, 11, 22, 8.What is the output of the following JAVA statements ?int [ ] p = new int [10];int [ ] q...
Read More
UGC-NET
ISRO | ISRO CS 2016 | Question 59
Configuration management is not concerned with(A)controlling changes to the source code(B)choice of hardware configuration for an application(C)controlling documentation c...
Read More
ISRO
UGC-NET | UGC NET CS 2017 Jan - III | Question 37
Abstraction and encapsulation are fundamental principles that underlie the object oriented approach to software development. What can you say about the following two state...
Read More
UGC-NET
UGC-NET | UGC NET CS 2017 Jan - III | Question 36
Match the following with respect to algorithm paradigms : (A)(1)(B)(2)(C)(3)(D)(4) Answer: (D)Explanation:Merge sort is a Divide and conquer algorithmHuffman coding is a ...
Read More
UGC-NET
UGC-NET | UGC NET CS 2017 Jan - III | Question 35
Dijkstra’s algorithm is based on(A)Divide and conquer paradigm(B)Dynamic programming(C)Greedy Approach(D)Backtracking paradigm Answer: (C)Explanation:Dijkstra’s algorithm...
Read More
UGC-NET
UGC-NET | UGC NET CS 2017 Jan - III | Question 34
The minimum number of scalar multiplication required, for parenthesization of a matrix-chain product whose sequence of dimensions for four matrices is is(A) 630(B) 580(C)...
Read More
UGC-NET
UGC-NET | UGC NET CS 2017 Jan - III | Question 33
Red-black trees are one of many search tree schemes that are “balanced” in order to guarantee that basic dynamic-set operations take ________ time in the worst case.(A) O(...
Read More
UGC-NET
UGC-NET | UGC NET CS 2017 Jan - III | Question 32
Any decision tree that sorts n elements has height ________. (A)Ω(log n)(B)Ω(n)(C)Ω(n log n)(D)Ω(n2) Answer: (A) ...
Read More
UGC-NET
UGC-NET | UGC NET CS 2017 Jan - III | Question 31
The asymptotic upper bound solution of the recurrence relation given by (A)O(n2)(B)O(n log n)(C)O(n log log n)(D)O(log log n) Answer: (C)Explanation:We will apply master ...
Read More
UGC-NET
UGC-NET | UGC NET CS 2017 Jan - III | Question 30
A node X on a 10 Mbps network is regulated by a token bucket. The token bucket is filled at a rate of 2 Mbps. Token bucket is initially filled with 16 megabits. The maximu...
Read More
UGC-NET
UGC-NET | UGC NET CS 2017 Jan - III | Question 29
In RSA public key cryptosystem suppose n = p ∗ q where p and q are primes. (e, n) and (d, n) are public and private keys respectively. Let M be an integer such that o < M ...
Read More
UGC-NET
UGC-NET | UGC NET CS 2017 Jan - III | Question 28
In a packet switching network, if the message size is 48 bytes and each packet contains a header of 3 bytes. If 24 packets are required to transmit the message, the packet...
Read More
UGC-NET
PayU Interview Experience | Set 8
Round 1: It was a coding round held in our campus. There were 30 Java MCQ's on OOPs concepts and spring framework. There were some questions on Java Beans too. Additionall...
Read More
Interview Experiences
Experiences
UGC-NET | UGC NET CS 2017 Jan - III | Question 27
Let G(x) be generator polynomial used for CRC checking. The condition that should be satisfied by G(x) to correct odd numbered error bits, will be:(A) (1 + x) is factor of...
Read More
UGC-NET
1
...
11102
11103
11104
...
11291