Queue_Practice Questions

Duration: 2 min

This video lesson is available to enrolled students.

Return to /learn/COGNIZANT-PREPARATION/data-structures/queue/basics-stack-mix/asset-queue-practice-questions-4540 after enrolling

Inside: a video lesson and guided study material.

Module outline

  1. Communication Round: Vocabulary, Subject Verb Agreement (Verb Noun Agreement), Tenses, Comprehension / Reading Comprehension / Unseen Passages (Critical Reasoning) (Paragraph Questions), Cloze Test (Cloze Passage), Sentence Correction (Error Correction), Sentence Completion (Fill in the blanks), Sentence Re-arrangements (Para Jumbles) (Narrative Sequencing), Direct and Indirect Speech, Active Passive Voice (Voice), Verbal Analogy (Word Based Analogy), Articles, Preposition, Conjunction, Sentence Construction, English Writing Ability, Communication Assessment
  2. Quantitative Aptitude: Ratio and Proportion (Ratios), Divisibility Rules, Data Interpretation, Mixture and Alligation, Permutation and Combination, Logarithm, Number System, HCF LCM, Speed Time and Distance, Percentage, Average, Powers and Exponents (Surds and Indices), Time and Work, Mensuration and Geometry, Age Problems, Pipe and Cistern, Probability, Profit and Loss, Simple Interest and Compound Interest, Algebra
  3. Analytical and Logical Reasoning: Series (Number and Letter Series) (Numerical Relations and Reasoning), Coding Decoding, Data Sufficiency, Non Verbal Reasoning (Spatial Aptitude) (Spatial Reasoning) (Visual Reasoning), Directions (Direction Test), Ranking, Order and Sequence, Deductive and Inductive Reasoning (Logical Deduction and Induction) (Prepositional Reasoning), Selection Decision Table (Decision Making), Logical Sequence Of Words, Puzzle Solving (Puzzles), Syllogisms, Seating Arrangements, Calendar, Clock, Blood Relations, Cubes & Dices, Venn Diagram, Analytical Reasoning (Counting Figures Reasoning)
  4. Cognizant Gaming Aptitude: Gamified / Game Based Aptitude
  5. Java (Cluster 1): Java
  6. ANSI SQL MySQL (Cluster 1,2,3): SQL
  7. HTML, CSS, JavaScript (Cluster 1,3): HTML, CSS, JavaScript
  8. Python (Cluster 2): Python for Placements by Yash Sir
  9. Cloud Fundamentals (Cluster 2): Emerging Tech Trends
  10. C# (Cluster 3): C#
  11. OOPs: Object Oriented Programming (OOPS)
  12. Technical Assessment (Coding): Coding Questions by Yash Sir, C Programming by Yash Sir, Programming in C++, Pseudo Codes
  13. Data Structures: Introduction to DS, Array, Stack, Queue, Linked List, Tree, Graphs, Hashing
  14. DBMS: 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
  15. Operating Systems: 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
  16. Computer Networks: 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, Mobile Technology, Cloud Computing and IoT, Cyber and Info Security
AI summary & chapters

AI Summary

An AI-generated summary of this video lecture.

The video presents a C-like pseudo-code function `fun` that accepts a pointer to a Queue `Q` and utilizes a Stack `S` for processing. The instructor explains the logic by tracing the execution flow step-by-step. Initially, an empty stack `S` is created. The first `while` loop runs as long as the queue `Q` is not empty. Inside this loop, an item is dequeued from `Q` and immediately pushed onto the stack `S`. This process continues until the queue is empty, effectively transferring all elements from the queue to the stack. Since a stack follows the Last-In-First-Out (LIFO) principle, the last element dequeued from the queue ends up at the top of the stack, while the first element dequeued ends up at the bottom.

Chapters

  1. 0:00 – 1:32 00:00-01:32

    The instructor begins by introducing the pseudo-code on the screen, highlighting the function signature `void fun(Queue *Q)`. He then sets up a concrete example with a queue containing elements 'a', 'b', 'c', 'd' in that order. He visually demonstrates the first loop, drawing arrows from the queue to the stack. As 'a' is dequeued, it is pushed onto the stack. Then 'b', 'c', and 'd' follow. The stack now contains 'a' at the bottom and 'd' at the top. He then moves to the second `while` loop, which runs while the stack `S` is not empty. Inside this loop, an item is popped from the stack and enqueued back into `Q`. He traces this: 'd' is popped and enqueued first, followed by 'c', 'b', and 'a'. The final state of the queue is shown as 'd', 'c', 'b', 'a'. He concludes that the function reverses the order of elements in the queue. Finally, he points to option (D) "Reverses the Q" as the correct answer.

The lecture effectively demonstrates how a stack can be used to reverse a queue. By dequeuing all elements into a stack and then popping them back into the queue, the order is inverted due to the LIFO property of the stack. This is a classic algorithmic pattern for reversing data structures. The instructor uses visual aids like red arrows and handwritten notes to clarify the flow of data between the two data structures.

Loading lesson…