Madhya Pradesh Bhoj (Open) University, Bhopal

Size: px
Start display at page:

Download "Madhya Pradesh Bhoj (Open) University, Bhopal"

Transcription

1 Subject- Computer Organisation & System Software Maximum Marks: 20 Q.1 What is Number System? Explain Its Types? Q.2 What is Program Interrupt? Explain it. Q.3 Explain the Floating Point Representation? Q.4 Explain the Direct Memory Access (DMA). Q.5 Explain Multiplexer and its Function with the help of diagram. I Q.1 Explain the flip-flop and its Types. Q.2 What is Gray Code? Explain it. Q.3 Explain the method of Parallel Processing. Q.4 Explain Multiplication Algorithms with Example Q.5 Explain the difference between Hardware control and Micro programmed control. Practical Assignment- First Q.1 Write a Program to subtract two numbers in 8086 microprocessor. Q.2 Explain the Instruction Cycle with Diagram? Practical Assignment- Second Q.1 Explain the multiplication of Two Floating print numbers with flow chart. Q.2 What is Macro? Explain Nested macro with example? Subject- Database Management Systems Maximum Marks: 20

2 Q. 1 What Do you understand by life System? Explain advantage of database system owner life system. Q. 2 Write short note on- (a) Specialization and Generalization. (b) Aqqreqation (c) Participation. Q. 3 What Do you understand by functional depending? Explain Inference rules for FD's. Q. 4 What Is the Role of schedule in DBMS, Explain different types of schedules with example. Q-1 Explain following. I (a) Database Architecture (b) (c) Data Abstraction. Data Independence Q2- Explain 3NF and BCNF With Example. Q3- What is Indexing! Explain B+ tree index. Q-4 What is Multivalued dependency! How can you distinguish it With Join dependency. Q. 1 Explain E-R model with example. Q. 2 Explain difference between- Project Assignment- First (a) Domain Vorsus Touple Calculus (b) Outer Join Versus Inner joins. Project Assignment- Second Q. 1 Explain unary operators used in relational scheme. Q. 2 Explain following- (a) Dead lock (b) Time stamp ordinary (c) Concurrency control Subject- Data Structure and Algorithm Maximum Marks: 20

3 1. What are the various types of data structure? Classify them in various categories explaining each in detail. 2. What is doubly link list? How it differ from singly link list. 3. What is tree? Explain tree with its basic technology. Describe binary tree. 4. Describe and differentiate BSF and DFS search techniques. 5. Write a detailed comparative study report of sequential and link storage in terms of memory utilization and processing time. I 1. Give a comparative study of standard data structure: Array, Record, Set and File. 2. Define the Stack & Queue. Explain in brief why circular implementation is better than linear implementation. 3. Define and illustrate the preorder and postorder traversal of binary tree. 4. What is Spanning tree? Explain Kruskal algorithm through example. 5. Explain the following: A) Hash function B) Heap tree C) B-tree Project Assignment- First 1. Write the procedures for inserting and deleting element from a queue in C language. 2. Write down a procedure to sort an array of integers using Quick sort. Project Assignment- Second 1. Write the recursive function for binary search. 2. Write the function in C that reverses a given linked list. Subject- Programming in Visual Basic Maximum Marks: 20

4 Q.1 What is IDE? Discuss the following components of IDE i, e project window, property window, form window, and code editor window. Q.2 What is user defined data types and control flow statements. Q.3 Define a forms and menus? Q.4 Explain the basic control of visual basic. Q.5 Explain about any five ACTIVE X controls with properties and examples in VB. I Q.1 What is GUI? List the advantages of GUI. Q.2 Explain the error handling and debugging. Q.3 What do you mean by event driven programming? Q.4 Differentiate between radio button and check box with examples. Q.5 Explain about OLE and API. Q.1 Define the following: Practical Assignment- First (i) Arrays (ii) MDI Practical Assignment- Second Q.1 Explain the various control structures with syntax and examples. Q.2 Explain about mouse events and dialog boxes in VB. Subject- Operating System Maximum Marks: 20

5 . What is an Operating System? Explain its function. Q2. What do you mean by Scheduling? Explain suitable example. Q3. What are deadlocks? Explain in briefly. Q4. What do you mean by File Organization System? Explain with Suitable example. Q5. Explain mutual exclusion in brief. I. Explain concepts of Inter process communication in briefly? Q2. What do you mean by Critical section problem? Explain in brief. Q3. What is demand paging? Explain its Concept with suitable example. Q4. What is multiprocessor System? Explain with Suitable example. Q5. Explain performance Evaluation Techniques. Project Assignment- First. What do you mean by page replacement techniques? Q2. Explain Distributed system Structure? Project Assignment- Second. Write down concept of cryptography? Q2. Explain network structures with example? Subject- Programming in C Maximum Marks: 20 What do you mean by algorithm? Explain with suitable example.

6 Q2 Q3 Q4 Q5 Q2 Q3 Q4 Q5 Q2 Q2 What do you mean by Tokens? Explain with suitable examples. What do you mean by Control Structure? Explain with suitable example. Explain the working of array of structure with suitable example. What do you mean by Pre-Processor? Explain all preprocessor Directives. I Explain Generation of Programming Language. What do you mean by Primary and Secondary Data types? Explain with suitable examples. What do you mean by Array? Explain working of multiplication of two Matrixes of 3 by 3. Differentiate the Union and Structure with suitable examples. What do you mean by File Handling? Explain with suitable example. Practical Assignment- First Write a program to find result of board or university (With Ladder). Write a program to find swap of any two numbers using as following condition: a) With temporary variable. b) Without temporary variables. c) Without temporary and arithmetic operator. Practical Assignment- Second Write a program to find sum of all element of array. Write a program to find sum of all digit of given any integer number. Subject- Mathematical Foundations of Computer Science Maximum Marks: 20 Q.1 Define the Set theory?

7 Q.2 Define the algebraic structure? Q.3 Describe the sub field and sub stream? Q.4 Note about the historical aspect of automata? Q.5 What is the context free grammar? I Q.1 Define the De-Morgan s low? Q.2 Definition of kernel of F? Q.3 Explain the solution by method of generating Function? Q.4 Write about the Boolean algebraic expression? Q.5 Describe the turning machines for computing function?

Total No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year COMPUTER SCIENCE.

Total No. of Questions : 18] [Total No. of Pages : 02. M.Sc. DEGREE EXAMINATION, DEC First Year COMPUTER SCIENCE. (DMCS01) Total No. of Questions : 18] [Total No. of Pages : 02 M.Sc. DEGREE EXAMINATION, DEC. 2016 First Year COMPUTER SCIENCE Data Structures Time : 3 Hours Maximum Marks : 70 Section - A (3 x 15 = 45)

More information

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

1) What is information system? Describe the basic concepts of information systems. (DMSIT 01) ASSIGNMENT - 1, DEC - 2018. PAPER- I : BASICS OF 1) What is information system? Describe the basic concepts of information systems. 2) Discuss about input and output technologies of computer

More information

Fundamental of I.T. (c) Application of computer *************

Fundamental of I.T. (c) Application of computer ************* Paper I Fundamental of I.T 1. What is an output device? Discuss the type of output device used in computer. 2. What is Secondary memory? Discuss the type of secondary memory used in computer. 3. Explain

More information

P.G.D.C.A. EXAMINATION, 2009

P.G.D.C.A. EXAMINATION, 2009 P.G.D.C.A. EXAMINATION, 2009 ADVANCED DATABASE MANAGEMENT SYSTEM Time allowed: Three Hours Maximum Marks: 100 Attempt any five questions, selecting one question from each unit. All questions carry equal

More information

(DMTCS 01) Answer Question No.1 is compulsory (15) Answer One question from each unit (4 15=60) 1) a) State whether the following is True/False:

(DMTCS 01) Answer Question No.1 is compulsory (15) Answer One question from each unit (4 15=60) 1) a) State whether the following is True/False: (DMTCS 01) M.Tech. DEGREE EXAMINATION, DECEMBER - 2015 (Examination at the end of First Year) COMPUTER SCIENCE Paper - I : Data structures Time : 03 Hours Maximum Marks : 75 Answer Question No.1 is compulsory

More information

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

1 P a g e A r y a n C o l l e g e \ B S c _ I T \ C \ BSc IT C Programming (2013-2017) Unit I Q1. What do you understand by type conversion? (2013) Q2. Why we need different data types? (2013) Q3 What is the output of the following (2013) main() Printf( %d,

More information

M.C.A. DEGREE EXAMINATION, MAY First Year. Paper I INFORMATION TECHNOLOGY. SECTION A (3 15 = 45 marks) Answer any THREE of the following.

M.C.A. DEGREE EXAMINATION, MAY First Year. Paper I INFORMATION TECHNOLOGY. SECTION A (3 15 = 45 marks) Answer any THREE of the following. Paper I INFORMATION TECHNOLOGY Answer any THREE of the following. 1. Explain Architecture of computer in detail. 2. Explain in detail about Input and Output technologies. 3. What is MODEM? What factors

More information

Post-Graduate Diploma in Computer Application Examination,2008 ELECTRONIC DATA PROCESSING

Post-Graduate Diploma in Computer Application Examination,2008 ELECTRONIC DATA PROCESSING 1 Post-Graduate Diploma in Computer Application Examination,2008 ELECTRONIC DATA PROCESSING DCA -103 Time Allowed: Three hours Maximum Marks: 100 Attempt any five questions. All question carry equal marks.

More information

ADMINISTRATIVE MANAGEMENT COLLEGE

ADMINISTRATIVE MANAGEMENT COLLEGE First Semester ADMINISTRATIVE MANAGEMENT COLLEGE BACHELOR OF COMPUTER APPLICATION COURSE OUTCOME (CO) Problem solving techniques Using C CO 1: Understand the basic concepts of programming, software and

More information

COURSE: DATA STRUCTURES USING C & C++ CODE: 05BMCAR17161 CREDITS: 05

COURSE: DATA STRUCTURES USING C & C++ CODE: 05BMCAR17161 CREDITS: 05 COURSE: DATA STRUCTURES USING C & C++ CODE: 05BMCAR17161 CREDITS: 05 Unit 1 : LINEAR DATA STRUCTURES Introduction - Abstract Data Types (ADT), Arrays and its representation Structures, Stack, Queue, Circular

More information

SUBJECT COMPUTER SCIENCE PAGE 1

SUBJECT COMPUTER SCIENCE PAGE 1 BACHELOR OF SCIENCE (B.Sc.) (THREE YEAR DEGREE COURSE) SUBJECT COMPUTER SCIENCE PAGE 1 COURSE STRUCTURE FIRST YEAR PAPER 101: Computer Fundamental 50 MARKS PAPER 102: Programming IN C 50 MARKS PAPER 103:

More information

M.C.A. FIRST YEAR DEGREE

M.C.A. FIRST YEAR DEGREE (DMCA 101) ASSIGNMENT - 1, DEC - 2018. PAPER- I : INFORMATION TECHNOLOGY 1) What is MIS? Explain role of MIS in an organisation. 2) Explain in detail about input and output technologies. 3) Discuss about

More information

5. (a) What is secondary storage? How does it differ from a primary storage? (b) Explain the functions of (i) cache memory (ii) Register

5. (a) What is secondary storage? How does it differ from a primary storage? (b) Explain the functions of (i) cache memory (ii) Register General Concepts 1. (a) What are combinational circuits? (b) Perform the following: (i) Convert (0.5625) 10 = ( ) 2 (ii) (010010) 2 (100011) 2 = ( ) 2 2. (a) Using truth table prove that A B= A+ B (b)

More information

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

M.Sc. (Previous) DEGREE EXAMINATION, MAY First Year Information Technology. Time : 03 Hours Maximum Marks : 75 M.Sc. (Previous) DEGREE EXAMINATION, MAY - 2013 First Year Information Technology Paper - I : BASICS OF INFORMATION TECHNOLOGY (DMSIT01) Time : 03 Hours Maximum Marks : 75 Section - A (3 15 = 45) Answer

More information

M.Sc. (Computer Science) I Year Assignments for May Paper I DATA STRUCTURES Assignment I

M.Sc. (Computer Science) I Year Assignments for May Paper I DATA STRUCTURES Assignment I Paper I DATA STRUCTURES (DMCS 01) 1. Explain in detail about the overview of Data structures. 2. Explain circular linked list and double-linked list. 3. Explain CPU scheduling in Multiprogramming Environment.

More information

INFORMATION TECHNOLOGY

INFORMATION TECHNOLOGY [DMSIT 01] M.Sc. (Previous) DEGREE EXAMINATION, DEC 2013 First Year INFORMATION TECHNOLOGY Paper I BASICS OF INFORMATION TECHNOLOGY Time : 3 hours Max. Marks : 75 Section A (3x15 = 45) Answer any THREE

More information

2) Explain in detail about different AVL rotation applied on unbalanced trees.

2) Explain in detail about different AVL rotation applied on unbalanced trees. (DMCS 01) ASSIGNMENT - 1, MAY-2014. PAPER- I : DATA STRUCTURES 1) Define circular queue. Write an algorithm to describe insertion and deletion operation on a circular queue. Illustrate these operations

More information

AFN-1255 PCA131 P.G.D.C.A. DIPLOMA EXAMINATION, MAY 2011 First Semester Computer Applications FUNDAMENTALS OF DIGITAL COMPUTER (Non-CBCS 2004 onwards) Time : 3 Hours Maximum : 100 Marks Part A (15 1 =

More information

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

R10 SET - 1. Code No: R II B. Tech I Semester, Supplementary Examinations, May www.jwjobs.net R10 SET - 1 II B. Tech I Semester, Supplementary Examinations, May - 2012 (Com. to CSE, IT, ECC ) Time: 3 hours Max Marks: 75 *******-****** 1. a) Which of the given options provides the

More information

M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science. Paper - I : DATA STRUCTURES

M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science. Paper - I : DATA STRUCTURES (DMCS 01) M.Sc. (Previous) DEGREE EXAMINATION, MAY - 2014 (Examination at the end of First Year) Computer Science Paper - I : DATA STRUCTURES Time : 03 Hours Maximum Marks : 75 Section A (3 15 = 45) Answer

More information

1. a) Discuss primitive recursive functions with an example? 15M Or b) Statements and applications of Euler s and Fermat s Theorems?

1. a) Discuss primitive recursive functions with an example? 15M Or b) Statements and applications of Euler s and Fermat s Theorems? MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 1. a) Discuss primitive recursive functions with an example? 15M b) Statements and applications of Euler s and Fermat s Theorems? 15M 2. a) Define DFA and NFA

More information

Note: Select one full question from each unit

Note: Select one full question from each unit P.E.S COLLEGE OF ENGINEERING, MANDYA-571401 (An Autonomous Institution Under VTU Belgaum) Department of Master of Computer Applications Model Question Paper Data Structures Using C (P18MCA21) Credits :

More information

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

R13. II B. Tech I Semester Supplementary Examinations, May/June DATA STRUCTURES (Com. to ECE, CSE, EIE, IT, ECC) SET - 1 II B. Tech I Semester Supplementary Examinations, May/June - 2016 PART A 1. a) Write a procedure for the Tower of Hanoi problem? b) What you mean by enqueue and dequeue operations in a queue? c)

More information

Madhya Pradesh Bhoj (Open) University, Bhopal

Madhya Pradesh Bhoj (Open) University, Bhopal Subject-I- Data Structure through C Maximum Marks: 30 funz s'k& Q3 Q4 Q5 Q3 Describe the methods of parallel processing. What do you mean by Instruction? Describe the computer instructions in brief. How

More information

M.C.A. DEGREE EXAMINATION, DEC First Year. Time : 03 Hours Maximum Marks : 75

M.C.A. DEGREE EXAMINATION, DEC First Year. Time : 03 Hours Maximum Marks : 75 (DMCA 101) M.C.A. DEGREE EXAMINATION, DEC. - 2012 First Year Paper - I : INFORMATION TECHNOLOGY Time : 03 Hours Maximum Marks : 75 Section - A Answer any Three of the following (3 15 = 45) 1) Define the

More information

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

STRUCTURE AND SYLLABUS APPROVED IN THE BOARD OF STUDIES MEETING ON 2001 TO BE EFFECTIVE FROM THE ACADEMIC YEAR STRUCTURE AND SYLLABUS APPROVED IN THE BOARD OF STUDIES MEETING ON 2001 TO BE EFFECTIVE FROM THE ACADEMIC YEAR 2000-2001. MCA II SEMESTER Scheme of Evaluation Max. Marks Min. Marks to pass L P C Int. Ext.

More information

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

Table of Contents. Chapter 1: Introduction to Data Structures... 1 Table of Contents Chapter 1: Introduction to Data Structures... 1 1.1 Data Types in C++... 2 Integer Types... 2 Character Types... 3 Floating-point Types... 3 Variables Names... 4 1.2 Arrays... 4 Extraction

More information

ASSIGNMENT - 1 M.Sc. DEGREE EXAMINATION, MAY 2019 First Year COMPUTER SCIENCE Data Structures MAXIMUM : 30 MARKS ANSWER ALL QUESTIONS

ASSIGNMENT - 1 M.Sc. DEGREE EXAMINATION, MAY 2019 First Year COMPUTER SCIENCE Data Structures MAXIMUM : 30 MARKS ANSWER ALL QUESTIONS ASSIGNMENT - 1 Data Structures (DMCS01) Q1) a) Write a sub-routine to implement PUSH ( ) and POP ( ) operations using linked list. b) Explain about open hashing and closed hashing. Q2) How to create double

More information

CS PROGRAMMING & ATA STRUCTURES I. UNIT I Part - A

CS PROGRAMMING & ATA STRUCTURES I. UNIT I Part - A CS6202 - PROGRAMMING & ATA STRUCTURES I Question Bank UNIT I Part - A 1. What are Keywords? 2. What is the difference between if and while statement? 3. What is the difference between while loop and do

More information

M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science. Time : 03 Hours Maximum Marks : 75

M.Sc. (Previous) DEGREE EXAMINATION, MAY (Examination at the end of First Year) Computer Science. Time : 03 Hours Maximum Marks : 75 M.Sc. (Previous) DEGREE EXAMINATION, MAY - 2013 (Examination at the end of First Year) Computer Science Paper - I : DATA STRUCTURES (DMCS 01) Time : 03 Hours Maximum Marks : 75 Section - A (3 15 = 45)

More information

BACHELORS IN COMPUTER APPLICATIONS COMPUTER NETWORKS PAPER CODE: BCA-401

BACHELORS IN COMPUTER APPLICATIONS COMPUTER NETWORKS PAPER CODE: BCA-401 BACHELORS IN COMPUTER APPLICATIONS COMPUTER NETWORKS PAPER CODE: BCA-401 SECTION-A Answer the following questions in around 100 words. 1. What information is contained in the control field of HDLC protocol?

More information

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

F453 Module 7: Programming Techniques. 7.2: Methods for defining syntax 7.2: Methods for defining syntax 2 What this module is about In this module we discuss: explain how functions, procedures and their related variables may be used to develop a program in a structured way,

More information

Total No. of Questions :09] [Total No. of Pages : 02. II/IV B.Tech. DEGREE EXAMINATIONS, NOV/DEC Second Semester CSE/IT DBMS

Total No. of Questions :09] [Total No. of Pages : 02. II/IV B.Tech. DEGREE EXAMINATIONS, NOV/DEC Second Semester CSE/IT DBMS CSE/IT 224 (CR) Total No. of Questions :09] [Total No. of Pages : 02 Time: Three Hours II/IV B.Tech. DEGREE EXAMINATIONS, NOV/DEC- 2015 Second Semester CSE/IT DBMS Answer Question NO.1 Compulsory Answer

More information

B.Tech in COMPUTER SCIENCE & ENGINEERING

B.Tech in COMPUTER SCIENCE & ENGINEERING B.Tech in COMPUTER SCIENCE & ENGINEERING Paper - 1 S.No. Unit/Topic NPTEL Link 1. DIGITAL SYSTEM DESIGN Binary Systems: Introduction to Number Systems and conversions. Arithmetic with number systems, Signed

More information

DYNAMIC MEMORY ALLOCATION AND DEALLOCATION

DYNAMIC MEMORY ALLOCATION AND DEALLOCATION COURSE TITLE DATA STRUCTURE DETAILED SYLLABUS SR.NO NAME OF CHAPTERS & DETAILS HOURS ALLOTTED 1 USER DEFINED DATATYPE /STRUCTURE About structure Defining structure Accessing structure element Array of

More information

Time : 03 Hours Maximum Marks : 75

Time : 03 Hours Maximum Marks : 75 (DMSIT 01) Information Technology Paper - I : BASICS OF INFORMATION TECHNOLOGY Answer any Three of the following 1) Define IT. Enumerate various IT trends and their benefits to the organizations. 2) Bring

More information

CS/ENGRD 2110 Object-Oriented Programming and Data Structures Spring 2012 Thorsten Joachims. Lecture 25: Review and Open Problems

CS/ENGRD 2110 Object-Oriented Programming and Data Structures Spring 2012 Thorsten Joachims. Lecture 25: Review and Open Problems CS/ENGRD 2110 Object-Oriented Programming and Data Structures Spring 2012 Thorsten Joachims Lecture 25: Review and Open Problems Course Overview Programming Concepts Object-Oriented Programming Interfaces

More information

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

APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY THIRD SEMESTER B.TECH DEGREE EXAMINATION, JULY 2017 CS205: DATA STRUCTURES (CS, IT) D B3D042 Pages: 2 Reg. No. Name: APJ ABDUL KALAM TECHNOLOGICAL UNIVERSITY THIRD SEMESTER B.TECH DEGREE EXAMINATION, JULY 2017 Max. Marks: 100 CS205: DATA STRUCTURES (CS, IT) PART A Answer all questions.

More information

SIDDHARTH GROUP OF INSTITUTIONS :: PUTTUR Siddharth Nagar, Narayanavanam Road QUESTION BANK (DESCRIPTIVE) UNIT-I

SIDDHARTH GROUP OF INSTITUTIONS :: PUTTUR Siddharth Nagar, Narayanavanam Road QUESTION BANK (DESCRIPTIVE) UNIT-I SIDDHARTH GROUP OF INSTITUTIONS :: PUTTUR Siddharth Nagar, Narayanavanam Road 517583 QUESTION BANK (DESCRIPTIVE) Subject with Code : CO (16MC802) Year & Sem: I-MCA & I-Sem Course & Branch: MCA Regulation:

More information

Code No: R Set No. 1

Code No: R Set No. 1 Code No: R05010106 Set No. 1 1. (a) Draw a Flowchart for the following The average score for 3 tests has to be greater than 80 for a candidate to qualify for the interview. Representing the conditional

More information

SYLLABUS. M.Sc. I.T. Ist Year

SYLLABUS. M.Sc. I.T. Ist Year SYLLABUS M.Sc. I.T. Ist Year CONTENT M.Sc.IT Paper I Ist Year Computer Organization & Architecture Paper II Data Communications and Computer Networking Paper III Programming in C and Data Structure Paper

More information

SECOND SEMESTER BCA : Syllabus Copy

SECOND SEMESTER BCA : Syllabus Copy BCA203T: DATA STRUCTURES SECOND SEMESTER BCA : Syllabus Copy Unit-I Introduction and Overview: Definition, Elementary data organization, Data Structures, data structures operations, Abstract data types,

More information

B.Sc.-IT (Part I) EXAMINATION, 2010 Computing Logics And Reasoning

B.Sc.-IT (Part I) EXAMINATION, 2010 Computing Logics And Reasoning 1 B.Sc.-IT (Part I) EXAMINATION, 2010 Computing Logics And Reasoning Time allowed : Three Hours Maximum Marks : 50 Answer all ten questions (20 words each). Each question carries equal marks. Answer all

More information

ASSIGNMENT-1 M.Sc. DEGREE EXAMINATION, MAY 2018 (First Year) INFORMATION TECHNOLOGY Basics of Information Technology

ASSIGNMENT-1 M.Sc. DEGREE EXAMINATION, MAY 2018 (First Year) INFORMATION TECHNOLOGY Basics of Information Technology ASSIGNMENT-1 () Basics of Information Technology (DMSIT01) Q1) Discuss in detail about IT support at different organizational levels. Q2) Explain about hierarchy of computers. Q3) Discuss different categories

More information

JAVA PROGRAMMING. Unit-3 :Creating Gui Using The Abstract Windowing Toolkit:

JAVA PROGRAMMING. Unit-3 :Creating Gui Using The Abstract Windowing Toolkit: JAVA PROGRAMMING UNIT-1: Introduction To Java, Getting Started With Java, Applets And Application, Creating A Java Application, Creating A Java Applets, Object Oriented Programming In Java, Object And

More information

V.S.B ENGINEERING COLLEGE DEPARTMENT OF INFORMATION TECHNOLOGY I IT-II Semester. Sl.No Subject Name Page No. 1 Programming & Data Structures-I 2

V.S.B ENGINEERING COLLEGE DEPARTMENT OF INFORMATION TECHNOLOGY I IT-II Semester. Sl.No Subject Name Page No. 1 Programming & Data Structures-I 2 V.S.B ENGINEERING COLLEGE DEPARTMENT OF INFORMATION TECHNOLOGY I IT-II Semester Sl.No Subject Name Page No. 1 Programming & Data Structures-I 2 CS6202 - PROGRAMMING & DATA STRUCTURES UNIT I Part - A 1.

More information

Rajiv GandhiCollegeof Engineering& Technology, Kirumampakkam.Page 1 of 10

Rajiv GandhiCollegeof Engineering& Technology, Kirumampakkam.Page 1 of 10 Rajiv GandhiCollegeof Engineering& Technology, Kirumampakkam.Page 1 of 10 RAJIV GANDHI COLLEGE OF ENGINEERING & TECHNOLOGY, KIRUMAMPAKKAM-607 402 DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING QUESTION BANK

More information

PROGRAMMING IN C++ (Regulation 2008) Answer ALL questions PART A (10 2 = 20 Marks) PART B (5 16 = 80 Marks) function? (8)

PROGRAMMING IN C++ (Regulation 2008) Answer ALL questions PART A (10 2 = 20 Marks) PART B (5 16 = 80 Marks) function? (8) B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2009 EC 2202 DATA STRUCTURES AND OBJECT ORIENTED Time: Three hours PROGRAMMING IN C++ Answer ALL questions Maximum: 100 Marks 1. When do we declare a

More information

CS 101 Advanced Computer System Architecture 100 ( ) CS 102 Operating System 100 ( )

CS 101 Advanced Computer System Architecture 100 ( ) CS 102 Operating System 100 ( ) Syllabus for M.Sc. Computer Science Programme Semester I External/ Internal CS 101 Advanced Computer System Architecture 100 ( 75 + 25 ) CS 102 Operating System 100 ( 75 + 25 ) CS 103 Mathematical Foundation

More information

BRONX COMMUNITY COLLEGE of the City University of New York DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE. Sample Final Exam

BRONX COMMUNITY COLLEGE of the City University of New York DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE. Sample Final Exam BRONX COMMUNITY COLLEGE of the City University of New York DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE CSI33 Sample Final Exam NAME Directions: Solve problems 1 through 5 of Part I and choose 5 of the

More information

Advanced Diploma in Computer Science (907) Computer Systems Architecture

Advanced Diploma in Computer Science (907) Computer Systems Architecture Advanced Diploma in Computer Science (907) Computer Systems Architecture Prerequisites: Good computing knowledge Corequisites: A pass or better in Diploma in System Analysis & Design or equivalence. Aim:

More information

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?

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? Q.2 a. If you are using C language to implement the heterogeneous linked list, what pointer type will you use? The heterogeneous linked list contains different data types in its nodes and we need a link

More information

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

R10 SET - 1. Code No: R II B. Tech I Semester, Supplementary Examinations, May Code No: R21051 R10 SET - 1 II B. Tech I Semester, Supplementary Examinations, May - 2012 DATA STRUCTURES (Com. to CSE, IT, ECC ) Time: 3 hours Max Marks: 75 Answer any FIVE Questions All Questions carry

More information

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

Syllabus for Bachelor of Technology. Computer Engineering. Subject Code: 01CE0301. Subject Name: Data Structure. B.Tech. Year - II Subject Code: 01CE0301 Subject Name: Data Structure B.Tech. Year - II Objective: Data structure has high importance in the field of Computer & IT. Organization of data is crucial for implementation and

More information

2HS306 Applied Engineering Mathematics [ ]

2HS306 Applied Engineering Mathematics [ ] HS0 Applied Engineering Mathematics [ 0 ] Learning outcomes: Upon completion of this course, students will be able to: Understand all basic fundamentals of numeric methods transforms. Prepare him/her self

More information

SIR C R REDDY COLLEGE OF ENGINEERING

SIR C R REDDY COLLEGE OF ENGINEERING SIR C R REDDY COLLEGE OF ENGINEERING DEPARTMENT OF INFORMATION TECHNOLOGY Course Outcomes II YEAR 1 st SEMESTER Subject: Data Structures (CSE 2.1.1) 1. Describe how arrays, records, linked structures,

More information

KLiC C Programming. (KLiC Certificate in C Programming)

KLiC C Programming. (KLiC Certificate in C Programming) KLiC C Programming (KLiC Certificate in C Programming) Turbo C Skills: The C Character Set, Constants, Variables and Keywords, Types of C Constants, Types of C Variables, C Keywords, Receiving Input, Integer

More information

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

List of Practical for Master in Computer Application (5 Year Integrated) (Through Distance Education) List of Practical for Master in Computer Application (5 Year Integrated) (Through Distance Education) Directorate of Distance Education Guru Jambeshwar University of Science & Technology, Hissar First

More information

VALLIAMMAI ENGINEERING COLLEGE

VALLIAMMAI ENGINEERING COLLEGE VALLIAMMAI ENGINEERING COLLEGE SRM Nagar, Kattankulathur 603 203 DEPARTMENT OF INFORMATION TECHNOLOGY QUESTION BANK III SEMESTER CS8391-Data Structures Regulation 2017 Academic Year 2018 19(odd Semester)

More information

Total No. of Questions :09] [Total No. of Pages : 02

Total No. of Questions :09] [Total No. of Pages : 02 CS/IT 315 (CR) Total No. of Questions :09] [Total No. of Pages : 02 III/IV B.Tech. DEGREE EXAMINATIONS, NOV/DEC- 2016 First Semester CS/IT DESIGN ANALYSIS OF ALGORITHMS Time: Three Hours Answer Question

More information

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

Preface... (vii) CHAPTER 1 INTRODUCTION TO COMPUTERS Contents Preface... (vii) CHAPTER 1 INTRODUCTION TO COMPUTERS 1.1. INTRODUCTION TO COMPUTERS... 1 1.2. HISTORY OF C & C++... 3 1.3. DESIGN, DEVELOPMENT AND EXECUTION OF A PROGRAM... 3 1.4 TESTING OF PROGRAMS...

More information

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

I Year MCA I Semester L T P To C FOUNDATIONS OF INFORMATION TECHNOLOGY 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.

More information

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING B.E SECOND SEMESTER CS 6202 PROGRAMMING AND DATA STRUCTURES I TWO MARKS UNIT I- 2 MARKS

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING B.E SECOND SEMESTER CS 6202 PROGRAMMING AND DATA STRUCTURES I TWO MARKS UNIT I- 2 MARKS DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING B.E SECOND SEMESTER CS 6202 PROGRAMMING AND DATA STRUCTURES I TWO MARKS UNIT I- 2 MARKS 1. Define global declaration? The variables that are used in more

More information

Course Title : Computer Fundamentals & Programming in C. SLM Code : C-101. All questions carry equal marks. Total Marks : 20

Course Title : Computer Fundamentals & Programming in C. SLM Code : C-101. All questions carry equal marks. Total Marks : 20 Course Code : PGDCA-1 Course Title : Computer Fundamentals & Programming in C SLM Code : C-101 Assignment No. : PGDCA-1/ C-101 /C-2018 Q.1 What is the computer fundamental? Characteristics of Computer.

More information

CIS 1.5 Course Objectives. a. Understand the concept of a program (i.e., a computer following a series of instructions)

CIS 1.5 Course Objectives. a. Understand the concept of a program (i.e., a computer following a series of instructions) By the end of this course, students should CIS 1.5 Course Objectives a. Understand the concept of a program (i.e., a computer following a series of instructions) b. Understand the concept of a variable

More information

Syllabus for Computer Science General Part I

Syllabus for Computer Science General Part I Distribution of Questions: Part I Q1. (Compulsory: 20 marks). Any ten questions to be answered out of fifteen questions, each carrying two marks (Group A 3 questions, Group B, Group C and Group D 4 questions

More information

PG DIPLOMA EXAMINATION, DECEMBER INFORMATION TECHNOLOGY. Paper - I : Basics of Information Technology. Time : 3 Hours Maximum Marks : 70

PG DIPLOMA EXAMINATION, DECEMBER INFORMATION TECHNOLOGY. Paper - I : Basics of Information Technology. Time : 3 Hours Maximum Marks : 70 (PGDIT 01) PG DIPLOMA EXAMINATION, DECEMBER - 2015 Paper - I : Basics of Information Technology Answer any five questions from the following 1) Describe the pressures and responses of business in the information

More information

DATABASE MANAGEMENT SYSTEMS

DATABASE MANAGEMENT SYSTEMS www..com Code No: N0321/R07 Set No. 1 1. a) What is a Superkey? With an example, describe the difference between a candidate key and the primary key for a given relation? b) With an example, briefly describe

More information

LIST OF EXPERIMENTS. (1) (Office Automation)

LIST OF EXPERIMENTS. (1) (Office Automation) LIST OF EXPERIMENTS (1) 310042 (Office Automation) 1 Computer Fundamentals 2 DOS Command 3 Execute DOS Command using examples. 4 Introduction to windows & familarity with controls. 5 Introduction of Ms-Office

More information

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

University of Palestine. Final Exam 2 nd semester 2014/2015 Total Grade: 50 First Question Q1 B1 Choose the best Answer: No. of Branches (1) (10/50) 1) 2) 3) 4) Suppose we start with an empty stack and then perform the following operations: Push (A); Push (B); Pop; Push (C); Top;

More information

Department of Computer Science & Engineering School of Engineering & Technology HNB Garhwal University Srinagar Garhwal

Department of Computer Science & Engineering School of Engineering & Technology HNB Garhwal University Srinagar Garhwal Department of Computer Science & Engineering School of Engineering & Technology HNB Garhwal University Srinagar Garhwal Admission Notification for M. Tech. (Computer Science & Engineering) First Semester

More information

SARVEPALLI RADHAKRISHNAN UNIVERSITY, BHOPAL (M.P.) Scheme of Examination. First Semester-Master of Computer Application

SARVEPALLI RADHAKRISHNAN UNIVERSITY, BHOPAL (M.P.) Scheme of Examination. First Semester-Master of Computer Application Scheme of Examination First Semester-Master of Computer Application S.No Subject Subject Periods per Credits Maximum Marks Maximum Marks Total Code Name week (Theory Slot) (Practical Slot) Marks L T P

More information

1. (a) Elaborate the following operators in C language with exemplary use of each:

1. (a) Elaborate the following operators in C language with exemplary use of each: B.Sc (Information Technology) (Part-I) EXAMINATION, 2008 (C-Programming) Fourth Paper B.Sc. I.T.-06 Time allowed : Three Hours Maximum Marks : 50 Attempt any five questions. All questions carry equal marks.

More information

ANDHRA MAHILA SABHA ARTS & SCIENCE COLLEGE FOR WOMEN (AUTONOMOUS), NAAC Accredited O.U. CAMPUS, HYDERABAD.

ANDHRA MAHILA SABHA ARTS & SCIENCE COLLEGE FOR WOMEN (AUTONOMOUS), NAAC Accredited O.U. CAMPUS, HYDERABAD. ANDHRA MAHILA SABHA ARTS & SCIENCE COLLEGE FOR WOMEN (AUTONOMOUS), NAAC Accredited O.U. CAMPUS, HYDERABAD. Ist Year I Semester Programming in C Subject Code: Csc 101 Instruction 4 Hrs/ Week Duration of

More information

1) What is the role of information technology in modern organizations? 2) Discuss the memory and storage devices.

1) What is the role of information technology in modern organizations? 2) Discuss the memory and storage devices. (DMCA 101) ASSIGNMENT - 1, MAY-2014. PAPER- I : INFORMATION TECHNOLOGY 1) What is the role of information technology in modern organizations? 2) Discuss the memory and storage devices. 3) What is software?

More information

Seth Jai Parkash Polytechnic, Damla

Seth Jai Parkash Polytechnic, Damla Seth Jai Parkash Polytechnic, Damla Name of the Faculty: Ms Richa Kharbanda Discipline: Computer Engg. Semester: 4 th Subject: DATA STRUCTURES USING C Lesson Plan Duration: 15 weeks (from January, 2018

More information

OBJECT ORIENTED DATA STRUCTURE & ALGORITHMS

OBJECT ORIENTED DATA STRUCTURE & ALGORITHMS OBJECT ORIENTED DATA STRUCTURE & ALGORITHMS C++ PROGRAMMING LANGUAGE CONTENT C++ Language Contents: Introduction to C++ Language Difference and Similarities between C and C++ Role Of Compilers and Assemblers

More information

M.C.A. DEGREE EXAMINATION, MAY First Year Paper - I : INFORMATION TECHNOLOGY. Time : 03 Hours Maximum Marks : 75

M.C.A. DEGREE EXAMINATION, MAY First Year Paper - I : INFORMATION TECHNOLOGY. Time : 03 Hours Maximum Marks : 75 M.C.A. DEGREE EXAMINATION, MAY - 2013 First Year Paper - I : INFORMATION TECHNOLOGY (DMCA 101) Time : 03 Hours Maximum Marks : 75 Section - A (3 15 = 45) Answer any Three of the following 1) What is the

More information

(DMCA 101) M.C.A. DEGREE EXAMINATION, DEC First Year. Time : 03 Hours Maximum Marks : 75. Paper - I : INFORMATION TECHNOLOGY

(DMCA 101) M.C.A. DEGREE EXAMINATION, DEC First Year. Time : 03 Hours Maximum Marks : 75. Paper - I : INFORMATION TECHNOLOGY (DMCA 101) M.C.A. DEGREE EXAMINATION, DEC. - 2013 First Year Paper - I : INFORMATION TECHNOLOGY Time : 03 Hours Maximum Marks : 75 Section- A Answer any Three of the following (3 15=45) 1) What is the

More information

Programme Outcome COURSE OUTCOMES MCA

Programme Outcome COURSE OUTCOMES MCA Programme Outcome PO1: To provide trained human resource for the IT industry. COURSE OUTCOMES MCA MCA 101 : Object Oriented Programming CO1 The students develops a sound approach to problem solving using

More information

COURSE OUTCOMES OF M.Sc(IT)

COURSE OUTCOMES OF M.Sc(IT) COURSE OUTCOMES OF M.Sc(IT) Sr. No Subject Code Subject Name Sem-I CO Status Course Outcomes 1. A304101 PROGRAMMING USING C 2. A304102 FUNDAMENTALS OF COMPUTER & INFORMATION TECHNOLOGIES CO1 CO2 Understands

More information

CS301 - Data Structures Glossary By

CS301 - Data Structures Glossary By CS301 - Data Structures Glossary By Abstract Data Type : A set of data values and associated operations that are precisely specified independent of any particular implementation. Also known as ADT Algorithm

More information

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

Algorithm Class.   C C++ DS JAVA DATA STRUCTURES TRAINING INSTITUTE KPHB HYDERABAD. Mobile: C C++ DS JAVA DATA STRUCTURES TRAINING INSTITUTE KPHB HYDERABAD Algorithm Class Mobile: +91-9963930865 https://sites.google.com/site/algorithmclass Data Structures for interviews Course details By Algorithm

More information

mrrj izns k jktf kz V.Mu eqdr fo ofo ky;]bykgkckn

mrrj izns k jktf kz V.Mu eqdr fo ofo ky;]bykgkckn dk;zdze vf/ku;kl सत र 2018-19 Course Code: PGDCA-01 Discrete Mathematics 1. Answer the following: a. Out of 7 consonants and 4 vowels, how many words of 3 consonants and 2 vowels can be formed? b. In a

More information

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

Visit  ::: Original Website For Placement Papers. ::: Data Structure Data Structure 1. What is data structure? A data structure is a way of organizing data that considers not only the items stored, but also their relationship to each other. Advance knowledge about the relationship

More information

PGDCA SEMESTER-I PGDCA 101: PC SOFTWARE: Unit-1: Introduction

PGDCA SEMESTER-I PGDCA 101: PC SOFTWARE: Unit-1: Introduction PGDCA SEMESTER-I PGDCA 101: PC SOFTWARE: - Introduction to personal computer Concept of hardware & software, program, data processing, classification of PC software, Computer Applications. - Overview of

More information

Sai Nath University. Assignment For BCA 3 RD Sem.

Sai Nath University. Assignment For BCA 3 RD Sem. 1 Sai Nath University Assignment For BCA 3 RD Sem. The Assignment will consist of two parts, A and B. will have 5 short answer questions(40-60 words) of 4 marks each. will have 4 long answer questions

More information

Sai Nath University. Assignment For MCA 1 st

Sai Nath University. Assignment For MCA 1 st Sai Nath University Assignment For MCA 1 st Sem. The Assignment will consist of two parts, A and B. will have 5 short answer questions(40-60 words) of 4 marks each. will have 4 long answer questions of

More information

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

End-Term Examination Second Semester [MCA] MAY-JUNE 2006 (Please write your Roll No. immediately) Roll No. Paper Code: MCA-102 End-Term Examination Second Semester [MCA] MAY-JUNE 2006 Subject: Data Structure Time: 3 Hours Maximum Marks: 60 Note: Question 1.

More information

GATE 2018 Online Test Series - Computer science Engineering

GATE 2018 Online Test Series - Computer science Engineering Test Difficulty No of Max Test Type of test Test Live from Test details Test Syllabus No level questions Marks duration 1 Engineering Mathematics-I Linear Algebra,Statistics 2 Engineering Mathematics-II

More information

Problem solving using standard programming techniques and Turbo C compiler.

Problem solving using standard programming techniques and Turbo C compiler. Course Outcome First Year of B.Sc. IT Program Semester I Course Number:USIT 101 Course Name: Imperative Programming Introduces programming principles and fundamentals of programming. The ability to write

More information

Course Title : Computer Fundamentals & Programming in C. SLM Code : C-101. All questions carry equal marks. Total Marks : 20

Course Title : Computer Fundamentals & Programming in C. SLM Code : C-101. All questions carry equal marks. Total Marks : 20 Course Code : MCA -1 Course Title : Computer Fundamentals & Programming in C SLM Code : C-101 Assignment No. : MCA -1/ C-101/C-2018 Q.1 What is the advantages of using Hexadecimal numbers? Q.2 What do

More information

Total No. of Questions :09] [Total No. of Pages : 02. II/IV B.Tech. DEGREE EXAMINATIONS, NOV/DEC First Semester CSE/IT DATA STRUCTURES USING C

Total No. of Questions :09] [Total No. of Pages : 02. II/IV B.Tech. DEGREE EXAMINATIONS, NOV/DEC First Semester CSE/IT DATA STRUCTURES USING C CSE/IT 216 (CR) Total No. of Questions :09] [Total No. of Pages : 02 Time: Three Hours 1. a. ADT II/IV B.Tech. DEGREE EXAMINATIONS, NOV/DEC- 2015 First Semester CSE/IT DATA STRUCTURES USING C Answer Question

More information

Topic wise Tests. Number Systems,Boolean Expression, Boolean Laws & K-maps

Topic wise Tests. Number Systems,Boolean Expression, Boolean Laws & K-maps Test No Topic code Topic CSIT-01 CSIT-02 CSIT-03 CSIT-04 GDL 1 (Digital Logic) GDL 2 (Digital Logic) GCO 1 (Computer Organization) GCO 2 (Computer Organization) Number Systems,Boolean Expression, Boolean

More information

Assignment No.1 What is ADT? Explain stack as an ADT with suitable example.

Assignment No.1 What is ADT? Explain stack as an ADT with suitable example. Programme:- MCA-Semester-II Subject Code 201 Data Structures What is ADT? Explain stack as an ADT with suitable example. You know what a queue is... Implement a queue class with Java. What is the cost

More information

Abstract Data Structures IB Computer Science. Content developed by Dartford Grammar School Computer Science Department

Abstract Data Structures IB Computer Science. Content developed by Dartford Grammar School Computer Science Department Abstract Data Structures IB Computer Science Content developed by Dartford Grammar School Computer Science Department HL Topics 1-7, D1-4 1: System design 2: Computer Organisation 3: Networks 4: Computational

More information

A6-R3: DATA STRUCTURE THROUGH C LANGUAGE

A6-R3: DATA STRUCTURE THROUGH C LANGUAGE A6-R3: DATA STRUCTURE THROUGH C LANGUAGE NOTE: 1. There are TWO PARTS in this Module/Paper. PART ONE contains FOUR questions and PART TWO contains FIVE questions. 2. PART ONE is to be answered in the TEAR-OFF

More information

17CS33:Data Structures Using C QUESTION BANK

17CS33:Data Structures Using C QUESTION BANK 17CS33:Data Structures Using C QUESTION BANK REVIEW OF STRUCTURES AND POINTERS, INTRODUCTION TO SPECIAL FEATURES OF C Learn : Usage of structures, unions - a conventional tool for handling a group of logically

More information

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

QUESTION BANK. Prepared by,mrs.d.maladhy AP/IT,RGCET. Page 1 UNIT I 1.Write statements to declare integer Pointer and Float Pointer. Also write the statement to convert float pointer.(apr/may 2016) 2. What is a Stack? Mention the order followed to add or delete

More information

Deccan Education Society s FERGUSSON COLLEGE, PUNE (AUTONOMOUS) SYLLABUS UNDER AUTONOMY. FIRST YEAR B.Sc. COMPUTER SCIENCE SEMESTER I

Deccan Education Society s FERGUSSON COLLEGE, PUNE (AUTONOMOUS) SYLLABUS UNDER AUTONOMY. FIRST YEAR B.Sc. COMPUTER SCIENCE SEMESTER I Deccan Education Society s FERGUSSON COLLEGE, PUNE (AUTONOMOUS) SYLLABUS UNDER AUTONOMY FIRST YEAR B.Sc. COMPUTER SCIENCE SEMESTER I SYLLABUS OF COMPUTER SCIENCE Academic Year 2016-2017 Deccan Education

More information