BHARATHIDASAN ENGINEERING COLLEGE Nattarampalli CS6202/IT PROGRAMMING & DATA STRUCTURES-I C PROGRAMMING FUNDAMENTALS- A REVIEW.

Similar documents
DATA STRUCTURES USING C

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING LESSON PLAN

10CS35: Data Structures Using C

PES Institute of Technology-BSC QUESTION BANK

Krishna Institute of Engineering & Technology, Ghaziabad Department of Computer Application MCA-213 : DATA STRUCTURES USING C

KITES TECHNOLOGY COURSE MODULE (C, C++, DS)

Data Structure [Question Bank]

1) The postfix expression for the infix expression A+B*(C+D)/F+D*E is ABCD+*F/DE*++

BCS2B02: OOP Concepts and Data Structures Using C++

The C Programming Language course syllabus associate level

Analysis of a Search Algorithm

Questions 1 through 25 are worth 2 points each. Choose one best answer for each.

Data Structures. Level 6 C Module Descriptor

Unit Write iterative and recursive C functions to find the greatest common divisor of two integers. [6]

GUJARAT TECHNOLOGICAL UNIVERSITY, AHMEDABAD, GUJARAT. Course Curriculum. DATA STRUCTURES (Code: )

1. The memory address of the first element of an array is called A. floor address B. foundation addressc. first address D.

PART-A Questions. 2. How does an enumerated statement differ from a typedef statement?

GUJARAT TECHNOLOGICAL UNIVERSITY, AHMEDABAD, GUJARAT COURSE CURRICULUM. Course Title: Advanced Computer Programming (Code: )

Java Software Structures

Sample Questions Csci 1112 A. Bellaachia

Curriculum Map. Discipline: Computer Science Course: C++

BSc (Hons) Business Information Systems, BSc (Hons) Computer Science with Network Security. & BSc. (Hons.) Software Engineering

Data Structures Using C++ 2E. Chapter 5 Linked Lists

UNIVERSITY OF MUMBAI. Revised syllabus for F.Y.BSc. Computer Science to be implemented. from

Bangalore University B.Sc Computer Science Syllabus ( Semester System)

C++ Programming Language

Quiz 4 Solutions EECS 211: FUNDAMENTALS OF COMPUTER PROGRAMMING II. 1 Q u i z 4 S o l u t i o n s

Abstract Data Type. EECS 281: Data Structures and Algorithms. The Foundation: Data Structures and Abstract Data Types

Syllabus for Computer Science. Proposed scheme for B.Sc Programme under Choice Based Credit System

AP Computer Science AB Syllabus 1

Linked Lists, Stacks, Queues, Deques. It s time for a chainge!

5. A full binary tree with n leaves contains [A] n nodes. [B] log n 2 nodes. [C] 2n 1 nodes. [D] n 2 nodes.

AP Computer Science Java Mr. Clausen Program 9A, 9B

Symbol Tables. Introduction

Common Data Structures

CompuScholar, Inc. Alignment to Utah's Computer Programming II Standards

INTERNATIONAL JOURNAL OF PURE AND APPLIED RESEARCH IN ENGINEERING AND TECHNOLOGY

Introduction to Programming System Design. CSCI 455x (4 Units)

Module 816. File Management in C. M. Campbell 1993 Deakin University

CSE 326, Data Structures. Sample Final Exam. Problem Max Points Score 1 14 (2x7) 2 18 (3x6) Total 92.

CmpSci 187: Programming with Data Structures Spring 2015

Chapter 8: Bags and Sets

MAX = 5 Current = 0 'This will declare an array with 5 elements. Inserting a Value onto the Stack (Push)

Object Oriented Programming With C++(10CS36) Question Bank. UNIT 1: Introduction to C++

Lecture 11 Doubly Linked Lists & Array of Linked Lists. Doubly Linked Lists

Review of Hashing: Integer Keys

2) What is the structure of an organization? Explain how IT support at different organizational levels.

Module 2 Stacks and Queues: Abstract Data Types

ECE 250 Data Structures and Algorithms MIDTERM EXAMINATION /5:15-6:45 REC-200, EVI-350, RCH-106, HH-139

Lecture 2: Data Structures Steven Skiena. skiena

Basic Programming and PC Skills: Basic Programming and PC Skills:

Data Structures and Data Manipulation

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING Question Bank Subject Name: EC Microprocessor & Microcontroller Year/Sem : II/IV

C++ INTERVIEW QUESTIONS

Objected oriented Programming: C++ Unit 1 1. Introduction 1.1. Introduction to Object Oriented Programming C++ fundamentals.

Universidad Carlos III de Madrid

Queues Outline and Required Reading: Queues ( 4.2 except 4.2.4) COSC 2011, Fall 2003, Section A Instructor: N. Vlajic

Embedded Programming in C/C++: Lesson-1: Programming Elements and Programming in C

To My Parents -Laxmi and Modaiah. To My Family Members. To My Friends. To IIT Bombay. To All Hard Workers

1. Define: (a) Variable, (b) Constant, (c) Type, (d) Enumerated Type, (e) Identifier.

COMPUTER SCIENCE (5651) Test at a Glance

1. Relational database accesses data in a sequential form. (Figures 7.1, 7.2)

Assessment Plan for CS and CIS Degree Programs Computer Science Dept. Texas A&M University - Commerce

QUEUES. Primitive Queue operations. enqueue (q, x): inserts item x at the rear of the queue q

STACKS,QUEUES, AND LINKED LISTS

Exam study sheet for CS2711. List of topics

Introduction to Data Structures and Algorithms

22c:31 Algorithms. Ch3: Data Structures. Hantao Zhang Computer Science Department

A TOOL FOR DATA STRUCTURE VISUALIZATION AND USER-DEFINED ALGORITHM ANIMATION

C Interview Questions

Data Structures and Algorithm Analysis (CSC317) Intro/Review of Data Structures Focus on dynamic sets

Algorithms and Data Structures

\Mankinds's progress is measured by the number of. Elementary data structures such as stacks, queues,

Data Structure and Algorithm I Midterm Examination 120 points Time: 9:10am-12:10pm (180 minutes), Friday, November 12, 2010

Glossary of Object Oriented Terms

Tutorial on C Language Programming

Lab Manual. Data Structures (Pr): COT-213 Data Structures (P): IT-215

Atmiya Infotech Pvt. Ltd. Data Structure. By Ajay Raiyani. Yogidham, Kalawad Road, Rajkot. Ph : ,

ALLIED PAPER : DISCRETE MATHEMATICS (for B.Sc. Computer Technology & B.Sc. Multimedia and Web Technology)

An Introduction to Programming and Computer Science

Facebook Twitter YouTube Google Plus Website

Boolean Expressions, Conditions, Loops, and Enumerations. Precedence Rules (from highest to lowest priority)

COMPUTER SCIENCE. Paper 1 (THEORY)

Bachelor of Games and Virtual Worlds (Programming) Subject and Course Summaries

Stacks. Linear data structures

I PUC - Computer Science. Practical s Syllabus. Contents

G. H. RAISONI COLLEGE OF ENGG NAGPUR-16 Session DEPARTMENT CSE Semester IV SUBJECT DSPD

IMPROVING PERFORMANCE OF RANDOMIZED SIGNATURE SORT USING HASHING AND BITWISE OPERATORS

PROBLEM SOLVING SEVENTH EDITION WALTER SAVITCH UNIVERSITY OF CALIFORNIA, SAN DIEGO CONTRIBUTOR KENRICK MOCK UNIVERSITY OF ALASKA, ANCHORAGE PEARSON

Sequential Data Structures

Illustration 1: Diagram of program function and data flow

ML for the Working Programmer

Copyright 2007 Ramez Elmasri and Shamkant B. Navathe. Slide 13-1

ADTs,, Arrays, Linked Lists

CS104: Data Structures and Object-Oriented Design (Fall 2013) October 24, 2013: Priority Queues Scribes: CS 104 Teaching Team

Lecture 1: Data Storage & Index

Record Storage and Primary File Organization

Chapter 13 Disk Storage, Basic File Structures, and Hashing.

Introduction to Data Structures

Transcription:

BHARATHIDASAN ENGINEERING COLLEGE Nattarampalli 635852 CS6202/IT6202 - PROGRAMMING & DATA STRUCTURES-I UNIT I C PROGRAMMING FUNDAMENTALS- A REVIEW Part - A 1. What is the difference between WHILE and DO WHILE statement? M/JUNE 2016 2. Write the limitations of getchar( ) and sacnf( ) functions for reading strings. 3. Distinguish between Call by value Call by reference. NOV/DEC2014 4. What is the difference between static and auto storage classes? 5. Differentiate break and continue statement. 6. List the types of operators. 7. Compare switch( ) and nestedif statement. APR/MAY 2014 8. Give the syntax for the for loop statement 9. What is the use of sizeof( ) operator? 10. What is a loop control statement? 11. What are global variable in C? 12. Write a program to swap the values of two variables. 13. What is an array? NOV/DEC2014 14. What is a Pointer? How a variable is declared to the pointer? MAY/JUNE 2016 15. What are the function Pointers C? APR/MAY 2015 16. What are * and & operators means? 17. What is meant by C Preprocessor with syntax? APR/MAY 2015 18 What are the main elements of an array declaration? List the header files in C language. 19. What are the pre-processor directives? APR/MAY 2014 20. What is the difference between an array and pointer? 21. What is recursion? Give example. 22. List the characteristics of Arrays. 23. What are the types of Arrays? 24. What is recursion? NOV/DEC 2015 25. What is C functions? Why they are used? 26. Differentiate library functions and User-defined functions. 27. What are the steps in writing a function in a program. APR/MAY 2014. 28. Give the syntax for using user-defined functions in a program. 29. Classify the functions based on arguments and return values. MAY/JUNE 2014 30. Define Macro in C. MAY/JUNE 201

PART B 1. Explain about the various decision making statements in C language. 2. Explain the control statements in c. NOV/DEC 2015 NOV/DEC 2014 3. What are functions? Explain the types of functions in detail with an example program for each type. NOV/DEC 2015 4. Define arrays. Explain the array types with an example program for each type. MAY/JUNE2016 5. What are pointers? When and why they are used? Explain in detail with sample programs. 6. Write a C program to fibbonacci numbers. MAY/JUNE 2014 7. Explain function pointers with example. NOV/DEC 2015 NOV/DEC 2014 8. Detailly explain about function with variable number of arguments.? NOV/DEC 2014 MAY/JUNE 2016 9. Write C program to find all the roots of a quadratic equation? APR/MAY 2015 10. Write a C program using to check if the given input number is palindraome or not. APR/MAY 2015 11. Explain the C pre-processor operators each with a neat example that is used to create macros. APR/MAY 2015 12. Write a C program of two and multi dimensional matrix. NOV/DEC 2015

UNIT II C PROGRAMMING ADVANCED FEATURES Part A 1. Define structure.. 2. What is meant by structure template? 3. Write the syntax for structure declaration and definition Structure 4. Define union. NOV/DEC 2014 5. Write the syntax for union declaration and definition. NOV/DEC 2014 6. How structures are initialized? Give example. 7. What are nested structures? 8. What is meant by array of structures? APR/MAY 2014 9. What is structure assignment? 10. How do you reference a structure member? 11. Differentiate structure and union. NOV/DEC 2015 12. Differentiate structure and arrays. 13. What are the advantages of union over structure? 14. Write the syntax for pointers to structure. NOV/ DEC 2015 15. What are the statement used for a reading file? NOV/DEC 2014 16. Write the syntax for file declaration. 17. What are file modes? 18. Write a C program to single character from a file. MAY/JUNE 2016 19. What is the significance of fclose() function? 20. What is the difference between getc() and getchar()? Explain. APR/MAY 2015 21. Difference between random access and sequential file? NOV/DEC 2016 22. What are the file pointers of stdlib.h? 23. What are the types of files? 24. What are the features of binary files? 25. What are the functions to access files randomly? NOV/DEC 2015

Part B 1. Explain the different modes in which a file can be opened. 2. Explain the functions fscanf, fprintf, fgets, fputs, getw, putw, getc, putc, fread, fwrite, feof, ferror,fseek,ftell,rewind with example. NOV/DEC 2015 3. Explain structures with an example. APR/MAY 2016 4. Explain union with an example? NOV/DEC 2014 5. Discuss about the file handling concepts in C 6. Explain different ways to read data from a file? NOV DEC 2014 7. Explain different ways to write data to a file 8. Design a c program to create the employee database and to perform the manipulations such as adding a record, deleting a record, updating a record. NOV DEC 2014 9. Write a program to read a file and count the number of characters and lines in it. NOV/DEC 2015 10. State the advantages and disadvantages of structures and unions in C programming. APR/MAY 2015 11. Using C programing display the contents of a file screen. APR/MAY 2015 12. Explain in detail about random access file concept with an example. MAY/JUNE 2016

CS6202/IT6202 - PROGRAMMING & DATA STRUCTURES - I Unit III LINEAR DATA STRUCTURES LIST Part A 1. What is a data structure? 2. What is static linked list? write two applications. NOV/DEC 2015 3. Write the syntax of Calloc () and Realloc() and mention application. NOV/DEC 2015 4. How data structures are classified? 5. Differentiate linear and non-linear data structure. 6. Define ADT(Abstract Data Type) APR/MAY 2015/2016 NOV/DEC 2015 NOV/DEC 2014 7. Mention the advantage of ADT. MAY/JUNE 2014 8. Define List ADT 9. What are the ways of implementing linked list? APR/MAY 2014 10. What are the types of linked lists? APR/MAY 2015 11. How the singly linked lists can be represented? 12. How the doubly linked list can be represented? APR/MAY 2015 13. What are benefits of ADT? 14. When singly linked list can be represented as circular linked list? NOV/DEC 2014 15. When doubly linked list can be represented as circular linked list? NOV/DEC 2015 16. List down the applications of List. APR/MAY 2015 17. What are the advantages of linked list? NOV/DEC 2014 18. Mention the demerits of linked list 19. How the polynomial is represented using linked lists? APR/MAY 2015 20. What are the operations performed in list? APR/MAY 2015 21. What are the merits and demerits of array implementation of lists? 22. What is a circular linked list? APR/MAY 2016 23. What is meant by addition two polynomial 24. Write structure of double ended queue APR/MAY 2014 25. List operation List ADT

Part B 1. Explain the various operations of the list ADT with examples,application NOV/DEC 2014 2. Write the program for array implementation of lists 3. Write a C program for linked list implementation of list. APR/MAY 2015 4. Explain the operations of singly linked lists APR/MAY 2014 5. Explain the operations of doubly linked lists NOV/DEC 2015 NOV/DEC 2014 6. Explain the operations of circularly linked lists APR/MAY 2016 7. How polynomial manipulations are performed with lists? Explain the operations and write program.apr/may 2016 Nov/DEC 2014 8. Explain the steps involved in insertion and deletion into an singly and doubly linked list. 9. Explain the operations of circular doubly linked list. APR/MAY 2014 10. Write a function to add two polynomials using linked list. NOV/DEC 2015 11. Write a routine to merge given two sorted linked lists. NOV/ DEC 2015 12. Write a C code for circular link list with create, insert, delete, display operations using structure pointer. APR/MAY 2015

UNIT IV LINEAR DATA STRUCTURES STACKS, QUEUES Part - A 1. Define Stack. NOV/ DEC 2015 2. What are the operations of the stack? 3. Write the routine to push a element into a stack. 4. How the operations performed on linked list implementation of stack? 5. What are the applications of stack? NOV/ DEC 2015 NOV/ DEC 2014 6. What are the methods to implement stack in C? 7. How the stack is implemented by linked list? 8. Write the routine to pop a element from a stack. 9. Define queue. NOV/ DEC 2015 10. What are the operations of a queue? APR/MAY 2015 11. Write the routine to insert a element onto a queue. 12. What are the types of queue? 13. Define double ended queue NOV/ DEC 2014 MAY/JUNE 2014 MAY/JUNE 2016 14. What are the methods to implement queue in C? 15. How the queue is implemented by linked list? APR/MAY 2015 16. Write the routine to delete a element from a queue int del() 17. What are the applications of queue? MAY/JUNE 2014 18. Define circular queue MAY/JUNE 2014 19. What are push and pop operations? 20. What are enqueue and dequeue operations? MAY/JUNE 2014 21. What is meant by push and pop operation. 22. What is TOP element. 23. State front and rear operation. 24. Define tree. 25. Explain pre, In, post expression APR/MAY 2014

Part B 1. Explain Stack ADT and its operations NOV/ DEC 2014 2. Explain array based implementation of stacks 3. Explain linked list implementation of stacks 4. Explain the applications of Stacks NOV/ DEC 2015 5. Explain how to evaluate arithmetic expressions using stacks MAY JUNE 2014 6. Explain queue ADT NOV/ DEC 2014 7. Explain array based implementation of queues APR/MAY 2015 8. Explain linked list implementation of queues MAY/JUNE 2016 9. Explain the applications of queues NOV/ DEC 2015 10. Explain circular queue and its implementation NOV/ DEC 2015 11. Explain double ended queue and its operations NOV/ DEC 2015 MAY/JUNE 2014 12. Discuss any two applications of stack with relevant example. MAY/JUNE 2014

Unit V SORTING, SEARCHING AND HASH TECHNIQUES Part A 1. Define sorting 2. Mention the types of sorting 3. What do you mean by internal and external sorting? APR/MAY 2015 NOV/ DEC 2014 4. Define bubble sort 5. How the insertion sort is done with the array? 6. What are the steps for selection sort? 7. What is meant by shell sort? 8. What are the steps in quick sort? 9. Define radix sort NOV/DEC 2014 10. What are the advantages of insertion sort 11. Define searching NOV/DEC 2015 12. Mention the types of searching 13. What is meant by linear search? APR/MAY 2015 14. What is binary search? APR/MAY 2015 15. Define hashing function MAY/JUNE 2016 16. What is open addressing? 17. What are the collision resolution methods? 18. What is meant by rehashing? NOV/ DEC 2015 19. Define extendible hashing. NOV/ DEC 2014 20. Applications of linear and binary search? APR/MAY 2015 21. What is the time complexity on binary search? MAY/JUNE 2014 22. List sorting algorithm which uses logarithmic time complexity. MAY/JUNE 2014 23. What is the time complexity on insertion sort? MAY/JUNE 2016 24. What is the time complexity on merge sort? 25. What is the time complexity on linear search?

Part B 1. Explain the sorting algorithms 2. Explain the searching algorithms APR/MAY 2015 3. Explain merge sort given examples? 4. Explain open addressing NOV/ DEC 2014 5. Write a C program to sort the elements using bubble sort. 6. Write a C program to perform searching operations using linear and binary search. APR/MAY 2015 7. Explain in detail about separate chaining. NOV/ DEC 2015 8. Explain the rehashing techniques. NOV/ DEC 2014 MAY/JUNE 2016 9. Write a C code to perform binary search. APR/MAY 2015 MAY/JUNE 2016 10. Write code to sort an integer array using shell sort APR/MAY 2015 MAY/JUNE 2016 11. Write short notes on hashing an the various collision resolution techniques. MAY/JUNE 2014 12. Explain quick sort with an example and write routine program.