Official Bihar Engineering University examination question papers, marks distribution, and questions transcript. Available exam sessions: 2025, 2024, 2023, 2022, 2020, 2019.
Open BEU Connect Android app to solve any numerical or derive formulas step by step.
No paper transcript available.
Official BEU curriculum units & topics for this examination subject.
Unit 1.0: Introduction
Basic Terminologies: Elementary Data Organizations • Data Structure Operations: insertion, deletion, traversal etc. • Analysis of an Algorithm • Asymptotic Notations • Time-Space trade off
Unit 2.0: Stacks and Queues
ADT Stack and its operations: Algorithms and their complexity analysis • Applications of Stacks: Expression Conversion and evaluation • Corresponding algorithms and complexity analysis • ADT queue, Types of Queue: Simple Queue, Circular Queue, Priority Queue • Operations on each Type of Queues: Algorithms and their analysis
Unit 3.0: Linked Lists
Singly linked lists: Representation in memory • Algorithms of several operations: Traversing, Searching, Insertion, Deletion • Linked representation of Stack and Queue • Header nodes, doubly linked list: operations and algorithmic analysis • Circular Linked Lists: all operations and complexity analysis
Unit 4.0: Searching, Sorting and Hashing
Linear Search and Binary Search Techniques and complexity analysis • Objective and properties of different sorting algorithms • Selection Sort, Bubble Sort, Insertion Sort, Quick Sort, Merge Sort, Heap Sort • Performance and Comparison among all methods • Hashing
Unit 5.0: Trees
Basic Tree Terminologies • Different types of Trees: Binary Tree, Threaded Binary Tree, Binary Search Tree, AVL Tree • Tree operations and algorithms with complexity analysis • Applications of Binary Trees • B Tree, B+ Tree: definitions, algorithms and analysis