I Year MCA I Semester L T P To C FOUNDATIONS OF INFORMATION TECHNOLOGY

Similar documents
COMPUTER PROGRAMMING LAB

Week 0. Net Salary =Earnings- deductions; Read the employee number, Basic Print employee Number, Earnings,Deductions and Net salary.

R13. II B. Tech I Semester Supplementary Examinations, May/June DATA STRUCTURES (Com. to ECE, CSE, EIE, IT, ECC)

PESIT Bangalore South Campus Department of MCA Course Information for

Programming for Problem Solving 105A L T P Credit Major Minor Total Time

R10 SET - 1. Code No: R II B. Tech I Semester, Supplementary Examinations, May

UNIVERSITY OF ENGINEERING & MANAGEMENT, KOLKATA C ASSIGNMENTS

Lab Manual. Program Design and File Structures (P): IT-219

17CS33:Data Structures Using C QUESTION BANK

VALLIAMMAI ENGINEERING COLLEGE SRM NAGAR, KATTANGULATHUR

Table of Contents. Chapter 1: Introduction to Data Structures... 1

List of Practical for Master in Computer Application (5 Year Integrated) (Through Distance Education)

Gujarat University M. Sc. Computer Science [S. F.] Semester-1 Syllabus Gujarat Arts & Science College, Ahmedabad.

R10 SET - 1. Code No: R II B. Tech I Semester, Supplementary Examinations, May

1 P a g e A r y a n C o l l e g e \ B S c _ I T \ C \

INSTITUTE OF AERONAUTICAL ENGINEERING

DR. A.P.J. ABDUL KALAM TECHNICAL UNIVERSITY LUCKNOW. Evaluation Scheme & Syllabus. For. B.Tech. First Year (Programming for Problem Solving)

MULTIMEDIA COLLEGE JALAN GURNEY KIRI KUALA LUMPUR

Tribhuvan University Institute of Science and Technology Computer Science and Information Technology (CSC. 154) Section A Attempt any Two questions:

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY THIRD SEMESTER B.TECH DEGREE EXAMINATION, JULY 2017 CS205: DATA STRUCTURES (CS, IT)

F453 Module 7: Programming Techniques. 7.2: Methods for defining syntax

STRUCTURE AND SYLLABUS APPROVED IN THE BOARD OF STUDIES MEETING ON 2001 TO BE EFFECTIVE FROM THE ACADEMIC YEAR

Swami Ramanand Teerth Marathwada University, Nanded

Reg. No. : Question Paper Code : B.E./B.Tech. DEGREE EXAMINATION, JANUARY First Semester GE 6151 COMPUTER PROGRAMMING

Academic Programme: B.Sc. I Year. Computer Science (Optional) Hours. Fundamentals of Computer Hours.

GUJARAT TECHNOLOGICAL UNIVERSITY COMPUTER ENGINEERING (07) / INFORMATION TECHNOLOGY (16) / INFORMATION & COMMUNICATION TECHNOLOGY (32) DATA STRUCTURES

12 Abstract Data Types

Bachelor Level/ First Year/ Second Semester/ Science Full Marks: 60 Computer Science and Information Technology (CSc. 154) Pass Marks: 24

Two Approaches to Algorithms An Example (1) Iteration (2) Recursion

Draw a diagram of an empty circular queue and describe it to the reader.

Section 5.5. Left subtree The left subtree of a vertex V on a binary tree is the graph formed by the left child L of V, the descendents

A6-R3: DATA STRUCTURE THROUGH C LANGUAGE

DYNAMIC MEMORY ALLOCATION AND DEALLOCATION

C- PROGRAMMING (3:0:0) Sub code : CS1C01/CS2C01 CIE : 50%Marks Hrs/week : 03 SEE : 50%Marks SEE Hrs : 03 Hours Max. Marks: 100 Course Outcomes:

PROGRAMMING IN C AND C++:

SECOND SEMESTER BCA : Syllabus Copy

Time : 03 Hours Maximum Marks : 75

Syllabus for Bachelor of Technology. Computer Engineering. Subject Code: 01CE0301. Subject Name: Data Structure. B.Tech. Year - II

Sardar Patel University S Y BSc. Computer Science CS-201 Introduction to Programming Language Effective from July-2002

Code No: R Set No. 1

INFORMATION TECHNOLOGY

Prepared By: Ms. Nidhi Solanki (Assist. Prof.) Page 1

DC104 DATA STRUCTURE JUNE Q.2 a. If you are using C language to implement the heterogeneous linked list, what pointer type will you use?

Reg. No. : Question Paper Code : 27157

CHOICE BASED CREDIT SYSTEM (With effect from )

Introduction p. 1 Pseudocode p. 2 Algorithm Header p. 2 Purpose, Conditions, and Return p. 3 Statement Numbers p. 4 Variables p. 4 Algorithm Analysis

(i) Describe in detail about the classification of computers with their features and limitations(10)

First Semester - Question Bank Department of Computer Science Advanced Data Structures and Algorithms...

DATA STRUCTURE : A MCQ QUESTION SET Code : RBMCQ0305

FORTH SEMESTER DIPLOMA EXAMINATION IN ENGINEERING/ TECHNOLIGY- MARCH, 2012 DATA STRUCTURE (Common to CT and IF) [Time: 3 hours

Guru Jambheshwar University of Science & Technology, Hisar Scheme for Theory + Practical Based Subjects

MLR Institute of Technology

DS ata Structures Aptitude

Kadi Sarva Vishwavidyalaya, Gandhinagar

EC8393FUNDAMENTALS OF DATA STRUCTURES IN C Unit 3

E.G.S. PILLAY ENGINEERING COLLEGE (An Autonomous Institution, Affiliated to Anna University, Chennai) Nagore Post, Nagapattinam , Tamilnadu.

PA3 Design Specification

Department of Computer Science and Technology

1) What is information system? Describe the basic concepts of information systems.

PRACTICAL LIST FOR EVEN SEMESTERS (PGDCA/MCA/MSC (CS))

Discuss the following operations on One-Dimensional array with algorithms.

DATA STRUCTURES USING C

Binary Trees

Course Name: B.Tech. 3 th Sem. No of hours allotted to complete the syllabi: 44 Hours No of hours allotted per week: 3 Hours. Planned.

Section I. 1 Review of user defined function,recursion, pointer, structure 05 2 Introduction to Data Structures and stack

Visit ::: Original Website For Placement Papers. ::: Data Structure

EE 368. Week 6 (Notes)

Algorithm Class. C C++ DS JAVA DATA STRUCTURES TRAINING INSTITUTE KPHB HYDERABAD. Mobile:

Sai Nath University. Assignment For MCA 2nd Sem.

DATA STRUCTURES THROUGH C++

Government of Karnataka Department of Technical Education Bengaluru

Madhya Pradesh Bhoj (Open) University, Bhopal

End-Term Examination Second Semester [MCA] MAY-JUNE 2006

17 February Given an algorithm, compute its running time in terms of O, Ω, and Θ (if any). Usually the big-oh running time is enough.

Algorithms 4. Odd or even Algorithm 5. Greatest among three numbers Algorithm 6. Simple Calculator Algorithm

ASSIGNMENTS. Progra m Outcom e. Chapter Q. No. Outcom e (CO) I 1 If f(n) = Θ(g(n)) and g(n)= Θ(h(n)), then proof that h(n) = Θ(f(n))

SYLLABUS FOR 3-YEAR B.Sc. (GENERAL) COURSE IN COMPUTER SCIENCE [To be effective from academic year and onwards] PART I

VALLIAMMAI ENGINEERING COLLEGE

Aryan College. Fundamental of C Programming. Unit I: Q1. What will be the value of the following expression? (2017) A + 9

Computer Science 1 Study Union Practice Problems. What are the arguments to malloc? calloc? realloc? What do they do?

Hrs Hrs Hrs Hrs Hrs Marks Marks Marks Marks Marks

Syllabus for Computer Science General Part I

DEPARTMENT OF INFORMATION TECHNOLOGY KUMAUN UNIVERSITY, NAINITAL SEMESTER-I ( )

QUESTION BANK. Prepared by,mrs.d.maladhy AP/IT,RGCET. Page 1

M.Sc. (Previous) DEGREE EXAMINATION, MAY First Year Information Technology. Time : 03 Hours Maximum Marks : 75

University of Palestine. Final Exam 2 nd semester 2014/2015 Total Grade: 50

1. Attempt any three of the following: 15

Answers. 1. (A) Attempt any five : 20 Marks

Scheme and Syllabus. B. Sc. (IT) I to VI Semester. w.e.f. July 2011 ( Batch onwards)

Department of Computer Science and Engineering NITK, Surathkal IS703 - Network Security [M. Tech-ISE] (Syllabus and Assessment Plan)

DEPARTMENT OF COMPUTER APPLICATIONS B.C.A. - FIRST YEAR ( REGULATION) SECOND SEMESTER LESSON PLAN SRM INSTITUTE OF SCIENCE AND TECHNOLOGY

Data Structures Question Bank Multiple Choice

CS301 - Data Structures Glossary By

S.E. (Computer) (First Semester) EXAMINATION, 2011 DATA STRUCTURES AND ALGORITHM (2008 PATTERN) Time : Three Hours Maximum Marks : 100

Revised time table of BCA (2011 admission) record submission

VALLIAMMAI ENGINEERING COLLEGE

Preface... (vii) CHAPTER 1 INTRODUCTION TO COMPUTERS

INSTITUTE OF AERONAUTICAL ENGINEERING (Autonomous) Dundigal, Hyderabad

2HS306 Applied Engineering Mathematics [ ]

Assessment of Programming Skills of First Year CS Students: Problem Set

Transcription:

I Year MCA I Semester L T P To C 3 1-4 4 MC101 FOUNDATIONS OF INFORMATION TECHNOLOGY Objectives of the Course: It offers students an overall idea of computer science and information technology to the student. It briefly covers the aspects of software, hardware, databases and networks. So that the student is comfortable to study the subjects from respective areas in the coming semesters. UNIT - I (14 Hrs) Computer and Data: Introduction - Computer Hardware, Data, Computer Software, History, Classification of computers- Workstations, Mainframe, Super computers, client and server, Data Inside the computer, Representing Data, Hexadecimal Notation, Octal notation, Representation of Decimal and Binary numbers, Transformation, Representing Integers, Representing the Floating-point numbers, Hexa Decimal Notation, Operation on Bits- Arithmetic operations, Logical Operations and shift operations. UNIT - II (10 Hrs) Computer Hardware: CPU, Main memory, Input or Output, Inter connection of subsystems, Program execution. Computer networks- Introduction, OSI model, Types of networks- wireless networks, Distributed computer systems, TCP/IP, Internet history, Basic services, www, browsers. UNIT - III (14 Hrs) Computer Software: Operating systems- Definition, Evolution, Components, Popular operating systems, Algorithm - Concept, Algorithm representation, Sub algorithms, Basic algorithms, Recursion, Evolution of Programming languages, Building a program, Program execution, categories of languages, Analogy with natural language, machine language, Assembly language, High-Level language, Object oriented Programming languages, Software lifecycle - Development process models, Modularity, Quality and Documentation. UNIT - IV (11 Hrs) Data Organization: Data Structures- Arrays, Records, Linked list concepts, Abstract Data Type- Introduction, Linear list, Stack, queues, File structure- Access methods, Sequential files, Indexed files and Hashed files, Database management system, Architecture of DBMS, Database models, Relational model, Operations on relations, Structured query language, Other database models. UNIT - V (11 Hrs) Internet & World Wide Web, Search Engines & Netiquette, Cyber Threats.

Text Books: 1. Foundations of computer science, Behrouz A. Forouzan, 2nd edition. 2. Introduction to computers, 6/e, Peter Norton TMH. Reference Books: 1. Sinha P., Foundation of Computing, BPB Publication, 1st Edition, 2003 2. Rajaraman V., Computer Fundamentals.

I Year MCA I Semester L T P To C - - 3 3 2 MC113 C & DATA STRUCTURES LAB Objective of the Course : The purpose of this course is to introduce the students to the field of programming using C language. The students will be able to enhance their analyzing and problem solving skills and use the same for writing programs in C. This course also gives complete programming on data structures. 1. a ) Write a C program to find the sum of individual digits of a positive integer. b) A Fibonacci Sequence is defined as follows: the first and second terms in the sequence are 0 and 1. Subsequent terms are found by adding the preceding two terms in the sequence. Write a C program to generate the first n terms of the sequence. 2. Write a C program to find whether: a) The given number is Armstrong or not. b) The given number is Strong number or not. c) The given number is Perfect number. 3. a) Write a C program to calculate the following Sum: Sum=1-x2/2! +x4/4!- x6/6!+x8/8!-x10/10! b) Write a C program toe find the roots of a quadratic equation. 4. Write C programs that use both recursive and non-recursive functions i) To find the factorial of a given integer. ii) To find the GCD (greatest common divisor) of two given integers. iii) To solve Towers of Hanoi problem. 5. a) The total distance travelled by vehicle in t seconds is given by distance = ut+1/2at2 where u and a are the initial velocity (m/sec. ) and acceleration (m/sec2). Write C program to find the distance travelled at regular intervals of time given the values of u and a. The program should provide the flexibility to the user to select his own time intervals and repeat the calculations for different values of u and a. b) Write a C program, which takes two integer operands and one operator form the user, performs the operation and then prints the result. (Consider the operators +,-,*, /, % and use Switch Statement) 6. a) Write a C program to find both the larges and smallest number in a list of integers. b) Write a C program that uses functions to perform the following: i) Addition of Two Matrices ii) Multiplication of Two Matrices 7. a) Write a C program that uses functions to perform the following operations: i) To insert a sub-string in to given main string from a given position.

ii) To delete n Characters from a given position in a given string. b) Write a C program to determine if the given string is a palindrome or not 8. a) Write a C program that displays the position or index in the string S where the string T begins, or 1 if S doesn t contain T. b) Write a C program to count the lines, words and characters in a given text. 9. a) Write a C program to generate Pascal s triangle. b) Write a C program to construct a pyramid of numbers. 10. Write a C program to read in two numbers, x and n, and then compute the sum of this geometric progression: 1+x+x2+x3+.+xn For example: if n is 3 and x is 5, then the program computes 1+5+25+125. Print x, n, the sum Perform error checking. For example, the formula does not make sense for negative exponents if n is less than 0. Have your program print an error message if n<0, then go back and read in the next pair of numbers of without computing the sum. Are any values of x also illegal? If so, test for them too. 11. Write a C program that uses functions to perform the following operations: i) Reading a complex number ii) Writing a complex number iii) Addition of two complex numbers iv) Multiplication of two complex numbers (Note: represent complex number using a structure.) 12. a) Write a C program which copies one file to another. b) Write a C program to reverse the first n characters in a file. (Note: The file name and n are specified on the command line.) 13. Write a C program that uses functions to perform the following operations on singly linked list: i) Creation ii) Insertion iii) Deletion iv) Traversal 14. Write a C program that uses functions to perform the following operations on doubly linked list: i) Creation ii) Insertion iii) Deletion iv) Traversal in both ways 15. Write C programs that implement stack (its operations) using i) Arrays ii) Pointers 16. Write C programs that implement Queue (its operations) using i) Arrays ii) Pointers 17. Write a C program that uses Stack operations to perform the following: i) Converting infix expression into postfix expression ii) Evaluating the postfix expression 18. Write a C program that uses functions to perform the following: i) Creating a Binary Tree of integers ii) Traversing the above binary tree in preorder, inorder and postorder

19. Write C programs that use both recursive and non recursive functions to perform the following searching operations for a Key value in a given list of integers : i) Linear search ii) Binary search 20. Write C programs that implement the following sorting methods to sort a given list of integers in ascending order: i) Bubble sort ii) Quick sort 21. Write C programs that implement the following sorting methods to sort a given list of integers in ascending order: i) Insertion sort ii) Merge sort Text Books: 1. C programming and Data Structures, P. Padmanabham, Third Edition, BS Publications 2. Data Structures: A pseudo code approach with C, second edition R.F. Gilberg and B.A. Forouzan Reference Books: 1. Programming in C, P.Dey & M. Ghosh, Oxford Univ.Press. 2. C and Data Structures, E Balaguruswamy, TMH pub