The document contains solved question papers from June 2015 and December 2015 for Programming in C & Data Structures examinations. It includes questions ranging from basic C programming concepts like data types, operators, decision making and looping statements to more advanced topics such as arrays, strings, structures, files and pointers. For each question, the relevant concept is explained and examples are provided. Solutions for some programming problems involving simple calculations, palindrome checks and file handling are also presented.
Part B CS8391 Data Structures Part B Questions compiled from R2008 & R2013 to help the students of Affiliated Colleges appearing for Ann University Examination
Part B CS8391 Data Structures Part B Questions compiled from R2008 & R2013 to help the students of Affiliated Colleges appearing for Ann University Examination
Artificial Intelligence: Introduction, Typical Applications. State Space Search: Depth Bounded
DFS, Depth First Iterative Deepening. Heuristic Search: Heuristic Functions, Best First Search,
Hill Climbing, Variable Neighborhood Descent, Beam Search, Tabu Search. Optimal Search: A
*
algorithm, Iterative Deepening A*
, Recursive Best First Search, Pruning the CLOSED and OPEN
Lists
Artificial Intelligence - A modern approach 3edRohanMistry15
Artificial Intelligence: A Modern Approach, 4th US ed.
Artificial Intelligence: A Modern Approach, 3e offers the most comprehensive, up-to-date introduction to the theory and practice of artificial intelligence. Number one in its field, this textbook is ideal for one or two-semester, undergraduate or graduate-level courses in Artificial Intelligence.
Dr. Peter Norvig, contributing Artificial Intelligence author and Professor Sebastian Thrun, a Pearson author are offering a free online course at Stanford University on artificial intelligence.
According to an article in The New York Times, the course on artificial intelligence is “one of three being offered experimentally by the Stanford computer science department to extend technology knowledge and skills beyond this elite campus to the entire world.” One of the other two courses, an introduction to database software, is being taught by Pearson author Dr. Jennifer Widom.
About the Author
Stuart Russell was born in 1962 in Portsmouth, England. He received his B.A. with first-class honours in physics from Oxford University in 1982, and his Ph.D. in computer science from Stanford in 1986. He then joined the faculty of the University of California at Berkeley, where he is a professor of computer science, director of the Center for Intelligent Systems, and holder of the Smith–Zadeh Chair in Engineering. In 1990, he received the Presidential Young Investigator Award of the National Science Foundation, and in 1995 he was cowinner of the Computers and Thought Award. He was a 1996 Miller Professor of the University of California and was appointed to a Chancellor’s Professorship in 2000. In 1998, he gave the Forsythe Memorial Lectures at Stanford University. He is a Fellow and former Executive Council member of the American Association for Artificial Intelligence. He has published over 100 papers on a wide range of topics in artificial intelligence. His other books include The Use of Knowledge in Analogy and Induction and (with Eric Wefald) Do the Right Thing: Studies in Limited Rationality.
Peter Norvig is currently Director of Research at Google, Inc., and was the director responsible for the core Web search algorithms from 2002 to 2005. He is a Fellow of the American Association for Artificial Intelligence and the Association for Computing Machinery. Previously, he was head of the Computational Sciences Division at NASA Ames Research Center, where he oversaw NASA’s research and development in artificial intelligence and robotics, and chief scientist at Junglee, where he helped develop one of the first Internet information extraction services. He received a B.S. in applied mathematics from Brown University and a Ph.D. in computer science from the University of California at Berkeley. He received the Distinguished Alumni and Engineering Innovation awards from Berkeley and the Exceptional Achievement Medal from NASA.
A detailed note on the Fourier Transform of the Unit Step Signal. This text explains the various approaches used in the evaluation of the Fourier transform of the unit step signal.
1. Introduction to time and space complexity.
2. Different types of asymptotic notations and their limit definitions.
3. Growth of functions and types of time complexities.
4. Space and time complexity analysis of various algorithms.
Artificial Intelligence: Introduction, Typical Applications. State Space Search: Depth Bounded
DFS, Depth First Iterative Deepening. Heuristic Search: Heuristic Functions, Best First Search,
Hill Climbing, Variable Neighborhood Descent, Beam Search, Tabu Search. Optimal Search: A
*
algorithm, Iterative Deepening A*
, Recursive Best First Search, Pruning the CLOSED and OPEN
Lists
Artificial Intelligence - A modern approach 3edRohanMistry15
Artificial Intelligence: A Modern Approach, 4th US ed.
Artificial Intelligence: A Modern Approach, 3e offers the most comprehensive, up-to-date introduction to the theory and practice of artificial intelligence. Number one in its field, this textbook is ideal for one or two-semester, undergraduate or graduate-level courses in Artificial Intelligence.
Dr. Peter Norvig, contributing Artificial Intelligence author and Professor Sebastian Thrun, a Pearson author are offering a free online course at Stanford University on artificial intelligence.
According to an article in The New York Times, the course on artificial intelligence is “one of three being offered experimentally by the Stanford computer science department to extend technology knowledge and skills beyond this elite campus to the entire world.” One of the other two courses, an introduction to database software, is being taught by Pearson author Dr. Jennifer Widom.
About the Author
Stuart Russell was born in 1962 in Portsmouth, England. He received his B.A. with first-class honours in physics from Oxford University in 1982, and his Ph.D. in computer science from Stanford in 1986. He then joined the faculty of the University of California at Berkeley, where he is a professor of computer science, director of the Center for Intelligent Systems, and holder of the Smith–Zadeh Chair in Engineering. In 1990, he received the Presidential Young Investigator Award of the National Science Foundation, and in 1995 he was cowinner of the Computers and Thought Award. He was a 1996 Miller Professor of the University of California and was appointed to a Chancellor’s Professorship in 2000. In 1998, he gave the Forsythe Memorial Lectures at Stanford University. He is a Fellow and former Executive Council member of the American Association for Artificial Intelligence. He has published over 100 papers on a wide range of topics in artificial intelligence. His other books include The Use of Knowledge in Analogy and Induction and (with Eric Wefald) Do the Right Thing: Studies in Limited Rationality.
Peter Norvig is currently Director of Research at Google, Inc., and was the director responsible for the core Web search algorithms from 2002 to 2005. He is a Fellow of the American Association for Artificial Intelligence and the Association for Computing Machinery. Previously, he was head of the Computational Sciences Division at NASA Ames Research Center, where he oversaw NASA’s research and development in artificial intelligence and robotics, and chief scientist at Junglee, where he helped develop one of the first Internet information extraction services. He received a B.S. in applied mathematics from Brown University and a Ph.D. in computer science from the University of California at Berkeley. He received the Distinguished Alumni and Engineering Innovation awards from Berkeley and the Exceptional Achievement Medal from NASA.
A detailed note on the Fourier Transform of the Unit Step Signal. This text explains the various approaches used in the evaluation of the Fourier transform of the unit step signal.
1. Introduction to time and space complexity.
2. Different types of asymptotic notations and their limit definitions.
3. Growth of functions and types of time complexities.
4. Space and time complexity analysis of various algorithms.
This is a Question Papers of Mumbai University for B.Sc.IT Student of Semester - III [Advanced SQL] (Revised Course). [Year - April / 2014] . . .Solution Set of this Paper is Coming soon...
[Question Paper] ASP.NET With C# (60:40 Pattern) [April / 2014]Mumbai B.Sc.IT Study
This is a Question Papers of Mumbai University for B.Sc.IT Student of Semester - V [ASP.NET With C#] (60:40 Pattern). [Year - April / 2014] . . . Solution Set of this Paper is Coming soon . . .
This is a Question Papers of Mumbai University for B.Sc.IT Student of Semester - IV [C++ and Java] (Old Course). [Year - June / 2014] . . . Solution Set of this Paper is Coming soon . . .
[Question Paper] Object Oriented Programming With C++ (Revised Course) [Janua...Mumbai B.Sc.IT Study
This is a Question Papers of Mumbai University for B.Sc.IT Student of Semester - III [Object Oriented Programming With C++] (Revised Course). [Year - January / 2017] . . . Solution Set of this Paper is Coming soon . . .
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
Immunizing Image Classifiers Against Localized Adversary Attacksgerogepatton
This paper addresses the vulnerability of deep learning models, particularly convolutional neural networks
(CNN)s, to adversarial attacks and presents a proactive training technique designed to counter them. We
introduce a novel volumization algorithm, which transforms 2D images into 3D volumetric representations.
When combined with 3D convolution and deep curriculum learning optimization (CLO), itsignificantly improves
the immunity of models against localized universal attacks by up to 40%. We evaluate our proposed approach
using contemporary CNN architectures and the modified Canadian Institute for Advanced Research (CIFAR-10
and CIFAR-100) and ImageNet Large Scale Visual Recognition Challenge (ILSVRC12) datasets, showcasing
accuracy improvements over previous techniques. The results indicate that the combination of the volumetric
input and curriculum learning holds significant promise for mitigating adversarial attacks without necessitating
adversary training.
Explore the innovative world of trenchless pipe repair with our comprehensive guide, "The Benefits and Techniques of Trenchless Pipe Repair." This document delves into the modern methods of repairing underground pipes without the need for extensive excavation, highlighting the numerous advantages and the latest techniques used in the industry.
Learn about the cost savings, reduced environmental impact, and minimal disruption associated with trenchless technology. Discover detailed explanations of popular techniques such as pipe bursting, cured-in-place pipe (CIPP) lining, and directional drilling. Understand how these methods can be applied to various types of infrastructure, from residential plumbing to large-scale municipal systems.
Ideal for homeowners, contractors, engineers, and anyone interested in modern plumbing solutions, this guide provides valuable insights into why trenchless pipe repair is becoming the preferred choice for pipe rehabilitation. Stay informed about the latest advancements and best practices in the field.
Welcome to WIPAC Monthly the magazine brought to you by the LinkedIn Group Water Industry Process Automation & Control.
In this month's edition, along with this month's industry news to celebrate the 13 years since the group was created we have articles including
A case study of the used of Advanced Process Control at the Wastewater Treatment works at Lleida in Spain
A look back on an article on smart wastewater networks in order to see how the industry has measured up in the interim around the adoption of Digital Transformation in the Water Industry.
Overview of the fundamental roles in Hydropower generation and the components involved in wider Electrical Engineering.
This paper presents the design and construction of hydroelectric dams from the hydrologist’s survey of the valley before construction, all aspects and involved disciplines, fluid dynamics, structural engineering, generation and mains frequency regulation to the very transmission of power through the network in the United Kingdom.
Author: Robbie Edward Sayers
Collaborators and co editors: Charlie Sims and Connor Healey.
(C) 2024 Robbie E. Sayers
VTU 1ST SEM PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPERS OF JUNE-2015 & DECEMBER-2015
1.
2. For Solved Question Papers of UGC-NET/GATE/SET/PGCET in Computer Science, visit http://victory4sure.weebly.com/
3. For Solved Question Papers of UGC-NET/GATE/SET/PGCET in Computer Science, visit http://victory4sure.weebly.com/
4. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER JUNE- 2015
1
1 a. What are data types? Mention the different data types supported by C language,
giving an example to each. (5 Marks)
Ans:
1 b. Write a C program which takes as input p, t, r. Compute the simple interest and
display the result. (5 Marks)
Ans:
5. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER JUNE- 2015
2
1 c. What is an operator? List and explain various types of operators. (10 Marks)
Ans:
7. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER JUNE- 2015
4
2 a. What is a token? What are the different types of tokens available in C language?
Explain. (08 Marks)
Ans:
8. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER JUNE- 2015
5
2 b. Write C expressions corresponding to the following (Assume all quantities are of
same type) (06 Marks)
Ans:
2 c. What is the value of ‘x’ in the following code segments? Justify your answers:
(06 Marks)
Ans:
9. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER JUNE- 2015
6
3 a. What are the different types of conditional decision making statements? Explain
each with example. (10 Marks)
Ans:
12. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER JUNE- 2015
9
3 b. Write a C program to simulate simple calculator that performs arithmetic
operations using switch statements. Error message should be displayed, if any
attempt is to made to divide by zero. (10 Marks)
Ans:
13. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER JUNE- 2015
10
4 a. Explain with example formatted input output statements in C. (06 Marks)
Ans:
14. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER JUNE- 2015
11
4 b. List four differences between while loop and do-while loop along with syntax
and example. (06 Marks)
Ans:
15. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER JUNE- 2015
12
4 c. Design and develop a C program to reverse a given four digit integer number
and check whether it is a palindrome or not. (08 Marks)
Ans:
16. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER JUNE- 2015
13
5 a. What is an array? Explain different methods of initialization of single
dimensional arrays. (06 Marks)
Ans:
18. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER JUNE- 2015
15
5 b. Write a C program to read N integers into an array A and to
i) find the sum of odd numbers
ii) find the sum of even numbers
iii) find the average of all numbers
Output the results computed with appropriate headings. (06 Marks)
Ans:
19. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER JUNE- 2015
16
5 c. How string is declared and initialized? Explain any FOUR string manipulation
functions with examples. (08 Marks)
Ans:
21. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER JUNE- 2015
18
6 a. Explain function call, function definition and function prototype with examples
to each. (06 Marks)
Ans:
22. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER JUNE- 2015
19
6 b. What are actual parameters and formal parameters? Illustrate with example.
(06 Marks)
Ans:
6 c. What is recursion? Write a C program to compute the factorial of a given number
‘n’ using recursion. (08 Marks)
Ans:
23. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER JUNE- 2015
20
7 a. How structure is different from an array? Explain declaration of a structure with
an example. (06 Marks)
Ans:
24. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER JUNE- 2015
21
7 b. Explain with an example, how to create a structure using ‘typedef’. (04 Marks)
Ans:
25. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER JUNE- 2015
22
7 c. Write a C program to input the following details of ‘N’ students using structure:
Roll No: integer, name: string, marks: float, grade: char
Print the names of the students with marks >= 60.0%. (10 Marks)
Ans:
26. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER JUNE- 2015
23
8 a. Explain following file operations along with syntax and examples:
i)fopen() ii)fclose() iii)fscanf() iv) fprintf() v)fgets(). (10 Marks)
Ans:
27. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER JUNE- 2015
24
8 b. Write a C program to read the contents from the file called abc: text, count the
number of characters, number of lines and number of white spaces and output the
same. (10 Marks)
Ans:
28. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER JUNE- 2015
25
8 a. Define pointer variable. Explain with an example, the declaration and
initialization of pointer variable. (06 Marks)
Ans:
29. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER JUNE- 2015
26
8 b. Explain following C functions along with syntax and example to each.
i) malloc() ii) calloc() iii) realloc iv) free() (08 Marks)
Ans:
30. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER JUNE- 2015
27
8 c. Develop a C program to read two numbers and function to swap these numbers
using pointers. (06 Marks)
Ans:
31. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER JUNE- 2015
28
10 . Write short notes on following:
a. Preprocessor directives
b. Primitive and non primitive data types
c. Stack operations
d. Types of queues. (20 Marks)
Ans:
a)
32. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER JUNE- 2015
29
Ans:
b)
Ans:
c)
33. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER JUNE- 2015
30
Ans:
d)
34. For Solved Question Papers of UGC-NET/GATE/SET/PGCET in Computer Science, visit http://victory4sure.weebly.com/
35. For Solved Question Papers of UGC-NET/GATE/SET/PGCET in Computer Science, visit http://victory4sure.weebly.com/
36. For Solved Question Papers of UGC-NET/GATE/SET/PGCET in Computer Science, visit http://victory4sure.weebly.com/
37. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER DEC- 2015
1
1 a. Explain the structure of ‘C’ program with example. (5 Marks)
Ans:
38. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER DEC- 2015
2
1 b. Explain scanf() and printf() function in ‘C’ language with syntax and examples.
(5 Marks)
Ans: For answer, refer Solved Paper June-2015 Q.No.4a.
1 c. Write a ‘C’ program to find area of circle. (5 Marks)
Ans:
2 a. What is an algorithm? Write an algorithm to find largest of 3 numbers. (5 Marks)
Ans:
39. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER DEC- 2015
3
2 b. Explain the following operators in ‘C’ language.
i) Relational ii) Conditional iii) Logical (5 Marks)
Ans:
40. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER DEC- 2015
4
2 c. What is an identifier? Give any 5 rules that are to be followed while declaring a
variable. (4 Marks)
Ans:
41. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER DEC- 2015
5
3 a. Explain the ELSE IF ladder with syntax and example. (8 Marks)
Ans:
42. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER DEC- 2015
6
3 b. List the types of loops. Explain the working of any one type of loop with syntax
and example. (8 Marks)
Ans:
43. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER DEC- 2015
7
3 b. Write a program to read a year as an input and find whether it is a LEAP YEAR or
not (8 Marks)
Ans:
44. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER DEC- 2015
8
4 a. Explain SWITCH statement, with syntax and example. (8 Marks)
Ans:
4 b. Differentiate between WHILE and DO-WHILE loops. (6 Marks)
Ans: For answer, refer Solved Paper June-2015 Q.No.4b.
4 c. Write a program to find reverse of a number and check whether it is a
PALINDROME or not (6 Marks)
Ans: For answer, refer Solved Paper June-2015 Q.No.4c.
45. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER DEC- 2015
9
5 a. What is an ARRAY? Explain the different ways of initializing an array with
examples. (7 Marks)
Ans: For answer, refer Solved Paper June-2015 Q.No.5a.
5 b. What are the advantages of using User defined functions. (6 Marks)
Ans:
46. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER DEC- 2015
10
5 c. Write a program to read a sentence and print the frequencies of each VOWEL
and total count of CONSONANTS. (7 Marks)
Ans:
47. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER DEC- 2015
11
6 a. Explain the different types of arrays, with syntax and examples. (7 Marks)
Ans:
48. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER DEC- 2015
12
6 b. Explain any 4 string manipulating functions with examples. (8 Marks)
Ans:
50. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER DEC- 2015
14
6 c. Define the following:
i) Actual parameter
ii) Formal parameter
iii) Global variable (external variable)
iv) Local variable (automatic variable) (5 Marks)
Ans:
7 a. Define a STRUCTURE. Explain structure with syntax and example. (5 Marks)
Ans: For answer, refer Solved Paper June-2015 Q.No.7a.
51. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER DEC- 2015
15
7 b. What is a FILE? Explain any 2 FILE functions, with example. (5 Marks)
Ans:
7 c. Write a program to maintain a record 0f ‘n’ student details using an array of
structures with four fields (Roll number, Name, Marks, and Grade). Each field is of a
appropriate data type. Print the marks of the students based on the student name as
input (10 Marks)
Ans: Ans: For answer, refer Solved Paper June-2015 Q.No.7c.
52. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER DEC- 2015
16
8 a. Differntiate between STRUCTURES and UNIONS. (5 Marks)
Ans:
8 b. Explain the various MODES in which a FILE can be created successfully. (5
Marks)
Ans:
53. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER DEC- 2015
17
8 c. Given 2 university information files ‘student.txt’ and ‘usn.txt’ that contains
students Name and USN respectively. Write a program to create a new file called
‘output.txt’ and copy and contents of files ‘studentname.txt’ and ‘usn.txt’ into output
file in the sequence shown below. (10 Marks)
Ans:
54. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER DEC- 2015
18
9 a. Define a POINTER. Explain how pointer variable is declared and initialized. (6
Marks)
Ans: For answer, refer Solved Paper June-2015 Q.No.9a.
9 b. What are primitive and non-primitive data types? Give examples. (6 Marks)
Ans: For answer, refer Solved Paper June-2015 Q.No.10b.
9 c. Write a program using pointers to compute sum, mean and standard deviation
of all elements stored in an array of ‘n’ real numbers. (8 Marks)
Ans:
55. PROGRAMMING IN C & DATA STRUCTURES SOLVED PAPER DEC- 2015
19
10 a. Explain any 2 pre-processor directives in ‘C’ language. (5 Marks)
Ans: For answer, refer Solved Paper June-2015 Q.No.10a.
10 b. What is a STACK? Explain its applications. (5 Marks)
Ans:
10 c. What is a QUEUE? Explain with example. (5 Marks)
Ans:
10 d. Write a program to swap 2 numbers using call-by-refernce method. (5 Marks)
Ans: For answer, refer Solved Paper June-2015 Q.No.9c.