Reverse Coding

Duration: 5 min

This video lesson is available to enrolled students.

Return to /learn/AMCAT-PREPARATION/codingautomata-round/coding-questions/coding-question/asset-reverse-coding after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Quantitative Ability: Percentage, Profit and Loss, Ratio and Proportion (Ratios), Average, Time and Work, Speed Time and Distance, Simple Interest and Compound Interest, Age Problems, Number System, Divisibility Rules, HCF LCM, Algebra, Permutation and Combination, Probability, Data Interpretation, Logarithm, Sequence and Series (Series), Powers and Exponents (Surds and Indices), Speed Mathematics and Basic Mathematics
  2. Logical Reasoning: Seating Arrangements, Puzzle Solving (Puzzles), Data Arrangement, Coding Decoding, Blood Relations, Directions (Direction Test), Ranking, Order and Sequence, Data Sufficiency, Venn Diagram, Inequality, Series (Number and Letter Series) (Numerical Relations and Reasoning), Logical Sequence Of Words, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Analogy, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning)
  3. Verbal Ability: Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Subject Verb Agreement (Verb Noun Agreement), Tenses, Articles, Preposition, Conjunction, Modals, Active Passive Voice (Voice), Direct and Indirect Speech, Vocabulary, Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Sentence Completion (Fill in the blanks), Sentence Correction (Error Correction), Cloze Test (Cloze Passage), Facts, Inference and Judgements
  4. Programming Fundamentals (Technical): C Fundamentals
  5. Data Structures (Technical): Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  6. Algorithms (Technical): Algorithm Analysis, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Minimum Spanning Trees, Shortest Path Algos, Time Complexity Analysis, Advanced Algorithms
  7. OOPs (Technical): Object Oriented Programming (OOPS)
  8. DBMS (Technical): Basics of DBMS, ER Diagram, Relational Model & Functional Dependencies, Keys & Integrity Constraints, Normalization (1NF - BCNF), Decomposition Properties & 4NF, File Organization & Indexing, Relational Algebra, Relational Calculus, Transaction Management, Concurrency Control, Database Recovery, ORDBMS, Database Security & Authorization, Query Processing & Optimization, Enhanced Data Models, Data Warehousing & Mining, Big Data Systems, NoSQL
  9. SQL (Technical): SQL
  10. Operating Systems (Technical): Introduction to OS, Process Management, CPU Scheduling, Process Synchronization, Deadlock, Threads & Process Creation, Memory Management, Virtual Memory, Disc Scheduling, File Management, Windows OS, Linux OS, Security, Distributed Systems, Virtual Machines
  11. Computer Networks (Technical): Introduction to CN, Data Communication, DLL: Access Control, DLL: Flow Control, DLL: Error Control, DLL: Framing, Data Link Layer - Ethernet, Net Layer: IPv4 & Proto, Net Layer: IP Addressing, Net Layer:Routing Protocol, Transport Layer Services, TL: Congestion & UDP, Application Layer, Hardware basics, Network Security, Cloud Computing and IoT, Cyber and Info Security
  12. Software Engineering (Technical): Fundamentals of Software Engineering, Software Requirements and Quality Assurance, Software Design, Estimation and Metrics, Software Testing, Software Maintenance and Configuration Management
  13. Coding/Automata Round: Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Java, Python for Placements by Yash Sir, Pseudo Codes
  14. Personality / Behavioral Assessment: Behavioral Assessment (Behavioral Competency Profiling) (Psychometric Test)
  15. Writing Assessment: English Writing Ability
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

This video is a tutorial on 'Reverse Coding' for programming interviews, presented by a 'Placement Expert' from Knowledge Gate. The lesson begins by presenting a problem: identifying a pattern between a set of input numbers and their corresponding outputs. The instructor analyzes the given data, which includes inputs like 10, 15, 23, 99, and 107, and their outputs 5, 8, 12, 50, and 54. He systematically deduces the pattern by first observing that the output is half of the input for even numbers (e.g., 10/2=5) and half of the input plus one for odd numbers (e.g., (15+1)/2=8). This leads to the formula (n+1)/2 for odd numbers and n/2 for even numbers. The instructor then demonstrates how to implement this logic in C code, writing a function `target` that uses a loop to sum the results of `i%2` for all integers from 1 to n, which effectively calculates the number of odd numbers in that range. The final code snippet shows the complete program, including the `main` function that reads an input and prints the result of the `target` function.

Chapters

  1. 0:00 – 2:00 00:00-02:00

    The video opens with the 'Knowledge Gate' logo, followed by a slide that introduces the topic 'Reverse Coding'. The slide displays a table with 'Input' and 'Output' columns, showing a series of number pairs: (10, 5), (15, 8), (23, 12), (99, 50), and (107, 54). The instructor, identified as a 'Placement Expert', begins to analyze this data to identify a pattern. He starts by examining the first pair, 10 and 5, and begins to write on the screen, drawing a red line to connect the input to the output, setting up the problem for the audience.

  2. 2:00 – 4:47 02:00-04:47

    The instructor continues to analyze the pattern. He writes 'Even/Odd' on the screen and then demonstrates the logic for the first two examples. For input 10, he writes '10/2 = 5'. For input 15, he writes '15+1 = 16, 16/2 = 8'. He then generalizes this to the formula (n+1)/2 for odd numbers and n/2 for even numbers. He explains that the output is the count of odd numbers from 1 to n. He then transitions to coding, writing a C program. The code includes a function `target` that initializes a variable `ans` to 0, then uses a for loop from 1 to n, adding `i%2` to `ans` in each iteration. He explains that `i%2` is 1 for odd numbers and 0 for even numbers, so the sum is the count of odd numbers. The final code shows the `main` function that reads an integer `n` and prints the result of `target(n)`. The video ends with the complete code on screen.

The video presents a structured approach to solving a common programming interview problem. It starts with a data-driven analysis, where the instructor uses a table of inputs and outputs to deduce a mathematical pattern. The key insight is recognizing the difference between even and odd numbers and formulating a conditional logic. This logical solution is then translated into a practical programming implementation. The final C code cleverly uses the modulo operator to count odd numbers, demonstrating a direct and efficient way to solve the problem. The lesson effectively connects abstract pattern recognition with concrete coding, which is a fundamental skill for technical interviews.

Loading lesson…