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
GATE | Gate IT 2005 | Question 6
The language {0n 1n 2n | 1 ≤ n ≤ 106} is(A) regular(B) context-free but not regular.(C) context-free but its complement is not context-free.(D) not context-free Answer: (A...
Read More
GATE-Gate IT 2005
Gate IT 2005
GATE
GATE | Gate IT 2005 | Question 5
Which of the following statements is TRUE about the regular expression 01*0?(A) It represents a finite set of finite strings.(B) It represents an infinite set of finite st...
Read More
GATE-Gate IT 2005
Gate IT 2005
GATE
GATE | Gate IT 2005 | Question 4
Let L be a regular language and M be a context-free language, both over the alphabet Σ. Let Lc and Mc denote the complements of L and M respectively. Which of the followin...
Read More
GATE-Gate IT 2005
Gate IT 2005
GATE
GATE | Gate IT 2005 | Question 3
The determinant of the matrix given below is(A) -1(B) 0(C) 1(D) 2 Answer: (A) Explanation: Matrices don’t have value associated with them, but determinant have value assoc...
Read More
GATE-Gate IT 2005
Gate IT 2005
GATE
GATE | Gate IT 2005 | Question 2
If the trapezoidal method is used to evaluate the integral obtained 0∫1x2dx ,then the value obtained(A) is always (1/3)(B) is always (1/3)(C) is always = (1/3)(D) may b...
Read More
GATE-Gate IT 2005
Gate IT 2005
GATE
Count Inversions of size three in a given array
Given an array arr[] of size n. Three elements arr[i], arr[j] and arr[k] form an inversion of size 3 if a[i] a[j] a[k] and i j k. Find total number of inversions of siz...
Read More
Arrays
Advanced Data Structure
Binary Indexed Tree
inversion
DSA
GATE | Gate IT 2005 | Question 1
A bag contains 10 blue marbles, 20 green marbles and 30 red marbles. A marble is drawn from the bag, its colour recorded and it is put back in the bag. This process is rep...
Read More
GATE-Gate IT 2005
Gate IT 2005
GATE
Gaussian Elimination to Solve Linear Equations
The article focuses on using an algorithm for solving a system of linear equations. We will deal with the matrix of coefficients. Gaussian Elimination does not work on sin...
Read More
Mathematical
DSA
Find Square Root under Modulo p | Set 1 (When p is in form of 4*i + 3)
Given a number 'n' and a prime 'p', find square root of n under modulo p if it exists. It may be given that p is in the form for 4*i + 3 (OR p % 4 = 3) where i is an integ...
Read More
Mathematical
Modular Arithmetic
DSA
Microsoft Interview Experience | Set 86 (On-Campus)
Coding Round :1. https://www.cdn.geeksforgeeks.org/reverse-a-list-in-groups-of-given-size/2. Do not remember second question but it was on binary tree.Group-fly round :Rem...
Read More
Arrays
Microsoft
Interview Experiences
DSA
Experiences
Euler's criterion (Check if square root under modulo p exists)
Given a number 'n' and a prime p, find if square root of n under modulo p exists or not. A number x is square root of n under modulo p if (x*x)%p = n%p.Examples :Input: ...
Read More
Mathematical
Modular Arithmetic
DSA
Amazon Interview Experience | Set 237 (For Application Engineer)
1) Written Test on Unix Shell Scripting1. write a script/command to find files older than 7days and zip them and move to specific folder.2. Asked write some examples on CU...
Read More
Amazon
Interview Experiences
Experiences
Philips Interview Experience | Set 3 (For Philips Innovation Campus)
The Initial shortlisting was done on the basis of Resume.Written Round1) English :- 25 questions (25 min)2) Computer Ability :- 25 questions (35 min)3) Logical Reasoning :...
Read More
Interview Experiences
Philips
Experiences
Amdocs Interview Experience | Set 1 (On-Campus)
Round 1:1.Quantative (16 ques in 16 min)2.Reasoning(14 in 14 min).3.English(18 in 16 min).4.Coding(2 question in 45 min). (I)Print pattern(for N=4) 1 3*2 4*5*6 10*9*8...
Read More
Interview Experiences
Amdocs
Experiences
Amazon Interview Experience | Set 236 (Rounds 2 and 3)
Round 2: Paper written coding1) Given an unsorted array with a group of characters taken from the user. Find the first occurrence of non repeating character and print the ...
Read More
Amazon
Interview Experiences
Experiences
1
...
11557
11558
11559
11560