C PGM & DATA STRUCTURE N SCHEME Q BANK
AND FULL 6 YEARS BOARD EXAM QUESTION BANK 👇👇👇👇👇
C PROGRAMMING BOOK 👇👇👇
DATA STRUCTURE USING C BOOK 👇👇👇
*C Programming and Data Structures*
*UNIT-I*
_*3MARKS*_
>> Character set
>> Tokens
>> Constants
>> Keywords
>> Datatype
>> Execution of c program
>> Diagrammatic representation of program execution process
*_BIG QUESTIONS_*
>> C operators
>> Structure of C program
>> Formatted input and output statements
*UNIT-II*
_*3MARKS*_
>> Function call
>> Recursion
>> Difference between while and do...while
>> Built in functions
>> 1D representation
>> 2D representation
>> String functions
*_BIG QUESTIONS_*
>> Decesion making statement
>> Looping statement
>> One dimensional(1D) array
>> Two dimensional(2D) array
>> String and string handling functions
*UNIT-III*
*_3MARKS_*
>> malloc(), calloc(), realloc(), free()
>> Define Structure, Union, Pointers
>> Use of pointer
*BIG QUESTIONS*
>> Explain in detail about Structure
>> Explain in detail about Pointers
>> Explain in detail about Union
*UNIT-IV*
*_3MARKS_*
>> Data structure
>> Types of data structure
>> Conversion of infix to postfix expression
>> Stack definition and operation
>> Queue definition and operation
*_BIG QUESTIONS_*
>> Explain in detail about Stack and its operations
>> Explain in detail about Queue and its operations
>> Data structure and its operations
>> Approaches to design an algorithm
*UNIT-V*
*_3MARKS_*
>> Node
>> Null pointer
>> Difference between linked & sequential list
>> Advantage & disadvantage of linked list
>> Degree of node
>> Degree of a tree
>> Depth/height of a tree
>> In & out degree
>> Sorting and its types
*_BIG QUESTIONS_*
>> Linked list (singly, doubly, circularly)
>> Bubble sort
>> Quick sort
>> Linear search
>> Binary search
C Programing important questions
Unit-1
1. Structure of c and various operator's in c
2. Program development cycle and formatted and un formatted I/O function
3.Execution of c program with diagrammatic representation and flow chart symbols
4. Program of factorial and sum and average of n number
Unit-2
1. For statement , switch statement and 1D , 2D array processing
2.Program find minimum number and function power ( a,b)
3. Different types of if statement and program to read n number of elements
4.Recursion and string handling function
Unit-3
1. Structure and within structure.
2.Dynamic memory allocation and pointers declared , initialized
3. various I/O operator's
4. Arg c and arg v argument's
Unit-4
1.Demonstrate malloc () and free() and different approach for designing algorithm
2. Different data structure operators and application of stack
3.Circular queue and dequeue
4. Conversation of infix to postfix expression
Unit-5
1.Five basic terminologies of tree
2.Bubble sort and program and Binary search
3. Depth height of tree , in degree and out degree and siblings
4. Linked and sequential list and its advantage and disadvantages
Comments
Post a Comment