My Courses
Become a data analyst in the next 4 months and kickstart your career.
100% placement assistance.
Start your Analytics journey with our free
Python course.
Explore Now
Home
Universities
Veer Surendra Sai University of Technology, Odisha
Computer Engineering
C & Data Structure
Veer Surendra Sai University of Technology, Odisha, Computer Engineering Semester 1, C & Data Structure Syllabus
C & Data Structure Lecture notes
|
Videos
|
Free pdf Download
|
Previous years solved question papers
|
MCQs
|
Question Banks
|
Syllabus
Get access to 100s of MCQs, Question banks, notes and videos as per your syllabus.
Try Now for free
Unit - 1 C Language Fundamentals, Arrays and Strings
Unit 1
C Language Fundamentals Arrays And Strings
1.1 C Language Fundamentals Arrays and Strings
1.2 Character set
1.3 Identifiers
1.4 Keywords
1.5 In programming language keywords are reserved word and performs specific task.
1.6 The keyword cannot used as variable because these are directly referred by compiler and assigning new value to keyword is not allowed.
1.8 Data Types
1.9 Constant and Variables
1.10 Statements
1.11 Expressions
1.12 Operators
1.13 Precedence of operators
1.14 Input – output Assignments
1.15 Control structures Decision making and Branching
1.16 Decision making looping
1.17 Declarations
1.18 Manipulation Stringhandling functions
1.19 Monolithic vs Modular programs
1.20 User defined vs standard functions
1.21 Formal vs Actual arguments
1.22 Functions category
1.23 Function prototypes
1.24 Parameter passing
1.25 Recursion
1.26 Storage Classes Auto Extern Global Static.
Unit - 2 Pointers, Structures, Union & File handling
Unit 2
Pointers Structures Union File Handling
2.1 Pointer variable and its importance
2.2 Pointer Arithmetic
2.3 Passing parameters
2.4 Declaration of structures
2.5 Pointer to pointer
2.6 Pointer to structure
2.7 Pointer to function
2.8 Unions dynamic memory allocations unions
2.9 File management.
Unit - 3 Development of Algorithms
Unit 3
Development Of Algorithms
3.1 Notations and Analysis
3.2 Storage structures for arrayssparse matrices
3.3 Stacks and Queues Representations and applications
3.5 If the token is
Unit - 4 Linked Lists
Unit 4
Linked Lists
4.1 Singly linked lists
4.2 Linked stacks and queues
4.3 Operations on Polynomials
4.4 Doubly linked Lists
4.5 Circularly Linked Lists
4.6 Garbage collection and compaction.
Unit - 5 Binary Trees
Unit 5
Binary Trees
5.1 Binary Search Trees
5.2 General Trees
5.3 Tree Traversing
5.4 Operations on Binary Trees
5.5 Symbol Table construction
5.6 Height Balanced Trees.
Unit - 6 Graphs
Unit 6
Graphs
6.1 Representation of Graphs
6.2 Path Matrix
6.3 BFS DFS – Shortest path problems.
Download CSE Sem 1 syllabus pdf
Get access to 100s of MCQs, Question banks, notes and videos as per your syllabus.
Try Now for free
Other Subjects of Semester-1
Mathematics-i
Basic electronics
English for communication
Basic electrical engineering
Popular posts
Top 10 free online resources to learn coding
What is machine learning
What is cloud computing
What is DBMS architecture
Sorting algorithm overview
Share
Link Copied
More than
1 Million
students use Goseeko! Join them to feel the power of smart learning.
Try For Free
Spot anything incorrect?
Contact us