CS301 / CS301P paper conceptual tha aur mostly handouts se aya. Important topics: Binary Search Tree, AVL Tree, Rotations Union types, Huffman Encoding Infix & Postfix, Relations Heap (Min & Max), Hashing Sorting (Selection, Insertion, Bubble) Queue Programming part: Sorting ke programs diye hote hain, half code hota hai jo complete karna hota hai. prepration : 2 cs301 kee videos hain VU talk kee wo dekh lein lakin uss ma kuch topic missing ha jis k lea aap kst learing kee videos dekh skty ho aur lab 4 sa onward jitny b hain sab dekh k jyain practicle ka paper b easily ho jya ga