Welcome to www.programmer2programmer.net tips for SMU Question Paper for BT0065

programmer2programmer.net

 Tips
 Microsoft Certification
 Final Year Project Idea
 Connection Strings
 Password Recovery
 SQL Injection
 Encryption & Decryption
  
 LIVE Academic Project
 Project #1 - VB6, Access
  Project #2 - VB.Net, SQL
 Project #3 - ASP, Access
 Project #4 - ASP.NET, C#
 Project #5 - VB6, SQL
 Project #6 - Stegano
 Project #7 - C
 Project #8 - C++
 Project #9 - JAVA, MySQL
 Project #10- PHP, MySQL
 Project #11- JSP, Oracle
 Project #12- C# Face Exp
 Project #13- Mobile Bank
 Download MBA Project
 MBA Project Topic
 Project Viva Question
  2017 New Projects
 Project Synopsis Download
  
 University Question Paper, Assignment and Projects
 SMU - Question Paper
 SMU - Assignment
 SMU - Synopsis Projects
 SCDL - Assignment
 IGNOU - Synopsis Projects
 Welingkar - Projects
 Project Report Formats
  
 Interview Question Answer
 General & HR Round
 Visual Basic 6
 VB.Net & C#
 ASP.Net
 SQL Server
  Oracle and DBA
 My SQL
  

100% Tested
Ready Academic IT Projects

BE, ME, BTech, BCA, MCA, MBA, Bsc-IT, MS, BIT, ADIT, DOEACC, IGNOU, SMU
readymadeproject.com

Free download of Sikkim Manipal University, SMU previous year, last year, sample question paper for  : [C Programming and Data Structures – Theory ] BT0065 . Find question and answer for Part-A 2 marks, Part-B 4 Marks and Part-C 8 marks. Free download of question paper of previous year test.   C Programming and Data Structures – Theory , BT0065 question paper includes multiple choice options and answer also.

Home Personal Member Forum Source Project Tips Contact
 

   SMU >> BSc IT >> BT0065

   C Programming and Data Structures – Theory

This is the collection of Sikkim Manipal University (SMU) question paper for BSc IT - C Programming and Data Structures – Theory . It will help you to prepare your examination. All questions are classified as per question type like PART - A of 2 marks, PART - B of 4 marks and PART - C of 8 marks same as actual examination. SMU question paper set which includes year 2017, 2016, 2015 SMU question papers of C Programming and Data Structures – Theory are updated regularly and it is absolutely free to use. SMU Question paper includes multiple choice question and answer as same as real and original examination. It will help you to study and prepare for your final SMU examination.

Sikkim Manipal University
SMU Question Paper
Latest and Updated
FREE to Download
  1. BCA
  2. MCA
  3. BSc IT
  4. MSc IT
  5. MBA


   Get SMU Assignment   



Course Name
        BSc IT (Bachelor of Science in Information Technology)

Subject Code      
BT0065 (C Programming and Data Structures – Theory )

Get Questions        PART - A    PART - B    PART - C


C Programming and Data Structures – Theory Syllabus.

Unit 1: Introduction to C Language
Historical Development of C language; Character Sets; Variables; Keywords; Data Types Constants; Operators and Expressions.

Unit 2: Algorithms & Flowcharts
Definition of Algorithm; Examples of Algorithms; Definition of Flowchart; Example of Flowcharts.

Unit 3: Introduction to Programming
Structure of C Program; Compilation and Execution of a C Program; Decision Making and Branching Statements; Break Statement; Continue Statement; Switch Statement; Goto Statement; Iterative Statements.

Unit 4: Arrays
Formatted Output; Type Casting; Arrays; Language C Preprocessor; Macro Expansion; File Inclusion. Storage Class.

Unit 5: Functions
Functions; User Defined Functions; Library Functions. Recursion.

Unit 6: Structures; Unions & Pointers
Structures; Array of Structures; Union; Defining Union Types; Initializing Unions. Pointers; Dynamic Allocation of Memory; De allocation of Memory.

Unit 7: File Structures
Block Structure; Opening; Accessing and Closing Files; File Pointer; File Open Modes; File Open Functions; File Read & Write Functions; File Close Functions.

Unit 8: Overview of Data Structure
Example of Data Structure; Abstract Data Types (ADT); Levels of Data Structure; Type of Data Structure; Application of Data Structure.

Unit 9: Stack and Queues
Operations on Stack; Push operation ;Pop operation ;Display Items of a Stack ;Stack Implementation; Stack Implementation using arrays; Stack Implementation using structures. Applications of Stack. Polish Notation; Infix to Postfix Conversion; Postfix Evaluation; Operations on Queue; Different types of Queues; Ordinary Queue; Disadvantage of Ordinary Queue; Double Ended Queue (Dqueue); Circular Queue; Priority Queue; Applications of Queues.

Unit 10: Linked Lists
Type of Linked Lists; Singly Linked List; Circular Linked List; Doubly Linked Lists; Application of Linked List.

Unit 11: Trees and Their Applications
Tree Terminologies; Binary Tree; Balanced Tree (B Tree); AVL Tree; Application of Trees

Unit 12: Graphs and Their Applications
Graph Terminologies; Graph Representation; Adjacency Lists; Adjacency Matrix; Graph Traversal; Depth First Traversal; Breadth First Traversal. Spanning Trees; Kruskal’s Algorithm; Prim’s Algorithm.

Unit 13: Searching and Sorting
Basic Searching Techniques: Sequential Search/Linear search, Binary Search; Overview of Sorting Methods: Internal Sorting, Selection Sort, Bubble Sort ,Insertion Sort, Quick Sort, Heap Sort, Shell Sort, Radix Sort, External Sorts, Merge Sort.

  Get Questions        PART - A    PART - B    PART - C



 Click here to get more question paper of MCA, BCA, BSC IT, MSC IT, MBA of SMU

(C) Atanu Maity, 2006-2017