HamroCSIT Logo
HAMRO CSIT
  • Semester
    • First Semester
    • Second Semester
    • Third Semester
    • Fourth Semester
    • Fifth Semester
    • Sixth Semester
    • Seventh Semester
    • Eight Semester
  • Questions
  • Entrance
    • Preparation
    • MCQ Questions
    • Discussion
    • Start Discussion
    • Colleges
  • Subscription New
  • Notices
  • Articles
  • Help
    • Ask Question
    • Application (2.9.1)
    • About Points
    • Contribute
    • Contact Us
Login Register
Hamro CSIT User Account
  • Sign In
  • Create Account
Shape | Hamro CSIT Shape | Hamro CSIT Shape | Hamro CSIT Shape | Hamro CSIT
Subject

Data Structure and Algorithm

This course includes the basic foundations in of data structures and algorithms. This course covers concepts of various data structures like stack, queue, list, tree and graph. Additionally, the course includes idea of sorting and searching.

Subject Image | Hamro CSIT
  • Chapters
  • Syllabus
  • Question Banks
  • Questions
  • Text Book
  • Practical
  • Viva
Introduction

1.1 Data types, Data structure and Abstract date type 1.2 Dynamic memory allocation in C 1.3 Introduction to Algorithms 1.4 Asymptotic notations and common functions

1.1 Data types, Data structure and Abstract date type 1.2 Dynamic memory allocation in C 1.3 Introduction to Algorithms 1.4 Asymptotic notations and common functions

4066+ Students

Questions : 8+

Read Note
Stack

2.1 Basic Concept of Stack, Stack as an ADT, Stack Operations, Stack Applications 2.2 Conversion from infix to postfix/prefix expression, Evaluation of postfix/ prefix expressions

2.1 Basic Concept of Stack, Stack as an ADT, Stack Operations, Stack Applications 2.2 Conversion from infix to postfix/prefix expression, Evaluation of postfix/ prefix expressions

3583+ Students

Questions : 11+

Read Note
Queue

3.1 Basic Concept of Queue, Queue as an ADT, Primitive Operations in Queue 3.2 Linear Queue, Circular Queue, Priority Queue, Queue Applications

3.1 Basic Concept of Queue, Queue as an ADT, Primitive Operations in Queue 3.2 Linear Queue, Circular Queue, Priority Queue, Queue Applications

2971+ Students

Questions : 8+

Read Note
Recursion

4.1 Principle of Recursion, Comparison between Recursion and Iteration, Tail Recursion 4.2 Factorial, Fibonacci Sequence, GCD, Tower of Hanoi(TOH) 4.3 Applications and Effi. . .

4.1 Principle of Recursion, Comparison between Recursion and Iteration, Tail Recursion 4.2 Factorial, Fibonacci Sequence, GCD, Tower of Hanoi(TOH) 4.3 Applications and Efficiency of Recursion

2389+ Students

Questions : 8+

Read Note
Lists

5.1 Basic Concept, List and ADT, Array Implementation of Lists, Linked List 5.2 Types of Linked List: Singly Linked List, Doubly Linked List, Circular Linked List. 5.3 Basi. . .

5.1 Basic Concept, List and ADT, Array Implementation of Lists, Linked List 5.2 Types of Linked List: Singly Linked List, Doubly Linked List, Circular Linked List. 5.3 Basic operations in Linked List: Node Creation, Node Insertion and Deletion from Beginning, End and Specified Position 5.4 Stack and Queue as Linked List

2955+ Students

Questions : 10+

Read Note
Sorting

6.1 Introduction and Types of sorting: Internal and External sort 6.2 Comparison Sorting Algorithms: Bubble, Selection and Insertion Sort, Shell Sort 6.3 Divide and Conquer. . .

6.1 Introduction and Types of sorting: Internal and External sort 6.2 Comparison Sorting Algorithms: Bubble, Selection and Insertion Sort, Shell Sort 6.3 Divide and Conquer Sorting: Merge, Quick and Heap Sort 6.4 Efficiency of Sorting Algorithms

2676+ Students

Questions : 6+

Read Note
Searching and Hashing

7.1 Introduction to Searching, Search Algorithms: Sequential Search, Binary Search 7.2 Efficiency of Search Algorithms 7.3 Hashing : Hash Function and Hash Tables, Collisio. . .

7.1 Introduction to Searching, Search Algorithms: Sequential Search, Binary Search 7.2 Efficiency of Search Algorithms 7.3 Hashing : Hash Function and Hash Tables, Collision Resolution Techniques

2476+ Students

Questions : 10+

Read Note
Trees and Graphs

8.1 Concept and Definitions, Basic Operations in Binary Tree, Tree Height, Level and Depth 8.2 Binary Search Tree, Insertion, Deletion, Traversals, Search in BST 8.3 AVL tr. . .

8.1 Concept and Definitions, Basic Operations in Binary Tree, Tree Height, Level and Depth 8.2 Binary Search Tree, Insertion, Deletion, Traversals, Search in BST 8.3 AVL tree and Balancing algorithm, Applications of Trees 8.4 Definition and Representation of Graphs, Graph Traversal, Minimum Spanning Trees: Kruskal and Prims Algorithm 8.5 Shortest Path Algorithms: Dijksrtra Algorithm

2991+ Students

Questions : 12+

Read Note
Share

Share this link via

Or copy link

logoHAMROCSIT

Hamro CSIT is a Web and Mobile application that provides a complete set of reference materials like notes, syllabus, question banks, solutions, and many more for B. Sc. CSIT students.

  • [email protected]
Semester
  • First Semester
  • Second Semester
  • Third Semester
  • Fourth Semester
  • Fifth Semester
  • Sixth Semester
Links
  • About CSIT
  • About US
  • About Points
  • Sitemap
  • Privacy Policy
  • Terms and Conditions
Hits Counter
5386096
Google Play App Store
Follow Us

Copyright 2023 | HAMROCSIT | All Right Reserved | Powered by Code Help Pro

HAMROCSIT.COM

Copyright 2022 | HAMROCSIT.COM | All Right Reserved