Welcome to Vikatu

The NIMCET (National Institute of Technology MCA Common Entrance Test) is a national-level entrance exam conducted in India for admission to the Master of Computer Applications (MCA) program offered by various National Institutes of Technology (NITs) located across the country. NIMCET is a highly competitive examination that allows candidates to seek admission to some of the top NITs, which are renowned for their MCA programs.   Here are some key points about the NIMCET exam:   1. Purpose: NIMCET is conducted to assess the eligibility of candidates for admission to the MCA programs at NITs. It is the common entrance test for MCA programs in these institutions.   2. Participating Institutes : NIMCET scores are accepted by 11 NITs across India, including NIT Trichy, NIT Surathkal, NIT Warangal, and others. Candidates who qualify can seek admission to any of these NITs based on their rank.   3. Exam Pattern : The NIMCET exam typically consists of multip...

Preparing for the NIMCET (National Institute of Technology Master of Computer Applications Common Entrance Test) is essential if you want to secure admission to a Master of Computer Applications (MCA) program at one of the participating NITs (National Institutes of Technology) in India. Here's a step-by-step guide to help you prepare effectively for the NIMCET:   1. Understand the Exam Pattern:    - NIMCET consists of multiple-choice questions (MCQs) covering subjects like Mathematics, Analytical Ability & Logical Reasoning, Computer Awareness, and General English.    - There are a total of 120 questions, and the exam is typically for two hours.    - The marking scheme may vary from year to year, so make sure you understand it well.   2. Get the Syllabus:    - Obtain the official NIMCET syllabus from the NIMCET website or brochure. Familiarize yourself with the topics that will be covered in the exam.   3. Cr...

MATHEMATICS : (50 QUESTIONS) · Set Theory: Concept of sets – Union, Intersection, Cardinality, Elementary counting; permutations and combinations.   · Probability and Statistics: Basic concepts of probability theory, Averages, Dependent and independent events, frequency distributions, measures of central tendencies and dispersions.   · Algebra: Fundamental operations in algebra, expansions, factorization, simultaneous linear /quadratic equations, indices, logarithms, arithmetic, geometric and harmonic progressions, determinants and matrices.   · Coordinate Geometry: Rectangular Cartesian coordinates, distance formulae, equation of a line, and intersection of lines, pair of straight lines, equations of a circle, parabola, ellipse and hyperbola.   · Calculus: Limit of functions, continuous function, differentiation of function, tangents and normals, simple examples of maxima and minima. Integration of functions by parts, by substitution and by partia...

  GENERAL ENGLISH: (10 QUESTIONS) Questions in this section will be designed to test the candidates’ general understanding of the English language. There will be questions on the following topics: Comprehension, vocabulary, Basic English Grammar (like usage of correct forms of verbs, prepositions and articles), word power, synonyms and antonyms, meaning of words and phrases, technical writing.

COMPUTER AWARENESS : (20 QUESTIONS )   · Computer Basics: Organization of a computer, Central Processing Unit (CPU), structure of instructions in CPU, input/output devices, computer memory, and back-up devices.   · Data Representation: Representation of characters, integers and fractions, binary and hexadecimal representations, binary arithmetic: addition, subtraction, multiplication, division, simple arithmetic and two’s complement arithmetic, floating point representation of numbers, Boolean algebra, truth tables, Venn diagrams If you want to study with me or want to learn computer awareness for your NIMCET preparation. Just visit my Youtube channel: Vikatu

 Binary search is a searching algorithm used to find the position of a target value within a sorted array. Here's how it works: Start by setting the lower bound low to 0 and the upper bound high to the length of the array minus 1. Calculate the middle index mid as the average of low and high, rounded down to the nearest integer. Compare the target value with the value at the middle index in the array: If they're equal, the target value has been found. Return the middle index. If the target value is less than the middle value, set high to mid - 1 and repeat step 2. If the target value is greater than the middle value, set low to mid + 1 and repeat step 2. If the target value is not found after iterating through the array, return -1 to indicate that the value was not found. Here's the pseudocode for this algorithm: function binarySearch(array, target): low = 0 high = array.length - 1 while low <= high: mid = floor((low + high) / 2) if array[mid...

 write an algorithm to insert a node in the linked list? Start by creating a new node with the given data value. Check if the linked list is empty, and if so, make the new node the head of the list. If the linked list is not empty, traverse the list to find the position where you want to insert the new node. You can do this by starting at the head of the list and iterating through each node until you reach the desired position or the end of the list. Once you've found the position to insert the new node, adjust the pointers of the nodes accordingly: Set the new node's next pointer to the node currently at the desired position. If the desired position is not the head of the list, set the next pointer of the previous node to the new node. If the desired position is the head of the list, make the new node the new head of the list. Return the updated linked list. Here's the pseudocode for this algorithm: function insertNode(head, data, position): newNode = Node(data) // Cr...